From 3119a533e087f5ee3a9db3ef479ad57f9706bec2 Mon Sep 17 00:00:00 2001 From: Keewon Seo Date: Mon, 10 Feb 2020 20:18:46 +0900 Subject: [PATCH 1/3] remove old priv/zstd --- priv/zstd/.buckconfig | 9 - priv/zstd/.buckversion | 1 - priv/zstd/.gitattributes | 24 - priv/zstd/.gitignore | 42 - priv/zstd/.travis.yml | 61 - priv/zstd/CONTRIBUTING.md | 42 - priv/zstd/COPYING | 339 - priv/zstd/LICENSE | 30 - priv/zstd/Makefile | 346 - priv/zstd/NEWS | 348 - priv/zstd/README.md | 150 - priv/zstd/TESTING.md | 44 - priv/zstd/appveyor.yml | 240 - priv/zstd/build/.gitignore | 20 - priv/zstd/build/README.md | 56 - priv/zstd/build/VS2010/CompileAsCpp.props | 8 - .../zstd/build/VS2010/datagen/datagen.vcxproj | 167 - .../fullbench-dll/fullbench-dll.vcxproj | 185 - .../build/VS2010/fullbench/fullbench.vcxproj | 202 - priv/zstd/build/VS2010/fuzzer/fuzzer.vcxproj | 207 - .../build/VS2010/libzstd-dll/libzstd-dll.rc | 51 - .../VS2010/libzstd-dll/libzstd-dll.vcxproj | 243 - .../zstd/build/VS2010/libzstd/libzstd.vcxproj | 240 - priv/zstd/build/VS2010/zstd.sln | 89 - priv/zstd/build/VS_scripts/README.md | 54 - priv/zstd/build/VS_scripts/build.VS2010.cmd | 7 - priv/zstd/build/VS_scripts/build.VS2012.cmd | 6 - priv/zstd/build/VS_scripts/build.VS2013.cmd | 7 - priv/zstd/build/VS_scripts/build.VS2015.cmd | 7 - priv/zstd/build/VS_scripts/build.generic.cmd | 52 - priv/zstd/build/cmake/.gitignore | 7 - priv/zstd/build/cmake/CMakeLists.txt | 79 - .../AddZstdCompilationFlags.cmake | 67 - .../CMakeModules/GetZstdLibraryVersion.cmake | 9 - priv/zstd/build/cmake/contrib/CMakeLists.txt | 13 - .../cmake/contrib/gen_html/CMakeLists.txt | 30 - .../build/cmake/contrib/pzstd/CMakeLists.txt | 32 - priv/zstd/build/cmake/lib/.gitignore | 2 - priv/zstd/build/cmake/lib/CMakeLists.txt | 183 - .../build/cmake/lib/cmake_uninstall.cmake.in | 22 - priv/zstd/build/cmake/lib/pkgconfig.cmake | 1 - priv/zstd/build/cmake/programs/.gitignore | 5 - priv/zstd/build/cmake/programs/CMakeLists.txt | 97 - priv/zstd/build/cmake/tests/.gitignore | 7 - priv/zstd/build/cmake/tests/CMakeLists.txt | 55 - priv/zstd/circle.yml | 63 - priv/zstd/contrib/VS2005/README.md | 3 - .../contrib/VS2005/fullbench/fullbench.vcproj | 440 - priv/zstd/contrib/VS2005/fuzzer/fuzzer.vcproj | 488 - priv/zstd/contrib/VS2005/zstd.sln | 55 - .../contrib/VS2005/zstdlib/zstdlib.vcproj | 562 - .../contrib/adaptive-compression/Makefile | 76 - .../contrib/adaptive-compression/README.md | 91 - .../zstd/contrib/adaptive-compression/adapt.c | 1137 -- .../contrib/adaptive-compression/datagencli.c | 129 - .../adaptive-compression/test-correctness.sh | 252 - .../adaptive-compression/test-performance.sh | 59 - priv/zstd/contrib/cleanTabs | 2 - priv/zstd/contrib/gen_html/.gitignore | 3 - priv/zstd/contrib/gen_html/Makefile | 51 - priv/zstd/contrib/gen_html/README.md | 31 - priv/zstd/contrib/gen_html/gen-zstd-manual.sh | 9 - priv/zstd/contrib/gen_html/gen_html.cpp | 224 - priv/zstd/contrib/linux-kernel/.gitignore | 4 - .../linux-kernel/0000-cover-letter.patch | 122 - .../0001-lib-Add-xxhash-module.patch | 862 - .../0002-lib-Add-zstd-modules.patch | 13285 ---------------- .../0003-btrfs-Add-zstd-support.patch | 740 - .../0004-squashfs-Add-zstd-support.patch | 306 - .../0005-crypto-Add-zstd-support.patch | 424 - ...0006-squashfs-tools-Add-zstd-support.patch | 420 - priv/zstd/contrib/linux-kernel/COPYING | 339 - priv/zstd/contrib/linux-kernel/README.md | 101 - .../contrib/linux-kernel/btrfs-benchmark.sh | 104 - .../linux-kernel/btrfs-extract-benchmark.sh | 99 - .../zstd/contrib/linux-kernel/fs/btrfs/zstd.c | 432 - .../linux-kernel/fs/squashfs/zstd_wrapper.c | 151 - .../linux-kernel/include/linux/xxhash.h | 236 - .../contrib/linux-kernel/include/linux/zstd.h | 1155 -- priv/zstd/contrib/linux-kernel/kernelize.sh | 110 - .../contrib/linux-kernel/lib/Kconfig.diff | 19 - .../contrib/linux-kernel/lib/Makefile.diff | 13 - priv/zstd/contrib/linux-kernel/lib/xxhash.c | 500 - .../linux-kernel/lib/zstd/.clang-format | 11 - .../contrib/linux-kernel/lib/zstd/Makefile | 18 - .../contrib/linux-kernel/lib/zstd/bitstream.h | 374 - .../contrib/linux-kernel/lib/zstd/compress.c | 3482 ---- .../linux-kernel/lib/zstd/decompress.c | 2526 --- .../linux-kernel/lib/zstd/entropy_common.c | 243 - .../linux-kernel/lib/zstd/error_private.h | 51 - priv/zstd/contrib/linux-kernel/lib/zstd/fse.h | 575 - .../linux-kernel/lib/zstd/fse_compress.c | 795 - .../linux-kernel/lib/zstd/fse_decompress.c | 332 - priv/zstd/contrib/linux-kernel/lib/zstd/huf.h | 212 - .../linux-kernel/lib/zstd/huf_compress.c | 770 - .../linux-kernel/lib/zstd/huf_decompress.c | 960 -- priv/zstd/contrib/linux-kernel/lib/zstd/mem.h | 149 - .../linux-kernel/lib/zstd/zstd_common.c | 73 - .../linux-kernel/lib/zstd/zstd_internal.h | 261 - .../contrib/linux-kernel/lib/zstd/zstd_opt.h | 1012 -- .../linux-kernel/squashfs-benchmark.sh | 39 - .../zstd/contrib/linux-kernel/test/.gitignore | 1 - .../linux-kernel/test/DecompressCrash.c | 85 - priv/zstd/contrib/linux-kernel/test/Makefile | 43 - .../linux-kernel/test/RoundTripCrash.c | 162 - .../linux-kernel/test/UserlandTest.cpp | 565 - .../linux-kernel/test/XXHashUserlandTest.cpp | 166 - .../linux-kernel/test/include/asm/unaligned.h | 177 - .../test/include/linux/compiler.h | 12 - .../linux-kernel/test/include/linux/errno.h | 6 - .../linux-kernel/test/include/linux/kernel.h | 16 - .../linux-kernel/test/include/linux/math64.h | 11 - .../linux-kernel/test/include/linux/module.h | 10 - .../linux-kernel/test/include/linux/string.h | 1 - .../linux-kernel/test/include/linux/types.h | 2 - priv/zstd/contrib/linux-kernel/xxhash_test.c | 185 - .../contrib/linux-kernel/zstd_compress_test.c | 279 - .../linux-kernel/zstd_decompress_test.c | 250 - .../contrib/long_distance_matching/Makefile | 36 - .../contrib/long_distance_matching/README.md | 102 - .../zstd/contrib/long_distance_matching/ldm.c | 856 - .../zstd/contrib/long_distance_matching/ldm.h | 197 - .../long_distance_matching/ldm_common.c | 109 - .../long_distance_matching/ldm_params.h | 12 - .../contrib/long_distance_matching/main.c | 269 - priv/zstd/contrib/meson/README | 3 - priv/zstd/contrib/meson/meson.build | 116 - priv/zstd/contrib/meson/meson_options.txt | 2 - priv/zstd/contrib/pzstd/.gitignore | 2 - priv/zstd/contrib/pzstd/BUCK | 72 - priv/zstd/contrib/pzstd/ErrorHolder.h | 54 - priv/zstd/contrib/pzstd/Logging.h | 72 - priv/zstd/contrib/pzstd/Makefile | 269 - priv/zstd/contrib/pzstd/Options.cpp | 439 - priv/zstd/contrib/pzstd/Options.h | 68 - priv/zstd/contrib/pzstd/Pzstd.cpp | 618 - priv/zstd/contrib/pzstd/Pzstd.h | 150 - priv/zstd/contrib/pzstd/README.md | 56 - priv/zstd/contrib/pzstd/SkippableFrame.cpp | 30 - priv/zstd/contrib/pzstd/SkippableFrame.h | 64 - priv/zstd/contrib/pzstd/images/Cspeed.png | Bin 69804 -> 0 bytes priv/zstd/contrib/pzstd/images/Dspeed.png | Bin 26335 -> 0 bytes priv/zstd/contrib/pzstd/main.cpp | 27 - priv/zstd/contrib/pzstd/test/BUCK | 37 - priv/zstd/contrib/pzstd/test/OptionsTest.cpp | 536 - priv/zstd/contrib/pzstd/test/PzstdTest.cpp | 149 - priv/zstd/contrib/pzstd/test/RoundTrip.h | 86 - .../zstd/contrib/pzstd/test/RoundTripTest.cpp | 86 - priv/zstd/contrib/pzstd/utils/BUCK | 75 - priv/zstd/contrib/pzstd/utils/Buffer.h | 99 - priv/zstd/contrib/pzstd/utils/FileSystem.h | 94 - priv/zstd/contrib/pzstd/utils/Likely.h | 28 - priv/zstd/contrib/pzstd/utils/Range.h | 131 - priv/zstd/contrib/pzstd/utils/ResourcePool.h | 96 - priv/zstd/contrib/pzstd/utils/ScopeGuard.h | 50 - priv/zstd/contrib/pzstd/utils/ThreadPool.h | 58 - priv/zstd/contrib/pzstd/utils/WorkQueue.h | 181 - priv/zstd/contrib/pzstd/utils/test/BUCK | 35 - .../contrib/pzstd/utils/test/BufferTest.cpp | 89 - .../contrib/pzstd/utils/test/RangeTest.cpp | 82 - .../pzstd/utils/test/ResourcePoolTest.cpp | 72 - .../pzstd/utils/test/ScopeGuardTest.cpp | 28 - .../pzstd/utils/test/ThreadPoolTest.cpp | 71 - .../pzstd/utils/test/WorkQueueTest.cpp | 282 - .../seekable_format/examples/.gitignore | 4 - .../contrib/seekable_format/examples/Makefile | 42 - .../examples/parallel_compression.c | 215 - .../examples/parallel_processing.c | 194 - .../examples/seekable_compression.c | 132 - .../examples/seekable_decompression.c | 138 - .../contrib/seekable_format/zstd_seekable.h | 184 - .../zstd_seekable_compression_format.md | 116 - .../seekable_format/zstdseek_compress.c | 366 - .../seekable_format/zstdseek_decompress.c | 462 - priv/zstd/doc/README.md | 20 - priv/zstd/doc/educational_decoder/Makefile | 34 - priv/zstd/doc/educational_decoder/README.md | 29 - priv/zstd/doc/educational_decoder/harness.c | 125 - .../doc/educational_decoder/zstd_decompress.c | 2303 --- .../doc/educational_decoder/zstd_decompress.h | 58 - priv/zstd/doc/images/Cspeed4.png | Bin 71276 -> 0 bytes priv/zstd/doc/images/DCspeed5.png | Bin 69278 -> 0 bytes priv/zstd/doc/images/Dspeed4.png | Bin 24692 -> 0 bytes priv/zstd/doc/images/dict-cr.png | Bin 90047 -> 0 bytes priv/zstd/doc/images/dict-cs.png | Bin 93837 -> 0 bytes priv/zstd/doc/images/dict-ds.png | Bin 89590 -> 0 bytes priv/zstd/doc/images/ldmCspeed.png | Bin 72251 -> 0 bytes priv/zstd/doc/images/ldmDspeed.png | Bin 27594 -> 0 bytes .../zstd/doc/images/linux-4.7-12-compress.png | Bin 93913 -> 0 bytes .../doc/images/linux-4.7-12-decompress.png | Bin 56215 -> 0 bytes priv/zstd/doc/images/linux-git-compress.png | Bin 105620 -> 0 bytes priv/zstd/doc/images/linux-git-decompress.png | Bin 54333 -> 0 bytes priv/zstd/doc/images/zstd_logo86.png | Bin 5963 -> 0 bytes priv/zstd/doc/zstd_compression_format.md | 1535 -- priv/zstd/doc/zstd_manual.html | 1212 -- priv/zstd/examples/.gitignore | 14 - priv/zstd/examples/Makefile | 83 - priv/zstd/examples/README.md | 40 - .../examples/multiple_streaming_compression.c | 165 - priv/zstd/examples/simple_compression.c | 135 - priv/zstd/examples/simple_decompression.c | 110 - priv/zstd/examples/streaming_compression.c | 131 - priv/zstd/examples/streaming_decompression.c | 116 - priv/zstd/examples/streaming_memory_usage.c | 149 - priv/zstd/lib/.gitignore | 3 - priv/zstd/lib/BUCK | 207 - priv/zstd/lib/Makefile | 189 - priv/zstd/lib/README.md | 108 - priv/zstd/lib/common/bitstream.h | 471 - priv/zstd/lib/common/compiler.h | 86 - priv/zstd/lib/common/entropy_common.c | 221 - priv/zstd/lib/common/error_private.c | 47 - priv/zstd/lib/common/error_private.h | 76 - priv/zstd/lib/common/fse.h | 704 - priv/zstd/lib/common/fse_decompress.c | 309 - priv/zstd/lib/common/huf.h | 302 - priv/zstd/lib/common/mem.h | 362 - priv/zstd/lib/common/pool.c | 254 - priv/zstd/lib/common/pool.h | 65 - priv/zstd/lib/common/threading.c | 75 - priv/zstd/lib/common/threading.h | 123 - priv/zstd/lib/common/xxhash.c | 875 - priv/zstd/lib/common/xxhash.h | 305 - priv/zstd/lib/common/zstd_common.c | 86 - priv/zstd/lib/common/zstd_errors.h | 83 - priv/zstd/lib/common/zstd_internal.h | 291 - priv/zstd/lib/compress/fse_compress.c | 841 - priv/zstd/lib/compress/huf_compress.c | 690 - priv/zstd/lib/compress/zstd_compress.c | 3120 ---- .../lib/compress/zstd_compress_internal.h | 462 - priv/zstd/lib/compress/zstd_double_fast.c | 309 - priv/zstd/lib/compress/zstd_double_fast.h | 29 - priv/zstd/lib/compress/zstd_fast.c | 243 - priv/zstd/lib/compress/zstd_fast.h | 31 - priv/zstd/lib/compress/zstd_lazy.c | 765 - priv/zstd/lib/compress/zstd_lazy.h | 39 - priv/zstd/lib/compress/zstd_ldm.c | 707 - priv/zstd/lib/compress/zstd_ldm.h | 68 - priv/zstd/lib/compress/zstd_opt.c | 785 - priv/zstd/lib/compress/zstd_opt.h | 30 - priv/zstd/lib/compress/zstdmt_compress.c | 1149 -- priv/zstd/lib/compress/zstdmt_compress.h | 140 - priv/zstd/lib/decompress/huf_decompress.c | 996 -- priv/zstd/lib/decompress/zstd_decompress.c | 2665 ---- priv/zstd/lib/deprecated/zbuff.h | 213 - priv/zstd/lib/deprecated/zbuff_common.c | 26 - priv/zstd/lib/deprecated/zbuff_compress.c | 147 - priv/zstd/lib/deprecated/zbuff_decompress.c | 75 - priv/zstd/lib/dictBuilder/cover.c | 1045 -- priv/zstd/lib/dictBuilder/divsufsort.c | 1913 --- priv/zstd/lib/dictBuilder/divsufsort.h | 67 - priv/zstd/lib/dictBuilder/zdict.c | 1075 -- priv/zstd/lib/dictBuilder/zdict.h | 211 - priv/zstd/lib/dll/example/Makefile | 47 - priv/zstd/lib/dll/example/README.md | 69 - priv/zstd/lib/dll/example/build_package.bat | 19 - priv/zstd/lib/dll/example/fullbench-dll.sln | 25 - .../lib/dll/example/fullbench-dll.vcxproj | 181 - priv/zstd/lib/dll/libzstd.def | 88 - priv/zstd/lib/legacy/zstd_legacy.h | 379 - priv/zstd/lib/legacy/zstd_v01.c | 2127 --- priv/zstd/lib/legacy/zstd_v01.h | 89 - priv/zstd/lib/legacy/zstd_v02.c | 3483 ---- priv/zstd/lib/legacy/zstd_v02.h | 88 - priv/zstd/lib/legacy/zstd_v03.c | 3124 ---- priv/zstd/lib/legacy/zstd_v03.h | 88 - priv/zstd/lib/legacy/zstd_v04.c | 3753 ----- priv/zstd/lib/legacy/zstd_v04.h | 137 - priv/zstd/lib/legacy/zstd_v05.c | 4011 ----- priv/zstd/lib/legacy/zstd_v05.h | 157 - priv/zstd/lib/legacy/zstd_v06.c | 4124 ----- priv/zstd/lib/legacy/zstd_v06.h | 167 - priv/zstd/lib/legacy/zstd_v07.c | 4502 ------ priv/zstd/lib/legacy/zstd_v07.h | 182 - priv/zstd/lib/libzstd.pc.in | 14 - priv/zstd/lib/zstd.h | 1399 -- priv/zstd/programs/.gitignore | 36 - priv/zstd/programs/BUCK | 44 - priv/zstd/programs/Makefile | 311 - priv/zstd/programs/README.md | 209 - priv/zstd/programs/bench.c | 676 - priv/zstd/programs/bench.h | 37 - priv/zstd/programs/datagen.c | 181 - priv/zstd/programs/datagen.h | 30 - priv/zstd/programs/dibio.c | 348 - priv/zstd/programs/dibio.h | 39 - priv/zstd/programs/fileio.c | 1996 --- priv/zstd/programs/fileio.h | 102 - priv/zstd/programs/platform.h | 153 - priv/zstd/programs/util.h | 767 - priv/zstd/programs/windres/verrsrc.h | 8 - priv/zstd/programs/windres/zstd.rc | 51 - priv/zstd/programs/windres/zstd32.res | Bin 1044 -> 0 bytes priv/zstd/programs/windres/zstd64.res | Bin 1044 -> 0 bytes priv/zstd/programs/zstd.1 | 414 - priv/zstd/programs/zstd.1.md | 414 - priv/zstd/programs/zstdcli.c | 884 - priv/zstd/programs/zstdgrep | 124 - priv/zstd/programs/zstdless | 2 - priv/zstd/tests/.gitignore | 61 - priv/zstd/tests/Makefile | 409 - priv/zstd/tests/README.md | 90 - priv/zstd/tests/datagencli.c | 130 - priv/zstd/tests/decodecorpus.c | 1923 --- .../tests/files/huffman-compressed-larger | Bin 143 -> 0 bytes priv/zstd/tests/fullbench.c | 643 - priv/zstd/tests/fuzz/.gitignore | 5 - priv/zstd/tests/fuzz/Makefile | 127 - priv/zstd/tests/fuzz/README.md | 96 - priv/zstd/tests/fuzz/block_decompress.c | 51 - priv/zstd/tests/fuzz/block_round_trip.c | 92 - priv/zstd/tests/fuzz/default.options | 2 - priv/zstd/tests/fuzz/fuzz.h | 62 - priv/zstd/tests/fuzz/fuzz.py | 818 - priv/zstd/tests/fuzz/fuzz_helpers.h | 92 - priv/zstd/tests/fuzz/regression_driver.c | 71 - priv/zstd/tests/fuzz/simple_decompress.c | 49 - priv/zstd/tests/fuzz/simple_round_trip.c | 95 - priv/zstd/tests/fuzz/stream_decompress.c | 85 - priv/zstd/tests/fuzz/stream_round_trip.c | 162 - priv/zstd/tests/fuzz/zstd_helpers.c | 84 - priv/zstd/tests/fuzz/zstd_helpers.h | 35 - priv/zstd/tests/fuzzer.c | 1714 -- priv/zstd/tests/gzip/Makefile | 44 - priv/zstd/tests/gzip/gzip-env.sh | 46 - priv/zstd/tests/gzip/helin-segv.sh | 31 - priv/zstd/tests/gzip/help-version.sh | 270 - priv/zstd/tests/gzip/hufts.sh | 34 - priv/zstd/tests/gzip/init.cfg | 5 - priv/zstd/tests/gzip/init.sh | 616 - priv/zstd/tests/gzip/keep.sh | 51 - priv/zstd/tests/gzip/list.sh | 31 - priv/zstd/tests/gzip/memcpy-abuse.sh | 34 - priv/zstd/tests/gzip/mixed.sh | 68 - priv/zstd/tests/gzip/null-suffix-clobber.sh | 35 - priv/zstd/tests/gzip/stdin.sh | 31 - priv/zstd/tests/gzip/test-driver.sh | 150 - priv/zstd/tests/gzip/trailing-nul.sh | 37 - priv/zstd/tests/gzip/unpack-invalid.sh | 36 - priv/zstd/tests/gzip/z-suffix.sh | 30 - priv/zstd/tests/gzip/zdiff.sh | 48 - priv/zstd/tests/gzip/zgrep-context.sh | 47 - priv/zstd/tests/gzip/zgrep-f.sh | 43 - priv/zstd/tests/gzip/zgrep-signal.sh | 64 - priv/zstd/tests/gzip/znew-k.sh | 40 - priv/zstd/tests/invalidDictionaries.c | 61 - priv/zstd/tests/legacy.c | 229 - priv/zstd/tests/longmatch.c | 101 - priv/zstd/tests/namespaceTest.c | 24 - priv/zstd/tests/paramgrill.c | 1051 -- priv/zstd/tests/playTests.sh | 741 - priv/zstd/tests/poolTests.c | 106 - priv/zstd/tests/roundTripCrash.c | 241 - priv/zstd/tests/seqgen.c | 260 - priv/zstd/tests/seqgen.h | 58 - priv/zstd/tests/symbols.c | 162 - priv/zstd/tests/test-zstd-speed.py | 376 - priv/zstd/tests/test-zstd-versions.py | 276 - priv/zstd/tests/zbufftest.c | 618 - priv/zstd/tests/zstreamtest.c | 1929 --- priv/zstd/zlibWrapper/.gitignore | 25 - priv/zstd/zlibWrapper/BUCK | 22 - priv/zstd/zlibWrapper/Makefile | 110 - priv/zstd/zlibWrapper/README.md | 163 - .../zlibWrapper/examples/example_original.c | 618 - .../zlibWrapper/examples/fitblk_original.c | 233 - priv/zstd/zlibWrapper/examples/minigzip.c | 654 - priv/zstd/zlibWrapper/gzclose.c | 28 - priv/zstd/zlibWrapper/gzcompatibility.h | 68 - priv/zstd/zlibWrapper/gzguts.h | 227 - priv/zstd/zlibWrapper/gzlib.c | 640 - priv/zstd/zlibWrapper/gzread.c | 670 - priv/zstd/zlibWrapper/gzwrite.c | 668 - priv/zstd/zlibWrapper/zstd_zlibwrapper.c | 1105 -- priv/zstd/zlibWrapper/zstd_zlibwrapper.h | 88 - 375 files changed, 133338 deletions(-) delete mode 100644 priv/zstd/.buckconfig delete mode 100644 priv/zstd/.buckversion delete mode 100644 priv/zstd/.gitattributes delete mode 100644 priv/zstd/.gitignore delete mode 100644 priv/zstd/.travis.yml delete mode 100644 priv/zstd/CONTRIBUTING.md delete mode 100644 priv/zstd/COPYING delete mode 100644 priv/zstd/LICENSE delete mode 100644 priv/zstd/Makefile delete mode 100644 priv/zstd/NEWS delete mode 100644 priv/zstd/README.md delete mode 100644 priv/zstd/TESTING.md delete mode 100644 priv/zstd/appveyor.yml delete mode 100644 priv/zstd/build/.gitignore delete mode 100644 priv/zstd/build/README.md delete mode 100644 priv/zstd/build/VS2010/CompileAsCpp.props delete mode 100644 priv/zstd/build/VS2010/datagen/datagen.vcxproj delete mode 100644 priv/zstd/build/VS2010/fullbench-dll/fullbench-dll.vcxproj delete mode 100644 priv/zstd/build/VS2010/fullbench/fullbench.vcxproj delete mode 100644 priv/zstd/build/VS2010/fuzzer/fuzzer.vcxproj delete mode 100644 priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.rc delete mode 100644 priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.vcxproj delete mode 100644 priv/zstd/build/VS2010/libzstd/libzstd.vcxproj delete mode 100644 priv/zstd/build/VS2010/zstd.sln delete mode 100644 priv/zstd/build/VS_scripts/README.md delete mode 100644 priv/zstd/build/VS_scripts/build.VS2010.cmd delete mode 100644 priv/zstd/build/VS_scripts/build.VS2012.cmd delete mode 100644 priv/zstd/build/VS_scripts/build.VS2013.cmd delete mode 100644 priv/zstd/build/VS_scripts/build.VS2015.cmd delete mode 100644 priv/zstd/build/VS_scripts/build.generic.cmd delete mode 100644 priv/zstd/build/cmake/.gitignore delete mode 100644 priv/zstd/build/cmake/CMakeLists.txt delete mode 100644 priv/zstd/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake delete mode 100644 priv/zstd/build/cmake/CMakeModules/GetZstdLibraryVersion.cmake delete mode 100644 priv/zstd/build/cmake/contrib/CMakeLists.txt delete mode 100644 priv/zstd/build/cmake/contrib/gen_html/CMakeLists.txt delete mode 100644 priv/zstd/build/cmake/contrib/pzstd/CMakeLists.txt delete mode 100644 priv/zstd/build/cmake/lib/.gitignore delete mode 100644 priv/zstd/build/cmake/lib/CMakeLists.txt delete mode 100644 priv/zstd/build/cmake/lib/cmake_uninstall.cmake.in delete mode 100644 priv/zstd/build/cmake/lib/pkgconfig.cmake delete mode 100644 priv/zstd/build/cmake/programs/.gitignore delete mode 100644 priv/zstd/build/cmake/programs/CMakeLists.txt delete mode 100644 priv/zstd/build/cmake/tests/.gitignore delete mode 100644 priv/zstd/build/cmake/tests/CMakeLists.txt delete mode 100644 priv/zstd/circle.yml delete mode 100644 priv/zstd/contrib/VS2005/README.md delete mode 100644 priv/zstd/contrib/VS2005/fullbench/fullbench.vcproj delete mode 100644 priv/zstd/contrib/VS2005/fuzzer/fuzzer.vcproj delete mode 100644 priv/zstd/contrib/VS2005/zstd.sln delete mode 100644 priv/zstd/contrib/VS2005/zstdlib/zstdlib.vcproj delete mode 100644 priv/zstd/contrib/adaptive-compression/Makefile delete mode 100644 priv/zstd/contrib/adaptive-compression/README.md delete mode 100644 priv/zstd/contrib/adaptive-compression/adapt.c delete mode 100644 priv/zstd/contrib/adaptive-compression/datagencli.c delete mode 100755 priv/zstd/contrib/adaptive-compression/test-correctness.sh delete mode 100755 priv/zstd/contrib/adaptive-compression/test-performance.sh delete mode 100755 priv/zstd/contrib/cleanTabs delete mode 100644 priv/zstd/contrib/gen_html/.gitignore delete mode 100644 priv/zstd/contrib/gen_html/Makefile delete mode 100644 priv/zstd/contrib/gen_html/README.md delete mode 100755 priv/zstd/contrib/gen_html/gen-zstd-manual.sh delete mode 100644 priv/zstd/contrib/gen_html/gen_html.cpp delete mode 100644 priv/zstd/contrib/linux-kernel/.gitignore delete mode 100644 priv/zstd/contrib/linux-kernel/0000-cover-letter.patch delete mode 100644 priv/zstd/contrib/linux-kernel/0001-lib-Add-xxhash-module.patch delete mode 100644 priv/zstd/contrib/linux-kernel/0002-lib-Add-zstd-modules.patch delete mode 100644 priv/zstd/contrib/linux-kernel/0003-btrfs-Add-zstd-support.patch delete mode 100644 priv/zstd/contrib/linux-kernel/0004-squashfs-Add-zstd-support.patch delete mode 100644 priv/zstd/contrib/linux-kernel/0005-crypto-Add-zstd-support.patch delete mode 100644 priv/zstd/contrib/linux-kernel/0006-squashfs-tools-Add-zstd-support.patch delete mode 100644 priv/zstd/contrib/linux-kernel/COPYING delete mode 100644 priv/zstd/contrib/linux-kernel/README.md delete mode 100755 priv/zstd/contrib/linux-kernel/btrfs-benchmark.sh delete mode 100755 priv/zstd/contrib/linux-kernel/btrfs-extract-benchmark.sh delete mode 100644 priv/zstd/contrib/linux-kernel/fs/btrfs/zstd.c delete mode 100644 priv/zstd/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c delete mode 100644 priv/zstd/contrib/linux-kernel/include/linux/xxhash.h delete mode 100644 priv/zstd/contrib/linux-kernel/include/linux/zstd.h delete mode 100755 priv/zstd/contrib/linux-kernel/kernelize.sh delete mode 100644 priv/zstd/contrib/linux-kernel/lib/Kconfig.diff delete mode 100644 priv/zstd/contrib/linux-kernel/lib/Makefile.diff delete mode 100644 priv/zstd/contrib/linux-kernel/lib/xxhash.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/.clang-format delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/Makefile delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/bitstream.h delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/compress.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/decompress.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/entropy_common.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/error_private.h delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/fse.h delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/fse_compress.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/fse_decompress.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/huf.h delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/huf_compress.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/huf_decompress.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/mem.h delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/zstd_common.c delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/zstd_internal.h delete mode 100644 priv/zstd/contrib/linux-kernel/lib/zstd/zstd_opt.h delete mode 100755 priv/zstd/contrib/linux-kernel/squashfs-benchmark.sh delete mode 100644 priv/zstd/contrib/linux-kernel/test/.gitignore delete mode 100644 priv/zstd/contrib/linux-kernel/test/DecompressCrash.c delete mode 100644 priv/zstd/contrib/linux-kernel/test/Makefile delete mode 100644 priv/zstd/contrib/linux-kernel/test/RoundTripCrash.c delete mode 100644 priv/zstd/contrib/linux-kernel/test/UserlandTest.cpp delete mode 100644 priv/zstd/contrib/linux-kernel/test/XXHashUserlandTest.cpp delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/asm/unaligned.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/compiler.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/errno.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/kernel.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/math64.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/module.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/string.h delete mode 100644 priv/zstd/contrib/linux-kernel/test/include/linux/types.h delete mode 100644 priv/zstd/contrib/linux-kernel/xxhash_test.c delete mode 100644 priv/zstd/contrib/linux-kernel/zstd_compress_test.c delete mode 100644 priv/zstd/contrib/linux-kernel/zstd_decompress_test.c delete mode 100644 priv/zstd/contrib/long_distance_matching/Makefile delete mode 100644 priv/zstd/contrib/long_distance_matching/README.md delete mode 100644 priv/zstd/contrib/long_distance_matching/ldm.c delete mode 100644 priv/zstd/contrib/long_distance_matching/ldm.h delete mode 100644 priv/zstd/contrib/long_distance_matching/ldm_common.c delete mode 100644 priv/zstd/contrib/long_distance_matching/ldm_params.h delete mode 100644 priv/zstd/contrib/long_distance_matching/main.c delete mode 100644 priv/zstd/contrib/meson/README delete mode 100644 priv/zstd/contrib/meson/meson.build delete mode 100644 priv/zstd/contrib/meson/meson_options.txt delete mode 100644 priv/zstd/contrib/pzstd/.gitignore delete mode 100644 priv/zstd/contrib/pzstd/BUCK delete mode 100644 priv/zstd/contrib/pzstd/ErrorHolder.h delete mode 100644 priv/zstd/contrib/pzstd/Logging.h delete mode 100644 priv/zstd/contrib/pzstd/Makefile delete mode 100644 priv/zstd/contrib/pzstd/Options.cpp delete mode 100644 priv/zstd/contrib/pzstd/Options.h delete mode 100644 priv/zstd/contrib/pzstd/Pzstd.cpp delete mode 100644 priv/zstd/contrib/pzstd/Pzstd.h delete mode 100644 priv/zstd/contrib/pzstd/README.md delete mode 100644 priv/zstd/contrib/pzstd/SkippableFrame.cpp delete mode 100644 priv/zstd/contrib/pzstd/SkippableFrame.h delete mode 100644 priv/zstd/contrib/pzstd/images/Cspeed.png delete mode 100644 priv/zstd/contrib/pzstd/images/Dspeed.png delete mode 100644 priv/zstd/contrib/pzstd/main.cpp delete mode 100644 priv/zstd/contrib/pzstd/test/BUCK delete mode 100644 priv/zstd/contrib/pzstd/test/OptionsTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/test/PzstdTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/test/RoundTrip.h delete mode 100644 priv/zstd/contrib/pzstd/test/RoundTripTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/utils/BUCK delete mode 100644 priv/zstd/contrib/pzstd/utils/Buffer.h delete mode 100644 priv/zstd/contrib/pzstd/utils/FileSystem.h delete mode 100644 priv/zstd/contrib/pzstd/utils/Likely.h delete mode 100644 priv/zstd/contrib/pzstd/utils/Range.h delete mode 100644 priv/zstd/contrib/pzstd/utils/ResourcePool.h delete mode 100644 priv/zstd/contrib/pzstd/utils/ScopeGuard.h delete mode 100644 priv/zstd/contrib/pzstd/utils/ThreadPool.h delete mode 100644 priv/zstd/contrib/pzstd/utils/WorkQueue.h delete mode 100644 priv/zstd/contrib/pzstd/utils/test/BUCK delete mode 100644 priv/zstd/contrib/pzstd/utils/test/BufferTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/utils/test/RangeTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/utils/test/ResourcePoolTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/utils/test/ScopeGuardTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/utils/test/ThreadPoolTest.cpp delete mode 100644 priv/zstd/contrib/pzstd/utils/test/WorkQueueTest.cpp delete mode 100644 priv/zstd/contrib/seekable_format/examples/.gitignore delete mode 100644 priv/zstd/contrib/seekable_format/examples/Makefile delete mode 100644 priv/zstd/contrib/seekable_format/examples/parallel_compression.c delete mode 100644 priv/zstd/contrib/seekable_format/examples/parallel_processing.c delete mode 100644 priv/zstd/contrib/seekable_format/examples/seekable_compression.c delete mode 100644 priv/zstd/contrib/seekable_format/examples/seekable_decompression.c delete mode 100644 priv/zstd/contrib/seekable_format/zstd_seekable.h delete mode 100644 priv/zstd/contrib/seekable_format/zstd_seekable_compression_format.md delete mode 100644 priv/zstd/contrib/seekable_format/zstdseek_compress.c delete mode 100644 priv/zstd/contrib/seekable_format/zstdseek_decompress.c delete mode 100644 priv/zstd/doc/README.md delete mode 100644 priv/zstd/doc/educational_decoder/Makefile delete mode 100644 priv/zstd/doc/educational_decoder/README.md delete mode 100644 priv/zstd/doc/educational_decoder/harness.c delete mode 100644 priv/zstd/doc/educational_decoder/zstd_decompress.c delete mode 100644 priv/zstd/doc/educational_decoder/zstd_decompress.h delete mode 100644 priv/zstd/doc/images/Cspeed4.png delete mode 100644 priv/zstd/doc/images/DCspeed5.png delete mode 100644 priv/zstd/doc/images/Dspeed4.png delete mode 100644 priv/zstd/doc/images/dict-cr.png delete mode 100644 priv/zstd/doc/images/dict-cs.png delete mode 100644 priv/zstd/doc/images/dict-ds.png delete mode 100644 priv/zstd/doc/images/ldmCspeed.png delete mode 100644 priv/zstd/doc/images/ldmDspeed.png delete mode 100644 priv/zstd/doc/images/linux-4.7-12-compress.png delete mode 100644 priv/zstd/doc/images/linux-4.7-12-decompress.png delete mode 100644 priv/zstd/doc/images/linux-git-compress.png delete mode 100644 priv/zstd/doc/images/linux-git-decompress.png delete mode 100644 priv/zstd/doc/images/zstd_logo86.png delete mode 100644 priv/zstd/doc/zstd_compression_format.md delete mode 100644 priv/zstd/doc/zstd_manual.html delete mode 100644 priv/zstd/examples/.gitignore delete mode 100644 priv/zstd/examples/Makefile delete mode 100644 priv/zstd/examples/README.md delete mode 100644 priv/zstd/examples/multiple_streaming_compression.c delete mode 100644 priv/zstd/examples/simple_compression.c delete mode 100644 priv/zstd/examples/simple_decompression.c delete mode 100644 priv/zstd/examples/streaming_compression.c delete mode 100644 priv/zstd/examples/streaming_decompression.c delete mode 100644 priv/zstd/examples/streaming_memory_usage.c delete mode 100644 priv/zstd/lib/.gitignore delete mode 100644 priv/zstd/lib/BUCK delete mode 100644 priv/zstd/lib/Makefile delete mode 100644 priv/zstd/lib/README.md delete mode 100644 priv/zstd/lib/common/bitstream.h delete mode 100644 priv/zstd/lib/common/compiler.h delete mode 100644 priv/zstd/lib/common/entropy_common.c delete mode 100644 priv/zstd/lib/common/error_private.c delete mode 100644 priv/zstd/lib/common/error_private.h delete mode 100644 priv/zstd/lib/common/fse.h delete mode 100644 priv/zstd/lib/common/fse_decompress.c delete mode 100644 priv/zstd/lib/common/huf.h delete mode 100644 priv/zstd/lib/common/mem.h delete mode 100644 priv/zstd/lib/common/pool.c delete mode 100644 priv/zstd/lib/common/pool.h delete mode 100644 priv/zstd/lib/common/threading.c delete mode 100644 priv/zstd/lib/common/threading.h delete mode 100644 priv/zstd/lib/common/xxhash.c delete mode 100644 priv/zstd/lib/common/xxhash.h delete mode 100644 priv/zstd/lib/common/zstd_common.c delete mode 100644 priv/zstd/lib/common/zstd_errors.h delete mode 100644 priv/zstd/lib/common/zstd_internal.h delete mode 100644 priv/zstd/lib/compress/fse_compress.c delete mode 100644 priv/zstd/lib/compress/huf_compress.c delete mode 100644 priv/zstd/lib/compress/zstd_compress.c delete mode 100644 priv/zstd/lib/compress/zstd_compress_internal.h delete mode 100644 priv/zstd/lib/compress/zstd_double_fast.c delete mode 100644 priv/zstd/lib/compress/zstd_double_fast.h delete mode 100644 priv/zstd/lib/compress/zstd_fast.c delete mode 100644 priv/zstd/lib/compress/zstd_fast.h delete mode 100644 priv/zstd/lib/compress/zstd_lazy.c delete mode 100644 priv/zstd/lib/compress/zstd_lazy.h delete mode 100644 priv/zstd/lib/compress/zstd_ldm.c delete mode 100644 priv/zstd/lib/compress/zstd_ldm.h delete mode 100644 priv/zstd/lib/compress/zstd_opt.c delete mode 100644 priv/zstd/lib/compress/zstd_opt.h delete mode 100644 priv/zstd/lib/compress/zstdmt_compress.c delete mode 100644 priv/zstd/lib/compress/zstdmt_compress.h delete mode 100644 priv/zstd/lib/decompress/huf_decompress.c delete mode 100644 priv/zstd/lib/decompress/zstd_decompress.c delete mode 100644 priv/zstd/lib/deprecated/zbuff.h delete mode 100644 priv/zstd/lib/deprecated/zbuff_common.c delete mode 100644 priv/zstd/lib/deprecated/zbuff_compress.c delete mode 100644 priv/zstd/lib/deprecated/zbuff_decompress.c delete mode 100644 priv/zstd/lib/dictBuilder/cover.c delete mode 100644 priv/zstd/lib/dictBuilder/divsufsort.c delete mode 100644 priv/zstd/lib/dictBuilder/divsufsort.h delete mode 100644 priv/zstd/lib/dictBuilder/zdict.c delete mode 100644 priv/zstd/lib/dictBuilder/zdict.h delete mode 100644 priv/zstd/lib/dll/example/Makefile delete mode 100644 priv/zstd/lib/dll/example/README.md delete mode 100644 priv/zstd/lib/dll/example/build_package.bat delete mode 100644 priv/zstd/lib/dll/example/fullbench-dll.sln delete mode 100644 priv/zstd/lib/dll/example/fullbench-dll.vcxproj delete mode 100644 priv/zstd/lib/dll/libzstd.def delete mode 100644 priv/zstd/lib/legacy/zstd_legacy.h delete mode 100644 priv/zstd/lib/legacy/zstd_v01.c delete mode 100644 priv/zstd/lib/legacy/zstd_v01.h delete mode 100644 priv/zstd/lib/legacy/zstd_v02.c delete mode 100644 priv/zstd/lib/legacy/zstd_v02.h delete mode 100644 priv/zstd/lib/legacy/zstd_v03.c delete mode 100644 priv/zstd/lib/legacy/zstd_v03.h delete mode 100644 priv/zstd/lib/legacy/zstd_v04.c delete mode 100644 priv/zstd/lib/legacy/zstd_v04.h delete mode 100644 priv/zstd/lib/legacy/zstd_v05.c delete mode 100644 priv/zstd/lib/legacy/zstd_v05.h delete mode 100644 priv/zstd/lib/legacy/zstd_v06.c delete mode 100644 priv/zstd/lib/legacy/zstd_v06.h delete mode 100644 priv/zstd/lib/legacy/zstd_v07.c delete mode 100644 priv/zstd/lib/legacy/zstd_v07.h delete mode 100644 priv/zstd/lib/libzstd.pc.in delete mode 100644 priv/zstd/lib/zstd.h delete mode 100644 priv/zstd/programs/.gitignore delete mode 100644 priv/zstd/programs/BUCK delete mode 100644 priv/zstd/programs/Makefile delete mode 100644 priv/zstd/programs/README.md delete mode 100644 priv/zstd/programs/bench.c delete mode 100644 priv/zstd/programs/bench.h delete mode 100644 priv/zstd/programs/datagen.c delete mode 100644 priv/zstd/programs/datagen.h delete mode 100644 priv/zstd/programs/dibio.c delete mode 100644 priv/zstd/programs/dibio.h delete mode 100644 priv/zstd/programs/fileio.c delete mode 100644 priv/zstd/programs/fileio.h delete mode 100644 priv/zstd/programs/platform.h delete mode 100644 priv/zstd/programs/util.h delete mode 100644 priv/zstd/programs/windres/verrsrc.h delete mode 100644 priv/zstd/programs/windres/zstd.rc delete mode 100644 priv/zstd/programs/windres/zstd32.res delete mode 100644 priv/zstd/programs/windres/zstd64.res delete mode 100644 priv/zstd/programs/zstd.1 delete mode 100644 priv/zstd/programs/zstd.1.md delete mode 100644 priv/zstd/programs/zstdcli.c delete mode 100755 priv/zstd/programs/zstdgrep delete mode 100755 priv/zstd/programs/zstdless delete mode 100644 priv/zstd/tests/.gitignore delete mode 100644 priv/zstd/tests/Makefile delete mode 100644 priv/zstd/tests/README.md delete mode 100644 priv/zstd/tests/datagencli.c delete mode 100644 priv/zstd/tests/decodecorpus.c delete mode 100644 priv/zstd/tests/files/huffman-compressed-larger delete mode 100644 priv/zstd/tests/fullbench.c delete mode 100644 priv/zstd/tests/fuzz/.gitignore delete mode 100644 priv/zstd/tests/fuzz/Makefile delete mode 100644 priv/zstd/tests/fuzz/README.md delete mode 100644 priv/zstd/tests/fuzz/block_decompress.c delete mode 100644 priv/zstd/tests/fuzz/block_round_trip.c delete mode 100644 priv/zstd/tests/fuzz/default.options delete mode 100644 priv/zstd/tests/fuzz/fuzz.h delete mode 100755 priv/zstd/tests/fuzz/fuzz.py delete mode 100644 priv/zstd/tests/fuzz/fuzz_helpers.h delete mode 100644 priv/zstd/tests/fuzz/regression_driver.c delete mode 100644 priv/zstd/tests/fuzz/simple_decompress.c delete mode 100644 priv/zstd/tests/fuzz/simple_round_trip.c delete mode 100644 priv/zstd/tests/fuzz/stream_decompress.c delete mode 100644 priv/zstd/tests/fuzz/stream_round_trip.c delete mode 100644 priv/zstd/tests/fuzz/zstd_helpers.c delete mode 100644 priv/zstd/tests/fuzz/zstd_helpers.h delete mode 100644 priv/zstd/tests/fuzzer.c delete mode 100644 priv/zstd/tests/gzip/Makefile delete mode 100755 priv/zstd/tests/gzip/gzip-env.sh delete mode 100644 priv/zstd/tests/gzip/helin-segv.sh delete mode 100644 priv/zstd/tests/gzip/help-version.sh delete mode 100644 priv/zstd/tests/gzip/hufts.sh delete mode 100644 priv/zstd/tests/gzip/init.cfg delete mode 100644 priv/zstd/tests/gzip/init.sh delete mode 100644 priv/zstd/tests/gzip/keep.sh delete mode 100644 priv/zstd/tests/gzip/list.sh delete mode 100644 priv/zstd/tests/gzip/memcpy-abuse.sh delete mode 100644 priv/zstd/tests/gzip/mixed.sh delete mode 100644 priv/zstd/tests/gzip/null-suffix-clobber.sh delete mode 100644 priv/zstd/tests/gzip/stdin.sh delete mode 100644 priv/zstd/tests/gzip/test-driver.sh delete mode 100644 priv/zstd/tests/gzip/trailing-nul.sh delete mode 100644 priv/zstd/tests/gzip/unpack-invalid.sh delete mode 100644 priv/zstd/tests/gzip/z-suffix.sh delete mode 100644 priv/zstd/tests/gzip/zdiff.sh delete mode 100644 priv/zstd/tests/gzip/zgrep-context.sh delete mode 100644 priv/zstd/tests/gzip/zgrep-f.sh delete mode 100644 priv/zstd/tests/gzip/zgrep-signal.sh delete mode 100644 priv/zstd/tests/gzip/znew-k.sh delete mode 100644 priv/zstd/tests/invalidDictionaries.c delete mode 100644 priv/zstd/tests/legacy.c delete mode 100644 priv/zstd/tests/longmatch.c delete mode 100644 priv/zstd/tests/namespaceTest.c delete mode 100644 priv/zstd/tests/paramgrill.c delete mode 100755 priv/zstd/tests/playTests.sh delete mode 100644 priv/zstd/tests/poolTests.c delete mode 100644 priv/zstd/tests/roundTripCrash.c delete mode 100644 priv/zstd/tests/seqgen.c delete mode 100644 priv/zstd/tests/seqgen.h delete mode 100644 priv/zstd/tests/symbols.c delete mode 100755 priv/zstd/tests/test-zstd-speed.py delete mode 100755 priv/zstd/tests/test-zstd-versions.py delete mode 100644 priv/zstd/tests/zbufftest.c delete mode 100644 priv/zstd/tests/zstreamtest.c delete mode 100644 priv/zstd/zlibWrapper/.gitignore delete mode 100644 priv/zstd/zlibWrapper/BUCK delete mode 100644 priv/zstd/zlibWrapper/Makefile delete mode 100644 priv/zstd/zlibWrapper/README.md delete mode 100644 priv/zstd/zlibWrapper/examples/example_original.c delete mode 100644 priv/zstd/zlibWrapper/examples/fitblk_original.c delete mode 100644 priv/zstd/zlibWrapper/examples/minigzip.c delete mode 100644 priv/zstd/zlibWrapper/gzclose.c delete mode 100644 priv/zstd/zlibWrapper/gzcompatibility.h delete mode 100644 priv/zstd/zlibWrapper/gzguts.h delete mode 100644 priv/zstd/zlibWrapper/gzlib.c delete mode 100644 priv/zstd/zlibWrapper/gzread.c delete mode 100644 priv/zstd/zlibWrapper/gzwrite.c delete mode 100644 priv/zstd/zlibWrapper/zstd_zlibwrapper.c delete mode 100644 priv/zstd/zlibWrapper/zstd_zlibwrapper.h diff --git a/priv/zstd/.buckconfig b/priv/zstd/.buckconfig deleted file mode 100644 index 483f605..0000000 --- a/priv/zstd/.buckconfig +++ /dev/null @@ -1,9 +0,0 @@ -[cxx] - cppflags = -DXXH_NAMESPACE=ZSTD_ -DZSTD_LEGACY_SUPPORT=4 - cflags = -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement -Wstrict-prototypes -Wundef -Wpointer-arith - cxxppflags = -DXXH_NAMESPACE=ZSTD_ -DZSTD_LEGACY_SUPPORT=4 - cxxflags = -std=c++11 -Wno-deprecated-declarations - gtest_dep = //contrib/pzstd:gtest - -[httpserver] - port = 0 diff --git a/priv/zstd/.buckversion b/priv/zstd/.buckversion deleted file mode 100644 index 892fad9..0000000 --- a/priv/zstd/.buckversion +++ /dev/null @@ -1 +0,0 @@ -c8dec2e8da52d483f6dd7c6cd2ad694e8e6fed2b diff --git a/priv/zstd/.gitattributes b/priv/zstd/.gitattributes deleted file mode 100644 index 9eb12c0..0000000 --- a/priv/zstd/.gitattributes +++ /dev/null @@ -1,24 +0,0 @@ -# Set the default behavior -* text eol=lf - -# Explicitly declare source files -*.c text eol=lf -*.h text eol=lf - -# Denote files that should not be modified. -*.odt binary -*.png binary - -# Visual Studio -*.sln text eol=crlf -*.vcxproj* text eol=crlf -*.vcproj* text eol=crlf -*.suo binary -*.rc text eol=crlf - -# Windows -*.bat text eol=crlf -*.cmd text eol=crlf - -# .travis.yml merging -.travis.yml merge=ours diff --git a/priv/zstd/.gitignore b/priv/zstd/.gitignore deleted file mode 100644 index 5fe9afd..0000000 --- a/priv/zstd/.gitignore +++ /dev/null @@ -1,42 +0,0 @@ -# Object files -*.o -*.ko -*.dSYM - -# Libraries -*.lib -*.a - -# Shared objects (inc. Windows DLLs) -*.dll -*.so -*.so.* -*.dylib - -# Executables -zstd -zstdmt -*.exe -*.out -*.app - -# Test artefacts -tmp* -dictionary* - -# Build artefacts -projects/ -bin/ -.buckd/ -buck-out/ - -# Other files -.directory -_codelite/ -_zstdbench/ -.clang_complete -*.idea -*.swp -.DS_Store -googletest/ -*.d diff --git a/priv/zstd/.travis.yml b/priv/zstd/.travis.yml deleted file mode 100644 index 45ff0df..0000000 --- a/priv/zstd/.travis.yml +++ /dev/null @@ -1,61 +0,0 @@ -# Long tests: run on commits to master branch/cron builds - -language: c -sudo: required -dist: trusty -matrix: - include: - # Ubuntu 14.04 - - env: Cmd="make cxxtest && make clean && make gnu90build && make clean && make cmakebuild && make clean && make travis-install" - - - env: Cmd='make gcc6install && CC=gcc-6 make clean uasan-test' - - env: Cmd='make gcc6install libc6install && CC=gcc-6 make clean uasan-test32' - - env: Cmd='make clang38install && CC=clang-3.8 make clean msan-test' - - env: Cmd='make clang38install && CC=clang-3.8 make clean tsan-test-zstream' - - env: Cmd='make valgrindinstall && make -C tests clean valgrindTest' - - - env: Cmd='make arminstall && make armtest' - - env: Cmd='make arminstall && make aarch64test' - - env: Cmd='make ppcinstall && make ppctest' - - env: Cmd='make ppcinstall && make ppc64test' - - - env: Cmd='make gpp6install valgrindinstall && make -C zlibWrapper test && make -C zlibWrapper valgrindTest' - - env: Cmd='make gcc6install && CC=gcc-6 make uasan-test-zstd-nolegacy' - - env: Cmd='make gcc6install && CC=gcc-6 make uasan-test-zbuff' - - - env: Cmd='make -j uasanregressiontest' - - env: Cmd='make -j msanregressiontest' - - - env: Cmd='make -C tests versionsTest && make lz4install && make clean && make -C tests test-lz4' - - # OS X Mavericks - - env: Cmd="make test" - os: osx - -before_install: - - if [ `uname` = "Darwin" ]; then brew update; fi - -install: - - if [ `uname` = "Darwin" ]; then brew install xz; fi - -git: - depth: 1 - -branches: - only: - - dev - - master - -script: - - JOB_NUMBER=$(echo $TRAVIS_JOB_NUMBER | sed -e 's:[0-9][0-9]*\.\(.*\):\1:') - - echo JOB_NUMBER=$JOB_NUMBER TRAVIS_BRANCH=$TRAVIS_BRANCH TRAVIS_EVENT_TYPE=$TRAVIS_EVENT_TYPE TRAVIS_PULL_REQUEST=$TRAVIS_PULL_REQUEST - - export FUZZERTEST=-T3mn; - export ZSTREAM_TESTTIME=-T80s; - export DECODECORPUS_TESTTIME=-T40s; - if [ "$TRAVIS_EVENT_TYPE" = "cron" ]; then - date; - git fetch origin dev; - git checkout -f FETCH_HEAD; - date; - fi; - sh -c "$Cmd" || travis_terminate 1; diff --git a/priv/zstd/CONTRIBUTING.md b/priv/zstd/CONTRIBUTING.md deleted file mode 100644 index dd013f8..0000000 --- a/priv/zstd/CONTRIBUTING.md +++ /dev/null @@ -1,42 +0,0 @@ -# Contributing to Zstandard -We want to make contributing to this project as easy and transparent as -possible. - -## Our Development Process -New versions are being developed in the "dev" branch, -or in their own feature branch. -When they are deemed ready for a release, they are merged into "master". - -As a consequences, all contributions must stage first through "dev" -or their own feature branch. - -## Pull Requests -We actively welcome your pull requests. - -1. Fork the repo and create your branch from `dev`. -2. If you've added code that should be tested, add tests. -3. If you've changed APIs, update the documentation. -4. Ensure the test suite passes. -5. Make sure your code lints. -6. If you haven't already, complete the Contributor License Agreement ("CLA"). - -## Contributor License Agreement ("CLA") -In order to accept your pull request, we need you to submit a CLA. You only need -to do this once to work on any of Facebook's open source projects. - -Complete your CLA here: - -## Issues -We use GitHub issues to track public bugs. Please ensure your description is -clear and has sufficient instructions to be able to reproduce the issue. - -Facebook has a [bounty program](https://www.facebook.com/whitehat/) for the safe -disclosure of security bugs. In those cases, please go through the process -outlined on that page and do not file a public issue. - -## Coding Style -* 4 spaces for indentation rather than tabs - -## License -By contributing to Zstandard, you agree that your contributions will be licensed -under both the [LICENSE](LICENSE) file and the [COPYING](COPYING) file in the root directory of this source tree. diff --git a/priv/zstd/COPYING b/priv/zstd/COPYING deleted file mode 100644 index ecbc059..0000000 --- a/priv/zstd/COPYING +++ /dev/null @@ -1,339 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 2, June 1991 - - Copyright (C) 1989, 1991 Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The licenses for most software are designed to take away your -freedom to share and change it. By contrast, the GNU General Public -License is intended to guarantee your freedom to share and change free -software--to make sure the software is free for all its users. This -General Public License applies to most of the Free Software -Foundation's software and to any other program whose authors commit to -using it. (Some other Free Software Foundation software is covered by -the GNU Lesser General Public License instead.) You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -this service if you wish), that you receive source code or can get it -if you want it, that you can change the software or use pieces of it -in new free programs; and that you know you can do these things. - - To protect your rights, we need to make restrictions that forbid -anyone to deny you these rights or to ask you to surrender the rights. -These restrictions translate to certain responsibilities for you if you -distribute copies of the software, or if you modify it. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must give the recipients all the rights that -you have. You must make sure that they, too, receive or can get the -source code. And you must show them these terms so they know their -rights. - - We protect your rights with two steps: (1) copyright the software, and -(2) offer you this license which gives you legal permission to copy, -distribute and/or modify the software. - - Also, for each author's protection and ours, we want to make certain -that everyone understands that there is no warranty for this free -software. If the software is modified by someone else and passed on, we -want its recipients to know that what they have is not the original, so -that any problems introduced by others will not reflect on the original -authors' reputations. - - Finally, any free program is threatened constantly by software -patents. We wish to avoid the danger that redistributors of a free -program will individually obtain patent licenses, in effect making the -program proprietary. To prevent this, we have made it clear that any -patent must be licensed for everyone's free use or not licensed at all. - - The precise terms and conditions for copying, distribution and -modification follow. - - GNU GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License applies to any program or other work which contains -a notice placed by the copyright holder saying it may be distributed -under the terms of this General Public License. The "Program", below, -refers to any such program or work, and a "work based on the Program" -means either the Program or any derivative work under copyright law: -that is to say, a work containing the Program or a portion of it, -either verbatim or with modifications and/or translated into another -language. (Hereinafter, translation is included without limitation in -the term "modification".) Each licensee is addressed as "you". - -Activities other than copying, distribution and modification are not -covered by this License; they are outside its scope. The act of -running the Program is not restricted, and the output from the Program -is covered only if its contents constitute a work based on the -Program (independent of having been made by running the Program). -Whether that is true depends on what the Program does. - - 1. You may copy and distribute verbatim copies of the Program's -source code as you receive it, in any medium, provided that you -conspicuously and appropriately publish on each copy an appropriate -copyright notice and disclaimer of warranty; keep intact all the -notices that refer to this License and to the absence of any warranty; -and give any other recipients of the Program a copy of this License -along with the Program. - -You may charge a fee for the physical act of transferring a copy, and -you may at your option offer warranty protection in exchange for a fee. - - 2. You may modify your copy or copies of the Program or any portion -of it, thus forming a work based on the Program, and copy and -distribute such modifications or work under the terms of Section 1 -above, provided that you also meet all of these conditions: - - a) You must cause the modified files to carry prominent notices - stating that you changed the files and the date of any change. - - b) You must cause any work that you distribute or publish, that in - whole or in part contains or is derived from the Program or any - part thereof, to be licensed as a whole at no charge to all third - parties under the terms of this License. - - c) If the modified program normally reads commands interactively - when run, you must cause it, when started running for such - interactive use in the most ordinary way, to print or display an - announcement including an appropriate copyright notice and a - notice that there is no warranty (or else, saying that you provide - a warranty) and that users may redistribute the program under - these conditions, and telling the user how to view a copy of this - License. (Exception: if the Program itself is interactive but - does not normally print such an announcement, your work based on - the Program is not required to print an announcement.) - -These requirements apply to the modified work as a whole. If -identifiable sections of that work are not derived from the Program, -and can be reasonably considered independent and separate works in -themselves, then this License, and its terms, do not apply to those -sections when you distribute them as separate works. But when you -distribute the same sections as part of a whole which is a work based -on the Program, the distribution of the whole must be on the terms of -this License, whose permissions for other licensees extend to the -entire whole, and thus to each and every part regardless of who wrote it. - -Thus, it is not the intent of this section to claim rights or contest -your rights to work written entirely by you; rather, the intent is to -exercise the right to control the distribution of derivative or -collective works based on the Program. - -In addition, mere aggregation of another work not based on the Program -with the Program (or with a work based on the Program) on a volume of -a storage or distribution medium does not bring the other work under -the scope of this License. - - 3. You may copy and distribute the Program (or a work based on it, -under Section 2) in object code or executable form under the terms of -Sections 1 and 2 above provided that you also do one of the following: - - a) Accompany it with the complete corresponding machine-readable - source code, which must be distributed under the terms of Sections - 1 and 2 above on a medium customarily used for software interchange; or, - - b) Accompany it with a written offer, valid for at least three - years, to give any third party, for a charge no more than your - cost of physically performing source distribution, a complete - machine-readable copy of the corresponding source code, to be - distributed under the terms of Sections 1 and 2 above on a medium - customarily used for software interchange; or, - - c) Accompany it with the information you received as to the offer - to distribute corresponding source code. (This alternative is - allowed only for noncommercial distribution and only if you - received the program in object code or executable form with such - an offer, in accord with Subsection b above.) - -The source code for a work means the preferred form of the work for -making modifications to it. For an executable work, complete source -code means all the source code for all modules it contains, plus any -associated interface definition files, plus the scripts used to -control compilation and installation of the executable. However, as a -special exception, the source code distributed need not include -anything that is normally distributed (in either source or binary -form) with the major components (compiler, kernel, and so on) of the -operating system on which the executable runs, unless that component -itself accompanies the executable. - -If distribution of executable or object code is made by offering -access to copy from a designated place, then offering equivalent -access to copy the source code from the same place counts as -distribution of the source code, even though third parties are not -compelled to copy the source along with the object code. - - 4. You may not copy, modify, sublicense, or distribute the Program -except as expressly provided under this License. Any attempt -otherwise to copy, modify, sublicense or distribute the Program is -void, and will automatically terminate your rights under this License. -However, parties who have received copies, or rights, from you under -this License will not have their licenses terminated so long as such -parties remain in full compliance. - - 5. You are not required to accept this License, since you have not -signed it. However, nothing else grants you permission to modify or -distribute the Program or its derivative works. These actions are -prohibited by law if you do not accept this License. Therefore, by -modifying or distributing the Program (or any work based on the -Program), you indicate your acceptance of this License to do so, and -all its terms and conditions for copying, distributing or modifying -the Program or works based on it. - - 6. Each time you redistribute the Program (or any work based on the -Program), the recipient automatically receives a license from the -original licensor to copy, distribute or modify the Program subject to -these terms and conditions. You may not impose any further -restrictions on the recipients' exercise of the rights granted herein. -You are not responsible for enforcing compliance by third parties to -this License. - - 7. If, as a consequence of a court judgment or allegation of patent -infringement or for any other reason (not limited to patent issues), -conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot -distribute so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you -may not distribute the Program at all. For example, if a patent -license would not permit royalty-free redistribution of the Program by -all those who receive copies directly or indirectly through you, then -the only way you could satisfy both it and this License would be to -refrain entirely from distribution of the Program. - -If any portion of this section is held invalid or unenforceable under -any particular circumstance, the balance of the section is intended to -apply and the section as a whole is intended to apply in other -circumstances. - -It is not the purpose of this section to induce you to infringe any -patents or other property right claims or to contest validity of any -such claims; this section has the sole purpose of protecting the -integrity of the free software distribution system, which is -implemented by public license practices. Many people have made -generous contributions to the wide range of software distributed -through that system in reliance on consistent application of that -system; it is up to the author/donor to decide if he or she is willing -to distribute software through any other system and a licensee cannot -impose that choice. - -This section is intended to make thoroughly clear what is believed to -be a consequence of the rest of this License. - - 8. If the distribution and/or use of the Program is restricted in -certain countries either by patents or by copyrighted interfaces, the -original copyright holder who places the Program under this License -may add an explicit geographical distribution limitation excluding -those countries, so that distribution is permitted only in or among -countries not thus excluded. In such case, this License incorporates -the limitation as if written in the body of this License. - - 9. The Free Software Foundation may publish revised and/or new versions -of the General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - -Each version is given a distinguishing version number. If the Program -specifies a version number of this License which applies to it and "any -later version", you have the option of following the terms and conditions -either of that version or of any later version published by the Free -Software Foundation. If the Program does not specify a version number of -this License, you may choose any version ever published by the Free Software -Foundation. - - 10. If you wish to incorporate parts of the Program into other free -programs whose distribution conditions are different, write to the author -to ask for permission. For software which is copyrighted by the Free -Software Foundation, write to the Free Software Foundation; we sometimes -make exceptions for this. Our decision will be guided by the two goals -of preserving the free status of all derivatives of our free software and -of promoting the sharing and reuse of software generally. - - NO WARRANTY - - 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY -FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN -OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES -PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED -OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF -MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS -TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE -PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, -REPAIR OR CORRECTION. - - 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR -REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, -INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING -OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED -TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY -YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER -PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE -POSSIBILITY OF SUCH DAMAGES. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -convey the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License along - with this program; if not, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. - -Also add information on how to contact you by electronic and paper mail. - -If the program is interactive, make it output a short notice like this -when it starts in an interactive mode: - - Gnomovision version 69, Copyright (C) year name of author - Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, the commands you use may -be called something other than `show w' and `show c'; they could even be -mouse-clicks or menu items--whatever suits your program. - -You should also get your employer (if you work as a programmer) or your -school, if any, to sign a "copyright disclaimer" for the program, if -necessary. Here is a sample; alter the names: - - Yoyodyne, Inc., hereby disclaims all copyright interest in the program - `Gnomovision' (which makes passes at compilers) written by James Hacker. - - , 1 April 1989 - Ty Coon, President of Vice - -This General Public License does not permit incorporating your program into -proprietary programs. If your program is a subroutine library, you may -consider it more useful to permit linking proprietary applications with the -library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. \ No newline at end of file diff --git a/priv/zstd/LICENSE b/priv/zstd/LICENSE deleted file mode 100644 index a793a80..0000000 --- a/priv/zstd/LICENSE +++ /dev/null @@ -1,30 +0,0 @@ -BSD License - -For Zstandard software - -Copyright (c) 2016-present, Facebook, Inc. All rights reserved. - -Redistribution and use in source and binary forms, with or without modification, -are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - - * Neither the name Facebook nor the names of its contributors may be used to - endorse or promote products derived from this software without specific - prior written permission. - -THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND -ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED -WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE -DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR -ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES -(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; -LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON -ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. diff --git a/priv/zstd/Makefile b/priv/zstd/Makefile deleted file mode 100644 index c8f0ed4..0000000 --- a/priv/zstd/Makefile +++ /dev/null @@ -1,346 +0,0 @@ -# ################################################################ -# Copyright (c) 2015-present, Yann Collet, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PRGDIR = programs -ZSTDDIR = lib -BUILDIR = build -ZWRAPDIR = zlibWrapper -TESTDIR = tests -FUZZDIR = $(TESTDIR)/fuzz - -# Define nul output -VOID = /dev/null - -ifneq (,$(filter Windows%,$(OS))) -EXT =.exe -else -EXT = -endif - -.PHONY: default -default: lib-release zstd-release - -.PHONY: all -all: | allmost examples manual - -.PHONY: allmost -allmost: allzstd - $(MAKE) -C $(ZWRAPDIR) all - -#skip zwrapper, can't build that on alternate architectures without the proper zlib installed -.PHONY: allzstd -allzstd: - $(MAKE) -C $(ZSTDDIR) all - $(MAKE) -C $(PRGDIR) all - $(MAKE) -C $(TESTDIR) all - -.PHONY: all32 -all32: - $(MAKE) -C $(PRGDIR) zstd32 - $(MAKE) -C $(TESTDIR) all32 - -.PHONY: lib -lib: - @$(MAKE) -C $(ZSTDDIR) $@ - -.PHONY: lib-release -lib-release: - @$(MAKE) -C $(ZSTDDIR) - -.PHONY: zstd -zstd: - @$(MAKE) -C $(PRGDIR) $@ - cp $(PRGDIR)/zstd$(EXT) . - -.PHONY: zstd-release -zstd-release: - @$(MAKE) -C $(PRGDIR) - cp $(PRGDIR)/zstd$(EXT) . - -.PHONY: zstdmt -zstdmt: - @$(MAKE) -C $(PRGDIR) $@ - cp $(PRGDIR)/zstd$(EXT) ./zstdmt$(EXT) - -.PHONY: zlibwrapper -zlibwrapper: - $(MAKE) -C $(ZWRAPDIR) test - -.PHONY: check -check: shortest - -.PHONY: test shortest -test shortest: - $(MAKE) -C $(PRGDIR) allVariants MOREFLAGS="-g -DZSTD_DEBUG=1" - $(MAKE) -C $(TESTDIR) $@ - -.PHONY: examples -examples: - CPPFLAGS=-I../lib LDFLAGS=-L../lib $(MAKE) -C examples/ all - -.PHONY: manual -manual: - $(MAKE) -C contrib/gen_html $@ - -.PHONY: cleanTabs -cleanTabs: - cd contrib; ./cleanTabs - -.PHONY: clean -clean: - @$(MAKE) -C $(ZSTDDIR) $@ > $(VOID) - @$(MAKE) -C $(PRGDIR) $@ > $(VOID) - @$(MAKE) -C $(TESTDIR) $@ > $(VOID) - @$(MAKE) -C $(ZWRAPDIR) $@ > $(VOID) - @$(MAKE) -C examples/ $@ > $(VOID) - @$(MAKE) -C contrib/gen_html $@ > $(VOID) - @$(RM) zstd$(EXT) zstdmt$(EXT) tmp* - @$(RM) -r lz4 - @echo Cleaning completed - -#------------------------------------------------------------------------------ -# make install is validated only for Linux, OSX, Hurd and some BSD targets -#------------------------------------------------------------------------------ -ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU FreeBSD DragonFly NetBSD MSYS_NT)) - -HOST_OS = POSIX -CMAKE_PARAMS = -DZSTD_BUILD_CONTRIB:BOOL=ON -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON -DZSTD_ZLIB_SUPPORT:BOOL=ON -DZSTD_LZMA_SUPPORT:BOOL=ON - -.PHONY: list -list: - @$(MAKE) -pRrq -f $(lastword $(MAKEFILE_LIST)) : 2>/dev/null | awk -v RS= -F: '/^# File/,/^# Finished Make data base/ {if ($$1 !~ "^[#.]") {print $$1}}' | sort | egrep -v -e '^[^[:alnum:]]' -e '^$@$$' | xargs - -.PHONY: install clangtest armtest usan asan uasan -install: - @$(MAKE) -C $(ZSTDDIR) $@ - @$(MAKE) -C $(PRGDIR) $@ - -.PHONY: uninstall -uninstall: - @$(MAKE) -C $(ZSTDDIR) $@ - @$(MAKE) -C $(PRGDIR) $@ - -.PHONY: travis-install -travis-install: - $(MAKE) install PREFIX=~/install_test_dir - -.PHONY: gcc5build -gcc5build: clean - gcc-5 -v - CC=gcc-5 $(MAKE) all MOREFLAGS="-Werror" - -.PHONY: gcc6build -gcc6build: clean - gcc-6 -v - CC=gcc-6 $(MAKE) all MOREFLAGS="-Werror" - -.PHONY: gcc7build -gcc7build: clean - gcc-7 -v - CC=gcc-7 $(MAKE) all MOREFLAGS="-Werror" - -.PHONY: clangbuild -clangbuild: clean - clang -v - CXX=clang++ CC=clang $(MAKE) all MOREFLAGS="-Werror -Wconversion -Wno-sign-conversion -Wdocumentation" - -m32build: clean - gcc -v - $(MAKE) all32 - -armbuild: clean - CC=arm-linux-gnueabi-gcc CFLAGS="-Werror" $(MAKE) allzstd - -aarch64build: clean - CC=aarch64-linux-gnu-gcc CFLAGS="-Werror" $(MAKE) allzstd - -ppcbuild: clean - CC=powerpc-linux-gnu-gcc CFLAGS="-m32 -Wno-attributes -Werror" $(MAKE) allzstd - -ppc64build: clean - CC=powerpc-linux-gnu-gcc CFLAGS="-m64 -Werror" $(MAKE) allzstd - -armfuzz: clean - CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static MOREFLAGS="-static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest - -aarch64fuzz: clean - CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static MOREFLAGS="-static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest - -ppcfuzz: clean - CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static MOREFLAGS="-static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest - -ppc64fuzz: clean - CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static MOREFLAGS="-m64 -static" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) fuzztest - -.PHONY: cxxtest -cxxtest: CXXFLAGS += -Wall -Wextra -Wundef -Wshadow -Wcast-align -Werror -cxxtest: clean - $(MAKE) -C $(PRGDIR) all CC="$(CXX) -Wno-deprecated" CFLAGS="$(CXXFLAGS)" # adding -Wno-deprecated to avoid clang++ warning on dealing with C files directly - -gcc5test: clean - gcc-5 -v - $(MAKE) all CC=gcc-5 MOREFLAGS="-Werror" - -gcc6test: clean - gcc-6 -v - $(MAKE) all CC=gcc-6 MOREFLAGS="-Werror" - -clangtest: clean - clang -v - $(MAKE) all CXX=clang-++ CC=clang MOREFLAGS="-Werror -Wconversion -Wno-sign-conversion -Wdocumentation" - -armtest: clean - $(MAKE) -C $(TESTDIR) datagen # use native, faster - $(MAKE) -C $(TESTDIR) test CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static ZSTDRTTEST= MOREFLAGS="-Werror -static" FUZZER_FLAGS=--no-big-tests - -aarch64test: - $(MAKE) -C $(TESTDIR) datagen # use native, faster - $(MAKE) -C $(TESTDIR) test CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static ZSTDRTTEST= MOREFLAGS="-Werror -static" FUZZER_FLAGS=--no-big-tests - -ppctest: clean - $(MAKE) -C $(TESTDIR) datagen # use native, faster - $(MAKE) -C $(TESTDIR) test CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static ZSTDRTTEST= MOREFLAGS="-Werror -Wno-attributes -static" FUZZER_FLAGS=--no-big-tests - -ppc64test: clean - $(MAKE) -C $(TESTDIR) datagen # use native, faster - $(MAKE) -C $(TESTDIR) test CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static ZSTDRTTEST= MOREFLAGS="-m64 -static" FUZZER_FLAGS=--no-big-tests - -arm-ppc-compilation: - $(MAKE) -C $(PRGDIR) clean zstd CC=arm-linux-gnueabi-gcc QEMU_SYS=qemu-arm-static ZSTDRTTEST= MOREFLAGS="-Werror -static" - $(MAKE) -C $(PRGDIR) clean zstd CC=aarch64-linux-gnu-gcc QEMU_SYS=qemu-aarch64-static ZSTDRTTEST= MOREFLAGS="-Werror -static" - $(MAKE) -C $(PRGDIR) clean zstd CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc-static ZSTDRTTEST= MOREFLAGS="-Werror -Wno-attributes -static" - $(MAKE) -C $(PRGDIR) clean zstd CC=powerpc-linux-gnu-gcc QEMU_SYS=qemu-ppc64-static ZSTDRTTEST= MOREFLAGS="-m64 -static" - -regressiontest: - $(MAKE) -C $(FUZZDIR) regressiontest - -uasanregressiontest: - $(MAKE) -C $(FUZZDIR) regressiontest CC=clang CXX=clang++ CFLAGS="-O3 -fsanitize=address,undefined" CXXFLAGS="-O3 -fsanitize=address,undefined" - -msanregressiontest: - $(MAKE) -C $(FUZZDIR) regressiontest CC=clang CXX=clang++ CFLAGS="-O3 -fsanitize=memory" CXXFLAGS="-O3 -fsanitize=memory" - -# run UBsan with -fsanitize-recover=signed-integer-overflow -# due to a bug in UBsan when doing pointer subtraction -# https://gcc.gnu.org/bugzilla/show_bug.cgi?id=63303 - -usan: clean - $(MAKE) test CC=clang MOREFLAGS="-g -fno-sanitize-recover=all -fsanitize-recover=signed-integer-overflow -fsanitize=undefined" - -asan: clean - $(MAKE) test CC=clang MOREFLAGS="-g -fsanitize=address" - -asan-%: clean - LDFLAGS=-fuse-ld=gold MOREFLAGS="-g -fno-sanitize-recover=all -fsanitize=address" $(MAKE) -C $(TESTDIR) $* - -msan: clean - $(MAKE) test CC=clang MOREFLAGS="-g -fsanitize=memory -fno-omit-frame-pointer" HAVE_LZMA=0 # datagen.c fails this test for no obvious reason - -msan-%: clean - LDFLAGS=-fuse-ld=gold MOREFLAGS="-g -fno-sanitize-recover=all -fsanitize=memory -fno-omit-frame-pointer" FUZZER_FLAGS=--no-big-tests $(MAKE) -C $(TESTDIR) HAVE_LZMA=0 $* - -asan32: clean - $(MAKE) -C $(TESTDIR) test32 CC=clang MOREFLAGS="-g -fsanitize=address" - -uasan: clean - $(MAKE) test CC=clang MOREFLAGS="-g -fno-sanitize-recover=all -fsanitize-recover=signed-integer-overflow -fsanitize=address,undefined" - -uasan-%: clean - LDFLAGS=-fuse-ld=gold MOREFLAGS="-g -fno-sanitize-recover=all -fsanitize-recover=signed-integer-overflow -fsanitize=address,undefined" $(MAKE) -C $(TESTDIR) $* - -tsan-%: clean - LDFLAGS=-fuse-ld=gold MOREFLAGS="-g -fno-sanitize-recover=all -fsanitize=thread" $(MAKE) -C $(TESTDIR) $* FUZZER_FLAGS=--no-big-tests - -apt-install: - sudo apt-get -yq --no-install-suggests --no-install-recommends --force-yes install $(APT_PACKAGES) - -apt-add-repo: - sudo add-apt-repository -y ppa:ubuntu-toolchain-r/test - sudo apt-get update -y -qq - -ppcinstall: - APT_PACKAGES="qemu-system-ppc qemu-user-static gcc-powerpc-linux-gnu" $(MAKE) apt-install - -arminstall: - APT_PACKAGES="qemu-system-arm qemu-user-static gcc-arm-linux-gnueabi libc6-dev-armel-cross gcc-aarch64-linux-gnu libc6-dev-arm64-cross" $(MAKE) apt-install - -valgrindinstall: - APT_PACKAGES="valgrind" $(MAKE) apt-install - -libc6install: - APT_PACKAGES="libc6-dev-i386 gcc-multilib" $(MAKE) apt-install - -gcc6install: apt-add-repo - APT_PACKAGES="libc6-dev-i386 gcc-multilib gcc-6 gcc-6-multilib" $(MAKE) apt-install - -gpp6install: apt-add-repo - APT_PACKAGES="libc6-dev-i386 g++-multilib gcc-6 g++-6 g++-6-multilib" $(MAKE) apt-install - -clang38install: - APT_PACKAGES="clang-3.8" $(MAKE) apt-install - -# Ubuntu 14.04 ships a too-old lz4 -lz4install: - [ -e lz4 ] || git clone https://github.com/lz4/lz4 && sudo $(MAKE) -C lz4 install - -endif - - -ifneq (,$(filter MSYS%,$(shell uname))) -HOST_OS = MSYS -CMAKE_PARAMS = -G"MSYS Makefiles" -DZSTD_MULTITHREAD_SUPPORT:BOOL=OFF -DZSTD_BUILD_STATIC:BOOL=ON -DZSTD_BUILD_TESTS:BOOL=ON -endif - - -#------------------------------------------------------------------------ -# target specific tests -#------------------------------------------------------------------------ -ifneq (,$(filter $(HOST_OS),MSYS POSIX)) -cmakebuild: - cmake --version - $(RM) -r $(BUILDIR)/cmake/build - mkdir $(BUILDIR)/cmake/build - cd $(BUILDIR)/cmake/build ; cmake -DCMAKE_INSTALL_PREFIX:PATH=~/install_test_dir $(CMAKE_PARAMS) .. ; $(MAKE) install ; $(MAKE) uninstall - -c90build: clean - $(CC) -v - CFLAGS="-std=c90" $(MAKE) allmost # will fail, due to missing support for `long long` - -gnu90build: clean - $(CC) -v - CFLAGS="-std=gnu90" $(MAKE) allmost - -c99build: clean - $(CC) -v - CFLAGS="-std=c99" $(MAKE) allmost - -gnu99build: clean - $(CC) -v - CFLAGS="-std=gnu99" $(MAKE) allmost - -c11build: clean - $(CC) -v - CFLAGS="-std=c11" $(MAKE) allmost - -bmix64build: clean - $(CC) -v - CFLAGS="-O3 -mbmi -Werror" $(MAKE) -C $(TESTDIR) test - -bmix32build: clean - $(CC) -v - CFLAGS="-O3 -mbmi -mx32 -Werror" $(MAKE) -C $(TESTDIR) test - -bmi32build: clean - $(CC) -v - CFLAGS="-O3 -mbmi -m32 -Werror" $(MAKE) -C $(TESTDIR) test - -staticAnalyze: clean - $(CC) -v - CPPFLAGS=-g scan-build --status-bugs -v $(MAKE) all -endif diff --git a/priv/zstd/NEWS b/priv/zstd/NEWS deleted file mode 100644 index a45960b..0000000 --- a/priv/zstd/NEWS +++ /dev/null @@ -1,348 +0,0 @@ -v1.3.3 -perf: faster zstd_opt strategy (levels 17-19) -fix : bug #944 : multithreading with shared ditionary and large data, reported by @gsliepen -cli : fix : content size written in header by default -cli : fix : improved LZ4 format support, by @felixhandte -cli : new : hidden command `-S`, to benchmark multiple files while generating one result per file -api : fix : support large skippable frames, by @terrelln -api : fix : streaming interface was adding a useless 3-bytes null block to small frames -api : change : when setting `pledgedSrcSize`, use `ZSTD_CONTENTSIZE_UNKNOWN` macro value to mean "unknown" -build: fix : compilation under rhel6 and centos6, reported by @pixelb -build: added `check` target - -v1.3.2 -new : long range mode, using --long command, by Stella Lau (@stellamplau) -new : ability to generate and decode magicless frames (#591) -changed : maximum nb of threads reduced to 200, to avoid address space exhaustion in 32-bits mode -fix : multi-threading compression works with custom allocators -fix : ZSTD_sizeof_CStream() was over-evaluating memory usage -fix : a rare compression bug when compression generates very large distances and bunch of other conditions (only possible at --ultra -22) -fix : 32-bits build can now decode large offsets (levels 21+) -cli : added LZ4 frame support by default, by Felix Handte (@felixhandte) -cli : improved --list output -cli : new : can split input file for dictionary training, using command -B# -cli : new : clean operation artefact on Ctrl-C interruption -cli : fix : do not change /dev/null permissions when using command -t with root access, reported by @mike155 (#851) -cli : fix : write file size in header in multiple-files mode -api : added macro ZSTD_COMPRESSBOUND() for static allocation -api : experimental : new advanced decompression API -api : fix : sizeof_CCtx() used to over-estimate -build: fix : no-multithread variant compiles without pool.c dependency, reported by Mitchell Blank Jr (@mitchblank) (#819) -build: better compatibility with reproducible builds, by Bernhard M. Wiedemann (@bmwiedemann) (#818) -example : added streaming_memory_usage -license : changed /examples license to BSD + GPLv2 -license : fix a few header files to reflect new license (#825) - -v1.3.1 -New license : BSD + GPLv2 -perf: substantially decreased memory usage in Multi-threading mode, thanks to reports by Tino Reichardt (@mcmilk) -perf: Multi-threading supports up to 256 threads. Cap at 256 when more are requested (#760) -cli : improved and fixed --list command, by @ib (#772) -cli : command -vV to list supported formats, by @ib (#771) -build : fixed binary variants, reported by @svenha (#788) -build : fix Visual compilation for non x86/x64 targets, reported by Greg Slazinski (@GregSlazinski) (#718) -API exp : breaking change : ZSTD_getframeHeader() provides more information -API exp : breaking change : pinned down values of error codes -doc : fixed huffman example, by Ulrich Kunitz (@ulikunitz) -new : contrib/adaptive-compression, I/O driven compression strength, by Paul Cruz (@paulcruz74) -new : contrib/long_distance_matching, statistics by Stella Lau (@stellamplau) -updated : contrib/linux-kernel, by Nick Terrell (@terrelln) - -v1.3.0 -cli : new : `--list` command, by Paul Cruz -cli : changed : xz/lzma support enabled by default -cli : changed : `-t *` continue processing list after a decompression error -API : added : ZSTD_versionString() -API : promoted to stable status : ZSTD_getFrameContentSize(), by Sean Purcell -API exp : new advanced API : ZSTD_compress_generic(), ZSTD_CCtx_setParameter() -API exp : new : API for static or external allocation : ZSTD_initStatic?Ctx() -API exp : added : ZSTD_decompressBegin_usingDDict(), requested by Guy Riddle (#700) -API exp : clarified memory estimation / measurement functions. -API exp : changed : strongest strategy renamed ZSTD_btultra, fastest strategy ZSTD_fast set to 1 -tools : decodecorpus can generate random dictionary-compressed samples, by Paul Cruz -new : contrib/seekable_format, demo and API, by Sean Purcell -changed : contrib/linux-kernel, updated version and license, by Nick Terrell - -v1.2.0 -cli : changed : Multithreading enabled by default (use target zstd-nomt or HAVE_THREAD=0 to disable) -cli : new : command -T0 means "detect and use nb of cores", by Sean Purcell -cli : new : zstdmt symlink hardwired to `zstd -T0` -cli : new : command --threads=# (#671) -cli : changed : cover dictionary builder by default, for improved quality, by Nick Terrell -cli : new : commands --train-cover and --train-legacy, to select dictionary algorithm and parameters -cli : experimental targets `zstd4` and `xzstd4`, with support for lz4 format, by Sean Purcell -cli : fix : does not output compressed data on console -cli : fix : ignore symbolic links unless --force specified, -API : breaking change : ZSTD_createCDict_advanced(), only use compressionParameters as argument -API : added : prototypes ZSTD_*_usingCDict_advanced(), for direct control over frameParameters. -API : improved: ZSTDMT_compressCCtx() reduced memory usage -API : fix : ZSTDMT_compressCCtx() now provides srcSize in header (#634) -API : fix : src size stored in frame header is controlled at end of frame -API : fix : enforced consistent rules for pledgedSrcSize==0 (#641) -API : fix : error code "GENERIC" replaced by "dstSizeTooSmall" when appropriate -build: improved cmake script, by @Majlen -build: enabled Multi-threading support for *BSD, by Baptiste Daroussin -tools: updated Paramgrill. Command -O# provides best parameters for sample and speed target. -new : contrib/linux-kernel version, by Nick Terrell - -v1.1.4 -cli : new : can compress in *.gz format, using --format=gzip command, by Przemyslaw Skibinski -cli : new : advanced benchmark command --priority=rt -cli : fix : write on sparse-enabled file systems in 32-bits mode, by @ds77 -cli : fix : --rm remains silent when input is stdin -cli : experimental : xzstd, with support for xz/lzma decoding, by Przemyslaw Skibinski -speed : improved decompression speed in streaming mode for single shot scenarios (+5%) -memory: DDict (decompression dictionary) memory usage down from 150 KB to 20 KB -arch: 32-bits variant able to generate and decode very long matches (>32 MB), by Sean Purcell -API : new : ZSTD_findFrameCompressedSize(), ZSTD_getFrameContentSize(), ZSTD_findDecompressedSize() -API : changed : dropped support of legacy versions <= v0.3 (can be changed by modifying ZSTD_LEGACY_SUPPORT value) -build : new: meson build system in contrib/meson, by Dima Krasner -build : improved cmake script, by @Majlen -build : added -Wformat-security flag, as recommended by Padraig Brady -doc : new : educational decoder, by Sean Purcell - -v1.1.3 -cli : zstd can decompress .gz files (can be disabled with `make zstd-nogz` or `make HAVE_ZLIB=0`) -cli : new : experimental target `make zstdmt`, with multi-threading support -cli : new : improved dictionary builder "cover" (experimental), by Nick Terrell, based on prior work by Giuseppe Ottaviano. -cli : new : advanced commands for detailed parameters, by Przemyslaw Skibinski -cli : fix zstdless on Mac OS-X, by Andrew Janke -cli : fix #232 "compress non-files" -dictBuilder : improved dictionary generation quality, thanks to Nick Terrell -API : new : lib/compress/ZSTDMT_compress.h multithreading API (experimental) -API : new : ZSTD_create?Dict_byReference(), requested by Bartosz Taudul -API : new : ZDICT_finalizeDictionary() -API : fix : ZSTD_initCStream_usingCDict() properly writes dictID into frame header, by Gregory Szorc (#511) -API : fix : all symbols properly exposed in libzstd, by Nick Terrell -build : support for Solaris target, by Przemyslaw Skibinski -doc : clarified specification, by Sean Purcell - -v1.1.2 -API : streaming : decompression : changed : automatic implicit reset when chain-decoding new frames without init -API : experimental : added : dictID retrieval functions, and ZSTD_initCStream_srcSize() -API : zbuff : changed : prototypes now generate deprecation warnings -lib : improved : faster decompression speed at ultra compression settings and 32-bits mode -lib : changed : only public ZSTD_ symbols are now exposed -lib : changed : reduced usage of stack memory -lib : fixed : several corner case bugs, by Nick Terrell -cli : new : gzstd, experimental version able to decode .gz files, by Przemyslaw Skibinski -cli : new : preserve file attributes -cli : new : added zstdless and zstdgrep tools -cli : fixed : status displays total amount decoded, even for file consisting of multiple frames (like pzstd) -cli : fixed : zstdcat -zlib_wrapper : added support for gz* functions, by Przemyslaw Skibinski -install : better compatibility with FreeBSD, by Dimitry Andric -source tree : changed : zbuff source files moved to lib/deprecated - -v1.1.1 -New : command -M#, --memory=, --memlimit=, --memlimit-decompress= to limit allowed memory consumption -New : doc/zstd_manual.html, by Przemyslaw Skibinski -Improved : slightly better compression ratio at --ultra levels (>= 20) -Improved : better memory usage when using streaming compression API, thanks to @Rogier-5 report -Added : API : ZSTD_initCStream_usingCDict(), ZSTD_initDStream_usingDDict() (experimental section) -Added : example/multiple_streaming_compression.c -Changed : zstd_errors.h is now installed within /include (and replaces errors_public.h) -Updated man page -Fixed : zstd-small, zstd-compress and zstd-decompress compilation targets - -v1.1.0 -New : contrib/pzstd, parallel version of zstd, by Nick Terrell -added : NetBSD install target (#338) -Improved : speed for batches of small files -Improved : speed of zlib wrapper, by Przemyslaw Skibinski -Changed : libzstd on Windows supports legacy formats, by Christophe Chevalier -Fixed : CLI -d output to stdout by default when input is stdin (#322) -Fixed : CLI correctly detects console on Mac OS-X -Fixed : CLI supports recursive mode `-r` on Mac OS-X -Fixed : Legacy decoders use unified error codes, reported by benrg (#341), fixed by Przemyslaw Skibinski -Fixed : compatibility with OpenBSD, reported by Juan Francisco Cantero Hurtado (#319) -Fixed : compatibility with Hurd, by Przemyslaw Skibinski (#365) -Fixed : zstd-pgo, reported by octoploid (#329) - -v1.0.0 -Change Licensing, all project is now BSD, Copyright Facebook -Small decompression speed improvement -API : Streaming API supports legacy format -API : ZDICT_getDictID(), ZSTD_sizeof_{CCtx, DCtx, CStream, DStream}(), ZSTD_setDStreamParamter() -CLI supports legacy formats v0.4+ -Fixed : compression fails on certain huge files, reported by Jesse McGrew -Enhanced documentation, by Przemyslaw Skibinski - -v0.8.1 -New streaming API -Changed : --ultra now enables levels beyond 19 -Changed : -i# now selects benchmark time in second -Fixed : ZSTD_compress* can now compress > 4 GB in a single pass, reported by Nick Terrell -Fixed : speed regression on specific patterns (#272) -Fixed : support for Z_SYNC_FLUSH, by Dmitry Krot (#291) -Fixed : ICC compilation, by Przemyslaw Skibinski - -v0.8.0 -Improved : better speed on clang and gcc -O2, thanks to Eric Biggers -New : Build on FreeBSD and DragonFly, thanks to JrMarino -Changed : modified API : ZSTD_compressEnd() -Fixed : legacy mode with ZSTD_HEAPMODE=0, by Christopher Bergqvist -Fixed : premature end of frame when zero-sized raw block, reported by Eric Biggers -Fixed : large dictionaries (> 384 KB), reported by Ilona Papava -Fixed : checksum correctly checked in single-pass mode -Fixed : combined --test amd --rm, reported by Andreas M. Nilsson -Modified : minor compression level adaptations -Updated : compression format specification to v0.2.0 -changed : zstd.h moved to /lib directory - -v0.7.5 -Transition version, supporting decoding of v0.8.x - -v0.7.4 -Added : homebrew for Mac, by Daniel Cade -Added : more examples -Fixed : segfault when using small dictionaries, reported by Felix Handte -Modified : default compression level for CLI is now 3 -Updated : specification, to v0.1.1 - -v0.7.3 -New : compression format specification -New : `--` separator, stating that all following arguments are file names. Suggested by Chip Turner. -New : `ZSTD_getDecompressedSize()` -New : OpenBSD target, by Juan Francisco Cantero Hurtado -New : `examples` directory -fixed : dictBuilder using HC levels, reported by Bartosz Taudul -fixed : legacy support from ZSTD_decompress_usingDDict(), reported by Felix Handte -fixed : multi-blocks decoding with intermediate uncompressed blocks, reported by Greg Slazinski -modified : removed "mem.h" and "error_public.h" dependencies from "zstd.h" (experimental section) -modified : legacy functions no longer need magic number - -v0.7.2 -fixed : ZSTD_decompressBlock() using multiple consecutive blocks. Reported by Greg Slazinski. -fixed : potential segfault on very large files (many gigabytes). Reported by Chip Turner. -fixed : CLI displays system error message when destination file cannot be created (#231). Reported by Chip Turner. - -v0.7.1 -fixed : ZBUFF_compressEnd() called multiple times with too small `dst` buffer, reported by Christophe Chevalier -fixed : dictBuilder fails if first sample is too small, reported by Руслан Ковалёв -fixed : corruption issue, reported by cj -modified : checksum enabled by default in command line mode - -v0.7.0 -New : Support for directory compression, using `-r`, thanks to Przemyslaw Skibinski -New : Command `--rm`, to remove source file after successful de/compression -New : Visual build scripts, by Christophe Chevalier -New : Support for Sparse File-systems (do not use space for zero-filled sectors) -New : Frame checksum support -New : Support pass-through mode (when using `-df`) -API : more efficient Dictionary API : `ZSTD_compress_usingCDict()`, `ZSTD_decompress_usingDDict()` -API : create dictionary files from custom content, by Giuseppe Ottaviano -API : support for custom malloc/free functions -New : controllable Dictionary ID -New : Support for skippable frames - -v0.6.1 -New : zlib wrapper API, thanks to Przemyslaw Skibinski -New : Ability to compile compressor / decompressor separately -Changed : new lib directory structure -Fixed : Legacy codec v0.5 compatible with dictionary decompression -Fixed : Decoder corruption error (#173) -Fixed : null-string roundtrip (#176) -New : benchmark mode can select directory as input -Experimental : midipix support, VMS support - -v0.6.0 -Stronger high compression modes, thanks to Przemyslaw Skibinski -API : ZSTD_getFrameParams() provides size of decompressed content -New : highest compression modes require `--ultra` command to fully unleash their capacity -Fixed : zstd cli return error code > 0 and removes dst file artifact when decompression fails, thanks to Chip Turner - -v0.5.1 -New : Optimal parsing => Very high compression modes, thanks to Przemyslaw Skibinski -Changed : Dictionary builder integrated into libzstd and zstd cli -Changed (!) : zstd cli now uses "multiple input files" as default mode. See `zstd -h`. -Fix : high compression modes for big-endian platforms -New : zstd cli : `-t` | `--test` command - -v0.5.0 -New : dictionary builder utility -Changed : streaming & dictionary API -Improved : better compression of small data - -v0.4.7 -Improved : small compression speed improvement in HC mode -Changed : `zstd_decompress.c` has ZSTD_LEGACY_SUPPORT to 0 by default -fix : bt search bug - -v0.4.6 -fix : fast compression mode on Windows -New : cmake configuration file, thanks to Artyom Dymchenko -Improved : high compression mode on repetitive data -New : block-level API -New : ZSTD_duplicateCCtx() - -v0.4.5 -new : -m/--multiple : compress/decompress multiple files - -v0.4.4 -Fixed : high compression modes for Windows 32 bits -new : external dictionary API extended to buffered mode and accessible through command line -new : windows DLL project, thanks to Christophe Chevalier - -v0.4.3 : -new : external dictionary API -new : zstd-frugal - -v0.4.2 : -Generic minor improvements for small blocks -Fixed : big-endian compatibility, by Peter Harris (#85) - -v0.4.1 -Fixed : ZSTD_LEGACY_SUPPORT=0 build mode (reported by Luben) -removed `zstd.c` - -v0.4.0 -Command line utility compatible with high compression levels -Removed zstdhc => merged into zstd -Added : ZBUFF API (see zstd_buffered.h) -Rolling buffer support - -v0.3.6 -small blocks params - -v0.3.5 -minor generic compression improvements - -v0.3.4 -Faster fast cLevels - -v0.3.3 -Small compression ratio improvement - -v0.3.2 -Fixed Visual Studio - -v0.3.1 : -Small compression ratio improvement - -v0.3 -HC mode : compression levels 2-26 - -v0.2.2 -Fix : Visual Studio 2013 & 2015 release compilation, by Christophe Chevalier - -v0.2.1 -Fix : Read errors, advanced fuzzer tests, by Hanno Böck - -v0.2.0 -**Breaking format change** -Faster decompression speed -Can still decode v0.1 format - -v0.1.3 -fix uninitialization warning, reported by Evan Nemerson - -v0.1.2 -frame concatenation support - -v0.1.1 -fix compression bug -detects write-flush errors - -v0.1.0 -first release diff --git a/priv/zstd/README.md b/priv/zstd/README.md deleted file mode 100644 index 3755315..0000000 --- a/priv/zstd/README.md +++ /dev/null @@ -1,150 +0,0 @@ -

Zstandard

- -__Zstandard__, or `zstd` as short version, is a fast lossless compression algorithm, -targeting real-time compression scenarios at zlib-level and better compression ratios. -It's backed by a very fast entropy stage, provided by [Huff0 and FSE library](https://github.com/Cyan4973/FiniteStateEntropy). - -The project is provided as an open-source BSD-licensed **C** library, -and a command line utility producing and decoding `.zst`, `.gz`, `.xz` and `.lz4` files. -Should your project require another programming language, -a list of known ports and bindings is provided on [Zstandard homepage](http://www.zstd.net/#other-languages). - -Development branch status : [![Build Status][travisDevBadge]][travisLink] [![Build status][AppveyorDevBadge]][AppveyorLink] [![Build status][CircleDevBadge]][CircleLink] - -[travisDevBadge]: https://travis-ci.org/facebook/zstd.svg?branch=dev "Continuous Integration test suite" -[travisLink]: https://travis-ci.org/facebook/zstd -[AppveyorDevBadge]: https://ci.appveyor.com/api/projects/status/xt38wbdxjk5mrbem/branch/dev?svg=true "Windows test suite" -[AppveyorLink]: https://ci.appveyor.com/project/YannCollet/zstd-p0yf0 -[CircleDevBadge]: https://circleci.com/gh/facebook/zstd/tree/dev.svg?style=shield "Short test suite" -[CircleLink]: https://circleci.com/gh/facebook/zstd - -### Benchmarks - -For reference, several fast compression algorithms were tested and compared -on a server running Linux Debian (`Linux version 4.8.0-1-amd64`), -with a Core i7-6700K CPU @ 4.0GHz, -using [lzbench], an open-source in-memory benchmark by @inikep -compiled with GCC 6.3.0, -on the [Silesia compression corpus]. - -[lzbench]: https://github.com/inikep/lzbench -[Silesia compression corpus]: http://sun.aei.polsl.pl/~sdeor/index.php?page=silesia - -| Compressor name | Ratio | Compression| Decompress.| -| --------------- | ------| -----------| ---------- | -| **zstd 1.1.3 -1** | 2.877 | 430 MB/s | 1110 MB/s | -| zlib 1.2.8 -1 | 2.743 | 110 MB/s | 400 MB/s | -| brotli 0.5.2 -0 | 2.708 | 400 MB/s | 430 MB/s | -| quicklz 1.5.0 -1 | 2.238 | 550 MB/s | 710 MB/s | -| lzo1x 2.09 -1 | 2.108 | 650 MB/s | 830 MB/s | -| lz4 1.7.5 | 2.101 | 720 MB/s | 3600 MB/s | -| snappy 1.1.3 | 2.091 | 500 MB/s | 1650 MB/s | -| lzf 3.6 -1 | 2.077 | 400 MB/s | 860 MB/s | - -[zlib]:http://www.zlib.net/ -[LZ4]: http://www.lz4.org/ - -Zstd can also offer stronger compression ratios at the cost of compression speed. -Speed vs Compression trade-off is configurable by small increments. -Decompression speed is preserved and remains roughly the same at all settings, -a property shared by most LZ compression algorithms, such as [zlib] or lzma. - -The following tests were run -on a server running Linux Debian (`Linux version 4.8.0-1-amd64`) -with a Core i7-6700K CPU @ 4.0GHz, -using [lzbench], an open-source in-memory benchmark by @inikep -compiled with GCC 6.3.0, -on the [Silesia compression corpus]. - -Compression Speed vs Ratio | Decompression Speed ----------------------------|-------------------- -![Compression Speed vs Ratio](doc/images/Cspeed4.png "Compression Speed vs Ratio") | ![Decompression Speed](doc/images/Dspeed4.png "Decompression Speed") - -A few other algorithms can produce higher compression ratios at slower speeds, falling outside of the graph. -For a larger picture including slow modes, [click on this link](doc/images/DCspeed5.png). - - -### The case for Small Data compression - -Previous charts provide results applicable to typical file and stream scenarios (several MB). Small data comes with different perspectives. - -The smaller the amount of data to compress, the more difficult it is to compress. This problem is common to all compression algorithms, and reason is, compression algorithms learn from past data how to compress future data. But at the beginning of a new data set, there is no "past" to build upon. - -To solve this situation, Zstd offers a __training mode__, which can be used to tune the algorithm for a selected type of data. -Training Zstandard is achieved by providing it with a few samples (one file per sample). The result of this training is stored in a file called "dictionary", which must be loaded before compression and decompression. -Using this dictionary, the compression ratio achievable on small data improves dramatically. - -The following example uses the `github-users` [sample set](https://github.com/facebook/zstd/releases/tag/v1.1.3), created from [github public API](https://developer.github.com/v3/users/#get-all-users). -It consists of roughly 10K records weighing about 1KB each. - -Compression Ratio | Compression Speed | Decompression Speed -------------------|-------------------|-------------------- -![Compression Ratio](doc/images/dict-cr.png "Compression Ratio") | ![Compression Speed](doc/images/dict-cs.png "Compression Speed") | ![Decompression Speed](doc/images/dict-ds.png "Decompression Speed") - - -These compression gains are achieved while simultaneously providing _faster_ compression and decompression speeds. - -Training works if there is some correlation in a family of small data samples. The more data-specific a dictionary is, the more efficient it is (there is no _universal dictionary_). -Hence, deploying one dictionary per type of data will provide the greatest benefits. -Dictionary gains are mostly effective in the first few KB. Then, the compression algorithm will gradually use previously decoded content to better compress the rest of the file. - -#### Dictionary compression How To: - -1) Create the dictionary - -`zstd --train FullPathToTrainingSet/* -o dictionaryName` - -2) Compress with dictionary - -`zstd -D dictionaryName FILE` - -3) Decompress with dictionary - -`zstd -D dictionaryName --decompress FILE.zst` - - -### Build instructions - -#### Makefile - -If your system is compatible with standard `make` (or `gmake`), -invoking `make` in root directory will generate `zstd` cli in root directory. - -Other available options include: -- `make install` : create and install zstd cli, library and man pages -- `make check` : create and run `zstd`, tests its behavior on local platform - -#### cmake - -A `cmake` project generator is provided within `build/cmake`. -It can generate Makefiles or other build scripts -to create `zstd` binary, and `libzstd` dynamic and static libraries. - -#### Meson - -A Meson project is provided within `contrib/meson`. - -#### Visual Studio (Windows) - -Going into `build` directory, you will find additional possibilities: -- Projects for Visual Studio 2005, 2008 and 2010. - + VS2010 project is compatible with VS2012, VS2013 and VS2015. -- Automated build scripts for Visual compiler by @KrzysFR , in `build/VS_scripts`, - which will build `zstd` cli and `libzstd` library without any need to open Visual Studio solution. - - -### Status - -Zstandard is currently deployed within Facebook. It is used continuously to compress large amounts of data in multiple formats and use cases. -Zstandard is considered safe for production environments. - -### License - -Zstandard is dual-licensed under [BSD](LICENSE) and [GPLv2](COPYING). - -### Contributing - -The "dev" branch is the one where all contributions are merged before reaching "master". -If you plan to propose a patch, please commit into the "dev" branch, or its own feature branch. -Direct commit to "master" are not permitted. -For more information, please read [CONTRIBUTING](CONTRIBUTING.md). diff --git a/priv/zstd/TESTING.md b/priv/zstd/TESTING.md deleted file mode 100644 index 1fa5fe8..0000000 --- a/priv/zstd/TESTING.md +++ /dev/null @@ -1,44 +0,0 @@ -Testing -======= - -Zstandard CI testing is split up into three sections: -short, medium, and long tests. - -Short Tests ------------ -Short tests run on CircleCI for new commits on every branch and pull request. -They consist of the following tests: -- Compilation on all supported targets (x86, x86_64, ARM, AArch64, PowerPC, and PowerPC64) -- Compilation on various versions of gcc, clang, and g++ -- `tests/playTests.sh` on x86_64, without the tests on long data (CLI tests) -- Small tests (`tests/legacy.c`, `tests/longmatch.c`, `tests/symbols.c`) on x64_64 - -Medium Tests ------------- -Medium tests run on every commit and pull request to `dev` branch, on TravisCI. -They consist of the following tests: -- The following tests run with UBsan and Asan on x86_64 and x86, as well as with - Msan on x86_64 - - `tests/playTests.sh --test-long-data` - - Fuzzer tests: `tests/fuzzer.c`, `tests/zstreamtest.c`, and `tests/decodecorpus.c` -- `tests/zstreamtest.c` under Tsan (streaming mode, including multithreaded mode) -- Valgrind Test (`make -C tests valgrindTest`) (testing CLI and fuzzer under valgrind) -- Fuzzer tests (see above) on ARM, AArch64, PowerPC, and PowerPC64 - -Long Tests ----------- -Long tests run on all commits to `master` branch, -and once a day on the current version of `dev` branch, -on TravisCI. -They consist of the following tests: -- Entire test suite (including fuzzers and some other specialized tests) on: - - x86_64 and x86 with UBsan and Asan - - x86_64 with Msan - - ARM, AArch64, PowerPC, and PowerPC64 -- Streaming mode fuzzer with Tsan (for the `zstdmt` testing) -- ZlibWrapper tests, including under valgrind -- Versions test (ensuring `zstd` can decode files from all previous versions) -- `pzstd` with asan and tsan, as well as in 32-bits mode -- Testing `zstd` with legacy mode off -- Testing `zbuff` (old streaming API) -- Entire test suite and make install on OS X diff --git a/priv/zstd/appveyor.yml b/priv/zstd/appveyor.yml deleted file mode 100644 index 0f9142b..0000000 --- a/priv/zstd/appveyor.yml +++ /dev/null @@ -1,240 +0,0 @@ -- - version: 1.0.{build} - branches: - only: - - dev - - master - environment: - matrix: - - COMPILER: "gcc" - HOST: "mingw" - PLATFORM: "x64" - SCRIPT: "make allzstd MOREFLAGS=-static && make -C tests test-symbols fullbench-dll fullbench-lib" - ARTIFACT: "true" - BUILD: "true" - - COMPILER: "gcc" - HOST: "mingw" - PLATFORM: "x86" - SCRIPT: "make allzstd MOREFLAGS=-static" - ARTIFACT: "true" - BUILD: "true" - - COMPILER: "clang" - HOST: "mingw" - PLATFORM: "x64" - SCRIPT: "MOREFLAGS='--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion' make allzstd" - BUILD: "true" - - - COMPILER: "gcc" - HOST: "mingw" - PLATFORM: "x64" - SCRIPT: "" - TEST: "cmake" - - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "x64" - CONFIGURATION: "Debug" - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "Win32" - CONFIGURATION: "Debug" - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "x64" - CONFIGURATION: "Release" - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "Win32" - CONFIGURATION: "Release" - - install: - - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION% - - SET PATH_ORIGINAL=%PATH% - - if [%HOST%]==[mingw] ( - SET "PATH_MINGW32=C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin" && - SET "PATH_MINGW64=C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin" && - COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin\make.exe && - COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin\make.exe - ) - - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] ( - SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;" - ) - - build_script: - - if [%HOST%]==[mingw] ( - ( if [%PLATFORM%]==[x64] ( - SET "PATH=%PATH_MINGW64%;%PATH_ORIGINAL%" - ) else if [%PLATFORM%]==[x86] ( - SET "PATH=%PATH_MINGW32%;%PATH_ORIGINAL%" - ) ) - ) - - if [%HOST%]==[mingw] if [%BUILD%]==[true] ( - make -v && - sh -c "%COMPILER% -v" && - ECHO Building zlib to static link && - SET "CC=%COMPILER%" && - sh -c "cd .. && git clone --depth 1 --branch v1.2.11 https://github.com/madler/zlib" && - sh -c "cd ../zlib && make -f win32/Makefile.gcc libz.a" - ECHO Building zstd && - SET "CPPFLAGS=-I../../zlib" && - SET "LDFLAGS=../../zlib/libz.a" && - sh -c "%SCRIPT%" && - ( if [%COMPILER%]==[gcc] if [%ARTIFACT%]==[true] - lib\dll\example\build_package.bat && - make -C programs DEBUGFLAGS= clean zstd && - cd programs\ && 7z a -tzip -mx9 zstd-win-binary-%PLATFORM%.zip zstd.exe && - appveyor PushArtifact zstd-win-binary-%PLATFORM%.zip && - cp zstd.exe ..\bin\zstd.exe && - cd ..\bin\ && 7z a -tzip -mx9 zstd-win-release-%PLATFORM%.zip * && - appveyor PushArtifact zstd-win-release-%PLATFORM%.zip - ) - ) - - if [%HOST%]==[visual] ( - ECHO *** && - ECHO *** Building Visual Studio 2008 %PLATFORM%\%CONFIGURATION% in %APPVEYOR_BUILD_FOLDER% && - ECHO *** && - msbuild "build\VS2008\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v90 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2008\bin\%PLATFORM%\%CONFIGURATION%\*.exe && - MD5sum build/VS2008/bin/%PLATFORM%/%CONFIGURATION%/*.exe && - COPY build\VS2008\bin\%PLATFORM%\%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2008_%PLATFORM%_%CONFIGURATION%.exe && - ECHO *** && - ECHO *** Building Visual Studio 2010 %PLATFORM%\%CONFIGURATION% && - ECHO *** && - msbuild "build\VS2010\zstd.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=v100 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - msbuild "build\VS2010\zstd.sln" %ADDITIONALPARAM% /m /verbosity:minimal /property:PlatformToolset=v100 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2010_%PLATFORM%_%CONFIGURATION%.exe && - ECHO *** && - ECHO *** Building Visual Studio 2012 %PLATFORM%\%CONFIGURATION% && - ECHO *** && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v110 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2012_%PLATFORM%_%CONFIGURATION%.exe && - ECHO *** && - ECHO *** Building Visual Studio 2013 %PLATFORM%\%CONFIGURATION% && - ECHO *** && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v120 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2013_%PLATFORM%_%CONFIGURATION%.exe && - ECHO *** && - ECHO *** Building Visual Studio 2015 %PLATFORM%\%CONFIGURATION% && - ECHO *** && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2015_%PLATFORM%_%CONFIGURATION%.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe tests\ - ) - - test_script: - - ECHO Testing %COMPILER% %PLATFORM% %CONFIGURATION% - - SET "CC=gcc" - - SET "CXX=g++" - - if [%TEST%]==[cmake] ( - mkdir build\cmake\build && - cd build\cmake\build && - cmake -G "Visual Studio 14 2015 Win64" .. && - cd ..\..\.. && - make clean - ) - - SET "FUZZERTEST=-T30s" - - if [%HOST%]==[visual] if [%CONFIGURATION%]==[Release] ( - CD tests && - SET ZSTD=./zstd.exe && - sh -e playTests.sh --test-large-data && - fullbench.exe -i1 && - fullbench.exe -i1 -P0 && - fuzzer_VS2008_%PLATFORM%_Release.exe %FUZZERTEST% && - fuzzer_VS2010_%PLATFORM%_Release.exe %FUZZERTEST% && - fuzzer_VS2012_%PLATFORM%_Release.exe %FUZZERTEST% && - fuzzer_VS2013_%PLATFORM%_Release.exe %FUZZERTEST% && - fuzzer_VS2015_%PLATFORM%_Release.exe %FUZZERTEST% - ) - -- - version: 1.0.{build} - environment: - matrix: - - COMPILER: "gcc" - HOST: "mingw" - PLATFORM: "x64" - SCRIPT: "make allzstd" - - COMPILER: "gcc" - HOST: "mingw" - PLATFORM: "x86" - SCRIPT: "make allzstd" - - COMPILER: "clang" - HOST: "mingw" - PLATFORM: "x64" - SCRIPT: "MOREFLAGS='--target=x86_64-w64-mingw32 -Werror -Wconversion -Wno-sign-conversion' make allzstd" - - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "x64" - CONFIGURATION: "Debug" - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "Win32" - CONFIGURATION: "Debug" - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "x64" - CONFIGURATION: "Release" - - COMPILER: "visual" - HOST: "visual" - PLATFORM: "Win32" - CONFIGURATION: "Release" - - install: - - ECHO Installing %COMPILER% %PLATFORM% %CONFIGURATION% - - SET PATH_ORIGINAL=%PATH% - - if [%HOST%]==[mingw] ( - SET "PATH_MINGW32=C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin" && - SET "PATH_MINGW64=C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin" && - COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\i686-6.3.0-posix-dwarf-rt_v5-rev1\mingw32\bin\make.exe && - COPY C:\msys64\usr\bin\make.exe C:\mingw-w64\x86_64-6.3.0-posix-seh-rt_v5-rev1\mingw64\bin\make.exe - ) - - IF [%HOST%]==[visual] IF [%PLATFORM%]==[x64] ( - SET ADDITIONALPARAM=/p:LibraryPath="C:\Program Files\Microsoft SDKs\Windows\v7.1\lib\x64;c:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\lib\amd64;C:\Program Files (x86)\Microsoft Visual Studio 10.0\;C:\Program Files (x86)\Microsoft Visual Studio 10.0\lib\amd64;" - ) - - build_script: - - ECHO Building %COMPILER% %PLATFORM% %CONFIGURATION% - - if [%HOST%]==[mingw] ( - ( if [%PLATFORM%]==[x64] ( - SET "PATH=%PATH_MINGW64%;%PATH_ORIGINAL%" - ) else if [%PLATFORM%]==[x86] ( - SET "PATH=%PATH_MINGW32%;%PATH_ORIGINAL%" - ) ) && - make -v && - sh -c "%COMPILER% -v" && - set "CC=%COMPILER%" && - sh -c "%SCRIPT%" - ) - - if [%HOST%]==[visual] ( - ECHO *** && - ECHO *** Building Visual Studio 2015 %PLATFORM%\%CONFIGURATION% && - ECHO *** && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /p:ForceImportBeforeCppTargets=%APPVEYOR_BUILD_FOLDER%\build\VS2010\CompileAsCpp.props /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - msbuild "build\VS2010\zstd.sln" /m /verbosity:minimal /property:PlatformToolset=v140 /t:Clean,Build /p:Platform=%PLATFORM% /p:Configuration=%CONFIGURATION% /logger:"C:\Program Files\AppVeyor\BuildAgent\Appveyor.MSBuildLogger.dll" && - DIR build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe && - MD5sum build/VS2010/bin/%PLATFORM%_%CONFIGURATION%/*.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\fuzzer.exe tests\fuzzer_VS2015_%PLATFORM%_%CONFIGURATION%.exe && - COPY build\VS2010\bin\%PLATFORM%_%CONFIGURATION%\*.exe tests\ - ) diff --git a/priv/zstd/build/.gitignore b/priv/zstd/build/.gitignore deleted file mode 100644 index 85bc928..0000000 --- a/priv/zstd/build/.gitignore +++ /dev/null @@ -1,20 +0,0 @@ -# Visual C++ -.vs/ -*Copy -*.db -*.opensdf -*.sdf -*.suo -*.user -*.opendb - -VS2005/ -VS2008/ -VS2010/bin/ -VS2010/zwrapbench/ -VS2012/bin/ -VS2013/bin/ -VS2015/bin/ - -# CMake -cmake/build/ diff --git a/priv/zstd/build/README.md b/priv/zstd/build/README.md deleted file mode 100644 index 23f92ce..0000000 --- a/priv/zstd/build/README.md +++ /dev/null @@ -1,56 +0,0 @@ -Projects for various integrated development environments (IDE) -============================================================== - -#### Included projects - -The following projects are included with the zstd distribution: -- `cmake` - CMake project contributed by Artyom Dymchenko -- `VS2005` - Visual Studio 2005 Project (this project has been moved to the contrib directory and will no longer be supported) -- `VS2008` - Visual Studio 2008 project -- `VS2010` - Visual Studio 2010 project (which also works well with Visual Studio 2012, 2013, 2015) -- `VS_scripts` - command line scripts prepared for Visual Studio compilation without IDE - - -#### How to compile zstd with Visual Studio - -1. Install Visual Studio e.g. VS 2015 Community Edition (it's free). -2. Download the latest version of zstd from https://github.com/facebook/zstd/releases -3. Decompress ZIP archive. -4. Go to decompressed directory then to `projects` then `VS2010` and open `zstd.sln` -5. Visual Studio will ask about converting VS2010 project to VS2015 and you should agree. -6. Change `Debug` to `Release` and if you have 64-bit Windows change also `Win32` to `x64`. -7. Press F7 on keyboard or select `BUILD` from the menu bar and choose `Build Solution`. -8. If compilation will be fine a compiled executable will be in `projects\VS2010\bin\x64\Release\zstd.exe` - - -#### Projects available within zstd.sln - -The Visual Studio solution file `visual\VS2010\zstd.sln` contains many projects that will be compiled to the -`visual\VS2010\bin\$(Platform)_$(Configuration)` directory. For example `zstd` set to `x64` and -`Release` will be compiled to `visual\VS2010\bin\x64_Release\zstd.exe`. The solution file contains the -following projects: - -- `zstd` : Command Line Utility, supporting gzip-like arguments -- `datagen` : Synthetic and parametrable data generator, for tests -- `fullbench` : Precisely measure speed for each zstd inner functions -- `fuzzer` : Test tool, to check zstd integrity on target platform -- `libzstd` : A static ZSTD library compiled to `libzstd_static.lib` -- `libzstd-dll` : A dynamic ZSTD library (DLL) compiled to `libzstd.dll` with the import library `libzstd.lib` -- `fullbench-dll` : The fullbench program compiled with the import library; the executable requires ZSTD DLL - - -#### Using ZSTD DLL with Microsoft Visual C++ project - -The header file `lib\zstd.h` and the import library -`visual\VS2010\bin\$(Platform)_$(Configuration)\libzstd.lib` are required to compile -a project using Visual C++. - -1. The path to header files should be added to `Additional Include Directories` that can - be found in Project Properties of Visual Studio IDE in the `C/C++` Property Pages on the `General` page. -2. The import library has to be added to `Additional Dependencies` that can - be found in Project Properties in the `Linker` Property Pages on the `Input` page. - If one will provide only the name `libzstd.lib` without a full path to the library - then the directory has to be added to `Linker\General\Additional Library Directories`. - -The compiled executable will require ZSTD DLL which is available at -`visual\VS2010\bin\$(Platform)_$(Configuration)\libzstd.dll`. diff --git a/priv/zstd/build/VS2010/CompileAsCpp.props b/priv/zstd/build/VS2010/CompileAsCpp.props deleted file mode 100644 index 372a94b..0000000 --- a/priv/zstd/build/VS2010/CompileAsCpp.props +++ /dev/null @@ -1,8 +0,0 @@ - - - - - CompileAsCpp - - - diff --git a/priv/zstd/build/VS2010/datagen/datagen.vcxproj b/priv/zstd/build/VS2010/datagen/datagen.vcxproj deleted file mode 100644 index bd8a213..0000000 --- a/priv/zstd/build/VS2010/datagen/datagen.vcxproj +++ /dev/null @@ -1,167 +0,0 @@ - - - - - Debug - Win32 - - - Debug - x64 - - - Release - Win32 - - - Release - x64 - - - - {037E781E-81A6-494B-B1B3-438AB1200523} - Win32Proj - datagen - $(SolutionDir)bin\$(Platform)_$(Configuration)\ - $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\ - - - - Application - true - MultiByte - - - Application - true - MultiByte - - - Application - false - true - MultiByte - - - Application - false - true - MultiByte - - - - - - - - - - - - - - - - - - - true - false - $(IncludePath);$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - - - true - false - $(IncludePath);$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - - - false - false - $(IncludePath);$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - - - false - false - $(IncludePath);$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) - true - false - - - Console - true - - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) - true - false - - - Console - true - - - - - Level4 - - - MaxSpeed - true - true - WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - - - - - Level4 - - - MaxSpeed - true - true - WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - - - - - - - - - - - - - \ No newline at end of file diff --git a/priv/zstd/build/VS2010/fullbench-dll/fullbench-dll.vcxproj b/priv/zstd/build/VS2010/fullbench-dll/fullbench-dll.vcxproj deleted file mode 100644 index e697318..0000000 --- a/priv/zstd/build/VS2010/fullbench-dll/fullbench-dll.vcxproj +++ /dev/null @@ -1,185 +0,0 @@ - - - - - Debug - Win32 - - - Debug - x64 - - - Release - Win32 - - - Release - x64 - - - - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8} - Win32Proj - fullbench-dll - $(SolutionDir)bin\$(Platform)_$(Configuration)\ - $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\ - - - - Application - true - MultiByte - - - Application - true - MultiByte - - - Application - false - true - MultiByte - - - Application - false - true - MultiByte - - - - - - - - - - - - - - - - - - - true - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - true - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions) - true - false - - - Console - true - $(SolutionDir)bin\$(Platform)_$(Configuration);%(AdditionalLibraryDirectories) - libzstd.lib;%(AdditionalDependencies) - false - - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions) - true - false - - - Console - true - $(SolutionDir)bin\$(Platform)_$(Configuration);%(AdditionalLibraryDirectories) - libzstd.lib;%(AdditionalDependencies) - - - - - Level4 - - - MaxSpeed - true - true - WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - $(SolutionDir)bin\$(Platform)_$(Configuration);%(AdditionalLibraryDirectories) - libzstd.lib;%(AdditionalDependencies) - false - - - - - Level4 - - - MaxSpeed - true - true - WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - $(SolutionDir)bin\$(Platform)_$(Configuration);%(AdditionalLibraryDirectories) - libzstd.lib;%(AdditionalDependencies) - - - - - - - - - - - - - - - {00000000-94d5-4bf9-8a50-7bd9929a0850} - - - - - - \ No newline at end of file diff --git a/priv/zstd/build/VS2010/fullbench/fullbench.vcxproj b/priv/zstd/build/VS2010/fullbench/fullbench.vcxproj deleted file mode 100644 index d0cbcae..0000000 --- a/priv/zstd/build/VS2010/fullbench/fullbench.vcxproj +++ /dev/null @@ -1,202 +0,0 @@ - - - - - Debug - Win32 - - - Debug - x64 - - - Release - Win32 - - - Release - x64 - - - - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8} - Win32Proj - fullbench - $(SolutionDir)bin\$(Platform)_$(Configuration)\ - $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\ - - - - Application - true - MultiByte - - - Application - true - MultiByte - - - Application - false - true - MultiByte - - - Application - false - true - MultiByte - - - - - - - - - - - - - - - - - - - true - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - true - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath); - false - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) - true - false - - - Console - true - - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) - true - false - - - Console - true - - - - - Level4 - - - MaxSpeed - true - true - WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - - - - - Level4 - - - MaxSpeed - true - true - WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/priv/zstd/build/VS2010/fuzzer/fuzzer.vcxproj b/priv/zstd/build/VS2010/fuzzer/fuzzer.vcxproj deleted file mode 100644 index 6fe3272..0000000 --- a/priv/zstd/build/VS2010/fuzzer/fuzzer.vcxproj +++ /dev/null @@ -1,207 +0,0 @@ - - - - - Debug - Win32 - - - Debug - x64 - - - Release - Win32 - - - Release - x64 - - - - {6FD4352B-346C-4703-96EA-D4A8B9A6976E} - Win32Proj - fuzzer - $(SolutionDir)bin\$(Platform)_$(Configuration)\ - $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\ - - - - Application - true - MultiByte - - - Application - true - MultiByte - - - Application - false - true - MultiByte - - - Application - false - true - MultiByte - - - - - - - - - - - - - - - - - - - true - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath); - - - true - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath); - - - false - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath); - - - false - false - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(SolutionDir)..\..\lib\compress;$(UniversalCRT_IncludePath); - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) - true - false - - - Console - true - - - - - - - Level4 - Disabled - WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions) - true - false - - - Console - true - - - - - Level4 - - - MaxSpeed - true - true - WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - - - - - Level4 - - - MaxSpeed - true - true - WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions) - false - false - MultiThreaded - - - Console - true - true - true - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.rc b/priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.rc deleted file mode 100644 index ee9f562..0000000 --- a/priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.rc +++ /dev/null @@ -1,51 +0,0 @@ -// Microsoft Visual C++ generated resource script. -// - -#include "zstd.h" /* ZSTD_VERSION_STRING */ -#define APSTUDIO_READONLY_SYMBOLS -#include "verrsrc.h" -#undef APSTUDIO_READONLY_SYMBOLS - - -#if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENU) -LANGUAGE 9, 1 - -///////////////////////////////////////////////////////////////////////////// -// -// Version -// - -VS_VERSION_INFO VERSIONINFO - FILEVERSION ZSTD_VERSION_MAJOR,ZSTD_VERSION_MINOR,ZSTD_VERSION_RELEASE,0 - PRODUCTVERSION ZSTD_VERSION_MAJOR,ZSTD_VERSION_MINOR,ZSTD_VERSION_RELEASE,0 - FILEFLAGSMASK VS_FFI_FILEFLAGSMASK -#ifdef _DEBUG - FILEFLAGS VS_FF_DEBUG -#else - FILEFLAGS 0x0L -#endif - FILEOS VOS_NT_WINDOWS32 - FILETYPE VFT_DLL - FILESUBTYPE VFT2_UNKNOWN -BEGIN - BLOCK "StringFileInfo" - BEGIN - BLOCK "040904B0" - BEGIN - VALUE "CompanyName", "Yann Collet, Facebook, Inc." - VALUE "FileDescription", "Zstandard - Fast and efficient compression algorithm" - VALUE "FileVersion", ZSTD_VERSION_STRING - VALUE "InternalName", "libzstd.dll" - VALUE "LegalCopyright", "Copyright (c) 2013-present, Yann Collet, Facebook, Inc." - VALUE "OriginalFilename", "libzstd.dll" - VALUE "ProductName", "Zstandard" - VALUE "ProductVersion", ZSTD_VERSION_STRING - END - END - BLOCK "VarFileInfo" - BEGIN - VALUE "Translation", 0x0409, 1200 - END -END - -#endif diff --git a/priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.vcxproj b/priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.vcxproj deleted file mode 100644 index 2d04c69..0000000 --- a/priv/zstd/build/VS2010/libzstd-dll/libzstd-dll.vcxproj +++ /dev/null @@ -1,243 +0,0 @@ - - - - - Debug - Win32 - - - Debug - x64 - - - Release - Win32 - - - Release - x64 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - {00000000-94D5-4BF9-8A50-7BD9929A0850} - Win32Proj - libzstd-dll - $(SolutionDir)bin\$(Platform)_$(Configuration)\ - $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\ - - - - DynamicLibrary - true - MultiByte - - - DynamicLibrary - true - MultiByte - - - DynamicLibrary - false - true - MultiByte - - - DynamicLibrary - false - true - MultiByte - - - - - - - - - - - - - - - - - - - true - libzstd - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - true - libzstd - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - false - libzstd - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - false - libzstd - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - - - - Level4 - Disabled - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - true - EnableFastChecks - MultiThreadedDebugDLL - EditAndContinue - true - false - - - Console - true - MachineX86 - - - - - - - Level4 - Disabled - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - true - EnableFastChecks - MultiThreadedDebugDLL - ProgramDatabase - false - - - Console - true - - - - - Level4 - - - MaxSpeed - true - true - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - false - MultiThreaded - ProgramDatabase - All - - - Console - true - true - true - MachineX86 - - - - - Level4 - - - MaxSpeed - true - true - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - false - false - MultiThreaded - ProgramDatabase - true - true - All - - - Console - true - true - true - - - - - - diff --git a/priv/zstd/build/VS2010/libzstd/libzstd.vcxproj b/priv/zstd/build/VS2010/libzstd/libzstd.vcxproj deleted file mode 100644 index c01a5d1..0000000 --- a/priv/zstd/build/VS2010/libzstd/libzstd.vcxproj +++ /dev/null @@ -1,240 +0,0 @@ - - - - - Debug - Win32 - - - Debug - x64 - - - Release - Win32 - - - Release - x64 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850} - Win32Proj - libzstd - $(SolutionDir)bin\$(Platform)_$(Configuration)\ - $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\ - - - - StaticLibrary - true - MultiByte - - - StaticLibrary - true - MultiByte - - - StaticLibrary - false - true - MultiByte - - - StaticLibrary - false - true - MultiByte - - - - - - - - - - - - - - - - - - - true - libzstd_static - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - true - libzstd_static - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - false - libzstd_static - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - false - libzstd_static - $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs\legacy;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(SolutionDir)..\..\lib\dictBuilder;$(UniversalCRT_IncludePath); - false - - - - - - Level4 - Disabled - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - true - EnableFastChecks - MultiThreadedDebugDLL - EditAndContinue - true - false - - - Console - true - MachineX86 - - - - - - - Level4 - Disabled - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - true - EnableFastChecks - MultiThreadedDebugDLL - ProgramDatabase - false - - - Console - true - - - - - Level4 - - - MaxSpeed - true - true - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - false - MultiThreaded - ProgramDatabase - All - - - Console - true - true - true - MachineX86 - - - - - Level4 - - - MaxSpeed - true - true - ZSTD_DLL_EXPORT=1;ZSTD_MULTITHREAD=1;ZSTD_LEGACY_SUPPORT=4;WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions) - false - false - MultiThreaded - ProgramDatabase - true - true - All - - - Console - true - true - true - - - - - - diff --git a/priv/zstd/build/VS2010/zstd.sln b/priv/zstd/build/VS2010/zstd.sln deleted file mode 100644 index 12032db..0000000 --- a/priv/zstd/build/VS2010/zstd.sln +++ /dev/null @@ -1,89 +0,0 @@ - -Microsoft Visual Studio Solution File, Format Version 12.00 -# Visual Studio Express 2012 for Windows Desktop -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zstd", "zstd\zstd.vcxproj", "{4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "fuzzer", "fuzzer\fuzzer.vcxproj", "{6FD4352B-346C-4703-96EA-D4A8B9A6976E}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "fullbench", "fullbench\fullbench.vcxproj", "{61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "fullbench-dll", "fullbench-dll\fullbench-dll.vcxproj", "{00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}" - ProjectSection(ProjectDependencies) = postProject - {00000000-94D5-4BF9-8A50-7BD9929A0850} = {00000000-94D5-4BF9-8A50-7BD9929A0850} - EndProjectSection -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "datagen", "datagen\datagen.vcxproj", "{037E781E-81A6-494B-B1B3-438AB1200523}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libzstd", "libzstd\libzstd.vcxproj", "{8BFD8150-94D5-4BF9-8A50-7BD9929A0850}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "libzstd-dll", "libzstd-dll\libzstd-dll.vcxproj", "{00000000-94D5-4BF9-8A50-7BD9929A0850}" -EndProject -Global - GlobalSection(SolutionConfigurationPlatforms) = preSolution - Debug|Win32 = Debug|Win32 - Debug|x64 = Debug|x64 - Release|Win32 = Release|Win32 - Release|x64 = Release|x64 - EndGlobalSection - GlobalSection(ProjectConfigurationPlatforms) = postSolution - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Debug|Win32.ActiveCfg = Debug|Win32 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Debug|Win32.Build.0 = Debug|Win32 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Debug|x64.ActiveCfg = Debug|x64 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Debug|x64.Build.0 = Debug|x64 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Release|Win32.ActiveCfg = Release|Win32 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Release|Win32.Build.0 = Release|Win32 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Release|x64.ActiveCfg = Release|x64 - {4E52A41A-F33B-4C7A-8C36-A1A6B4F4277C}.Release|x64.Build.0 = Release|x64 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Debug|Win32.ActiveCfg = Debug|Win32 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Debug|Win32.Build.0 = Debug|Win32 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Debug|x64.ActiveCfg = Debug|x64 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Debug|x64.Build.0 = Debug|x64 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Release|Win32.ActiveCfg = Release|Win32 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Release|Win32.Build.0 = Release|Win32 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Release|x64.ActiveCfg = Release|x64 - {6FD4352B-346C-4703-96EA-D4A8B9A6976E}.Release|x64.Build.0 = Release|x64 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|Win32.ActiveCfg = Debug|Win32 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|Win32.Build.0 = Debug|Win32 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|x64.ActiveCfg = Debug|x64 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|x64.Build.0 = Debug|x64 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|Win32.ActiveCfg = Release|Win32 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|Win32.Build.0 = Release|Win32 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|x64.ActiveCfg = Release|x64 - {61ABD629-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|x64.Build.0 = Release|x64 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|Win32.ActiveCfg = Debug|Win32 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|Win32.Build.0 = Debug|Win32 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|x64.ActiveCfg = Debug|x64 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Debug|x64.Build.0 = Debug|x64 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|Win32.ActiveCfg = Release|Win32 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|Win32.Build.0 = Release|Win32 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|x64.ActiveCfg = Release|x64 - {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}.Release|x64.Build.0 = Release|x64 - {037E781E-81A6-494B-B1B3-438AB1200523}.Debug|Win32.ActiveCfg = Debug|Win32 - {037E781E-81A6-494B-B1B3-438AB1200523}.Debug|Win32.Build.0 = Debug|Win32 - {037E781E-81A6-494B-B1B3-438AB1200523}.Debug|x64.ActiveCfg = Debug|x64 - {037E781E-81A6-494B-B1B3-438AB1200523}.Debug|x64.Build.0 = Debug|x64 - {037E781E-81A6-494B-B1B3-438AB1200523}.Release|Win32.ActiveCfg = Release|Win32 - {037E781E-81A6-494B-B1B3-438AB1200523}.Release|Win32.Build.0 = Release|Win32 - {037E781E-81A6-494B-B1B3-438AB1200523}.Release|x64.ActiveCfg = Release|x64 - {037E781E-81A6-494B-B1B3-438AB1200523}.Release|x64.Build.0 = Release|x64 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Debug|Win32.ActiveCfg = Debug|Win32 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Debug|Win32.Build.0 = Debug|Win32 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Debug|x64.ActiveCfg = Debug|x64 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Debug|x64.Build.0 = Debug|x64 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Release|Win32.ActiveCfg = Release|Win32 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Release|Win32.Build.0 = Release|Win32 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Release|x64.ActiveCfg = Release|x64 - {8BFD8150-94D5-4BF9-8A50-7BD9929A0850}.Release|x64.Build.0 = Release|x64 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Debug|Win32.ActiveCfg = Debug|Win32 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Debug|Win32.Build.0 = Debug|Win32 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Debug|x64.ActiveCfg = Debug|x64 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Debug|x64.Build.0 = Debug|x64 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Release|Win32.ActiveCfg = Release|Win32 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Release|Win32.Build.0 = Release|Win32 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Release|x64.ActiveCfg = Release|x64 - {00000000-94D5-4BF9-8A50-7BD9929A0850}.Release|x64.Build.0 = Release|x64 - EndGlobalSection - GlobalSection(SolutionProperties) = preSolution - HideSolutionNode = FALSE - EndGlobalSection -EndGlobal diff --git a/priv/zstd/build/VS_scripts/README.md b/priv/zstd/build/VS_scripts/README.md deleted file mode 100644 index 3942e38..0000000 --- a/priv/zstd/build/VS_scripts/README.md +++ /dev/null @@ -1,54 +0,0 @@ -Command line scripts for Visual Studio compilation without IDE -============================================================== - -Here are a few command lines for reference : - -### Build with Visual Studio 2013 for msvcr120.dll - -Running the following command will build both the `Release Win32` and `Release x64` versions: -```batch -build\build.VS2013.cmd -``` -The result of each build will be in the corresponding `build\bin\Release\{ARCH}\` folder. - -If you want to only need one architecture: -- Win32: `build\build.generic.cmd VS2013 Win32 Release v120` -- x64: `build\build.generic.cmd VS2013 x64 Release v120` - -If you want a Debug build: -- Win32: `build\build.generic.cmd VS2013 Win32 Debug v120` -- x64: `build\build.generic.cmd VS2013 x64 Debug v120` - -### Build with Visual Studio 2015 for msvcr140.dll - -Running the following command will build both the `Release Win32` and `Release x64` versions: -```batch -build\build.VS2015.cmd -``` -The result of each build will be in the corresponding `build\bin\Release\{ARCH}\` folder. - -If you want to only need one architecture: -- Win32: `build\build.generic.cmd VS2015 Win32 Release v140` -- x64: `build\build.generic.cmd VS2015 x64 Release v140` - -If you want a Debug build: -- Win32: `build\build.generic.cmd VS2015 Win32 Debug v140` -- x64: `build\build.generic.cmd VS2015 x64 Debug v140` - -### Build with Visual Studio 2015 for msvcr120.dll - -You need to invoke `build\build.generic.cmd` with the proper arguments: - -**For Win32** -```batch -build\build.generic.cmd VS2015 Win32 Release v120 -``` -The result of the build will be in the `build\bin\Release\Win32\` folder. - -**For x64** -```batch -build\build.generic.cmd VS2015 x64 Release v120 -``` -The result of the build will be in the `build\bin\Release\x64\` folder. - -If you want Debug builds, replace `Release` with `Debug`. diff --git a/priv/zstd/build/VS_scripts/build.VS2010.cmd b/priv/zstd/build/VS_scripts/build.VS2010.cmd deleted file mode 100644 index c3bc176..0000000 --- a/priv/zstd/build/VS_scripts/build.VS2010.cmd +++ /dev/null @@ -1,7 +0,0 @@ -@echo off - -rem build 32-bit -call "%~p0%build.generic.cmd" VS2010 Win32 Release v100 - -rem build 64-bit -call "%~p0%build.generic.cmd" VS2010 x64 Release v100 \ No newline at end of file diff --git a/priv/zstd/build/VS_scripts/build.VS2012.cmd b/priv/zstd/build/VS_scripts/build.VS2012.cmd deleted file mode 100644 index d7399a9..0000000 --- a/priv/zstd/build/VS_scripts/build.VS2012.cmd +++ /dev/null @@ -1,6 +0,0 @@ -@echo off - -rem build 32-bit -call "%~p0%build.generic.cmd" VS2012 Win32 Release v110 -rem build 64-bit -call "%~p0%build.generic.cmd" VS2012 x64 Release v110 \ No newline at end of file diff --git a/priv/zstd/build/VS_scripts/build.VS2013.cmd b/priv/zstd/build/VS_scripts/build.VS2013.cmd deleted file mode 100644 index 486ba6c..0000000 --- a/priv/zstd/build/VS_scripts/build.VS2013.cmd +++ /dev/null @@ -1,7 +0,0 @@ -@echo off - -rem build 32-bit -call "%~p0%build.generic.cmd" VS2013 Win32 Release v120 - -rem build 64-bit -call "%~p0%build.generic.cmd" VS2013 x64 Release v120 \ No newline at end of file diff --git a/priv/zstd/build/VS_scripts/build.VS2015.cmd b/priv/zstd/build/VS_scripts/build.VS2015.cmd deleted file mode 100644 index abc41c9..0000000 --- a/priv/zstd/build/VS_scripts/build.VS2015.cmd +++ /dev/null @@ -1,7 +0,0 @@ -@echo off - -rem build 32-bit -call "%~p0%build.generic.cmd" VS2015 Win32 Release v140 - -rem build 64-bit -call "%~p0%build.generic.cmd" VS2015 x64 Release v140 \ No newline at end of file diff --git a/priv/zstd/build/VS_scripts/build.generic.cmd b/priv/zstd/build/VS_scripts/build.generic.cmd deleted file mode 100644 index 3629523..0000000 --- a/priv/zstd/build/VS_scripts/build.generic.cmd +++ /dev/null @@ -1,52 +0,0 @@ -@echo off - -IF "%1%" == "" GOTO display_help - -SETLOCAL - -SET msbuild_version=%1 - -SET msbuild_platform=%2 -IF "%msbuild_platform%" == "" SET msbuild_platform=x64 - -SET msbuild_configuration=%3 -IF "%msbuild_configuration%" == "" SET msbuild_configuration=Release - -SET msbuild_toolset=%4 - -GOTO build - -:display_help - -echo Syntax: build.generic.cmd msbuild_version msbuild_platform msbuild_configuration msbuild_toolset -echo msbuild_version: VS installed version (VS2012, VS2013, VS2015, ...) -echo msbuild_platform: Platform (x64 or Win32) -echo msbuild_configuration: VS configuration (Release or Debug) -echo msbuild_toolset: Platform Toolset (v100, v110, v120, v140) - -EXIT /B 1 - -:build - -SET msbuild="%windir%\Microsoft.NET\Framework\v4.0.30319\MSBuild.exe" -IF %msbuild_version% == VS2013 SET msbuild="%programfiles(x86)%\MSBuild\12.0\Bin\MSBuild.exe" -IF %msbuild_version% == VS2015 SET msbuild="%programfiles(x86)%\MSBuild\14.0\Bin\MSBuild.exe" -rem TODO: Visual Studio "15" (vNext) will use MSBuild 15.0 ? - -SET project="%~p0\..\VS2010\zstd.sln" - -SET msbuild_params=/verbosity:minimal /nologo /t:Clean,Build /p:Platform=%msbuild_platform% /p:Configuration=%msbuild_configuration% -IF NOT "%msbuild_toolset%" == "" SET msbuild_params=%msbuild_params% /p:PlatformToolset=%msbuild_toolset% - -SET output=%~p0%bin -SET output="%output%/%msbuild_configuration%/%msbuild_platform%/" -SET msbuild_params=%msbuild_params% /p:OutDir=%output% - -echo ### Building %msbuild_version% project for %msbuild_configuration% %msbuild_platform% (%msbuild_toolset%)... -echo ### Build Params: %msbuild_params% - -%msbuild% %project% %msbuild_params% -IF ERRORLEVEL 1 EXIT /B 1 -echo # Success -echo # OutDir: %output% -echo # diff --git a/priv/zstd/build/cmake/.gitignore b/priv/zstd/build/cmake/.gitignore deleted file mode 100644 index ad4283f..0000000 --- a/priv/zstd/build/cmake/.gitignore +++ /dev/null @@ -1,7 +0,0 @@ -# cmake artefacts -CMakeCache.txt -CMakeFiles -Makefile -cmake_install.cmake -cmake_uninstall.cmake -*.1 diff --git a/priv/zstd/build/cmake/CMakeLists.txt b/priv/zstd/build/cmake/CMakeLists.txt deleted file mode 100644 index 8e8824e..0000000 --- a/priv/zstd/build/cmake/CMakeLists.txt +++ /dev/null @@ -1,79 +0,0 @@ -# ################################################################ -# Copyright (c) 2016-present, Yann Collet, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PROJECT(zstd) -CMAKE_MINIMUM_REQUIRED(VERSION 2.8.9) -SET(ZSTD_SOURCE_DIR "${CMAKE_CURRENT_SOURCE_DIR}/../..") -LIST(APPEND CMAKE_MODULE_PATH "${CMAKE_CURRENT_SOURCE_DIR}/CMakeModules") - -#----------------------------------------------------------------------------- -# Add extra compilation flags -#----------------------------------------------------------------------------- -INCLUDE(AddZstdCompilationFlags) -ADD_ZSTD_COMPILATION_FLAGS() - -# Always hide XXHash symbols -ADD_DEFINITIONS(-DXXH_NAMESPACE=ZSTD_) - -#----------------------------------------------------------------------------- -# Options -#----------------------------------------------------------------------------- -OPTION(ZSTD_LEGACY_SUPPORT "LEGACY SUPPORT" OFF) -IF (UNIX) - OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" ON) -ELSE (UNIX) - OPTION(ZSTD_MULTITHREAD_SUPPORT "MULTITHREADING SUPPORT" OFF) -ENDIF (UNIX) -OPTION(ZSTD_BUILD_PROGRAMS "BUILD PROGRAMS" ON) -OPTION(ZSTD_BUILD_CONTRIB "BUILD CONTRIB" OFF) -OPTION(ZSTD_BUILD_TESTS "BUILD TESTS" OFF) -if (MSVC) - OPTION(ZSTD_USE_STATIC_RUNTIME "LINK TO STATIC RUN-TIME LIBRARIES" OFF) -endif () - -IF (ZSTD_LEGACY_SUPPORT) - MESSAGE(STATUS "ZSTD_LEGACY_SUPPORT defined!") - ADD_DEFINITIONS(-DZSTD_LEGACY_SUPPORT=4) -ELSE (ZSTD_LEGACY_SUPPORT) - MESSAGE(STATUS "ZSTD_LEGACY_SUPPORT not defined!") - ADD_DEFINITIONS(-DZSTD_LEGACY_SUPPORT=0) -ENDIF (ZSTD_LEGACY_SUPPORT) - -#----------------------------------------------------------------------------- -# Add source directories -#----------------------------------------------------------------------------- -ADD_SUBDIRECTORY(lib) - -IF (ZSTD_BUILD_PROGRAMS) - IF (NOT ZSTD_BUILD_STATIC) - MESSAGE(SEND_ERROR "You need to build static library to build zstd CLI") - ENDIF (NOT ZSTD_BUILD_STATIC) - - ADD_SUBDIRECTORY(programs) -ENDIF (ZSTD_BUILD_PROGRAMS) - -IF (ZSTD_BUILD_TESTS) - IF (NOT ZSTD_BUILD_STATIC) - MESSAGE(SEND_ERROR "You need to build static library to build tests") - ENDIF (NOT ZSTD_BUILD_STATIC) - - ADD_SUBDIRECTORY(tests) -ENDIF (ZSTD_BUILD_TESTS) - -IF (ZSTD_BUILD_CONTRIB) - ADD_SUBDIRECTORY(contrib) -ENDIF (ZSTD_BUILD_CONTRIB) - -#----------------------------------------------------------------------------- -# Add clean-all target -#----------------------------------------------------------------------------- -ADD_CUSTOM_TARGET(clean-all - COMMAND ${CMAKE_BUILD_TOOL} clean - COMMAND rm -rf ${CMAKE_BINARY_DIR}/ -) diff --git a/priv/zstd/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake b/priv/zstd/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake deleted file mode 100644 index a7dc08e..0000000 --- a/priv/zstd/build/cmake/CMakeModules/AddZstdCompilationFlags.cmake +++ /dev/null @@ -1,67 +0,0 @@ -include(CheckCXXCompilerFlag) -include(CheckCCompilerFlag) - -function(EnableCompilerFlag _flag _C _CXX) - string(REGEX REPLACE "\\+" "PLUS" varname "${_flag}") - string(REGEX REPLACE "[^A-Za-z0-9]+" "_" varname "${varname}") - string(REGEX REPLACE "^_+" "" varname "${varname}") - string(TOUPPER "${varname}" varname) - if (_C) - CHECK_C_COMPILER_FLAG(${_flag} C_FLAG_${varname}) - if (C_FLAG_${varname}) - set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${_flag}" PARENT_SCOPE) - endif () - endif () - if (_CXX) - CHECK_CXX_COMPILER_FLAG(${_flag} CXX_FLAG_${varname}) - if (CXX_FLAG_${varname}) - set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${_flag}" PARENT_SCOPE) - endif () - endif () -endfunction() - -MACRO(ADD_ZSTD_COMPILATION_FLAGS) - if (CMAKE_CXX_COMPILER_ID MATCHES "GNU|Clang" OR MINGW) #Not only UNIX but also WIN32 for MinGW - #Set c++11 by default - EnableCompilerFlag("-std=c++11" false true) - #Set c99 by default - EnableCompilerFlag("-std=c99" true false) - EnableCompilerFlag("-Wall" true true) - EnableCompilerFlag("-Wextra" true true) - EnableCompilerFlag("-Wundef" true true) - EnableCompilerFlag("-Wshadow" true true) - EnableCompilerFlag("-Wcast-align" true true) - EnableCompilerFlag("-Wcast-qual" true true) - EnableCompilerFlag("-Wstrict-prototypes" true false) - elseif (MSVC) # Add specific compilation flags for Windows Visual - - set(ACTIVATE_MULTITHREADED_COMPILATION "ON" CACHE BOOL "activate multi-threaded compilation (/MP flag)") - if (CMAKE_GENERATOR MATCHES "Visual Studio" AND ACTIVATE_MULTITHREADED_COMPILATION) - EnableCompilerFlag("/MP" true true) - endif () - - # UNICODE SUPPORT - EnableCompilerFlag("/D_UNICODE" true true) - EnableCompilerFlag("/DUNICODE" true true) - endif () - - # Remove duplicates compilation flags - FOREACH (flag_var CMAKE_C_FLAGS CMAKE_C_FLAGS_DEBUG CMAKE_C_FLAGS_RELEASE - CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELWITHDEBINFO - CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE - CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO) - separate_arguments(${flag_var}) - list(REMOVE_DUPLICATES ${flag_var}) - string(REPLACE ";" " " ${flag_var} "${${flag_var}}") - ENDFOREACH (flag_var) - - if (MSVC AND ZSTD_USE_STATIC_RUNTIME) - FOREACH (flag_var CMAKE_C_FLAGS CMAKE_C_FLAGS_DEBUG CMAKE_C_FLAGS_RELEASE - CMAKE_C_FLAGS_MINSIZEREL CMAKE_C_FLAGS_RELWITHDEBINFO - CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE - CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO) - STRING(REGEX REPLACE "/MD" "/MT" ${flag_var} "${${flag_var}}") - ENDFOREACH (flag_var) - endif () - -ENDMACRO(ADD_ZSTD_COMPILATION_FLAGS) diff --git a/priv/zstd/build/cmake/CMakeModules/GetZstdLibraryVersion.cmake b/priv/zstd/build/cmake/CMakeModules/GetZstdLibraryVersion.cmake deleted file mode 100644 index 8b6f394..0000000 --- a/priv/zstd/build/cmake/CMakeModules/GetZstdLibraryVersion.cmake +++ /dev/null @@ -1,9 +0,0 @@ -function(GetZstdLibraryVersion _header _major _minor _release) - # Read file content - FILE(READ ${_header} CONTENT) - - string(REGEX MATCH ".*define ZSTD_VERSION_MAJOR *([0-9]+).*define ZSTD_VERSION_MINOR *([0-9]+).*define ZSTD_VERSION_RELEASE *([0-9]+)" VERSION_REGEX "${CONTENT}") - SET(${_major} ${CMAKE_MATCH_1} PARENT_SCOPE) - SET(${_minor} ${CMAKE_MATCH_2} PARENT_SCOPE) - SET(${_release} ${CMAKE_MATCH_3} PARENT_SCOPE) -endfunction() diff --git a/priv/zstd/build/cmake/contrib/CMakeLists.txt b/priv/zstd/build/cmake/contrib/CMakeLists.txt deleted file mode 100644 index 8c7bc78..0000000 --- a/priv/zstd/build/cmake/contrib/CMakeLists.txt +++ /dev/null @@ -1,13 +0,0 @@ -# ################################################################ -# Copyright (c) 2016-present, Yann Collet, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PROJECT(contrib) - -ADD_SUBDIRECTORY(pzstd) -ADD_SUBDIRECTORY(gen_html) diff --git a/priv/zstd/build/cmake/contrib/gen_html/CMakeLists.txt b/priv/zstd/build/cmake/contrib/gen_html/CMakeLists.txt deleted file mode 100644 index 01d1906..0000000 --- a/priv/zstd/build/cmake/contrib/gen_html/CMakeLists.txt +++ /dev/null @@ -1,30 +0,0 @@ -# ################################################################ -# Copyright (c) 2015-present, Yann Collet, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PROJECT(gen_html) -INCLUDE(GetZstdLibraryVersion) - -SET(CMAKE_INCLUDE_CURRENT_DIR TRUE) - -# Define programs directory, where sources and header files are located -SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib) -SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs) -SET(GENHTML_DIR ${ZSTD_SOURCE_DIR}/contrib/gen_html) -SET(GENHTML_BINARY ${PROJECT_BINARY_DIR}/gen_html${CMAKE_EXECUTABLE_SUFFIX}) -INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${GENHTML_DIR}) - -ADD_EXECUTABLE(gen_html ${GENHTML_DIR}/gen_html.cpp) - -GetZstdLibraryVersion(${LIBRARY_DIR}/zstd.h VMAJOR VMINOR VRELEASE) -SET(LIBVERSION "${VMAJOR}.${VMINOR}.${VRELEASE}") -ADD_CUSTOM_TARGET(zstd_manual.html ALL - ${GENHTML_BINARY} "${LIBVERSION}" "${LIBRARY_DIR}/zstd.h" "${PROJECT_BINARY_DIR}/zstd_manual.html" - DEPENDS gen_html COMMENT "Update zstd manual") - -INSTALL(FILES "${PROJECT_BINARY_DIR}/zstd_manual.html" DESTINATION "share/doc") diff --git a/priv/zstd/build/cmake/contrib/pzstd/CMakeLists.txt b/priv/zstd/build/cmake/contrib/pzstd/CMakeLists.txt deleted file mode 100644 index e6db471..0000000 --- a/priv/zstd/build/cmake/contrib/pzstd/CMakeLists.txt +++ /dev/null @@ -1,32 +0,0 @@ -# ################################################################ -# Copyright (c) 2016-present, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PROJECT(pzstd) - -SET(CMAKE_INCLUDE_CURRENT_DIR TRUE) - -# Define programs directory, where sources and header files are located -SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib) -SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs) -SET(PZSTD_DIR ${ZSTD_SOURCE_DIR}/contrib/pzstd) -INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${PZSTD_DIR}) - -ADD_EXECUTABLE(pzstd ${PZSTD_DIR}/main.cpp ${PZSTD_DIR}/Options.cpp ${PZSTD_DIR}/Pzstd.cpp ${PZSTD_DIR}/SkippableFrame.cpp) -SET_PROPERTY(TARGET pzstd APPEND PROPERTY COMPILE_DEFINITIONS "NDEBUG") -SET_PROPERTY(TARGET pzstd APPEND PROPERTY COMPILE_OPTIONS "-Wno-shadow") - -SET(THREADS_PREFER_PTHREAD_FLAG ON) -FIND_PACKAGE(Threads REQUIRED) -IF (CMAKE_USE_PTHREADS_INIT) - TARGET_LINK_LIBRARIES(pzstd libzstd_shared ${CMAKE_THREAD_LIBS_INIT}) -ELSE() - MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads") -ENDIF() - -INSTALL(TARGETS pzstd RUNTIME DESTINATION "bin") diff --git a/priv/zstd/build/cmake/lib/.gitignore b/priv/zstd/build/cmake/lib/.gitignore deleted file mode 100644 index a4444c8..0000000 --- a/priv/zstd/build/cmake/lib/.gitignore +++ /dev/null @@ -1,2 +0,0 @@ -# cmake build artefact -libzstd.pc diff --git a/priv/zstd/build/cmake/lib/CMakeLists.txt b/priv/zstd/build/cmake/lib/CMakeLists.txt deleted file mode 100644 index fd20bdb..0000000 --- a/priv/zstd/build/cmake/lib/CMakeLists.txt +++ /dev/null @@ -1,183 +0,0 @@ -# ################################################################ -# Copyright (c) 2015-present, Yann Collet, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PROJECT(libzstd) - -SET(CMAKE_INCLUDE_CURRENT_DIR TRUE) -OPTION(ZSTD_BUILD_STATIC "BUILD STATIC LIBRARIES" ON) -OPTION(ZSTD_BUILD_SHARED "BUILD SHARED LIBRARIES" ON) - -IF(NOT ZSTD_BUILD_SHARED AND NOT ZSTD_BUILD_STATIC) - MESSAGE(SEND_ERROR "You need to build at least one flavor of libstd") -ENDIF() - -# Define library directory, where sources and header files are located -SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib) -INCLUDE_DIRECTORIES(${LIBRARY_DIR} ${LIBRARY_DIR}/common) - -# Parse version -INCLUDE(GetZstdLibraryVersion) -GetZstdLibraryVersion(${LIBRARY_DIR}/zstd.h LIBVER_MAJOR LIBVER_MINOR LIBVER_RELEASE) -MESSAGE("ZSTD VERSION ${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}") - -SET(Sources - ${LIBRARY_DIR}/common/entropy_common.c - ${LIBRARY_DIR}/common/fse_decompress.c - ${LIBRARY_DIR}/common/threading.c - ${LIBRARY_DIR}/common/pool.c - ${LIBRARY_DIR}/common/zstd_common.c - ${LIBRARY_DIR}/common/error_private.c - ${LIBRARY_DIR}/common/xxhash.c - ${LIBRARY_DIR}/compress/fse_compress.c - ${LIBRARY_DIR}/compress/huf_compress.c - ${LIBRARY_DIR}/compress/zstd_compress.c - ${LIBRARY_DIR}/compress/zstdmt_compress.c - ${LIBRARY_DIR}/compress/zstd_fast.c - ${LIBRARY_DIR}/compress/zstd_double_fast.c - ${LIBRARY_DIR}/compress/zstd_lazy.c - ${LIBRARY_DIR}/compress/zstd_opt.c - ${LIBRARY_DIR}/compress/zstd_ldm.c - ${LIBRARY_DIR}/decompress/huf_decompress.c - ${LIBRARY_DIR}/decompress/zstd_decompress.c - ${LIBRARY_DIR}/dictBuilder/cover.c - ${LIBRARY_DIR}/dictBuilder/divsufsort.c - ${LIBRARY_DIR}/dictBuilder/zdict.c - ${LIBRARY_DIR}/deprecated/zbuff_common.c - ${LIBRARY_DIR}/deprecated/zbuff_compress.c - ${LIBRARY_DIR}/deprecated/zbuff_decompress.c) - -SET(Headers - ${LIBRARY_DIR}/zstd.h - ${LIBRARY_DIR}/common/pool.h - ${LIBRARY_DIR}/common/threading.h - ${LIBRARY_DIR}/common/bitstream.h - ${LIBRARY_DIR}/common/error_private.h - ${LIBRARY_DIR}/common/zstd_errors.h - ${LIBRARY_DIR}/common/fse.h - ${LIBRARY_DIR}/common/huf.h - ${LIBRARY_DIR}/common/mem.h - ${LIBRARY_DIR}/common/zstd_internal.h - ${LIBRARY_DIR}/compress/zstd_compress_internal.h - ${LIBRARY_DIR}/compress/zstd_fast.h - ${LIBRARY_DIR}/compress/zstd_double_fast.h - ${LIBRARY_DIR}/compress/zstd_lazy.h - ${LIBRARY_DIR}/compress/zstd_opt.h - ${LIBRARY_DIR}/compress/zstd_ldm.h - ${LIBRARY_DIR}/compress/zstdmt_compress.h - ${LIBRARY_DIR}/dictBuilder/zdict.h - ${LIBRARY_DIR}/deprecated/zbuff.h) - -IF (ZSTD_LEGACY_SUPPORT) - SET(LIBRARY_LEGACY_DIR ${LIBRARY_DIR}/legacy) - INCLUDE_DIRECTORIES(${LIBRARY_LEGACY_DIR}) - - SET(Sources ${Sources} - ${LIBRARY_LEGACY_DIR}/zstd_v01.c - ${LIBRARY_LEGACY_DIR}/zstd_v02.c - ${LIBRARY_LEGACY_DIR}/zstd_v03.c - ${LIBRARY_LEGACY_DIR}/zstd_v04.c - ${LIBRARY_LEGACY_DIR}/zstd_v05.c - ${LIBRARY_LEGACY_DIR}/zstd_v06.c - ${LIBRARY_LEGACY_DIR}/zstd_v07.c) - - SET(Headers ${Headers} - ${LIBRARY_LEGACY_DIR}/zstd_legacy.h - ${LIBRARY_LEGACY_DIR}/zstd_v01.h - ${LIBRARY_LEGACY_DIR}/zstd_v02.h - ${LIBRARY_LEGACY_DIR}/zstd_v03.h - ${LIBRARY_LEGACY_DIR}/zstd_v04.h - ${LIBRARY_LEGACY_DIR}/zstd_v05.h - ${LIBRARY_LEGACY_DIR}/zstd_v06.h - ${LIBRARY_LEGACY_DIR}/zstd_v07.h) -ENDIF (ZSTD_LEGACY_SUPPORT) - -IF (MSVC) - SET(MSVC_RESOURCE_DIR ${ZSTD_SOURCE_DIR}/build/VS2010/libzstd-dll) - SET(PlatformDependResources ${MSVC_RESOURCE_DIR}/libzstd-dll.rc) -ENDIF (MSVC) - -# Split project to static and shared libraries build -IF (ZSTD_BUILD_SHARED) - ADD_LIBRARY(libzstd_shared SHARED ${Sources} ${Headers} ${PlatformDependResources}) -ENDIF (ZSTD_BUILD_SHARED) -IF (ZSTD_BUILD_STATIC) - ADD_LIBRARY(libzstd_static STATIC ${Sources} ${Headers}) -ENDIF (ZSTD_BUILD_STATIC) - -# Add specific compile definitions for MSVC project -IF (MSVC) - IF (ZSTD_BUILD_SHARED) - SET_PROPERTY(TARGET libzstd_shared APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_DLL_EXPORT=1;ZSTD_HEAPMODE=0;_CONSOLE;_CRT_SECURE_NO_WARNINGS") - ENDIF (ZSTD_BUILD_SHARED) - IF (ZSTD_BUILD_STATIC) - SET_PROPERTY(TARGET libzstd_static APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_HEAPMODE=0;_CRT_SECURE_NO_WARNINGS") - ENDIF (ZSTD_BUILD_STATIC) -ENDIF (MSVC) - -# With MSVC static library needs to be renamed to avoid conflict with import library -IF (MSVC) - SET(STATIC_LIBRARY_BASE_NAME zstd_static) -ELSE () - SET(STATIC_LIBRARY_BASE_NAME zstd) -ENDIF (MSVC) - -# Define static and shared library names -IF (ZSTD_BUILD_SHARED) - SET_TARGET_PROPERTIES( - libzstd_shared - PROPERTIES - OUTPUT_NAME zstd - SOVERSION ${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}) -ENDIF (ZSTD_BUILD_SHARED) - -IF (ZSTD_BUILD_STATIC) - SET_TARGET_PROPERTIES( - libzstd_static - PROPERTIES - OUTPUT_NAME ${STATIC_LIBRARY_BASE_NAME}) -ENDIF (ZSTD_BUILD_STATIC) - -IF (UNIX) - # pkg-config - SET(PREFIX "${CMAKE_INSTALL_PREFIX}") - SET(LIBDIR "${CMAKE_INSTALL_PREFIX}/lib") - SET(INCLUDEDIR "${CMAKE_INSTALL_PREFIX}/include") - SET(VERSION "${LIBVER_MAJOR}.${LIBVER_MINOR}.${LIBVER_RELEASE}") - ADD_CUSTOM_TARGET(libzstd.pc ALL - ${CMAKE_COMMAND} -DIN="${LIBRARY_DIR}/libzstd.pc.in" -DOUT="libzstd.pc" - -DPREFIX="${PREFIX}" -DLIBDIR="${LIBDIR}" -DINCLUDEDIR="${INCLUDEDIR}" -DVERSION="${VERSION}" - -P "${CMAKE_CURRENT_SOURCE_DIR}/pkgconfig.cmake" - COMMENT "Creating pkg-config file") - - INSTALL(FILES "${CMAKE_CURRENT_BINARY_DIR}/libzstd.pc" DESTINATION "share/pkgconfig") -ENDIF (UNIX) - -# install target -INSTALL(FILES - ${LIBRARY_DIR}/zstd.h - ${LIBRARY_DIR}/deprecated/zbuff.h - ${LIBRARY_DIR}/dictBuilder/zdict.h - ${LIBRARY_DIR}/common/zstd_errors.h - DESTINATION "include") - -IF (ZSTD_BUILD_SHARED) - INSTALL(TARGETS libzstd_shared RUNTIME DESTINATION "bin" LIBRARY DESTINATION "lib" ARCHIVE DESTINATION "lib") -ENDIF() -IF (ZSTD_BUILD_STATIC) - INSTALL(TARGETS libzstd_static ARCHIVE DESTINATION "lib") -ENDIF (ZSTD_BUILD_STATIC) - -# uninstall target -CONFIGURE_FILE( - "${CMAKE_CURRENT_SOURCE_DIR}/cmake_uninstall.cmake.in" - "${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake" - IMMEDIATE @ONLY) - -ADD_CUSTOM_TARGET(uninstall - COMMAND ${CMAKE_COMMAND} -P ${CMAKE_CURRENT_BINARY_DIR}/cmake_uninstall.cmake) diff --git a/priv/zstd/build/cmake/lib/cmake_uninstall.cmake.in b/priv/zstd/build/cmake/lib/cmake_uninstall.cmake.in deleted file mode 100644 index e3774dc..0000000 --- a/priv/zstd/build/cmake/lib/cmake_uninstall.cmake.in +++ /dev/null @@ -1,22 +0,0 @@ - -if(NOT EXISTS "@CMAKE_BINARY_DIR@/install_manifest.txt") - message(FATAL_ERROR "Cannot find install manifest: @CMAKE_BINARY_DIR@/install_manifest.txt") -endif(NOT EXISTS "@CMAKE_BINARY_DIR@/install_manifest.txt") - -file(READ "@CMAKE_BINARY_DIR@/install_manifest.txt" files) -string(REGEX REPLACE "\n" ";" files "${files}") -foreach(file ${files}) - message(STATUS "Uninstalling $ENV{DESTDIR}${file}") - if(IS_SYMLINK "$ENV{DESTDIR}${file}" OR EXISTS "$ENV{DESTDIR}${file}") - exec_program( - "@CMAKE_COMMAND@" ARGS "-E remove \"$ENV{DESTDIR}${file}\"" - OUTPUT_VARIABLE rm_out - RETURN_VALUE rm_retval - ) - if(NOT "${rm_retval}" STREQUAL 0) - message(FATAL_ERROR "Problem when removing $ENV{DESTDIR}${file}") - endif(NOT "${rm_retval}" STREQUAL 0) - else(IS_SYMLINK "$ENV{DESTDIR}${file}" OR EXISTS "$ENV{DESTDIR}${file}") - message(STATUS "File $ENV{DESTDIR}${file} does not exist.") - endif(IS_SYMLINK "$ENV{DESTDIR}${file}" OR EXISTS "$ENV{DESTDIR}${file}") -endforeach(file) diff --git a/priv/zstd/build/cmake/lib/pkgconfig.cmake b/priv/zstd/build/cmake/lib/pkgconfig.cmake deleted file mode 100644 index 5434ff7..0000000 --- a/priv/zstd/build/cmake/lib/pkgconfig.cmake +++ /dev/null @@ -1 +0,0 @@ -CONFIGURE_FILE("${IN}" "${OUT}" @ONLY) diff --git a/priv/zstd/build/cmake/programs/.gitignore b/priv/zstd/build/cmake/programs/.gitignore deleted file mode 100644 index ae3a8a3..0000000 --- a/priv/zstd/build/cmake/programs/.gitignore +++ /dev/null @@ -1,5 +0,0 @@ -# produced by make -zstd -zstd-frugal -unzstd -zstdcat diff --git a/priv/zstd/build/cmake/programs/CMakeLists.txt b/priv/zstd/build/cmake/programs/CMakeLists.txt deleted file mode 100644 index 9251fd2..0000000 --- a/priv/zstd/build/cmake/programs/CMakeLists.txt +++ /dev/null @@ -1,97 +0,0 @@ -# ################################################################ -# Copyright (c) 2015-present, Yann Collet, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -PROJECT(programs) - -SET(CMAKE_INCLUDE_CURRENT_DIR TRUE) - -# Define programs directory, where sources and header files are located -SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib) -SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs) -INCLUDE_DIRECTORIES(${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${LIBRARY_DIR}/compress ${LIBRARY_DIR}/dictBuilder) - -IF (ZSTD_LEGACY_SUPPORT) - SET(PROGRAMS_LEGACY_DIR ${PROGRAMS_DIR}/legacy) - INCLUDE_DIRECTORIES(${PROGRAMS_LEGACY_DIR} ${LIBRARY_DIR}/legacy) -ENDIF (ZSTD_LEGACY_SUPPORT) - -IF (MSVC) - SET(MSVC_RESOURCE_DIR ${ZSTD_SOURCE_DIR}/build/VS2010/zstd) - SET(PlatformDependResources ${MSVC_RESOURCE_DIR}/zstd.rc) -ENDIF (MSVC) - -ADD_EXECUTABLE(zstd ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c ${PROGRAMS_DIR}/bench.c ${PROGRAMS_DIR}/datagen.c ${PROGRAMS_DIR}/dibio.c ${PlatformDependResources}) -TARGET_LINK_LIBRARIES(zstd libzstd_static) -IF (CMAKE_SYSTEM_NAME MATCHES "(Solaris|SunOS)") - TARGET_LINK_LIBRARIES(zstd rt) -ENDIF (CMAKE_SYSTEM_NAME MATCHES "(Solaris|SunOS)") -INSTALL(TARGETS zstd RUNTIME DESTINATION "bin") - -IF (UNIX) - ADD_CUSTOM_TARGET(zstdcat ALL ${CMAKE_COMMAND} -E create_symlink zstd zstdcat DEPENDS zstd COMMENT "Creating zstdcat symlink") - ADD_CUSTOM_TARGET(unzstd ALL ${CMAKE_COMMAND} -E create_symlink zstd unzstd DEPENDS zstd COMMENT "Creating unzstd symlink") - INSTALL(TARGETS zstd RUNTIME DESTINATION "bin") - INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdcat DESTINATION "bin") - INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/unzstd DESTINATION "bin") - - ADD_CUSTOM_TARGET(zstd.1 ALL - ${CMAKE_COMMAND} -E copy ${PROGRAMS_DIR}/zstd.1 . - COMMENT "Copying manpage zstd.1") - ADD_CUSTOM_TARGET(zstdcat.1 ALL ${CMAKE_COMMAND} -E create_symlink zstd.1 zstdcat.1 DEPENDS zstd.1 COMMENT "Creating zstdcat.1 symlink") - ADD_CUSTOM_TARGET(unzstd.1 ALL ${CMAKE_COMMAND} -E create_symlink zstd.1 unzstd.1 DEPENDS zstd.1 COMMENT "Creating unzstd.1 symlink") - INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstd.1 DESTINATION "share/man/man1") - INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdcat.1 DESTINATION "share/man/man1") - INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/unzstd.1 DESTINATION "share/man/man1") - - ADD_EXECUTABLE(zstd-frugal ${PROGRAMS_DIR}/zstdcli.c ${PROGRAMS_DIR}/fileio.c) - TARGET_LINK_LIBRARIES(zstd-frugal libzstd_static) - SET_PROPERTY(TARGET zstd-frugal APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_NOBENCH;ZSTD_NODICT") -ENDIF (UNIX) - -IF (ZSTD_MULTITHREAD_SUPPORT) - SET_PROPERTY(TARGET zstd APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_MULTITHREAD") - - SET(THREADS_PREFER_PTHREAD_FLAG ON) - FIND_PACKAGE(Threads REQUIRED) - IF (CMAKE_USE_PTHREADS_INIT) - TARGET_LINK_LIBRARIES(zstd ${CMAKE_THREAD_LIBS_INIT}) - ELSE() - MESSAGE(SEND_ERROR "ZSTD currently does not support thread libraries other than pthreads") - ENDIF() - - ADD_CUSTOM_TARGET(zstdmt ALL ${CMAKE_COMMAND} -E create_symlink zstd zstdmt DEPENDS zstd COMMENT "Creating zstdmt symlink") - INSTALL(FILES ${CMAKE_CURRENT_BINARY_DIR}/zstdmt DESTINATION "bin") -ENDIF (ZSTD_MULTITHREAD_SUPPORT) - -OPTION(ZSTD_ZLIB_SUPPORT "ZLIB SUPPORT" OFF) -OPTION(ZSTD_LZMA_SUPPORT "LZMA SUPPORT" OFF) - -IF (ZSTD_ZLIB_SUPPORT) - FIND_PACKAGE(ZLIB REQUIRED) - - IF (ZLIB_FOUND) - INCLUDE_DIRECTORIES(${ZLIB_INCLUDE_DIRS}) - TARGET_LINK_LIBRARIES(zstd ${ZLIB_LIBRARIES}) - SET_PROPERTY(TARGET zstd APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_GZCOMPRESS;ZSTD_GZDECOMPRESS") - ELSE () - MESSAGE(SEND_ERROR "zlib library is missing") - ENDIF () -ENDIF () - -IF (ZSTD_LZMA_SUPPORT) - FIND_PACKAGE(LibLZMA REQUIRED) - - IF (LIBLZMA_FOUND) - INCLUDE_DIRECTORIES(${LIBLZMA_INCLUDE_DIRS}) - TARGET_LINK_LIBRARIES(zstd ${LIBLZMA_LIBRARIES}) - SET_PROPERTY(TARGET zstd APPEND PROPERTY COMPILE_DEFINITIONS "ZSTD_LZMACOMPRESS;ZSTD_LZMADECOMPRESS") - ELSE () - MESSAGE(SEND_ERROR "lzma library is missing") - ENDIF () -ENDIF () diff --git a/priv/zstd/build/cmake/tests/.gitignore b/priv/zstd/build/cmake/tests/.gitignore deleted file mode 100644 index 2ab62a3..0000000 --- a/priv/zstd/build/cmake/tests/.gitignore +++ /dev/null @@ -1,7 +0,0 @@ -# produced by make -datagen -fullbench -fuzzer -paramgrill -zbufftest - diff --git a/priv/zstd/build/cmake/tests/CMakeLists.txt b/priv/zstd/build/cmake/tests/CMakeLists.txt deleted file mode 100644 index cb327e4..0000000 --- a/priv/zstd/build/cmake/tests/CMakeLists.txt +++ /dev/null @@ -1,55 +0,0 @@ -# ################################################################ -# zstd - Makefile -# Copyright (C) Yann Collet 2014-2016 -# All rights reserved. -# -# BSD license -# -# Redistribution and use in source and binary forms, with or without modification, -# are permitted provided that the following conditions are met: -# -# * Redistributions of source code must retain the above copyright notice, this -# list of conditions and the following disclaimer. -# -# * Redistributions in binary form must reproduce the above copyright notice, this -# list of conditions and the following disclaimer in the documentation and/or -# other materials provided with the distribution. -# -# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND -# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED -# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE -# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR -# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES -# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; -# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON -# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -# -# You can contact the author at : -# - zstd homepage : http://www.zstd.net/ -# ################################################################ - -PROJECT(tests) - -SET(CMAKE_INCLUDE_CURRENT_DIR TRUE) - -# Define programs directory, where sources and header files are located -SET(LIBRARY_DIR ${ZSTD_SOURCE_DIR}/lib) -SET(PROGRAMS_DIR ${ZSTD_SOURCE_DIR}/programs) -SET(TESTS_DIR ${ZSTD_SOURCE_DIR}/tests) -INCLUDE_DIRECTORIES(${TESTS_DIR} ${PROGRAMS_DIR} ${LIBRARY_DIR} ${LIBRARY_DIR}/common ${LIBRARY_DIR}/compress ${LIBRARY_DIR}/dictBuilder) - -ADD_EXECUTABLE(fullbench ${PROGRAMS_DIR}/datagen.c ${TESTS_DIR}/fullbench.c) -TARGET_LINK_LIBRARIES(fullbench libzstd_static) - -ADD_EXECUTABLE(fuzzer ${PROGRAMS_DIR}/datagen.c ${TESTS_DIR}/fuzzer.c) -TARGET_LINK_LIBRARIES(fuzzer libzstd_static) - -IF (UNIX) - ADD_EXECUTABLE(paramgrill ${PROGRAMS_DIR}/datagen.c ${TESTS_DIR}/paramgrill.c) - TARGET_LINK_LIBRARIES(paramgrill libzstd_static m) #m is math library - - ADD_EXECUTABLE(datagen ${PROGRAMS_DIR}/datagen.c ${TESTS_DIR}/datagencli.c) - TARGET_LINK_LIBRARIES(datagen libzstd_static) -ENDIF (UNIX) diff --git a/priv/zstd/circle.yml b/priv/zstd/circle.yml deleted file mode 100644 index ed50d59..0000000 --- a/priv/zstd/circle.yml +++ /dev/null @@ -1,63 +0,0 @@ -dependencies: - override: - - sudo dpkg --add-architecture i386 - - sudo add-apt-repository -y ppa:ubuntu-toolchain-r/test; sudo apt-get -y -qq update - - sudo apt-get -y install gcc-powerpc-linux-gnu gcc-arm-linux-gnueabi libc6-dev-armel-cross gcc-aarch64-linux-gnu libc6-dev-arm64-cross - -test: - override: - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then cc -v; CFLAGS="-O0 -Werror" make all && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make gnu90build && make clean; fi - : - parallel: true - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then make c99build && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make gnu99build && make clean; fi - : - parallel: true - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then make c11build && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make ppc64build && make clean; fi - : - parallel: true - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then make aarch64build && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make ppcbuild && make clean; fi - : - parallel: true - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then make -j regressiontest && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make armbuild && make clean; fi - : - parallel: true - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then make shortest && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make -C tests test-legacy test-longmatch test-symbols && make clean; fi - : - parallel: true - - ? | - if [[ "$CIRCLE_NODE_INDEX" == "0" ]] ; then make cxxtest && make clean; fi && - if [[ "$CIRCLE_NODE_TOTAL" < "2" ]] || [[ "$CIRCLE_NODE_INDEX" == "1" ]]; then make -C lib libzstd-nomt && make clean; fi - : - parallel: true - - post: - - echo Circle CI tests finished - - # Longer tests - #- make -C tests test-zstd-nolegacy && make clean - #- pyenv global 3.4.4; make -C tests versionsTest && make clean - #- make zlibwrapper && make clean - #- gcc -v; make -C tests test32 MOREFLAGS="-I/usr/include/x86_64-linux-gnu" && make clean - #- make uasan && make clean - #- make asan32 && make clean - #- make -C tests test32 CC=clang MOREFLAGS="-g -fsanitize=address -I/usr/include/x86_64-linux-gnu" - # Valgrind tests - #- CFLAGS="-O1 -g" make -C zlibWrapper valgrindTest && make clean - #- make -C tests valgrindTest && make clean - # ARM, AArch64, PowerPC, PowerPC64 tests - #- make ppctest && make clean - #- make ppc64test && make clean - #- make armtest && make clean - #- make aarch64test && make clean diff --git a/priv/zstd/contrib/VS2005/README.md b/priv/zstd/contrib/VS2005/README.md deleted file mode 100644 index ec1ef68..0000000 --- a/priv/zstd/contrib/VS2005/README.md +++ /dev/null @@ -1,3 +0,0 @@ -## Project Support Notice - -The VS2005 Project directory has been moved to the contrib directory in order to indicate that it will no longer be supported. diff --git a/priv/zstd/contrib/VS2005/fullbench/fullbench.vcproj b/priv/zstd/contrib/VS2005/fullbench/fullbench.vcproj deleted file mode 100644 index c67490c..0000000 --- a/priv/zstd/contrib/VS2005/fullbench/fullbench.vcproj +++ /dev/null @@ -1,440 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/priv/zstd/contrib/VS2005/fuzzer/fuzzer.vcproj b/priv/zstd/contrib/VS2005/fuzzer/fuzzer.vcproj deleted file mode 100644 index c64c503..0000000 --- a/priv/zstd/contrib/VS2005/fuzzer/fuzzer.vcproj +++ /dev/null @@ -1,488 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/priv/zstd/contrib/VS2005/zstd.sln b/priv/zstd/contrib/VS2005/zstd.sln deleted file mode 100644 index 0c31ae1..0000000 --- a/priv/zstd/contrib/VS2005/zstd.sln +++ /dev/null @@ -1,55 +0,0 @@ -Microsoft Visual Studio Solution File, Format Version 9.00 -# Visual C++ Express 2005 -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zstd", "zstd\zstd.vcproj", "{1A2AB08E-5CE7-4C5B-BE55-458157C14051}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "fuzzer", "fuzzer\fuzzer.vcproj", "{A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "fullbench", "fullbench\fullbench.vcproj", "{CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}" -EndProject -Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zstdlib", "zstdlib\zstdlib.vcproj", "{99DE2A79-7298-4004-A0ED-030D7A3796CA}" -EndProject -Global - GlobalSection(SolutionConfigurationPlatforms) = preSolution - Debug|Win32 = Debug|Win32 - Debug|x64 = Debug|x64 - Release|Win32 = Release|Win32 - Release|x64 = Release|x64 - EndGlobalSection - GlobalSection(ProjectConfigurationPlatforms) = postSolution - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Debug|Win32.ActiveCfg = Debug|Win32 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Debug|Win32.Build.0 = Debug|Win32 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Debug|x64.ActiveCfg = Debug|x64 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Debug|x64.Build.0 = Debug|x64 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Release|Win32.ActiveCfg = Release|Win32 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Release|Win32.Build.0 = Release|Win32 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Release|x64.ActiveCfg = Release|x64 - {1A2AB08E-5CE7-4C5B-BE55-458157C14051}.Release|x64.Build.0 = Release|x64 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Debug|Win32.ActiveCfg = Debug|Win32 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Debug|Win32.Build.0 = Debug|Win32 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Debug|x64.ActiveCfg = Debug|x64 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Debug|x64.Build.0 = Debug|x64 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Release|Win32.ActiveCfg = Release|Win32 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Release|Win32.Build.0 = Release|Win32 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Release|x64.ActiveCfg = Release|x64 - {A62E89D2-9DDE-42BA-8F9B-9DA74889A6B0}.Release|x64.Build.0 = Release|x64 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Debug|Win32.ActiveCfg = Debug|Win32 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Debug|Win32.Build.0 = Debug|Win32 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Debug|x64.ActiveCfg = Debug|x64 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Debug|x64.Build.0 = Debug|x64 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Release|Win32.ActiveCfg = Release|Win32 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Release|Win32.Build.0 = Release|Win32 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Release|x64.ActiveCfg = Release|x64 - {CC8F1D1B-BA2F-43E3-A71F-FA415D81AAD3}.Release|x64.Build.0 = Release|x64 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Debug|Win32.ActiveCfg = Debug|Win32 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Debug|Win32.Build.0 = Debug|Win32 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Debug|x64.ActiveCfg = Debug|x64 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Debug|x64.Build.0 = Debug|x64 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Release|Win32.ActiveCfg = Release|Win32 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Release|Win32.Build.0 = Release|Win32 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Release|x64.ActiveCfg = Release|x64 - {99DE2A79-7298-4004-A0ED-030D7A3796CA}.Release|x64.Build.0 = Release|x64 - EndGlobalSection - GlobalSection(SolutionProperties) = preSolution - HideSolutionNode = FALSE - EndGlobalSection -EndGlobal diff --git a/priv/zstd/contrib/VS2005/zstdlib/zstdlib.vcproj b/priv/zstd/contrib/VS2005/zstdlib/zstdlib.vcproj deleted file mode 100644 index f77df78..0000000 --- a/priv/zstd/contrib/VS2005/zstdlib/zstdlib.vcproj +++ /dev/null @@ -1,562 +0,0 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/priv/zstd/contrib/adaptive-compression/Makefile b/priv/zstd/contrib/adaptive-compression/Makefile deleted file mode 100644 index c64fce9..0000000 --- a/priv/zstd/contrib/adaptive-compression/Makefile +++ /dev/null @@ -1,76 +0,0 @@ - -ZSTDDIR = ../../lib -PRGDIR = ../../programs -ZSTDCOMMON_FILES := $(ZSTDDIR)/common/*.c -ZSTDCOMP_FILES := $(ZSTDDIR)/compress/*.c -ZSTDDECOMP_FILES := $(ZSTDDIR)/decompress/*.c -ZSTD_FILES := $(ZSTDDECOMP_FILES) $(ZSTDCOMMON_FILES) $(ZSTDCOMP_FILES) - -MULTITHREAD_LDFLAGS = -pthread -DEBUGFLAGS= -g -DZSTD_DEBUG=1 -CPPFLAGS += -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(ZSTDDIR)/compress \ - -I$(ZSTDDIR)/dictBuilder -I$(ZSTDDIR)/deprecated -I$(PRGDIR) -CFLAGS ?= -O3 -CFLAGS += -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \ - -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \ - -Wstrict-prototypes -Wundef -Wformat-security \ - -Wvla -Wformat=2 -Winit-self -Wfloat-equal -Wwrite-strings \ - -Wredundant-decls -CFLAGS += $(DEBUGFLAGS) -CFLAGS += $(MOREFLAGS) -FLAGS = $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) $(MULTITHREAD_LDFLAGS) - -all: adapt datagen - -adapt: $(ZSTD_FILES) adapt.c - $(CC) $(FLAGS) $^ -o $@ - -adapt-debug: $(ZSTD_FILES) adapt.c - $(CC) $(FLAGS) -DDEBUG_MODE=2 $^ -o adapt - -datagen : $(PRGDIR)/datagen.c datagencli.c - $(CC) $(FLAGS) $^ -o $@ - -test-adapt-correctness: datagen adapt - @./test-correctness.sh - @echo "test correctness complete" - -test-adapt-performance: datagen adapt - @./test-performance.sh - @echo "test performance complete" - -clean: - @$(RM) -f adapt datagen - @$(RM) -rf *.dSYM - @$(RM) -f tmp* - @$(RM) -f tests/*.zst - @$(RM) -f tests/tmp* - @echo "finished cleaning" - -#----------------------------------------------------------------------------- -# make install is validated only for Linux, OSX, BSD, Hurd and Solaris targets -#----------------------------------------------------------------------------- -ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU OpenBSD FreeBSD NetBSD DragonFly SunOS)) - -ifneq (,$(filter $(shell uname),SunOS)) -INSTALL ?= ginstall -else -INSTALL ?= install -endif - -PREFIX ?= /usr/local -DESTDIR ?= -BINDIR ?= $(PREFIX)/bin - -INSTALL_PROGRAM ?= $(INSTALL) -m 755 - -install: adapt - @echo Installing binaries - @$(INSTALL) -d -m 755 $(DESTDIR)$(BINDIR)/ - @$(INSTALL_PROGRAM) adapt $(DESTDIR)$(BINDIR)/zstd-adaptive - @echo zstd-adaptive installation completed - -uninstall: - @$(RM) $(DESTDIR)$(BINDIR)/zstd-adaptive - @echo zstd-adaptive programs successfully uninstalled -endif diff --git a/priv/zstd/contrib/adaptive-compression/README.md b/priv/zstd/contrib/adaptive-compression/README.md deleted file mode 100644 index 0929b16..0000000 --- a/priv/zstd/contrib/adaptive-compression/README.md +++ /dev/null @@ -1,91 +0,0 @@ -### Summary - -`adapt` is a new compression tool targeted at optimizing performance across network connections and pipelines. The tool is aimed at sensing network speeds and adapting compression level based on network or pipe speeds. -In situations where the compression level does not appropriately match the network/pipe speed, compression may be bottlenecking the entire pipeline or the files may not be compressed as much as they potentially could be, therefore losing efficiency. It also becomes quite impractical to manually measure and set an optimalcompression level (which could potentially change over time). - -### Using `adapt` - -In order to build and use the tool, you can simply run `make adapt` in the `adaptive-compression` directory under `contrib`. This will generate an executable available for use. Another possible method of installation is running `make install`, which will create and install the binary as the command `zstd-adaptive`. - -Similar to many other compression utilities, `zstd-adaptive` can be invoked by using the following format: - -`zstd-adaptive [options] [file(s)]` - -Supported options for the above format are described below. - -`zstd-adaptive` also supports reading from `stdin` and writing to `stdout`, which is potentially more useful. By default, if no files are given, `zstd-adaptive` reads from and writes to standard I/O. Therefore, you can simply insert it within a pipeline like so: - -`cat FILE | zstd-adaptive | ssh "cat - > tmp.zst"` - -If a file is provided, it is also possible to force writing to stdout using the `-c` flag like so: - -`zstd-adaptive -c FILE | ssh "cat - > tmp.zst"` - -Several options described below can be used to control the behavior of `zstd-adaptive`. More specifically, using the `-l#` and `-u#` flags will will set upper and lower bounds so that the compression level will always be within that range. The `-i#` flag can also be used to change the initial compression level. If an initial compression level is not provided, the initial compression level will be chosen such that it is within the appropriate range (it becomes equal to the lower bound). - -### Options -`-oFILE` : write output to `FILE` - -`-i#` : provide initial compression level (must within the appropriate bounds) - -`-h` : display help/information - -`-f` : force the compression level to stay constant - -`-c` : force write to `stdout` - -`-p` : hide progress bar - -`-q` : quiet mode -- do not show progress bar or other information - -`-l#` : set a lower bound on the compression level (default is 1) - -`-u#` : set an upper bound on the compression level (default is 22) -### Benchmarking / Test results -#### Artificial Tests -These artificial tests were run by using the `pv` command line utility in order to limit pipe speeds (25 MB/s read and 5 MB/s write limits were chosen to mimic severe throughput constraints). A 40 GB backup file was sent through a pipeline, compressed, and written out to a file. Compression time, size, and ratio were computed. Data for `zstd -15` was excluded from these tests because the test runs quite long. - - - - -
25 MB/s read limit
- -| Compressor Name | Ratio | Compressed Size | Compression Time | -|:----------------|------:|----------------:|-----------------:| -| zstd -3 | 2.108 | 20.718 GB | 29m 48.530s | -| zstd-adaptive | 2.230 | 19.581 GB | 29m 48.798s | - -
- - - - -
5 MB/s write limit
- -| Compressor Name | Ratio | Compressed Size | Compression Time | -|:----------------|------:|----------------:|-----------------:| -| zstd -3 | 2.108 | 20.718 GB | 1h 10m 43.076s | -| zstd-adaptive | 2.249 | 19.412 GB | 1h 06m 15.577s | - -
- -The commands used for this test generally followed the form: - -`cat FILE | pv -L 25m -q | COMPRESSION | pv -q > tmp.zst # impose 25 MB/s read limit` - -`cat FILE | pv -q | COMPRESSION | pv -L 5m -q > tmp.zst # impose 5 MB/s write limit` - -#### SSH Tests - -The following tests were performed by piping a relatively large backup file (approximately 80 GB) through compression and over SSH to be stored on a server. The test data includes statistics for time and compressed size on `zstd` at several compression levels, as well as `zstd-adaptive`. The data highlights the potential advantages that `zstd-adaptive` has over using a low static compression level and the negative imapcts that using an excessively high static compression level can have on -pipe throughput. - -| Compressor Name | Ratio | Compressed Size | Compression Time | -|:----------------|------:|----------------:|-----------------:| -| zstd -3 | 2.212 | 32.426 GB | 1h 17m 59.756s | -| zstd -15 | 2.374 | 30.213 GB | 2h 56m 59.441s | -| zstd-adaptive | 2.315 | 30.993 GB | 1h 18m 52.860s | - -The commands used for this test generally followed the form: - -`cat FILE | COMPRESSION | ssh dev "cat - > tmp.zst"` diff --git a/priv/zstd/contrib/adaptive-compression/adapt.c b/priv/zstd/contrib/adaptive-compression/adapt.c deleted file mode 100644 index 8f9c678..0000000 --- a/priv/zstd/contrib/adaptive-compression/adapt.c +++ /dev/null @@ -1,1137 +0,0 @@ -/* - * Copyright (c) 2017-present, Facebook, Inc. - * All rights reserved. - * - * This source code is licensed under both the BSD-style license (found in the - * LICENSE file in the root directory of this source tree) and the GPLv2 (found - * in the COPYING file in the root directory of this source tree). - */ - -#include /* fprintf */ -#include /* malloc, free */ -#include /* pthread functions */ -#include /* memset */ -#include "zstd_internal.h" -#include "util.h" - -#define DISPLAY(...) fprintf(stderr, __VA_ARGS__) -#define PRINT(...) fprintf(stdout, __VA_ARGS__) -#define DEBUG(l, ...) { if (g_displayLevel>=l) { DISPLAY(__VA_ARGS__); } } -#define FILE_CHUNK_SIZE 4 << 20 -#define MAX_NUM_JOBS 2 -#define stdinmark "/*stdin*\\" -#define stdoutmark "/*stdout*\\" -#define MAX_PATH 256 -#define DEFAULT_DISPLAY_LEVEL 1 -#define DEFAULT_COMPRESSION_LEVEL 6 -#define MAX_COMPRESSION_LEVEL_CHANGE 2 -#define CONVERGENCE_LOWER_BOUND 5 -#define CLEVEL_DECREASE_COOLDOWN 5 -#define CHANGE_BY_TWO_THRESHOLD 0.1 -#define CHANGE_BY_ONE_THRESHOLD 0.65 - -#ifndef DEBUG_MODE -static int g_displayLevel = DEFAULT_DISPLAY_LEVEL; -#else -static int g_displayLevel = DEBUG_MODE; -#endif - -static unsigned g_compressionLevel = DEFAULT_COMPRESSION_LEVEL; -static UTIL_time_t g_startTime; -static size_t g_streamedSize = 0; -static unsigned g_useProgressBar = 1; -static UTIL_freq_t g_ticksPerSecond; -static unsigned g_forceCompressionLevel = 0; -static unsigned g_minCLevel = 1; -static unsigned g_maxCLevel; - -typedef struct { - void* start; - size_t size; - size_t capacity; -} buffer_t; - -typedef struct { - size_t filled; - buffer_t buffer; -} inBuff_t; - -typedef struct { - buffer_t src; - buffer_t dst; - unsigned jobID; - unsigned lastJobPlusOne; - size_t compressedSize; - size_t dictSize; -} jobDescription; - -typedef struct { - pthread_mutex_t pMutex; - int noError; -} mutex_t; - -typedef struct { - pthread_cond_t pCond; - int noError; -} cond_t; - -typedef struct { - unsigned compressionLevel; - unsigned numJobs; - unsigned nextJobID; - unsigned threadError; - - /* - * JobIDs for the next jobs to be created, compressed, and written - */ - unsigned jobReadyID; - unsigned jobCompressedID; - unsigned jobWriteID; - unsigned allJobsCompleted; - - /* - * counter for how many jobs in a row the compression level has not changed - * if the counter becomes >= CONVERGENCE_LOWER_BOUND, the next time the - * compression level tries to change (by non-zero amount) resets the counter - * to 1 and does not apply the change - */ - unsigned convergenceCounter; - - /* - * cooldown counter in order to prevent rapid successive decreases in compression level - * whenever compression level is decreased, cooldown is set to CLEVEL_DECREASE_COOLDOWN - * whenever adaptCompressionLevel() is called and cooldown != 0, it is decremented - * as long as cooldown != 0, the compression level cannot be decreased - */ - unsigned cooldown; - - /* - * XWaitYCompletion - * Range from 0.0 to 1.0 - * if the value is not 1.0, then this implies that thread X waited on thread Y to finish - * and thread Y was XWaitYCompletion finished at the time of the wait (i.e. compressWaitWriteCompletion=0.5 - * implies that the compression thread waited on the write thread and it was only 50% finished writing a job) - */ - double createWaitCompressionCompletion; - double compressWaitCreateCompletion; - double compressWaitWriteCompletion; - double writeWaitCompressionCompletion; - - /* - * Completion values - * Range from 0.0 to 1.0 - * Jobs are divided into mini-chunks in order to measure completion - * these values are updated each time a thread finishes its operation on the - * mini-chunk (i.e. finishes writing out, compressing, etc. this mini-chunk). - */ - double compressionCompletion; - double writeCompletion; - double createCompletion; - - mutex_t jobCompressed_mutex; - cond_t jobCompressed_cond; - mutex_t jobReady_mutex; - cond_t jobReady_cond; - mutex_t allJobsCompleted_mutex; - cond_t allJobsCompleted_cond; - mutex_t jobWrite_mutex; - cond_t jobWrite_cond; - mutex_t compressionCompletion_mutex; - mutex_t createCompletion_mutex; - mutex_t writeCompletion_mutex; - mutex_t compressionLevel_mutex; - size_t lastDictSize; - inBuff_t input; - jobDescription* jobs; - ZSTD_CCtx* cctx; -} adaptCCtx; - -typedef struct { - adaptCCtx* ctx; - FILE* dstFile; -} outputThreadArg; - -typedef struct { - FILE* srcFile; - adaptCCtx* ctx; - outputThreadArg* otArg; -} fcResources; - -static void freeCompressionJobs(adaptCCtx* ctx) -{ - unsigned u; - for (u=0; unumJobs; u++) { - jobDescription job = ctx->jobs[u]; - free(job.dst.start); - free(job.src.start); - } -} - -static int destroyMutex(mutex_t* mutex) -{ - if (mutex->noError) { - int const ret = pthread_mutex_destroy(&mutex->pMutex); - return ret; - } - return 0; -} - -static int destroyCond(cond_t* cond) -{ - if (cond->noError) { - int const ret = pthread_cond_destroy(&cond->pCond); - return ret; - } - return 0; -} - -static int freeCCtx(adaptCCtx* ctx) -{ - if (!ctx) return 0; - { - int error = 0; - error |= destroyMutex(&ctx->jobCompressed_mutex); - error |= destroyCond(&ctx->jobCompressed_cond); - error |= destroyMutex(&ctx->jobReady_mutex); - error |= destroyCond(&ctx->jobReady_cond); - error |= destroyMutex(&ctx->allJobsCompleted_mutex); - error |= destroyCond(&ctx->allJobsCompleted_cond); - error |= destroyMutex(&ctx->jobWrite_mutex); - error |= destroyCond(&ctx->jobWrite_cond); - error |= destroyMutex(&ctx->compressionCompletion_mutex); - error |= destroyMutex(&ctx->createCompletion_mutex); - error |= destroyMutex(&ctx->writeCompletion_mutex); - error |= destroyMutex(&ctx->compressionLevel_mutex); - error |= ZSTD_isError(ZSTD_freeCCtx(ctx->cctx)); - free(ctx->input.buffer.start); - if (ctx->jobs){ - freeCompressionJobs(ctx); - free(ctx->jobs); - } - free(ctx); - return error; - } -} - -static int initMutex(mutex_t* mutex) -{ - int const ret = pthread_mutex_init(&mutex->pMutex, NULL); - mutex->noError = !ret; - return ret; -} - -static int initCond(cond_t* cond) -{ - int const ret = pthread_cond_init(&cond->pCond, NULL); - cond->noError = !ret; - return ret; -} - -static int initCCtx(adaptCCtx* ctx, unsigned numJobs) -{ - ctx->compressionLevel = g_compressionLevel; - { - int pthreadError = 0; - pthreadError |= initMutex(&ctx->jobCompressed_mutex); - pthreadError |= initCond(&ctx->jobCompressed_cond); - pthreadError |= initMutex(&ctx->jobReady_mutex); - pthreadError |= initCond(&ctx->jobReady_cond); - pthreadError |= initMutex(&ctx->allJobsCompleted_mutex); - pthreadError |= initCond(&ctx->allJobsCompleted_cond); - pthreadError |= initMutex(&ctx->jobWrite_mutex); - pthreadError |= initCond(&ctx->jobWrite_cond); - pthreadError |= initMutex(&ctx->compressionCompletion_mutex); - pthreadError |= initMutex(&ctx->createCompletion_mutex); - pthreadError |= initMutex(&ctx->writeCompletion_mutex); - pthreadError |= initMutex(&ctx->compressionLevel_mutex); - if (pthreadError) return pthreadError; - } - ctx->numJobs = numJobs; - ctx->jobReadyID = 0; - ctx->jobCompressedID = 0; - ctx->jobWriteID = 0; - ctx->lastDictSize = 0; - - - ctx->createWaitCompressionCompletion = 1; - ctx->compressWaitCreateCompletion = 1; - ctx->compressWaitWriteCompletion = 1; - ctx->writeWaitCompressionCompletion = 1; - ctx->createCompletion = 1; - ctx->writeCompletion = 1; - ctx->compressionCompletion = 1; - ctx->convergenceCounter = 0; - ctx->cooldown = 0; - - ctx->jobs = calloc(1, numJobs*sizeof(jobDescription)); - - if (!ctx->jobs) { - DISPLAY("Error: could not allocate space for jobs during context creation\n"); - return 1; - } - - /* initializing jobs */ - { - unsigned jobNum; - for (jobNum=0; jobNumjobs[jobNum]; - job->src.start = malloc(2 * FILE_CHUNK_SIZE); - job->dst.start = malloc(ZSTD_compressBound(FILE_CHUNK_SIZE)); - job->lastJobPlusOne = 0; - if (!job->src.start || !job->dst.start) { - DISPLAY("Could not allocate buffers for jobs\n"); - return 1; - } - job->src.capacity = FILE_CHUNK_SIZE; - job->dst.capacity = ZSTD_compressBound(FILE_CHUNK_SIZE); - } - } - - ctx->nextJobID = 0; - ctx->threadError = 0; - ctx->allJobsCompleted = 0; - - ctx->cctx = ZSTD_createCCtx(); - if (!ctx->cctx) { - DISPLAY("Error: could not allocate ZSTD_CCtx\n"); - return 1; - } - - ctx->input.filled = 0; - ctx->input.buffer.capacity = 2 * FILE_CHUNK_SIZE; - - ctx->input.buffer.start = malloc(ctx->input.buffer.capacity); - if (!ctx->input.buffer.start) { - DISPLAY("Error: could not allocate input buffer\n"); - return 1; - } - return 0; -} - -static adaptCCtx* createCCtx(unsigned numJobs) -{ - - adaptCCtx* const ctx = calloc(1, sizeof(adaptCCtx)); - if (ctx == NULL) { - DISPLAY("Error: could not allocate space for context\n"); - return NULL; - } - { - int const error = initCCtx(ctx, numJobs); - if (error) { - freeCCtx(ctx); - return NULL; - } - return ctx; - } -} - -static void signalErrorToThreads(adaptCCtx* ctx) -{ - ctx->threadError = 1; - pthread_mutex_lock(&ctx->jobReady_mutex.pMutex); - pthread_cond_signal(&ctx->jobReady_cond.pCond); - pthread_mutex_unlock(&ctx->jobReady_mutex.pMutex); - - pthread_mutex_lock(&ctx->jobCompressed_mutex.pMutex); - pthread_cond_broadcast(&ctx->jobCompressed_cond.pCond); - pthread_mutex_unlock(&ctx->jobReady_mutex.pMutex); - - pthread_mutex_lock(&ctx->jobWrite_mutex.pMutex); - pthread_cond_signal(&ctx->jobWrite_cond.pCond); - pthread_mutex_unlock(&ctx->jobWrite_mutex.pMutex); - - pthread_mutex_lock(&ctx->allJobsCompleted_mutex.pMutex); - pthread_cond_signal(&ctx->allJobsCompleted_cond.pCond); - pthread_mutex_unlock(&ctx->allJobsCompleted_mutex.pMutex); -} - -static void waitUntilAllJobsCompleted(adaptCCtx* ctx) -{ - if (!ctx) return; - pthread_mutex_lock(&ctx->allJobsCompleted_mutex.pMutex); - while (ctx->allJobsCompleted == 0 && !ctx->threadError) { - pthread_cond_wait(&ctx->allJobsCompleted_cond.pCond, &ctx->allJobsCompleted_mutex.pMutex); - } - pthread_mutex_unlock(&ctx->allJobsCompleted_mutex.pMutex); -} - -/* map completion percentages to values for changing compression level */ -static unsigned convertCompletionToChange(double completion) -{ - if (completion < CHANGE_BY_TWO_THRESHOLD) { - return 2; - } - else if (completion < CHANGE_BY_ONE_THRESHOLD) { - return 1; - } - else { - return 0; - } -} - -/* - * Compression level is changed depending on which part of the compression process is lagging - * Currently, three theads exist for job creation, compression, and file writing respectively. - * adaptCompressionLevel() increments or decrements compression level based on which of the threads is lagging - * job creation or file writing lag => increased compression level - * compression thread lag => decreased compression level - * detecting which thread is lagging is done by keeping track of how many calls each thread makes to pthread_cond_wait - */ -static void adaptCompressionLevel(adaptCCtx* ctx) -{ - double createWaitCompressionCompletion; - double compressWaitCreateCompletion; - double compressWaitWriteCompletion; - double writeWaitCompressionCompletion; - double const threshold = 0.00001; - unsigned prevCompressionLevel; - - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - prevCompressionLevel = ctx->compressionLevel; - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - - - if (g_forceCompressionLevel) { - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - ctx->compressionLevel = g_compressionLevel; - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - return; - } - - - DEBUG(2, "adapting compression level %u\n", prevCompressionLevel); - - /* read and reset completion measurements */ - pthread_mutex_lock(&ctx->compressionCompletion_mutex.pMutex); - DEBUG(2, "createWaitCompressionCompletion %f\n", ctx->createWaitCompressionCompletion); - DEBUG(2, "writeWaitCompressionCompletion %f\n", ctx->writeWaitCompressionCompletion); - createWaitCompressionCompletion = ctx->createWaitCompressionCompletion; - writeWaitCompressionCompletion = ctx->writeWaitCompressionCompletion; - pthread_mutex_unlock(&ctx->compressionCompletion_mutex.pMutex); - - pthread_mutex_lock(&ctx->writeCompletion_mutex.pMutex); - DEBUG(2, "compressWaitWriteCompletion %f\n", ctx->compressWaitWriteCompletion); - compressWaitWriteCompletion = ctx->compressWaitWriteCompletion; - pthread_mutex_unlock(&ctx->writeCompletion_mutex.pMutex); - - pthread_mutex_lock(&ctx->createCompletion_mutex.pMutex); - DEBUG(2, "compressWaitCreateCompletion %f\n", ctx->compressWaitCreateCompletion); - compressWaitCreateCompletion = ctx->compressWaitCreateCompletion; - pthread_mutex_unlock(&ctx->createCompletion_mutex.pMutex); - DEBUG(2, "convergence counter: %u\n", ctx->convergenceCounter); - - assert(g_minCLevel <= prevCompressionLevel && g_maxCLevel >= prevCompressionLevel); - - /* adaptation logic */ - if (ctx->cooldown) ctx->cooldown--; - - if ((1-createWaitCompressionCompletion > threshold || 1-writeWaitCompressionCompletion > threshold) && ctx->cooldown == 0) { - /* create or write waiting on compression */ - /* use whichever one waited less because it was slower */ - double const completion = MAX(createWaitCompressionCompletion, writeWaitCompressionCompletion); - unsigned const change = convertCompletionToChange(completion); - unsigned const boundChange = MIN(change, prevCompressionLevel - g_minCLevel); - if (ctx->convergenceCounter >= CONVERGENCE_LOWER_BOUND && boundChange != 0) { - /* reset convergence counter, might have been a spike */ - ctx->convergenceCounter = 0; - DEBUG(2, "convergence counter reset, no change applied\n"); - } - else if (boundChange != 0) { - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - ctx->compressionLevel -= boundChange; - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - ctx->cooldown = CLEVEL_DECREASE_COOLDOWN; - ctx->convergenceCounter = 1; - - DEBUG(2, "create or write threads waiting on compression, tried to decrease compression level by %u\n\n", boundChange); - } - } - else if (1-compressWaitWriteCompletion > threshold || 1-compressWaitCreateCompletion > threshold) { - /* compress waiting on write */ - double const completion = MIN(compressWaitWriteCompletion, compressWaitCreateCompletion); - unsigned const change = convertCompletionToChange(completion); - unsigned const boundChange = MIN(change, g_maxCLevel - prevCompressionLevel); - if (ctx->convergenceCounter >= CONVERGENCE_LOWER_BOUND && boundChange != 0) { - /* reset convergence counter, might have been a spike */ - ctx->convergenceCounter = 0; - DEBUG(2, "convergence counter reset, no change applied\n"); - } - else if (boundChange != 0) { - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - ctx->compressionLevel += boundChange; - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - ctx->cooldown = 0; - ctx->convergenceCounter = 1; - - DEBUG(2, "compress waiting on write or create, tried to increase compression level by %u\n\n", boundChange); - } - - } - - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - if (ctx->compressionLevel == prevCompressionLevel) { - ctx->convergenceCounter++; - } - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); -} - -static size_t getUseableDictSize(unsigned compressionLevel) -{ - ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, 0); - unsigned const overlapLog = compressionLevel >= (unsigned)ZSTD_maxCLevel() ? 0 : 3; - size_t const overlapSize = 1 << (params.cParams.windowLog - overlapLog); - return overlapSize; -} - -static void* compressionThread(void* arg) -{ - adaptCCtx* const ctx = (adaptCCtx*)arg; - unsigned currJob = 0; - for ( ; ; ) { - unsigned const currJobIndex = currJob % ctx->numJobs; - jobDescription* const job = &ctx->jobs[currJobIndex]; - DEBUG(2, "starting compression for job %u\n", currJob); - - { - /* check if compression thread will have to wait */ - unsigned willWaitForCreate = 0; - unsigned willWaitForWrite = 0; - - pthread_mutex_lock(&ctx->jobReady_mutex.pMutex); - if (currJob + 1 > ctx->jobReadyID) willWaitForCreate = 1; - pthread_mutex_unlock(&ctx->jobReady_mutex.pMutex); - - pthread_mutex_lock(&ctx->jobWrite_mutex.pMutex); - if (currJob - ctx->jobWriteID >= ctx->numJobs) willWaitForWrite = 1; - pthread_mutex_unlock(&ctx->jobWrite_mutex.pMutex); - - - pthread_mutex_lock(&ctx->createCompletion_mutex.pMutex); - if (willWaitForCreate) { - DEBUG(2, "compression will wait for create on job %u\n", currJob); - ctx->compressWaitCreateCompletion = ctx->createCompletion; - DEBUG(2, "create completion %f\n", ctx->compressWaitCreateCompletion); - - } - else { - ctx->compressWaitCreateCompletion = 1; - } - pthread_mutex_unlock(&ctx->createCompletion_mutex.pMutex); - - pthread_mutex_lock(&ctx->writeCompletion_mutex.pMutex); - if (willWaitForWrite) { - DEBUG(2, "compression will wait for write on job %u\n", currJob); - ctx->compressWaitWriteCompletion = ctx->writeCompletion; - DEBUG(2, "write completion %f\n", ctx->compressWaitWriteCompletion); - } - else { - ctx->compressWaitWriteCompletion = 1; - } - pthread_mutex_unlock(&ctx->writeCompletion_mutex.pMutex); - - } - - /* wait until job is ready */ - pthread_mutex_lock(&ctx->jobReady_mutex.pMutex); - while (currJob + 1 > ctx->jobReadyID && !ctx->threadError) { - pthread_cond_wait(&ctx->jobReady_cond.pCond, &ctx->jobReady_mutex.pMutex); - } - pthread_mutex_unlock(&ctx->jobReady_mutex.pMutex); - - /* wait until job previously in this space is written */ - pthread_mutex_lock(&ctx->jobWrite_mutex.pMutex); - while (currJob - ctx->jobWriteID >= ctx->numJobs && !ctx->threadError) { - pthread_cond_wait(&ctx->jobWrite_cond.pCond, &ctx->jobWrite_mutex.pMutex); - } - pthread_mutex_unlock(&ctx->jobWrite_mutex.pMutex); - /* reset compression completion */ - pthread_mutex_lock(&ctx->compressionCompletion_mutex.pMutex); - ctx->compressionCompletion = 0; - pthread_mutex_unlock(&ctx->compressionCompletion_mutex.pMutex); - - /* adapt compression level */ - if (currJob) adaptCompressionLevel(ctx); - - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - DEBUG(2, "job %u compressed with level %u\n", currJob, ctx->compressionLevel); - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - - /* compress the data */ - { - size_t const compressionBlockSize = ZSTD_BLOCKSIZE_MAX; /* 128 KB */ - unsigned cLevel; - unsigned blockNum = 0; - size_t remaining = job->src.size; - size_t srcPos = 0; - size_t dstPos = 0; - - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - cLevel = ctx->compressionLevel; - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - - /* reset compressed size */ - job->compressedSize = 0; - DEBUG(2, "calling ZSTD_compressBegin()\n"); - /* begin compression */ - { - size_t const useDictSize = MIN(getUseableDictSize(cLevel), job->dictSize); - size_t const dictModeError = ZSTD_setCCtxParameter(ctx->cctx, ZSTD_p_forceRawDict, 1); - ZSTD_parameters params = ZSTD_getParams(cLevel, 0, useDictSize); - params.cParams.windowLog = 23; - { - size_t const initError = ZSTD_compressBegin_advanced(ctx->cctx, job->src.start + job->dictSize - useDictSize, useDictSize, params, 0); - size_t const windowSizeError = ZSTD_setCCtxParameter(ctx->cctx, ZSTD_p_forceWindow, 1); - if (ZSTD_isError(dictModeError) || ZSTD_isError(initError) || ZSTD_isError(windowSizeError)) { - DISPLAY("Error: something went wrong while starting compression\n"); - signalErrorToThreads(ctx); - return arg; - } - } - } - DEBUG(2, "finished with ZSTD_compressBegin()\n"); - - do { - size_t const actualBlockSize = MIN(remaining, compressionBlockSize); - - /* continue compression */ - if (currJob != 0 || blockNum != 0) { /* not first block of first job flush/overwrite the frame header */ - size_t const hSize = ZSTD_compressContinue(ctx->cctx, job->dst.start + dstPos, job->dst.capacity - dstPos, job->src.start + job->dictSize + srcPos, 0); - if (ZSTD_isError(hSize)) { - DISPLAY("Error: something went wrong while continuing compression\n"); - job->compressedSize = hSize; - signalErrorToThreads(ctx); - return arg; - } - ZSTD_invalidateRepCodes(ctx->cctx); - } - { - size_t const ret = (job->lastJobPlusOne == currJob + 1 && remaining == actualBlockSize) ? - ZSTD_compressEnd (ctx->cctx, job->dst.start + dstPos, job->dst.capacity - dstPos, job->src.start + job->dictSize + srcPos, actualBlockSize) : - ZSTD_compressContinue(ctx->cctx, job->dst.start + dstPos, job->dst.capacity - dstPos, job->src.start + job->dictSize + srcPos, actualBlockSize); - if (ZSTD_isError(ret)) { - DISPLAY("Error: something went wrong during compression: %s\n", ZSTD_getErrorName(ret)); - signalErrorToThreads(ctx); - return arg; - } - job->compressedSize += ret; - remaining -= actualBlockSize; - srcPos += actualBlockSize; - dstPos += ret; - blockNum++; - - /* update completion */ - pthread_mutex_lock(&ctx->compressionCompletion_mutex.pMutex); - ctx->compressionCompletion = 1 - (double)remaining/job->src.size; - pthread_mutex_unlock(&ctx->compressionCompletion_mutex.pMutex); - } - } while (remaining != 0); - job->dst.size = job->compressedSize; - } - pthread_mutex_lock(&ctx->jobCompressed_mutex.pMutex); - ctx->jobCompressedID++; - pthread_cond_broadcast(&ctx->jobCompressed_cond.pCond); - pthread_mutex_unlock(&ctx->jobCompressed_mutex.pMutex); - if (job->lastJobPlusOne == currJob + 1 || ctx->threadError) { - /* finished compressing all jobs */ - break; - } - DEBUG(2, "finished compressing job %u\n", currJob); - currJob++; - } - return arg; -} - -static void displayProgress(unsigned cLevel, unsigned last) -{ - UTIL_time_t currTime; - UTIL_getTime(&currTime); - if (!g_useProgressBar) return; - { - double const timeElapsed = (double)(UTIL_getSpanTimeMicro(g_ticksPerSecond, g_startTime, currTime) / 1000.0); - double const sizeMB = (double)g_streamedSize / (1 << 20); - double const avgCompRate = sizeMB * 1000 / timeElapsed; - fprintf(stderr, "\r| Comp. Level: %2u | Time Elapsed: %7.2f s | Data Size: %7.1f MB | Avg Comp. Rate: %6.2f MB/s |", cLevel, timeElapsed/1000.0, sizeMB, avgCompRate); - if (last) { - fprintf(stderr, "\n"); - } - else { - fflush(stderr); - } - } -} - -static void* outputThread(void* arg) -{ - outputThreadArg* const otArg = (outputThreadArg*)arg; - adaptCCtx* const ctx = otArg->ctx; - FILE* const dstFile = otArg->dstFile; - - unsigned currJob = 0; - for ( ; ; ) { - unsigned const currJobIndex = currJob % ctx->numJobs; - jobDescription* const job = &ctx->jobs[currJobIndex]; - unsigned willWaitForCompress = 0; - DEBUG(2, "starting write for job %u\n", currJob); - - pthread_mutex_lock(&ctx->jobCompressed_mutex.pMutex); - if (currJob + 1 > ctx->jobCompressedID) willWaitForCompress = 1; - pthread_mutex_unlock(&ctx->jobCompressed_mutex.pMutex); - - - pthread_mutex_lock(&ctx->compressionCompletion_mutex.pMutex); - if (willWaitForCompress) { - /* write thread is waiting on compression thread */ - ctx->writeWaitCompressionCompletion = ctx->compressionCompletion; - DEBUG(2, "writer thread waiting for nextJob: %u, writeWaitCompressionCompletion %f\n", currJob, ctx->writeWaitCompressionCompletion); - } - else { - ctx->writeWaitCompressionCompletion = 1; - } - pthread_mutex_unlock(&ctx->compressionCompletion_mutex.pMutex); - - pthread_mutex_lock(&ctx->jobCompressed_mutex.pMutex); - while (currJob + 1 > ctx->jobCompressedID && !ctx->threadError) { - pthread_cond_wait(&ctx->jobCompressed_cond.pCond, &ctx->jobCompressed_mutex.pMutex); - } - pthread_mutex_unlock(&ctx->jobCompressed_mutex.pMutex); - - /* reset write completion */ - pthread_mutex_lock(&ctx->writeCompletion_mutex.pMutex); - ctx->writeCompletion = 0; - pthread_mutex_unlock(&ctx->writeCompletion_mutex.pMutex); - - { - size_t const compressedSize = job->compressedSize; - size_t remaining = compressedSize; - if (ZSTD_isError(compressedSize)) { - DISPLAY("Error: an error occurred during compression\n"); - signalErrorToThreads(ctx); - return arg; - } - { - size_t const blockSize = MAX(compressedSize >> 7, 1 << 10); - size_t pos = 0; - for ( ; ; ) { - size_t const writeSize = MIN(remaining, blockSize); - size_t const ret = fwrite(job->dst.start + pos, 1, writeSize, dstFile); - if (ret != writeSize) break; - pos += ret; - remaining -= ret; - - /* update completion variable for writing */ - pthread_mutex_lock(&ctx->writeCompletion_mutex.pMutex); - ctx->writeCompletion = 1 - (double)remaining/compressedSize; - pthread_mutex_unlock(&ctx->writeCompletion_mutex.pMutex); - - if (remaining == 0) break; - } - if (pos != compressedSize) { - DISPLAY("Error: an error occurred during file write operation\n"); - signalErrorToThreads(ctx); - return arg; - } - } - } - { - unsigned cLevel; - pthread_mutex_lock(&ctx->compressionLevel_mutex.pMutex); - cLevel = ctx->compressionLevel; - pthread_mutex_unlock(&ctx->compressionLevel_mutex.pMutex); - displayProgress(cLevel, job->lastJobPlusOne == currJob + 1); - } - pthread_mutex_lock(&ctx->jobWrite_mutex.pMutex); - ctx->jobWriteID++; - pthread_cond_signal(&ctx->jobWrite_cond.pCond); - pthread_mutex_unlock(&ctx->jobWrite_mutex.pMutex); - - if (job->lastJobPlusOne == currJob + 1 || ctx->threadError) { - /* finished with all jobs */ - pthread_mutex_lock(&ctx->allJobsCompleted_mutex.pMutex); - ctx->allJobsCompleted = 1; - pthread_cond_signal(&ctx->allJobsCompleted_cond.pCond); - pthread_mutex_unlock(&ctx->allJobsCompleted_mutex.pMutex); - break; - } - DEBUG(2, "finished writing job %u\n", currJob); - currJob++; - - } - return arg; -} - -static int createCompressionJob(adaptCCtx* ctx, size_t srcSize, int last) -{ - unsigned const nextJob = ctx->nextJobID; - unsigned const nextJobIndex = nextJob % ctx->numJobs; - jobDescription* const job = &ctx->jobs[nextJobIndex]; - - - job->src.size = srcSize; - job->jobID = nextJob; - if (last) job->lastJobPlusOne = nextJob + 1; - { - /* swap buffer */ - void* const copy = job->src.start; - job->src.start = ctx->input.buffer.start; - ctx->input.buffer.start = copy; - } - job->dictSize = ctx->lastDictSize; - - ctx->nextJobID++; - /* if not on the last job, reuse data as dictionary in next job */ - if (!last) { - size_t const oldDictSize = ctx->lastDictSize; - memcpy(ctx->input.buffer.start, job->src.start + oldDictSize, srcSize); - ctx->lastDictSize = srcSize; - ctx->input.filled = srcSize; - } - - /* signal job ready */ - pthread_mutex_lock(&ctx->jobReady_mutex.pMutex); - ctx->jobReadyID++; - pthread_cond_signal(&ctx->jobReady_cond.pCond); - pthread_mutex_unlock(&ctx->jobReady_mutex.pMutex); - - return 0; -} - -static int performCompression(adaptCCtx* ctx, FILE* const srcFile, outputThreadArg* otArg) -{ - /* early error check to exit */ - if (!ctx || !srcFile || !otArg) { - return 1; - } - - /* create output thread */ - { - pthread_t out; - if (pthread_create(&out, NULL, &outputThread, otArg)) { - DISPLAY("Error: could not create output thread\n"); - signalErrorToThreads(ctx); - return 1; - } - else if (pthread_detach(out)) { - DISPLAY("Error: could not detach output thread\n"); - signalErrorToThreads(ctx); - return 1; - } - } - - /* create compression thread */ - { - pthread_t compression; - if (pthread_create(&compression, NULL, &compressionThread, ctx)) { - DISPLAY("Error: could not create compression thread\n"); - signalErrorToThreads(ctx); - return 1; - } - else if (pthread_detach(compression)) { - DISPLAY("Error: could not detach compression thread\n"); - signalErrorToThreads(ctx); - return 1; - } - } - { - unsigned currJob = 0; - /* creating jobs */ - for ( ; ; ) { - size_t pos = 0; - size_t const readBlockSize = 1 << 15; - size_t remaining = FILE_CHUNK_SIZE; - unsigned const nextJob = ctx->nextJobID; - unsigned willWaitForCompress = 0; - DEBUG(2, "starting creation of job %u\n", currJob); - - pthread_mutex_lock(&ctx->jobCompressed_mutex.pMutex); - if (nextJob - ctx->jobCompressedID >= ctx->numJobs) willWaitForCompress = 1; - pthread_mutex_unlock(&ctx->jobCompressed_mutex.pMutex); - - pthread_mutex_lock(&ctx->compressionCompletion_mutex.pMutex); - if (willWaitForCompress) { - /* creation thread is waiting, take measurement of completion */ - ctx->createWaitCompressionCompletion = ctx->compressionCompletion; - DEBUG(2, "create thread waiting for nextJob: %u, createWaitCompressionCompletion %f\n", nextJob, ctx->createWaitCompressionCompletion); - } - else { - ctx->createWaitCompressionCompletion = 1; - } - pthread_mutex_unlock(&ctx->compressionCompletion_mutex.pMutex); - - /* wait until the job has been compressed */ - pthread_mutex_lock(&ctx->jobCompressed_mutex.pMutex); - while (nextJob - ctx->jobCompressedID >= ctx->numJobs && !ctx->threadError) { - pthread_cond_wait(&ctx->jobCompressed_cond.pCond, &ctx->jobCompressed_mutex.pMutex); - } - pthread_mutex_unlock(&ctx->jobCompressed_mutex.pMutex); - - /* reset create completion */ - pthread_mutex_lock(&ctx->createCompletion_mutex.pMutex); - ctx->createCompletion = 0; - pthread_mutex_unlock(&ctx->createCompletion_mutex.pMutex); - - while (remaining != 0 && !feof(srcFile)) { - size_t const ret = fread(ctx->input.buffer.start + ctx->input.filled + pos, 1, readBlockSize, srcFile); - if (ret != readBlockSize && !feof(srcFile)) { - /* error could not read correct number of bytes */ - DISPLAY("Error: problem occurred during read from src file\n"); - signalErrorToThreads(ctx); - return 1; - } - pos += ret; - remaining -= ret; - pthread_mutex_lock(&ctx->createCompletion_mutex.pMutex); - ctx->createCompletion = 1 - (double)remaining/((size_t)FILE_CHUNK_SIZE); - pthread_mutex_unlock(&ctx->createCompletion_mutex.pMutex); - } - if (remaining != 0 && !feof(srcFile)) { - DISPLAY("Error: problem occurred during read from src file\n"); - signalErrorToThreads(ctx); - return 1; - } - g_streamedSize += pos; - /* reading was fine, now create the compression job */ - { - int const last = feof(srcFile); - int const error = createCompressionJob(ctx, pos, last); - if (error != 0) { - signalErrorToThreads(ctx); - return error; - } - } - DEBUG(2, "finished creating job %u\n", currJob); - currJob++; - if (feof(srcFile)) { - break; - } - } - } - /* success -- created all jobs */ - return 0; -} - -static fcResources createFileCompressionResources(const char* const srcFilename, const char* const dstFilenameOrNull) -{ - fcResources fcr; - unsigned const stdinUsed = !strcmp(srcFilename, stdinmark); - FILE* const srcFile = stdinUsed ? stdin : fopen(srcFilename, "rb"); - const char* const outFilenameIntermediate = (stdinUsed && !dstFilenameOrNull) ? stdoutmark : dstFilenameOrNull; - const char* outFilename = outFilenameIntermediate; - char fileAndSuffix[MAX_PATH]; - size_t const numJobs = MAX_NUM_JOBS; - - memset(&fcr, 0, sizeof(fcr)); - - if (!outFilenameIntermediate) { - if (snprintf(fileAndSuffix, MAX_PATH, "%s.zst", srcFilename) + 1 > MAX_PATH) { - DISPLAY("Error: output filename is too long\n"); - return fcr; - } - outFilename = fileAndSuffix; - } - - { - unsigned const stdoutUsed = !strcmp(outFilename, stdoutmark); - FILE* const dstFile = stdoutUsed ? stdout : fopen(outFilename, "wb"); - fcr.otArg = malloc(sizeof(outputThreadArg)); - if (!fcr.otArg) { - DISPLAY("Error: could not allocate space for output thread argument\n"); - return fcr; - } - fcr.otArg->dstFile = dstFile; - } - /* checking for errors */ - if (!fcr.otArg->dstFile || !srcFile) { - DISPLAY("Error: some file(s) could not be opened\n"); - return fcr; - } - - /* creating context */ - fcr.ctx = createCCtx(numJobs); - fcr.otArg->ctx = fcr.ctx; - fcr.srcFile = srcFile; - return fcr; -} - -static int freeFileCompressionResources(fcResources* fcr) -{ - int ret = 0; - waitUntilAllJobsCompleted(fcr->ctx); - ret |= (fcr->srcFile != NULL) ? fclose(fcr->srcFile) : 0; - ret |= (fcr->ctx != NULL) ? freeCCtx(fcr->ctx) : 0; - if (fcr->otArg) { - ret |= (fcr->otArg->dstFile != stdout) ? fclose(fcr->otArg->dstFile) : 0; - free(fcr->otArg); - /* no need to freeCCtx() on otArg->ctx because it should be the same context */ - } - return ret; -} - -static int compressFilename(const char* const srcFilename, const char* const dstFilenameOrNull) -{ - int ret = 0; - fcResources fcr = createFileCompressionResources(srcFilename, dstFilenameOrNull); - UTIL_getTime(&g_startTime); - g_streamedSize = 0; - ret |= performCompression(fcr.ctx, fcr.srcFile, fcr.otArg); - ret |= freeFileCompressionResources(&fcr); - return ret; -} - -static int compressFilenames(const char** filenameTable, unsigned numFiles, unsigned forceStdout) -{ - int ret = 0; - unsigned fileNum; - for (fileNum=0; fileNum MAX_UINT */ -static unsigned readU32FromChar(const char** stringPtr) -{ - unsigned result = 0; - while ((**stringPtr >='0') && (**stringPtr <='9')) - result *= 10, result += **stringPtr - '0', (*stringPtr)++ ; - if ((**stringPtr=='K') || (**stringPtr=='M')) { - result <<= 10; - if (**stringPtr=='M') result <<= 10; - (*stringPtr)++ ; - if (**stringPtr=='i') (*stringPtr)++; - if (**stringPtr=='B') (*stringPtr)++; - } - return result; -} - -static void help(const char* progPath) -{ - PRINT("Usage:\n"); - PRINT(" %s [options] [file(s)]\n", progPath); - PRINT("\n"); - PRINT("Options:\n"); - PRINT(" -oFILE : specify the output file name\n"); - PRINT(" -i# : provide initial compression level -- default %d, must be in the range [L, U] where L and U are bound values (see below for defaults)\n", DEFAULT_COMPRESSION_LEVEL); - PRINT(" -h : display help/information\n"); - PRINT(" -f : force the compression level to stay constant\n"); - PRINT(" -c : force write to stdout\n"); - PRINT(" -p : hide progress bar\n"); - PRINT(" -q : quiet mode -- do not show progress bar or other information\n"); - PRINT(" -l# : provide lower bound for compression level -- default 1\n"); - PRINT(" -u# : provide upper bound for compression level -- default %u\n", ZSTD_maxCLevel()); -} -/* return 0 if successful, else return error */ -int main(int argCount, const char* argv[]) -{ - const char* outFilename = NULL; - const char** filenameTable = (const char**)malloc(argCount*sizeof(const char*)); - unsigned filenameIdx = 0; - unsigned forceStdout = 0; - unsigned providedInitialCLevel = 0; - int ret = 0; - int argNum; - filenameTable[0] = stdinmark; - g_maxCLevel = ZSTD_maxCLevel(); - - UTIL_initTimer(&g_ticksPerSecond); - - if (filenameTable == NULL) { - DISPLAY("Error: could not allocate sapce for filename table.\n"); - return 1; - } - - for (argNum=1; argNum 1) { - switch (argument[1]) { - case 'o': - argument += 2; - outFilename = argument; - break; - case 'i': - argument += 2; - g_compressionLevel = readU32FromChar(&argument); - providedInitialCLevel = 1; - break; - case 'h': - help(argv[0]); - goto _main_exit; - case 'p': - g_useProgressBar = 0; - break; - case 'c': - forceStdout = 1; - outFilename = stdoutmark; - break; - case 'f': - g_forceCompressionLevel = 1; - break; - case 'q': - g_useProgressBar = 0; - g_displayLevel = 0; - break; - case 'l': - argument += 2; - g_minCLevel = readU32FromChar(&argument); - break; - case 'u': - argument += 2; - g_maxCLevel = readU32FromChar(&argument); - break; - default: - DISPLAY("Error: invalid argument provided\n"); - ret = 1; - goto _main_exit; - } - continue; - } - - /* regular files to be compressed */ - filenameTable[filenameIdx++] = argument; - } - - /* check initial, max, and min compression levels */ - { - unsigned const minMaxInconsistent = g_minCLevel > g_maxCLevel; - unsigned const initialNotInRange = g_minCLevel > g_compressionLevel || g_maxCLevel < g_compressionLevel; - if (minMaxInconsistent || (initialNotInRange && providedInitialCLevel)) { - DISPLAY("Error: provided compression level parameters are invalid\n"); - ret = 1; - goto _main_exit; - } - else if (initialNotInRange) { - g_compressionLevel = g_minCLevel; - } - } - - /* error checking with number of files */ - if (filenameIdx > 1 && (outFilename != NULL && strcmp(outFilename, stdoutmark))) { - DISPLAY("Error: multiple input files provided, cannot use specified output file\n"); - ret = 1; - goto _main_exit; - } - - /* compress files */ - if (filenameIdx <= 1) { - ret |= compressFilename(filenameTable[0], outFilename); - } - else { - ret |= compressFilenames(filenameTable, filenameIdx, forceStdout); - } -_main_exit: - free(filenameTable); - return ret; -} diff --git a/priv/zstd/contrib/adaptive-compression/datagencli.c b/priv/zstd/contrib/adaptive-compression/datagencli.c deleted file mode 100644 index bf9601f..0000000 --- a/priv/zstd/contrib/adaptive-compression/datagencli.c +++ /dev/null @@ -1,129 +0,0 @@ -/* - * Copyright (c) 2016-present, Yann Collet, Facebook, Inc. - * All rights reserved. - * - * This source code is licensed under both the BSD-style license (found in the - * LICENSE file in the root directory of this source tree) and the GPLv2 (found - * in the COPYING file in the root directory of this source tree). - */ - - -/*-************************************ -* Dependencies -**************************************/ -#include "util.h" /* Compiler options */ -#include /* fprintf, stderr */ -#include "datagen.h" /* RDG_generate */ - - -/*-************************************ -* Constants -**************************************/ -#define KB *(1 <<10) -#define MB *(1 <<20) -#define GB *(1U<<30) - -#define SIZE_DEFAULT ((64 KB) + 1) -#define SEED_DEFAULT 0 -#define COMPRESSIBILITY_DEFAULT 50 - - -/*-************************************ -* Macros -**************************************/ -#define DISPLAY(...) fprintf(stderr, __VA_ARGS__) -#define DISPLAYLEVEL(l, ...) if (displayLevel>=l) { DISPLAY(__VA_ARGS__); } -static unsigned displayLevel = 2; - - -/*-******************************************************* -* Command line -*********************************************************/ -static int usage(const char* programName) -{ - DISPLAY( "Compressible data generator\n"); - DISPLAY( "Usage :\n"); - DISPLAY( " %s [args]\n", programName); - DISPLAY( "\n"); - DISPLAY( "Arguments :\n"); - DISPLAY( " -g# : generate # data (default:%i)\n", SIZE_DEFAULT); - DISPLAY( " -s# : Select seed (default:%i)\n", SEED_DEFAULT); - DISPLAY( " -P# : Select compressibility in %% (default:%i%%)\n", - COMPRESSIBILITY_DEFAULT); - DISPLAY( " -h : display help and exit\n"); - return 0; -} - - -int main(int argc, const char** argv) -{ - unsigned probaU32 = COMPRESSIBILITY_DEFAULT; - double litProba = 0.0; - U64 size = SIZE_DEFAULT; - U32 seed = SEED_DEFAULT; - const char* const programName = argv[0]; - - int argNb; - for(argNb=1; argNb='0') && (*argument<='9')) - size *= 10, size += *argument++ - '0'; - if (*argument=='K') { size <<= 10; argument++; } - if (*argument=='M') { size <<= 20; argument++; } - if (*argument=='G') { size <<= 30; argument++; } - if (*argument=='B') { argument++; } - break; - case 's': - argument++; - seed=0; - while ((*argument>='0') && (*argument<='9')) - seed *= 10, seed += *argument++ - '0'; - break; - case 'P': - argument++; - probaU32 = 0; - while ((*argument>='0') && (*argument<='9')) - probaU32 *= 10, probaU32 += *argument++ - '0'; - if (probaU32>100) probaU32 = 100; - break; - case 'L': /* hidden argument : Literal distribution probability */ - argument++; - litProba=0.; - while ((*argument>='0') && (*argument<='9')) - litProba *= 10, litProba += *argument++ - '0'; - if (litProba>100.) litProba=100.; - litProba /= 100.; - break; - case 'v': - displayLevel = 4; - argument++; - break; - default: - return usage(programName); - } - } } } /* for(argNb=1; argNb tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s2 -g500MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s3 -g250MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s4 -g125MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s5 -g50MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s6 -g25MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s7 -g10MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s8 -g5MB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s9 -g500KB > tmp -./adapt -otmp.zst tmp -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -echo -e "\ncorrectness tests -- streaming" -./datagen -s10 -g1GB > tmp -cat tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s11 -g100MB > tmp -cat tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s12 -g10MB > tmp -cat tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s13 -g1MB > tmp -cat tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s14 -g100KB > tmp -cat tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s15 -g10KB > tmp -cat tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -echo -e "\ncorrectness tests -- read limit" -./datagen -s16 -g1GB > tmp -pv -L 50m -q tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s17 -g100MB > tmp -pv -L 50m -q tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s18 -g10MB > tmp -pv -L 50m -q tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s19 -g1MB > tmp -pv -L 50m -q tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s20 -g100KB > tmp -pv -L 50m -q tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s21 -g10KB > tmp -pv -L 50m -q tmp | ./adapt > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -echo -e "\ncorrectness tests -- write limit" -./datagen -s22 -g1GB > tmp -pv -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s23 -g100MB > tmp -pv -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s24 -g10MB > tmp -pv -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s25 -g1MB > tmp -pv -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s26 -g100KB > tmp -pv -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s27 -g10KB > tmp -pv -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -echo -e "\ncorrectness tests -- read and write limits" -./datagen -s28 -g1GB > tmp -pv -L 50m -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s29 -g100MB > tmp -pv -L 50m -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s30 -g10MB > tmp -pv -L 50m -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s31 -g1MB > tmp -pv -L 50m -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s32 -g100KB > tmp -pv -L 50m -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s33 -g10KB > tmp -pv -L 50m -q tmp | ./adapt | pv -L 5m -q > tmp.zst -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -echo -e "\ncorrectness tests -- forced compression level" -./datagen -s34 -g1GB > tmp -./adapt tmp -otmp.zst -i11 -f -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s35 -g100MB > tmp -./adapt tmp -otmp.zst -i11 -f -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s36 -g10MB > tmp -./adapt tmp -otmp.zst -i11 -f -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s37 -g1MB > tmp -./adapt tmp -otmp.zst -i11 -f -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s38 -g100KB > tmp -./adapt tmp -otmp.zst -i11 -f -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -./datagen -s39 -g10KB > tmp -./adapt tmp -otmp.zst -i11 -f -zstd -d tmp.zst -o tmp2 -diff -s -q tmp tmp2 -rm tmp* - -echo -e "\ncorrectness tests -- window size test" -./datagen -s39 -g1GB | pv -L 25m -q | ./adapt -i1 | pv -q > tmp.zst -zstd -d tmp.zst -rm tmp* - -echo -e "\ncorrectness tests -- testing bounds" -./datagen -s40 -g1GB | pv -L 25m -q | ./adapt -i1 -u4 | pv -q > tmp.zst -rm tmp* - -./datagen -s41 -g1GB | ./adapt -i14 -l4 > tmp.zst -rm tmp* -make clean diff --git a/priv/zstd/contrib/adaptive-compression/test-performance.sh b/priv/zstd/contrib/adaptive-compression/test-performance.sh deleted file mode 100755 index 958cb3c..0000000 --- a/priv/zstd/contrib/adaptive-compression/test-performance.sh +++ /dev/null @@ -1,59 +0,0 @@ -echo "testing time -- no limits set" -./datagen -s1 -g1GB > tmp -time ./adapt -otmp1.zst tmp -time zstd -1 -o tmp2.zst tmp -rm tmp* - -./datagen -s2 -g2GB > tmp -time ./adapt -otmp1.zst tmp -time zstd -1 -o tmp2.zst tmp -rm tmp* - -./datagen -s3 -g4GB > tmp -time ./adapt -otmp1.zst tmp -time zstd -1 -o tmp2.zst tmp -rm tmp* - -echo -e "\ntesting compression ratio -- no limits set" -./datagen -s4 -g1GB > tmp -time ./adapt -otmp1.zst tmp -time zstd -1 -o tmp2.zst tmp -ls -l tmp1.zst tmp2.zst -rm tmp* - -./datagen -s5 -g2GB > tmp -time ./adapt -otmp1.zst tmp -time zstd -1 -o tmp2.zst tmp -ls -l tmp1.zst tmp2.zst -rm tmp* - -./datagen -s6 -g4GB > tmp -time ./adapt -otmp1.zst tmp -time zstd -1 -o tmp2.zst tmp -ls -l tmp1.zst tmp2.zst -rm tmp* - -echo e "\ntesting performance at various compression levels -- no limits set" -./datagen -s7 -g1GB > tmp -echo "adapt" -time ./adapt -i5 -f tmp -otmp1.zst -echo "zstdcli" -time zstd -5 tmp -o tmp2.zst -ls -l tmp1.zst tmp2.zst -rm tmp* - -./datagen -s8 -g1GB > tmp -echo "adapt" -time ./adapt -i10 -f tmp -otmp1.zst -echo "zstdcli" -time zstd -10 tmp -o tmp2.zst -ls -l tmp1.zst tmp2.zst -rm tmp* - -./datagen -s9 -g1GB > tmp -echo "adapt" -time ./adapt -i15 -f tmp -otmp1.zst -echo "zstdcli" -time zstd -15 tmp -o tmp2.zst -ls -l tmp1.zst tmp2.zst -rm tmp* diff --git a/priv/zstd/contrib/cleanTabs b/priv/zstd/contrib/cleanTabs deleted file mode 100755 index 215913a..0000000 --- a/priv/zstd/contrib/cleanTabs +++ /dev/null @@ -1,2 +0,0 @@ -#!/bin/sh -sed -i '' $'s/\t/ /g' ../lib/**/*.{h,c} ../programs/*.{h,c} ../tests/*.c ./**/*.{h,cpp} ../examples/*.c ../zlibWrapper/*.{h,c} diff --git a/priv/zstd/contrib/gen_html/.gitignore b/priv/zstd/contrib/gen_html/.gitignore deleted file mode 100644 index 3446114..0000000 --- a/priv/zstd/contrib/gen_html/.gitignore +++ /dev/null @@ -1,3 +0,0 @@ -# make artefact -gen_html -zstd_manual.html diff --git a/priv/zstd/contrib/gen_html/Makefile b/priv/zstd/contrib/gen_html/Makefile deleted file mode 100644 index d9b32e3..0000000 --- a/priv/zstd/contrib/gen_html/Makefile +++ /dev/null @@ -1,51 +0,0 @@ -# ################################################################ -# Copyright (c) 2016-present, Facebook, Inc. -# All rights reserved. -# -# This source code is licensed under both the BSD-style license (found in the -# LICENSE file in the root directory of this source tree) and the GPLv2 (found -# in the COPYING file in the root directory of this source tree). -# ################################################################ - -CFLAGS ?= -O3 -CFLAGS += -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow -Wstrict-aliasing=1 -Wswitch-enum -Wno-comment -CFLAGS += $(MOREFLAGS) -FLAGS = $(CPPFLAGS) $(CFLAGS) $(CXXFLAGS) $(LDFLAGS) - -ZSTDAPI = ../../lib/zstd.h -ZSTDMANUAL = ../../doc/zstd_manual.html -LIBVER_MAJOR_SCRIPT:=`sed -n '/define ZSTD_VERSION_MAJOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < $(ZSTDAPI)` -LIBVER_MINOR_SCRIPT:=`sed -n '/define ZSTD_VERSION_MINOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < $(ZSTDAPI)` -LIBVER_PATCH_SCRIPT:=`sed -n '/define ZSTD_VERSION_RELEASE/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < $(ZSTDAPI)` -LIBVER_SCRIPT:= $(LIBVER_MAJOR_SCRIPT).$(LIBVER_MINOR_SCRIPT).$(LIBVER_PATCH_SCRIPT) -LIBVER := $(shell echo $(LIBVER_SCRIPT)) - - -# Define *.exe as extension for Windows systems -ifneq (,$(filter Windows%,$(OS))) -EXT =.exe -else -EXT = -endif - - -.PHONY: default -default: gen_html - -.PHONY: all -all: manual - -gen_html: gen_html.cpp - $(CXX) $(FLAGS) $^ -o $@$(EXT) - -$(ZSTDMANUAL): gen_html $(ZSTDAPI) - echo "Update zstd manual in /doc" - ./gen_html $(LIBVER) $(ZSTDAPI) $(ZSTDMANUAL) - -.PHONY: manual -manual: gen_html $(ZSTDMANUAL) - -.PHONY: clean -clean: - @$(RM) gen_html$(EXT) - @echo Cleaning completed diff --git a/priv/zstd/contrib/gen_html/README.md b/priv/zstd/contrib/gen_html/README.md deleted file mode 100644 index 63a4caa..0000000 --- a/priv/zstd/contrib/gen_html/README.md +++ /dev/null @@ -1,31 +0,0 @@ -gen_html - a program for automatic generation of zstd manual -============================================================ - -#### Introduction - -This simple C++ program generates a single-page HTML manual from `zstd.h`. - -The format of recognized comment blocks is following: -- comments of type `/*!` mean: this is a function declaration; switch comments with declarations -- comments of type `/**` and `/*-` mean: this is a comment; use a `

` header for the first line -- comments of type `/*=` and `/**=` mean: use a `

` header and show also all functions until first empty line -- comments of type `/*X` where `X` is different from above-mentioned are ignored - -Moreover: -- `ZSTDLIB_API` is removed to improve readability -- `typedef` are detected and included even if uncommented -- comments of type `/**<` and `/*!<` are detected and only function declaration is highlighted (bold) - - -#### Usage - -The program requires 3 parameters: -``` -gen_html [zstd_version] [input_file] [output_html] -``` - -To compile program and generate zstd manual we have used: -``` -make -./gen_html.exe 1.1.1 ../../lib/zstd.h zstd_manual.html -``` diff --git a/priv/zstd/contrib/gen_html/gen-zstd-manual.sh b/priv/zstd/contrib/gen_html/gen-zstd-manual.sh deleted file mode 100755 index 57a8b6e..0000000 --- a/priv/zstd/contrib/gen_html/gen-zstd-manual.sh +++ /dev/null @@ -1,9 +0,0 @@ -#!/bin/sh - -LIBVER_MAJOR_SCRIPT=`sed -n '/define ZSTD_VERSION_MAJOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < ../../lib/zstd.h` -LIBVER_MINOR_SCRIPT=`sed -n '/define ZSTD_VERSION_MINOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < ../../lib/zstd.h` -LIBVER_PATCH_SCRIPT=`sed -n '/define ZSTD_VERSION_RELEASE/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < ../../lib/zstd.h` -LIBVER_SCRIPT=$LIBVER_MAJOR_SCRIPT.$LIBVER_MINOR_SCRIPT.$LIBVER_PATCH_SCRIPT - -echo ZSTD_VERSION=$LIBVER_SCRIPT -./gen_html $LIBVER_SCRIPT ../../lib/zstd.h ./zstd_manual.html diff --git a/priv/zstd/contrib/gen_html/gen_html.cpp b/priv/zstd/contrib/gen_html/gen_html.cpp deleted file mode 100644 index 90d5b21..0000000 --- a/priv/zstd/contrib/gen_html/gen_html.cpp +++ /dev/null @@ -1,224 +0,0 @@ -/* - * Copyright (c) 2016-present, Przemyslaw Skibinski, Facebook, Inc. - * All rights reserved. - * - * This source code is licensed under both the BSD-style license (found in the - * LICENSE file in the root directory of this source tree) and the GPLv2 (found - * in the COPYING file in the root directory of this source tree). - */ - -#include -#include -#include -#include -using namespace std; - - -/* trim string at the beginning and at the end */ -void trim(string& s, string characters) -{ - size_t p = s.find_first_not_of(characters); - s.erase(0, p); - - p = s.find_last_not_of(characters); - if (string::npos != p) - s.erase(p+1); -} - - -/* trim C++ style comments */ -void trim_comments(string &s) -{ - size_t spos, epos; - - spos = s.find("/*"); - epos = s.find("*/"); - s = s.substr(spos+3, epos-(spos+3)); -} - - -/* get lines until a given terminator */ -vector get_lines(vector& input, int& linenum, string terminator) -{ - vector out; - string line; - size_t epos; - - while ((size_t)linenum < input.size()) { - line = input[linenum]; - - if (terminator.empty() && line.empty()) { linenum--; break; } - - epos = line.find(terminator); - if (!terminator.empty() && epos!=string::npos) { - out.push_back(line); - break; - } - out.push_back(line); - linenum++; - } - return out; -} - - -/* print line with ZSTDLIB_API removed and C++ comments not bold */ -void print_line(stringstream &sout, string line) -{ - size_t spos; - - if (line.substr(0,12) == "ZSTDLIB_API ") line = line.substr(12); - spos = line.find("/*"); - if (spos!=string::npos) { - sout << line.substr(0, spos); - sout << "" << line.substr(spos) << "" << endl; - } else { - // fprintf(stderr, "lines=%s\n", line.c_str()); - sout << line << endl; - } -} - - -int main(int argc, char *argv[]) { - char exclam; - int linenum, chapter = 1; - vector input, lines, comments, chapters; - string line, version; - size_t spos, l; - stringstream sout; - ifstream istream; - ofstream ostream; - - if (argc < 4) { - cout << "usage: " << argv[0] << " [zstd_version] [input_file] [output_html]" << endl; - return 1; - } - - version = "zstd " + string(argv[1]) + " Manual"; - - istream.open(argv[2], ifstream::in); - if (!istream.is_open()) { - cout << "Error opening file " << argv[2] << endl; - return 1; - } - - ostream.open(argv[3], ifstream::out); - if (!ostream.is_open()) { - cout << "Error opening file " << argv[3] << endl; - return 1; - } - - while (getline(istream, line)) { - input.push_back(line); - } - - for (linenum=0; (size_t)linenum < input.size(); linenum++) { - line = input[linenum]; - - /* typedefs are detected and included even if uncommented */ - if (line.substr(0,7) == "typedef" && line.find("{")!=string::npos) { - lines = get_lines(input, linenum, "}"); - sout << "
";
-            for (l=0; l

" << endl; - continue; - } - - /* comments of type /**< and /*!< are detected and only function declaration is highlighted (bold) */ - if ((line.find("/**<")!=string::npos || line.find("/*!<")!=string::npos) && line.find("*/")!=string::npos) { - sout << "
";
-            print_line(sout, line);
-            sout << "

" << endl; - continue; - } - - spos = line.find("/**="); - if (spos==string::npos) { - spos = line.find("/*!"); - if (spos==string::npos) - spos = line.find("/**"); - if (spos==string::npos) - spos = line.find("/*-"); - if (spos==string::npos) - spos = line.find("/*="); - if (spos==string::npos) - continue; - exclam = line[spos+2]; - } - else exclam = '='; - - comments = get_lines(input, linenum, "*/"); - if (!comments.empty()) comments[0] = line.substr(spos+3); - if (!comments.empty()) comments[comments.size()-1] = comments[comments.size()-1].substr(0, comments[comments.size()-1].find("*/")); - for (l=0; l"; - for (l=0; l

"; - for (l=0; l
" << endl << endl; - } else if (exclam == '=') { /* comments of type /*= and /**= mean: use a

header and show also all functions until first empty line */ - trim(comments[0], " "); - sout << "

" << comments[0] << "

";
-            for (l=1; l
";
-            lines = get_lines(input, ++linenum, "");
-            for (l=0; l
" << endl;
-        } else { /* comments of type /** and /*- mean: this is a comment; use a 
 header for the first line */
-            if (comments.empty()) continue;
-
-            trim(comments[0], " ");
-            sout << "
" << comments[0] << "
";
-            chapters.push_back(comments[0]);
-            chapter++;
-
-            for (l=1; l 1)
-                sout << "
" << endl << endl;
-            else
-                sout << "
" << endl << endl;
-        }
-    }
-
-    ostream << "\n\n\n" << version << "\n\n" << endl;
-    ostream << "
" << version << "
\n";
-
-    ostream << "
\n
Contents
\n
    \n";
-    for (size_t i=0; i" << chapters[i].c_str() << "\n";
-    ostream << "
\n
\n";
-
-    ostream << sout.str();
-    ostream << "" << endl << "" << endl;
-
-    return 0;
-}
diff --git a/priv/zstd/contrib/linux-kernel/.gitignore b/priv/zstd/contrib/linux-kernel/.gitignore
deleted file mode 100644
index d8dfeef..0000000
--- a/priv/zstd/contrib/linux-kernel/.gitignore
+++ /dev/null
@@ -1,4 +0,0 @@
-!lib/zstd
-!lib/zstd/*
-*.o
-*.a
diff --git a/priv/zstd/contrib/linux-kernel/0000-cover-letter.patch b/priv/zstd/contrib/linux-kernel/0000-cover-letter.patch
deleted file mode 100644
index d57ef27..0000000
--- a/priv/zstd/contrib/linux-kernel/0000-cover-letter.patch
+++ /dev/null
@@ -1,122 +0,0 @@
-From 308795a7713ca6fcd468b60fba9a2fca99cee6a0 Mon Sep 17 00:00:00 2001
-From: Nick Terrell 
-Date: Tue, 8 Aug 2017 19:20:25 -0700
-Subject: [PATCH v5 0/5] Add xxhash and zstd modules
-
-Hi all,
-
-This patch set adds xxhash, zstd compression, and zstd decompression
-modules. It also adds zstd support to BtrFS and SquashFS.
-
-Each patch has relevant summaries, benchmarks, and tests.
-
-Best,
-Nick Terrell
-
-Changelog:
-
-v1 -> v2:
-- Make pointer in lib/xxhash.c:394 non-const (1/5)
-- Use div_u64() for division of u64s (2/5)
-- Reduce stack usage of ZSTD_compressSequences(), ZSTD_buildSeqTable(),
-  ZSTD_decompressSequencesLong(), FSE_buildDTable(), FSE_decompress_wksp(),
-  HUF_writeCTable(), HUF_readStats(), HUF_readCTable(),
-  HUF_compressWeights(), HUF_readDTableX2(), and HUF_readDTableX4() (2/5)
-- No zstd function uses more than 400 B of stack space (2/5)
-
-v2 -> v3:
-- Work around gcc-7 bug https://gcc.gnu.org/bugzilla/show_bug.cgi?id=81388
-  (2/5)
-- Fix bug in dictionary compression from upstream commit cc1522351f (2/5)
-- Port upstream BtrFS commits e1ddce71d6, 389a6cfc2a, and 6acafd1eff (3/5)
-- Change default compression level for BtrFS to 3 (3/5)
-
-v3 -> v4:
-- Fix compiler warnings (2/5)
-- Add missing includes (3/5)
-- Fix minor linter warnings (3/5, 4/5)
-- Add crypto patch (5/5)
-
-v4 -> v5:
-- Fix rare compression bug from upstream commit 308047eb5d (2/5)
-- Fix bug introduced in v3 when working around the gcc-7 bug (2/5)
-- Fix ZSTD_DStream initialization code in squashfs (4/5)
-- Fix patch documentation for patches written by Sean Purcell (4/5)
-
-Nick Terrell (5):
-  lib: Add xxhash module
-  lib: Add zstd modules
-  btrfs: Add zstd support
-  squashfs: Add zstd support
-  crypto: Add zstd support
-
- crypto/Kconfig             |    9 +
- crypto/Makefile            |    1 +
- crypto/testmgr.c           |   10 +
- crypto/testmgr.h           |   71 +
- crypto/zstd.c              |  265 ++++
- fs/btrfs/Kconfig           |    2 +
- fs/btrfs/Makefile          |    2 +-
- fs/btrfs/compression.c     |    1 +
- fs/btrfs/compression.h     |    6 +-
- fs/btrfs/ctree.h           |    1 +
- fs/btrfs/disk-io.c         |    2 +
- fs/btrfs/ioctl.c           |    6 +-
- fs/btrfs/props.c           |    6 +
- fs/btrfs/super.c           |   12 +-
- fs/btrfs/sysfs.c           |    2 +
- fs/btrfs/zstd.c            |  432 ++++++
- fs/squashfs/Kconfig        |   14 +
- fs/squashfs/Makefile       |    1 +
- fs/squashfs/decompressor.c |    7 +
- fs/squashfs/decompressor.h |    4 +
- fs/squashfs/squashfs_fs.h  |    1 +
- fs/squashfs/zstd_wrapper.c |  151 ++
- include/linux/xxhash.h     |  236 +++
- include/linux/zstd.h       | 1157 +++++++++++++++
- include/uapi/linux/btrfs.h |    8 +-
- lib/Kconfig                |   11 +
- lib/Makefile               |    3 +
- lib/xxhash.c               |  500 +++++++
- lib/zstd/Makefile          |   18 +
- lib/zstd/bitstream.h       |  374 +++++
- lib/zstd/compress.c        | 3484 ++++++++++++++++++++++++++++++++++++++++++++
- lib/zstd/decompress.c      | 2528 ++++++++++++++++++++++++++++++++
- lib/zstd/entropy_common.c  |  243 +++
- lib/zstd/error_private.h   |   53 +
- lib/zstd/fse.h             |  575 ++++++++
- lib/zstd/fse_compress.c    |  795 ++++++++++
- lib/zstd/fse_decompress.c  |  332 +++++
- lib/zstd/huf.h             |  212 +++
- lib/zstd/huf_compress.c    |  770 ++++++++++
- lib/zstd/huf_decompress.c  |  960 ++++++++++++
- lib/zstd/mem.h             |  151 ++
- lib/zstd/zstd_common.c     |   75 +
- lib/zstd/zstd_internal.h   |  263 ++++
- lib/zstd/zstd_opt.h        | 1014 +++++++++++++
- 44 files changed, 14756 insertions(+), 12 deletions(-)
- create mode 100644 crypto/zstd.c
- create mode 100644 fs/btrfs/zstd.c
- create mode 100644 fs/squashfs/zstd_wrapper.c
- create mode 100644 include/linux/xxhash.h
- create mode 100644 include/linux/zstd.h
- create mode 100644 lib/xxhash.c
- create mode 100644 lib/zstd/Makefile
- create mode 100644 lib/zstd/bitstream.h
- create mode 100644 lib/zstd/compress.c
- create mode 100644 lib/zstd/decompress.c
- create mode 100644 lib/zstd/entropy_common.c
- create mode 100644 lib/zstd/error_private.h
- create mode 100644 lib/zstd/fse.h
- create mode 100644 lib/zstd/fse_compress.c
- create mode 100644 lib/zstd/fse_decompress.c
- create mode 100644 lib/zstd/huf.h
- create mode 100644 lib/zstd/huf_compress.c
- create mode 100644 lib/zstd/huf_decompress.c
- create mode 100644 lib/zstd/mem.h
- create mode 100644 lib/zstd/zstd_common.c
- create mode 100644 lib/zstd/zstd_internal.h
- create mode 100644 lib/zstd/zstd_opt.h
-
---
-2.9.3
diff --git a/priv/zstd/contrib/linux-kernel/0001-lib-Add-xxhash-module.patch b/priv/zstd/contrib/linux-kernel/0001-lib-Add-xxhash-module.patch
deleted file mode 100644
index 83f0992..0000000
--- a/priv/zstd/contrib/linux-kernel/0001-lib-Add-xxhash-module.patch
+++ /dev/null
@@ -1,862 +0,0 @@
-From a4b1ffb6e89bbccd519f9afa0910635668436105 Mon Sep 17 00:00:00 2001
-From: Nick Terrell 
-Date: Mon, 17 Jul 2017 17:07:18 -0700
-Subject: [PATCH v5 1/5] lib: Add xxhash module
-
-Adds xxhash kernel module with xxh32 and xxh64 hashes. xxhash is an
-extremely fast non-cryptographic hash algorithm for checksumming.
-The zstd compression and decompression modules added in the next patch
-require xxhash. I extracted it out from zstd since it is useful on its
-own. I copied the code from the upstream XXHash source repository and
-translated it into kernel style. I ran benchmarks and tests in the kernel
-and tests in userland.
-
-I benchmarked xxhash as a special character device. I ran in four modes,
-no-op, xxh32, xxh64, and crc32. The no-op mode simply copies the data to
-kernel space and ignores it. The xxh32, xxh64, and crc32 modes compute
-hashes on the copied data. I also ran it with four different buffer sizes.
-The benchmark file is located in the upstream zstd source repository under
-`contrib/linux-kernel/xxhash_test.c` [1].
-
-I ran the benchmarks on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-The VM is running on a MacBook Pro with a 3.1 GHz Intel Core i7 processor,
-16 GB of RAM, and a SSD. I benchmarked using the file `filesystem.squashfs`
-from `ubuntu-16.10-desktop-amd64.iso`, which is 1,536,217,088 B large.
-Run the following commands for the benchmark:
-
-    modprobe xxhash_test
-    mknod xxhash_test c 245 0
-    time cp filesystem.squashfs xxhash_test
-
-The time is reported by the time of the userland `cp`.
-The GB/s is computed with
-
-    1,536,217,008 B / time(buffer size, hash)
-
-which includes the time to copy from userland.
-The Normalized GB/s is computed with
-
-    1,536,217,088 B / (time(buffer size, hash) - time(buffer size, none)).
-
-
-| Buffer Size (B) | Hash  | Time (s) | GB/s | Adjusted GB/s |
-|-----------------|-------|----------|------|---------------|
-|            1024 | none  |    0.408 | 3.77 |             - |
-|            1024 | xxh32 |    0.649 | 2.37 |          6.37 |
-|            1024 | xxh64 |    0.542 | 2.83 |         11.46 |
-|            1024 | crc32 |    1.290 | 1.19 |          1.74 |
-|            4096 | none  |    0.380 | 4.04 |             - |
-|            4096 | xxh32 |    0.645 | 2.38 |          5.79 |
-|            4096 | xxh64 |    0.500 | 3.07 |         12.80 |
-|            4096 | crc32 |    1.168 | 1.32 |          1.95 |
-|            8192 | none  |    0.351 | 4.38 |             - |
-|            8192 | xxh32 |    0.614 | 2.50 |          5.84 |
-|            8192 | xxh64 |    0.464 | 3.31 |         13.60 |
-|            8192 | crc32 |    1.163 | 1.32 |          1.89 |
-|           16384 | none  |    0.346 | 4.43 |             - |
-|           16384 | xxh32 |    0.590 | 2.60 |          6.30 |
-|           16384 | xxh64 |    0.466 | 3.30 |         12.80 |
-|           16384 | crc32 |    1.183 | 1.30 |          1.84 |
-
-Tested in userland using the test-suite in the zstd repo under
-`contrib/linux-kernel/test/XXHashUserlandTest.cpp` [2] by mocking the
-kernel functions. A line in each branch of every function in `xxhash.c`
-was commented out to ensure that the test-suite fails. Additionally
-tested while testing zstd and with SMHasher [3].
-
-[1] https://phabricator.intern.facebook.com/P57526246
-[2] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/test/XXHashUserlandTest.cpp
-[3] https://github.com/aappleby/smhasher
-
-zstd source repository: https://github.com/facebook/zstd
-XXHash source repository: https://github.com/cyan4973/xxhash
-
-Signed-off-by: Nick Terrell 
----
-v1 -> v2:
-- Make pointer in lib/xxhash.c:394 non-const
-
- include/linux/xxhash.h | 236 +++++++++++++++++++++++
- lib/Kconfig            |   3 +
- lib/Makefile           |   1 +
- lib/xxhash.c           | 500 +++++++++++++++++++++++++++++++++++++++++++++++++
- 4 files changed, 740 insertions(+)
- create mode 100644 include/linux/xxhash.h
- create mode 100644 lib/xxhash.c
-
-diff --git a/include/linux/xxhash.h b/include/linux/xxhash.h
-new file mode 100644
-index 0000000..9e1f42c
---- /dev/null
-+++ b/include/linux/xxhash.h
-@@ -0,0 +1,236 @@
-+/*
-+ * xxHash - Extremely Fast Hash algorithm
-+ * Copyright (C) 2012-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ *     notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ *     copyright notice, this list of conditions and the following disclaimer
-+ *     in the documentation and/or other materials provided with the
-+ *     distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at:
-+ * - xxHash homepage: http://cyan4973.github.io/xxHash/
-+ * - xxHash source repository: https://github.com/Cyan4973/xxHash
-+ */
-+
-+/*
-+ * Notice extracted from xxHash homepage:
-+ *
-+ * xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
-+ * It also successfully passes all tests from the SMHasher suite.
-+ *
-+ * Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2
-+ * Duo @3GHz)
-+ *
-+ * Name            Speed       Q.Score   Author
-+ * xxHash          5.4 GB/s     10
-+ * CrapWow         3.2 GB/s      2       Andrew
-+ * MumurHash 3a    2.7 GB/s     10       Austin Appleby
-+ * SpookyHash      2.0 GB/s     10       Bob Jenkins
-+ * SBox            1.4 GB/s      9       Bret Mulvey
-+ * Lookup3         1.2 GB/s      9       Bob Jenkins
-+ * SuperFastHash   1.2 GB/s      1       Paul Hsieh
-+ * CityHash64      1.05 GB/s    10       Pike & Alakuijala
-+ * FNV             0.55 GB/s     5       Fowler, Noll, Vo
-+ * CRC32           0.43 GB/s     9
-+ * MD5-32          0.33 GB/s    10       Ronald L. Rivest
-+ * SHA1-32         0.28 GB/s    10
-+ *
-+ * Q.Score is a measure of quality of the hash function.
-+ * It depends on successfully passing SMHasher test set.
-+ * 10 is a perfect score.
-+ *
-+ * A 64-bits version, named xxh64 offers much better speed,
-+ * but for 64-bits applications only.
-+ * Name     Speed on 64 bits    Speed on 32 bits
-+ * xxh64       13.8 GB/s            1.9 GB/s
-+ * xxh32        6.8 GB/s            6.0 GB/s
-+ */
-+
-+#ifndef XXHASH_H
-+#define XXHASH_H
-+
-+#include 
-+
-+/*-****************************
-+ * Simple Hash Functions
-+ *****************************/
-+
-+/**
-+ * xxh32() - calculate the 32-bit hash of the input with a given seed.
-+ *
-+ * @input:  The data to hash.
-+ * @length: The length of the data to hash.
-+ * @seed:   The seed can be used to alter the result predictably.
-+ *
-+ * Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
-+ *
-+ * Return:  The 32-bit hash of the data.
-+ */
-+uint32_t xxh32(const void *input, size_t length, uint32_t seed);
-+
-+/**
-+ * xxh64() - calculate the 64-bit hash of the input with a given seed.
-+ *
-+ * @input:  The data to hash.
-+ * @length: The length of the data to hash.
-+ * @seed:   The seed can be used to alter the result predictably.
-+ *
-+ * This function runs 2x faster on 64-bit systems, but slower on 32-bit systems.
-+ *
-+ * Return:  The 64-bit hash of the data.
-+ */
-+uint64_t xxh64(const void *input, size_t length, uint64_t seed);
-+
-+/*-****************************
-+ * Streaming Hash Functions
-+ *****************************/
-+
-+/*
-+ * These definitions are only meant to allow allocation of XXH state
-+ * statically, on stack, or in a struct for example.
-+ * Do not use members directly.
-+ */
-+
-+/**
-+ * struct xxh32_state - private xxh32 state, do not use members directly
-+ */
-+struct xxh32_state {
-+	uint32_t total_len_32;
-+	uint32_t large_len;
-+	uint32_t v1;
-+	uint32_t v2;
-+	uint32_t v3;
-+	uint32_t v4;
-+	uint32_t mem32[4];
-+	uint32_t memsize;
-+};
-+
-+/**
-+ * struct xxh32_state - private xxh64 state, do not use members directly
-+ */
-+struct xxh64_state {
-+	uint64_t total_len;
-+	uint64_t v1;
-+	uint64_t v2;
-+	uint64_t v3;
-+	uint64_t v4;
-+	uint64_t mem64[4];
-+	uint32_t memsize;
-+};
-+
-+/**
-+ * xxh32_reset() - reset the xxh32 state to start a new hashing operation
-+ *
-+ * @state: The xxh32 state to reset.
-+ * @seed:  Initialize the hash state with this seed.
-+ *
-+ * Call this function on any xxh32_state to prepare for a new hashing operation.
-+ */
-+void xxh32_reset(struct xxh32_state *state, uint32_t seed);
-+
-+/**
-+ * xxh32_update() - hash the data given and update the xxh32 state
-+ *
-+ * @state:  The xxh32 state to update.
-+ * @input:  The data to hash.
-+ * @length: The length of the data to hash.
-+ *
-+ * After calling xxh32_reset() call xxh32_update() as many times as necessary.
-+ *
-+ * Return:  Zero on success, otherwise an error code.
-+ */
-+int xxh32_update(struct xxh32_state *state, const void *input, size_t length);
-+
-+/**
-+ * xxh32_digest() - produce the current xxh32 hash
-+ *
-+ * @state: Produce the current xxh32 hash of this state.
-+ *
-+ * A hash value can be produced at any time. It is still possible to continue
-+ * inserting input into the hash state after a call to xxh32_digest(), and
-+ * generate new hashes later on, by calling xxh32_digest() again.
-+ *
-+ * Return: The xxh32 hash stored in the state.
-+ */
-+uint32_t xxh32_digest(const struct xxh32_state *state);
-+
-+/**
-+ * xxh64_reset() - reset the xxh64 state to start a new hashing operation
-+ *
-+ * @state: The xxh64 state to reset.
-+ * @seed:  Initialize the hash state with this seed.
-+ */
-+void xxh64_reset(struct xxh64_state *state, uint64_t seed);
-+
-+/**
-+ * xxh64_update() - hash the data given and update the xxh64 state
-+ * @state:  The xxh64 state to update.
-+ * @input:  The data to hash.
-+ * @length: The length of the data to hash.
-+ *
-+ * After calling xxh64_reset() call xxh64_update() as many times as necessary.
-+ *
-+ * Return:  Zero on success, otherwise an error code.
-+ */
-+int xxh64_update(struct xxh64_state *state, const void *input, size_t length);
-+
-+/**
-+ * xxh64_digest() - produce the current xxh64 hash
-+ *
-+ * @state: Produce the current xxh64 hash of this state.
-+ *
-+ * A hash value can be produced at any time. It is still possible to continue
-+ * inserting input into the hash state after a call to xxh64_digest(), and
-+ * generate new hashes later on, by calling xxh64_digest() again.
-+ *
-+ * Return: The xxh64 hash stored in the state.
-+ */
-+uint64_t xxh64_digest(const struct xxh64_state *state);
-+
-+/*-**************************
-+ * Utils
-+ ***************************/
-+
-+/**
-+ * xxh32_copy_state() - copy the source state into the destination state
-+ *
-+ * @src: The source xxh32 state.
-+ * @dst: The destination xxh32 state.
-+ */
-+void xxh32_copy_state(struct xxh32_state *dst, const struct xxh32_state *src);
-+
-+/**
-+ * xxh64_copy_state() - copy the source state into the destination state
-+ *
-+ * @src: The source xxh64 state.
-+ * @dst: The destination xxh64 state.
-+ */
-+void xxh64_copy_state(struct xxh64_state *dst, const struct xxh64_state *src);
-+
-+#endif /* XXHASH_H */
-diff --git a/lib/Kconfig b/lib/Kconfig
-index 6762529..5e7541f 100644
---- a/lib/Kconfig
-+++ b/lib/Kconfig
-@@ -192,6 +192,9 @@ config CRC8
- 	  when they need to do cyclic redundancy check according CRC8
- 	  algorithm. Module will be called crc8.
-
-+config XXHASH
-+	tristate
-+
- config AUDIT_GENERIC
- 	bool
- 	depends on AUDIT && !AUDIT_ARCH
-diff --git a/lib/Makefile b/lib/Makefile
-index 40c1837..d06b68a 100644
---- a/lib/Makefile
-+++ b/lib/Makefile
-@@ -102,6 +102,7 @@ obj-$(CONFIG_CRC4)	+= crc4.o
- obj-$(CONFIG_CRC7)	+= crc7.o
- obj-$(CONFIG_LIBCRC32C)	+= libcrc32c.o
- obj-$(CONFIG_CRC8)	+= crc8.o
-+obj-$(CONFIG_XXHASH)	+= xxhash.o
- obj-$(CONFIG_GENERIC_ALLOCATOR) += genalloc.o
-
- obj-$(CONFIG_842_COMPRESS) += 842/
-diff --git a/lib/xxhash.c b/lib/xxhash.c
-new file mode 100644
-index 0000000..aa61e2a
---- /dev/null
-+++ b/lib/xxhash.c
-@@ -0,0 +1,500 @@
-+/*
-+ * xxHash - Extremely Fast Hash algorithm
-+ * Copyright (C) 2012-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ *     notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ *     copyright notice, this list of conditions and the following disclaimer
-+ *     in the documentation and/or other materials provided with the
-+ *     distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at:
-+ * - xxHash homepage: http://cyan4973.github.io/xxHash/
-+ * - xxHash source repository: https://github.com/Cyan4973/xxHash
-+ */
-+
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+
-+/*-*************************************
-+ * Macros
-+ **************************************/
-+#define xxh_rotl32(x, r) ((x << r) | (x >> (32 - r)))
-+#define xxh_rotl64(x, r) ((x << r) | (x >> (64 - r)))
-+
-+#ifdef __LITTLE_ENDIAN
-+# define XXH_CPU_LITTLE_ENDIAN 1
-+#else
-+# define XXH_CPU_LITTLE_ENDIAN 0
-+#endif
-+
-+/*-*************************************
-+ * Constants
-+ **************************************/
-+static const uint32_t PRIME32_1 = 2654435761U;
-+static const uint32_t PRIME32_2 = 2246822519U;
-+static const uint32_t PRIME32_3 = 3266489917U;
-+static const uint32_t PRIME32_4 =  668265263U;
-+static const uint32_t PRIME32_5 =  374761393U;
-+
-+static const uint64_t PRIME64_1 = 11400714785074694791ULL;
-+static const uint64_t PRIME64_2 = 14029467366897019727ULL;
-+static const uint64_t PRIME64_3 =  1609587929392839161ULL;
-+static const uint64_t PRIME64_4 =  9650029242287828579ULL;
-+static const uint64_t PRIME64_5 =  2870177450012600261ULL;
-+
-+/*-**************************
-+ *  Utils
-+ ***************************/
-+void xxh32_copy_state(struct xxh32_state *dst, const struct xxh32_state *src)
-+{
-+	memcpy(dst, src, sizeof(*dst));
-+}
-+EXPORT_SYMBOL(xxh32_copy_state);
-+
-+void xxh64_copy_state(struct xxh64_state *dst, const struct xxh64_state *src)
-+{
-+	memcpy(dst, src, sizeof(*dst));
-+}
-+EXPORT_SYMBOL(xxh64_copy_state);
-+
-+/*-***************************
-+ * Simple Hash Functions
-+ ****************************/
-+static uint32_t xxh32_round(uint32_t seed, const uint32_t input)
-+{
-+	seed += input * PRIME32_2;
-+	seed = xxh_rotl32(seed, 13);
-+	seed *= PRIME32_1;
-+	return seed;
-+}
-+
-+uint32_t xxh32(const void *input, const size_t len, const uint32_t seed)
-+{
-+	const uint8_t *p = (const uint8_t *)input;
-+	const uint8_t *b_end = p + len;
-+	uint32_t h32;
-+
-+	if (len >= 16) {
-+		const uint8_t *const limit = b_end - 16;
-+		uint32_t v1 = seed + PRIME32_1 + PRIME32_2;
-+		uint32_t v2 = seed + PRIME32_2;
-+		uint32_t v3 = seed + 0;
-+		uint32_t v4 = seed - PRIME32_1;
-+
-+		do {
-+			v1 = xxh32_round(v1, get_unaligned_le32(p));
-+			p += 4;
-+			v2 = xxh32_round(v2, get_unaligned_le32(p));
-+			p += 4;
-+			v3 = xxh32_round(v3, get_unaligned_le32(p));
-+			p += 4;
-+			v4 = xxh32_round(v4, get_unaligned_le32(p));
-+			p += 4;
-+		} while (p <= limit);
-+
-+		h32 = xxh_rotl32(v1, 1) + xxh_rotl32(v2, 7) +
-+			xxh_rotl32(v3, 12) + xxh_rotl32(v4, 18);
-+	} else {
-+		h32 = seed + PRIME32_5;
-+	}
-+
-+	h32 += (uint32_t)len;
-+
-+	while (p + 4 <= b_end) {
-+		h32 += get_unaligned_le32(p) * PRIME32_3;
-+		h32 = xxh_rotl32(h32, 17) * PRIME32_4;
-+		p += 4;
-+	}
-+
-+	while (p < b_end) {
-+		h32 += (*p) * PRIME32_5;
-+		h32 = xxh_rotl32(h32, 11) * PRIME32_1;
-+		p++;
-+	}
-+
-+	h32 ^= h32 >> 15;
-+	h32 *= PRIME32_2;
-+	h32 ^= h32 >> 13;
-+	h32 *= PRIME32_3;
-+	h32 ^= h32 >> 16;
-+
-+	return h32;
-+}
-+EXPORT_SYMBOL(xxh32);
-+
-+static uint64_t xxh64_round(uint64_t acc, const uint64_t input)
-+{
-+	acc += input * PRIME64_2;
-+	acc = xxh_rotl64(acc, 31);
-+	acc *= PRIME64_1;
-+	return acc;
-+}
-+
-+static uint64_t xxh64_merge_round(uint64_t acc, uint64_t val)
-+{
-+	val = xxh64_round(0, val);
-+	acc ^= val;
-+	acc = acc * PRIME64_1 + PRIME64_4;
-+	return acc;
-+}
-+
-+uint64_t xxh64(const void *input, const size_t len, const uint64_t seed)
-+{
-+	const uint8_t *p = (const uint8_t *)input;
-+	const uint8_t *const b_end = p + len;
-+	uint64_t h64;
-+
-+	if (len >= 32) {
-+		const uint8_t *const limit = b_end - 32;
-+		uint64_t v1 = seed + PRIME64_1 + PRIME64_2;
-+		uint64_t v2 = seed + PRIME64_2;
-+		uint64_t v3 = seed + 0;
-+		uint64_t v4 = seed - PRIME64_1;
-+
-+		do {
-+			v1 = xxh64_round(v1, get_unaligned_le64(p));
-+			p += 8;
-+			v2 = xxh64_round(v2, get_unaligned_le64(p));
-+			p += 8;
-+			v3 = xxh64_round(v3, get_unaligned_le64(p));
-+			p += 8;
-+			v4 = xxh64_round(v4, get_unaligned_le64(p));
-+			p += 8;
-+		} while (p <= limit);
-+
-+		h64 = xxh_rotl64(v1, 1) + xxh_rotl64(v2, 7) +
-+			xxh_rotl64(v3, 12) + xxh_rotl64(v4, 18);
-+		h64 = xxh64_merge_round(h64, v1);
-+		h64 = xxh64_merge_round(h64, v2);
-+		h64 = xxh64_merge_round(h64, v3);
-+		h64 = xxh64_merge_round(h64, v4);
-+
-+	} else {
-+		h64  = seed + PRIME64_5;
-+	}
-+
-+	h64 += (uint64_t)len;
-+
-+	while (p + 8 <= b_end) {
-+		const uint64_t k1 = xxh64_round(0, get_unaligned_le64(p));
-+
-+		h64 ^= k1;
-+		h64 = xxh_rotl64(h64, 27) * PRIME64_1 + PRIME64_4;
-+		p += 8;
-+	}
-+
-+	if (p + 4 <= b_end) {
-+		h64 ^= (uint64_t)(get_unaligned_le32(p)) * PRIME64_1;
-+		h64 = xxh_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-+		p += 4;
-+	}
-+
-+	while (p < b_end) {
-+		h64 ^= (*p) * PRIME64_5;
-+		h64 = xxh_rotl64(h64, 11) * PRIME64_1;
-+		p++;
-+	}
-+
-+	h64 ^= h64 >> 33;
-+	h64 *= PRIME64_2;
-+	h64 ^= h64 >> 29;
-+	h64 *= PRIME64_3;
-+	h64 ^= h64 >> 32;
-+
-+	return h64;
-+}
-+EXPORT_SYMBOL(xxh64);
-+
-+/*-**************************************************
-+ * Advanced Hash Functions
-+ ***************************************************/
-+void xxh32_reset(struct xxh32_state *statePtr, const uint32_t seed)
-+{
-+	/* use a local state for memcpy() to avoid strict-aliasing warnings */
-+	struct xxh32_state state;
-+
-+	memset(&state, 0, sizeof(state));
-+	state.v1 = seed + PRIME32_1 + PRIME32_2;
-+	state.v2 = seed + PRIME32_2;
-+	state.v3 = seed + 0;
-+	state.v4 = seed - PRIME32_1;
-+	memcpy(statePtr, &state, sizeof(state));
-+}
-+EXPORT_SYMBOL(xxh32_reset);
-+
-+void xxh64_reset(struct xxh64_state *statePtr, const uint64_t seed)
-+{
-+	/* use a local state for memcpy() to avoid strict-aliasing warnings */
-+	struct xxh64_state state;
-+
-+	memset(&state, 0, sizeof(state));
-+	state.v1 = seed + PRIME64_1 + PRIME64_2;
-+	state.v2 = seed + PRIME64_2;
-+	state.v3 = seed + 0;
-+	state.v4 = seed - PRIME64_1;
-+	memcpy(statePtr, &state, sizeof(state));
-+}
-+EXPORT_SYMBOL(xxh64_reset);
-+
-+int xxh32_update(struct xxh32_state *state, const void *input, const size_t len)
-+{
-+	const uint8_t *p = (const uint8_t *)input;
-+	const uint8_t *const b_end = p + len;
-+
-+	if (input == NULL)
-+		return -EINVAL;
-+
-+	state->total_len_32 += (uint32_t)len;
-+	state->large_len |= (len >= 16) | (state->total_len_32 >= 16);
-+
-+	if (state->memsize + len < 16) { /* fill in tmp buffer */
-+		memcpy((uint8_t *)(state->mem32) + state->memsize, input, len);
-+		state->memsize += (uint32_t)len;
-+		return 0;
-+	}
-+
-+	if (state->memsize) { /* some data left from previous update */
-+		const uint32_t *p32 = state->mem32;
-+
-+		memcpy((uint8_t *)(state->mem32) + state->memsize, input,
-+			16 - state->memsize);
-+
-+		state->v1 = xxh32_round(state->v1, get_unaligned_le32(p32));
-+		p32++;
-+		state->v2 = xxh32_round(state->v2, get_unaligned_le32(p32));
-+		p32++;
-+		state->v3 = xxh32_round(state->v3, get_unaligned_le32(p32));
-+		p32++;
-+		state->v4 = xxh32_round(state->v4, get_unaligned_le32(p32));
-+		p32++;
-+
-+		p += 16-state->memsize;
-+		state->memsize = 0;
-+	}
-+
-+	if (p <= b_end - 16) {
-+		const uint8_t *const limit = b_end - 16;
-+		uint32_t v1 = state->v1;
-+		uint32_t v2 = state->v2;
-+		uint32_t v3 = state->v3;
-+		uint32_t v4 = state->v4;
-+
-+		do {
-+			v1 = xxh32_round(v1, get_unaligned_le32(p));
-+			p += 4;
-+			v2 = xxh32_round(v2, get_unaligned_le32(p));
-+			p += 4;
-+			v3 = xxh32_round(v3, get_unaligned_le32(p));
-+			p += 4;
-+			v4 = xxh32_round(v4, get_unaligned_le32(p));
-+			p += 4;
-+		} while (p <= limit);
-+
-+		state->v1 = v1;
-+		state->v2 = v2;
-+		state->v3 = v3;
-+		state->v4 = v4;
-+	}
-+
-+	if (p < b_end) {
-+		memcpy(state->mem32, p, (size_t)(b_end-p));
-+		state->memsize = (uint32_t)(b_end-p);
-+	}
-+
-+	return 0;
-+}
-+EXPORT_SYMBOL(xxh32_update);
-+
-+uint32_t xxh32_digest(const struct xxh32_state *state)
-+{
-+	const uint8_t *p = (const uint8_t *)state->mem32;
-+	const uint8_t *const b_end = (const uint8_t *)(state->mem32) +
-+		state->memsize;
-+	uint32_t h32;
-+
-+	if (state->large_len) {
-+		h32 = xxh_rotl32(state->v1, 1) + xxh_rotl32(state->v2, 7) +
-+			xxh_rotl32(state->v3, 12) + xxh_rotl32(state->v4, 18);
-+	} else {
-+		h32 = state->v3 /* == seed */ + PRIME32_5;
-+	}
-+
-+	h32 += state->total_len_32;
-+
-+	while (p + 4 <= b_end) {
-+		h32 += get_unaligned_le32(p) * PRIME32_3;
-+		h32 = xxh_rotl32(h32, 17) * PRIME32_4;
-+		p += 4;
-+	}
-+
-+	while (p < b_end) {
-+		h32 += (*p) * PRIME32_5;
-+		h32 = xxh_rotl32(h32, 11) * PRIME32_1;
-+		p++;
-+	}
-+
-+	h32 ^= h32 >> 15;
-+	h32 *= PRIME32_2;
-+	h32 ^= h32 >> 13;
-+	h32 *= PRIME32_3;
-+	h32 ^= h32 >> 16;
-+
-+	return h32;
-+}
-+EXPORT_SYMBOL(xxh32_digest);
-+
-+int xxh64_update(struct xxh64_state *state, const void *input, const size_t len)
-+{
-+	const uint8_t *p = (const uint8_t *)input;
-+	const uint8_t *const b_end = p + len;
-+
-+	if (input == NULL)
-+		return -EINVAL;
-+
-+	state->total_len += len;
-+
-+	if (state->memsize + len < 32) { /* fill in tmp buffer */
-+		memcpy(((uint8_t *)state->mem64) + state->memsize, input, len);
-+		state->memsize += (uint32_t)len;
-+		return 0;
-+	}
-+
-+	if (state->memsize) { /* tmp buffer is full */
-+		uint64_t *p64 = state->mem64;
-+
-+		memcpy(((uint8_t *)p64) + state->memsize, input,
-+			32 - state->memsize);
-+
-+		state->v1 = xxh64_round(state->v1, get_unaligned_le64(p64));
-+		p64++;
-+		state->v2 = xxh64_round(state->v2, get_unaligned_le64(p64));
-+		p64++;
-+		state->v3 = xxh64_round(state->v3, get_unaligned_le64(p64));
-+		p64++;
-+		state->v4 = xxh64_round(state->v4, get_unaligned_le64(p64));
-+
-+		p += 32 - state->memsize;
-+		state->memsize = 0;
-+	}
-+
-+	if (p + 32 <= b_end) {
-+		const uint8_t *const limit = b_end - 32;
-+		uint64_t v1 = state->v1;
-+		uint64_t v2 = state->v2;
-+		uint64_t v3 = state->v3;
-+		uint64_t v4 = state->v4;
-+
-+		do {
-+			v1 = xxh64_round(v1, get_unaligned_le64(p));
-+			p += 8;
-+			v2 = xxh64_round(v2, get_unaligned_le64(p));
-+			p += 8;
-+			v3 = xxh64_round(v3, get_unaligned_le64(p));
-+			p += 8;
-+			v4 = xxh64_round(v4, get_unaligned_le64(p));
-+			p += 8;
-+		} while (p <= limit);
-+
-+		state->v1 = v1;
-+		state->v2 = v2;
-+		state->v3 = v3;
-+		state->v4 = v4;
-+	}
-+
-+	if (p < b_end) {
-+		memcpy(state->mem64, p, (size_t)(b_end-p));
-+		state->memsize = (uint32_t)(b_end - p);
-+	}
-+
-+	return 0;
-+}
-+EXPORT_SYMBOL(xxh64_update);
-+
-+uint64_t xxh64_digest(const struct xxh64_state *state)
-+{
-+	const uint8_t *p = (const uint8_t *)state->mem64;
-+	const uint8_t *const b_end = (const uint8_t *)state->mem64 +
-+		state->memsize;
-+	uint64_t h64;
-+
-+	if (state->total_len >= 32) {
-+		const uint64_t v1 = state->v1;
-+		const uint64_t v2 = state->v2;
-+		const uint64_t v3 = state->v3;
-+		const uint64_t v4 = state->v4;
-+
-+		h64 = xxh_rotl64(v1, 1) + xxh_rotl64(v2, 7) +
-+			xxh_rotl64(v3, 12) + xxh_rotl64(v4, 18);
-+		h64 = xxh64_merge_round(h64, v1);
-+		h64 = xxh64_merge_round(h64, v2);
-+		h64 = xxh64_merge_round(h64, v3);
-+		h64 = xxh64_merge_round(h64, v4);
-+	} else {
-+		h64  = state->v3 + PRIME64_5;
-+	}
-+
-+	h64 += (uint64_t)state->total_len;
-+
-+	while (p + 8 <= b_end) {
-+		const uint64_t k1 = xxh64_round(0, get_unaligned_le64(p));
-+
-+		h64 ^= k1;
-+		h64 = xxh_rotl64(h64, 27) * PRIME64_1 + PRIME64_4;
-+		p += 8;
-+	}
-+
-+	if (p + 4 <= b_end) {
-+		h64 ^= (uint64_t)(get_unaligned_le32(p)) * PRIME64_1;
-+		h64 = xxh_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-+		p += 4;
-+	}
-+
-+	while (p < b_end) {
-+		h64 ^= (*p) * PRIME64_5;
-+		h64 = xxh_rotl64(h64, 11) * PRIME64_1;
-+		p++;
-+	}
-+
-+	h64 ^= h64 >> 33;
-+	h64 *= PRIME64_2;
-+	h64 ^= h64 >> 29;
-+	h64 *= PRIME64_3;
-+	h64 ^= h64 >> 32;
-+
-+	return h64;
-+}
-+EXPORT_SYMBOL(xxh64_digest);
-+
-+MODULE_LICENSE("Dual BSD/GPL");
-+MODULE_DESCRIPTION("xxHash");
---
-2.9.3
diff --git a/priv/zstd/contrib/linux-kernel/0002-lib-Add-zstd-modules.patch b/priv/zstd/contrib/linux-kernel/0002-lib-Add-zstd-modules.patch
deleted file mode 100644
index c3bbaed..0000000
--- a/priv/zstd/contrib/linux-kernel/0002-lib-Add-zstd-modules.patch
+++ /dev/null
@@ -1,13285 +0,0 @@
-From 2b29ec569f8438a0307debd29873859ca6d407fc Mon Sep 17 00:00:00 2001
-From: Nick Terrell 
-Date: Mon, 17 Jul 2017 17:08:19 -0700
-Subject: [PATCH v5 2/5] lib: Add zstd modules
-
-Add zstd compression and decompression kernel modules.
-zstd offers a wide varity of compression speed and quality trade-offs.
-It can compress at speeds approaching lz4, and quality approaching lzma.
-zstd decompressions at speeds more than twice as fast as zlib, and
-decompression speed remains roughly the same across all compression levels.
-
-The code was ported from the upstream zstd source repository. The
-`linux/zstd.h` header was modified to match linux kernel style.
-The cross-platform and allocation code was stripped out. Instead zstd
-requires the caller to pass a preallocated workspace. The source files
-were clang-formatted [1] to match the Linux Kernel style as much as
-possible. Otherwise, the code was unmodified. We would like to avoid
-as much further manual modification to the source code as possible, so it
-will be easier to keep the kernel zstd up to date.
-
-I benchmarked zstd compression as a special character device. I ran zstd
-and zlib compression at several levels, as well as performing no
-compression, which measure the time spent copying the data to kernel space.
-Data is passed to the compresser 4096 B at a time. The benchmark file is
-located in the upstream zstd source repository under
-`contrib/linux-kernel/zstd_compress_test.c` [2].
-
-I ran the benchmarks on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-The VM is running on a MacBook Pro with a 3.1 GHz Intel Core i7 processor,
-16 GB of RAM, and a SSD. I benchmarked using `silesia.tar` [3], which is
-211,988,480 B large. Run the following commands for the benchmark:
-
-    sudo modprobe zstd_compress_test
-    sudo mknod zstd_compress_test c 245 0
-    sudo cp silesia.tar zstd_compress_test
-
-The time is reported by the time of the userland `cp`.
-The MB/s is computed with
-
-    1,536,217,008 B / time(buffer size, hash)
-
-which includes the time to copy from userland.
-The Adjusted MB/s is computed with
-
-    1,536,217,088 B / (time(buffer size, hash) - time(buffer size, none)).
-
-The memory reported is the amount of memory the compressor requests.
-
-| Method   | Size (B) | Time (s) | Ratio | MB/s    | Adj MB/s | Mem (MB) |
-|----------|----------|----------|-------|---------|----------|----------|
-| none     | 11988480 |    0.100 |     1 | 2119.88 |        - |        - |
-| zstd -1  | 73645762 |    1.044 | 2.878 |  203.05 |   224.56 |     1.23 |
-| zstd -3  | 66988878 |    1.761 | 3.165 |  120.38 |   127.63 |     2.47 |
-| zstd -5  | 65001259 |    2.563 | 3.261 |   82.71 |    86.07 |     2.86 |
-| zstd -10 | 60165346 |   13.242 | 3.523 |   16.01 |    16.13 |    13.22 |
-| zstd -15 | 58009756 |   47.601 | 3.654 |    4.45 |     4.46 |    21.61 |
-| zstd -19 | 54014593 |  102.835 | 3.925 |    2.06 |     2.06 |    60.15 |
-| zlib -1  | 77260026 |    2.895 | 2.744 |   73.23 |    75.85 |     0.27 |
-| zlib -3  | 72972206 |    4.116 | 2.905 |   51.50 |    52.79 |     0.27 |
-| zlib -6  | 68190360 |    9.633 | 3.109 |   22.01 |    22.24 |     0.27 |
-| zlib -9  | 67613382 |   22.554 | 3.135 |    9.40 |     9.44 |     0.27 |
-
-I benchmarked zstd decompression using the same method on the same machine.
-The benchmark file is located in the upstream zstd repo under
-`contrib/linux-kernel/zstd_decompress_test.c` [4]. The memory reported is
-the amount of memory required to decompress data compressed with the given
-compression level. If you know the maximum size of your input, you can
-reduce the memory usage of decompression irrespective of the compression
-level.
-
-| Method   | Time (s) | MB/s    | Adjusted MB/s | Memory (MB) |
-|----------|----------|---------|---------------|-------------|
-| none     |    0.025 | 8479.54 |             - |           - |
-| zstd -1  |    0.358 |  592.15 |        636.60 |        0.84 |
-| zstd -3  |    0.396 |  535.32 |        571.40 |        1.46 |
-| zstd -5  |    0.396 |  535.32 |        571.40 |        1.46 |
-| zstd -10 |    0.374 |  566.81 |        607.42 |        2.51 |
-| zstd -15 |    0.379 |  559.34 |        598.84 |        4.61 |
-| zstd -19 |    0.412 |  514.54 |        547.77 |        8.80 |
-| zlib -1  |    0.940 |  225.52 |        231.68 |        0.04 |
-| zlib -3  |    0.883 |  240.08 |        247.07 |        0.04 |
-| zlib -6  |    0.844 |  251.17 |        258.84 |        0.04 |
-| zlib -9  |    0.837 |  253.27 |        287.64 |        0.04 |
-
-Tested in userland using the test-suite in the zstd repo under
-`contrib/linux-kernel/test/UserlandTest.cpp` [5] by mocking the kernel
-functions. Fuzz tested using libfuzzer [6] with the fuzz harnesses under
-`contrib/linux-kernel/test/{RoundTripCrash.c,DecompressCrash.c}` [7] [8]
-with ASAN, UBSAN, and MSAN. Additionaly, it was tested while testing the
-BtrFS and SquashFS patches coming next.
-
-[1] https://clang.llvm.org/docs/ClangFormat.html
-[2] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/zstd_compress_test.c
-[3] http://sun.aei.polsl.pl/~sdeor/index.php?page=silesia
-[4] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/zstd_decompress_test.c
-[5] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/test/UserlandTest.cpp
-[6] http://llvm.org/docs/LibFuzzer.html
-[7] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/test/RoundTripCrash.c
-[8] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/test/DecompressCrash.c
-
-zstd source repository: https://github.com/facebook/zstd
-
-Signed-off-by: Nick Terrell 
----
-v1 -> v2:
-- Use div_u64() for division of u64s
-- Reduce stack usage of ZSTD_compressSequences(), ZSTD_buildSeqTable(),
-  ZSTD_decompressSequencesLong(), FSE_buildDTable(), FSE_decompress_wksp(),
-  HUF_writeCTable(), HUF_readStats(), HUF_readCTable(),
-  HUF_compressWeights(), HUF_readDTableX2(), and HUF_readDTableX4()
-- No function uses more than 400 B of stack space
-
-v2 -> v3:
-- Work around gcc-7 bug https://gcc.gnu.org/bugzilla/show_bug.cgi?id=81388
-- Fix bug in dictionary compression from upstream commit cc1522351f
-
-v3 -> v4:
-- Fix minor compiler warnings
-
-v4 -> v5:
-- Fix rare compression bug from upstream commit 308047eb5d
-- Fix bug introduced in v3 when working around the gcc-7 bug
-
- include/linux/zstd.h      | 1155 +++++++++++++++
- lib/Kconfig               |    8 +
- lib/Makefile              |    2 +
- lib/zstd/Makefile         |   18 +
- lib/zstd/bitstream.h      |  374 +++++
- lib/zstd/compress.c       | 3482 +++++++++++++++++++++++++++++++++++++++++++++
- lib/zstd/decompress.c     | 2526 ++++++++++++++++++++++++++++++++
- lib/zstd/entropy_common.c |  243 ++++
- lib/zstd/error_private.h  |   51 +
- lib/zstd/fse.h            |  575 ++++++++
- lib/zstd/fse_compress.c   |  795 +++++++++++
- lib/zstd/fse_decompress.c |  332 +++++
- lib/zstd/huf.h            |  212 +++
- lib/zstd/huf_compress.c   |  770 ++++++++++
- lib/zstd/huf_decompress.c |  960 +++++++++++++
- lib/zstd/mem.h            |  149 ++
- lib/zstd/zstd_common.c    |   73 +
- lib/zstd/zstd_internal.h  |  261 ++++
- lib/zstd/zstd_opt.h       | 1012 +++++++++++++
- 19 files changed, 12998 insertions(+)
- create mode 100644 include/linux/zstd.h
- create mode 100644 lib/zstd/Makefile
- create mode 100644 lib/zstd/bitstream.h
- create mode 100644 lib/zstd/compress.c
- create mode 100644 lib/zstd/decompress.c
- create mode 100644 lib/zstd/entropy_common.c
- create mode 100644 lib/zstd/error_private.h
- create mode 100644 lib/zstd/fse.h
- create mode 100644 lib/zstd/fse_compress.c
- create mode 100644 lib/zstd/fse_decompress.c
- create mode 100644 lib/zstd/huf.h
- create mode 100644 lib/zstd/huf_compress.c
- create mode 100644 lib/zstd/huf_decompress.c
- create mode 100644 lib/zstd/mem.h
- create mode 100644 lib/zstd/zstd_common.c
- create mode 100644 lib/zstd/zstd_internal.h
- create mode 100644 lib/zstd/zstd_opt.h
-
-diff --git a/include/linux/zstd.h b/include/linux/zstd.h
-new file mode 100644
-index 0000000..305efd0
---- /dev/null
-+++ b/include/linux/zstd.h
-@@ -0,0 +1,1155 @@
-+/*
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+#ifndef ZSTD_H
-+#define ZSTD_H
-+
-+/* ======   Dependency   ======*/
-+#include    /* size_t */
-+
-+
-+/*-*****************************************************************************
-+ * Introduction
-+ *
-+ * zstd, short for Zstandard, is a fast lossless compression algorithm,
-+ * targeting real-time compression scenarios at zlib-level and better
-+ * compression ratios. The zstd compression library provides in-memory
-+ * compression and decompression functions. The library supports compression
-+ * levels from 1 up to ZSTD_maxCLevel() which is 22. Levels >= 20, labeled
-+ * ultra, should be used with caution, as they require more memory.
-+ * Compression can be done in:
-+ *  - a single step, reusing a context (described as Explicit memory management)
-+ *  - unbounded multiple steps (described as Streaming compression)
-+ * The compression ratio achievable on small data can be highly improved using
-+ * compression with a dictionary in:
-+ *  - a single step (described as Simple dictionary API)
-+ *  - a single step, reusing a dictionary (described as Fast dictionary API)
-+ ******************************************************************************/
-+
-+/*======  Helper functions  ======*/
-+
-+/**
-+ * enum ZSTD_ErrorCode - zstd error codes
-+ *
-+ * Functions that return size_t can be checked for errors using ZSTD_isError()
-+ * and the ZSTD_ErrorCode can be extracted using ZSTD_getErrorCode().
-+ */
-+typedef enum {
-+	ZSTD_error_no_error,
-+	ZSTD_error_GENERIC,
-+	ZSTD_error_prefix_unknown,
-+	ZSTD_error_version_unsupported,
-+	ZSTD_error_parameter_unknown,
-+	ZSTD_error_frameParameter_unsupported,
-+	ZSTD_error_frameParameter_unsupportedBy32bits,
-+	ZSTD_error_frameParameter_windowTooLarge,
-+	ZSTD_error_compressionParameter_unsupported,
-+	ZSTD_error_init_missing,
-+	ZSTD_error_memory_allocation,
-+	ZSTD_error_stage_wrong,
-+	ZSTD_error_dstSize_tooSmall,
-+	ZSTD_error_srcSize_wrong,
-+	ZSTD_error_corruption_detected,
-+	ZSTD_error_checksum_wrong,
-+	ZSTD_error_tableLog_tooLarge,
-+	ZSTD_error_maxSymbolValue_tooLarge,
-+	ZSTD_error_maxSymbolValue_tooSmall,
-+	ZSTD_error_dictionary_corrupted,
-+	ZSTD_error_dictionary_wrong,
-+	ZSTD_error_dictionaryCreation_failed,
-+	ZSTD_error_maxCode
-+} ZSTD_ErrorCode;
-+
-+/**
-+ * ZSTD_maxCLevel() - maximum compression level available
-+ *
-+ * Return: Maximum compression level available.
-+ */
-+int ZSTD_maxCLevel(void);
-+/**
-+ * ZSTD_compressBound() - maximum compressed size in worst case scenario
-+ * @srcSize: The size of the data to compress.
-+ *
-+ * Return:   The maximum compressed size in the worst case scenario.
-+ */
-+size_t ZSTD_compressBound(size_t srcSize);
-+/**
-+ * ZSTD_isError() - tells if a size_t function result is an error code
-+ * @code:  The function result to check for error.
-+ *
-+ * Return: Non-zero iff the code is an error.
-+ */
-+static __attribute__((unused)) unsigned int ZSTD_isError(size_t code)
-+{
-+	return code > (size_t)-ZSTD_error_maxCode;
-+}
-+/**
-+ * ZSTD_getErrorCode() - translates an error function result to a ZSTD_ErrorCode
-+ * @functionResult: The result of a function for which ZSTD_isError() is true.
-+ *
-+ * Return:          The ZSTD_ErrorCode corresponding to the functionResult or 0
-+ *                  if the functionResult isn't an error.
-+ */
-+static __attribute__((unused)) ZSTD_ErrorCode ZSTD_getErrorCode(
-+	size_t functionResult)
-+{
-+	if (!ZSTD_isError(functionResult))
-+		return (ZSTD_ErrorCode)0;
-+	return (ZSTD_ErrorCode)(0 - functionResult);
-+}
-+
-+/**
-+ * enum ZSTD_strategy - zstd compression search strategy
-+ *
-+ * From faster to stronger.
-+ */
-+typedef enum {
-+	ZSTD_fast,
-+	ZSTD_dfast,
-+	ZSTD_greedy,
-+	ZSTD_lazy,
-+	ZSTD_lazy2,
-+	ZSTD_btlazy2,
-+	ZSTD_btopt,
-+	ZSTD_btopt2
-+} ZSTD_strategy;
-+
-+/**
-+ * struct ZSTD_compressionParameters - zstd compression parameters
-+ * @windowLog:    Log of the largest match distance. Larger means more
-+ *                compression, and more memory needed during decompression.
-+ * @chainLog:     Fully searched segment. Larger means more compression, slower,
-+ *                and more memory (useless for fast).
-+ * @hashLog:      Dispatch table. Larger means more compression,
-+ *                slower, and more memory.
-+ * @searchLog:    Number of searches. Larger means more compression and slower.
-+ * @searchLength: Match length searched. Larger means faster decompression,
-+ *                sometimes less compression.
-+ * @targetLength: Acceptable match size for optimal parser (only). Larger means
-+ *                more compression, and slower.
-+ * @strategy:     The zstd compression strategy.
-+ */
-+typedef struct {
-+	unsigned int windowLog;
-+	unsigned int chainLog;
-+	unsigned int hashLog;
-+	unsigned int searchLog;
-+	unsigned int searchLength;
-+	unsigned int targetLength;
-+	ZSTD_strategy strategy;
-+} ZSTD_compressionParameters;
-+
-+/**
-+ * struct ZSTD_frameParameters - zstd frame parameters
-+ * @contentSizeFlag: Controls whether content size will be present in the frame
-+ *                   header (when known).
-+ * @checksumFlag:    Controls whether a 32-bit checksum is generated at the end
-+ *                   of the frame for error detection.
-+ * @noDictIDFlag:    Controls whether dictID will be saved into the frame header
-+ *                   when using dictionary compression.
-+ *
-+ * The default value is all fields set to 0.
-+ */
-+typedef struct {
-+	unsigned int contentSizeFlag;
-+	unsigned int checksumFlag;
-+	unsigned int noDictIDFlag;
-+} ZSTD_frameParameters;
-+
-+/**
-+ * struct ZSTD_parameters - zstd parameters
-+ * @cParams: The compression parameters.
-+ * @fParams: The frame parameters.
-+ */
-+typedef struct {
-+	ZSTD_compressionParameters cParams;
-+	ZSTD_frameParameters fParams;
-+} ZSTD_parameters;
-+
-+/**
-+ * ZSTD_getCParams() - returns ZSTD_compressionParameters for selected level
-+ * @compressionLevel: The compression level from 1 to ZSTD_maxCLevel().
-+ * @estimatedSrcSize: The estimated source size to compress or 0 if unknown.
-+ * @dictSize:         The dictionary size or 0 if a dictionary isn't being used.
-+ *
-+ * Return:            The selected ZSTD_compressionParameters.
-+ */
-+ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel,
-+	unsigned long long estimatedSrcSize, size_t dictSize);
-+
-+/**
-+ * ZSTD_getParams() - returns ZSTD_parameters for selected level
-+ * @compressionLevel: The compression level from 1 to ZSTD_maxCLevel().
-+ * @estimatedSrcSize: The estimated source size to compress or 0 if unknown.
-+ * @dictSize:         The dictionary size or 0 if a dictionary isn't being used.
-+ *
-+ * The same as ZSTD_getCParams() except also selects the default frame
-+ * parameters (all zero).
-+ *
-+ * Return:            The selected ZSTD_parameters.
-+ */
-+ZSTD_parameters ZSTD_getParams(int compressionLevel,
-+	unsigned long long estimatedSrcSize, size_t dictSize);
-+
-+/*-*************************************
-+ * Explicit memory management
-+ **************************************/
-+
-+/**
-+ * ZSTD_CCtxWorkspaceBound() - amount of memory needed to initialize a ZSTD_CCtx
-+ * @cParams: The compression parameters to be used for compression.
-+ *
-+ * If multiple compression parameters might be used, the caller must call
-+ * ZSTD_CCtxWorkspaceBound() for each set of parameters and use the maximum
-+ * size.
-+ *
-+ * Return:   A lower bound on the size of the workspace that is passed to
-+ *           ZSTD_initCCtx().
-+ */
-+size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams);
-+
-+/**
-+ * struct ZSTD_CCtx - the zstd compression context
-+ *
-+ * When compressing many times it is recommended to allocate a context just once
-+ * and reuse it for each successive compression operation.
-+ */
-+typedef struct ZSTD_CCtx_s ZSTD_CCtx;
-+/**
-+ * ZSTD_initCCtx() - initialize a zstd compression context
-+ * @workspace:     The workspace to emplace the context into. It must outlive
-+ *                 the returned context.
-+ * @workspaceSize: The size of workspace. Use ZSTD_CCtxWorkspaceBound() to
-+ *                 determine how large the workspace must be.
-+ *
-+ * Return:         A compression context emplaced into workspace.
-+ */
-+ZSTD_CCtx *ZSTD_initCCtx(void *workspace, size_t workspaceSize);
-+
-+/**
-+ * ZSTD_compressCCtx() - compress src into dst
-+ * @ctx:         The context. Must have been initialized with a workspace at
-+ *               least as large as ZSTD_CCtxWorkspaceBound(params.cParams).
-+ * @dst:         The buffer to compress src into.
-+ * @dstCapacity: The size of the destination buffer. May be any size, but
-+ *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
-+ * @src:         The data to compress.
-+ * @srcSize:     The size of the data to compress.
-+ * @params:      The parameters to use for compression. See ZSTD_getParams().
-+ *
-+ * Return:       The compressed size or an error, which can be checked using
-+ *               ZSTD_isError().
-+ */
-+size_t ZSTD_compressCCtx(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize, ZSTD_parameters params);
-+
-+/**
-+ * ZSTD_DCtxWorkspaceBound() - amount of memory needed to initialize a ZSTD_DCtx
-+ *
-+ * Return: A lower bound on the size of the workspace that is passed to
-+ *         ZSTD_initDCtx().
-+ */
-+size_t ZSTD_DCtxWorkspaceBound(void);
-+
-+/**
-+ * struct ZSTD_DCtx - the zstd decompression context
-+ *
-+ * When decompressing many times it is recommended to allocate a context just
-+ * once and reuse it for each successive decompression operation.
-+ */
-+typedef struct ZSTD_DCtx_s ZSTD_DCtx;
-+/**
-+ * ZSTD_initDCtx() - initialize a zstd decompression context
-+ * @workspace:     The workspace to emplace the context into. It must outlive
-+ *                 the returned context.
-+ * @workspaceSize: The size of workspace. Use ZSTD_DCtxWorkspaceBound() to
-+ *                 determine how large the workspace must be.
-+ *
-+ * Return:         A decompression context emplaced into workspace.
-+ */
-+ZSTD_DCtx *ZSTD_initDCtx(void *workspace, size_t workspaceSize);
-+
-+/**
-+ * ZSTD_decompressDCtx() - decompress zstd compressed src into dst
-+ * @ctx:         The decompression context.
-+ * @dst:         The buffer to decompress src into.
-+ * @dstCapacity: The size of the destination buffer. Must be at least as large
-+ *               as the decompressed size. If the caller cannot upper bound the
-+ *               decompressed size, then it's better to use the streaming API.
-+ * @src:         The zstd compressed data to decompress. Multiple concatenated
-+ *               frames and skippable frames are allowed.
-+ * @srcSize:     The exact size of the data to decompress.
-+ *
-+ * Return:       The decompressed size or an error, which can be checked using
-+ *               ZSTD_isError().
-+ */
-+size_t ZSTD_decompressDCtx(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize);
-+
-+/*-************************
-+ * Simple dictionary API
-+ **************************/
-+
-+/**
-+ * ZSTD_compress_usingDict() - compress src into dst using a dictionary
-+ * @ctx:         The context. Must have been initialized with a workspace at
-+ *               least as large as ZSTD_CCtxWorkspaceBound(params.cParams).
-+ * @dst:         The buffer to compress src into.
-+ * @dstCapacity: The size of the destination buffer. May be any size, but
-+ *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
-+ * @src:         The data to compress.
-+ * @srcSize:     The size of the data to compress.
-+ * @dict:        The dictionary to use for compression.
-+ * @dictSize:    The size of the dictionary.
-+ * @params:      The parameters to use for compression. See ZSTD_getParams().
-+ *
-+ * Compression using a predefined dictionary. The same dictionary must be used
-+ * during decompression.
-+ *
-+ * Return:       The compressed size or an error, which can be checked using
-+ *               ZSTD_isError().
-+ */
-+size_t ZSTD_compress_usingDict(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize, const void *dict, size_t dictSize,
-+	ZSTD_parameters params);
-+
-+/**
-+ * ZSTD_decompress_usingDict() - decompress src into dst using a dictionary
-+ * @ctx:         The decompression context.
-+ * @dst:         The buffer to decompress src into.
-+ * @dstCapacity: The size of the destination buffer. Must be at least as large
-+ *               as the decompressed size. If the caller cannot upper bound the
-+ *               decompressed size, then it's better to use the streaming API.
-+ * @src:         The zstd compressed data to decompress. Multiple concatenated
-+ *               frames and skippable frames are allowed.
-+ * @srcSize:     The exact size of the data to decompress.
-+ * @dict:        The dictionary to use for decompression. The same dictionary
-+ *               must've been used to compress the data.
-+ * @dictSize:    The size of the dictionary.
-+ *
-+ * Return:       The decompressed size or an error, which can be checked using
-+ *               ZSTD_isError().
-+ */
-+size_t ZSTD_decompress_usingDict(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize, const void *dict, size_t dictSize);
-+
-+/*-**************************
-+ * Fast dictionary API
-+ ***************************/
-+
-+/**
-+ * ZSTD_CDictWorkspaceBound() - memory needed to initialize a ZSTD_CDict
-+ * @cParams: The compression parameters to be used for compression.
-+ *
-+ * Return:   A lower bound on the size of the workspace that is passed to
-+ *           ZSTD_initCDict().
-+ */
-+size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams);
-+
-+/**
-+ * struct ZSTD_CDict - a digested dictionary to be used for compression
-+ */
-+typedef struct ZSTD_CDict_s ZSTD_CDict;
-+
-+/**
-+ * ZSTD_initCDict() - initialize a digested dictionary for compression
-+ * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
-+ *                 ZSTD_CDict so it must outlive the returned ZSTD_CDict.
-+ * @dictSize:      The size of the dictionary.
-+ * @params:        The parameters to use for compression. See ZSTD_getParams().
-+ * @workspace:     The workspace. It must outlive the returned ZSTD_CDict.
-+ * @workspaceSize: The workspace size. Must be at least
-+ *                 ZSTD_CDictWorkspaceBound(params.cParams).
-+ *
-+ * When compressing multiple messages / blocks with the same dictionary it is
-+ * recommended to load it just once. The ZSTD_CDict merely references the
-+ * dictBuffer, so it must outlive the returned ZSTD_CDict.
-+ *
-+ * Return:         The digested dictionary emplaced into workspace.
-+ */
-+ZSTD_CDict *ZSTD_initCDict(const void *dictBuffer, size_t dictSize,
-+	ZSTD_parameters params, void *workspace, size_t workspaceSize);
-+
-+/**
-+ * ZSTD_compress_usingCDict() - compress src into dst using a ZSTD_CDict
-+ * @ctx:         The context. Must have been initialized with a workspace at
-+ *               least as large as ZSTD_CCtxWorkspaceBound(cParams) where
-+ *               cParams are the compression parameters used to initialize the
-+ *               cdict.
-+ * @dst:         The buffer to compress src into.
-+ * @dstCapacity: The size of the destination buffer. May be any size, but
-+ *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
-+ * @src:         The data to compress.
-+ * @srcSize:     The size of the data to compress.
-+ * @cdict:       The digested dictionary to use for compression.
-+ * @params:      The parameters to use for compression. See ZSTD_getParams().
-+ *
-+ * Compression using a digested dictionary. The same dictionary must be used
-+ * during decompression.
-+ *
-+ * Return:       The compressed size or an error, which can be checked using
-+ *               ZSTD_isError().
-+ */
-+size_t ZSTD_compress_usingCDict(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize, const ZSTD_CDict *cdict);
-+
-+
-+/**
-+ * ZSTD_DDictWorkspaceBound() - memory needed to initialize a ZSTD_DDict
-+ *
-+ * Return:  A lower bound on the size of the workspace that is passed to
-+ *          ZSTD_initDDict().
-+ */
-+size_t ZSTD_DDictWorkspaceBound(void);
-+
-+/**
-+ * struct ZSTD_DDict - a digested dictionary to be used for decompression
-+ */
-+typedef struct ZSTD_DDict_s ZSTD_DDict;
-+
-+/**
-+ * ZSTD_initDDict() - initialize a digested dictionary for decompression
-+ * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
-+ *                 ZSTD_DDict so it must outlive the returned ZSTD_DDict.
-+ * @dictSize:      The size of the dictionary.
-+ * @workspace:     The workspace. It must outlive the returned ZSTD_DDict.
-+ * @workspaceSize: The workspace size. Must be at least
-+ *                 ZSTD_DDictWorkspaceBound().
-+ *
-+ * When decompressing multiple messages / blocks with the same dictionary it is
-+ * recommended to load it just once. The ZSTD_DDict merely references the
-+ * dictBuffer, so it must outlive the returned ZSTD_DDict.
-+ *
-+ * Return:         The digested dictionary emplaced into workspace.
-+ */
-+ZSTD_DDict *ZSTD_initDDict(const void *dictBuffer, size_t dictSize,
-+	void *workspace, size_t workspaceSize);
-+
-+/**
-+ * ZSTD_decompress_usingDDict() - decompress src into dst using a ZSTD_DDict
-+ * @ctx:         The decompression context.
-+ * @dst:         The buffer to decompress src into.
-+ * @dstCapacity: The size of the destination buffer. Must be at least as large
-+ *               as the decompressed size. If the caller cannot upper bound the
-+ *               decompressed size, then it's better to use the streaming API.
-+ * @src:         The zstd compressed data to decompress. Multiple concatenated
-+ *               frames and skippable frames are allowed.
-+ * @srcSize:     The exact size of the data to decompress.
-+ * @ddict:       The digested dictionary to use for decompression. The same
-+ *               dictionary must've been used to compress the data.
-+ *
-+ * Return:       The decompressed size or an error, which can be checked using
-+ *               ZSTD_isError().
-+ */
-+size_t ZSTD_decompress_usingDDict(ZSTD_DCtx *dctx, void *dst,
-+	size_t dstCapacity, const void *src, size_t srcSize,
-+	const ZSTD_DDict *ddict);
-+
-+
-+/*-**************************
-+ * Streaming
-+ ***************************/
-+
-+/**
-+ * struct ZSTD_inBuffer - input buffer for streaming
-+ * @src:  Start of the input buffer.
-+ * @size: Size of the input buffer.
-+ * @pos:  Position where reading stopped. Will be updated.
-+ *        Necessarily 0 <= pos <= size.
-+ */
-+typedef struct ZSTD_inBuffer_s {
-+	const void *src;
-+	size_t size;
-+	size_t pos;
-+} ZSTD_inBuffer;
-+
-+/**
-+ * struct ZSTD_outBuffer - output buffer for streaming
-+ * @dst:  Start of the output buffer.
-+ * @size: Size of the output buffer.
-+ * @pos:  Position where writing stopped. Will be updated.
-+ *        Necessarily 0 <= pos <= size.
-+ */
-+typedef struct ZSTD_outBuffer_s {
-+	void *dst;
-+	size_t size;
-+	size_t pos;
-+} ZSTD_outBuffer;
-+
-+
-+
-+/*-*****************************************************************************
-+ * Streaming compression - HowTo
-+ *
-+ * A ZSTD_CStream object is required to track streaming operation.
-+ * Use ZSTD_initCStream() to initialize a ZSTD_CStream object.
-+ * ZSTD_CStream objects can be reused multiple times on consecutive compression
-+ * operations. It is recommended to re-use ZSTD_CStream in situations where many
-+ * streaming operations will be achieved consecutively. Use one separate
-+ * ZSTD_CStream per thread for parallel execution.
-+ *
-+ * Use ZSTD_compressStream() repetitively to consume input stream.
-+ * The function will automatically update both `pos` fields.
-+ * Note that it may not consume the entire input, in which case `pos < size`,
-+ * and it's up to the caller to present again remaining data.
-+ * It returns a hint for the preferred number of bytes to use as an input for
-+ * the next function call.
-+ *
-+ * At any moment, it's possible to flush whatever data remains within internal
-+ * buffer, using ZSTD_flushStream(). `output->pos` will be updated. There might
-+ * still be some content left within the internal buffer if `output->size` is
-+ * too small. It returns the number of bytes left in the internal buffer and
-+ * must be called until it returns 0.
-+ *
-+ * ZSTD_endStream() instructs to finish a frame. It will perform a flush and
-+ * write frame epilogue. The epilogue is required for decoders to consider a
-+ * frame completed. Similar to ZSTD_flushStream(), it may not be able to flush
-+ * the full content if `output->size` is too small. In which case, call again
-+ * ZSTD_endStream() to complete the flush. It returns the number of bytes left
-+ * in the internal buffer and must be called until it returns 0.
-+ ******************************************************************************/
-+
-+/**
-+ * ZSTD_CStreamWorkspaceBound() - memory needed to initialize a ZSTD_CStream
-+ * @cParams: The compression parameters to be used for compression.
-+ *
-+ * Return:   A lower bound on the size of the workspace that is passed to
-+ *           ZSTD_initCStream() and ZSTD_initCStream_usingCDict().
-+ */
-+size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams);
-+
-+/**
-+ * struct ZSTD_CStream - the zstd streaming compression context
-+ */
-+typedef struct ZSTD_CStream_s ZSTD_CStream;
-+
-+/*===== ZSTD_CStream management functions =====*/
-+/**
-+ * ZSTD_initCStream() - initialize a zstd streaming compression context
-+ * @params:         The zstd compression parameters.
-+ * @pledgedSrcSize: If params.fParams.contentSizeFlag == 1 then the caller must
-+ *                  pass the source size (zero means empty source). Otherwise,
-+ *                  the caller may optionally pass the source size, or zero if
-+ *                  unknown.
-+ * @workspace:      The workspace to emplace the context into. It must outlive
-+ *                  the returned context.
-+ * @workspaceSize:  The size of workspace.
-+ *                  Use ZSTD_CStreamWorkspaceBound(params.cParams) to determine
-+ *                  how large the workspace must be.
-+ *
-+ * Return:          The zstd streaming compression context.
-+ */
-+ZSTD_CStream *ZSTD_initCStream(ZSTD_parameters params,
-+	unsigned long long pledgedSrcSize, void *workspace,
-+	size_t workspaceSize);
-+
-+/**
-+ * ZSTD_initCStream_usingCDict() - initialize a streaming compression context
-+ * @cdict:          The digested dictionary to use for compression.
-+ * @pledgedSrcSize: Optionally the source size, or zero if unknown.
-+ * @workspace:      The workspace to emplace the context into. It must outlive
-+ *                  the returned context.
-+ * @workspaceSize:  The size of workspace. Call ZSTD_CStreamWorkspaceBound()
-+ *                  with the cParams used to initialize the cdict to determine
-+ *                  how large the workspace must be.
-+ *
-+ * Return:          The zstd streaming compression context.
-+ */
-+ZSTD_CStream *ZSTD_initCStream_usingCDict(const ZSTD_CDict *cdict,
-+	unsigned long long pledgedSrcSize, void *workspace,
-+	size_t workspaceSize);
-+
-+/*===== Streaming compression functions =====*/
-+/**
-+ * ZSTD_resetCStream() - reset the context using parameters from creation
-+ * @zcs:            The zstd streaming compression context to reset.
-+ * @pledgedSrcSize: Optionally the source size, or zero if unknown.
-+ *
-+ * Resets the context using the parameters from creation. Skips dictionary
-+ * loading, since it can be reused. If `pledgedSrcSize` is non-zero the frame
-+ * content size is always written into the frame header.
-+ *
-+ * Return:          Zero or an error, which can be checked using ZSTD_isError().
-+ */
-+size_t ZSTD_resetCStream(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize);
-+/**
-+ * ZSTD_compressStream() - streaming compress some of input into output
-+ * @zcs:    The zstd streaming compression context.
-+ * @output: Destination buffer. `output->pos` is updated to indicate how much
-+ *          compressed data was written.
-+ * @input:  Source buffer. `input->pos` is updated to indicate how much data was
-+ *          read. Note that it may not consume the entire input, in which case
-+ *          `input->pos < input->size`, and it's up to the caller to present
-+ *          remaining data again.
-+ *
-+ * The `input` and `output` buffers may be any size. Guaranteed to make some
-+ * forward progress if `input` and `output` are not empty.
-+ *
-+ * Return:  A hint for the number of bytes to use as the input for the next
-+ *          function call or an error, which can be checked using
-+ *          ZSTD_isError().
-+ */
-+size_t ZSTD_compressStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output,
-+	ZSTD_inBuffer *input);
-+/**
-+ * ZSTD_flushStream() - flush internal buffers into output
-+ * @zcs:    The zstd streaming compression context.
-+ * @output: Destination buffer. `output->pos` is updated to indicate how much
-+ *          compressed data was written.
-+ *
-+ * ZSTD_flushStream() must be called until it returns 0, meaning all the data
-+ * has been flushed. Since ZSTD_flushStream() causes a block to be ended,
-+ * calling it too often will degrade the compression ratio.
-+ *
-+ * Return:  The number of bytes still present within internal buffers or an
-+ *          error, which can be checked using ZSTD_isError().
-+ */
-+size_t ZSTD_flushStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output);
-+/**
-+ * ZSTD_endStream() - flush internal buffers into output and end the frame
-+ * @zcs:    The zstd streaming compression context.
-+ * @output: Destination buffer. `output->pos` is updated to indicate how much
-+ *          compressed data was written.
-+ *
-+ * ZSTD_endStream() must be called until it returns 0, meaning all the data has
-+ * been flushed and the frame epilogue has been written.
-+ *
-+ * Return:  The number of bytes still present within internal buffers or an
-+ *          error, which can be checked using ZSTD_isError().
-+ */
-+size_t ZSTD_endStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output);
-+
-+/**
-+ * ZSTD_CStreamInSize() - recommended size for the input buffer
-+ *
-+ * Return: The recommended size for the input buffer.
-+ */
-+size_t ZSTD_CStreamInSize(void);
-+/**
-+ * ZSTD_CStreamOutSize() - recommended size for the output buffer
-+ *
-+ * When the output buffer is at least this large, it is guaranteed to be large
-+ * enough to flush at least one complete compressed block.
-+ *
-+ * Return: The recommended size for the output buffer.
-+ */
-+size_t ZSTD_CStreamOutSize(void);
-+
-+
-+
-+/*-*****************************************************************************
-+ * Streaming decompression - HowTo
-+ *
-+ * A ZSTD_DStream object is required to track streaming operations.
-+ * Use ZSTD_initDStream() to initialize a ZSTD_DStream object.
-+ * ZSTD_DStream objects can be re-used multiple times.
-+ *
-+ * Use ZSTD_decompressStream() repetitively to consume your input.
-+ * The function will update both `pos` fields.
-+ * If `input->pos < input->size`, some input has not been consumed.
-+ * It's up to the caller to present again remaining data.
-+ * If `output->pos < output->size`, decoder has flushed everything it could.
-+ * Returns 0 iff a frame is completely decoded and fully flushed.
-+ * Otherwise it returns a suggested next input size that will never load more
-+ * than the current frame.
-+ ******************************************************************************/
-+
-+/**
-+ * ZSTD_DStreamWorkspaceBound() - memory needed to initialize a ZSTD_DStream
-+ * @maxWindowSize: The maximum window size allowed for compressed frames.
-+ *
-+ * Return:         A lower bound on the size of the workspace that is passed to
-+ *                 ZSTD_initDStream() and ZSTD_initDStream_usingDDict().
-+ */
-+size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
-+
-+/**
-+ * struct ZSTD_DStream - the zstd streaming decompression context
-+ */
-+typedef struct ZSTD_DStream_s ZSTD_DStream;
-+/*===== ZSTD_DStream management functions =====*/
-+/**
-+ * ZSTD_initDStream() - initialize a zstd streaming decompression context
-+ * @maxWindowSize: The maximum window size allowed for compressed frames.
-+ * @workspace:     The workspace to emplace the context into. It must outlive
-+ *                 the returned context.
-+ * @workspaceSize: The size of workspace.
-+ *                 Use ZSTD_DStreamWorkspaceBound(maxWindowSize) to determine
-+ *                 how large the workspace must be.
-+ *
-+ * Return:         The zstd streaming decompression context.
-+ */
-+ZSTD_DStream *ZSTD_initDStream(size_t maxWindowSize, void *workspace,
-+	size_t workspaceSize);
-+/**
-+ * ZSTD_initDStream_usingDDict() - initialize streaming decompression context
-+ * @maxWindowSize: The maximum window size allowed for compressed frames.
-+ * @ddict:         The digested dictionary to use for decompression.
-+ * @workspace:     The workspace to emplace the context into. It must outlive
-+ *                 the returned context.
-+ * @workspaceSize: The size of workspace.
-+ *                 Use ZSTD_DStreamWorkspaceBound(maxWindowSize) to determine
-+ *                 how large the workspace must be.
-+ *
-+ * Return:         The zstd streaming decompression context.
-+ */
-+ZSTD_DStream *ZSTD_initDStream_usingDDict(size_t maxWindowSize,
-+	const ZSTD_DDict *ddict, void *workspace, size_t workspaceSize);
-+
-+/*===== Streaming decompression functions =====*/
-+/**
-+ * ZSTD_resetDStream() - reset the context using parameters from creation
-+ * @zds:   The zstd streaming decompression context to reset.
-+ *
-+ * Resets the context using the parameters from creation. Skips dictionary
-+ * loading, since it can be reused.
-+ *
-+ * Return: Zero or an error, which can be checked using ZSTD_isError().
-+ */
-+size_t ZSTD_resetDStream(ZSTD_DStream *zds);
-+/**
-+ * ZSTD_decompressStream() - streaming decompress some of input into output
-+ * @zds:    The zstd streaming decompression context.
-+ * @output: Destination buffer. `output.pos` is updated to indicate how much
-+ *          decompressed data was written.
-+ * @input:  Source buffer. `input.pos` is updated to indicate how much data was
-+ *          read. Note that it may not consume the entire input, in which case
-+ *          `input.pos < input.size`, and it's up to the caller to present
-+ *          remaining data again.
-+ *
-+ * The `input` and `output` buffers may be any size. Guaranteed to make some
-+ * forward progress if `input` and `output` are not empty.
-+ * ZSTD_decompressStream() will not consume the last byte of the frame until
-+ * the entire frame is flushed.
-+ *
-+ * Return:  Returns 0 iff a frame is completely decoded and fully flushed.
-+ *          Otherwise returns a hint for the number of bytes to use as the input
-+ *          for the next function call or an error, which can be checked using
-+ *          ZSTD_isError(). The size hint will never load more than the frame.
-+ */
-+size_t ZSTD_decompressStream(ZSTD_DStream *zds, ZSTD_outBuffer *output,
-+	ZSTD_inBuffer *input);
-+
-+/**
-+ * ZSTD_DStreamInSize() - recommended size for the input buffer
-+ *
-+ * Return: The recommended size for the input buffer.
-+ */
-+size_t ZSTD_DStreamInSize(void);
-+/**
-+ * ZSTD_DStreamOutSize() - recommended size for the output buffer
-+ *
-+ * When the output buffer is at least this large, it is guaranteed to be large
-+ * enough to flush at least one complete decompressed block.
-+ *
-+ * Return: The recommended size for the output buffer.
-+ */
-+size_t ZSTD_DStreamOutSize(void);
-+
-+
-+/* --- Constants ---*/
-+#define ZSTD_MAGICNUMBER            0xFD2FB528   /* >= v0.8.0 */
-+#define ZSTD_MAGIC_SKIPPABLE_START  0x184D2A50U
-+
-+#define ZSTD_CONTENTSIZE_UNKNOWN (0ULL - 1)
-+#define ZSTD_CONTENTSIZE_ERROR   (0ULL - 2)
-+
-+#define ZSTD_WINDOWLOG_MAX_32  27
-+#define ZSTD_WINDOWLOG_MAX_64  27
-+#define ZSTD_WINDOWLOG_MAX \
-+	((unsigned int)(sizeof(size_t) == 4 \
-+		? ZSTD_WINDOWLOG_MAX_32 \
-+		: ZSTD_WINDOWLOG_MAX_64))
-+#define ZSTD_WINDOWLOG_MIN 10
-+#define ZSTD_HASHLOG_MAX ZSTD_WINDOWLOG_MAX
-+#define ZSTD_HASHLOG_MIN        6
-+#define ZSTD_CHAINLOG_MAX     (ZSTD_WINDOWLOG_MAX+1)
-+#define ZSTD_CHAINLOG_MIN      ZSTD_HASHLOG_MIN
-+#define ZSTD_HASHLOG3_MAX      17
-+#define ZSTD_SEARCHLOG_MAX    (ZSTD_WINDOWLOG_MAX-1)
-+#define ZSTD_SEARCHLOG_MIN      1
-+/* only for ZSTD_fast, other strategies are limited to 6 */
-+#define ZSTD_SEARCHLENGTH_MAX   7
-+/* only for ZSTD_btopt, other strategies are limited to 4 */
-+#define ZSTD_SEARCHLENGTH_MIN   3
-+#define ZSTD_TARGETLENGTH_MIN   4
-+#define ZSTD_TARGETLENGTH_MAX 999
-+
-+/* for static allocation */
-+#define ZSTD_FRAMEHEADERSIZE_MAX 18
-+#define ZSTD_FRAMEHEADERSIZE_MIN  6
-+static const size_t ZSTD_frameHeaderSize_prefix = 5;
-+static const size_t ZSTD_frameHeaderSize_min = ZSTD_FRAMEHEADERSIZE_MIN;
-+static const size_t ZSTD_frameHeaderSize_max = ZSTD_FRAMEHEADERSIZE_MAX;
-+/* magic number + skippable frame length */
-+static const size_t ZSTD_skippableHeaderSize = 8;
-+
-+
-+/*-*************************************
-+ * Compressed size functions
-+ **************************************/
-+
-+/**
-+ * ZSTD_findFrameCompressedSize() - returns the size of a compressed frame
-+ * @src:     Source buffer. It should point to the start of a zstd encoded frame
-+ *           or a skippable frame.
-+ * @srcSize: The size of the source buffer. It must be at least as large as the
-+ *           size of the frame.
-+ *
-+ * Return:   The compressed size of the frame pointed to by `src` or an error,
-+ *           which can be check with ZSTD_isError().
-+ *           Suitable to pass to ZSTD_decompress() or similar functions.
-+ */
-+size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize);
-+
-+/*-*************************************
-+ * Decompressed size functions
-+ **************************************/
-+/**
-+ * ZSTD_getFrameContentSize() - returns the content size in a zstd frame header
-+ * @src:     It should point to the start of a zstd encoded frame.
-+ * @srcSize: The size of the source buffer. It must be at least as large as the
-+ *           frame header. `ZSTD_frameHeaderSize_max` is always large enough.
-+ *
-+ * Return:   The frame content size stored in the frame header if known.
-+ *           `ZSTD_CONTENTSIZE_UNKNOWN` if the content size isn't stored in the
-+ *           frame header. `ZSTD_CONTENTSIZE_ERROR` on invalid input.
-+ */
-+unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
-+
-+/**
-+ * ZSTD_findDecompressedSize() - returns decompressed size of a series of frames
-+ * @src:     It should point to the start of a series of zstd encoded and/or
-+ *           skippable frames.
-+ * @srcSize: The exact size of the series of frames.
-+ *
-+ * If any zstd encoded frame in the series doesn't have the frame content size
-+ * set, `ZSTD_CONTENTSIZE_UNKNOWN` is returned. But frame content size is always
-+ * set when using ZSTD_compress(). The decompressed size can be very large.
-+ * If the source is untrusted, the decompressed size could be wrong or
-+ * intentionally modified. Always ensure the result fits within the
-+ * application's authorized limits. ZSTD_findDecompressedSize() handles multiple
-+ * frames, and so it must traverse the input to read each frame header. This is
-+ * efficient as most of the data is skipped, however it does mean that all frame
-+ * data must be present and valid.
-+ *
-+ * Return:   Decompressed size of all the data contained in the frames if known.
-+ *           `ZSTD_CONTENTSIZE_UNKNOWN` if the decompressed size is unknown.
-+ *           `ZSTD_CONTENTSIZE_ERROR` if an error occurred.
-+ */
-+unsigned long long ZSTD_findDecompressedSize(const void *src, size_t srcSize);
-+
-+/*-*************************************
-+ * Advanced compression functions
-+ **************************************/
-+/**
-+ * ZSTD_checkCParams() - ensure parameter values remain within authorized range
-+ * @cParams: The zstd compression parameters.
-+ *
-+ * Return:   Zero or an error, which can be checked using ZSTD_isError().
-+ */
-+size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams);
-+
-+/**
-+ * ZSTD_adjustCParams() - optimize parameters for a given srcSize and dictSize
-+ * @srcSize:  Optionally the estimated source size, or zero if unknown.
-+ * @dictSize: Optionally the estimated dictionary size, or zero if unknown.
-+ *
-+ * Return:    The optimized parameters.
-+ */
-+ZSTD_compressionParameters ZSTD_adjustCParams(
-+	ZSTD_compressionParameters cParams, unsigned long long srcSize,
-+	size_t dictSize);
-+
-+/*--- Advanced decompression functions ---*/
-+
-+/**
-+ * ZSTD_isFrame() - returns true iff the buffer starts with a valid frame
-+ * @buffer: The source buffer to check.
-+ * @size:   The size of the source buffer, must be at least 4 bytes.
-+ *
-+ * Return: True iff the buffer starts with a zstd or skippable frame identifier.
-+ */
-+unsigned int ZSTD_isFrame(const void *buffer, size_t size);
-+
-+/**
-+ * ZSTD_getDictID_fromDict() - returns the dictionary id stored in a dictionary
-+ * @dict:     The dictionary buffer.
-+ * @dictSize: The size of the dictionary buffer.
-+ *
-+ * Return:    The dictionary id stored within the dictionary or 0 if the
-+ *            dictionary is not a zstd dictionary. If it returns 0 the
-+ *            dictionary can still be loaded as a content-only dictionary.
-+ */
-+unsigned int ZSTD_getDictID_fromDict(const void *dict, size_t dictSize);
-+
-+/**
-+ * ZSTD_getDictID_fromDDict() - returns the dictionary id stored in a ZSTD_DDict
-+ * @ddict: The ddict to find the id of.
-+ *
-+ * Return: The dictionary id stored within `ddict` or 0 if the dictionary is not
-+ *         a zstd dictionary. If it returns 0 `ddict` will be loaded as a
-+ *         content-only dictionary.
-+ */
-+unsigned int ZSTD_getDictID_fromDDict(const ZSTD_DDict *ddict);
-+
-+/**
-+ * ZSTD_getDictID_fromFrame() - returns the dictionary id stored in a zstd frame
-+ * @src:     Source buffer. It must be a zstd encoded frame.
-+ * @srcSize: The size of the source buffer. It must be at least as large as the
-+ *           frame header. `ZSTD_frameHeaderSize_max` is always large enough.
-+ *
-+ * Return:   The dictionary id required to decompress the frame stored within
-+ *           `src` or 0 if the dictionary id could not be decoded. It can return
-+ *           0 if the frame does not require a dictionary, the dictionary id
-+ *           wasn't stored in the frame, `src` is not a zstd frame, or `srcSize`
-+ *           is too small.
-+ */
-+unsigned int ZSTD_getDictID_fromFrame(const void *src, size_t srcSize);
-+
-+/**
-+ * struct ZSTD_frameParams - zstd frame parameters stored in the frame header
-+ * @frameContentSize: The frame content size, or 0 if not present.
-+ * @windowSize:       The window size, or 0 if the frame is a skippable frame.
-+ * @dictID:           The dictionary id, or 0 if not present.
-+ * @checksumFlag:     Whether a checksum was used.
-+ */
-+typedef struct {
-+	unsigned long long frameContentSize;
-+	unsigned int windowSize;
-+	unsigned int dictID;
-+	unsigned int checksumFlag;
-+} ZSTD_frameParams;
-+
-+/**
-+ * ZSTD_getFrameParams() - extracts parameters from a zstd or skippable frame
-+ * @fparamsPtr: On success the frame parameters are written here.
-+ * @src:        The source buffer. It must point to a zstd or skippable frame.
-+ * @srcSize:    The size of the source buffer. `ZSTD_frameHeaderSize_max` is
-+ *              always large enough to succeed.
-+ *
-+ * Return:      0 on success. If more data is required it returns how many bytes
-+ *              must be provided to make forward progress. Otherwise it returns
-+ *              an error, which can be checked using ZSTD_isError().
-+ */
-+size_t ZSTD_getFrameParams(ZSTD_frameParams *fparamsPtr, const void *src,
-+	size_t srcSize);
-+
-+/*-*****************************************************************************
-+ * Buffer-less and synchronous inner streaming functions
-+ *
-+ * This is an advanced API, giving full control over buffer management, for
-+ * users which need direct control over memory.
-+ * But it's also a complex one, with many restrictions (documented below).
-+ * Prefer using normal streaming API for an easier experience
-+ ******************************************************************************/
-+
-+/*-*****************************************************************************
-+ * Buffer-less streaming compression (synchronous mode)
-+ *
-+ * A ZSTD_CCtx object is required to track streaming operations.
-+ * Use ZSTD_initCCtx() to initialize a context.
-+ * ZSTD_CCtx object can be re-used multiple times within successive compression
-+ * operations.
-+ *
-+ * Start by initializing a context.
-+ * Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary
-+ * compression,
-+ * or ZSTD_compressBegin_advanced(), for finer parameter control.
-+ * It's also possible to duplicate a reference context which has already been
-+ * initialized, using ZSTD_copyCCtx()
-+ *
-+ * Then, consume your input using ZSTD_compressContinue().
-+ * There are some important considerations to keep in mind when using this
-+ * advanced function :
-+ * - ZSTD_compressContinue() has no internal buffer. It uses externally provided
-+ *   buffer only.
-+ * - Interface is synchronous : input is consumed entirely and produce 1+
-+ *   (or more) compressed blocks.
-+ * - Caller must ensure there is enough space in `dst` to store compressed data
-+ *   under worst case scenario. Worst case evaluation is provided by
-+ *   ZSTD_compressBound().
-+ *   ZSTD_compressContinue() doesn't guarantee recover after a failed
-+ *   compression.
-+ * - ZSTD_compressContinue() presumes prior input ***is still accessible and
-+ *   unmodified*** (up to maximum distance size, see WindowLog).
-+ *   It remembers all previous contiguous blocks, plus one separated memory
-+ *   segment (which can itself consists of multiple contiguous blocks)
-+ * - ZSTD_compressContinue() detects that prior input has been overwritten when
-+ *   `src` buffer overlaps. In which case, it will "discard" the relevant memory
-+ *   section from its history.
-+ *
-+ * Finish a frame with ZSTD_compressEnd(), which will write the last block(s)
-+ * and optional checksum. It's possible to use srcSize==0, in which case, it
-+ * will write a final empty block to end the frame. Without last block mark,
-+ * frames will be considered unfinished (corrupted) by decoders.
-+ *
-+ * `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress some new
-+ * frame.
-+ ******************************************************************************/
-+
-+/*=====   Buffer-less streaming compression functions  =====*/
-+size_t ZSTD_compressBegin(ZSTD_CCtx *cctx, int compressionLevel);
-+size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx *cctx, const void *dict,
-+	size_t dictSize, int compressionLevel);
-+size_t ZSTD_compressBegin_advanced(ZSTD_CCtx *cctx, const void *dict,
-+	size_t dictSize, ZSTD_parameters params,
-+	unsigned long long pledgedSrcSize);
-+size_t ZSTD_copyCCtx(ZSTD_CCtx *cctx, const ZSTD_CCtx *preparedCCtx,
-+	unsigned long long pledgedSrcSize);
-+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx *cctx, const ZSTD_CDict *cdict,
-+	unsigned long long pledgedSrcSize);
-+size_t ZSTD_compressContinue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize);
-+size_t ZSTD_compressEnd(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize);
-+
-+
-+
-+/*-*****************************************************************************
-+ * Buffer-less streaming decompression (synchronous mode)
-+ *
-+ * A ZSTD_DCtx object is required to track streaming operations.
-+ * Use ZSTD_initDCtx() to initialize a context.
-+ * A ZSTD_DCtx object can be re-used multiple times.
-+ *
-+ * First typical operation is to retrieve frame parameters, using
-+ * ZSTD_getFrameParams(). It fills a ZSTD_frameParams structure which provide
-+ * important information to correctly decode the frame, such as the minimum
-+ * rolling buffer size to allocate to decompress data (`windowSize`), and the
-+ * dictionary ID used.
-+ * Note: content size is optional, it may not be present. 0 means unknown.
-+ * Note that these values could be wrong, either because of data malformation,
-+ * or because an attacker is spoofing deliberate false information. As a
-+ * consequence, check that values remain within valid application range,
-+ * especially `windowSize`, before allocation. Each application can set its own
-+ * limit, depending on local restrictions. For extended interoperability, it is
-+ * recommended to support at least 8 MB.
-+ * Frame parameters are extracted from the beginning of the compressed frame.
-+ * Data fragment must be large enough to ensure successful decoding, typically
-+ * `ZSTD_frameHeaderSize_max` bytes.
-+ * Result: 0: successful decoding, the `ZSTD_frameParams` structure is filled.
-+ *        >0: `srcSize` is too small, provide at least this many bytes.
-+ *        errorCode, which can be tested using ZSTD_isError().
-+ *
-+ * Start decompression, with ZSTD_decompressBegin() or
-+ * ZSTD_decompressBegin_usingDict(). Alternatively, you can copy a prepared
-+ * context, using ZSTD_copyDCtx().
-+ *
-+ * Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue()
-+ * alternatively.
-+ * ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize'
-+ * to ZSTD_decompressContinue().
-+ * ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will
-+ * fail.
-+ *
-+ * The result of ZSTD_decompressContinue() is the number of bytes regenerated
-+ * within 'dst' (necessarily <= dstCapacity). It can be zero, which is not an
-+ * error; it just means ZSTD_decompressContinue() has decoded some metadata
-+ * item. It can also be an error code, which can be tested with ZSTD_isError().
-+ *
-+ * ZSTD_decompressContinue() needs previous data blocks during decompression, up
-+ * to `windowSize`. They should preferably be located contiguously, prior to
-+ * current block. Alternatively, a round buffer of sufficient size is also
-+ * possible. Sufficient size is determined by frame parameters.
-+ * ZSTD_decompressContinue() is very sensitive to contiguity, if 2 blocks don't
-+ * follow each other, make sure that either the compressor breaks contiguity at
-+ * the same place, or that previous contiguous segment is large enough to
-+ * properly handle maximum back-reference.
-+ *
-+ * A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
-+ * Context can then be reset to start a new decompression.
-+ *
-+ * Note: it's possible to know if next input to present is a header or a block,
-+ * using ZSTD_nextInputType(). This information is not required to properly
-+ * decode a frame.
-+ *
-+ * == Special case: skippable frames ==
-+ *
-+ * Skippable frames allow integration of user-defined data into a flow of
-+ * concatenated frames. Skippable frames will be ignored (skipped) by a
-+ * decompressor. The format of skippable frames is as follows:
-+ * a) Skippable frame ID - 4 Bytes, Little endian format, any value from
-+ *    0x184D2A50 to 0x184D2A5F
-+ * b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
-+ * c) Frame Content - any content (User Data) of length equal to Frame Size
-+ * For skippable frames ZSTD_decompressContinue() always returns 0.
-+ * For skippable frames ZSTD_getFrameParams() returns fparamsPtr->windowLog==0
-+ * what means that a frame is skippable.
-+ * Note: If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might
-+ *       actually be a zstd encoded frame with no content. For purposes of
-+ *       decompression, it is valid in both cases to skip the frame using
-+ *       ZSTD_findFrameCompressedSize() to find its size in bytes.
-+ * It also returns frame size as fparamsPtr->frameContentSize.
-+ ******************************************************************************/
-+
-+/*=====   Buffer-less streaming decompression functions  =====*/
-+size_t ZSTD_decompressBegin(ZSTD_DCtx *dctx);
-+size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx *dctx, const void *dict,
-+	size_t dictSize);
-+void   ZSTD_copyDCtx(ZSTD_DCtx *dctx, const ZSTD_DCtx *preparedDCtx);
-+size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx *dctx);
-+size_t ZSTD_decompressContinue(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize);
-+typedef enum {
-+	ZSTDnit_frameHeader,
-+	ZSTDnit_blockHeader,
-+	ZSTDnit_block,
-+	ZSTDnit_lastBlock,
-+	ZSTDnit_checksum,
-+	ZSTDnit_skippableFrame
-+} ZSTD_nextInputType_e;
-+ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx *dctx);
-+
-+/*-*****************************************************************************
-+ * Block functions
-+ *
-+ * Block functions produce and decode raw zstd blocks, without frame metadata.
-+ * Frame metadata cost is typically ~18 bytes, which can be non-negligible for
-+ * very small blocks (< 100 bytes). User will have to take in charge required
-+ * information to regenerate data, such as compressed and content sizes.
-+ *
-+ * A few rules to respect:
-+ * - Compressing and decompressing require a context structure
-+ *   + Use ZSTD_initCCtx() and ZSTD_initDCtx()
-+ * - It is necessary to init context before starting
-+ *   + compression : ZSTD_compressBegin()
-+ *   + decompression : ZSTD_decompressBegin()
-+ *   + variants _usingDict() are also allowed
-+ *   + copyCCtx() and copyDCtx() work too
-+ * - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
-+ *   + If you need to compress more, cut data into multiple blocks
-+ *   + Consider using the regular ZSTD_compress() instead, as frame metadata
-+ *     costs become negligible when source size is large.
-+ * - When a block is considered not compressible enough, ZSTD_compressBlock()
-+ *   result will be zero. In which case, nothing is produced into `dst`.
-+ *   + User must test for such outcome and deal directly with uncompressed data
-+ *   + ZSTD_decompressBlock() doesn't accept uncompressed data as input!!!
-+ *   + In case of multiple successive blocks, decoder must be informed of
-+ *     uncompressed block existence to follow proper history. Use
-+ *     ZSTD_insertBlock() in such a case.
-+ ******************************************************************************/
-+
-+/* Define for static allocation */
-+#define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)
-+/*=====   Raw zstd block functions  =====*/
-+size_t ZSTD_getBlockSizeMax(ZSTD_CCtx *cctx);
-+size_t ZSTD_compressBlock(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize);
-+size_t ZSTD_decompressBlock(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity,
-+	const void *src, size_t srcSize);
-+size_t ZSTD_insertBlock(ZSTD_DCtx *dctx, const void *blockStart,
-+	size_t blockSize);
-+
-+#endif  /* ZSTD_H */
-diff --git a/lib/Kconfig b/lib/Kconfig
-index 5e7541f..0d49ed0 100644
---- a/lib/Kconfig
-+++ b/lib/Kconfig
-@@ -249,6 +249,14 @@ config LZ4HC_COMPRESS
- config LZ4_DECOMPRESS
- 	tristate
-
-+config ZSTD_COMPRESS
-+	select XXHASH
-+	tristate
-+
-+config ZSTD_DECOMPRESS
-+	select XXHASH
-+	tristate
-+
- source "lib/xz/Kconfig"
-
- #
-diff --git a/lib/Makefile b/lib/Makefile
-index d06b68a..d5c8a4f 100644
---- a/lib/Makefile
-+++ b/lib/Makefile
-@@ -116,6 +116,8 @@ obj-$(CONFIG_LZO_DECOMPRESS) += lzo/
- obj-$(CONFIG_LZ4_COMPRESS) += lz4/
- obj-$(CONFIG_LZ4HC_COMPRESS) += lz4/
- obj-$(CONFIG_LZ4_DECOMPRESS) += lz4/
-+obj-$(CONFIG_ZSTD_COMPRESS) += zstd/
-+obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd/
- obj-$(CONFIG_XZ_DEC) += xz/
- obj-$(CONFIG_RAID6_PQ) += raid6/
-
-diff --git a/lib/zstd/Makefile b/lib/zstd/Makefile
-new file mode 100644
-index 0000000..dd0a359
---- /dev/null
-+++ b/lib/zstd/Makefile
-@@ -0,0 +1,18 @@
-+obj-$(CONFIG_ZSTD_COMPRESS) += zstd_compress.o
-+obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd_decompress.o
-+
-+ccflags-y += -O3
-+
-+# Object files unique to zstd_compress and zstd_decompress
-+zstd_compress-y := fse_compress.o huf_compress.o compress.o
-+zstd_decompress-y := huf_decompress.o decompress.o
-+
-+# These object files are shared between the modules.
-+# Always add them to zstd_compress.
-+# Unless both zstd_compress and zstd_decompress are built in
-+# then also add them to zstd_decompress.
-+zstd_compress-y += entropy_common.o fse_decompress.o zstd_common.o
-+
-+ifneq ($(CONFIG_ZSTD_COMPRESS)$(CONFIG_ZSTD_DECOMPRESS),yy)
-+	zstd_decompress-y += entropy_common.o fse_decompress.o zstd_common.o
-+endif
-diff --git a/lib/zstd/bitstream.h b/lib/zstd/bitstream.h
-new file mode 100644
-index 0000000..a826b99
---- /dev/null
-+++ b/lib/zstd/bitstream.h
-@@ -0,0 +1,374 @@
-+/*
-+ * bitstream
-+ * Part of FSE library
-+ * header file (to include)
-+ * Copyright (C) 2013-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+#ifndef BITSTREAM_H_MODULE
-+#define BITSTREAM_H_MODULE
-+
-+/*
-+*  This API consists of small unitary functions, which must be inlined for best performance.
-+*  Since link-time-optimization is not available for all compilers,
-+*  these functions are defined into a .h to be included.
-+*/
-+
-+/*-****************************************
-+*  Dependencies
-+******************************************/
-+#include "error_private.h" /* error codes and messages */
-+#include "mem.h"	   /* unaligned access routines */
-+
-+/*=========================================
-+*  Target specific
-+=========================================*/
-+#define STREAM_ACCUMULATOR_MIN_32 25
-+#define STREAM_ACCUMULATOR_MIN_64 57
-+#define STREAM_ACCUMULATOR_MIN ((U32)(ZSTD_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
-+
-+/*-******************************************
-+*  bitStream encoding API (write forward)
-+********************************************/
-+/* bitStream can mix input from multiple sources.
-+*  A critical property of these streams is that they encode and decode in **reverse** direction.
-+*  So the first bit sequence you add will be the last to be read, like a LIFO stack.
-+*/
-+typedef struct {
-+	size_t bitContainer;
-+	int bitPos;
-+	char *startPtr;
-+	char *ptr;
-+	char *endPtr;
-+} BIT_CStream_t;
-+
-+ZSTD_STATIC size_t BIT_initCStream(BIT_CStream_t *bitC, void *dstBuffer, size_t dstCapacity);
-+ZSTD_STATIC void BIT_addBits(BIT_CStream_t *bitC, size_t value, unsigned nbBits);
-+ZSTD_STATIC void BIT_flushBits(BIT_CStream_t *bitC);
-+ZSTD_STATIC size_t BIT_closeCStream(BIT_CStream_t *bitC);
-+
-+/* Start with initCStream, providing the size of buffer to write into.
-+*  bitStream will never write outside of this buffer.
-+*  `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
-+*
-+*  bits are first added to a local register.
-+*  Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
-+*  Writing data into memory is an explicit operation, performed by the flushBits function.
-+*  Hence keep track how many bits are potentially stored into local register to avoid register overflow.
-+*  After a flushBits, a maximum of 7 bits might still be stored into local register.
-+*
-+*  Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
-+*
-+*  Last operation is to close the bitStream.
-+*  The function returns the final size of CStream in bytes.
-+*  If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
-+*/
-+
-+/*-********************************************
-+*  bitStream decoding API (read backward)
-+**********************************************/
-+typedef struct {
-+	size_t bitContainer;
-+	unsigned bitsConsumed;
-+	const char *ptr;
-+	const char *start;
-+} BIT_DStream_t;
-+
-+typedef enum {
-+	BIT_DStream_unfinished = 0,
-+	BIT_DStream_endOfBuffer = 1,
-+	BIT_DStream_completed = 2,
-+	BIT_DStream_overflow = 3
-+} BIT_DStream_status; /* result of BIT_reloadDStream() */
-+/* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
-+
-+ZSTD_STATIC size_t BIT_initDStream(BIT_DStream_t *bitD, const void *srcBuffer, size_t srcSize);
-+ZSTD_STATIC size_t BIT_readBits(BIT_DStream_t *bitD, unsigned nbBits);
-+ZSTD_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t *bitD);
-+ZSTD_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t *bitD);
-+
-+/* Start by invoking BIT_initDStream().
-+*  A chunk of the bitStream is then stored into a local register.
-+*  Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
-+*  You can then retrieve bitFields stored into the local register, **in reverse order**.
-+*  Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
-+*  A reload guarantee a minimum of ((8*sizeof(bitD->bitContainer))-7) bits when its result is BIT_DStream_unfinished.
-+*  Otherwise, it can be less than that, so proceed accordingly.
-+*  Checking if DStream has reached its end can be performed with BIT_endOfDStream().
-+*/
-+
-+/*-****************************************
-+*  unsafe API
-+******************************************/
-+ZSTD_STATIC void BIT_addBitsFast(BIT_CStream_t *bitC, size_t value, unsigned nbBits);
-+/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
-+
-+ZSTD_STATIC void BIT_flushBitsFast(BIT_CStream_t *bitC);
-+/* unsafe version; does not check buffer overflow */
-+
-+ZSTD_STATIC size_t BIT_readBitsFast(BIT_DStream_t *bitD, unsigned nbBits);
-+/* faster, but works only if nbBits >= 1 */
-+
-+/*-**************************************************************
-+*  Internal functions
-+****************************************************************/
-+ZSTD_STATIC unsigned BIT_highbit32(register U32 val) { return 31 - __builtin_clz(val); }
-+
-+/*=====    Local Constants   =====*/
-+static const unsigned BIT_mask[] = {0,       1,       3,       7,	0xF,      0x1F,     0x3F,     0x7F,      0xFF,
-+				    0x1FF,   0x3FF,   0x7FF,   0xFFF,    0x1FFF,   0x3FFF,   0x7FFF,   0xFFFF,    0x1FFFF,
-+				    0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF, 0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF}; /* up to 26 bits */
-+
-+/*-**************************************************************
-+*  bitStream encoding
-+****************************************************************/
-+/*! BIT_initCStream() :
-+ *  `dstCapacity` must be > sizeof(void*)
-+ *  @return : 0 if success,
-+			  otherwise an error code (can be tested using ERR_isError() ) */
-+ZSTD_STATIC size_t BIT_initCStream(BIT_CStream_t *bitC, void *startPtr, size_t dstCapacity)
-+{
-+	bitC->bitContainer = 0;
-+	bitC->bitPos = 0;
-+	bitC->startPtr = (char *)startPtr;
-+	bitC->ptr = bitC->startPtr;
-+	bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->ptr);
-+	if (dstCapacity <= sizeof(bitC->ptr))
-+		return ERROR(dstSize_tooSmall);
-+	return 0;
-+}
-+
-+/*! BIT_addBits() :
-+	can add up to 26 bits into `bitC`.
-+	Does not check for register overflow ! */
-+ZSTD_STATIC void BIT_addBits(BIT_CStream_t *bitC, size_t value, unsigned nbBits)
-+{
-+	bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
-+	bitC->bitPos += nbBits;
-+}
-+
-+/*! BIT_addBitsFast() :
-+ *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
-+ZSTD_STATIC void BIT_addBitsFast(BIT_CStream_t *bitC, size_t value, unsigned nbBits)
-+{
-+	bitC->bitContainer |= value << bitC->bitPos;
-+	bitC->bitPos += nbBits;
-+}
-+
-+/*! BIT_flushBitsFast() :
-+ *  unsafe version; does not check buffer overflow */
-+ZSTD_STATIC void BIT_flushBitsFast(BIT_CStream_t *bitC)
-+{
-+	size_t const nbBytes = bitC->bitPos >> 3;
-+	ZSTD_writeLEST(bitC->ptr, bitC->bitContainer);
-+	bitC->ptr += nbBytes;
-+	bitC->bitPos &= 7;
-+	bitC->bitContainer >>= nbBytes * 8; /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
-+}
-+
-+/*! BIT_flushBits() :
-+ *  safe version; check for buffer overflow, and prevents it.
-+ *  note : does not signal buffer overflow. This will be revealed later on using BIT_closeCStream() */
-+ZSTD_STATIC void BIT_flushBits(BIT_CStream_t *bitC)
-+{
-+	size_t const nbBytes = bitC->bitPos >> 3;
-+	ZSTD_writeLEST(bitC->ptr, bitC->bitContainer);
-+	bitC->ptr += nbBytes;
-+	if (bitC->ptr > bitC->endPtr)
-+		bitC->ptr = bitC->endPtr;
-+	bitC->bitPos &= 7;
-+	bitC->bitContainer >>= nbBytes * 8; /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
-+}
-+
-+/*! BIT_closeCStream() :
-+ *  @return : size of CStream, in bytes,
-+			  or 0 if it could not fit into dstBuffer */
-+ZSTD_STATIC size_t BIT_closeCStream(BIT_CStream_t *bitC)
-+{
-+	BIT_addBitsFast(bitC, 1, 1); /* endMark */
-+	BIT_flushBits(bitC);
-+
-+	if (bitC->ptr >= bitC->endPtr)
-+		return 0; /* doesn't fit within authorized budget : cancel */
-+
-+	return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
-+}
-+
-+/*-********************************************************
-+* bitStream decoding
-+**********************************************************/
-+/*! BIT_initDStream() :
-+*   Initialize a BIT_DStream_t.
-+*   `bitD` : a pointer to an already allocated BIT_DStream_t structure.
-+*   `srcSize` must be the *exact* size of the bitStream, in bytes.
-+*   @return : size of stream (== srcSize) or an errorCode if a problem is detected
-+*/
-+ZSTD_STATIC size_t BIT_initDStream(BIT_DStream_t *bitD, const void *srcBuffer, size_t srcSize)
-+{
-+	if (srcSize < 1) {
-+		memset(bitD, 0, sizeof(*bitD));
-+		return ERROR(srcSize_wrong);
-+	}
-+
-+	if (srcSize >= sizeof(bitD->bitContainer)) { /* normal case */
-+		bitD->start = (const char *)srcBuffer;
-+		bitD->ptr = (const char *)srcBuffer + srcSize - sizeof(bitD->bitContainer);
-+		bitD->bitContainer = ZSTD_readLEST(bitD->ptr);
-+		{
-+			BYTE const lastByte = ((const BYTE *)srcBuffer)[srcSize - 1];
-+			bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0; /* ensures bitsConsumed is always set */
-+			if (lastByte == 0)
-+				return ERROR(GENERIC); /* endMark not present */
-+		}
-+	} else {
-+		bitD->start = (const char *)srcBuffer;
-+		bitD->ptr = bitD->start;
-+		bitD->bitContainer = *(const BYTE *)(bitD->start);
-+		switch (srcSize) {
-+		case 7: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[6]) << (sizeof(bitD->bitContainer) * 8 - 16);
-+		case 6: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[5]) << (sizeof(bitD->bitContainer) * 8 - 24);
-+		case 5: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[4]) << (sizeof(bitD->bitContainer) * 8 - 32);
-+		case 4: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[3]) << 24;
-+		case 3: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[2]) << 16;
-+		case 2: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[1]) << 8;
-+		default:;
-+		}
-+		{
-+			BYTE const lastByte = ((const BYTE *)srcBuffer)[srcSize - 1];
-+			bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
-+			if (lastByte == 0)
-+				return ERROR(GENERIC); /* endMark not present */
-+		}
-+		bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize) * 8;
-+	}
-+
-+	return srcSize;
-+}
-+
-+ZSTD_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start) { return bitContainer >> start; }
-+
-+ZSTD_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits) { return (bitContainer >> start) & BIT_mask[nbBits]; }
-+
-+ZSTD_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits) { return bitContainer & BIT_mask[nbBits]; }
-+
-+/*! BIT_lookBits() :
-+ *  Provides next n bits from local register.
-+ *  local register is not modified.
-+ *  On 32-bits, maxNbBits==24.
-+ *  On 64-bits, maxNbBits==56.
-+ *  @return : value extracted
-+ */
-+ZSTD_STATIC size_t BIT_lookBits(const BIT_DStream_t *bitD, U32 nbBits)
-+{
-+	U32 const bitMask = sizeof(bitD->bitContainer) * 8 - 1;
-+	return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask - nbBits) & bitMask);
-+}
-+
-+/*! BIT_lookBitsFast() :
-+*   unsafe version; only works only if nbBits >= 1 */
-+ZSTD_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t *bitD, U32 nbBits)
-+{
-+	U32 const bitMask = sizeof(bitD->bitContainer) * 8 - 1;
-+	return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask + 1) - nbBits) & bitMask);
-+}
-+
-+ZSTD_STATIC void BIT_skipBits(BIT_DStream_t *bitD, U32 nbBits) { bitD->bitsConsumed += nbBits; }
-+
-+/*! BIT_readBits() :
-+ *  Read (consume) next n bits from local register and update.
-+ *  Pay attention to not read more than nbBits contained into local register.
-+ *  @return : extracted value.
-+ */
-+ZSTD_STATIC size_t BIT_readBits(BIT_DStream_t *bitD, U32 nbBits)
-+{
-+	size_t const value = BIT_lookBits(bitD, nbBits);
-+	BIT_skipBits(bitD, nbBits);
-+	return value;
-+}
-+
-+/*! BIT_readBitsFast() :
-+*   unsafe version; only works only if nbBits >= 1 */
-+ZSTD_STATIC size_t BIT_readBitsFast(BIT_DStream_t *bitD, U32 nbBits)
-+{
-+	size_t const value = BIT_lookBitsFast(bitD, nbBits);
-+	BIT_skipBits(bitD, nbBits);
-+	return value;
-+}
-+
-+/*! BIT_reloadDStream() :
-+*   Refill `bitD` from buffer previously set in BIT_initDStream() .
-+*   This function is safe, it guarantees it will not read beyond src buffer.
-+*   @return : status of `BIT_DStream_t` internal register.
-+			  if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
-+ZSTD_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t *bitD)
-+{
-+	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer) * 8)) /* should not happen => corruption detected */
-+		return BIT_DStream_overflow;
-+
-+	if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
-+		bitD->ptr -= bitD->bitsConsumed >> 3;
-+		bitD->bitsConsumed &= 7;
-+		bitD->bitContainer = ZSTD_readLEST(bitD->ptr);
-+		return BIT_DStream_unfinished;
-+	}
-+	if (bitD->ptr == bitD->start) {
-+		if (bitD->bitsConsumed < sizeof(bitD->bitContainer) * 8)
-+			return BIT_DStream_endOfBuffer;
-+		return BIT_DStream_completed;
-+	}
-+	{
-+		U32 nbBytes = bitD->bitsConsumed >> 3;
-+		BIT_DStream_status result = BIT_DStream_unfinished;
-+		if (bitD->ptr - nbBytes < bitD->start) {
-+			nbBytes = (U32)(bitD->ptr - bitD->start); /* ptr > start */
-+			result = BIT_DStream_endOfBuffer;
-+		}
-+		bitD->ptr -= nbBytes;
-+		bitD->bitsConsumed -= nbBytes * 8;
-+		bitD->bitContainer = ZSTD_readLEST(bitD->ptr); /* reminder : srcSize > sizeof(bitD) */
-+		return result;
-+	}
-+}
-+
-+/*! BIT_endOfDStream() :
-+*   @return Tells if DStream has exactly reached its end (all bits consumed).
-+*/
-+ZSTD_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t *DStream)
-+{
-+	return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer) * 8));
-+}
-+
-+#endif /* BITSTREAM_H_MODULE */
-diff --git a/lib/zstd/compress.c b/lib/zstd/compress.c
-new file mode 100644
-index 0000000..ff18ae6
---- /dev/null
-+++ b/lib/zstd/compress.c
-@@ -0,0 +1,3482 @@
-+/**
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+/*-*************************************
-+*  Dependencies
-+***************************************/
-+#include "fse.h"
-+#include "huf.h"
-+#include "mem.h"
-+#include "zstd_internal.h" /* includes zstd.h */
-+#include 
-+#include 
-+#include  /* memset */
-+
-+/*-*************************************
-+*  Constants
-+***************************************/
-+static const U32 g_searchStrength = 8; /* control skip over incompressible data */
-+#define HASH_READ_SIZE 8
-+typedef enum { ZSTDcs_created = 0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
-+
-+/*-*************************************
-+*  Helper functions
-+***************************************/
-+size_t ZSTD_compressBound(size_t srcSize) { return FSE_compressBound(srcSize) + 12; }
-+
-+/*-*************************************
-+*  Sequence storage
-+***************************************/
-+static void ZSTD_resetSeqStore(seqStore_t *ssPtr)
-+{
-+	ssPtr->lit = ssPtr->litStart;
-+	ssPtr->sequences = ssPtr->sequencesStart;
-+	ssPtr->longLengthID = 0;
-+}
-+
-+/*-*************************************
-+*  Context memory management
-+***************************************/
-+struct ZSTD_CCtx_s {
-+	const BYTE *nextSrc;  /* next block here to continue on curr prefix */
-+	const BYTE *base;     /* All regular indexes relative to this position */
-+	const BYTE *dictBase; /* extDict indexes relative to this position */
-+	U32 dictLimit;	/* below that point, need extDict */
-+	U32 lowLimit;	 /* below that point, no more data */
-+	U32 nextToUpdate;     /* index from which to continue dictionary update */
-+	U32 nextToUpdate3;    /* index from which to continue dictionary update */
-+	U32 hashLog3;	 /* dispatch table : larger == faster, more memory */
-+	U32 loadedDictEnd;    /* index of end of dictionary */
-+	U32 forceWindow;      /* force back-references to respect limit of 1< 3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
-+	size_t const h3Size = ((size_t)1) << hashLog3;
-+	size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-+	size_t const optSpace =
-+	    ((MaxML + 1) + (MaxLL + 1) + (MaxOff + 1) + (1 << Litbits)) * sizeof(U32) + (ZSTD_OPT_NUM + 1) * (sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-+	size_t const workspaceSize = tableSpace + (256 * sizeof(U32)) /* huffTable */ + tokenSpace +
-+				     (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
-+
-+	return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_CCtx)) + ZSTD_ALIGN(workspaceSize);
-+}
-+
-+static ZSTD_CCtx *ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
-+{
-+	ZSTD_CCtx *cctx;
-+	if (!customMem.customAlloc || !customMem.customFree)
-+		return NULL;
-+	cctx = (ZSTD_CCtx *)ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
-+	if (!cctx)
-+		return NULL;
-+	memset(cctx, 0, sizeof(ZSTD_CCtx));
-+	cctx->customMem = customMem;
-+	return cctx;
-+}
-+
-+ZSTD_CCtx *ZSTD_initCCtx(void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-+	ZSTD_CCtx *cctx = ZSTD_createCCtx_advanced(stackMem);
-+	if (cctx) {
-+		cctx->workSpace = ZSTD_stackAllocAll(cctx->customMem.opaque, &cctx->workSpaceSize);
-+	}
-+	return cctx;
-+}
-+
-+size_t ZSTD_freeCCtx(ZSTD_CCtx *cctx)
-+{
-+	if (cctx == NULL)
-+		return 0; /* support free on NULL */
-+	ZSTD_free(cctx->workSpace, cctx->customMem);
-+	ZSTD_free(cctx, cctx->customMem);
-+	return 0; /* reserved as a potential error code in the future */
-+}
-+
-+const seqStore_t *ZSTD_getSeqStore(const ZSTD_CCtx *ctx) /* hidden interface */ { return &(ctx->seqStore); }
-+
-+static ZSTD_parameters ZSTD_getParamsFromCCtx(const ZSTD_CCtx *cctx) { return cctx->params; }
-+
-+/** ZSTD_checkParams() :
-+	ensure param values remain within authorized range.
-+	@return : 0, or an error code if one value is beyond authorized range */
-+size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
-+{
-+#define CLAMPCHECK(val, min, max)                                       \
-+	{                                                               \
-+		if ((val < min) | (val > max))                          \
-+			return ERROR(compressionParameter_unsupported); \
-+	}
-+	CLAMPCHECK(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
-+	CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
-+	CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-+	CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-+	CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
-+	CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
-+	if ((U32)(cParams.strategy) > (U32)ZSTD_btopt2)
-+		return ERROR(compressionParameter_unsupported);
-+	return 0;
-+}
-+
-+/** ZSTD_cycleLog() :
-+ *  condition for correct operation : hashLog > 1 */
-+static U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat)
-+{
-+	U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
-+	return hashLog - btScale;
-+}
-+
-+/** ZSTD_adjustCParams() :
-+	optimize `cPar` for a given input (`srcSize` and `dictSize`).
-+	mostly downsizing to reduce memory consumption and initialization.
-+	Both `srcSize` and `dictSize` are optional (use 0 if unknown),
-+	but if both are 0, no optimization can be done.
-+	Note : cPar is considered validated at this stage. Use ZSTD_checkParams() to ensure that. */
-+ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize)
-+{
-+	if (srcSize + dictSize == 0)
-+		return cPar; /* no size information available : no adjustment */
-+
-+	/* resize params, to use less memory when necessary */
-+	{
-+		U32 const minSrcSize = (srcSize == 0) ? 500 : 0;
-+		U64 const rSize = srcSize + dictSize + minSrcSize;
-+		if (rSize < ((U64)1 << ZSTD_WINDOWLOG_MAX)) {
-+			U32 const srcLog = MAX(ZSTD_HASHLOG_MIN, ZSTD_highbit32((U32)(rSize)-1) + 1);
-+			if (cPar.windowLog > srcLog)
-+				cPar.windowLog = srcLog;
-+		}
-+	}
-+	if (cPar.hashLog > cPar.windowLog)
-+		cPar.hashLog = cPar.windowLog;
-+	{
-+		U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
-+		if (cycleLog > cPar.windowLog)
-+			cPar.chainLog -= (cycleLog - cPar.windowLog);
-+	}
-+
-+	if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN)
-+		cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN; /* required for frame header */
-+
-+	return cPar;
-+}
-+
-+static U32 ZSTD_equivalentParams(ZSTD_parameters param1, ZSTD_parameters param2)
-+{
-+	return (param1.cParams.hashLog == param2.cParams.hashLog) & (param1.cParams.chainLog == param2.cParams.chainLog) &
-+	       (param1.cParams.strategy == param2.cParams.strategy) & ((param1.cParams.searchLength == 3) == (param2.cParams.searchLength == 3));
-+}
-+
-+/*! ZSTD_continueCCtx() :
-+	reuse CCtx without reset (note : requires no dictionary) */
-+static size_t ZSTD_continueCCtx(ZSTD_CCtx *cctx, ZSTD_parameters params, U64 frameContentSize)
-+{
-+	U32 const end = (U32)(cctx->nextSrc - cctx->base);
-+	cctx->params = params;
-+	cctx->frameContentSize = frameContentSize;
-+	cctx->lowLimit = end;
-+	cctx->dictLimit = end;
-+	cctx->nextToUpdate = end + 1;
-+	cctx->stage = ZSTDcs_init;
-+	cctx->dictID = 0;
-+	cctx->loadedDictEnd = 0;
-+	{
-+		int i;
-+		for (i = 0; i < ZSTD_REP_NUM; i++)
-+			cctx->rep[i] = repStartValue[i];
-+	}
-+	cctx->seqStore.litLengthSum = 0; /* force reset of btopt stats */
-+	xxh64_reset(&cctx->xxhState, 0);
-+	return 0;
-+}
-+
-+typedef enum { ZSTDcrp_continue, ZSTDcrp_noMemset, ZSTDcrp_fullReset } ZSTD_compResetPolicy_e;
-+
-+/*! ZSTD_resetCCtx_advanced() :
-+	note : `params` must be validated */
-+static size_t ZSTD_resetCCtx_advanced(ZSTD_CCtx *zc, ZSTD_parameters params, U64 frameContentSize, ZSTD_compResetPolicy_e const crp)
-+{
-+	if (crp == ZSTDcrp_continue)
-+		if (ZSTD_equivalentParams(params, zc->params)) {
-+			zc->flagStaticTables = 0;
-+			zc->flagStaticHufTable = HUF_repeat_none;
-+			return ZSTD_continueCCtx(zc, params, frameContentSize);
-+		}
-+
-+	{
-+		size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << params.cParams.windowLog);
-+		U32 const divider = (params.cParams.searchLength == 3) ? 3 : 4;
-+		size_t const maxNbSeq = blockSize / divider;
-+		size_t const tokenSpace = blockSize + 11 * maxNbSeq;
-+		size_t const chainSize = (params.cParams.strategy == ZSTD_fast) ? 0 : (1 << params.cParams.chainLog);
-+		size_t const hSize = ((size_t)1) << params.cParams.hashLog;
-+		U32 const hashLog3 = (params.cParams.searchLength > 3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, params.cParams.windowLog);
-+		size_t const h3Size = ((size_t)1) << hashLog3;
-+		size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-+		void *ptr;
-+
-+		/* Check if workSpace is large enough, alloc a new one if needed */
-+		{
-+			size_t const optSpace = ((MaxML + 1) + (MaxLL + 1) + (MaxOff + 1) + (1 << Litbits)) * sizeof(U32) +
-+						(ZSTD_OPT_NUM + 1) * (sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-+			size_t const neededSpace = tableSpace + (256 * sizeof(U32)) /* huffTable */ + tokenSpace +
-+						   (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
-+			if (zc->workSpaceSize < neededSpace) {
-+				ZSTD_free(zc->workSpace, zc->customMem);
-+				zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
-+				if (zc->workSpace == NULL)
-+					return ERROR(memory_allocation);
-+				zc->workSpaceSize = neededSpace;
-+			}
-+		}
-+
-+		if (crp != ZSTDcrp_noMemset)
-+			memset(zc->workSpace, 0, tableSpace); /* reset tables only */
-+		xxh64_reset(&zc->xxhState, 0);
-+		zc->hashLog3 = hashLog3;
-+		zc->hashTable = (U32 *)(zc->workSpace);
-+		zc->chainTable = zc->hashTable + hSize;
-+		zc->hashTable3 = zc->chainTable + chainSize;
-+		ptr = zc->hashTable3 + h3Size;
-+		zc->hufTable = (HUF_CElt *)ptr;
-+		zc->flagStaticTables = 0;
-+		zc->flagStaticHufTable = HUF_repeat_none;
-+		ptr = ((U32 *)ptr) + 256; /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
-+
-+		zc->nextToUpdate = 1;
-+		zc->nextSrc = NULL;
-+		zc->base = NULL;
-+		zc->dictBase = NULL;
-+		zc->dictLimit = 0;
-+		zc->lowLimit = 0;
-+		zc->params = params;
-+		zc->blockSize = blockSize;
-+		zc->frameContentSize = frameContentSize;
-+		{
-+			int i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				zc->rep[i] = repStartValue[i];
-+		}
-+
-+		if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
-+			zc->seqStore.litFreq = (U32 *)ptr;
-+			zc->seqStore.litLengthFreq = zc->seqStore.litFreq + (1 << Litbits);
-+			zc->seqStore.matchLengthFreq = zc->seqStore.litLengthFreq + (MaxLL + 1);
-+			zc->seqStore.offCodeFreq = zc->seqStore.matchLengthFreq + (MaxML + 1);
-+			ptr = zc->seqStore.offCodeFreq + (MaxOff + 1);
-+			zc->seqStore.matchTable = (ZSTD_match_t *)ptr;
-+			ptr = zc->seqStore.matchTable + ZSTD_OPT_NUM + 1;
-+			zc->seqStore.priceTable = (ZSTD_optimal_t *)ptr;
-+			ptr = zc->seqStore.priceTable + ZSTD_OPT_NUM + 1;
-+			zc->seqStore.litLengthSum = 0;
-+		}
-+		zc->seqStore.sequencesStart = (seqDef *)ptr;
-+		ptr = zc->seqStore.sequencesStart + maxNbSeq;
-+		zc->seqStore.llCode = (BYTE *)ptr;
-+		zc->seqStore.mlCode = zc->seqStore.llCode + maxNbSeq;
-+		zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
-+		zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
-+
-+		zc->stage = ZSTDcs_init;
-+		zc->dictID = 0;
-+		zc->loadedDictEnd = 0;
-+
-+		return 0;
-+	}
-+}
-+
-+/* ZSTD_invalidateRepCodes() :
-+ * ensures next compression will not use repcodes from previous block.
-+ * Note : only works with regular variant;
-+ *        do not use with extDict variant ! */
-+void ZSTD_invalidateRepCodes(ZSTD_CCtx *cctx)
-+{
-+	int i;
-+	for (i = 0; i < ZSTD_REP_NUM; i++)
-+		cctx->rep[i] = 0;
-+}
-+
-+/*! ZSTD_copyCCtx() :
-+*   Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
-+*   Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
-+*   @return : 0, or an error code */
-+size_t ZSTD_copyCCtx(ZSTD_CCtx *dstCCtx, const ZSTD_CCtx *srcCCtx, unsigned long long pledgedSrcSize)
-+{
-+	if (srcCCtx->stage != ZSTDcs_init)
-+		return ERROR(stage_wrong);
-+
-+	memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
-+	{
-+		ZSTD_parameters params = srcCCtx->params;
-+		params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-+		ZSTD_resetCCtx_advanced(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
-+	}
-+
-+	/* copy tables */
-+	{
-+		size_t const chainSize = (srcCCtx->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << srcCCtx->params.cParams.chainLog);
-+		size_t const hSize = ((size_t)1) << srcCCtx->params.cParams.hashLog;
-+		size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
-+		size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-+		memcpy(dstCCtx->workSpace, srcCCtx->workSpace, tableSpace);
-+	}
-+
-+	/* copy dictionary offsets */
-+	dstCCtx->nextToUpdate = srcCCtx->nextToUpdate;
-+	dstCCtx->nextToUpdate3 = srcCCtx->nextToUpdate3;
-+	dstCCtx->nextSrc = srcCCtx->nextSrc;
-+	dstCCtx->base = srcCCtx->base;
-+	dstCCtx->dictBase = srcCCtx->dictBase;
-+	dstCCtx->dictLimit = srcCCtx->dictLimit;
-+	dstCCtx->lowLimit = srcCCtx->lowLimit;
-+	dstCCtx->loadedDictEnd = srcCCtx->loadedDictEnd;
-+	dstCCtx->dictID = srcCCtx->dictID;
-+
-+	/* copy entropy tables */
-+	dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
-+	dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
-+	if (srcCCtx->flagStaticTables) {
-+		memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
-+		memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
-+		memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
-+	}
-+	if (srcCCtx->flagStaticHufTable) {
-+		memcpy(dstCCtx->hufTable, srcCCtx->hufTable, 256 * 4);
-+	}
-+
-+	return 0;
-+}
-+
-+/*! ZSTD_reduceTable() :
-+*   reduce table indexes by `reducerValue` */
-+static void ZSTD_reduceTable(U32 *const table, U32 const size, U32 const reducerValue)
-+{
-+	U32 u;
-+	for (u = 0; u < size; u++) {
-+		if (table[u] < reducerValue)
-+			table[u] = 0;
-+		else
-+			table[u] -= reducerValue;
-+	}
-+}
-+
-+/*! ZSTD_reduceIndex() :
-+*   rescale all indexes to avoid future overflow (indexes are U32) */
-+static void ZSTD_reduceIndex(ZSTD_CCtx *zc, const U32 reducerValue)
-+{
-+	{
-+		U32 const hSize = 1 << zc->params.cParams.hashLog;
-+		ZSTD_reduceTable(zc->hashTable, hSize, reducerValue);
-+	}
-+
-+	{
-+		U32 const chainSize = (zc->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << zc->params.cParams.chainLog);
-+		ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue);
-+	}
-+
-+	{
-+		U32 const h3Size = (zc->hashLog3) ? 1 << zc->hashLog3 : 0;
-+		ZSTD_reduceTable(zc->hashTable3, h3Size, reducerValue);
-+	}
-+}
-+
-+/*-*******************************************************
-+*  Block entropic compression
-+*********************************************************/
-+
-+/* See doc/zstd_compression_format.md for detailed format description */
-+
-+size_t ZSTD_noCompressBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	if (srcSize + ZSTD_blockHeaderSize > dstCapacity)
-+		return ERROR(dstSize_tooSmall);
-+	memcpy((BYTE *)dst + ZSTD_blockHeaderSize, src, srcSize);
-+	ZSTD_writeLE24(dst, (U32)(srcSize << 2) + (U32)bt_raw);
-+	return ZSTD_blockHeaderSize + srcSize;
-+}
-+
-+static size_t ZSTD_noCompressLiterals(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	BYTE *const ostart = (BYTE * const)dst;
-+	U32 const flSize = 1 + (srcSize > 31) + (srcSize > 4095);
-+
-+	if (srcSize + flSize > dstCapacity)
-+		return ERROR(dstSize_tooSmall);
-+
-+	switch (flSize) {
-+	case 1: /* 2 - 1 - 5 */ ostart[0] = (BYTE)((U32)set_basic + (srcSize << 3)); break;
-+	case 2: /* 2 - 2 - 12 */ ZSTD_writeLE16(ostart, (U16)((U32)set_basic + (1 << 2) + (srcSize << 4))); break;
-+	default: /*note : should not be necessary : flSize is within {1,2,3} */
-+	case 3: /* 2 - 2 - 20 */ ZSTD_writeLE32(ostart, (U32)((U32)set_basic + (3 << 2) + (srcSize << 4))); break;
-+	}
-+
-+	memcpy(ostart + flSize, src, srcSize);
-+	return srcSize + flSize;
-+}
-+
-+static size_t ZSTD_compressRleLiteralsBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	BYTE *const ostart = (BYTE * const)dst;
-+	U32 const flSize = 1 + (srcSize > 31) + (srcSize > 4095);
-+
-+	(void)dstCapacity; /* dstCapacity already guaranteed to be >=4, hence large enough */
-+
-+	switch (flSize) {
-+	case 1: /* 2 - 1 - 5 */ ostart[0] = (BYTE)((U32)set_rle + (srcSize << 3)); break;
-+	case 2: /* 2 - 2 - 12 */ ZSTD_writeLE16(ostart, (U16)((U32)set_rle + (1 << 2) + (srcSize << 4))); break;
-+	default: /*note : should not be necessary : flSize is necessarily within {1,2,3} */
-+	case 3: /* 2 - 2 - 20 */ ZSTD_writeLE32(ostart, (U32)((U32)set_rle + (3 << 2) + (srcSize << 4))); break;
-+	}
-+
-+	ostart[flSize] = *(const BYTE *)src;
-+	return flSize + 1;
-+}
-+
-+static size_t ZSTD_minGain(size_t srcSize) { return (srcSize >> 6) + 2; }
-+
-+static size_t ZSTD_compressLiterals(ZSTD_CCtx *zc, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	size_t const minGain = ZSTD_minGain(srcSize);
-+	size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
-+	BYTE *const ostart = (BYTE *)dst;
-+	U32 singleStream = srcSize < 256;
-+	symbolEncodingType_e hType = set_compressed;
-+	size_t cLitSize;
-+
-+/* small ? don't even attempt compression (speed opt) */
-+#define LITERAL_NOENTROPY 63
-+	{
-+		size_t const minLitSize = zc->flagStaticHufTable == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
-+		if (srcSize <= minLitSize)
-+			return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-+	}
-+
-+	if (dstCapacity < lhSize + 1)
-+		return ERROR(dstSize_tooSmall); /* not enough space for compression */
-+	{
-+		HUF_repeat repeat = zc->flagStaticHufTable;
-+		int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
-+		if (repeat == HUF_repeat_valid && lhSize == 3)
-+			singleStream = 1;
-+		cLitSize = singleStream ? HUF_compress1X_repeat(ostart + lhSize, dstCapacity - lhSize, src, srcSize, 255, 11, zc->tmpCounters,
-+								sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
-+					: HUF_compress4X_repeat(ostart + lhSize, dstCapacity - lhSize, src, srcSize, 255, 11, zc->tmpCounters,
-+								sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
-+		if (repeat != HUF_repeat_none) {
-+			hType = set_repeat;
-+		} /* reused the existing table */
-+		else {
-+			zc->flagStaticHufTable = HUF_repeat_check;
-+		} /* now have a table to reuse */
-+	}
-+
-+	if ((cLitSize == 0) | (cLitSize >= srcSize - minGain)) {
-+		zc->flagStaticHufTable = HUF_repeat_none;
-+		return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-+	}
-+	if (cLitSize == 1) {
-+		zc->flagStaticHufTable = HUF_repeat_none;
-+		return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
-+	}
-+
-+	/* Build header */
-+	switch (lhSize) {
-+	case 3: /* 2 - 2 - 10 - 10 */
-+	{
-+		U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize << 4) + ((U32)cLitSize << 14);
-+		ZSTD_writeLE24(ostart, lhc);
-+		break;
-+	}
-+	case 4: /* 2 - 2 - 14 - 14 */
-+	{
-+		U32 const lhc = hType + (2 << 2) + ((U32)srcSize << 4) + ((U32)cLitSize << 18);
-+		ZSTD_writeLE32(ostart, lhc);
-+		break;
-+	}
-+	default: /* should not be necessary, lhSize is only {3,4,5} */
-+	case 5:  /* 2 - 2 - 18 - 18 */
-+	{
-+		U32 const lhc = hType + (3 << 2) + ((U32)srcSize << 4) + ((U32)cLitSize << 22);
-+		ZSTD_writeLE32(ostart, lhc);
-+		ostart[4] = (BYTE)(cLitSize >> 10);
-+		break;
-+	}
-+	}
-+	return lhSize + cLitSize;
-+}
-+
-+static const BYTE LL_Code[64] = {0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15, 16, 16, 17, 17, 18, 18,
-+				 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23,
-+				 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24};
-+
-+static const BYTE ML_Code[128] = {0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,
-+				  26, 27, 28, 29, 30, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37, 38, 38, 38, 38,
-+				  38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
-+				  40, 40, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 42, 42, 42, 42, 42, 42, 42, 42,
-+				  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42};
-+
-+void ZSTD_seqToCodes(const seqStore_t *seqStorePtr)
-+{
-+	BYTE const LL_deltaCode = 19;
-+	BYTE const ML_deltaCode = 36;
-+	const seqDef *const sequences = seqStorePtr->sequencesStart;
-+	BYTE *const llCodeTable = seqStorePtr->llCode;
-+	BYTE *const ofCodeTable = seqStorePtr->ofCode;
-+	BYTE *const mlCodeTable = seqStorePtr->mlCode;
-+	U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-+	U32 u;
-+	for (u = 0; u < nbSeq; u++) {
-+		U32 const llv = sequences[u].litLength;
-+		U32 const mlv = sequences[u].matchLength;
-+		llCodeTable[u] = (llv > 63) ? (BYTE)ZSTD_highbit32(llv) + LL_deltaCode : LL_Code[llv];
-+		ofCodeTable[u] = (BYTE)ZSTD_highbit32(sequences[u].offset);
-+		mlCodeTable[u] = (mlv > 127) ? (BYTE)ZSTD_highbit32(mlv) + ML_deltaCode : ML_Code[mlv];
-+	}
-+	if (seqStorePtr->longLengthID == 1)
-+		llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
-+	if (seqStorePtr->longLengthID == 2)
-+		mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
-+}
-+
-+ZSTD_STATIC size_t ZSTD_compressSequences_internal(ZSTD_CCtx *zc, void *dst, size_t dstCapacity)
-+{
-+	const int longOffsets = zc->params.cParams.windowLog > STREAM_ACCUMULATOR_MIN;
-+	const seqStore_t *seqStorePtr = &(zc->seqStore);
-+	FSE_CTable *CTable_LitLength = zc->litlengthCTable;
-+	FSE_CTable *CTable_OffsetBits = zc->offcodeCTable;
-+	FSE_CTable *CTable_MatchLength = zc->matchlengthCTable;
-+	U32 LLtype, Offtype, MLtype; /* compressed, raw or rle */
-+	const seqDef *const sequences = seqStorePtr->sequencesStart;
-+	const BYTE *const ofCodeTable = seqStorePtr->ofCode;
-+	const BYTE *const llCodeTable = seqStorePtr->llCode;
-+	const BYTE *const mlCodeTable = seqStorePtr->mlCode;
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *const oend = ostart + dstCapacity;
-+	BYTE *op = ostart;
-+	size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
-+	BYTE *seqHead;
-+
-+	U32 *count;
-+	S16 *norm;
-+	U32 *workspace;
-+	size_t workspaceSize = sizeof(zc->tmpCounters);
-+	{
-+		size_t spaceUsed32 = 0;
-+		count = (U32 *)zc->tmpCounters + spaceUsed32;
-+		spaceUsed32 += MaxSeq + 1;
-+		norm = (S16 *)((U32 *)zc->tmpCounters + spaceUsed32);
-+		spaceUsed32 += ALIGN(sizeof(S16) * (MaxSeq + 1), sizeof(U32)) >> 2;
-+
-+		workspace = (U32 *)zc->tmpCounters + spaceUsed32;
-+		workspaceSize -= (spaceUsed32 << 2);
-+	}
-+
-+	/* Compress literals */
-+	{
-+		const BYTE *const literals = seqStorePtr->litStart;
-+		size_t const litSize = seqStorePtr->lit - literals;
-+		size_t const cSize = ZSTD_compressLiterals(zc, op, dstCapacity, literals, litSize);
-+		if (ZSTD_isError(cSize))
-+			return cSize;
-+		op += cSize;
-+	}
-+
-+	/* Sequences Header */
-+	if ((oend - op) < 3 /*max nbSeq Size*/ + 1 /*seqHead */)
-+		return ERROR(dstSize_tooSmall);
-+	if (nbSeq < 0x7F)
-+		*op++ = (BYTE)nbSeq;
-+	else if (nbSeq < LONGNBSEQ)
-+		op[0] = (BYTE)((nbSeq >> 8) + 0x80), op[1] = (BYTE)nbSeq, op += 2;
-+	else
-+		op[0] = 0xFF, ZSTD_writeLE16(op + 1, (U16)(nbSeq - LONGNBSEQ)), op += 3;
-+	if (nbSeq == 0)
-+		return op - ostart;
-+
-+	/* seqHead : flags for FSE encoding type */
-+	seqHead = op++;
-+
-+#define MIN_SEQ_FOR_DYNAMIC_FSE 64
-+#define MAX_SEQ_FOR_STATIC_FSE 1000
-+
-+	/* convert length/distances into codes */
-+	ZSTD_seqToCodes(seqStorePtr);
-+
-+	/* CTable for Literal Lengths */
-+	{
-+		U32 max = MaxLL;
-+		size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, workspace);
-+		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-+			*op++ = llCodeTable[0];
-+			FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
-+			LLtype = set_rle;
-+		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-+			LLtype = set_repeat;
-+		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (LL_defaultNormLog - 1)))) {
-+			FSE_buildCTable_wksp(CTable_LitLength, LL_defaultNorm, MaxLL, LL_defaultNormLog, workspace, workspaceSize);
-+			LLtype = set_basic;
-+		} else {
-+			size_t nbSeq_1 = nbSeq;
-+			const U32 tableLog = FSE_optimalTableLog(LLFSELog, nbSeq, max);
-+			if (count[llCodeTable[nbSeq - 1]] > 1) {
-+				count[llCodeTable[nbSeq - 1]]--;
-+				nbSeq_1--;
-+			}
-+			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-+			{
-+				size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog); /* overflow protected */
-+				if (FSE_isError(NCountSize))
-+					return NCountSize;
-+				op += NCountSize;
-+			}
-+			FSE_buildCTable_wksp(CTable_LitLength, norm, max, tableLog, workspace, workspaceSize);
-+			LLtype = set_compressed;
-+		}
-+	}
-+
-+	/* CTable for Offsets */
-+	{
-+		U32 max = MaxOff;
-+		size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, workspace);
-+		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-+			*op++ = ofCodeTable[0];
-+			FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
-+			Offtype = set_rle;
-+		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-+			Offtype = set_repeat;
-+		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (OF_defaultNormLog - 1)))) {
-+			FSE_buildCTable_wksp(CTable_OffsetBits, OF_defaultNorm, MaxOff, OF_defaultNormLog, workspace, workspaceSize);
-+			Offtype = set_basic;
-+		} else {
-+			size_t nbSeq_1 = nbSeq;
-+			const U32 tableLog = FSE_optimalTableLog(OffFSELog, nbSeq, max);
-+			if (count[ofCodeTable[nbSeq - 1]] > 1) {
-+				count[ofCodeTable[nbSeq - 1]]--;
-+				nbSeq_1--;
-+			}
-+			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-+			{
-+				size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog); /* overflow protected */
-+				if (FSE_isError(NCountSize))
-+					return NCountSize;
-+				op += NCountSize;
-+			}
-+			FSE_buildCTable_wksp(CTable_OffsetBits, norm, max, tableLog, workspace, workspaceSize);
-+			Offtype = set_compressed;
-+		}
-+	}
-+
-+	/* CTable for MatchLengths */
-+	{
-+		U32 max = MaxML;
-+		size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, workspace);
-+		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-+			*op++ = *mlCodeTable;
-+			FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
-+			MLtype = set_rle;
-+		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-+			MLtype = set_repeat;
-+		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (ML_defaultNormLog - 1)))) {
-+			FSE_buildCTable_wksp(CTable_MatchLength, ML_defaultNorm, MaxML, ML_defaultNormLog, workspace, workspaceSize);
-+			MLtype = set_basic;
-+		} else {
-+			size_t nbSeq_1 = nbSeq;
-+			const U32 tableLog = FSE_optimalTableLog(MLFSELog, nbSeq, max);
-+			if (count[mlCodeTable[nbSeq - 1]] > 1) {
-+				count[mlCodeTable[nbSeq - 1]]--;
-+				nbSeq_1--;
-+			}
-+			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-+			{
-+				size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog); /* overflow protected */
-+				if (FSE_isError(NCountSize))
-+					return NCountSize;
-+				op += NCountSize;
-+			}
-+			FSE_buildCTable_wksp(CTable_MatchLength, norm, max, tableLog, workspace, workspaceSize);
-+			MLtype = set_compressed;
-+		}
-+	}
-+
-+	*seqHead = (BYTE)((LLtype << 6) + (Offtype << 4) + (MLtype << 2));
-+	zc->flagStaticTables = 0;
-+
-+	/* Encoding Sequences */
-+	{
-+		BIT_CStream_t blockStream;
-+		FSE_CState_t stateMatchLength;
-+		FSE_CState_t stateOffsetBits;
-+		FSE_CState_t stateLitLength;
-+
-+		CHECK_E(BIT_initCStream(&blockStream, op, oend - op), dstSize_tooSmall); /* not enough space remaining */
-+
-+		/* first symbols */
-+		FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq - 1]);
-+		FSE_initCState2(&stateOffsetBits, CTable_OffsetBits, ofCodeTable[nbSeq - 1]);
-+		FSE_initCState2(&stateLitLength, CTable_LitLength, llCodeTable[nbSeq - 1]);
-+		BIT_addBits(&blockStream, sequences[nbSeq - 1].litLength, LL_bits[llCodeTable[nbSeq - 1]]);
-+		if (ZSTD_32bits())
-+			BIT_flushBits(&blockStream);
-+		BIT_addBits(&blockStream, sequences[nbSeq - 1].matchLength, ML_bits[mlCodeTable[nbSeq - 1]]);
-+		if (ZSTD_32bits())
-+			BIT_flushBits(&blockStream);
-+		if (longOffsets) {
-+			U32 const ofBits = ofCodeTable[nbSeq - 1];
-+			int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN - 1);
-+			if (extraBits) {
-+				BIT_addBits(&blockStream, sequences[nbSeq - 1].offset, extraBits);
-+				BIT_flushBits(&blockStream);
-+			}
-+			BIT_addBits(&blockStream, sequences[nbSeq - 1].offset >> extraBits, ofBits - extraBits);
-+		} else {
-+			BIT_addBits(&blockStream, sequences[nbSeq - 1].offset, ofCodeTable[nbSeq - 1]);
-+		}
-+		BIT_flushBits(&blockStream);
-+
-+		{
-+			size_t n;
-+			for (n = nbSeq - 2; n < nbSeq; n--) { /* intentional underflow */
-+				BYTE const llCode = llCodeTable[n];
-+				BYTE const ofCode = ofCodeTable[n];
-+				BYTE const mlCode = mlCodeTable[n];
-+				U32 const llBits = LL_bits[llCode];
-+				U32 const ofBits = ofCode; /* 32b*/ /* 64b*/
-+				U32 const mlBits = ML_bits[mlCode];
-+				/* (7)*/							    /* (7)*/
-+				FSE_encodeSymbol(&blockStream, &stateOffsetBits, ofCode); /* 15 */  /* 15 */
-+				FSE_encodeSymbol(&blockStream, &stateMatchLength, mlCode); /* 24 */ /* 24 */
-+				if (ZSTD_32bits())
-+					BIT_flushBits(&blockStream);				  /* (7)*/
-+				FSE_encodeSymbol(&blockStream, &stateLitLength, llCode); /* 16 */ /* 33 */
-+				if (ZSTD_32bits() || (ofBits + mlBits + llBits >= 64 - 7 - (LLFSELog + MLFSELog + OffFSELog)))
-+					BIT_flushBits(&blockStream); /* (7)*/
-+				BIT_addBits(&blockStream, sequences[n].litLength, llBits);
-+				if (ZSTD_32bits() && ((llBits + mlBits) > 24))
-+					BIT_flushBits(&blockStream);
-+				BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
-+				if (ZSTD_32bits())
-+					BIT_flushBits(&blockStream); /* (7)*/
-+				if (longOffsets) {
-+					int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN - 1);
-+					if (extraBits) {
-+						BIT_addBits(&blockStream, sequences[n].offset, extraBits);
-+						BIT_flushBits(&blockStream); /* (7)*/
-+					}
-+					BIT_addBits(&blockStream, sequences[n].offset >> extraBits, ofBits - extraBits); /* 31 */
-+				} else {
-+					BIT_addBits(&blockStream, sequences[n].offset, ofBits); /* 31 */
-+				}
-+				BIT_flushBits(&blockStream); /* (7)*/
-+			}
-+		}
-+
-+		FSE_flushCState(&blockStream, &stateMatchLength);
-+		FSE_flushCState(&blockStream, &stateOffsetBits);
-+		FSE_flushCState(&blockStream, &stateLitLength);
-+
-+		{
-+			size_t const streamSize = BIT_closeCStream(&blockStream);
-+			if (streamSize == 0)
-+				return ERROR(dstSize_tooSmall); /* not enough space */
-+			op += streamSize;
-+		}
-+	}
-+	return op - ostart;
-+}
-+
-+ZSTD_STATIC size_t ZSTD_compressSequences(ZSTD_CCtx *zc, void *dst, size_t dstCapacity, size_t srcSize)
-+{
-+	size_t const cSize = ZSTD_compressSequences_internal(zc, dst, dstCapacity);
-+	size_t const minGain = ZSTD_minGain(srcSize);
-+	size_t const maxCSize = srcSize - minGain;
-+	/* If the srcSize <= dstCapacity, then there is enough space to write a
-+	 * raw uncompressed block. Since we ran out of space, the block must not
-+	 * be compressible, so fall back to a raw uncompressed block.
-+	 */
-+	int const uncompressibleError = cSize == ERROR(dstSize_tooSmall) && srcSize <= dstCapacity;
-+	int i;
-+
-+	if (ZSTD_isError(cSize) && !uncompressibleError)
-+		return cSize;
-+	if (cSize >= maxCSize || uncompressibleError) {
-+		zc->flagStaticHufTable = HUF_repeat_none;
-+		return 0;
-+	}
-+	/* confirm repcodes */
-+	for (i = 0; i < ZSTD_REP_NUM; i++)
-+		zc->rep[i] = zc->repToConfirm[i];
-+	return cSize;
-+}
-+
-+/*! ZSTD_storeSeq() :
-+	Store a sequence (literal length, literals, offset code and match length code) into seqStore_t.
-+	`offsetCode` : distance to match, or 0 == repCode.
-+	`matchCode` : matchLength - MINMATCH
-+*/
-+ZSTD_STATIC void ZSTD_storeSeq(seqStore_t *seqStorePtr, size_t litLength, const void *literals, U32 offsetCode, size_t matchCode)
-+{
-+	/* copy Literals */
-+	ZSTD_wildcopy(seqStorePtr->lit, literals, litLength);
-+	seqStorePtr->lit += litLength;
-+
-+	/* literal Length */
-+	if (litLength > 0xFFFF) {
-+		seqStorePtr->longLengthID = 1;
-+		seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-+	}
-+	seqStorePtr->sequences[0].litLength = (U16)litLength;
-+
-+	/* match offset */
-+	seqStorePtr->sequences[0].offset = offsetCode + 1;
-+
-+	/* match Length */
-+	if (matchCode > 0xFFFF) {
-+		seqStorePtr->longLengthID = 2;
-+		seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-+	}
-+	seqStorePtr->sequences[0].matchLength = (U16)matchCode;
-+
-+	seqStorePtr->sequences++;
-+}
-+
-+/*-*************************************
-+*  Match length counter
-+***************************************/
-+static unsigned ZSTD_NbCommonBytes(register size_t val)
-+{
-+	if (ZSTD_isLittleEndian()) {
-+		if (ZSTD_64bits()) {
-+			return (__builtin_ctzll((U64)val) >> 3);
-+		} else { /* 32 bits */
-+			return (__builtin_ctz((U32)val) >> 3);
-+		}
-+	} else { /* Big Endian CPU */
-+		if (ZSTD_64bits()) {
-+			return (__builtin_clzll(val) >> 3);
-+		} else { /* 32 bits */
-+			return (__builtin_clz((U32)val) >> 3);
-+		}
-+	}
-+}
-+
-+static size_t ZSTD_count(const BYTE *pIn, const BYTE *pMatch, const BYTE *const pInLimit)
-+{
-+	const BYTE *const pStart = pIn;
-+	const BYTE *const pInLoopLimit = pInLimit - (sizeof(size_t) - 1);
-+
-+	while (pIn < pInLoopLimit) {
-+		size_t const diff = ZSTD_readST(pMatch) ^ ZSTD_readST(pIn);
-+		if (!diff) {
-+			pIn += sizeof(size_t);
-+			pMatch += sizeof(size_t);
-+			continue;
-+		}
-+		pIn += ZSTD_NbCommonBytes(diff);
-+		return (size_t)(pIn - pStart);
-+	}
-+	if (ZSTD_64bits())
-+		if ((pIn < (pInLimit - 3)) && (ZSTD_read32(pMatch) == ZSTD_read32(pIn))) {
-+			pIn += 4;
-+			pMatch += 4;
-+		}
-+	if ((pIn < (pInLimit - 1)) && (ZSTD_read16(pMatch) == ZSTD_read16(pIn))) {
-+		pIn += 2;
-+		pMatch += 2;
-+	}
-+	if ((pIn < pInLimit) && (*pMatch == *pIn))
-+		pIn++;
-+	return (size_t)(pIn - pStart);
-+}
-+
-+/** ZSTD_count_2segments() :
-+*   can count match length with `ip` & `match` in 2 different segments.
-+*   convention : on reaching mEnd, match count continue starting from iStart
-+*/
-+static size_t ZSTD_count_2segments(const BYTE *ip, const BYTE *match, const BYTE *iEnd, const BYTE *mEnd, const BYTE *iStart)
-+{
-+	const BYTE *const vEnd = MIN(ip + (mEnd - match), iEnd);
-+	size_t const matchLength = ZSTD_count(ip, match, vEnd);
-+	if (match + matchLength != mEnd)
-+		return matchLength;
-+	return matchLength + ZSTD_count(ip + matchLength, iStart, iEnd);
-+}
-+
-+/*-*************************************
-+*  Hashes
-+***************************************/
-+static const U32 prime3bytes = 506832829U;
-+static U32 ZSTD_hash3(U32 u, U32 h) { return ((u << (32 - 24)) * prime3bytes) >> (32 - h); }
-+ZSTD_STATIC size_t ZSTD_hash3Ptr(const void *ptr, U32 h) { return ZSTD_hash3(ZSTD_readLE32(ptr), h); } /* only in zstd_opt.h */
-+
-+static const U32 prime4bytes = 2654435761U;
-+static U32 ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32 - h); }
-+static size_t ZSTD_hash4Ptr(const void *ptr, U32 h) { return ZSTD_hash4(ZSTD_read32(ptr), h); }
-+
-+static const U64 prime5bytes = 889523592379ULL;
-+static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u << (64 - 40)) * prime5bytes) >> (64 - h)); }
-+static size_t ZSTD_hash5Ptr(const void *p, U32 h) { return ZSTD_hash5(ZSTD_readLE64(p), h); }
-+
-+static const U64 prime6bytes = 227718039650203ULL;
-+static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u << (64 - 48)) * prime6bytes) >> (64 - h)); }
-+static size_t ZSTD_hash6Ptr(const void *p, U32 h) { return ZSTD_hash6(ZSTD_readLE64(p), h); }
-+
-+static const U64 prime7bytes = 58295818150454627ULL;
-+static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u << (64 - 56)) * prime7bytes) >> (64 - h)); }
-+static size_t ZSTD_hash7Ptr(const void *p, U32 h) { return ZSTD_hash7(ZSTD_readLE64(p), h); }
-+
-+static const U64 prime8bytes = 0xCF1BBCDCB7A56463ULL;
-+static size_t ZSTD_hash8(U64 u, U32 h) { return (size_t)(((u)*prime8bytes) >> (64 - h)); }
-+static size_t ZSTD_hash8Ptr(const void *p, U32 h) { return ZSTD_hash8(ZSTD_readLE64(p), h); }
-+
-+static size_t ZSTD_hashPtr(const void *p, U32 hBits, U32 mls)
-+{
-+	switch (mls) {
-+	// case 3: return ZSTD_hash3Ptr(p, hBits);
-+	default:
-+	case 4: return ZSTD_hash4Ptr(p, hBits);
-+	case 5: return ZSTD_hash5Ptr(p, hBits);
-+	case 6: return ZSTD_hash6Ptr(p, hBits);
-+	case 7: return ZSTD_hash7Ptr(p, hBits);
-+	case 8: return ZSTD_hash8Ptr(p, hBits);
-+	}
-+}
-+
-+/*-*************************************
-+*  Fast Scan
-+***************************************/
-+static void ZSTD_fillHashTable(ZSTD_CCtx *zc, const void *end, const U32 mls)
-+{
-+	U32 *const hashTable = zc->hashTable;
-+	U32 const hBits = zc->params.cParams.hashLog;
-+	const BYTE *const base = zc->base;
-+	const BYTE *ip = base + zc->nextToUpdate;
-+	const BYTE *const iend = ((const BYTE *)end) - HASH_READ_SIZE;
-+	const size_t fastHashFillStep = 3;
-+
-+	while (ip <= iend) {
-+		hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
-+		ip += fastHashFillStep;
-+	}
-+}
-+
-+FORCE_INLINE
-+void ZSTD_compressBlock_fast_generic(ZSTD_CCtx *cctx, const void *src, size_t srcSize, const U32 mls)
-+{
-+	U32 *const hashTable = cctx->hashTable;
-+	U32 const hBits = cctx->params.cParams.hashLog;
-+	seqStore_t *seqStorePtr = &(cctx->seqStore);
-+	const BYTE *const base = cctx->base;
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const U32 lowestIndex = cctx->dictLimit;
-+	const BYTE *const lowest = base + lowestIndex;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - HASH_READ_SIZE;
-+	U32 offset_1 = cctx->rep[0], offset_2 = cctx->rep[1];
-+	U32 offsetSaved = 0;
-+
-+	/* init */
-+	ip += (ip == lowest);
-+	{
-+		U32 const maxRep = (U32)(ip - lowest);
-+		if (offset_2 > maxRep)
-+			offsetSaved = offset_2, offset_2 = 0;
-+		if (offset_1 > maxRep)
-+			offsetSaved = offset_1, offset_1 = 0;
-+	}
-+
-+	/* Main Search Loop */
-+	while (ip < ilimit) { /* < instead of <=, because repcode check at (ip+1) */
-+		size_t mLength;
-+		size_t const h = ZSTD_hashPtr(ip, hBits, mls);
-+		U32 const curr = (U32)(ip - base);
-+		U32 const matchIndex = hashTable[h];
-+		const BYTE *match = base + matchIndex;
-+		hashTable[h] = curr; /* update hash table */
-+
-+		if ((offset_1 > 0) & (ZSTD_read32(ip + 1 - offset_1) == ZSTD_read32(ip + 1))) {
-+			mLength = ZSTD_count(ip + 1 + 4, ip + 1 + 4 - offset_1, iend) + 4;
-+			ip++;
-+			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-+		} else {
-+			U32 offset;
-+			if ((matchIndex <= lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) {
-+				ip += ((ip - anchor) >> g_searchStrength) + 1;
-+				continue;
-+			}
-+			mLength = ZSTD_count(ip + 4, match + 4, iend) + 4;
-+			offset = (U32)(ip - match);
-+			while (((ip > anchor) & (match > lowest)) && (ip[-1] == match[-1])) {
-+				ip--;
-+				match--;
-+				mLength++;
-+			} /* catch up */
-+			offset_2 = offset_1;
-+			offset_1 = offset;
-+
-+			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-+		}
-+
-+		/* match found */
-+		ip += mLength;
-+		anchor = ip;
-+
-+		if (ip <= ilimit) {
-+			/* Fill Table */
-+			hashTable[ZSTD_hashPtr(base + curr + 2, hBits, mls)] = curr + 2; /* here because curr+2 could be > iend-8 */
-+			hashTable[ZSTD_hashPtr(ip - 2, hBits, mls)] = (U32)(ip - 2 - base);
-+			/* check immediate repcode */
-+			while ((ip <= ilimit) && ((offset_2 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_2)))) {
-+				/* store sequence */
-+				size_t const rLength = ZSTD_count(ip + 4, ip + 4 - offset_2, iend) + 4;
-+				{
-+					U32 const tmpOff = offset_2;
-+					offset_2 = offset_1;
-+					offset_1 = tmpOff;
-+				} /* swap offset_2 <=> offset_1 */
-+				hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
-+				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength - MINMATCH);
-+				ip += rLength;
-+				anchor = ip;
-+				continue; /* faster when present ... (?) */
-+			}
-+		}
-+	}
-+
-+	/* save reps for next block */
-+	cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-+	cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_fast(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	const U32 mls = ctx->params.cParams.searchLength;
-+	switch (mls) {
-+	default: /* includes case 3 */
-+	case 4: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4); return;
-+	case 5: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 5); return;
-+	case 6: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 6); return;
-+	case 7: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 7); return;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 mls)
-+{
-+	U32 *hashTable = ctx->hashTable;
-+	const U32 hBits = ctx->params.cParams.hashLog;
-+	seqStore_t *seqStorePtr = &(ctx->seqStore);
-+	const BYTE *const base = ctx->base;
-+	const BYTE *const dictBase = ctx->dictBase;
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const U32 lowestIndex = ctx->lowLimit;
-+	const BYTE *const dictStart = dictBase + lowestIndex;
-+	const U32 dictLimit = ctx->dictLimit;
-+	const BYTE *const lowPrefixPtr = base + dictLimit;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - 8;
-+	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
-+
-+	/* Search Loop */
-+	while (ip < ilimit) { /* < instead of <=, because (ip+1) */
-+		const size_t h = ZSTD_hashPtr(ip, hBits, mls);
-+		const U32 matchIndex = hashTable[h];
-+		const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base;
-+		const BYTE *match = matchBase + matchIndex;
-+		const U32 curr = (U32)(ip - base);
-+		const U32 repIndex = curr + 1 - offset_1; /* offset_1 expected <= curr +1 */
-+		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
-+		const BYTE *repMatch = repBase + repIndex;
-+		size_t mLength;
-+		hashTable[h] = curr; /* update hash table */
-+
-+		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
-+		    (ZSTD_read32(repMatch) == ZSTD_read32(ip + 1))) {
-+			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-+			mLength = ZSTD_count_2segments(ip + 1 + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repMatchEnd, lowPrefixPtr) + EQUAL_READ32;
-+			ip++;
-+			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-+		} else {
-+			if ((matchIndex < lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) {
-+				ip += ((ip - anchor) >> g_searchStrength) + 1;
-+				continue;
-+			}
-+			{
-+				const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-+				const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-+				U32 offset;
-+				mLength = ZSTD_count_2segments(ip + EQUAL_READ32, match + EQUAL_READ32, iend, matchEnd, lowPrefixPtr) + EQUAL_READ32;
-+				while (((ip > anchor) & (match > lowMatchPtr)) && (ip[-1] == match[-1])) {
-+					ip--;
-+					match--;
-+					mLength++;
-+				} /* catch up */
-+				offset = curr - matchIndex;
-+				offset_2 = offset_1;
-+				offset_1 = offset;
-+				ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-+			}
-+		}
-+
-+		/* found a match : store it */
-+		ip += mLength;
-+		anchor = ip;
-+
-+		if (ip <= ilimit) {
-+			/* Fill Table */
-+			hashTable[ZSTD_hashPtr(base + curr + 2, hBits, mls)] = curr + 2;
-+			hashTable[ZSTD_hashPtr(ip - 2, hBits, mls)] = (U32)(ip - 2 - base);
-+			/* check immediate repcode */
-+			while (ip <= ilimit) {
-+				U32 const curr2 = (U32)(ip - base);
-+				U32 const repIndex2 = curr2 - offset_2;
-+				const BYTE *repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-+				if ((((U32)((dictLimit - 1) - repIndex2) >= 3) & (repIndex2 > lowestIndex)) /* intentional overflow */
-+				    && (ZSTD_read32(repMatch2) == ZSTD_read32(ip))) {
-+					const BYTE *const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-+					size_t repLength2 =
-+					    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch2 + EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
-+					U32 tmpOffset = offset_2;
-+					offset_2 = offset_1;
-+					offset_1 = tmpOffset; /* swap offset_2 <=> offset_1 */
-+					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2 - MINMATCH);
-+					hashTable[ZSTD_hashPtr(ip, hBits, mls)] = curr2;
-+					ip += repLength2;
-+					anchor = ip;
-+					continue;
-+				}
-+				break;
-+			}
-+		}
-+	}
-+
-+	/* save reps for next block */
-+	ctx->repToConfirm[0] = offset_1;
-+	ctx->repToConfirm[1] = offset_2;
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_fast_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	U32 const mls = ctx->params.cParams.searchLength;
-+	switch (mls) {
-+	default: /* includes case 3 */
-+	case 4: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4); return;
-+	case 5: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 5); return;
-+	case 6: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 6); return;
-+	case 7: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 7); return;
-+	}
-+}
-+
-+/*-*************************************
-+*  Double Fast
-+***************************************/
-+static void ZSTD_fillDoubleHashTable(ZSTD_CCtx *cctx, const void *end, const U32 mls)
-+{
-+	U32 *const hashLarge = cctx->hashTable;
-+	U32 const hBitsL = cctx->params.cParams.hashLog;
-+	U32 *const hashSmall = cctx->chainTable;
-+	U32 const hBitsS = cctx->params.cParams.chainLog;
-+	const BYTE *const base = cctx->base;
-+	const BYTE *ip = base + cctx->nextToUpdate;
-+	const BYTE *const iend = ((const BYTE *)end) - HASH_READ_SIZE;
-+	const size_t fastHashFillStep = 3;
-+
-+	while (ip <= iend) {
-+		hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
-+		hashLarge[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
-+		ip += fastHashFillStep;
-+	}
-+}
-+
-+FORCE_INLINE
-+void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx *cctx, const void *src, size_t srcSize, const U32 mls)
-+{
-+	U32 *const hashLong = cctx->hashTable;
-+	const U32 hBitsL = cctx->params.cParams.hashLog;
-+	U32 *const hashSmall = cctx->chainTable;
-+	const U32 hBitsS = cctx->params.cParams.chainLog;
-+	seqStore_t *seqStorePtr = &(cctx->seqStore);
-+	const BYTE *const base = cctx->base;
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const U32 lowestIndex = cctx->dictLimit;
-+	const BYTE *const lowest = base + lowestIndex;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - HASH_READ_SIZE;
-+	U32 offset_1 = cctx->rep[0], offset_2 = cctx->rep[1];
-+	U32 offsetSaved = 0;
-+
-+	/* init */
-+	ip += (ip == lowest);
-+	{
-+		U32 const maxRep = (U32)(ip - lowest);
-+		if (offset_2 > maxRep)
-+			offsetSaved = offset_2, offset_2 = 0;
-+		if (offset_1 > maxRep)
-+			offsetSaved = offset_1, offset_1 = 0;
-+	}
-+
-+	/* Main Search Loop */
-+	while (ip < ilimit) { /* < instead of <=, because repcode check at (ip+1) */
-+		size_t mLength;
-+		size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
-+		size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
-+		U32 const curr = (U32)(ip - base);
-+		U32 const matchIndexL = hashLong[h2];
-+		U32 const matchIndexS = hashSmall[h];
-+		const BYTE *matchLong = base + matchIndexL;
-+		const BYTE *match = base + matchIndexS;
-+		hashLong[h2] = hashSmall[h] = curr; /* update hash tables */
-+
-+		if ((offset_1 > 0) & (ZSTD_read32(ip + 1 - offset_1) == ZSTD_read32(ip + 1))) { /* note : by construction, offset_1 <= curr */
-+			mLength = ZSTD_count(ip + 1 + 4, ip + 1 + 4 - offset_1, iend) + 4;
-+			ip++;
-+			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-+		} else {
-+			U32 offset;
-+			if ((matchIndexL > lowestIndex) && (ZSTD_read64(matchLong) == ZSTD_read64(ip))) {
-+				mLength = ZSTD_count(ip + 8, matchLong + 8, iend) + 8;
-+				offset = (U32)(ip - matchLong);
-+				while (((ip > anchor) & (matchLong > lowest)) && (ip[-1] == matchLong[-1])) {
-+					ip--;
-+					matchLong--;
-+					mLength++;
-+				} /* catch up */
-+			} else if ((matchIndexS > lowestIndex) && (ZSTD_read32(match) == ZSTD_read32(ip))) {
-+				size_t const h3 = ZSTD_hashPtr(ip + 1, hBitsL, 8);
-+				U32 const matchIndex3 = hashLong[h3];
-+				const BYTE *match3 = base + matchIndex3;
-+				hashLong[h3] = curr + 1;
-+				if ((matchIndex3 > lowestIndex) && (ZSTD_read64(match3) == ZSTD_read64(ip + 1))) {
-+					mLength = ZSTD_count(ip + 9, match3 + 8, iend) + 8;
-+					ip++;
-+					offset = (U32)(ip - match3);
-+					while (((ip > anchor) & (match3 > lowest)) && (ip[-1] == match3[-1])) {
-+						ip--;
-+						match3--;
-+						mLength++;
-+					} /* catch up */
-+				} else {
-+					mLength = ZSTD_count(ip + 4, match + 4, iend) + 4;
-+					offset = (U32)(ip - match);
-+					while (((ip > anchor) & (match > lowest)) && (ip[-1] == match[-1])) {
-+						ip--;
-+						match--;
-+						mLength++;
-+					} /* catch up */
-+				}
-+			} else {
-+				ip += ((ip - anchor) >> g_searchStrength) + 1;
-+				continue;
-+			}
-+
-+			offset_2 = offset_1;
-+			offset_1 = offset;
-+
-+			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-+		}
-+
-+		/* match found */
-+		ip += mLength;
-+		anchor = ip;
-+
-+		if (ip <= ilimit) {
-+			/* Fill Table */
-+			hashLong[ZSTD_hashPtr(base + curr + 2, hBitsL, 8)] = hashSmall[ZSTD_hashPtr(base + curr + 2, hBitsS, mls)] =
-+			    curr + 2; /* here because curr+2 could be > iend-8 */
-+			hashLong[ZSTD_hashPtr(ip - 2, hBitsL, 8)] = hashSmall[ZSTD_hashPtr(ip - 2, hBitsS, mls)] = (U32)(ip - 2 - base);
-+
-+			/* check immediate repcode */
-+			while ((ip <= ilimit) && ((offset_2 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_2)))) {
-+				/* store sequence */
-+				size_t const rLength = ZSTD_count(ip + 4, ip + 4 - offset_2, iend) + 4;
-+				{
-+					U32 const tmpOff = offset_2;
-+					offset_2 = offset_1;
-+					offset_1 = tmpOff;
-+				} /* swap offset_2 <=> offset_1 */
-+				hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
-+				hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
-+				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength - MINMATCH);
-+				ip += rLength;
-+				anchor = ip;
-+				continue; /* faster when present ... (?) */
-+			}
-+		}
-+	}
-+
-+	/* save reps for next block */
-+	cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-+	cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_doubleFast(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	const U32 mls = ctx->params.cParams.searchLength;
-+	switch (mls) {
-+	default: /* includes case 3 */
-+	case 4: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4); return;
-+	case 5: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 5); return;
-+	case 6: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 6); return;
-+	case 7: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 7); return;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 mls)
-+{
-+	U32 *const hashLong = ctx->hashTable;
-+	U32 const hBitsL = ctx->params.cParams.hashLog;
-+	U32 *const hashSmall = ctx->chainTable;
-+	U32 const hBitsS = ctx->params.cParams.chainLog;
-+	seqStore_t *seqStorePtr = &(ctx->seqStore);
-+	const BYTE *const base = ctx->base;
-+	const BYTE *const dictBase = ctx->dictBase;
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const U32 lowestIndex = ctx->lowLimit;
-+	const BYTE *const dictStart = dictBase + lowestIndex;
-+	const U32 dictLimit = ctx->dictLimit;
-+	const BYTE *const lowPrefixPtr = base + dictLimit;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - 8;
-+	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
-+
-+	/* Search Loop */
-+	while (ip < ilimit) { /* < instead of <=, because (ip+1) */
-+		const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
-+		const U32 matchIndex = hashSmall[hSmall];
-+		const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base;
-+		const BYTE *match = matchBase + matchIndex;
-+
-+		const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
-+		const U32 matchLongIndex = hashLong[hLong];
-+		const BYTE *matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
-+		const BYTE *matchLong = matchLongBase + matchLongIndex;
-+
-+		const U32 curr = (U32)(ip - base);
-+		const U32 repIndex = curr + 1 - offset_1; /* offset_1 expected <= curr +1 */
-+		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
-+		const BYTE *repMatch = repBase + repIndex;
-+		size_t mLength;
-+		hashSmall[hSmall] = hashLong[hLong] = curr; /* update hash table */
-+
-+		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
-+		    (ZSTD_read32(repMatch) == ZSTD_read32(ip + 1))) {
-+			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-+			mLength = ZSTD_count_2segments(ip + 1 + 4, repMatch + 4, iend, repMatchEnd, lowPrefixPtr) + 4;
-+			ip++;
-+			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-+		} else {
-+			if ((matchLongIndex > lowestIndex) && (ZSTD_read64(matchLong) == ZSTD_read64(ip))) {
-+				const BYTE *matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
-+				const BYTE *lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
-+				U32 offset;
-+				mLength = ZSTD_count_2segments(ip + 8, matchLong + 8, iend, matchEnd, lowPrefixPtr) + 8;
-+				offset = curr - matchLongIndex;
-+				while (((ip > anchor) & (matchLong > lowMatchPtr)) && (ip[-1] == matchLong[-1])) {
-+					ip--;
-+					matchLong--;
-+					mLength++;
-+				} /* catch up */
-+				offset_2 = offset_1;
-+				offset_1 = offset;
-+				ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-+
-+			} else if ((matchIndex > lowestIndex) && (ZSTD_read32(match) == ZSTD_read32(ip))) {
-+				size_t const h3 = ZSTD_hashPtr(ip + 1, hBitsL, 8);
-+				U32 const matchIndex3 = hashLong[h3];
-+				const BYTE *const match3Base = matchIndex3 < dictLimit ? dictBase : base;
-+				const BYTE *match3 = match3Base + matchIndex3;
-+				U32 offset;
-+				hashLong[h3] = curr + 1;
-+				if ((matchIndex3 > lowestIndex) && (ZSTD_read64(match3) == ZSTD_read64(ip + 1))) {
-+					const BYTE *matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
-+					const BYTE *lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
-+					mLength = ZSTD_count_2segments(ip + 9, match3 + 8, iend, matchEnd, lowPrefixPtr) + 8;
-+					ip++;
-+					offset = curr + 1 - matchIndex3;
-+					while (((ip > anchor) & (match3 > lowMatchPtr)) && (ip[-1] == match3[-1])) {
-+						ip--;
-+						match3--;
-+						mLength++;
-+					} /* catch up */
-+				} else {
-+					const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-+					const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-+					mLength = ZSTD_count_2segments(ip + 4, match + 4, iend, matchEnd, lowPrefixPtr) + 4;
-+					offset = curr - matchIndex;
-+					while (((ip > anchor) & (match > lowMatchPtr)) && (ip[-1] == match[-1])) {
-+						ip--;
-+						match--;
-+						mLength++;
-+					} /* catch up */
-+				}
-+				offset_2 = offset_1;
-+				offset_1 = offset;
-+				ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-+
-+			} else {
-+				ip += ((ip - anchor) >> g_searchStrength) + 1;
-+				continue;
-+			}
-+		}
-+
-+		/* found a match : store it */
-+		ip += mLength;
-+		anchor = ip;
-+
-+		if (ip <= ilimit) {
-+			/* Fill Table */
-+			hashSmall[ZSTD_hashPtr(base + curr + 2, hBitsS, mls)] = curr + 2;
-+			hashLong[ZSTD_hashPtr(base + curr + 2, hBitsL, 8)] = curr + 2;
-+			hashSmall[ZSTD_hashPtr(ip - 2, hBitsS, mls)] = (U32)(ip - 2 - base);
-+			hashLong[ZSTD_hashPtr(ip - 2, hBitsL, 8)] = (U32)(ip - 2 - base);
-+			/* check immediate repcode */
-+			while (ip <= ilimit) {
-+				U32 const curr2 = (U32)(ip - base);
-+				U32 const repIndex2 = curr2 - offset_2;
-+				const BYTE *repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-+				if ((((U32)((dictLimit - 1) - repIndex2) >= 3) & (repIndex2 > lowestIndex)) /* intentional overflow */
-+				    && (ZSTD_read32(repMatch2) == ZSTD_read32(ip))) {
-+					const BYTE *const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-+					size_t const repLength2 =
-+					    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch2 + EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
-+					U32 tmpOffset = offset_2;
-+					offset_2 = offset_1;
-+					offset_1 = tmpOffset; /* swap offset_2 <=> offset_1 */
-+					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2 - MINMATCH);
-+					hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = curr2;
-+					hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = curr2;
-+					ip += repLength2;
-+					anchor = ip;
-+					continue;
-+				}
-+				break;
-+			}
-+		}
-+	}
-+
-+	/* save reps for next block */
-+	ctx->repToConfirm[0] = offset_1;
-+	ctx->repToConfirm[1] = offset_2;
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	U32 const mls = ctx->params.cParams.searchLength;
-+	switch (mls) {
-+	default: /* includes case 3 */
-+	case 4: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4); return;
-+	case 5: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 5); return;
-+	case 6: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 6); return;
-+	case 7: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 7); return;
-+	}
-+}
-+
-+/*-*************************************
-+*  Binary Tree search
-+***************************************/
-+/** ZSTD_insertBt1() : add one or multiple positions to tree.
-+*   ip : assumed <= iend-8 .
-+*   @return : nb of positions added */
-+static U32 ZSTD_insertBt1(ZSTD_CCtx *zc, const BYTE *const ip, const U32 mls, const BYTE *const iend, U32 nbCompares, U32 extDict)
-+{
-+	U32 *const hashTable = zc->hashTable;
-+	U32 const hashLog = zc->params.cParams.hashLog;
-+	size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
-+	U32 *const bt = zc->chainTable;
-+	U32 const btLog = zc->params.cParams.chainLog - 1;
-+	U32 const btMask = (1 << btLog) - 1;
-+	U32 matchIndex = hashTable[h];
-+	size_t commonLengthSmaller = 0, commonLengthLarger = 0;
-+	const BYTE *const base = zc->base;
-+	const BYTE *const dictBase = zc->dictBase;
-+	const U32 dictLimit = zc->dictLimit;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const BYTE *const prefixStart = base + dictLimit;
-+	const BYTE *match;
-+	const U32 curr = (U32)(ip - base);
-+	const U32 btLow = btMask >= curr ? 0 : curr - btMask;
-+	U32 *smallerPtr = bt + 2 * (curr & btMask);
-+	U32 *largerPtr = smallerPtr + 1;
-+	U32 dummy32; /* to be nullified at the end */
-+	U32 const windowLow = zc->lowLimit;
-+	U32 matchEndIdx = curr + 8;
-+	size_t bestLength = 8;
-+
-+	hashTable[h] = curr; /* Update Hash Table */
-+
-+	while (nbCompares-- && (matchIndex > windowLow)) {
-+		U32 *const nextPtr = bt + 2 * (matchIndex & btMask);
-+		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
-+
-+		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
-+			match = base + matchIndex;
-+			if (match[matchLength] == ip[matchLength])
-+				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iend) + 1;
-+		} else {
-+			match = dictBase + matchIndex;
-+			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iend, dictEnd, prefixStart);
-+			if (matchIndex + matchLength >= dictLimit)
-+				match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
-+		}
-+
-+		if (matchLength > bestLength) {
-+			bestLength = matchLength;
-+			if (matchLength > matchEndIdx - matchIndex)
-+				matchEndIdx = matchIndex + (U32)matchLength;
-+		}
-+
-+		if (ip + matchLength == iend) /* equal : no way to know if inf or sup */
-+			break;		      /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt the tree */
-+
-+		if (match[matchLength] < ip[matchLength]) { /* necessarily within correct buffer */
-+			/* match is smaller than curr */
-+			*smallerPtr = matchIndex;	  /* update smaller idx */
-+			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
-+			if (matchIndex <= btLow) {
-+				smallerPtr = &dummy32;
-+				break;
-+			}			  /* beyond tree size, stop the search */
-+			smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */
-+			matchIndex = nextPtr[1];  /* new matchIndex larger than previous (closer to curr) */
-+		} else {
-+			/* match is larger than curr */
-+			*largerPtr = matchIndex;
-+			commonLengthLarger = matchLength;
-+			if (matchIndex <= btLow) {
-+				largerPtr = &dummy32;
-+				break;
-+			} /* beyond tree size, stop the search */
-+			largerPtr = nextPtr;
-+			matchIndex = nextPtr[0];
-+		}
-+	}
-+
-+	*smallerPtr = *largerPtr = 0;
-+	if (bestLength > 384)
-+		return MIN(192, (U32)(bestLength - 384)); /* speed optimization */
-+	if (matchEndIdx > curr + 8)
-+		return matchEndIdx - curr - 8;
-+	return 1;
-+}
-+
-+static size_t ZSTD_insertBtAndFindBestMatch(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, size_t *offsetPtr, U32 nbCompares, const U32 mls,
-+					    U32 extDict)
-+{
-+	U32 *const hashTable = zc->hashTable;
-+	U32 const hashLog = zc->params.cParams.hashLog;
-+	size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
-+	U32 *const bt = zc->chainTable;
-+	U32 const btLog = zc->params.cParams.chainLog - 1;
-+	U32 const btMask = (1 << btLog) - 1;
-+	U32 matchIndex = hashTable[h];
-+	size_t commonLengthSmaller = 0, commonLengthLarger = 0;
-+	const BYTE *const base = zc->base;
-+	const BYTE *const dictBase = zc->dictBase;
-+	const U32 dictLimit = zc->dictLimit;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const BYTE *const prefixStart = base + dictLimit;
-+	const U32 curr = (U32)(ip - base);
-+	const U32 btLow = btMask >= curr ? 0 : curr - btMask;
-+	const U32 windowLow = zc->lowLimit;
-+	U32 *smallerPtr = bt + 2 * (curr & btMask);
-+	U32 *largerPtr = bt + 2 * (curr & btMask) + 1;
-+	U32 matchEndIdx = curr + 8;
-+	U32 dummy32; /* to be nullified at the end */
-+	size_t bestLength = 0;
-+
-+	hashTable[h] = curr; /* Update Hash Table */
-+
-+	while (nbCompares-- && (matchIndex > windowLow)) {
-+		U32 *const nextPtr = bt + 2 * (matchIndex & btMask);
-+		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
-+		const BYTE *match;
-+
-+		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
-+			match = base + matchIndex;
-+			if (match[matchLength] == ip[matchLength])
-+				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iend) + 1;
-+		} else {
-+			match = dictBase + matchIndex;
-+			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iend, dictEnd, prefixStart);
-+			if (matchIndex + matchLength >= dictLimit)
-+				match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
-+		}
-+
-+		if (matchLength > bestLength) {
-+			if (matchLength > matchEndIdx - matchIndex)
-+				matchEndIdx = matchIndex + (U32)matchLength;
-+			if ((4 * (int)(matchLength - bestLength)) > (int)(ZSTD_highbit32(curr - matchIndex + 1) - ZSTD_highbit32((U32)offsetPtr[0] + 1)))
-+				bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + curr - matchIndex;
-+			if (ip + matchLength == iend) /* equal : no way to know if inf or sup */
-+				break;		      /* drop, to guarantee consistency (miss a little bit of compression) */
-+		}
-+
-+		if (match[matchLength] < ip[matchLength]) {
-+			/* match is smaller than curr */
-+			*smallerPtr = matchIndex;	  /* update smaller idx */
-+			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
-+			if (matchIndex <= btLow) {
-+				smallerPtr = &dummy32;
-+				break;
-+			}			  /* beyond tree size, stop the search */
-+			smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */
-+			matchIndex = nextPtr[1];  /* new matchIndex larger than previous (closer to curr) */
-+		} else {
-+			/* match is larger than curr */
-+			*largerPtr = matchIndex;
-+			commonLengthLarger = matchLength;
-+			if (matchIndex <= btLow) {
-+				largerPtr = &dummy32;
-+				break;
-+			} /* beyond tree size, stop the search */
-+			largerPtr = nextPtr;
-+			matchIndex = nextPtr[0];
-+		}
-+	}
-+
-+	*smallerPtr = *largerPtr = 0;
-+
-+	zc->nextToUpdate = (matchEndIdx > curr + 8) ? matchEndIdx - 8 : curr + 1;
-+	return bestLength;
-+}
-+
-+static void ZSTD_updateTree(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, const U32 nbCompares, const U32 mls)
-+{
-+	const BYTE *const base = zc->base;
-+	const U32 target = (U32)(ip - base);
-+	U32 idx = zc->nextToUpdate;
-+
-+	while (idx < target)
-+		idx += ZSTD_insertBt1(zc, base + idx, mls, iend, nbCompares, 0);
-+}
-+
-+/** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
-+static size_t ZSTD_BtFindBestMatch(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls)
-+{
-+	if (ip < zc->base + zc->nextToUpdate)
-+		return 0; /* skipped area */
-+	ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-+	return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0);
-+}
-+
-+static size_t ZSTD_BtFindBestMatch_selectMLS(ZSTD_CCtx *zc, /* Index table will be updated */
-+					     const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch)
-+{
-+	switch (matchLengthSearch) {
-+	default: /* includes case 3 */
-+	case 4: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-+	case 5: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-+	case 7:
-+	case 6: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-+	}
-+}
-+
-+static void ZSTD_updateTree_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, const U32 nbCompares, const U32 mls)
-+{
-+	const BYTE *const base = zc->base;
-+	const U32 target = (U32)(ip - base);
-+	U32 idx = zc->nextToUpdate;
-+
-+	while (idx < target)
-+		idx += ZSTD_insertBt1(zc, base + idx, mls, iend, nbCompares, 1);
-+}
-+
-+/** Tree updater, providing best match */
-+static size_t ZSTD_BtFindBestMatch_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-+					   const U32 mls)
-+{
-+	if (ip < zc->base + zc->nextToUpdate)
-+		return 0; /* skipped area */
-+	ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-+	return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1);
-+}
-+
-+static size_t ZSTD_BtFindBestMatch_selectMLS_extDict(ZSTD_CCtx *zc, /* Index table will be updated */
-+						     const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-+						     const U32 matchLengthSearch)
-+{
-+	switch (matchLengthSearch) {
-+	default: /* includes case 3 */
-+	case 4: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-+	case 5: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-+	case 7:
-+	case 6: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-+	}
-+}
-+
-+/* *********************************
-+*  Hash Chain
-+***********************************/
-+#define NEXT_IN_CHAIN(d, mask) chainTable[(d)&mask]
-+
-+/* Update chains up to ip (excluded)
-+   Assumption : always within prefix (i.e. not within extDict) */
-+FORCE_INLINE
-+U32 ZSTD_insertAndFindFirstIndex(ZSTD_CCtx *zc, const BYTE *ip, U32 mls)
-+{
-+	U32 *const hashTable = zc->hashTable;
-+	const U32 hashLog = zc->params.cParams.hashLog;
-+	U32 *const chainTable = zc->chainTable;
-+	const U32 chainMask = (1 << zc->params.cParams.chainLog) - 1;
-+	const BYTE *const base = zc->base;
-+	const U32 target = (U32)(ip - base);
-+	U32 idx = zc->nextToUpdate;
-+
-+	while (idx < target) { /* catch up */
-+		size_t const h = ZSTD_hashPtr(base + idx, hashLog, mls);
-+		NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
-+		hashTable[h] = idx;
-+		idx++;
-+	}
-+
-+	zc->nextToUpdate = target;
-+	return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
-+}
-+
-+/* inlining is important to hardwire a hot branch (template emulation) */
-+FORCE_INLINE
-+size_t ZSTD_HcFindBestMatch_generic(ZSTD_CCtx *zc, /* Index table will be updated */
-+				    const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls,
-+				    const U32 extDict)
-+{
-+	U32 *const chainTable = zc->chainTable;
-+	const U32 chainSize = (1 << zc->params.cParams.chainLog);
-+	const U32 chainMask = chainSize - 1;
-+	const BYTE *const base = zc->base;
-+	const BYTE *const dictBase = zc->dictBase;
-+	const U32 dictLimit = zc->dictLimit;
-+	const BYTE *const prefixStart = base + dictLimit;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const U32 lowLimit = zc->lowLimit;
-+	const U32 curr = (U32)(ip - base);
-+	const U32 minChain = curr > chainSize ? curr - chainSize : 0;
-+	int nbAttempts = maxNbAttempts;
-+	size_t ml = EQUAL_READ32 - 1;
-+
-+	/* HC4 match finder */
-+	U32 matchIndex = ZSTD_insertAndFindFirstIndex(zc, ip, mls);
-+
-+	for (; (matchIndex > lowLimit) & (nbAttempts > 0); nbAttempts--) {
-+		const BYTE *match;
-+		size_t currMl = 0;
-+		if ((!extDict) || matchIndex >= dictLimit) {
-+			match = base + matchIndex;
-+			if (match[ml] == ip[ml]) /* potentially better */
-+				currMl = ZSTD_count(ip, match, iLimit);
-+		} else {
-+			match = dictBase + matchIndex;
-+			if (ZSTD_read32(match) == ZSTD_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
-+				currMl = ZSTD_count_2segments(ip + EQUAL_READ32, match + EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32;
-+		}
-+
-+		/* save best solution */
-+		if (currMl > ml) {
-+			ml = currMl;
-+			*offsetPtr = curr - matchIndex + ZSTD_REP_MOVE;
-+			if (ip + currMl == iLimit)
-+				break; /* best possible, and avoid read overflow*/
-+		}
-+
-+		if (matchIndex <= minChain)
-+			break;
-+		matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
-+	}
-+
-+	return ml;
-+}
-+
-+FORCE_INLINE size_t ZSTD_HcFindBestMatch_selectMLS(ZSTD_CCtx *zc, const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-+						   const U32 matchLengthSearch)
-+{
-+	switch (matchLengthSearch) {
-+	default: /* includes case 3 */
-+	case 4: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
-+	case 5: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
-+	case 7:
-+	case 6: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
-+	}
-+}
-+
-+FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS(ZSTD_CCtx *zc, const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-+							   const U32 matchLengthSearch)
-+{
-+	switch (matchLengthSearch) {
-+	default: /* includes case 3 */
-+	case 4: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
-+	case 5: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
-+	case 7:
-+	case 6: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
-+	}
-+}
-+
-+/* *******************************
-+*  Common parser - lazy strategy
-+*********************************/
-+FORCE_INLINE
-+void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 searchMethod, const U32 depth)
-+{
-+	seqStore_t *seqStorePtr = &(ctx->seqStore);
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - 8;
-+	const BYTE *const base = ctx->base + ctx->dictLimit;
-+
-+	U32 const maxSearches = 1 << ctx->params.cParams.searchLog;
-+	U32 const mls = ctx->params.cParams.searchLength;
-+
-+	typedef size_t (*searchMax_f)(ZSTD_CCtx * zc, const BYTE *ip, const BYTE *iLimit, size_t *offsetPtr, U32 maxNbAttempts, U32 matchLengthSearch);
-+	searchMax_f const searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS : ZSTD_HcFindBestMatch_selectMLS;
-+	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1], savedOffset = 0;
-+
-+	/* init */
-+	ip += (ip == base);
-+	ctx->nextToUpdate3 = ctx->nextToUpdate;
-+	{
-+		U32 const maxRep = (U32)(ip - base);
-+		if (offset_2 > maxRep)
-+			savedOffset = offset_2, offset_2 = 0;
-+		if (offset_1 > maxRep)
-+			savedOffset = offset_1, offset_1 = 0;
-+	}
-+
-+	/* Match Loop */
-+	while (ip < ilimit) {
-+		size_t matchLength = 0;
-+		size_t offset = 0;
-+		const BYTE *start = ip + 1;
-+
-+		/* check repCode */
-+		if ((offset_1 > 0) & (ZSTD_read32(ip + 1) == ZSTD_read32(ip + 1 - offset_1))) {
-+			/* repcode : we take it */
-+			matchLength = ZSTD_count(ip + 1 + EQUAL_READ32, ip + 1 + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
-+			if (depth == 0)
-+				goto _storeSequence;
-+		}
-+
-+		/* first search (depth 0) */
-+		{
-+			size_t offsetFound = 99999999;
-+			size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-+			if (ml2 > matchLength)
-+				matchLength = ml2, start = ip, offset = offsetFound;
-+		}
-+
-+		if (matchLength < EQUAL_READ32) {
-+			ip += ((ip - anchor) >> g_searchStrength) + 1; /* jump faster over incompressible sections */
-+			continue;
-+		}
-+
-+		/* let's try to find a better solution */
-+		if (depth >= 1)
-+			while (ip < ilimit) {
-+				ip++;
-+				if ((offset) && ((offset_1 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_1)))) {
-+					size_t const mlRep = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
-+					int const gain2 = (int)(mlRep * 3);
-+					int const gain1 = (int)(matchLength * 3 - ZSTD_highbit32((U32)offset + 1) + 1);
-+					if ((mlRep >= EQUAL_READ32) && (gain2 > gain1))
-+						matchLength = mlRep, offset = 0, start = ip;
-+				}
-+				{
-+					size_t offset2 = 99999999;
-+					size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-+					int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-+					int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 4);
-+					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-+						matchLength = ml2, offset = offset2, start = ip;
-+						continue; /* search a better one */
-+					}
-+				}
-+
-+				/* let's find an even better one */
-+				if ((depth == 2) && (ip < ilimit)) {
-+					ip++;
-+					if ((offset) && ((offset_1 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_1)))) {
-+						size_t const ml2 = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
-+						int const gain2 = (int)(ml2 * 4);
-+						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 1);
-+						if ((ml2 >= EQUAL_READ32) && (gain2 > gain1))
-+							matchLength = ml2, offset = 0, start = ip;
-+					}
-+					{
-+						size_t offset2 = 99999999;
-+						size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-+						int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-+						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 7);
-+						if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-+							matchLength = ml2, offset = offset2, start = ip;
-+							continue;
-+						}
-+					}
-+				}
-+				break; /* nothing found : store previous solution */
-+			}
-+
-+		/* NOTE:
-+		 * start[-offset+ZSTD_REP_MOVE-1] is undefined behavior.
-+		 * (-offset+ZSTD_REP_MOVE-1) is unsigned, and is added to start, which
-+		 * overflows the pointer, which is undefined behavior.
-+		 */
-+		/* catch up */
-+		if (offset) {
-+			while ((start > anchor) && (start > base + offset - ZSTD_REP_MOVE) &&
-+			       (start[-1] == (start-offset+ZSTD_REP_MOVE)[-1])) /* only search for offset within prefix */
-+			{
-+				start--;
-+				matchLength++;
-+			}
-+			offset_2 = offset_1;
-+			offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-+		}
-+
-+	/* store sequence */
-+_storeSequence:
-+		{
-+			size_t const litLength = start - anchor;
-+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength - MINMATCH);
-+			anchor = ip = start + matchLength;
-+		}
-+
-+		/* check immediate repcode */
-+		while ((ip <= ilimit) && ((offset_2 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_2)))) {
-+			/* store sequence */
-+			matchLength = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_2, iend) + EQUAL_READ32;
-+			offset = offset_2;
-+			offset_2 = offset_1;
-+			offset_1 = (U32)offset; /* swap repcodes */
-+			ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength - MINMATCH);
-+			ip += matchLength;
-+			anchor = ip;
-+			continue; /* faster when present ... (?) */
-+		}
-+	}
-+
-+	/* Save reps for next block */
-+	ctx->repToConfirm[0] = offset_1 ? offset_1 : savedOffset;
-+	ctx->repToConfirm[1] = offset_2 ? offset_2 : savedOffset;
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+static void ZSTD_compressBlock_btlazy2(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 1, 2); }
-+
-+static void ZSTD_compressBlock_lazy2(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 2); }
-+
-+static void ZSTD_compressBlock_lazy(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 1); }
-+
-+static void ZSTD_compressBlock_greedy(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 0); }
-+
-+FORCE_INLINE
-+void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 searchMethod, const U32 depth)
-+{
-+	seqStore_t *seqStorePtr = &(ctx->seqStore);
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - 8;
-+	const BYTE *const base = ctx->base;
-+	const U32 dictLimit = ctx->dictLimit;
-+	const U32 lowestIndex = ctx->lowLimit;
-+	const BYTE *const prefixStart = base + dictLimit;
-+	const BYTE *const dictBase = ctx->dictBase;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const BYTE *const dictStart = dictBase + ctx->lowLimit;
-+
-+	const U32 maxSearches = 1 << ctx->params.cParams.searchLog;
-+	const U32 mls = ctx->params.cParams.searchLength;
-+
-+	typedef size_t (*searchMax_f)(ZSTD_CCtx * zc, const BYTE *ip, const BYTE *iLimit, size_t *offsetPtr, U32 maxNbAttempts, U32 matchLengthSearch);
-+	searchMax_f searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS_extDict : ZSTD_HcFindBestMatch_extDict_selectMLS;
-+
-+	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
-+
-+	/* init */
-+	ctx->nextToUpdate3 = ctx->nextToUpdate;
-+	ip += (ip == prefixStart);
-+
-+	/* Match Loop */
-+	while (ip < ilimit) {
-+		size_t matchLength = 0;
-+		size_t offset = 0;
-+		const BYTE *start = ip + 1;
-+		U32 curr = (U32)(ip - base);
-+
-+		/* check repCode */
-+		{
-+			const U32 repIndex = (U32)(curr + 1 - offset_1);
-+			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-+			const BYTE *const repMatch = repBase + repIndex;
-+			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-+				if (ZSTD_read32(ip + 1) == ZSTD_read32(repMatch)) {
-+					/* repcode detected we should take it */
-+					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-+					matchLength =
-+					    ZSTD_count_2segments(ip + 1 + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-+					if (depth == 0)
-+						goto _storeSequence;
-+				}
-+		}
-+
-+		/* first search (depth 0) */
-+		{
-+			size_t offsetFound = 99999999;
-+			size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-+			if (ml2 > matchLength)
-+				matchLength = ml2, start = ip, offset = offsetFound;
-+		}
-+
-+		if (matchLength < EQUAL_READ32) {
-+			ip += ((ip - anchor) >> g_searchStrength) + 1; /* jump faster over incompressible sections */
-+			continue;
-+		}
-+
-+		/* let's try to find a better solution */
-+		if (depth >= 1)
-+			while (ip < ilimit) {
-+				ip++;
-+				curr++;
-+				/* check repCode */
-+				if (offset) {
-+					const U32 repIndex = (U32)(curr - offset_1);
-+					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-+					const BYTE *const repMatch = repBase + repIndex;
-+					if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-+						if (ZSTD_read32(ip) == ZSTD_read32(repMatch)) {
-+							/* repcode detected */
-+							const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-+							size_t const repLength =
-+							    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repEnd, prefixStart) +
-+							    EQUAL_READ32;
-+							int const gain2 = (int)(repLength * 3);
-+							int const gain1 = (int)(matchLength * 3 - ZSTD_highbit32((U32)offset + 1) + 1);
-+							if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
-+								matchLength = repLength, offset = 0, start = ip;
-+						}
-+				}
-+
-+				/* search match, depth 1 */
-+				{
-+					size_t offset2 = 99999999;
-+					size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-+					int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-+					int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 4);
-+					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-+						matchLength = ml2, offset = offset2, start = ip;
-+						continue; /* search a better one */
-+					}
-+				}
-+
-+				/* let's find an even better one */
-+				if ((depth == 2) && (ip < ilimit)) {
-+					ip++;
-+					curr++;
-+					/* check repCode */
-+					if (offset) {
-+						const U32 repIndex = (U32)(curr - offset_1);
-+						const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-+						const BYTE *const repMatch = repBase + repIndex;
-+						if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-+							if (ZSTD_read32(ip) == ZSTD_read32(repMatch)) {
-+								/* repcode detected */
-+								const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-+								size_t repLength = ZSTD_count_2segments(ip + EQUAL_READ32, repMatch + EQUAL_READ32, iend,
-+													repEnd, prefixStart) +
-+										   EQUAL_READ32;
-+								int gain2 = (int)(repLength * 4);
-+								int gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 1);
-+								if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
-+									matchLength = repLength, offset = 0, start = ip;
-+							}
-+					}
-+
-+					/* search match, depth 2 */
-+					{
-+						size_t offset2 = 99999999;
-+						size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-+						int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-+						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 7);
-+						if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-+							matchLength = ml2, offset = offset2, start = ip;
-+							continue;
-+						}
-+					}
-+				}
-+				break; /* nothing found : store previous solution */
-+			}
-+
-+		/* catch up */
-+		if (offset) {
-+			U32 const matchIndex = (U32)((start - base) - (offset - ZSTD_REP_MOVE));
-+			const BYTE *match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
-+			const BYTE *const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
-+			while ((start > anchor) && (match > mStart) && (start[-1] == match[-1])) {
-+				start--;
-+				match--;
-+				matchLength++;
-+			} /* catch up */
-+			offset_2 = offset_1;
-+			offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-+		}
-+
-+	/* store sequence */
-+	_storeSequence : {
-+		size_t const litLength = start - anchor;
-+		ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength - MINMATCH);
-+		anchor = ip = start + matchLength;
-+	}
-+
-+		/* check immediate repcode */
-+		while (ip <= ilimit) {
-+			const U32 repIndex = (U32)((ip - base) - offset_2);
-+			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-+			const BYTE *const repMatch = repBase + repIndex;
-+			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-+				if (ZSTD_read32(ip) == ZSTD_read32(repMatch)) {
-+					/* repcode detected we should take it */
-+					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-+					matchLength =
-+					    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-+					offset = offset_2;
-+					offset_2 = offset_1;
-+					offset_1 = (U32)offset; /* swap offset history */
-+					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength - MINMATCH);
-+					ip += matchLength;
-+					anchor = ip;
-+					continue; /* faster when present ... (?) */
-+				}
-+			break;
-+		}
-+	}
-+
-+	/* Save reps for next block */
-+	ctx->repToConfirm[0] = offset_1;
-+	ctx->repToConfirm[1] = offset_2;
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+void ZSTD_compressBlock_greedy_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 0); }
-+
-+static void ZSTD_compressBlock_lazy_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 1);
-+}
-+
-+static void ZSTD_compressBlock_lazy2_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 2);
-+}
-+
-+static void ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 1, 2);
-+}
-+
-+/* The optimal parser */
-+#include "zstd_opt.h"
-+
-+static void ZSTD_compressBlock_btopt(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+#ifdef ZSTD_OPT_H_91842398743
-+	ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0);
-+#else
-+	(void)ctx;
-+	(void)src;
-+	(void)srcSize;
-+	return;
-+#endif
-+}
-+
-+static void ZSTD_compressBlock_btopt2(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+#ifdef ZSTD_OPT_H_91842398743
-+	ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 1);
-+#else
-+	(void)ctx;
-+	(void)src;
-+	(void)srcSize;
-+	return;
-+#endif
-+}
-+
-+static void ZSTD_compressBlock_btopt_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+#ifdef ZSTD_OPT_H_91842398743
-+	ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 0);
-+#else
-+	(void)ctx;
-+	(void)src;
-+	(void)srcSize;
-+	return;
-+#endif
-+}
-+
-+static void ZSTD_compressBlock_btopt2_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-+{
-+#ifdef ZSTD_OPT_H_91842398743
-+	ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 1);
-+#else
-+	(void)ctx;
-+	(void)src;
-+	(void)srcSize;
-+	return;
-+#endif
-+}
-+
-+typedef void (*ZSTD_blockCompressor)(ZSTD_CCtx *ctx, const void *src, size_t srcSize);
-+
-+static ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict)
-+{
-+	static const ZSTD_blockCompressor blockCompressor[2][8] = {
-+	    {ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy, ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2,
-+	     ZSTD_compressBlock_btlazy2, ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2},
-+	    {ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict, ZSTD_compressBlock_lazy_extDict,
-+	     ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict, ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict}};
-+
-+	return blockCompressor[extDict][(U32)strat];
-+}
-+
-+static size_t ZSTD_compressBlock_internal(ZSTD_CCtx *zc, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit);
-+	const BYTE *const base = zc->base;
-+	const BYTE *const istart = (const BYTE *)src;
-+	const U32 curr = (U32)(istart - base);
-+	if (srcSize < MIN_CBLOCK_SIZE + ZSTD_blockHeaderSize + 1)
-+		return 0; /* don't even attempt compression below a certain srcSize */
-+	ZSTD_resetSeqStore(&(zc->seqStore));
-+	if (curr > zc->nextToUpdate + 384)
-+		zc->nextToUpdate = curr - MIN(192, (U32)(curr - zc->nextToUpdate - 384)); /* update tree not updated after finding very long rep matches */
-+	blockCompressor(zc, src, srcSize);
-+	return ZSTD_compressSequences(zc, dst, dstCapacity, srcSize);
-+}
-+
-+/*! ZSTD_compress_generic() :
-+*   Compress a chunk of data into one or multiple blocks.
-+*   All blocks will be terminated, all input will be consumed.
-+*   Function will issue an error if there is not enough `dstCapacity` to hold the compressed content.
-+*   Frame is supposed already started (header already produced)
-+*   @return : compressed size, or an error code
-+*/
-+static size_t ZSTD_compress_generic(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, U32 lastFrameChunk)
-+{
-+	size_t blockSize = cctx->blockSize;
-+	size_t remaining = srcSize;
-+	const BYTE *ip = (const BYTE *)src;
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *op = ostart;
-+	U32 const maxDist = 1 << cctx->params.cParams.windowLog;
-+
-+	if (cctx->params.fParams.checksumFlag && srcSize)
-+		xxh64_update(&cctx->xxhState, src, srcSize);
-+
-+	while (remaining) {
-+		U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
-+		size_t cSize;
-+
-+		if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE)
-+			return ERROR(dstSize_tooSmall); /* not enough space to store compressed block */
-+		if (remaining < blockSize)
-+			blockSize = remaining;
-+
-+		/* preemptive overflow correction */
-+		if (cctx->lowLimit > (3U << 29)) {
-+			U32 const cycleMask = (1 << ZSTD_cycleLog(cctx->params.cParams.hashLog, cctx->params.cParams.strategy)) - 1;
-+			U32 const curr = (U32)(ip - cctx->base);
-+			U32 const newCurr = (curr & cycleMask) + (1 << cctx->params.cParams.windowLog);
-+			U32 const correction = curr - newCurr;
-+			ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_64 <= 30);
-+			ZSTD_reduceIndex(cctx, correction);
-+			cctx->base += correction;
-+			cctx->dictBase += correction;
-+			cctx->lowLimit -= correction;
-+			cctx->dictLimit -= correction;
-+			if (cctx->nextToUpdate < correction)
-+				cctx->nextToUpdate = 0;
-+			else
-+				cctx->nextToUpdate -= correction;
-+		}
-+
-+		if ((U32)(ip + blockSize - cctx->base) > cctx->loadedDictEnd + maxDist) {
-+			/* enforce maxDist */
-+			U32 const newLowLimit = (U32)(ip + blockSize - cctx->base) - maxDist;
-+			if (cctx->lowLimit < newLowLimit)
-+				cctx->lowLimit = newLowLimit;
-+			if (cctx->dictLimit < cctx->lowLimit)
-+				cctx->dictLimit = cctx->lowLimit;
-+		}
-+
-+		cSize = ZSTD_compressBlock_internal(cctx, op + ZSTD_blockHeaderSize, dstCapacity - ZSTD_blockHeaderSize, ip, blockSize);
-+		if (ZSTD_isError(cSize))
-+			return cSize;
-+
-+		if (cSize == 0) { /* block is not compressible */
-+			U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw) << 1) + (U32)(blockSize << 3);
-+			if (blockSize + ZSTD_blockHeaderSize > dstCapacity)
-+				return ERROR(dstSize_tooSmall);
-+			ZSTD_writeLE32(op, cBlockHeader24); /* no pb, 4th byte will be overwritten */
-+			memcpy(op + ZSTD_blockHeaderSize, ip, blockSize);
-+			cSize = ZSTD_blockHeaderSize + blockSize;
-+		} else {
-+			U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed) << 1) + (U32)(cSize << 3);
-+			ZSTD_writeLE24(op, cBlockHeader24);
-+			cSize += ZSTD_blockHeaderSize;
-+		}
-+
-+		remaining -= blockSize;
-+		dstCapacity -= cSize;
-+		ip += blockSize;
-+		op += cSize;
-+	}
-+
-+	if (lastFrameChunk && (op > ostart))
-+		cctx->stage = ZSTDcs_ending;
-+	return op - ostart;
-+}
-+
-+static size_t ZSTD_writeFrameHeader(void *dst, size_t dstCapacity, ZSTD_parameters params, U64 pledgedSrcSize, U32 dictID)
-+{
-+	BYTE *const op = (BYTE *)dst;
-+	U32 const dictIDSizeCode = (dictID > 0) + (dictID >= 256) + (dictID >= 65536); /* 0-3 */
-+	U32 const checksumFlag = params.fParams.checksumFlag > 0;
-+	U32 const windowSize = 1U << params.cParams.windowLog;
-+	U32 const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
-+	BYTE const windowLogByte = (BYTE)((params.cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
-+	U32 const fcsCode =
-+	    params.fParams.contentSizeFlag ? (pledgedSrcSize >= 256) + (pledgedSrcSize >= 65536 + 256) + (pledgedSrcSize >= 0xFFFFFFFFU) : 0; /* 0-3 */
-+	BYTE const frameHeaderDecriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag << 2) + (singleSegment << 5) + (fcsCode << 6));
-+	size_t pos;
-+
-+	if (dstCapacity < ZSTD_frameHeaderSize_max)
-+		return ERROR(dstSize_tooSmall);
-+
-+	ZSTD_writeLE32(dst, ZSTD_MAGICNUMBER);
-+	op[4] = frameHeaderDecriptionByte;
-+	pos = 5;
-+	if (!singleSegment)
-+		op[pos++] = windowLogByte;
-+	switch (dictIDSizeCode) {
-+	default: /* impossible */
-+	case 0: break;
-+	case 1:
-+		op[pos] = (BYTE)(dictID);
-+		pos++;
-+		break;
-+	case 2:
-+		ZSTD_writeLE16(op + pos, (U16)dictID);
-+		pos += 2;
-+		break;
-+	case 3:
-+		ZSTD_writeLE32(op + pos, dictID);
-+		pos += 4;
-+		break;
-+	}
-+	switch (fcsCode) {
-+	default: /* impossible */
-+	case 0:
-+		if (singleSegment)
-+			op[pos++] = (BYTE)(pledgedSrcSize);
-+		break;
-+	case 1:
-+		ZSTD_writeLE16(op + pos, (U16)(pledgedSrcSize - 256));
-+		pos += 2;
-+		break;
-+	case 2:
-+		ZSTD_writeLE32(op + pos, (U32)(pledgedSrcSize));
-+		pos += 4;
-+		break;
-+	case 3:
-+		ZSTD_writeLE64(op + pos, (U64)(pledgedSrcSize));
-+		pos += 8;
-+		break;
-+	}
-+	return pos;
-+}
-+
-+static size_t ZSTD_compressContinue_internal(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, U32 frame, U32 lastFrameChunk)
-+{
-+	const BYTE *const ip = (const BYTE *)src;
-+	size_t fhSize = 0;
-+
-+	if (cctx->stage == ZSTDcs_created)
-+		return ERROR(stage_wrong); /* missing init (ZSTD_compressBegin) */
-+
-+	if (frame && (cctx->stage == ZSTDcs_init)) {
-+		fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, cctx->frameContentSize, cctx->dictID);
-+		if (ZSTD_isError(fhSize))
-+			return fhSize;
-+		dstCapacity -= fhSize;
-+		dst = (char *)dst + fhSize;
-+		cctx->stage = ZSTDcs_ongoing;
-+	}
-+
-+	/* Check if blocks follow each other */
-+	if (src != cctx->nextSrc) {
-+		/* not contiguous */
-+		ptrdiff_t const delta = cctx->nextSrc - ip;
-+		cctx->lowLimit = cctx->dictLimit;
-+		cctx->dictLimit = (U32)(cctx->nextSrc - cctx->base);
-+		cctx->dictBase = cctx->base;
-+		cctx->base -= delta;
-+		cctx->nextToUpdate = cctx->dictLimit;
-+		if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE)
-+			cctx->lowLimit = cctx->dictLimit; /* too small extDict */
-+	}
-+
-+	/* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
-+	if ((ip + srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
-+		ptrdiff_t const highInputIdx = (ip + srcSize) - cctx->dictBase;
-+		U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
-+		cctx->lowLimit = lowLimitMax;
-+	}
-+
-+	cctx->nextSrc = ip + srcSize;
-+
-+	if (srcSize) {
-+		size_t const cSize = frame ? ZSTD_compress_generic(cctx, dst, dstCapacity, src, srcSize, lastFrameChunk)
-+					   : ZSTD_compressBlock_internal(cctx, dst, dstCapacity, src, srcSize);
-+		if (ZSTD_isError(cSize))
-+			return cSize;
-+		return cSize + fhSize;
-+	} else
-+		return fhSize;
-+}
-+
-+size_t ZSTD_compressContinue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 0);
-+}
-+
-+size_t ZSTD_getBlockSizeMax(ZSTD_CCtx *cctx) { return MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, 1 << cctx->params.cParams.windowLog); }
-+
-+size_t ZSTD_compressBlock(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	size_t const blockSizeMax = ZSTD_getBlockSizeMax(cctx);
-+	if (srcSize > blockSizeMax)
-+		return ERROR(srcSize_wrong);
-+	return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
-+}
-+
-+/*! ZSTD_loadDictionaryContent() :
-+ *  @return : 0, or an error code
-+ */
-+static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx *zc, const void *src, size_t srcSize)
-+{
-+	const BYTE *const ip = (const BYTE *)src;
-+	const BYTE *const iend = ip + srcSize;
-+
-+	/* input becomes curr prefix */
-+	zc->lowLimit = zc->dictLimit;
-+	zc->dictLimit = (U32)(zc->nextSrc - zc->base);
-+	zc->dictBase = zc->base;
-+	zc->base += ip - zc->nextSrc;
-+	zc->nextToUpdate = zc->dictLimit;
-+	zc->loadedDictEnd = zc->forceWindow ? 0 : (U32)(iend - zc->base);
-+
-+	zc->nextSrc = iend;
-+	if (srcSize <= HASH_READ_SIZE)
-+		return 0;
-+
-+	switch (zc->params.cParams.strategy) {
-+	case ZSTD_fast: ZSTD_fillHashTable(zc, iend, zc->params.cParams.searchLength); break;
-+
-+	case ZSTD_dfast: ZSTD_fillDoubleHashTable(zc, iend, zc->params.cParams.searchLength); break;
-+
-+	case ZSTD_greedy:
-+	case ZSTD_lazy:
-+	case ZSTD_lazy2:
-+		if (srcSize >= HASH_READ_SIZE)
-+			ZSTD_insertAndFindFirstIndex(zc, iend - HASH_READ_SIZE, zc->params.cParams.searchLength);
-+		break;
-+
-+	case ZSTD_btlazy2:
-+	case ZSTD_btopt:
-+	case ZSTD_btopt2:
-+		if (srcSize >= HASH_READ_SIZE)
-+			ZSTD_updateTree(zc, iend - HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
-+		break;
-+
-+	default:
-+		return ERROR(GENERIC); /* strategy doesn't exist; impossible */
-+	}
-+
-+	zc->nextToUpdate = (U32)(iend - zc->base);
-+	return 0;
-+}
-+
-+/* Dictionaries that assign zero probability to symbols that show up causes problems
-+   when FSE encoding.  Refuse dictionaries that assign zero probability to symbols
-+   that we may encounter during compression.
-+   NOTE: This behavior is not standard and could be improved in the future. */
-+static size_t ZSTD_checkDictNCount(short *normalizedCounter, unsigned dictMaxSymbolValue, unsigned maxSymbolValue)
-+{
-+	U32 s;
-+	if (dictMaxSymbolValue < maxSymbolValue)
-+		return ERROR(dictionary_corrupted);
-+	for (s = 0; s <= maxSymbolValue; ++s) {
-+		if (normalizedCounter[s] == 0)
-+			return ERROR(dictionary_corrupted);
-+	}
-+	return 0;
-+}
-+
-+/* Dictionary format :
-+ * See :
-+ * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
-+ */
-+/*! ZSTD_loadZstdDictionary() :
-+ * @return : 0, or an error code
-+ *  assumptions : magic number supposed already checked
-+ *                dictSize supposed > 8
-+ */
-+static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx *cctx, const void *dict, size_t dictSize)
-+{
-+	const BYTE *dictPtr = (const BYTE *)dict;
-+	const BYTE *const dictEnd = dictPtr + dictSize;
-+	short offcodeNCount[MaxOff + 1];
-+	unsigned offcodeMaxValue = MaxOff;
-+
-+	dictPtr += 4; /* skip magic number */
-+	cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 : ZSTD_readLE32(dictPtr);
-+	dictPtr += 4;
-+
-+	{
-+		size_t const hufHeaderSize = HUF_readCTable_wksp(cctx->hufTable, 255, dictPtr, dictEnd - dictPtr, cctx->tmpCounters, sizeof(cctx->tmpCounters));
-+		if (HUF_isError(hufHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		dictPtr += hufHeaderSize;
-+	}
-+
-+	{
-+		unsigned offcodeLog;
-+		size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd - dictPtr);
-+		if (FSE_isError(offcodeHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		if (offcodeLog > OffFSELog)
-+			return ERROR(dictionary_corrupted);
-+		/* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
-+		CHECK_E(FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, cctx->tmpCounters, sizeof(cctx->tmpCounters)),
-+			dictionary_corrupted);
-+		dictPtr += offcodeHeaderSize;
-+	}
-+
-+	{
-+		short matchlengthNCount[MaxML + 1];
-+		unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-+		size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd - dictPtr);
-+		if (FSE_isError(matchlengthHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		if (matchlengthLog > MLFSELog)
-+			return ERROR(dictionary_corrupted);
-+		/* Every match length code must have non-zero probability */
-+		CHECK_F(ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
-+		CHECK_E(
-+		    FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, cctx->tmpCounters, sizeof(cctx->tmpCounters)),
-+		    dictionary_corrupted);
-+		dictPtr += matchlengthHeaderSize;
-+	}
-+
-+	{
-+		short litlengthNCount[MaxLL + 1];
-+		unsigned litlengthMaxValue = MaxLL, litlengthLog;
-+		size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd - dictPtr);
-+		if (FSE_isError(litlengthHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		if (litlengthLog > LLFSELog)
-+			return ERROR(dictionary_corrupted);
-+		/* Every literal length code must have non-zero probability */
-+		CHECK_F(ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
-+		CHECK_E(FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, cctx->tmpCounters, sizeof(cctx->tmpCounters)),
-+			dictionary_corrupted);
-+		dictPtr += litlengthHeaderSize;
-+	}
-+
-+	if (dictPtr + 12 > dictEnd)
-+		return ERROR(dictionary_corrupted);
-+	cctx->rep[0] = ZSTD_readLE32(dictPtr + 0);
-+	cctx->rep[1] = ZSTD_readLE32(dictPtr + 4);
-+	cctx->rep[2] = ZSTD_readLE32(dictPtr + 8);
-+	dictPtr += 12;
-+
-+	{
-+		size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
-+		U32 offcodeMax = MaxOff;
-+		if (dictContentSize <= ((U32)-1) - 128 KB) {
-+			U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
-+			offcodeMax = ZSTD_highbit32(maxOffset);		     /* Calculate minimum offset code required to represent maxOffset */
-+		}
-+		/* All offset values <= dictContentSize + 128 KB must be representable */
-+		CHECK_F(ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
-+		/* All repCodes must be <= dictContentSize and != 0*/
-+		{
-+			U32 u;
-+			for (u = 0; u < 3; u++) {
-+				if (cctx->rep[u] == 0)
-+					return ERROR(dictionary_corrupted);
-+				if (cctx->rep[u] > dictContentSize)
-+					return ERROR(dictionary_corrupted);
-+			}
-+		}
-+
-+		cctx->flagStaticTables = 1;
-+		cctx->flagStaticHufTable = HUF_repeat_valid;
-+		return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
-+	}
-+}
-+
-+/** ZSTD_compress_insertDictionary() :
-+*   @return : 0, or an error code */
-+static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx *cctx, const void *dict, size_t dictSize)
-+{
-+	if ((dict == NULL) || (dictSize <= 8))
-+		return 0;
-+
-+	/* dict as pure content */
-+	if ((ZSTD_readLE32(dict) != ZSTD_DICT_MAGIC) || (cctx->forceRawDict))
-+		return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
-+
-+	/* dict as zstd dictionary */
-+	return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
-+}
-+
-+/*! ZSTD_compressBegin_internal() :
-+*   @return : 0, or an error code */
-+static size_t ZSTD_compressBegin_internal(ZSTD_CCtx *cctx, const void *dict, size_t dictSize, ZSTD_parameters params, U64 pledgedSrcSize)
-+{
-+	ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
-+	CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
-+	return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
-+}
-+
-+/*! ZSTD_compressBegin_advanced() :
-+*   @return : 0, or an error code */
-+size_t ZSTD_compressBegin_advanced(ZSTD_CCtx *cctx, const void *dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize)
-+{
-+	/* compression parameters verification and optimization */
-+	CHECK_F(ZSTD_checkCParams(params.cParams));
-+	return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, pledgedSrcSize);
-+}
-+
-+size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx *cctx, const void *dict, size_t dictSize, int compressionLevel)
-+{
-+	ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-+	return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, 0);
-+}
-+
-+size_t ZSTD_compressBegin(ZSTD_CCtx *cctx, int compressionLevel) { return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel); }
-+
-+/*! ZSTD_writeEpilogue() :
-+*   Ends a frame.
-+*   @return : nb of bytes written into dst (or an error code) */
-+static size_t ZSTD_writeEpilogue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity)
-+{
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *op = ostart;
-+	size_t fhSize = 0;
-+
-+	if (cctx->stage == ZSTDcs_created)
-+		return ERROR(stage_wrong); /* init missing */
-+
-+	/* special case : empty frame */
-+	if (cctx->stage == ZSTDcs_init) {
-+		fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, 0, 0);
-+		if (ZSTD_isError(fhSize))
-+			return fhSize;
-+		dstCapacity -= fhSize;
-+		op += fhSize;
-+		cctx->stage = ZSTDcs_ongoing;
-+	}
-+
-+	if (cctx->stage != ZSTDcs_ending) {
-+		/* write one last empty block, make it the "last" block */
-+		U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw) << 1) + 0;
-+		if (dstCapacity < 4)
-+			return ERROR(dstSize_tooSmall);
-+		ZSTD_writeLE32(op, cBlockHeader24);
-+		op += ZSTD_blockHeaderSize;
-+		dstCapacity -= ZSTD_blockHeaderSize;
-+	}
-+
-+	if (cctx->params.fParams.checksumFlag) {
-+		U32 const checksum = (U32)xxh64_digest(&cctx->xxhState);
-+		if (dstCapacity < 4)
-+			return ERROR(dstSize_tooSmall);
-+		ZSTD_writeLE32(op, checksum);
-+		op += 4;
-+	}
-+
-+	cctx->stage = ZSTDcs_created; /* return to "created but no init" status */
-+	return op - ostart;
-+}
-+
-+size_t ZSTD_compressEnd(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	size_t endResult;
-+	size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 1);
-+	if (ZSTD_isError(cSize))
-+		return cSize;
-+	endResult = ZSTD_writeEpilogue(cctx, (char *)dst + cSize, dstCapacity - cSize);
-+	if (ZSTD_isError(endResult))
-+		return endResult;
-+	return cSize + endResult;
-+}
-+
-+static size_t ZSTD_compress_internal(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize,
-+				     ZSTD_parameters params)
-+{
-+	CHECK_F(ZSTD_compressBegin_internal(cctx, dict, dictSize, params, srcSize));
-+	return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
-+}
-+
-+size_t ZSTD_compress_usingDict(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize,
-+			       ZSTD_parameters params)
-+{
-+	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
-+}
-+
-+size_t ZSTD_compressCCtx(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, ZSTD_parameters params)
-+{
-+	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, NULL, 0, params);
-+}
-+
-+/* =====  Dictionary API  ===== */
-+
-+struct ZSTD_CDict_s {
-+	void *dictBuffer;
-+	const void *dictContent;
-+	size_t dictContentSize;
-+	ZSTD_CCtx *refContext;
-+}; /* typedef'd tp ZSTD_CDict within "zstd.h" */
-+
-+size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams) { return ZSTD_CCtxWorkspaceBound(cParams) + ZSTD_ALIGN(sizeof(ZSTD_CDict)); }
-+
-+static ZSTD_CDict *ZSTD_createCDict_advanced(const void *dictBuffer, size_t dictSize, unsigned byReference, ZSTD_parameters params, ZSTD_customMem customMem)
-+{
-+	if (!customMem.customAlloc || !customMem.customFree)
-+		return NULL;
-+
-+	{
-+		ZSTD_CDict *const cdict = (ZSTD_CDict *)ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
-+		ZSTD_CCtx *const cctx = ZSTD_createCCtx_advanced(customMem);
-+
-+		if (!cdict || !cctx) {
-+			ZSTD_free(cdict, customMem);
-+			ZSTD_freeCCtx(cctx);
-+			return NULL;
-+		}
-+
-+		if ((byReference) || (!dictBuffer) || (!dictSize)) {
-+			cdict->dictBuffer = NULL;
-+			cdict->dictContent = dictBuffer;
-+		} else {
-+			void *const internalBuffer = ZSTD_malloc(dictSize, customMem);
-+			if (!internalBuffer) {
-+				ZSTD_free(cctx, customMem);
-+				ZSTD_free(cdict, customMem);
-+				return NULL;
-+			}
-+			memcpy(internalBuffer, dictBuffer, dictSize);
-+			cdict->dictBuffer = internalBuffer;
-+			cdict->dictContent = internalBuffer;
-+		}
-+
-+		{
-+			size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
-+			if (ZSTD_isError(errorCode)) {
-+				ZSTD_free(cdict->dictBuffer, customMem);
-+				ZSTD_free(cdict, customMem);
-+				ZSTD_freeCCtx(cctx);
-+				return NULL;
-+			}
-+		}
-+
-+		cdict->refContext = cctx;
-+		cdict->dictContentSize = dictSize;
-+		return cdict;
-+	}
-+}
-+
-+ZSTD_CDict *ZSTD_initCDict(const void *dict, size_t dictSize, ZSTD_parameters params, void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-+	return ZSTD_createCDict_advanced(dict, dictSize, 1, params, stackMem);
-+}
-+
-+size_t ZSTD_freeCDict(ZSTD_CDict *cdict)
-+{
-+	if (cdict == NULL)
-+		return 0; /* support free on NULL */
-+	{
-+		ZSTD_customMem const cMem = cdict->refContext->customMem;
-+		ZSTD_freeCCtx(cdict->refContext);
-+		ZSTD_free(cdict->dictBuffer, cMem);
-+		ZSTD_free(cdict, cMem);
-+		return 0;
-+	}
-+}
-+
-+static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict *cdict) { return ZSTD_getParamsFromCCtx(cdict->refContext); }
-+
-+size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx *cctx, const ZSTD_CDict *cdict, unsigned long long pledgedSrcSize)
-+{
-+	if (cdict->dictContentSize)
-+		CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
-+	else {
-+		ZSTD_parameters params = cdict->refContext->params;
-+		params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-+		CHECK_F(ZSTD_compressBegin_advanced(cctx, NULL, 0, params, pledgedSrcSize));
-+	}
-+	return 0;
-+}
-+
-+/*! ZSTD_compress_usingCDict() :
-+*   Compression using a digested Dictionary.
-+*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-+*   Note that compression level is decided during dictionary creation */
-+size_t ZSTD_compress_usingCDict(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const ZSTD_CDict *cdict)
-+{
-+	CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));
-+
-+	if (cdict->refContext->params.fParams.contentSizeFlag == 1) {
-+		cctx->params.fParams.contentSizeFlag = 1;
-+		cctx->frameContentSize = srcSize;
-+	} else {
-+		cctx->params.fParams.contentSizeFlag = 0;
-+	}
-+
-+	return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
-+}
-+
-+/* ******************************************************************
-+*  Streaming
-+********************************************************************/
-+
-+typedef enum { zcss_init, zcss_load, zcss_flush, zcss_final } ZSTD_cStreamStage;
-+
-+struct ZSTD_CStream_s {
-+	ZSTD_CCtx *cctx;
-+	ZSTD_CDict *cdictLocal;
-+	const ZSTD_CDict *cdict;
-+	char *inBuff;
-+	size_t inBuffSize;
-+	size_t inToCompress;
-+	size_t inBuffPos;
-+	size_t inBuffTarget;
-+	size_t blockSize;
-+	char *outBuff;
-+	size_t outBuffSize;
-+	size_t outBuffContentSize;
-+	size_t outBuffFlushedSize;
-+	ZSTD_cStreamStage stage;
-+	U32 checksum;
-+	U32 frameEnded;
-+	U64 pledgedSrcSize;
-+	U64 inputProcessed;
-+	ZSTD_parameters params;
-+	ZSTD_customMem customMem;
-+}; /* typedef'd to ZSTD_CStream within "zstd.h" */
-+
-+size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams)
-+{
-+	size_t const inBuffSize = (size_t)1 << cParams.windowLog;
-+	size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, inBuffSize);
-+	size_t const outBuffSize = ZSTD_compressBound(blockSize) + 1;
-+
-+	return ZSTD_CCtxWorkspaceBound(cParams) + ZSTD_ALIGN(sizeof(ZSTD_CStream)) + ZSTD_ALIGN(inBuffSize) + ZSTD_ALIGN(outBuffSize);
-+}
-+
-+ZSTD_CStream *ZSTD_createCStream_advanced(ZSTD_customMem customMem)
-+{
-+	ZSTD_CStream *zcs;
-+
-+	if (!customMem.customAlloc || !customMem.customFree)
-+		return NULL;
-+
-+	zcs = (ZSTD_CStream *)ZSTD_malloc(sizeof(ZSTD_CStream), customMem);
-+	if (zcs == NULL)
-+		return NULL;
-+	memset(zcs, 0, sizeof(ZSTD_CStream));
-+	memcpy(&zcs->customMem, &customMem, sizeof(ZSTD_customMem));
-+	zcs->cctx = ZSTD_createCCtx_advanced(customMem);
-+	if (zcs->cctx == NULL) {
-+		ZSTD_freeCStream(zcs);
-+		return NULL;
-+	}
-+	return zcs;
-+}
-+
-+size_t ZSTD_freeCStream(ZSTD_CStream *zcs)
-+{
-+	if (zcs == NULL)
-+		return 0; /* support free on NULL */
-+	{
-+		ZSTD_customMem const cMem = zcs->customMem;
-+		ZSTD_freeCCtx(zcs->cctx);
-+		zcs->cctx = NULL;
-+		ZSTD_freeCDict(zcs->cdictLocal);
-+		zcs->cdictLocal = NULL;
-+		ZSTD_free(zcs->inBuff, cMem);
-+		zcs->inBuff = NULL;
-+		ZSTD_free(zcs->outBuff, cMem);
-+		zcs->outBuff = NULL;
-+		ZSTD_free(zcs, cMem);
-+		return 0;
-+	}
-+}
-+
-+/*======   Initialization   ======*/
-+
-+size_t ZSTD_CStreamInSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
-+size_t ZSTD_CStreamOutSize(void) { return ZSTD_compressBound(ZSTD_BLOCKSIZE_ABSOLUTEMAX) + ZSTD_blockHeaderSize + 4 /* 32-bits hash */; }
-+
-+static size_t ZSTD_resetCStream_internal(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize)
-+{
-+	if (zcs->inBuffSize == 0)
-+		return ERROR(stage_wrong); /* zcs has not been init at least once => can't reset */
-+
-+	if (zcs->cdict)
-+		CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
-+	else
-+		CHECK_F(ZSTD_compressBegin_advanced(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
-+
-+	zcs->inToCompress = 0;
-+	zcs->inBuffPos = 0;
-+	zcs->inBuffTarget = zcs->blockSize;
-+	zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-+	zcs->stage = zcss_load;
-+	zcs->frameEnded = 0;
-+	zcs->pledgedSrcSize = pledgedSrcSize;
-+	zcs->inputProcessed = 0;
-+	return 0; /* ready to go */
-+}
-+
-+size_t ZSTD_resetCStream(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize)
-+{
-+
-+	zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-+
-+	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
-+}
-+
-+static size_t ZSTD_initCStream_advanced(ZSTD_CStream *zcs, const void *dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize)
-+{
-+	/* allocate buffers */
-+	{
-+		size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
-+		if (zcs->inBuffSize < neededInBuffSize) {
-+			zcs->inBuffSize = neededInBuffSize;
-+			ZSTD_free(zcs->inBuff, zcs->customMem);
-+			zcs->inBuff = (char *)ZSTD_malloc(neededInBuffSize, zcs->customMem);
-+			if (zcs->inBuff == NULL)
-+				return ERROR(memory_allocation);
-+		}
-+		zcs->blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, neededInBuffSize);
-+	}
-+	if (zcs->outBuffSize < ZSTD_compressBound(zcs->blockSize) + 1) {
-+		zcs->outBuffSize = ZSTD_compressBound(zcs->blockSize) + 1;
-+		ZSTD_free(zcs->outBuff, zcs->customMem);
-+		zcs->outBuff = (char *)ZSTD_malloc(zcs->outBuffSize, zcs->customMem);
-+		if (zcs->outBuff == NULL)
-+			return ERROR(memory_allocation);
-+	}
-+
-+	if (dict && dictSize >= 8) {
-+		ZSTD_freeCDict(zcs->cdictLocal);
-+		zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0, params, zcs->customMem);
-+		if (zcs->cdictLocal == NULL)
-+			return ERROR(memory_allocation);
-+		zcs->cdict = zcs->cdictLocal;
-+	} else
-+		zcs->cdict = NULL;
-+
-+	zcs->checksum = params.fParams.checksumFlag > 0;
-+	zcs->params = params;
-+
-+	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
-+}
-+
-+ZSTD_CStream *ZSTD_initCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-+	ZSTD_CStream *const zcs = ZSTD_createCStream_advanced(stackMem);
-+	if (zcs) {
-+		size_t const code = ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
-+		if (ZSTD_isError(code)) {
-+			return NULL;
-+		}
-+	}
-+	return zcs;
-+}
-+
-+ZSTD_CStream *ZSTD_initCStream_usingCDict(const ZSTD_CDict *cdict, unsigned long long pledgedSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-+	ZSTD_CStream *const zcs = ZSTD_initCStream(params, pledgedSrcSize, workspace, workspaceSize);
-+	if (zcs) {
-+		zcs->cdict = cdict;
-+		if (ZSTD_isError(ZSTD_resetCStream_internal(zcs, pledgedSrcSize))) {
-+			return NULL;
-+		}
-+	}
-+	return zcs;
-+}
-+
-+/*======   Compression   ======*/
-+
-+typedef enum { zsf_gather, zsf_flush, zsf_end } ZSTD_flush_e;
-+
-+ZSTD_STATIC size_t ZSTD_limitCopy(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	size_t const length = MIN(dstCapacity, srcSize);
-+	memcpy(dst, src, length);
-+	return length;
-+}
-+
-+static size_t ZSTD_compressStream_generic(ZSTD_CStream *zcs, void *dst, size_t *dstCapacityPtr, const void *src, size_t *srcSizePtr, ZSTD_flush_e const flush)
-+{
-+	U32 someMoreWork = 1;
-+	const char *const istart = (const char *)src;
-+	const char *const iend = istart + *srcSizePtr;
-+	const char *ip = istart;
-+	char *const ostart = (char *)dst;
-+	char *const oend = ostart + *dstCapacityPtr;
-+	char *op = ostart;
-+
-+	while (someMoreWork) {
-+		switch (zcs->stage) {
-+		case zcss_init:
-+			return ERROR(init_missing); /* call ZBUFF_compressInit() first ! */
-+
-+		case zcss_load:
-+			/* complete inBuffer */
-+			{
-+				size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
-+				size_t const loaded = ZSTD_limitCopy(zcs->inBuff + zcs->inBuffPos, toLoad, ip, iend - ip);
-+				zcs->inBuffPos += loaded;
-+				ip += loaded;
-+				if ((zcs->inBuffPos == zcs->inToCompress) || (!flush && (toLoad != loaded))) {
-+					someMoreWork = 0;
-+					break; /* not enough input to get a full block : stop there, wait for more */
-+				}
-+			}
-+			/* compress curr block (note : this stage cannot be stopped in the middle) */
-+			{
-+				void *cDst;
-+				size_t cSize;
-+				size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
-+				size_t oSize = oend - op;
-+				if (oSize >= ZSTD_compressBound(iSize))
-+					cDst = op; /* compress directly into output buffer (avoid flush stage) */
-+				else
-+					cDst = zcs->outBuff, oSize = zcs->outBuffSize;
-+				cSize = (flush == zsf_end) ? ZSTD_compressEnd(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize)
-+							   : ZSTD_compressContinue(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize);
-+				if (ZSTD_isError(cSize))
-+					return cSize;
-+				if (flush == zsf_end)
-+					zcs->frameEnded = 1;
-+				/* prepare next block */
-+				zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
-+				if (zcs->inBuffTarget > zcs->inBuffSize)
-+					zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize; /* note : inBuffSize >= blockSize */
-+				zcs->inToCompress = zcs->inBuffPos;
-+				if (cDst == op) {
-+					op += cSize;
-+					break;
-+				} /* no need to flush */
-+				zcs->outBuffContentSize = cSize;
-+				zcs->outBuffFlushedSize = 0;
-+				zcs->stage = zcss_flush; /* pass-through to flush stage */
-+			}
-+
-+		case zcss_flush: {
-+			size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-+			size_t const flushed = ZSTD_limitCopy(op, oend - op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-+			op += flushed;
-+			zcs->outBuffFlushedSize += flushed;
-+			if (toFlush != flushed) {
-+				someMoreWork = 0;
-+				break;
-+			} /* dst too small to store flushed data : stop there */
-+			zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-+			zcs->stage = zcss_load;
-+			break;
-+		}
-+
-+		case zcss_final:
-+			someMoreWork = 0; /* do nothing */
-+			break;
-+
-+		default:
-+			return ERROR(GENERIC); /* impossible */
-+		}
-+	}
-+
-+	*srcSizePtr = ip - istart;
-+	*dstCapacityPtr = op - ostart;
-+	zcs->inputProcessed += *srcSizePtr;
-+	if (zcs->frameEnded)
-+		return 0;
-+	{
-+		size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
-+		if (hintInSize == 0)
-+			hintInSize = zcs->blockSize;
-+		return hintInSize;
-+	}
-+}
-+
-+size_t ZSTD_compressStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output, ZSTD_inBuffer *input)
-+{
-+	size_t sizeRead = input->size - input->pos;
-+	size_t sizeWritten = output->size - output->pos;
-+	size_t const result =
-+	    ZSTD_compressStream_generic(zcs, (char *)(output->dst) + output->pos, &sizeWritten, (const char *)(input->src) + input->pos, &sizeRead, zsf_gather);
-+	input->pos += sizeRead;
-+	output->pos += sizeWritten;
-+	return result;
-+}
-+
-+/*======   Finalize   ======*/
-+
-+/*! ZSTD_flushStream() :
-+*   @return : amount of data remaining to flush */
-+size_t ZSTD_flushStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output)
-+{
-+	size_t srcSize = 0;
-+	size_t sizeWritten = output->size - output->pos;
-+	size_t const result = ZSTD_compressStream_generic(zcs, (char *)(output->dst) + output->pos, &sizeWritten, &srcSize,
-+							  &srcSize, /* use a valid src address instead of NULL */
-+							  zsf_flush);
-+	output->pos += sizeWritten;
-+	if (ZSTD_isError(result))
-+		return result;
-+	return zcs->outBuffContentSize - zcs->outBuffFlushedSize; /* remaining to flush */
-+}
-+
-+size_t ZSTD_endStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output)
-+{
-+	BYTE *const ostart = (BYTE *)(output->dst) + output->pos;
-+	BYTE *const oend = (BYTE *)(output->dst) + output->size;
-+	BYTE *op = ostart;
-+
-+	if ((zcs->pledgedSrcSize) && (zcs->inputProcessed != zcs->pledgedSrcSize))
-+		return ERROR(srcSize_wrong); /* pledgedSrcSize not respected */
-+
-+	if (zcs->stage != zcss_final) {
-+		/* flush whatever remains */
-+		size_t srcSize = 0;
-+		size_t sizeWritten = output->size - output->pos;
-+		size_t const notEnded =
-+		    ZSTD_compressStream_generic(zcs, ostart, &sizeWritten, &srcSize, &srcSize, zsf_end); /* use a valid src address instead of NULL */
-+		size_t const remainingToFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-+		op += sizeWritten;
-+		if (remainingToFlush) {
-+			output->pos += sizeWritten;
-+			return remainingToFlush + ZSTD_BLOCKHEADERSIZE /* final empty block */ + (zcs->checksum * 4);
-+		}
-+		/* create epilogue */
-+		zcs->stage = zcss_final;
-+		zcs->outBuffContentSize = !notEnded ? 0 : ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL,
-+									   0); /* write epilogue, including final empty block, into outBuff */
-+	}
-+
-+	/* flush epilogue */
-+	{
-+		size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-+		size_t const flushed = ZSTD_limitCopy(op, oend - op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-+		op += flushed;
-+		zcs->outBuffFlushedSize += flushed;
-+		output->pos += op - ostart;
-+		if (toFlush == flushed)
-+			zcs->stage = zcss_init; /* end reached */
-+		return toFlush - flushed;
-+	}
-+}
-+
-+/*-=====  Pre-defined compression levels  =====-*/
-+
-+#define ZSTD_DEFAULT_CLEVEL 1
-+#define ZSTD_MAX_CLEVEL 22
-+int ZSTD_maxCLevel(void) { return ZSTD_MAX_CLEVEL; }
-+
-+static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEVEL + 1] = {
-+    {
-+	/* "default" */
-+	/* W,  C,  H,  S,  L, TL, strat */
-+	{18, 12, 12, 1, 7, 16, ZSTD_fast},    /* level  0 - never used */
-+	{19, 13, 14, 1, 7, 16, ZSTD_fast},    /* level  1 */
-+	{19, 15, 16, 1, 6, 16, ZSTD_fast},    /* level  2 */
-+	{20, 16, 17, 1, 5, 16, ZSTD_dfast},   /* level  3.*/
-+	{20, 18, 18, 1, 5, 16, ZSTD_dfast},   /* level  4.*/
-+	{20, 15, 18, 3, 5, 16, ZSTD_greedy},  /* level  5 */
-+	{21, 16, 19, 2, 5, 16, ZSTD_lazy},    /* level  6 */
-+	{21, 17, 20, 3, 5, 16, ZSTD_lazy},    /* level  7 */
-+	{21, 18, 20, 3, 5, 16, ZSTD_lazy2},   /* level  8 */
-+	{21, 20, 20, 3, 5, 16, ZSTD_lazy2},   /* level  9 */
-+	{21, 19, 21, 4, 5, 16, ZSTD_lazy2},   /* level 10 */
-+	{22, 20, 22, 4, 5, 16, ZSTD_lazy2},   /* level 11 */
-+	{22, 20, 22, 5, 5, 16, ZSTD_lazy2},   /* level 12 */
-+	{22, 21, 22, 5, 5, 16, ZSTD_lazy2},   /* level 13 */
-+	{22, 21, 22, 6, 5, 16, ZSTD_lazy2},   /* level 14 */
-+	{22, 21, 21, 5, 5, 16, ZSTD_btlazy2}, /* level 15 */
-+	{23, 22, 22, 5, 5, 16, ZSTD_btlazy2}, /* level 16 */
-+	{23, 21, 22, 4, 5, 24, ZSTD_btopt},   /* level 17 */
-+	{23, 23, 22, 6, 5, 32, ZSTD_btopt},   /* level 18 */
-+	{23, 23, 22, 6, 3, 48, ZSTD_btopt},   /* level 19 */
-+	{25, 25, 23, 7, 3, 64, ZSTD_btopt2},  /* level 20 */
-+	{26, 26, 23, 7, 3, 256, ZSTD_btopt2}, /* level 21 */
-+	{27, 27, 25, 9, 3, 512, ZSTD_btopt2}, /* level 22 */
-+    },
-+    {
-+	/* for srcSize <= 256 KB */
-+	/* W,  C,  H,  S,  L,  T, strat */
-+	{0, 0, 0, 0, 0, 0, ZSTD_fast},	 /* level  0 - not used */
-+	{18, 13, 14, 1, 6, 8, ZSTD_fast},      /* level  1 */
-+	{18, 14, 13, 1, 5, 8, ZSTD_dfast},     /* level  2 */
-+	{18, 16, 15, 1, 5, 8, ZSTD_dfast},     /* level  3 */
-+	{18, 15, 17, 1, 5, 8, ZSTD_greedy},    /* level  4.*/
-+	{18, 16, 17, 4, 5, 8, ZSTD_greedy},    /* level  5.*/
-+	{18, 16, 17, 3, 5, 8, ZSTD_lazy},      /* level  6.*/
-+	{18, 17, 17, 4, 4, 8, ZSTD_lazy},      /* level  7 */
-+	{18, 17, 17, 4, 4, 8, ZSTD_lazy2},     /* level  8 */
-+	{18, 17, 17, 5, 4, 8, ZSTD_lazy2},     /* level  9 */
-+	{18, 17, 17, 6, 4, 8, ZSTD_lazy2},     /* level 10 */
-+	{18, 18, 17, 6, 4, 8, ZSTD_lazy2},     /* level 11.*/
-+	{18, 18, 17, 7, 4, 8, ZSTD_lazy2},     /* level 12.*/
-+	{18, 19, 17, 6, 4, 8, ZSTD_btlazy2},   /* level 13 */
-+	{18, 18, 18, 4, 4, 16, ZSTD_btopt},    /* level 14.*/
-+	{18, 18, 18, 4, 3, 16, ZSTD_btopt},    /* level 15.*/
-+	{18, 19, 18, 6, 3, 32, ZSTD_btopt},    /* level 16.*/
-+	{18, 19, 18, 8, 3, 64, ZSTD_btopt},    /* level 17.*/
-+	{18, 19, 18, 9, 3, 128, ZSTD_btopt},   /* level 18.*/
-+	{18, 19, 18, 10, 3, 256, ZSTD_btopt},  /* level 19.*/
-+	{18, 19, 18, 11, 3, 512, ZSTD_btopt2}, /* level 20.*/
-+	{18, 19, 18, 12, 3, 512, ZSTD_btopt2}, /* level 21.*/
-+	{18, 19, 18, 13, 3, 512, ZSTD_btopt2}, /* level 22.*/
-+    },
-+    {
-+	/* for srcSize <= 128 KB */
-+	/* W,  C,  H,  S,  L,  T, strat */
-+	{17, 12, 12, 1, 7, 8, ZSTD_fast},      /* level  0 - not used */
-+	{17, 12, 13, 1, 6, 8, ZSTD_fast},      /* level  1 */
-+	{17, 13, 16, 1, 5, 8, ZSTD_fast},      /* level  2 */
-+	{17, 16, 16, 2, 5, 8, ZSTD_dfast},     /* level  3 */
-+	{17, 13, 15, 3, 4, 8, ZSTD_greedy},    /* level  4 */
-+	{17, 15, 17, 4, 4, 8, ZSTD_greedy},    /* level  5 */
-+	{17, 16, 17, 3, 4, 8, ZSTD_lazy},      /* level  6 */
-+	{17, 15, 17, 4, 4, 8, ZSTD_lazy2},     /* level  7 */
-+	{17, 17, 17, 4, 4, 8, ZSTD_lazy2},     /* level  8 */
-+	{17, 17, 17, 5, 4, 8, ZSTD_lazy2},     /* level  9 */
-+	{17, 17, 17, 6, 4, 8, ZSTD_lazy2},     /* level 10 */
-+	{17, 17, 17, 7, 4, 8, ZSTD_lazy2},     /* level 11 */
-+	{17, 17, 17, 8, 4, 8, ZSTD_lazy2},     /* level 12 */
-+	{17, 18, 17, 6, 4, 8, ZSTD_btlazy2},   /* level 13.*/
-+	{17, 17, 17, 7, 3, 8, ZSTD_btopt},     /* level 14.*/
-+	{17, 17, 17, 7, 3, 16, ZSTD_btopt},    /* level 15.*/
-+	{17, 18, 17, 7, 3, 32, ZSTD_btopt},    /* level 16.*/
-+	{17, 18, 17, 7, 3, 64, ZSTD_btopt},    /* level 17.*/
-+	{17, 18, 17, 7, 3, 256, ZSTD_btopt},   /* level 18.*/
-+	{17, 18, 17, 8, 3, 256, ZSTD_btopt},   /* level 19.*/
-+	{17, 18, 17, 9, 3, 256, ZSTD_btopt2},  /* level 20.*/
-+	{17, 18, 17, 10, 3, 256, ZSTD_btopt2}, /* level 21.*/
-+	{17, 18, 17, 11, 3, 512, ZSTD_btopt2}, /* level 22.*/
-+    },
-+    {
-+	/* for srcSize <= 16 KB */
-+	/* W,  C,  H,  S,  L,  T, strat */
-+	{14, 12, 12, 1, 7, 6, ZSTD_fast},      /* level  0 - not used */
-+	{14, 14, 14, 1, 6, 6, ZSTD_fast},      /* level  1 */
-+	{14, 14, 14, 1, 4, 6, ZSTD_fast},      /* level  2 */
-+	{14, 14, 14, 1, 4, 6, ZSTD_dfast},     /* level  3.*/
-+	{14, 14, 14, 4, 4, 6, ZSTD_greedy},    /* level  4.*/
-+	{14, 14, 14, 3, 4, 6, ZSTD_lazy},      /* level  5.*/
-+	{14, 14, 14, 4, 4, 6, ZSTD_lazy2},     /* level  6 */
-+	{14, 14, 14, 5, 4, 6, ZSTD_lazy2},     /* level  7 */
-+	{14, 14, 14, 6, 4, 6, ZSTD_lazy2},     /* level  8.*/
-+	{14, 15, 14, 6, 4, 6, ZSTD_btlazy2},   /* level  9.*/
-+	{14, 15, 14, 3, 3, 6, ZSTD_btopt},     /* level 10.*/
-+	{14, 15, 14, 6, 3, 8, ZSTD_btopt},     /* level 11.*/
-+	{14, 15, 14, 6, 3, 16, ZSTD_btopt},    /* level 12.*/
-+	{14, 15, 14, 6, 3, 24, ZSTD_btopt},    /* level 13.*/
-+	{14, 15, 15, 6, 3, 48, ZSTD_btopt},    /* level 14.*/
-+	{14, 15, 15, 6, 3, 64, ZSTD_btopt},    /* level 15.*/
-+	{14, 15, 15, 6, 3, 96, ZSTD_btopt},    /* level 16.*/
-+	{14, 15, 15, 6, 3, 128, ZSTD_btopt},   /* level 17.*/
-+	{14, 15, 15, 6, 3, 256, ZSTD_btopt},   /* level 18.*/
-+	{14, 15, 15, 7, 3, 256, ZSTD_btopt},   /* level 19.*/
-+	{14, 15, 15, 8, 3, 256, ZSTD_btopt2},  /* level 20.*/
-+	{14, 15, 15, 9, 3, 256, ZSTD_btopt2},  /* level 21.*/
-+	{14, 15, 15, 10, 3, 256, ZSTD_btopt2}, /* level 22.*/
-+    },
-+};
-+
-+/*! ZSTD_getCParams() :
-+*   @return ZSTD_compressionParameters structure for a selected compression level, `srcSize` and `dictSize`.
-+*   Size values are optional, provide 0 if not known or unused */
-+ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long srcSize, size_t dictSize)
-+{
-+	ZSTD_compressionParameters cp;
-+	size_t const addedSize = srcSize ? 0 : 500;
-+	U64 const rSize = srcSize + dictSize ? srcSize + dictSize + addedSize : (U64)-1;
-+	U32 const tableID = (rSize <= 256 KB) + (rSize <= 128 KB) + (rSize <= 16 KB); /* intentional underflow for srcSizeHint == 0 */
-+	if (compressionLevel <= 0)
-+		compressionLevel = ZSTD_DEFAULT_CLEVEL; /* 0 == default; no negative compressionLevel yet */
-+	if (compressionLevel > ZSTD_MAX_CLEVEL)
-+		compressionLevel = ZSTD_MAX_CLEVEL;
-+	cp = ZSTD_defaultCParameters[tableID][compressionLevel];
-+	if (ZSTD_32bits()) { /* auto-correction, for 32-bits mode */
-+		if (cp.windowLog > ZSTD_WINDOWLOG_MAX)
-+			cp.windowLog = ZSTD_WINDOWLOG_MAX;
-+		if (cp.chainLog > ZSTD_CHAINLOG_MAX)
-+			cp.chainLog = ZSTD_CHAINLOG_MAX;
-+		if (cp.hashLog > ZSTD_HASHLOG_MAX)
-+			cp.hashLog = ZSTD_HASHLOG_MAX;
-+	}
-+	cp = ZSTD_adjustCParams(cp, srcSize, dictSize);
-+	return cp;
-+}
-+
-+/*! ZSTD_getParams() :
-+*   same as ZSTD_getCParams(), but @return a `ZSTD_parameters` object (instead of `ZSTD_compressionParameters`).
-+*   All fields of `ZSTD_frameParameters` are set to default (0) */
-+ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSize, size_t dictSize)
-+{
-+	ZSTD_parameters params;
-+	ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, srcSize, dictSize);
-+	memset(¶ms, 0, sizeof(params));
-+	params.cParams = cParams;
-+	return params;
-+}
-+
-+EXPORT_SYMBOL(ZSTD_maxCLevel);
-+EXPORT_SYMBOL(ZSTD_compressBound);
-+
-+EXPORT_SYMBOL(ZSTD_CCtxWorkspaceBound);
-+EXPORT_SYMBOL(ZSTD_initCCtx);
-+EXPORT_SYMBOL(ZSTD_compressCCtx);
-+EXPORT_SYMBOL(ZSTD_compress_usingDict);
-+
-+EXPORT_SYMBOL(ZSTD_CDictWorkspaceBound);
-+EXPORT_SYMBOL(ZSTD_initCDict);
-+EXPORT_SYMBOL(ZSTD_compress_usingCDict);
-+
-+EXPORT_SYMBOL(ZSTD_CStreamWorkspaceBound);
-+EXPORT_SYMBOL(ZSTD_initCStream);
-+EXPORT_SYMBOL(ZSTD_initCStream_usingCDict);
-+EXPORT_SYMBOL(ZSTD_resetCStream);
-+EXPORT_SYMBOL(ZSTD_compressStream);
-+EXPORT_SYMBOL(ZSTD_flushStream);
-+EXPORT_SYMBOL(ZSTD_endStream);
-+EXPORT_SYMBOL(ZSTD_CStreamInSize);
-+EXPORT_SYMBOL(ZSTD_CStreamOutSize);
-+
-+EXPORT_SYMBOL(ZSTD_getCParams);
-+EXPORT_SYMBOL(ZSTD_getParams);
-+EXPORT_SYMBOL(ZSTD_checkCParams);
-+EXPORT_SYMBOL(ZSTD_adjustCParams);
-+
-+EXPORT_SYMBOL(ZSTD_compressBegin);
-+EXPORT_SYMBOL(ZSTD_compressBegin_usingDict);
-+EXPORT_SYMBOL(ZSTD_compressBegin_advanced);
-+EXPORT_SYMBOL(ZSTD_copyCCtx);
-+EXPORT_SYMBOL(ZSTD_compressBegin_usingCDict);
-+EXPORT_SYMBOL(ZSTD_compressContinue);
-+EXPORT_SYMBOL(ZSTD_compressEnd);
-+
-+EXPORT_SYMBOL(ZSTD_getBlockSizeMax);
-+EXPORT_SYMBOL(ZSTD_compressBlock);
-+
-+MODULE_LICENSE("Dual BSD/GPL");
-+MODULE_DESCRIPTION("Zstd Compressor");
-diff --git a/lib/zstd/decompress.c b/lib/zstd/decompress.c
-new file mode 100644
-index 0000000..72df4828
---- /dev/null
-+++ b/lib/zstd/decompress.c
-@@ -0,0 +1,2526 @@
-+/**
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+/* ***************************************************************
-+*  Tuning parameters
-+*****************************************************************/
-+/*!
-+*  MAXWINDOWSIZE_DEFAULT :
-+*  maximum window size accepted by DStream, by default.
-+*  Frames requiring more memory will be rejected.
-+*/
-+#ifndef ZSTD_MAXWINDOWSIZE_DEFAULT
-+#define ZSTD_MAXWINDOWSIZE_DEFAULT ((1 << ZSTD_WINDOWLOG_MAX) + 1) /* defined within zstd.h */
-+#endif
-+
-+/*-*******************************************************
-+*  Dependencies
-+*********************************************************/
-+#include "fse.h"
-+#include "huf.h"
-+#include "mem.h" /* low level memory routines */
-+#include "zstd_internal.h"
-+#include 
-+#include 
-+#include  /* memcpy, memmove, memset */
-+
-+#define ZSTD_PREFETCH(ptr) __builtin_prefetch(ptr, 0, 0)
-+
-+/*-*************************************
-+*  Macros
-+***************************************/
-+#define ZSTD_isError ERR_isError /* for inlining */
-+#define FSE_isError ERR_isError
-+#define HUF_isError ERR_isError
-+
-+/*_*******************************************************
-+*  Memory operations
-+**********************************************************/
-+static void ZSTD_copy4(void *dst, const void *src) { memcpy(dst, src, 4); }
-+
-+/*-*************************************************************
-+*   Context management
-+***************************************************************/
-+typedef enum {
-+	ZSTDds_getFrameHeaderSize,
-+	ZSTDds_decodeFrameHeader,
-+	ZSTDds_decodeBlockHeader,
-+	ZSTDds_decompressBlock,
-+	ZSTDds_decompressLastBlock,
-+	ZSTDds_checkChecksum,
-+	ZSTDds_decodeSkippableHeader,
-+	ZSTDds_skipFrame
-+} ZSTD_dStage;
-+
-+typedef struct {
-+	FSE_DTable LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
-+	FSE_DTable OFTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
-+	FSE_DTable MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
-+	HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)]; /* can accommodate HUF_decompress4X */
-+	U64 workspace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32 / 2];
-+	U32 rep[ZSTD_REP_NUM];
-+} ZSTD_entropyTables_t;
-+
-+struct ZSTD_DCtx_s {
-+	const FSE_DTable *LLTptr;
-+	const FSE_DTable *MLTptr;
-+	const FSE_DTable *OFTptr;
-+	const HUF_DTable *HUFptr;
-+	ZSTD_entropyTables_t entropy;
-+	const void *previousDstEnd; /* detect continuity */
-+	const void *base;	   /* start of curr segment */
-+	const void *vBase;	  /* virtual start of previous segment if it was just before curr one */
-+	const void *dictEnd;	/* end of previous segment */
-+	size_t expected;
-+	ZSTD_frameParams fParams;
-+	blockType_e bType; /* used in ZSTD_decompressContinue(), to transfer blockType between header decoding and block decoding stages */
-+	ZSTD_dStage stage;
-+	U32 litEntropy;
-+	U32 fseEntropy;
-+	struct xxh64_state xxhState;
-+	size_t headerSize;
-+	U32 dictID;
-+	const BYTE *litPtr;
-+	ZSTD_customMem customMem;
-+	size_t litSize;
-+	size_t rleSize;
-+	BYTE litBuffer[ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH];
-+	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
-+}; /* typedef'd to ZSTD_DCtx within "zstd.h" */
-+
-+size_t ZSTD_DCtxWorkspaceBound(void) { return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_DCtx)); }
-+
-+size_t ZSTD_decompressBegin(ZSTD_DCtx *dctx)
-+{
-+	dctx->expected = ZSTD_frameHeaderSize_prefix;
-+	dctx->stage = ZSTDds_getFrameHeaderSize;
-+	dctx->previousDstEnd = NULL;
-+	dctx->base = NULL;
-+	dctx->vBase = NULL;
-+	dctx->dictEnd = NULL;
-+	dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001); /* cover both little and big endian */
-+	dctx->litEntropy = dctx->fseEntropy = 0;
-+	dctx->dictID = 0;
-+	ZSTD_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
-+	memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue)); /* initial repcodes */
-+	dctx->LLTptr = dctx->entropy.LLTable;
-+	dctx->MLTptr = dctx->entropy.MLTable;
-+	dctx->OFTptr = dctx->entropy.OFTable;
-+	dctx->HUFptr = dctx->entropy.hufTable;
-+	return 0;
-+}
-+
-+ZSTD_DCtx *ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
-+{
-+	ZSTD_DCtx *dctx;
-+
-+	if (!customMem.customAlloc || !customMem.customFree)
-+		return NULL;
-+
-+	dctx = (ZSTD_DCtx *)ZSTD_malloc(sizeof(ZSTD_DCtx), customMem);
-+	if (!dctx)
-+		return NULL;
-+	memcpy(&dctx->customMem, &customMem, sizeof(customMem));
-+	ZSTD_decompressBegin(dctx);
-+	return dctx;
-+}
-+
-+ZSTD_DCtx *ZSTD_initDCtx(void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-+	return ZSTD_createDCtx_advanced(stackMem);
-+}
-+
-+size_t ZSTD_freeDCtx(ZSTD_DCtx *dctx)
-+{
-+	if (dctx == NULL)
-+		return 0; /* support free on NULL */
-+	ZSTD_free(dctx, dctx->customMem);
-+	return 0; /* reserved as a potential error code in the future */
-+}
-+
-+void ZSTD_copyDCtx(ZSTD_DCtx *dstDCtx, const ZSTD_DCtx *srcDCtx)
-+{
-+	size_t const workSpaceSize = (ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH) + ZSTD_frameHeaderSize_max;
-+	memcpy(dstDCtx, srcDCtx, sizeof(ZSTD_DCtx) - workSpaceSize); /* no need to copy workspace */
-+}
-+
-+static void ZSTD_refDDict(ZSTD_DCtx *dstDCtx, const ZSTD_DDict *ddict);
-+
-+/*-*************************************************************
-+*   Decompression section
-+***************************************************************/
-+
-+/*! ZSTD_isFrame() :
-+ *  Tells if the content of `buffer` starts with a valid Frame Identifier.
-+ *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
-+ *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
-+ *  Note 3 : Skippable Frame Identifiers are considered valid. */
-+unsigned ZSTD_isFrame(const void *buffer, size_t size)
-+{
-+	if (size < 4)
-+		return 0;
-+	{
-+		U32 const magic = ZSTD_readLE32(buffer);
-+		if (magic == ZSTD_MAGICNUMBER)
-+			return 1;
-+		if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START)
-+			return 1;
-+	}
-+	return 0;
-+}
-+
-+/** ZSTD_frameHeaderSize() :
-+*   srcSize must be >= ZSTD_frameHeaderSize_prefix.
-+*   @return : size of the Frame Header */
-+static size_t ZSTD_frameHeaderSize(const void *src, size_t srcSize)
-+{
-+	if (srcSize < ZSTD_frameHeaderSize_prefix)
-+		return ERROR(srcSize_wrong);
-+	{
-+		BYTE const fhd = ((const BYTE *)src)[4];
-+		U32 const dictID = fhd & 3;
-+		U32 const singleSegment = (fhd >> 5) & 1;
-+		U32 const fcsId = fhd >> 6;
-+		return ZSTD_frameHeaderSize_prefix + !singleSegment + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId] + (singleSegment && !fcsId);
-+	}
-+}
-+
-+/** ZSTD_getFrameParams() :
-+*   decode Frame Header, or require larger `srcSize`.
-+*   @return : 0, `fparamsPtr` is correctly filled,
-+*            >0, `srcSize` is too small, result is expected `srcSize`,
-+*             or an error code, which can be tested using ZSTD_isError() */
-+size_t ZSTD_getFrameParams(ZSTD_frameParams *fparamsPtr, const void *src, size_t srcSize)
-+{
-+	const BYTE *ip = (const BYTE *)src;
-+
-+	if (srcSize < ZSTD_frameHeaderSize_prefix)
-+		return ZSTD_frameHeaderSize_prefix;
-+	if (ZSTD_readLE32(src) != ZSTD_MAGICNUMBER) {
-+		if ((ZSTD_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-+			if (srcSize < ZSTD_skippableHeaderSize)
-+				return ZSTD_skippableHeaderSize; /* magic number + skippable frame length */
-+			memset(fparamsPtr, 0, sizeof(*fparamsPtr));
-+			fparamsPtr->frameContentSize = ZSTD_readLE32((const char *)src + 4);
-+			fparamsPtr->windowSize = 0; /* windowSize==0 means a frame is skippable */
-+			return 0;
-+		}
-+		return ERROR(prefix_unknown);
-+	}
-+
-+	/* ensure there is enough `srcSize` to fully read/decode frame header */
-+	{
-+		size_t const fhsize = ZSTD_frameHeaderSize(src, srcSize);
-+		if (srcSize < fhsize)
-+			return fhsize;
-+	}
-+
-+	{
-+		BYTE const fhdByte = ip[4];
-+		size_t pos = 5;
-+		U32 const dictIDSizeCode = fhdByte & 3;
-+		U32 const checksumFlag = (fhdByte >> 2) & 1;
-+		U32 const singleSegment = (fhdByte >> 5) & 1;
-+		U32 const fcsID = fhdByte >> 6;
-+		U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;
-+		U32 windowSize = 0;
-+		U32 dictID = 0;
-+		U64 frameContentSize = 0;
-+		if ((fhdByte & 0x08) != 0)
-+			return ERROR(frameParameter_unsupported); /* reserved bits, which must be zero */
-+		if (!singleSegment) {
-+			BYTE const wlByte = ip[pos++];
-+			U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
-+			if (windowLog > ZSTD_WINDOWLOG_MAX)
-+				return ERROR(frameParameter_windowTooLarge); /* avoids issue with 1 << windowLog */
-+			windowSize = (1U << windowLog);
-+			windowSize += (windowSize >> 3) * (wlByte & 7);
-+		}
-+
-+		switch (dictIDSizeCode) {
-+		default: /* impossible */
-+		case 0: break;
-+		case 1:
-+			dictID = ip[pos];
-+			pos++;
-+			break;
-+		case 2:
-+			dictID = ZSTD_readLE16(ip + pos);
-+			pos += 2;
-+			break;
-+		case 3:
-+			dictID = ZSTD_readLE32(ip + pos);
-+			pos += 4;
-+			break;
-+		}
-+		switch (fcsID) {
-+		default: /* impossible */
-+		case 0:
-+			if (singleSegment)
-+				frameContentSize = ip[pos];
-+			break;
-+		case 1: frameContentSize = ZSTD_readLE16(ip + pos) + 256; break;
-+		case 2: frameContentSize = ZSTD_readLE32(ip + pos); break;
-+		case 3: frameContentSize = ZSTD_readLE64(ip + pos); break;
-+		}
-+		if (!windowSize)
-+			windowSize = (U32)frameContentSize;
-+		if (windowSize > windowSizeMax)
-+			return ERROR(frameParameter_windowTooLarge);
-+		fparamsPtr->frameContentSize = frameContentSize;
-+		fparamsPtr->windowSize = windowSize;
-+		fparamsPtr->dictID = dictID;
-+		fparamsPtr->checksumFlag = checksumFlag;
-+	}
-+	return 0;
-+}
-+
-+/** ZSTD_getFrameContentSize() :
-+*   compatible with legacy mode
-+*   @return : decompressed size of the single frame pointed to be `src` if known, otherwise
-+*             - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
-+*             - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
-+unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
-+{
-+	{
-+		ZSTD_frameParams fParams;
-+		if (ZSTD_getFrameParams(&fParams, src, srcSize) != 0)
-+			return ZSTD_CONTENTSIZE_ERROR;
-+		if (fParams.windowSize == 0) {
-+			/* Either skippable or empty frame, size == 0 either way */
-+			return 0;
-+		} else if (fParams.frameContentSize != 0) {
-+			return fParams.frameContentSize;
-+		} else {
-+			return ZSTD_CONTENTSIZE_UNKNOWN;
-+		}
-+	}
-+}
-+
-+/** ZSTD_findDecompressedSize() :
-+ *  compatible with legacy mode
-+ *  `srcSize` must be the exact length of some number of ZSTD compressed and/or
-+ *      skippable frames
-+ *  @return : decompressed size of the frames contained */
-+unsigned long long ZSTD_findDecompressedSize(const void *src, size_t srcSize)
-+{
-+	{
-+		unsigned long long totalDstSize = 0;
-+		while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-+			const U32 magicNumber = ZSTD_readLE32(src);
-+
-+			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-+				size_t skippableSize;
-+				if (srcSize < ZSTD_skippableHeaderSize)
-+					return ERROR(srcSize_wrong);
-+				skippableSize = ZSTD_readLE32((const BYTE *)src + 4) + ZSTD_skippableHeaderSize;
-+				if (srcSize < skippableSize) {
-+					return ZSTD_CONTENTSIZE_ERROR;
-+				}
-+
-+				src = (const BYTE *)src + skippableSize;
-+				srcSize -= skippableSize;
-+				continue;
-+			}
-+
-+			{
-+				unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-+				if (ret >= ZSTD_CONTENTSIZE_ERROR)
-+					return ret;
-+
-+				/* check for overflow */
-+				if (totalDstSize + ret < totalDstSize)
-+					return ZSTD_CONTENTSIZE_ERROR;
-+				totalDstSize += ret;
-+			}
-+			{
-+				size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
-+				if (ZSTD_isError(frameSrcSize)) {
-+					return ZSTD_CONTENTSIZE_ERROR;
-+				}
-+
-+				src = (const BYTE *)src + frameSrcSize;
-+				srcSize -= frameSrcSize;
-+			}
-+		}
-+
-+		if (srcSize) {
-+			return ZSTD_CONTENTSIZE_ERROR;
-+		}
-+
-+		return totalDstSize;
-+	}
-+}
-+
-+/** ZSTD_decodeFrameHeader() :
-+*   `headerSize` must be the size provided by ZSTD_frameHeaderSize().
-+*   @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
-+static size_t ZSTD_decodeFrameHeader(ZSTD_DCtx *dctx, const void *src, size_t headerSize)
-+{
-+	size_t const result = ZSTD_getFrameParams(&(dctx->fParams), src, headerSize);
-+	if (ZSTD_isError(result))
-+		return result; /* invalid header */
-+	if (result > 0)
-+		return ERROR(srcSize_wrong); /* headerSize too small */
-+	if (dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID))
-+		return ERROR(dictionary_wrong);
-+	if (dctx->fParams.checksumFlag)
-+		xxh64_reset(&dctx->xxhState, 0);
-+	return 0;
-+}
-+
-+typedef struct {
-+	blockType_e blockType;
-+	U32 lastBlock;
-+	U32 origSize;
-+} blockProperties_t;
-+
-+/*! ZSTD_getcBlockSize() :
-+*   Provides the size of compressed block from block header `src` */
-+size_t ZSTD_getcBlockSize(const void *src, size_t srcSize, blockProperties_t *bpPtr)
-+{
-+	if (srcSize < ZSTD_blockHeaderSize)
-+		return ERROR(srcSize_wrong);
-+	{
-+		U32 const cBlockHeader = ZSTD_readLE24(src);
-+		U32 const cSize = cBlockHeader >> 3;
-+		bpPtr->lastBlock = cBlockHeader & 1;
-+		bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
-+		bpPtr->origSize = cSize; /* only useful for RLE */
-+		if (bpPtr->blockType == bt_rle)
-+			return 1;
-+		if (bpPtr->blockType == bt_reserved)
-+			return ERROR(corruption_detected);
-+		return cSize;
-+	}
-+}
-+
-+static size_t ZSTD_copyRawBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	if (srcSize > dstCapacity)
-+		return ERROR(dstSize_tooSmall);
-+	memcpy(dst, src, srcSize);
-+	return srcSize;
-+}
-+
-+static size_t ZSTD_setRleBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize, size_t regenSize)
-+{
-+	if (srcSize != 1)
-+		return ERROR(srcSize_wrong);
-+	if (regenSize > dstCapacity)
-+		return ERROR(dstSize_tooSmall);
-+	memset(dst, *(const BYTE *)src, regenSize);
-+	return regenSize;
-+}
-+
-+/*! ZSTD_decodeLiteralsBlock() :
-+	@return : nb of bytes read from src (< srcSize ) */
-+size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx *dctx, const void *src, size_t srcSize) /* note : srcSize < BLOCKSIZE */
-+{
-+	if (srcSize < MIN_CBLOCK_SIZE)
-+		return ERROR(corruption_detected);
-+
-+	{
-+		const BYTE *const istart = (const BYTE *)src;
-+		symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
-+
-+		switch (litEncType) {
-+		case set_repeat:
-+			if (dctx->litEntropy == 0)
-+				return ERROR(dictionary_corrupted);
-+		/* fall-through */
-+		case set_compressed:
-+			if (srcSize < 5)
-+				return ERROR(corruption_detected); /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3 */
-+			{
-+				size_t lhSize, litSize, litCSize;
-+				U32 singleStream = 0;
-+				U32 const lhlCode = (istart[0] >> 2) & 3;
-+				U32 const lhc = ZSTD_readLE32(istart);
-+				switch (lhlCode) {
-+				case 0:
-+				case 1:
-+				default: /* note : default is impossible, since lhlCode into [0..3] */
-+					/* 2 - 2 - 10 - 10 */
-+					singleStream = !lhlCode;
-+					lhSize = 3;
-+					litSize = (lhc >> 4) & 0x3FF;
-+					litCSize = (lhc >> 14) & 0x3FF;
-+					break;
-+				case 2:
-+					/* 2 - 2 - 14 - 14 */
-+					lhSize = 4;
-+					litSize = (lhc >> 4) & 0x3FFF;
-+					litCSize = lhc >> 18;
-+					break;
-+				case 3:
-+					/* 2 - 2 - 18 - 18 */
-+					lhSize = 5;
-+					litSize = (lhc >> 4) & 0x3FFFF;
-+					litCSize = (lhc >> 22) + (istart[4] << 10);
-+					break;
-+				}
-+				if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX)
-+					return ERROR(corruption_detected);
-+				if (litCSize + lhSize > srcSize)
-+					return ERROR(corruption_detected);
-+
-+				if (HUF_isError(
-+					(litEncType == set_repeat)
-+					    ? (singleStream ? HUF_decompress1X_usingDTable(dctx->litBuffer, litSize, istart + lhSize, litCSize, dctx->HUFptr)
-+							    : HUF_decompress4X_usingDTable(dctx->litBuffer, litSize, istart + lhSize, litCSize, dctx->HUFptr))
-+					    : (singleStream
-+						   ? HUF_decompress1X2_DCtx_wksp(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart + lhSize, litCSize,
-+										 dctx->entropy.workspace, sizeof(dctx->entropy.workspace))
-+						   : HUF_decompress4X_hufOnly_wksp(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart + lhSize, litCSize,
-+										   dctx->entropy.workspace, sizeof(dctx->entropy.workspace)))))
-+					return ERROR(corruption_detected);
-+
-+				dctx->litPtr = dctx->litBuffer;
-+				dctx->litSize = litSize;
-+				dctx->litEntropy = 1;
-+				if (litEncType == set_compressed)
-+					dctx->HUFptr = dctx->entropy.hufTable;
-+				memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-+				return litCSize + lhSize;
-+			}
-+
-+		case set_basic: {
-+			size_t litSize, lhSize;
-+			U32 const lhlCode = ((istart[0]) >> 2) & 3;
-+			switch (lhlCode) {
-+			case 0:
-+			case 2:
-+			default: /* note : default is impossible, since lhlCode into [0..3] */
-+				lhSize = 1;
-+				litSize = istart[0] >> 3;
-+				break;
-+			case 1:
-+				lhSize = 2;
-+				litSize = ZSTD_readLE16(istart) >> 4;
-+				break;
-+			case 3:
-+				lhSize = 3;
-+				litSize = ZSTD_readLE24(istart) >> 4;
-+				break;
-+			}
-+
-+			if (lhSize + litSize + WILDCOPY_OVERLENGTH > srcSize) { /* risk reading beyond src buffer with wildcopy */
-+				if (litSize + lhSize > srcSize)
-+					return ERROR(corruption_detected);
-+				memcpy(dctx->litBuffer, istart + lhSize, litSize);
-+				dctx->litPtr = dctx->litBuffer;
-+				dctx->litSize = litSize;
-+				memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-+				return lhSize + litSize;
-+			}
-+			/* direct reference into compressed stream */
-+			dctx->litPtr = istart + lhSize;
-+			dctx->litSize = litSize;
-+			return lhSize + litSize;
-+		}
-+
-+		case set_rle: {
-+			U32 const lhlCode = ((istart[0]) >> 2) & 3;
-+			size_t litSize, lhSize;
-+			switch (lhlCode) {
-+			case 0:
-+			case 2:
-+			default: /* note : default is impossible, since lhlCode into [0..3] */
-+				lhSize = 1;
-+				litSize = istart[0] >> 3;
-+				break;
-+			case 1:
-+				lhSize = 2;
-+				litSize = ZSTD_readLE16(istart) >> 4;
-+				break;
-+			case 3:
-+				lhSize = 3;
-+				litSize = ZSTD_readLE24(istart) >> 4;
-+				if (srcSize < 4)
-+					return ERROR(corruption_detected); /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4 */
-+				break;
-+			}
-+			if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX)
-+				return ERROR(corruption_detected);
-+			memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
-+			dctx->litPtr = dctx->litBuffer;
-+			dctx->litSize = litSize;
-+			return lhSize + 1;
-+		}
-+		default:
-+			return ERROR(corruption_detected); /* impossible */
-+		}
-+	}
-+}
-+
-+typedef union {
-+	FSE_decode_t realData;
-+	U32 alignedBy4;
-+} FSE_decode_t4;
-+
-+static const FSE_decode_t4 LL_defaultDTable[(1 << LL_DEFAULTNORMLOG) + 1] = {
-+    {{LL_DEFAULTNORMLOG, 1, 1}}, /* header : tableLog, fastMode, fastMode */
-+    {{0, 0, 4}},		 /* 0 : base, symbol, bits */
-+    {{16, 0, 4}},
-+    {{32, 1, 5}},
-+    {{0, 3, 5}},
-+    {{0, 4, 5}},
-+    {{0, 6, 5}},
-+    {{0, 7, 5}},
-+    {{0, 9, 5}},
-+    {{0, 10, 5}},
-+    {{0, 12, 5}},
-+    {{0, 14, 6}},
-+    {{0, 16, 5}},
-+    {{0, 18, 5}},
-+    {{0, 19, 5}},
-+    {{0, 21, 5}},
-+    {{0, 22, 5}},
-+    {{0, 24, 5}},
-+    {{32, 25, 5}},
-+    {{0, 26, 5}},
-+    {{0, 27, 6}},
-+    {{0, 29, 6}},
-+    {{0, 31, 6}},
-+    {{32, 0, 4}},
-+    {{0, 1, 4}},
-+    {{0, 2, 5}},
-+    {{32, 4, 5}},
-+    {{0, 5, 5}},
-+    {{32, 7, 5}},
-+    {{0, 8, 5}},
-+    {{32, 10, 5}},
-+    {{0, 11, 5}},
-+    {{0, 13, 6}},
-+    {{32, 16, 5}},
-+    {{0, 17, 5}},
-+    {{32, 19, 5}},
-+    {{0, 20, 5}},
-+    {{32, 22, 5}},
-+    {{0, 23, 5}},
-+    {{0, 25, 4}},
-+    {{16, 25, 4}},
-+    {{32, 26, 5}},
-+    {{0, 28, 6}},
-+    {{0, 30, 6}},
-+    {{48, 0, 4}},
-+    {{16, 1, 4}},
-+    {{32, 2, 5}},
-+    {{32, 3, 5}},
-+    {{32, 5, 5}},
-+    {{32, 6, 5}},
-+    {{32, 8, 5}},
-+    {{32, 9, 5}},
-+    {{32, 11, 5}},
-+    {{32, 12, 5}},
-+    {{0, 15, 6}},
-+    {{32, 17, 5}},
-+    {{32, 18, 5}},
-+    {{32, 20, 5}},
-+    {{32, 21, 5}},
-+    {{32, 23, 5}},
-+    {{32, 24, 5}},
-+    {{0, 35, 6}},
-+    {{0, 34, 6}},
-+    {{0, 33, 6}},
-+    {{0, 32, 6}},
-+}; /* LL_defaultDTable */
-+
-+static const FSE_decode_t4 ML_defaultDTable[(1 << ML_DEFAULTNORMLOG) + 1] = {
-+    {{ML_DEFAULTNORMLOG, 1, 1}}, /* header : tableLog, fastMode, fastMode */
-+    {{0, 0, 6}},		 /* 0 : base, symbol, bits */
-+    {{0, 1, 4}},
-+    {{32, 2, 5}},
-+    {{0, 3, 5}},
-+    {{0, 5, 5}},
-+    {{0, 6, 5}},
-+    {{0, 8, 5}},
-+    {{0, 10, 6}},
-+    {{0, 13, 6}},
-+    {{0, 16, 6}},
-+    {{0, 19, 6}},
-+    {{0, 22, 6}},
-+    {{0, 25, 6}},
-+    {{0, 28, 6}},
-+    {{0, 31, 6}},
-+    {{0, 33, 6}},
-+    {{0, 35, 6}},
-+    {{0, 37, 6}},
-+    {{0, 39, 6}},
-+    {{0, 41, 6}},
-+    {{0, 43, 6}},
-+    {{0, 45, 6}},
-+    {{16, 1, 4}},
-+    {{0, 2, 4}},
-+    {{32, 3, 5}},
-+    {{0, 4, 5}},
-+    {{32, 6, 5}},
-+    {{0, 7, 5}},
-+    {{0, 9, 6}},
-+    {{0, 12, 6}},
-+    {{0, 15, 6}},
-+    {{0, 18, 6}},
-+    {{0, 21, 6}},
-+    {{0, 24, 6}},
-+    {{0, 27, 6}},
-+    {{0, 30, 6}},
-+    {{0, 32, 6}},
-+    {{0, 34, 6}},
-+    {{0, 36, 6}},
-+    {{0, 38, 6}},
-+    {{0, 40, 6}},
-+    {{0, 42, 6}},
-+    {{0, 44, 6}},
-+    {{32, 1, 4}},
-+    {{48, 1, 4}},
-+    {{16, 2, 4}},
-+    {{32, 4, 5}},
-+    {{32, 5, 5}},
-+    {{32, 7, 5}},
-+    {{32, 8, 5}},
-+    {{0, 11, 6}},
-+    {{0, 14, 6}},
-+    {{0, 17, 6}},
-+    {{0, 20, 6}},
-+    {{0, 23, 6}},
-+    {{0, 26, 6}},
-+    {{0, 29, 6}},
-+    {{0, 52, 6}},
-+    {{0, 51, 6}},
-+    {{0, 50, 6}},
-+    {{0, 49, 6}},
-+    {{0, 48, 6}},
-+    {{0, 47, 6}},
-+    {{0, 46, 6}},
-+}; /* ML_defaultDTable */
-+
-+static const FSE_decode_t4 OF_defaultDTable[(1 << OF_DEFAULTNORMLOG) + 1] = {
-+    {{OF_DEFAULTNORMLOG, 1, 1}}, /* header : tableLog, fastMode, fastMode */
-+    {{0, 0, 5}},		 /* 0 : base, symbol, bits */
-+    {{0, 6, 4}},
-+    {{0, 9, 5}},
-+    {{0, 15, 5}},
-+    {{0, 21, 5}},
-+    {{0, 3, 5}},
-+    {{0, 7, 4}},
-+    {{0, 12, 5}},
-+    {{0, 18, 5}},
-+    {{0, 23, 5}},
-+    {{0, 5, 5}},
-+    {{0, 8, 4}},
-+    {{0, 14, 5}},
-+    {{0, 20, 5}},
-+    {{0, 2, 5}},
-+    {{16, 7, 4}},
-+    {{0, 11, 5}},
-+    {{0, 17, 5}},
-+    {{0, 22, 5}},
-+    {{0, 4, 5}},
-+    {{16, 8, 4}},
-+    {{0, 13, 5}},
-+    {{0, 19, 5}},
-+    {{0, 1, 5}},
-+    {{16, 6, 4}},
-+    {{0, 10, 5}},
-+    {{0, 16, 5}},
-+    {{0, 28, 5}},
-+    {{0, 27, 5}},
-+    {{0, 26, 5}},
-+    {{0, 25, 5}},
-+    {{0, 24, 5}},
-+}; /* OF_defaultDTable */
-+
-+/*! ZSTD_buildSeqTable() :
-+	@return : nb bytes read from src,
-+			  or an error code if it fails, testable with ZSTD_isError()
-+*/
-+static size_t ZSTD_buildSeqTable(FSE_DTable *DTableSpace, const FSE_DTable **DTablePtr, symbolEncodingType_e type, U32 max, U32 maxLog, const void *src,
-+				 size_t srcSize, const FSE_decode_t4 *defaultTable, U32 flagRepeatTable, void *workspace, size_t workspaceSize)
-+{
-+	const void *const tmpPtr = defaultTable; /* bypass strict aliasing */
-+	switch (type) {
-+	case set_rle:
-+		if (!srcSize)
-+			return ERROR(srcSize_wrong);
-+		if ((*(const BYTE *)src) > max)
-+			return ERROR(corruption_detected);
-+		FSE_buildDTable_rle(DTableSpace, *(const BYTE *)src);
-+		*DTablePtr = DTableSpace;
-+		return 1;
-+	case set_basic: *DTablePtr = (const FSE_DTable *)tmpPtr; return 0;
-+	case set_repeat:
-+		if (!flagRepeatTable)
-+			return ERROR(corruption_detected);
-+		return 0;
-+	default: /* impossible */
-+	case set_compressed: {
-+		U32 tableLog;
-+		S16 *norm = (S16 *)workspace;
-+		size_t const spaceUsed32 = ALIGN(sizeof(S16) * (MaxSeq + 1), sizeof(U32)) >> 2;
-+
-+		if ((spaceUsed32 << 2) > workspaceSize)
-+			return ERROR(GENERIC);
-+		workspace = (U32 *)workspace + spaceUsed32;
-+		workspaceSize -= (spaceUsed32 << 2);
-+		{
-+			size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
-+			if (FSE_isError(headerSize))
-+				return ERROR(corruption_detected);
-+			if (tableLog > maxLog)
-+				return ERROR(corruption_detected);
-+			FSE_buildDTable_wksp(DTableSpace, norm, max, tableLog, workspace, workspaceSize);
-+			*DTablePtr = DTableSpace;
-+			return headerSize;
-+		}
-+	}
-+	}
-+}
-+
-+size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx *dctx, int *nbSeqPtr, const void *src, size_t srcSize)
-+{
-+	const BYTE *const istart = (const BYTE *const)src;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *ip = istart;
-+
-+	/* check */
-+	if (srcSize < MIN_SEQUENCES_SIZE)
-+		return ERROR(srcSize_wrong);
-+
-+	/* SeqHead */
-+	{
-+		int nbSeq = *ip++;
-+		if (!nbSeq) {
-+			*nbSeqPtr = 0;
-+			return 1;
-+		}
-+		if (nbSeq > 0x7F) {
-+			if (nbSeq == 0xFF) {
-+				if (ip + 2 > iend)
-+					return ERROR(srcSize_wrong);
-+				nbSeq = ZSTD_readLE16(ip) + LONGNBSEQ, ip += 2;
-+			} else {
-+				if (ip >= iend)
-+					return ERROR(srcSize_wrong);
-+				nbSeq = ((nbSeq - 0x80) << 8) + *ip++;
-+			}
-+		}
-+		*nbSeqPtr = nbSeq;
-+	}
-+
-+	/* FSE table descriptors */
-+	if (ip + 4 > iend)
-+		return ERROR(srcSize_wrong); /* minimum possible size */
-+	{
-+		symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
-+		symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
-+		symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
-+		ip++;
-+
-+		/* Build DTables */
-+		{
-+			size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr, LLtype, MaxLL, LLFSELog, ip, iend - ip,
-+								  LL_defaultDTable, dctx->fseEntropy, dctx->entropy.workspace, sizeof(dctx->entropy.workspace));
-+			if (ZSTD_isError(llhSize))
-+				return ERROR(corruption_detected);
-+			ip += llhSize;
-+		}
-+		{
-+			size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr, OFtype, MaxOff, OffFSELog, ip, iend - ip,
-+								  OF_defaultDTable, dctx->fseEntropy, dctx->entropy.workspace, sizeof(dctx->entropy.workspace));
-+			if (ZSTD_isError(ofhSize))
-+				return ERROR(corruption_detected);
-+			ip += ofhSize;
-+		}
-+		{
-+			size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr, MLtype, MaxML, MLFSELog, ip, iend - ip,
-+								  ML_defaultDTable, dctx->fseEntropy, dctx->entropy.workspace, sizeof(dctx->entropy.workspace));
-+			if (ZSTD_isError(mlhSize))
-+				return ERROR(corruption_detected);
-+			ip += mlhSize;
-+		}
-+	}
-+
-+	return ip - istart;
-+}
-+
-+typedef struct {
-+	size_t litLength;
-+	size_t matchLength;
-+	size_t offset;
-+	const BYTE *match;
-+} seq_t;
-+
-+typedef struct {
-+	BIT_DStream_t DStream;
-+	FSE_DState_t stateLL;
-+	FSE_DState_t stateOffb;
-+	FSE_DState_t stateML;
-+	size_t prevOffset[ZSTD_REP_NUM];
-+	const BYTE *base;
-+	size_t pos;
-+	uPtrDiff gotoDict;
-+} seqState_t;
-+
-+FORCE_NOINLINE
-+size_t ZSTD_execSequenceLast7(BYTE *op, BYTE *const oend, seq_t sequence, const BYTE **litPtr, const BYTE *const litLimit, const BYTE *const base,
-+			      const BYTE *const vBase, const BYTE *const dictEnd)
-+{
-+	BYTE *const oLitEnd = op + sequence.litLength;
-+	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-+	BYTE *const oMatchEnd = op + sequenceLength; /* risk : address space overflow (32-bits) */
-+	BYTE *const oend_w = oend - WILDCOPY_OVERLENGTH;
-+	const BYTE *const iLitEnd = *litPtr + sequence.litLength;
-+	const BYTE *match = oLitEnd - sequence.offset;
-+
-+	/* check */
-+	if (oMatchEnd > oend)
-+		return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-+	if (iLitEnd > litLimit)
-+		return ERROR(corruption_detected); /* over-read beyond lit buffer */
-+	if (oLitEnd <= oend_w)
-+		return ERROR(GENERIC); /* Precondition */
-+
-+	/* copy literals */
-+	if (op < oend_w) {
-+		ZSTD_wildcopy(op, *litPtr, oend_w - op);
-+		*litPtr += oend_w - op;
-+		op = oend_w;
-+	}
-+	while (op < oLitEnd)
-+		*op++ = *(*litPtr)++;
-+
-+	/* copy Match */
-+	if (sequence.offset > (size_t)(oLitEnd - base)) {
-+		/* offset beyond prefix */
-+		if (sequence.offset > (size_t)(oLitEnd - vBase))
-+			return ERROR(corruption_detected);
-+		match = dictEnd - (base - match);
-+		if (match + sequence.matchLength <= dictEnd) {
-+			memmove(oLitEnd, match, sequence.matchLength);
-+			return sequenceLength;
-+		}
-+		/* span extDict & currPrefixSegment */
-+		{
-+			size_t const length1 = dictEnd - match;
-+			memmove(oLitEnd, match, length1);
-+			op = oLitEnd + length1;
-+			sequence.matchLength -= length1;
-+			match = base;
-+		}
-+	}
-+	while (op < oMatchEnd)
-+		*op++ = *match++;
-+	return sequenceLength;
-+}
-+
-+static seq_t ZSTD_decodeSequence(seqState_t *seqState)
-+{
-+	seq_t seq;
-+
-+	U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-+	U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-+	U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb); /* <= maxOff, by table construction */
-+
-+	U32 const llBits = LL_bits[llCode];
-+	U32 const mlBits = ML_bits[mlCode];
-+	U32 const ofBits = ofCode;
-+	U32 const totalBits = llBits + mlBits + ofBits;
-+
-+	static const U32 LL_base[MaxLL + 1] = {0,  1,  2,  3,  4,  5,  6,  7,  8,    9,     10,    11,    12,    13,     14,     15,     16,     18,
-+					       20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000, 0x2000, 0x4000, 0x8000, 0x10000};
-+
-+	static const U32 ML_base[MaxML + 1] = {3,  4,  5,  6,  7,  8,  9,  10,   11,    12,    13,    14,    15,     16,     17,     18,     19,     20,
-+					       21, 22, 23, 24, 25, 26, 27, 28,   29,    30,    31,    32,    33,     34,     35,     37,     39,     41,
-+					       43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803, 0x1003, 0x2003, 0x4003, 0x8003, 0x10003};
-+
-+	static const U32 OF_base[MaxOff + 1] = {0,       1,	1,	5,	0xD,      0x1D,      0x3D,      0x7D,      0xFD,     0x1FD,
-+						0x3FD,   0x7FD,    0xFFD,    0x1FFD,   0x3FFD,   0x7FFD,    0xFFFD,    0x1FFFD,   0x3FFFD,  0x7FFFD,
-+						0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD, 0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD};
-+
-+	/* sequence */
-+	{
-+		size_t offset;
-+		if (!ofCode)
-+			offset = 0;
-+		else {
-+			offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits); /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-+			if (ZSTD_32bits())
-+				BIT_reloadDStream(&seqState->DStream);
-+		}
-+
-+		if (ofCode <= 1) {
-+			offset += (llCode == 0);
-+			if (offset) {
-+				size_t temp = (offset == 3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-+				temp += !temp; /* 0 is not valid; input is corrupted; force offset to 1 */
-+				if (offset != 1)
-+					seqState->prevOffset[2] = seqState->prevOffset[1];
-+				seqState->prevOffset[1] = seqState->prevOffset[0];
-+				seqState->prevOffset[0] = offset = temp;
-+			} else {
-+				offset = seqState->prevOffset[0];
-+			}
-+		} else {
-+			seqState->prevOffset[2] = seqState->prevOffset[1];
-+			seqState->prevOffset[1] = seqState->prevOffset[0];
-+			seqState->prevOffset[0] = offset;
-+		}
-+		seq.offset = offset;
-+	}
-+
-+	seq.matchLength = ML_base[mlCode] + ((mlCode > 31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0); /* <=  16 bits */
-+	if (ZSTD_32bits() && (mlBits + llBits > 24))
-+		BIT_reloadDStream(&seqState->DStream);
-+
-+	seq.litLength = LL_base[llCode] + ((llCode > 15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0); /* <=  16 bits */
-+	if (ZSTD_32bits() || (totalBits > 64 - 7 - (LLFSELog + MLFSELog + OffFSELog)))
-+		BIT_reloadDStream(&seqState->DStream);
-+
-+	/* ANS state update */
-+	FSE_updateState(&seqState->stateLL, &seqState->DStream); /* <=  9 bits */
-+	FSE_updateState(&seqState->stateML, &seqState->DStream); /* <=  9 bits */
-+	if (ZSTD_32bits())
-+		BIT_reloadDStream(&seqState->DStream);		   /* <= 18 bits */
-+	FSE_updateState(&seqState->stateOffb, &seqState->DStream); /* <=  8 bits */
-+
-+	seq.match = NULL;
-+
-+	return seq;
-+}
-+
-+FORCE_INLINE
-+size_t ZSTD_execSequence(BYTE *op, BYTE *const oend, seq_t sequence, const BYTE **litPtr, const BYTE *const litLimit, const BYTE *const base,
-+			 const BYTE *const vBase, const BYTE *const dictEnd)
-+{
-+	BYTE *const oLitEnd = op + sequence.litLength;
-+	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-+	BYTE *const oMatchEnd = op + sequenceLength; /* risk : address space overflow (32-bits) */
-+	BYTE *const oend_w = oend - WILDCOPY_OVERLENGTH;
-+	const BYTE *const iLitEnd = *litPtr + sequence.litLength;
-+	const BYTE *match = oLitEnd - sequence.offset;
-+
-+	/* check */
-+	if (oMatchEnd > oend)
-+		return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-+	if (iLitEnd > litLimit)
-+		return ERROR(corruption_detected); /* over-read beyond lit buffer */
-+	if (oLitEnd > oend_w)
-+		return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
-+
-+	/* copy Literals */
-+	ZSTD_copy8(op, *litPtr);
-+	if (sequence.litLength > 8)
-+		ZSTD_wildcopy(op + 8, (*litPtr) + 8,
-+			      sequence.litLength - 8); /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-+	op = oLitEnd;
-+	*litPtr = iLitEnd; /* update for next sequence */
-+
-+	/* copy Match */
-+	if (sequence.offset > (size_t)(oLitEnd - base)) {
-+		/* offset beyond prefix */
-+		if (sequence.offset > (size_t)(oLitEnd - vBase))
-+			return ERROR(corruption_detected);
-+		match = dictEnd + (match - base);
-+		if (match + sequence.matchLength <= dictEnd) {
-+			memmove(oLitEnd, match, sequence.matchLength);
-+			return sequenceLength;
-+		}
-+		/* span extDict & currPrefixSegment */
-+		{
-+			size_t const length1 = dictEnd - match;
-+			memmove(oLitEnd, match, length1);
-+			op = oLitEnd + length1;
-+			sequence.matchLength -= length1;
-+			match = base;
-+			if (op > oend_w || sequence.matchLength < MINMATCH) {
-+				U32 i;
-+				for (i = 0; i < sequence.matchLength; ++i)
-+					op[i] = match[i];
-+				return sequenceLength;
-+			}
-+		}
-+	}
-+	/* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
-+
-+	/* match within prefix */
-+	if (sequence.offset < 8) {
-+		/* close range match, overlap */
-+		static const U32 dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4};   /* added */
-+		static const int dec64table[] = {8, 8, 8, 7, 8, 9, 10, 11}; /* subtracted */
-+		int const sub2 = dec64table[sequence.offset];
-+		op[0] = match[0];
-+		op[1] = match[1];
-+		op[2] = match[2];
-+		op[3] = match[3];
-+		match += dec32table[sequence.offset];
-+		ZSTD_copy4(op + 4, match);
-+		match -= sub2;
-+	} else {
-+		ZSTD_copy8(op, match);
-+	}
-+	op += 8;
-+	match += 8;
-+
-+	if (oMatchEnd > oend - (16 - MINMATCH)) {
-+		if (op < oend_w) {
-+			ZSTD_wildcopy(op, match, oend_w - op);
-+			match += oend_w - op;
-+			op = oend_w;
-+		}
-+		while (op < oMatchEnd)
-+			*op++ = *match++;
-+	} else {
-+		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength - 8); /* works even if matchLength < 8 */
-+	}
-+	return sequenceLength;
-+}
-+
-+static size_t ZSTD_decompressSequences(ZSTD_DCtx *dctx, void *dst, size_t maxDstSize, const void *seqStart, size_t seqSize)
-+{
-+	const BYTE *ip = (const BYTE *)seqStart;
-+	const BYTE *const iend = ip + seqSize;
-+	BYTE *const ostart = (BYTE * const)dst;
-+	BYTE *const oend = ostart + maxDstSize;
-+	BYTE *op = ostart;
-+	const BYTE *litPtr = dctx->litPtr;
-+	const BYTE *const litEnd = litPtr + dctx->litSize;
-+	const BYTE *const base = (const BYTE *)(dctx->base);
-+	const BYTE *const vBase = (const BYTE *)(dctx->vBase);
-+	const BYTE *const dictEnd = (const BYTE *)(dctx->dictEnd);
-+	int nbSeq;
-+
-+	/* Build Decoding Tables */
-+	{
-+		size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-+		if (ZSTD_isError(seqHSize))
-+			return seqHSize;
-+		ip += seqHSize;
-+	}
-+
-+	/* Regen sequences */
-+	if (nbSeq) {
-+		seqState_t seqState;
-+		dctx->fseEntropy = 1;
-+		{
-+			U32 i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				seqState.prevOffset[i] = dctx->entropy.rep[i];
-+		}
-+		CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend - ip), corruption_detected);
-+		FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-+		FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-+		FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
-+
-+		for (; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && nbSeq;) {
-+			nbSeq--;
-+			{
-+				seq_t const sequence = ZSTD_decodeSequence(&seqState);
-+				size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, base, vBase, dictEnd);
-+				if (ZSTD_isError(oneSeqSize))
-+					return oneSeqSize;
-+				op += oneSeqSize;
-+			}
-+		}
-+
-+		/* check if reached exact end */
-+		if (nbSeq)
-+			return ERROR(corruption_detected);
-+		/* save reps for next block */
-+		{
-+			U32 i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]);
-+		}
-+	}
-+
-+	/* last literal segment */
-+	{
-+		size_t const lastLLSize = litEnd - litPtr;
-+		if (lastLLSize > (size_t)(oend - op))
-+			return ERROR(dstSize_tooSmall);
-+		memcpy(op, litPtr, lastLLSize);
-+		op += lastLLSize;
-+	}
-+
-+	return op - ostart;
-+}
-+
-+FORCE_INLINE seq_t ZSTD_decodeSequenceLong_generic(seqState_t *seqState, int const longOffsets)
-+{
-+	seq_t seq;
-+
-+	U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-+	U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-+	U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb); /* <= maxOff, by table construction */
-+
-+	U32 const llBits = LL_bits[llCode];
-+	U32 const mlBits = ML_bits[mlCode];
-+	U32 const ofBits = ofCode;
-+	U32 const totalBits = llBits + mlBits + ofBits;
-+
-+	static const U32 LL_base[MaxLL + 1] = {0,  1,  2,  3,  4,  5,  6,  7,  8,    9,     10,    11,    12,    13,     14,     15,     16,     18,
-+					       20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000, 0x2000, 0x4000, 0x8000, 0x10000};
-+
-+	static const U32 ML_base[MaxML + 1] = {3,  4,  5,  6,  7,  8,  9,  10,   11,    12,    13,    14,    15,     16,     17,     18,     19,     20,
-+					       21, 22, 23, 24, 25, 26, 27, 28,   29,    30,    31,    32,    33,     34,     35,     37,     39,     41,
-+					       43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803, 0x1003, 0x2003, 0x4003, 0x8003, 0x10003};
-+
-+	static const U32 OF_base[MaxOff + 1] = {0,       1,	1,	5,	0xD,      0x1D,      0x3D,      0x7D,      0xFD,     0x1FD,
-+						0x3FD,   0x7FD,    0xFFD,    0x1FFD,   0x3FFD,   0x7FFD,    0xFFFD,    0x1FFFD,   0x3FFFD,  0x7FFFD,
-+						0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD, 0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD};
-+
-+	/* sequence */
-+	{
-+		size_t offset;
-+		if (!ofCode)
-+			offset = 0;
-+		else {
-+			if (longOffsets) {
-+				int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN);
-+				offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
-+				if (ZSTD_32bits() || extraBits)
-+					BIT_reloadDStream(&seqState->DStream);
-+				if (extraBits)
-+					offset += BIT_readBitsFast(&seqState->DStream, extraBits);
-+			} else {
-+				offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits); /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-+				if (ZSTD_32bits())
-+					BIT_reloadDStream(&seqState->DStream);
-+			}
-+		}
-+
-+		if (ofCode <= 1) {
-+			offset += (llCode == 0);
-+			if (offset) {
-+				size_t temp = (offset == 3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-+				temp += !temp; /* 0 is not valid; input is corrupted; force offset to 1 */
-+				if (offset != 1)
-+					seqState->prevOffset[2] = seqState->prevOffset[1];
-+				seqState->prevOffset[1] = seqState->prevOffset[0];
-+				seqState->prevOffset[0] = offset = temp;
-+			} else {
-+				offset = seqState->prevOffset[0];
-+			}
-+		} else {
-+			seqState->prevOffset[2] = seqState->prevOffset[1];
-+			seqState->prevOffset[1] = seqState->prevOffset[0];
-+			seqState->prevOffset[0] = offset;
-+		}
-+		seq.offset = offset;
-+	}
-+
-+	seq.matchLength = ML_base[mlCode] + ((mlCode > 31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0); /* <=  16 bits */
-+	if (ZSTD_32bits() && (mlBits + llBits > 24))
-+		BIT_reloadDStream(&seqState->DStream);
-+
-+	seq.litLength = LL_base[llCode] + ((llCode > 15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0); /* <=  16 bits */
-+	if (ZSTD_32bits() || (totalBits > 64 - 7 - (LLFSELog + MLFSELog + OffFSELog)))
-+		BIT_reloadDStream(&seqState->DStream);
-+
-+	{
-+		size_t const pos = seqState->pos + seq.litLength;
-+		seq.match = seqState->base + pos - seq.offset; /* single memory segment */
-+		if (seq.offset > pos)
-+			seq.match += seqState->gotoDict; /* separate memory segment */
-+		seqState->pos = pos + seq.matchLength;
-+	}
-+
-+	/* ANS state update */
-+	FSE_updateState(&seqState->stateLL, &seqState->DStream); /* <=  9 bits */
-+	FSE_updateState(&seqState->stateML, &seqState->DStream); /* <=  9 bits */
-+	if (ZSTD_32bits())
-+		BIT_reloadDStream(&seqState->DStream);		   /* <= 18 bits */
-+	FSE_updateState(&seqState->stateOffb, &seqState->DStream); /* <=  8 bits */
-+
-+	return seq;
-+}
-+
-+static seq_t ZSTD_decodeSequenceLong(seqState_t *seqState, unsigned const windowSize)
-+{
-+	if (ZSTD_highbit32(windowSize) > STREAM_ACCUMULATOR_MIN) {
-+		return ZSTD_decodeSequenceLong_generic(seqState, 1);
-+	} else {
-+		return ZSTD_decodeSequenceLong_generic(seqState, 0);
-+	}
-+}
-+
-+FORCE_INLINE
-+size_t ZSTD_execSequenceLong(BYTE *op, BYTE *const oend, seq_t sequence, const BYTE **litPtr, const BYTE *const litLimit, const BYTE *const base,
-+			     const BYTE *const vBase, const BYTE *const dictEnd)
-+{
-+	BYTE *const oLitEnd = op + sequence.litLength;
-+	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-+	BYTE *const oMatchEnd = op + sequenceLength; /* risk : address space overflow (32-bits) */
-+	BYTE *const oend_w = oend - WILDCOPY_OVERLENGTH;
-+	const BYTE *const iLitEnd = *litPtr + sequence.litLength;
-+	const BYTE *match = sequence.match;
-+
-+	/* check */
-+	if (oMatchEnd > oend)
-+		return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-+	if (iLitEnd > litLimit)
-+		return ERROR(corruption_detected); /* over-read beyond lit buffer */
-+	if (oLitEnd > oend_w)
-+		return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
-+
-+	/* copy Literals */
-+	ZSTD_copy8(op, *litPtr);
-+	if (sequence.litLength > 8)
-+		ZSTD_wildcopy(op + 8, (*litPtr) + 8,
-+			      sequence.litLength - 8); /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-+	op = oLitEnd;
-+	*litPtr = iLitEnd; /* update for next sequence */
-+
-+	/* copy Match */
-+	if (sequence.offset > (size_t)(oLitEnd - base)) {
-+		/* offset beyond prefix */
-+		if (sequence.offset > (size_t)(oLitEnd - vBase))
-+			return ERROR(corruption_detected);
-+		if (match + sequence.matchLength <= dictEnd) {
-+			memmove(oLitEnd, match, sequence.matchLength);
-+			return sequenceLength;
-+		}
-+		/* span extDict & currPrefixSegment */
-+		{
-+			size_t const length1 = dictEnd - match;
-+			memmove(oLitEnd, match, length1);
-+			op = oLitEnd + length1;
-+			sequence.matchLength -= length1;
-+			match = base;
-+			if (op > oend_w || sequence.matchLength < MINMATCH) {
-+				U32 i;
-+				for (i = 0; i < sequence.matchLength; ++i)
-+					op[i] = match[i];
-+				return sequenceLength;
-+			}
-+		}
-+	}
-+	/* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
-+
-+	/* match within prefix */
-+	if (sequence.offset < 8) {
-+		/* close range match, overlap */
-+		static const U32 dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4};   /* added */
-+		static const int dec64table[] = {8, 8, 8, 7, 8, 9, 10, 11}; /* subtracted */
-+		int const sub2 = dec64table[sequence.offset];
-+		op[0] = match[0];
-+		op[1] = match[1];
-+		op[2] = match[2];
-+		op[3] = match[3];
-+		match += dec32table[sequence.offset];
-+		ZSTD_copy4(op + 4, match);
-+		match -= sub2;
-+	} else {
-+		ZSTD_copy8(op, match);
-+	}
-+	op += 8;
-+	match += 8;
-+
-+	if (oMatchEnd > oend - (16 - MINMATCH)) {
-+		if (op < oend_w) {
-+			ZSTD_wildcopy(op, match, oend_w - op);
-+			match += oend_w - op;
-+			op = oend_w;
-+		}
-+		while (op < oMatchEnd)
-+			*op++ = *match++;
-+	} else {
-+		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength - 8); /* works even if matchLength < 8 */
-+	}
-+	return sequenceLength;
-+}
-+
-+static size_t ZSTD_decompressSequencesLong(ZSTD_DCtx *dctx, void *dst, size_t maxDstSize, const void *seqStart, size_t seqSize)
-+{
-+	const BYTE *ip = (const BYTE *)seqStart;
-+	const BYTE *const iend = ip + seqSize;
-+	BYTE *const ostart = (BYTE * const)dst;
-+	BYTE *const oend = ostart + maxDstSize;
-+	BYTE *op = ostart;
-+	const BYTE *litPtr = dctx->litPtr;
-+	const BYTE *const litEnd = litPtr + dctx->litSize;
-+	const BYTE *const base = (const BYTE *)(dctx->base);
-+	const BYTE *const vBase = (const BYTE *)(dctx->vBase);
-+	const BYTE *const dictEnd = (const BYTE *)(dctx->dictEnd);
-+	unsigned const windowSize = dctx->fParams.windowSize;
-+	int nbSeq;
-+
-+	/* Build Decoding Tables */
-+	{
-+		size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-+		if (ZSTD_isError(seqHSize))
-+			return seqHSize;
-+		ip += seqHSize;
-+	}
-+
-+	/* Regen sequences */
-+	if (nbSeq) {
-+#define STORED_SEQS 4
-+#define STOSEQ_MASK (STORED_SEQS - 1)
-+#define ADVANCED_SEQS 4
-+		seq_t *sequences = (seq_t *)dctx->entropy.workspace;
-+		int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
-+		seqState_t seqState;
-+		int seqNb;
-+		ZSTD_STATIC_ASSERT(sizeof(dctx->entropy.workspace) >= sizeof(seq_t) * STORED_SEQS);
-+		dctx->fseEntropy = 1;
-+		{
-+			U32 i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				seqState.prevOffset[i] = dctx->entropy.rep[i];
-+		}
-+		seqState.base = base;
-+		seqState.pos = (size_t)(op - base);
-+		seqState.gotoDict = (uPtrDiff)dictEnd - (uPtrDiff)base; /* cast to avoid undefined behaviour */
-+		CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend - ip), corruption_detected);
-+		FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-+		FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-+		FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
-+
-+		/* prepare in advance */
-+		for (seqNb = 0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && seqNb < seqAdvance; seqNb++) {
-+			sequences[seqNb] = ZSTD_decodeSequenceLong(&seqState, windowSize);
-+		}
-+		if (seqNb < seqAdvance)
-+			return ERROR(corruption_detected);
-+
-+		/* decode and decompress */
-+		for (; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && seqNb < nbSeq; seqNb++) {
-+			seq_t const sequence = ZSTD_decodeSequenceLong(&seqState, windowSize);
-+			size_t const oneSeqSize =
-+			    ZSTD_execSequenceLong(op, oend, sequences[(seqNb - ADVANCED_SEQS) & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
-+			if (ZSTD_isError(oneSeqSize))
-+				return oneSeqSize;
-+			ZSTD_PREFETCH(sequence.match);
-+			sequences[seqNb & STOSEQ_MASK] = sequence;
-+			op += oneSeqSize;
-+		}
-+		if (seqNb < nbSeq)
-+			return ERROR(corruption_detected);
-+
-+		/* finish queue */
-+		seqNb -= seqAdvance;
-+		for (; seqNb < nbSeq; seqNb++) {
-+			size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[seqNb & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
-+			if (ZSTD_isError(oneSeqSize))
-+				return oneSeqSize;
-+			op += oneSeqSize;
-+		}
-+
-+		/* save reps for next block */
-+		{
-+			U32 i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]);
-+		}
-+	}
-+
-+	/* last literal segment */
-+	{
-+		size_t const lastLLSize = litEnd - litPtr;
-+		if (lastLLSize > (size_t)(oend - op))
-+			return ERROR(dstSize_tooSmall);
-+		memcpy(op, litPtr, lastLLSize);
-+		op += lastLLSize;
-+	}
-+
-+	return op - ostart;
-+}
-+
-+static size_t ZSTD_decompressBlock_internal(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{ /* blockType == blockCompressed */
-+	const BYTE *ip = (const BYTE *)src;
-+
-+	if (srcSize >= ZSTD_BLOCKSIZE_ABSOLUTEMAX)
-+		return ERROR(srcSize_wrong);
-+
-+	/* Decode literals section */
-+	{
-+		size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
-+		if (ZSTD_isError(litCSize))
-+			return litCSize;
-+		ip += litCSize;
-+		srcSize -= litCSize;
-+	}
-+	if (sizeof(size_t) > 4) /* do not enable prefetching on 32-bits x86, as it's performance detrimental */
-+				/* likely because of register pressure */
-+				/* if that's the correct cause, then 32-bits ARM should be affected differently */
-+				/* it would be good to test this on ARM real hardware, to see if prefetch version improves speed */
-+		if (dctx->fParams.windowSize > (1 << 23))
-+			return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize);
-+	return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize);
-+}
-+
-+static void ZSTD_checkContinuity(ZSTD_DCtx *dctx, const void *dst)
-+{
-+	if (dst != dctx->previousDstEnd) { /* not contiguous */
-+		dctx->dictEnd = dctx->previousDstEnd;
-+		dctx->vBase = (const char *)dst - ((const char *)(dctx->previousDstEnd) - (const char *)(dctx->base));
-+		dctx->base = dst;
-+		dctx->previousDstEnd = dst;
-+	}
-+}
-+
-+size_t ZSTD_decompressBlock(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	size_t dSize;
-+	ZSTD_checkContinuity(dctx, dst);
-+	dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
-+	dctx->previousDstEnd = (char *)dst + dSize;
-+	return dSize;
-+}
-+
-+/** ZSTD_insertBlock() :
-+	insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
-+size_t ZSTD_insertBlock(ZSTD_DCtx *dctx, const void *blockStart, size_t blockSize)
-+{
-+	ZSTD_checkContinuity(dctx, blockStart);
-+	dctx->previousDstEnd = (const char *)blockStart + blockSize;
-+	return blockSize;
-+}
-+
-+size_t ZSTD_generateNxBytes(void *dst, size_t dstCapacity, BYTE byte, size_t length)
-+{
-+	if (length > dstCapacity)
-+		return ERROR(dstSize_tooSmall);
-+	memset(dst, byte, length);
-+	return length;
-+}
-+
-+/** ZSTD_findFrameCompressedSize() :
-+ *  compatible with legacy mode
-+ *  `src` must point to the start of a ZSTD frame, ZSTD legacy frame, or skippable frame
-+ *  `srcSize` must be at least as large as the frame contained
-+ *  @return : the compressed size of the frame starting at `src` */
-+size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
-+{
-+	if (srcSize >= ZSTD_skippableHeaderSize && (ZSTD_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-+		return ZSTD_skippableHeaderSize + ZSTD_readLE32((const BYTE *)src + 4);
-+	} else {
-+		const BYTE *ip = (const BYTE *)src;
-+		const BYTE *const ipstart = ip;
-+		size_t remainingSize = srcSize;
-+		ZSTD_frameParams fParams;
-+
-+		size_t const headerSize = ZSTD_frameHeaderSize(ip, remainingSize);
-+		if (ZSTD_isError(headerSize))
-+			return headerSize;
-+
-+		/* Frame Header */
-+		{
-+			size_t const ret = ZSTD_getFrameParams(&fParams, ip, remainingSize);
-+			if (ZSTD_isError(ret))
-+				return ret;
-+			if (ret > 0)
-+				return ERROR(srcSize_wrong);
-+		}
-+
-+		ip += headerSize;
-+		remainingSize -= headerSize;
-+
-+		/* Loop on each block */
-+		while (1) {
-+			blockProperties_t blockProperties;
-+			size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-+			if (ZSTD_isError(cBlockSize))
-+				return cBlockSize;
-+
-+			if (ZSTD_blockHeaderSize + cBlockSize > remainingSize)
-+				return ERROR(srcSize_wrong);
-+
-+			ip += ZSTD_blockHeaderSize + cBlockSize;
-+			remainingSize -= ZSTD_blockHeaderSize + cBlockSize;
-+
-+			if (blockProperties.lastBlock)
-+				break;
-+		}
-+
-+		if (fParams.checksumFlag) { /* Frame content checksum */
-+			if (remainingSize < 4)
-+				return ERROR(srcSize_wrong);
-+			ip += 4;
-+			remainingSize -= 4;
-+		}
-+
-+		return ip - ipstart;
-+	}
-+}
-+
-+/*! ZSTD_decompressFrame() :
-+*   @dctx must be properly initialized */
-+static size_t ZSTD_decompressFrame(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void **srcPtr, size_t *srcSizePtr)
-+{
-+	const BYTE *ip = (const BYTE *)(*srcPtr);
-+	BYTE *const ostart = (BYTE * const)dst;
-+	BYTE *const oend = ostart + dstCapacity;
-+	BYTE *op = ostart;
-+	size_t remainingSize = *srcSizePtr;
-+
-+	/* check */
-+	if (remainingSize < ZSTD_frameHeaderSize_min + ZSTD_blockHeaderSize)
-+		return ERROR(srcSize_wrong);
-+
-+	/* Frame Header */
-+	{
-+		size_t const frameHeaderSize = ZSTD_frameHeaderSize(ip, ZSTD_frameHeaderSize_prefix);
-+		if (ZSTD_isError(frameHeaderSize))
-+			return frameHeaderSize;
-+		if (remainingSize < frameHeaderSize + ZSTD_blockHeaderSize)
-+			return ERROR(srcSize_wrong);
-+		CHECK_F(ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize));
-+		ip += frameHeaderSize;
-+		remainingSize -= frameHeaderSize;
-+	}
-+
-+	/* Loop on each block */
-+	while (1) {
-+		size_t decodedSize;
-+		blockProperties_t blockProperties;
-+		size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-+		if (ZSTD_isError(cBlockSize))
-+			return cBlockSize;
-+
-+		ip += ZSTD_blockHeaderSize;
-+		remainingSize -= ZSTD_blockHeaderSize;
-+		if (cBlockSize > remainingSize)
-+			return ERROR(srcSize_wrong);
-+
-+		switch (blockProperties.blockType) {
-+		case bt_compressed: decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend - op, ip, cBlockSize); break;
-+		case bt_raw: decodedSize = ZSTD_copyRawBlock(op, oend - op, ip, cBlockSize); break;
-+		case bt_rle: decodedSize = ZSTD_generateNxBytes(op, oend - op, *ip, blockProperties.origSize); break;
-+		case bt_reserved:
-+		default: return ERROR(corruption_detected);
-+		}
-+
-+		if (ZSTD_isError(decodedSize))
-+			return decodedSize;
-+		if (dctx->fParams.checksumFlag)
-+			xxh64_update(&dctx->xxhState, op, decodedSize);
-+		op += decodedSize;
-+		ip += cBlockSize;
-+		remainingSize -= cBlockSize;
-+		if (blockProperties.lastBlock)
-+			break;
-+	}
-+
-+	if (dctx->fParams.checksumFlag) { /* Frame content checksum verification */
-+		U32 const checkCalc = (U32)xxh64_digest(&dctx->xxhState);
-+		U32 checkRead;
-+		if (remainingSize < 4)
-+			return ERROR(checksum_wrong);
-+		checkRead = ZSTD_readLE32(ip);
-+		if (checkRead != checkCalc)
-+			return ERROR(checksum_wrong);
-+		ip += 4;
-+		remainingSize -= 4;
-+	}
-+
-+	/* Allow caller to get size read */
-+	*srcPtr = ip;
-+	*srcSizePtr = remainingSize;
-+	return op - ostart;
-+}
-+
-+static const void *ZSTD_DDictDictContent(const ZSTD_DDict *ddict);
-+static size_t ZSTD_DDictDictSize(const ZSTD_DDict *ddict);
-+
-+static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize,
-+					const ZSTD_DDict *ddict)
-+{
-+	void *const dststart = dst;
-+
-+	if (ddict) {
-+		if (dict) {
-+			/* programmer error, these two cases should be mutually exclusive */
-+			return ERROR(GENERIC);
-+		}
-+
-+		dict = ZSTD_DDictDictContent(ddict);
-+		dictSize = ZSTD_DDictDictSize(ddict);
-+	}
-+
-+	while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-+		U32 magicNumber;
-+
-+		magicNumber = ZSTD_readLE32(src);
-+		if (magicNumber != ZSTD_MAGICNUMBER) {
-+			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-+				size_t skippableSize;
-+				if (srcSize < ZSTD_skippableHeaderSize)
-+					return ERROR(srcSize_wrong);
-+				skippableSize = ZSTD_readLE32((const BYTE *)src + 4) + ZSTD_skippableHeaderSize;
-+				if (srcSize < skippableSize) {
-+					return ERROR(srcSize_wrong);
-+				}
-+
-+				src = (const BYTE *)src + skippableSize;
-+				srcSize -= skippableSize;
-+				continue;
-+			} else {
-+				return ERROR(prefix_unknown);
-+			}
-+		}
-+
-+		if (ddict) {
-+			/* we were called from ZSTD_decompress_usingDDict */
-+			ZSTD_refDDict(dctx, ddict);
-+		} else {
-+			/* this will initialize correctly with no dict if dict == NULL, so
-+			 * use this in all cases but ddict */
-+			CHECK_F(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize));
-+		}
-+		ZSTD_checkContinuity(dctx, dst);
-+
-+		{
-+			const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity, &src, &srcSize);
-+			if (ZSTD_isError(res))
-+				return res;
-+			/* don't need to bounds check this, ZSTD_decompressFrame will have
-+			 * already */
-+			dst = (BYTE *)dst + res;
-+			dstCapacity -= res;
-+		}
-+	}
-+
-+	if (srcSize)
-+		return ERROR(srcSize_wrong); /* input not entirely consumed */
-+
-+	return (BYTE *)dst - (BYTE *)dststart;
-+}
-+
-+size_t ZSTD_decompress_usingDict(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize)
-+{
-+	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
-+}
-+
-+size_t ZSTD_decompressDCtx(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	return ZSTD_decompress_usingDict(dctx, dst, dstCapacity, src, srcSize, NULL, 0);
-+}
-+
-+/*-**************************************
-+*   Advanced Streaming Decompression API
-+*   Bufferless and synchronous
-+****************************************/
-+size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx *dctx) { return dctx->expected; }
-+
-+ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx *dctx)
-+{
-+	switch (dctx->stage) {
-+	default: /* should not happen */
-+	case ZSTDds_getFrameHeaderSize:
-+	case ZSTDds_decodeFrameHeader: return ZSTDnit_frameHeader;
-+	case ZSTDds_decodeBlockHeader: return ZSTDnit_blockHeader;
-+	case ZSTDds_decompressBlock: return ZSTDnit_block;
-+	case ZSTDds_decompressLastBlock: return ZSTDnit_lastBlock;
-+	case ZSTDds_checkChecksum: return ZSTDnit_checksum;
-+	case ZSTDds_decodeSkippableHeader:
-+	case ZSTDds_skipFrame: return ZSTDnit_skippableFrame;
-+	}
-+}
-+
-+int ZSTD_isSkipFrame(ZSTD_DCtx *dctx) { return dctx->stage == ZSTDds_skipFrame; } /* for zbuff */
-+
-+/** ZSTD_decompressContinue() :
-+*   @return : nb of bytes generated into `dst` (necessarily <= `dstCapacity)
-+*             or an error code, which can be tested using ZSTD_isError() */
-+size_t ZSTD_decompressContinue(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	/* Sanity check */
-+	if (srcSize != dctx->expected)
-+		return ERROR(srcSize_wrong);
-+	if (dstCapacity)
-+		ZSTD_checkContinuity(dctx, dst);
-+
-+	switch (dctx->stage) {
-+	case ZSTDds_getFrameHeaderSize:
-+		if (srcSize != ZSTD_frameHeaderSize_prefix)
-+			return ERROR(srcSize_wrong);					/* impossible */
-+		if ((ZSTD_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) { /* skippable frame */
-+			memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
-+			dctx->expected = ZSTD_skippableHeaderSize - ZSTD_frameHeaderSize_prefix; /* magic number + skippable frame length */
-+			dctx->stage = ZSTDds_decodeSkippableHeader;
-+			return 0;
-+		}
-+		dctx->headerSize = ZSTD_frameHeaderSize(src, ZSTD_frameHeaderSize_prefix);
-+		if (ZSTD_isError(dctx->headerSize))
-+			return dctx->headerSize;
-+		memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
-+		if (dctx->headerSize > ZSTD_frameHeaderSize_prefix) {
-+			dctx->expected = dctx->headerSize - ZSTD_frameHeaderSize_prefix;
-+			dctx->stage = ZSTDds_decodeFrameHeader;
-+			return 0;
-+		}
-+		dctx->expected = 0; /* not necessary to copy more */
-+
-+	case ZSTDds_decodeFrameHeader:
-+		memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
-+		CHECK_F(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize));
-+		dctx->expected = ZSTD_blockHeaderSize;
-+		dctx->stage = ZSTDds_decodeBlockHeader;
-+		return 0;
-+
-+	case ZSTDds_decodeBlockHeader: {
-+		blockProperties_t bp;
-+		size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
-+		if (ZSTD_isError(cBlockSize))
-+			return cBlockSize;
-+		dctx->expected = cBlockSize;
-+		dctx->bType = bp.blockType;
-+		dctx->rleSize = bp.origSize;
-+		if (cBlockSize) {
-+			dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
-+			return 0;
-+		}
-+		/* empty block */
-+		if (bp.lastBlock) {
-+			if (dctx->fParams.checksumFlag) {
-+				dctx->expected = 4;
-+				dctx->stage = ZSTDds_checkChecksum;
-+			} else {
-+				dctx->expected = 0; /* end of frame */
-+				dctx->stage = ZSTDds_getFrameHeaderSize;
-+			}
-+		} else {
-+			dctx->expected = 3; /* go directly to next header */
-+			dctx->stage = ZSTDds_decodeBlockHeader;
-+		}
-+		return 0;
-+	}
-+	case ZSTDds_decompressLastBlock:
-+	case ZSTDds_decompressBlock: {
-+		size_t rSize;
-+		switch (dctx->bType) {
-+		case bt_compressed: rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize); break;
-+		case bt_raw: rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize); break;
-+		case bt_rle: rSize = ZSTD_setRleBlock(dst, dstCapacity, src, srcSize, dctx->rleSize); break;
-+		case bt_reserved: /* should never happen */
-+		default: return ERROR(corruption_detected);
-+		}
-+		if (ZSTD_isError(rSize))
-+			return rSize;
-+		if (dctx->fParams.checksumFlag)
-+			xxh64_update(&dctx->xxhState, dst, rSize);
-+
-+		if (dctx->stage == ZSTDds_decompressLastBlock) { /* end of frame */
-+			if (dctx->fParams.checksumFlag) {	/* another round for frame checksum */
-+				dctx->expected = 4;
-+				dctx->stage = ZSTDds_checkChecksum;
-+			} else {
-+				dctx->expected = 0; /* ends here */
-+				dctx->stage = ZSTDds_getFrameHeaderSize;
-+			}
-+		} else {
-+			dctx->stage = ZSTDds_decodeBlockHeader;
-+			dctx->expected = ZSTD_blockHeaderSize;
-+			dctx->previousDstEnd = (char *)dst + rSize;
-+		}
-+		return rSize;
-+	}
-+	case ZSTDds_checkChecksum: {
-+		U32 const h32 = (U32)xxh64_digest(&dctx->xxhState);
-+		U32 const check32 = ZSTD_readLE32(src); /* srcSize == 4, guaranteed by dctx->expected */
-+		if (check32 != h32)
-+			return ERROR(checksum_wrong);
-+		dctx->expected = 0;
-+		dctx->stage = ZSTDds_getFrameHeaderSize;
-+		return 0;
-+	}
-+	case ZSTDds_decodeSkippableHeader: {
-+		memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
-+		dctx->expected = ZSTD_readLE32(dctx->headerBuffer + 4);
-+		dctx->stage = ZSTDds_skipFrame;
-+		return 0;
-+	}
-+	case ZSTDds_skipFrame: {
-+		dctx->expected = 0;
-+		dctx->stage = ZSTDds_getFrameHeaderSize;
-+		return 0;
-+	}
-+	default:
-+		return ERROR(GENERIC); /* impossible */
-+	}
-+}
-+
-+static size_t ZSTD_refDictContent(ZSTD_DCtx *dctx, const void *dict, size_t dictSize)
-+{
-+	dctx->dictEnd = dctx->previousDstEnd;
-+	dctx->vBase = (const char *)dict - ((const char *)(dctx->previousDstEnd) - (const char *)(dctx->base));
-+	dctx->base = dict;
-+	dctx->previousDstEnd = (const char *)dict + dictSize;
-+	return 0;
-+}
-+
-+/* ZSTD_loadEntropy() :
-+ * dict : must point at beginning of a valid zstd dictionary
-+ * @return : size of entropy tables read */
-+static size_t ZSTD_loadEntropy(ZSTD_entropyTables_t *entropy, const void *const dict, size_t const dictSize)
-+{
-+	const BYTE *dictPtr = (const BYTE *)dict;
-+	const BYTE *const dictEnd = dictPtr + dictSize;
-+
-+	if (dictSize <= 8)
-+		return ERROR(dictionary_corrupted);
-+	dictPtr += 8; /* skip header = magic + dictID */
-+
-+	{
-+		size_t const hSize = HUF_readDTableX4_wksp(entropy->hufTable, dictPtr, dictEnd - dictPtr, entropy->workspace, sizeof(entropy->workspace));
-+		if (HUF_isError(hSize))
-+			return ERROR(dictionary_corrupted);
-+		dictPtr += hSize;
-+	}
-+
-+	{
-+		short offcodeNCount[MaxOff + 1];
-+		U32 offcodeMaxValue = MaxOff, offcodeLog;
-+		size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd - dictPtr);
-+		if (FSE_isError(offcodeHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		if (offcodeLog > OffFSELog)
-+			return ERROR(dictionary_corrupted);
-+		CHECK_E(FSE_buildDTable_wksp(entropy->OFTable, offcodeNCount, offcodeMaxValue, offcodeLog, entropy->workspace, sizeof(entropy->workspace)), dictionary_corrupted);
-+		dictPtr += offcodeHeaderSize;
-+	}
-+
-+	{
-+		short matchlengthNCount[MaxML + 1];
-+		unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-+		size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd - dictPtr);
-+		if (FSE_isError(matchlengthHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		if (matchlengthLog > MLFSELog)
-+			return ERROR(dictionary_corrupted);
-+		CHECK_E(FSE_buildDTable_wksp(entropy->MLTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, entropy->workspace, sizeof(entropy->workspace)), dictionary_corrupted);
-+		dictPtr += matchlengthHeaderSize;
-+	}
-+
-+	{
-+		short litlengthNCount[MaxLL + 1];
-+		unsigned litlengthMaxValue = MaxLL, litlengthLog;
-+		size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd - dictPtr);
-+		if (FSE_isError(litlengthHeaderSize))
-+			return ERROR(dictionary_corrupted);
-+		if (litlengthLog > LLFSELog)
-+			return ERROR(dictionary_corrupted);
-+		CHECK_E(FSE_buildDTable_wksp(entropy->LLTable, litlengthNCount, litlengthMaxValue, litlengthLog, entropy->workspace, sizeof(entropy->workspace)), dictionary_corrupted);
-+		dictPtr += litlengthHeaderSize;
-+	}
-+
-+	if (dictPtr + 12 > dictEnd)
-+		return ERROR(dictionary_corrupted);
-+	{
-+		int i;
-+		size_t const dictContentSize = (size_t)(dictEnd - (dictPtr + 12));
-+		for (i = 0; i < 3; i++) {
-+			U32 const rep = ZSTD_readLE32(dictPtr);
-+			dictPtr += 4;
-+			if (rep == 0 || rep >= dictContentSize)
-+				return ERROR(dictionary_corrupted);
-+			entropy->rep[i] = rep;
-+		}
-+	}
-+
-+	return dictPtr - (const BYTE *)dict;
-+}
-+
-+static size_t ZSTD_decompress_insertDictionary(ZSTD_DCtx *dctx, const void *dict, size_t dictSize)
-+{
-+	if (dictSize < 8)
-+		return ZSTD_refDictContent(dctx, dict, dictSize);
-+	{
-+		U32 const magic = ZSTD_readLE32(dict);
-+		if (magic != ZSTD_DICT_MAGIC) {
-+			return ZSTD_refDictContent(dctx, dict, dictSize); /* pure content mode */
-+		}
-+	}
-+	dctx->dictID = ZSTD_readLE32((const char *)dict + 4);
-+
-+	/* load entropy tables */
-+	{
-+		size_t const eSize = ZSTD_loadEntropy(&dctx->entropy, dict, dictSize);
-+		if (ZSTD_isError(eSize))
-+			return ERROR(dictionary_corrupted);
-+		dict = (const char *)dict + eSize;
-+		dictSize -= eSize;
-+	}
-+	dctx->litEntropy = dctx->fseEntropy = 1;
-+
-+	/* reference dictionary content */
-+	return ZSTD_refDictContent(dctx, dict, dictSize);
-+}
-+
-+size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx *dctx, const void *dict, size_t dictSize)
-+{
-+	CHECK_F(ZSTD_decompressBegin(dctx));
-+	if (dict && dictSize)
-+		CHECK_E(ZSTD_decompress_insertDictionary(dctx, dict, dictSize), dictionary_corrupted);
-+	return 0;
-+}
-+
-+/* ======   ZSTD_DDict   ====== */
-+
-+struct ZSTD_DDict_s {
-+	void *dictBuffer;
-+	const void *dictContent;
-+	size_t dictSize;
-+	ZSTD_entropyTables_t entropy;
-+	U32 dictID;
-+	U32 entropyPresent;
-+	ZSTD_customMem cMem;
-+}; /* typedef'd to ZSTD_DDict within "zstd.h" */
-+
-+size_t ZSTD_DDictWorkspaceBound(void) { return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_DDict)); }
-+
-+static const void *ZSTD_DDictDictContent(const ZSTD_DDict *ddict) { return ddict->dictContent; }
-+
-+static size_t ZSTD_DDictDictSize(const ZSTD_DDict *ddict) { return ddict->dictSize; }
-+
-+static void ZSTD_refDDict(ZSTD_DCtx *dstDCtx, const ZSTD_DDict *ddict)
-+{
-+	ZSTD_decompressBegin(dstDCtx); /* init */
-+	if (ddict) {		       /* support refDDict on NULL */
-+		dstDCtx->dictID = ddict->dictID;
-+		dstDCtx->base = ddict->dictContent;
-+		dstDCtx->vBase = ddict->dictContent;
-+		dstDCtx->dictEnd = (const BYTE *)ddict->dictContent + ddict->dictSize;
-+		dstDCtx->previousDstEnd = dstDCtx->dictEnd;
-+		if (ddict->entropyPresent) {
-+			dstDCtx->litEntropy = 1;
-+			dstDCtx->fseEntropy = 1;
-+			dstDCtx->LLTptr = ddict->entropy.LLTable;
-+			dstDCtx->MLTptr = ddict->entropy.MLTable;
-+			dstDCtx->OFTptr = ddict->entropy.OFTable;
-+			dstDCtx->HUFptr = ddict->entropy.hufTable;
-+			dstDCtx->entropy.rep[0] = ddict->entropy.rep[0];
-+			dstDCtx->entropy.rep[1] = ddict->entropy.rep[1];
-+			dstDCtx->entropy.rep[2] = ddict->entropy.rep[2];
-+		} else {
-+			dstDCtx->litEntropy = 0;
-+			dstDCtx->fseEntropy = 0;
-+		}
-+	}
-+}
-+
-+static size_t ZSTD_loadEntropy_inDDict(ZSTD_DDict *ddict)
-+{
-+	ddict->dictID = 0;
-+	ddict->entropyPresent = 0;
-+	if (ddict->dictSize < 8)
-+		return 0;
-+	{
-+		U32 const magic = ZSTD_readLE32(ddict->dictContent);
-+		if (magic != ZSTD_DICT_MAGIC)
-+			return 0; /* pure content mode */
-+	}
-+	ddict->dictID = ZSTD_readLE32((const char *)ddict->dictContent + 4);
-+
-+	/* load entropy tables */
-+	CHECK_E(ZSTD_loadEntropy(&ddict->entropy, ddict->dictContent, ddict->dictSize), dictionary_corrupted);
-+	ddict->entropyPresent = 1;
-+	return 0;
-+}
-+
-+static ZSTD_DDict *ZSTD_createDDict_advanced(const void *dict, size_t dictSize, unsigned byReference, ZSTD_customMem customMem)
-+{
-+	if (!customMem.customAlloc || !customMem.customFree)
-+		return NULL;
-+
-+	{
-+		ZSTD_DDict *const ddict = (ZSTD_DDict *)ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
-+		if (!ddict)
-+			return NULL;
-+		ddict->cMem = customMem;
-+
-+		if ((byReference) || (!dict) || (!dictSize)) {
-+			ddict->dictBuffer = NULL;
-+			ddict->dictContent = dict;
-+		} else {
-+			void *const internalBuffer = ZSTD_malloc(dictSize, customMem);
-+			if (!internalBuffer) {
-+				ZSTD_freeDDict(ddict);
-+				return NULL;
-+			}
-+			memcpy(internalBuffer, dict, dictSize);
-+			ddict->dictBuffer = internalBuffer;
-+			ddict->dictContent = internalBuffer;
-+		}
-+		ddict->dictSize = dictSize;
-+		ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001); /* cover both little and big endian */
-+		/* parse dictionary content */
-+		{
-+			size_t const errorCode = ZSTD_loadEntropy_inDDict(ddict);
-+			if (ZSTD_isError(errorCode)) {
-+				ZSTD_freeDDict(ddict);
-+				return NULL;
-+			}
-+		}
-+
-+		return ddict;
-+	}
-+}
-+
-+/*! ZSTD_initDDict() :
-+*   Create a digested dictionary, to start decompression without startup delay.
-+*   `dict` content is copied inside DDict.
-+*   Consequently, `dict` can be released after `ZSTD_DDict` creation */
-+ZSTD_DDict *ZSTD_initDDict(const void *dict, size_t dictSize, void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-+	return ZSTD_createDDict_advanced(dict, dictSize, 1, stackMem);
-+}
-+
-+size_t ZSTD_freeDDict(ZSTD_DDict *ddict)
-+{
-+	if (ddict == NULL)
-+		return 0; /* support free on NULL */
-+	{
-+		ZSTD_customMem const cMem = ddict->cMem;
-+		ZSTD_free(ddict->dictBuffer, cMem);
-+		ZSTD_free(ddict, cMem);
-+		return 0;
-+	}
-+}
-+
-+/*! ZSTD_getDictID_fromDict() :
-+ *  Provides the dictID stored within dictionary.
-+ *  if @return == 0, the dictionary is not conformant with Zstandard specification.
-+ *  It can still be loaded, but as a content-only dictionary. */
-+unsigned ZSTD_getDictID_fromDict(const void *dict, size_t dictSize)
-+{
-+	if (dictSize < 8)
-+		return 0;
-+	if (ZSTD_readLE32(dict) != ZSTD_DICT_MAGIC)
-+		return 0;
-+	return ZSTD_readLE32((const char *)dict + 4);
-+}
-+
-+/*! ZSTD_getDictID_fromDDict() :
-+ *  Provides the dictID of the dictionary loaded into `ddict`.
-+ *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
-+ *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
-+unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict *ddict)
-+{
-+	if (ddict == NULL)
-+		return 0;
-+	return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
-+}
-+
-+/*! ZSTD_getDictID_fromFrame() :
-+ *  Provides the dictID required to decompressed the frame stored within `src`.
-+ *  If @return == 0, the dictID could not be decoded.
-+ *  This could for one of the following reasons :
-+ *  - The frame does not require a dictionary to be decoded (most common case).
-+ *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
-+ *    Note : this use case also happens when using a non-conformant dictionary.
-+ *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
-+ *  - This is not a Zstandard frame.
-+ *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
-+unsigned ZSTD_getDictID_fromFrame(const void *src, size_t srcSize)
-+{
-+	ZSTD_frameParams zfp = {0, 0, 0, 0};
-+	size_t const hError = ZSTD_getFrameParams(&zfp, src, srcSize);
-+	if (ZSTD_isError(hError))
-+		return 0;
-+	return zfp.dictID;
-+}
-+
-+/*! ZSTD_decompress_usingDDict() :
-+*   Decompression using a pre-digested Dictionary
-+*   Use dictionary without significant overhead. */
-+size_t ZSTD_decompress_usingDDict(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const ZSTD_DDict *ddict)
-+{
-+	/* pass content and size in case legacy frames are encountered */
-+	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, NULL, 0, ddict);
-+}
-+
-+/*=====================================
-+*   Streaming decompression
-+*====================================*/
-+
-+typedef enum { zdss_init, zdss_loadHeader, zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
-+
-+/* *** Resource management *** */
-+struct ZSTD_DStream_s {
-+	ZSTD_DCtx *dctx;
-+	ZSTD_DDict *ddictLocal;
-+	const ZSTD_DDict *ddict;
-+	ZSTD_frameParams fParams;
-+	ZSTD_dStreamStage stage;
-+	char *inBuff;
-+	size_t inBuffSize;
-+	size_t inPos;
-+	size_t maxWindowSize;
-+	char *outBuff;
-+	size_t outBuffSize;
-+	size_t outStart;
-+	size_t outEnd;
-+	size_t blockSize;
-+	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX]; /* tmp buffer to store frame header */
-+	size_t lhSize;
-+	ZSTD_customMem customMem;
-+	void *legacyContext;
-+	U32 previousLegacyVersion;
-+	U32 legacyVersion;
-+	U32 hostageByte;
-+}; /* typedef'd to ZSTD_DStream within "zstd.h" */
-+
-+size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize)
-+{
-+	size_t const blockSize = MIN(maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-+	size_t const inBuffSize = blockSize;
-+	size_t const outBuffSize = maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-+	return ZSTD_DCtxWorkspaceBound() + ZSTD_ALIGN(sizeof(ZSTD_DStream)) + ZSTD_ALIGN(inBuffSize) + ZSTD_ALIGN(outBuffSize);
-+}
-+
-+static ZSTD_DStream *ZSTD_createDStream_advanced(ZSTD_customMem customMem)
-+{
-+	ZSTD_DStream *zds;
-+
-+	if (!customMem.customAlloc || !customMem.customFree)
-+		return NULL;
-+
-+	zds = (ZSTD_DStream *)ZSTD_malloc(sizeof(ZSTD_DStream), customMem);
-+	if (zds == NULL)
-+		return NULL;
-+	memset(zds, 0, sizeof(ZSTD_DStream));
-+	memcpy(&zds->customMem, &customMem, sizeof(ZSTD_customMem));
-+	zds->dctx = ZSTD_createDCtx_advanced(customMem);
-+	if (zds->dctx == NULL) {
-+		ZSTD_freeDStream(zds);
-+		return NULL;
-+	}
-+	zds->stage = zdss_init;
-+	zds->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
-+	return zds;
-+}
-+
-+ZSTD_DStream *ZSTD_initDStream(size_t maxWindowSize, void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-+	ZSTD_DStream *zds = ZSTD_createDStream_advanced(stackMem);
-+	if (!zds) {
-+		return NULL;
-+	}
-+
-+	zds->maxWindowSize = maxWindowSize;
-+	zds->stage = zdss_loadHeader;
-+	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-+	ZSTD_freeDDict(zds->ddictLocal);
-+	zds->ddictLocal = NULL;
-+	zds->ddict = zds->ddictLocal;
-+	zds->legacyVersion = 0;
-+	zds->hostageByte = 0;
-+
-+	{
-+		size_t const blockSize = MIN(zds->maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-+		size_t const neededOutSize = zds->maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-+
-+		zds->inBuff = (char *)ZSTD_malloc(blockSize, zds->customMem);
-+		zds->inBuffSize = blockSize;
-+		zds->outBuff = (char *)ZSTD_malloc(neededOutSize, zds->customMem);
-+		zds->outBuffSize = neededOutSize;
-+		if (zds->inBuff == NULL || zds->outBuff == NULL) {
-+			ZSTD_freeDStream(zds);
-+			return NULL;
-+		}
-+	}
-+	return zds;
-+}
-+
-+ZSTD_DStream *ZSTD_initDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict *ddict, void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_DStream *zds = ZSTD_initDStream(maxWindowSize, workspace, workspaceSize);
-+	if (zds) {
-+		zds->ddict = ddict;
-+	}
-+	return zds;
-+}
-+
-+size_t ZSTD_freeDStream(ZSTD_DStream *zds)
-+{
-+	if (zds == NULL)
-+		return 0; /* support free on null */
-+	{
-+		ZSTD_customMem const cMem = zds->customMem;
-+		ZSTD_freeDCtx(zds->dctx);
-+		zds->dctx = NULL;
-+		ZSTD_freeDDict(zds->ddictLocal);
-+		zds->ddictLocal = NULL;
-+		ZSTD_free(zds->inBuff, cMem);
-+		zds->inBuff = NULL;
-+		ZSTD_free(zds->outBuff, cMem);
-+		zds->outBuff = NULL;
-+		ZSTD_free(zds, cMem);
-+		return 0;
-+	}
-+}
-+
-+/* *** Initialization *** */
-+
-+size_t ZSTD_DStreamInSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX + ZSTD_blockHeaderSize; }
-+size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
-+
-+size_t ZSTD_resetDStream(ZSTD_DStream *zds)
-+{
-+	zds->stage = zdss_loadHeader;
-+	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-+	zds->legacyVersion = 0;
-+	zds->hostageByte = 0;
-+	return ZSTD_frameHeaderSize_prefix;
-+}
-+
-+/* *****   Decompression   ***** */
-+
-+ZSTD_STATIC size_t ZSTD_limitCopy(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-+{
-+	size_t const length = MIN(dstCapacity, srcSize);
-+	memcpy(dst, src, length);
-+	return length;
-+}
-+
-+size_t ZSTD_decompressStream(ZSTD_DStream *zds, ZSTD_outBuffer *output, ZSTD_inBuffer *input)
-+{
-+	const char *const istart = (const char *)(input->src) + input->pos;
-+	const char *const iend = (const char *)(input->src) + input->size;
-+	const char *ip = istart;
-+	char *const ostart = (char *)(output->dst) + output->pos;
-+	char *const oend = (char *)(output->dst) + output->size;
-+	char *op = ostart;
-+	U32 someMoreWork = 1;
-+
-+	while (someMoreWork) {
-+		switch (zds->stage) {
-+		case zdss_init:
-+			ZSTD_resetDStream(zds); /* transparent reset on starting decoding a new frame */
-+						/* fall-through */
-+
-+		case zdss_loadHeader: {
-+			size_t const hSize = ZSTD_getFrameParams(&zds->fParams, zds->headerBuffer, zds->lhSize);
-+			if (ZSTD_isError(hSize))
-+				return hSize;
-+			if (hSize != 0) {				   /* need more input */
-+				size_t const toLoad = hSize - zds->lhSize; /* if hSize!=0, hSize > zds->lhSize */
-+				if (toLoad > (size_t)(iend - ip)) {	/* not enough input to load full header */
-+					memcpy(zds->headerBuffer + zds->lhSize, ip, iend - ip);
-+					zds->lhSize += iend - ip;
-+					input->pos = input->size;
-+					return (MAX(ZSTD_frameHeaderSize_min, hSize) - zds->lhSize) +
-+					       ZSTD_blockHeaderSize; /* remaining header bytes + next block header */
-+				}
-+				memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad);
-+				zds->lhSize = hSize;
-+				ip += toLoad;
-+				break;
-+			}
-+
-+			/* check for single-pass mode opportunity */
-+			if (zds->fParams.frameContentSize && zds->fParams.windowSize /* skippable frame if == 0 */
-+			    && (U64)(size_t)(oend - op) >= zds->fParams.frameContentSize) {
-+				size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend - istart);
-+				if (cSize <= (size_t)(iend - istart)) {
-+					size_t const decompressedSize = ZSTD_decompress_usingDDict(zds->dctx, op, oend - op, istart, cSize, zds->ddict);
-+					if (ZSTD_isError(decompressedSize))
-+						return decompressedSize;
-+					ip = istart + cSize;
-+					op += decompressedSize;
-+					zds->dctx->expected = 0;
-+					zds->stage = zdss_init;
-+					someMoreWork = 0;
-+					break;
-+				}
-+			}
-+
-+			/* Consume header */
-+			ZSTD_refDDict(zds->dctx, zds->ddict);
-+			{
-+				size_t const h1Size = ZSTD_nextSrcSizeToDecompress(zds->dctx); /* == ZSTD_frameHeaderSize_prefix */
-+				CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer, h1Size));
-+				{
-+					size_t const h2Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-+					CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer + h1Size, h2Size));
-+				}
-+			}
-+
-+			zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
-+			if (zds->fParams.windowSize > zds->maxWindowSize)
-+				return ERROR(frameParameter_windowTooLarge);
-+
-+			/* Buffers are preallocated, but double check */
-+			{
-+				size_t const blockSize = MIN(zds->maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-+				size_t const neededOutSize = zds->maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-+				if (zds->inBuffSize < blockSize) {
-+					return ERROR(GENERIC);
-+				}
-+				if (zds->outBuffSize < neededOutSize) {
-+					return ERROR(GENERIC);
-+				}
-+				zds->blockSize = blockSize;
-+			}
-+			zds->stage = zdss_read;
-+		}
-+		/* pass-through */
-+
-+		case zdss_read: {
-+			size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-+			if (neededInSize == 0) { /* end of frame */
-+				zds->stage = zdss_init;
-+				someMoreWork = 0;
-+				break;
-+			}
-+			if ((size_t)(iend - ip) >= neededInSize) { /* decode directly from src */
-+				const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
-+				size_t const decodedSize = ZSTD_decompressContinue(zds->dctx, zds->outBuff + zds->outStart,
-+										   (isSkipFrame ? 0 : zds->outBuffSize - zds->outStart), ip, neededInSize);
-+				if (ZSTD_isError(decodedSize))
-+					return decodedSize;
-+				ip += neededInSize;
-+				if (!decodedSize && !isSkipFrame)
-+					break; /* this was just a header */
-+				zds->outEnd = zds->outStart + decodedSize;
-+				zds->stage = zdss_flush;
-+				break;
-+			}
-+			if (ip == iend) {
-+				someMoreWork = 0;
-+				break;
-+			} /* no more input */
-+			zds->stage = zdss_load;
-+			/* pass-through */
-+		}
-+
-+		case zdss_load: {
-+			size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-+			size_t const toLoad = neededInSize - zds->inPos; /* should always be <= remaining space within inBuff */
-+			size_t loadedSize;
-+			if (toLoad > zds->inBuffSize - zds->inPos)
-+				return ERROR(corruption_detected); /* should never happen */
-+			loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend - ip);
-+			ip += loadedSize;
-+			zds->inPos += loadedSize;
-+			if (loadedSize < toLoad) {
-+				someMoreWork = 0;
-+				break;
-+			} /* not enough input, wait for more */
-+
-+			/* decode loaded input */
-+			{
-+				const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
-+				size_t const decodedSize = ZSTD_decompressContinue(zds->dctx, zds->outBuff + zds->outStart, zds->outBuffSize - zds->outStart,
-+										   zds->inBuff, neededInSize);
-+				if (ZSTD_isError(decodedSize))
-+					return decodedSize;
-+				zds->inPos = 0; /* input is consumed */
-+				if (!decodedSize && !isSkipFrame) {
-+					zds->stage = zdss_read;
-+					break;
-+				} /* this was just a header */
-+				zds->outEnd = zds->outStart + decodedSize;
-+				zds->stage = zdss_flush;
-+				/* pass-through */
-+			}
-+		}
-+
-+		case zdss_flush: {
-+			size_t const toFlushSize = zds->outEnd - zds->outStart;
-+			size_t const flushedSize = ZSTD_limitCopy(op, oend - op, zds->outBuff + zds->outStart, toFlushSize);
-+			op += flushedSize;
-+			zds->outStart += flushedSize;
-+			if (flushedSize == toFlushSize) { /* flush completed */
-+				zds->stage = zdss_read;
-+				if (zds->outStart + zds->blockSize > zds->outBuffSize)
-+					zds->outStart = zds->outEnd = 0;
-+				break;
-+			}
-+			/* cannot complete flush */
-+			someMoreWork = 0;
-+			break;
-+		}
-+		default:
-+			return ERROR(GENERIC); /* impossible */
-+		}
-+	}
-+
-+	/* result */
-+	input->pos += (size_t)(ip - istart);
-+	output->pos += (size_t)(op - ostart);
-+	{
-+		size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-+		if (!nextSrcSizeHint) {			    /* frame fully decoded */
-+			if (zds->outEnd == zds->outStart) { /* output fully flushed */
-+				if (zds->hostageByte) {
-+					if (input->pos >= input->size) {
-+						zds->stage = zdss_read;
-+						return 1;
-+					}	     /* can't release hostage (not present) */
-+					input->pos++; /* release hostage */
-+				}
-+				return 0;
-+			}
-+			if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
-+				input->pos--;    /* note : pos > 0, otherwise, impossible to finish reading last block */
-+				zds->hostageByte = 1;
-+			}
-+			return 1;
-+		}
-+		nextSrcSizeHint += ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds->dctx) == ZSTDnit_block); /* preload header of next block */
-+		if (zds->inPos > nextSrcSizeHint)
-+			return ERROR(GENERIC); /* should never happen */
-+		nextSrcSizeHint -= zds->inPos; /* already loaded*/
-+		return nextSrcSizeHint;
-+	}
-+}
-+
-+EXPORT_SYMBOL(ZSTD_DCtxWorkspaceBound);
-+EXPORT_SYMBOL(ZSTD_initDCtx);
-+EXPORT_SYMBOL(ZSTD_decompressDCtx);
-+EXPORT_SYMBOL(ZSTD_decompress_usingDict);
-+
-+EXPORT_SYMBOL(ZSTD_DDictWorkspaceBound);
-+EXPORT_SYMBOL(ZSTD_initDDict);
-+EXPORT_SYMBOL(ZSTD_decompress_usingDDict);
-+
-+EXPORT_SYMBOL(ZSTD_DStreamWorkspaceBound);
-+EXPORT_SYMBOL(ZSTD_initDStream);
-+EXPORT_SYMBOL(ZSTD_initDStream_usingDDict);
-+EXPORT_SYMBOL(ZSTD_resetDStream);
-+EXPORT_SYMBOL(ZSTD_decompressStream);
-+EXPORT_SYMBOL(ZSTD_DStreamInSize);
-+EXPORT_SYMBOL(ZSTD_DStreamOutSize);
-+
-+EXPORT_SYMBOL(ZSTD_findFrameCompressedSize);
-+EXPORT_SYMBOL(ZSTD_getFrameContentSize);
-+EXPORT_SYMBOL(ZSTD_findDecompressedSize);
-+
-+EXPORT_SYMBOL(ZSTD_isFrame);
-+EXPORT_SYMBOL(ZSTD_getDictID_fromDict);
-+EXPORT_SYMBOL(ZSTD_getDictID_fromDDict);
-+EXPORT_SYMBOL(ZSTD_getDictID_fromFrame);
-+
-+EXPORT_SYMBOL(ZSTD_getFrameParams);
-+EXPORT_SYMBOL(ZSTD_decompressBegin);
-+EXPORT_SYMBOL(ZSTD_decompressBegin_usingDict);
-+EXPORT_SYMBOL(ZSTD_copyDCtx);
-+EXPORT_SYMBOL(ZSTD_nextSrcSizeToDecompress);
-+EXPORT_SYMBOL(ZSTD_decompressContinue);
-+EXPORT_SYMBOL(ZSTD_nextInputType);
-+
-+EXPORT_SYMBOL(ZSTD_decompressBlock);
-+EXPORT_SYMBOL(ZSTD_insertBlock);
-+
-+MODULE_LICENSE("Dual BSD/GPL");
-+MODULE_DESCRIPTION("Zstd Decompressor");
-diff --git a/lib/zstd/entropy_common.c b/lib/zstd/entropy_common.c
-new file mode 100644
-index 0000000..2b0a643
---- /dev/null
-+++ b/lib/zstd/entropy_common.c
-@@ -0,0 +1,243 @@
-+/*
-+ * Common functions of New Generation Entropy library
-+ * Copyright (C) 2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+
-+/* *************************************
-+*  Dependencies
-+***************************************/
-+#include "error_private.h" /* ERR_*, ERROR */
-+#include "fse.h"
-+#include "huf.h"
-+#include "mem.h"
-+
-+/*===   Version   ===*/
-+unsigned FSE_versionNumber(void) { return FSE_VERSION_NUMBER; }
-+
-+/*===   Error Management   ===*/
-+unsigned FSE_isError(size_t code) { return ERR_isError(code); }
-+
-+unsigned HUF_isError(size_t code) { return ERR_isError(code); }
-+
-+/*-**************************************************************
-+*  FSE NCount encoding-decoding
-+****************************************************************/
-+size_t FSE_readNCount(short *normalizedCounter, unsigned *maxSVPtr, unsigned *tableLogPtr, const void *headerBuffer, size_t hbSize)
-+{
-+	const BYTE *const istart = (const BYTE *)headerBuffer;
-+	const BYTE *const iend = istart + hbSize;
-+	const BYTE *ip = istart;
-+	int nbBits;
-+	int remaining;
-+	int threshold;
-+	U32 bitStream;
-+	int bitCount;
-+	unsigned charnum = 0;
-+	int previous0 = 0;
-+
-+	if (hbSize < 4)
-+		return ERROR(srcSize_wrong);
-+	bitStream = ZSTD_readLE32(ip);
-+	nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG; /* extract tableLog */
-+	if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX)
-+		return ERROR(tableLog_tooLarge);
-+	bitStream >>= 4;
-+	bitCount = 4;
-+	*tableLogPtr = nbBits;
-+	remaining = (1 << nbBits) + 1;
-+	threshold = 1 << nbBits;
-+	nbBits++;
-+
-+	while ((remaining > 1) & (charnum <= *maxSVPtr)) {
-+		if (previous0) {
-+			unsigned n0 = charnum;
-+			while ((bitStream & 0xFFFF) == 0xFFFF) {
-+				n0 += 24;
-+				if (ip < iend - 5) {
-+					ip += 2;
-+					bitStream = ZSTD_readLE32(ip) >> bitCount;
-+				} else {
-+					bitStream >>= 16;
-+					bitCount += 16;
-+				}
-+			}
-+			while ((bitStream & 3) == 3) {
-+				n0 += 3;
-+				bitStream >>= 2;
-+				bitCount += 2;
-+			}
-+			n0 += bitStream & 3;
-+			bitCount += 2;
-+			if (n0 > *maxSVPtr)
-+				return ERROR(maxSymbolValue_tooSmall);
-+			while (charnum < n0)
-+				normalizedCounter[charnum++] = 0;
-+			if ((ip <= iend - 7) || (ip + (bitCount >> 3) <= iend - 4)) {
-+				ip += bitCount >> 3;
-+				bitCount &= 7;
-+				bitStream = ZSTD_readLE32(ip) >> bitCount;
-+			} else {
-+				bitStream >>= 2;
-+			}
-+		}
-+		{
-+			int const max = (2 * threshold - 1) - remaining;
-+			int count;
-+
-+			if ((bitStream & (threshold - 1)) < (U32)max) {
-+				count = bitStream & (threshold - 1);
-+				bitCount += nbBits - 1;
-+			} else {
-+				count = bitStream & (2 * threshold - 1);
-+				if (count >= threshold)
-+					count -= max;
-+				bitCount += nbBits;
-+			}
-+
-+			count--;				 /* extra accuracy */
-+			remaining -= count < 0 ? -count : count; /* -1 means +1 */
-+			normalizedCounter[charnum++] = (short)count;
-+			previous0 = !count;
-+			while (remaining < threshold) {
-+				nbBits--;
-+				threshold >>= 1;
-+			}
-+
-+			if ((ip <= iend - 7) || (ip + (bitCount >> 3) <= iend - 4)) {
-+				ip += bitCount >> 3;
-+				bitCount &= 7;
-+			} else {
-+				bitCount -= (int)(8 * (iend - 4 - ip));
-+				ip = iend - 4;
-+			}
-+			bitStream = ZSTD_readLE32(ip) >> (bitCount & 31);
-+		}
-+	} /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
-+	if (remaining != 1)
-+		return ERROR(corruption_detected);
-+	if (bitCount > 32)
-+		return ERROR(corruption_detected);
-+	*maxSVPtr = charnum - 1;
-+
-+	ip += (bitCount + 7) >> 3;
-+	return ip - istart;
-+}
-+
-+/*! HUF_readStats() :
-+	Read compact Huffman tree, saved by HUF_writeCTable().
-+	`huffWeight` is destination buffer.
-+	`rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
-+	@return : size read from `src` , or an error Code .
-+	Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
-+*/
-+size_t HUF_readStats_wksp(BYTE *huffWeight, size_t hwSize, U32 *rankStats, U32 *nbSymbolsPtr, U32 *tableLogPtr, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-+{
-+	U32 weightTotal;
-+	const BYTE *ip = (const BYTE *)src;
-+	size_t iSize;
-+	size_t oSize;
-+
-+	if (!srcSize)
-+		return ERROR(srcSize_wrong);
-+	iSize = ip[0];
-+	/* memset(huffWeight, 0, hwSize);   */ /* is not necessary, even though some analyzer complain ... */
-+
-+	if (iSize >= 128) { /* special header */
-+		oSize = iSize - 127;
-+		iSize = ((oSize + 1) / 2);
-+		if (iSize + 1 > srcSize)
-+			return ERROR(srcSize_wrong);
-+		if (oSize >= hwSize)
-+			return ERROR(corruption_detected);
-+		ip += 1;
-+		{
-+			U32 n;
-+			for (n = 0; n < oSize; n += 2) {
-+				huffWeight[n] = ip[n / 2] >> 4;
-+				huffWeight[n + 1] = ip[n / 2] & 15;
-+			}
-+		}
-+	} else {						 /* header compressed with FSE (normal case) */
-+		if (iSize + 1 > srcSize)
-+			return ERROR(srcSize_wrong);
-+		oSize = FSE_decompress_wksp(huffWeight, hwSize - 1, ip + 1, iSize, 6, workspace, workspaceSize); /* max (hwSize-1) values decoded, as last one is implied */
-+		if (FSE_isError(oSize))
-+			return oSize;
-+	}
-+
-+	/* collect weight stats */
-+	memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
-+	weightTotal = 0;
-+	{
-+		U32 n;
-+		for (n = 0; n < oSize; n++) {
-+			if (huffWeight[n] >= HUF_TABLELOG_MAX)
-+				return ERROR(corruption_detected);
-+			rankStats[huffWeight[n]]++;
-+			weightTotal += (1 << huffWeight[n]) >> 1;
-+		}
-+	}
-+	if (weightTotal == 0)
-+		return ERROR(corruption_detected);
-+
-+	/* get last non-null symbol weight (implied, total must be 2^n) */
-+	{
-+		U32 const tableLog = BIT_highbit32(weightTotal) + 1;
-+		if (tableLog > HUF_TABLELOG_MAX)
-+			return ERROR(corruption_detected);
-+		*tableLogPtr = tableLog;
-+		/* determine last weight */
-+		{
-+			U32 const total = 1 << tableLog;
-+			U32 const rest = total - weightTotal;
-+			U32 const verif = 1 << BIT_highbit32(rest);
-+			U32 const lastWeight = BIT_highbit32(rest) + 1;
-+			if (verif != rest)
-+				return ERROR(corruption_detected); /* last value must be a clean power of 2 */
-+			huffWeight[oSize] = (BYTE)lastWeight;
-+			rankStats[lastWeight]++;
-+		}
-+	}
-+
-+	/* check tree construction validity */
-+	if ((rankStats[1] < 2) || (rankStats[1] & 1))
-+		return ERROR(corruption_detected); /* by construction : at least 2 elts of rank 1, must be even */
-+
-+	/* results */
-+	*nbSymbolsPtr = (U32)(oSize + 1);
-+	return iSize + 1;
-+}
-diff --git a/lib/zstd/error_private.h b/lib/zstd/error_private.h
-new file mode 100644
-index 0000000..2062ff0
---- /dev/null
-+++ b/lib/zstd/error_private.h
-@@ -0,0 +1,51 @@
-+/**
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+/* Note : this module is expected to remain private, do not expose it */
-+
-+#ifndef ERROR_H_MODULE
-+#define ERROR_H_MODULE
-+
-+/* ****************************************
-+*  Dependencies
-+******************************************/
-+#include  /* size_t */
-+#include   /* enum list */
-+
-+/* ****************************************
-+*  Compiler-specific
-+******************************************/
-+#define ERR_STATIC static __attribute__((unused))
-+
-+/*-****************************************
-+*  Customization (error_public.h)
-+******************************************/
-+typedef ZSTD_ErrorCode ERR_enum;
-+#define PREFIX(name) ZSTD_error_##name
-+
-+/*-****************************************
-+*  Error codes handling
-+******************************************/
-+#define ERROR(name) ((size_t)-PREFIX(name))
-+
-+ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
-+
-+ERR_STATIC ERR_enum ERR_getErrorCode(size_t code)
-+{
-+	if (!ERR_isError(code))
-+		return (ERR_enum)0;
-+	return (ERR_enum)(0 - code);
-+}
-+
-+#endif /* ERROR_H_MODULE */
-diff --git a/lib/zstd/fse.h b/lib/zstd/fse.h
-new file mode 100644
-index 0000000..7460ab0
---- /dev/null
-+++ b/lib/zstd/fse.h
-@@ -0,0 +1,575 @@
-+/*
-+ * FSE : Finite State Entropy codec
-+ * Public Prototypes declaration
-+ * Copyright (C) 2013-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+#ifndef FSE_H
-+#define FSE_H
-+
-+/*-*****************************************
-+*  Dependencies
-+******************************************/
-+#include  /* size_t, ptrdiff_t */
-+
-+/*-*****************************************
-+*  FSE_PUBLIC_API : control library symbols visibility
-+******************************************/
-+#define FSE_PUBLIC_API
-+
-+/*------   Version   ------*/
-+#define FSE_VERSION_MAJOR 0
-+#define FSE_VERSION_MINOR 9
-+#define FSE_VERSION_RELEASE 0
-+
-+#define FSE_LIB_VERSION FSE_VERSION_MAJOR.FSE_VERSION_MINOR.FSE_VERSION_RELEASE
-+#define FSE_QUOTE(str) #str
-+#define FSE_EXPAND_AND_QUOTE(str) FSE_QUOTE(str)
-+#define FSE_VERSION_STRING FSE_EXPAND_AND_QUOTE(FSE_LIB_VERSION)
-+
-+#define FSE_VERSION_NUMBER (FSE_VERSION_MAJOR * 100 * 100 + FSE_VERSION_MINOR * 100 + FSE_VERSION_RELEASE)
-+FSE_PUBLIC_API unsigned FSE_versionNumber(void); /**< library version number; to be used when checking dll version */
-+
-+/*-*****************************************
-+*  Tool functions
-+******************************************/
-+FSE_PUBLIC_API size_t FSE_compressBound(size_t size); /* maximum compressed size */
-+
-+/* Error Management */
-+FSE_PUBLIC_API unsigned FSE_isError(size_t code); /* tells if a return value is an error code */
-+
-+/*-*****************************************
-+*  FSE detailed API
-+******************************************/
-+/*!
-+FSE_compress() does the following:
-+1. count symbol occurrence from source[] into table count[]
-+2. normalize counters so that sum(count[]) == Power_of_2 (2^tableLog)
-+3. save normalized counters to memory buffer using writeNCount()
-+4. build encoding table 'CTable' from normalized counters
-+5. encode the data stream using encoding table 'CTable'
-+
-+FSE_decompress() does the following:
-+1. read normalized counters with readNCount()
-+2. build decoding table 'DTable' from normalized counters
-+3. decode the data stream using decoding table 'DTable'
-+
-+The following API allows targeting specific sub-functions for advanced tasks.
-+For example, it's possible to compress several blocks using the same 'CTable',
-+or to save and provide normalized distribution using external method.
-+*/
-+
-+/* *** COMPRESSION *** */
-+/*! FSE_optimalTableLog():
-+	dynamically downsize 'tableLog' when conditions are met.
-+	It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
-+	@return : recommended tableLog (necessarily <= 'maxTableLog') */
-+FSE_PUBLIC_API unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
-+
-+/*! FSE_normalizeCount():
-+	normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
-+	'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
-+	@return : tableLog,
-+			  or an errorCode, which can be tested using FSE_isError() */
-+FSE_PUBLIC_API size_t FSE_normalizeCount(short *normalizedCounter, unsigned tableLog, const unsigned *count, size_t srcSize, unsigned maxSymbolValue);
-+
-+/*! FSE_NCountWriteBound():
-+	Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
-+	Typically useful for allocation purpose. */
-+FSE_PUBLIC_API size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog);
-+
-+/*! FSE_writeNCount():
-+	Compactly save 'normalizedCounter' into 'buffer'.
-+	@return : size of the compressed table,
-+			  or an errorCode, which can be tested using FSE_isError(). */
-+FSE_PUBLIC_API size_t FSE_writeNCount(void *buffer, size_t bufferSize, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
-+
-+/*! Constructor and Destructor of FSE_CTable.
-+	Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
-+typedef unsigned FSE_CTable; /* don't allocate that. It's only meant to be more restrictive than void* */
-+
-+/*! FSE_compress_usingCTable():
-+	Compress `src` using `ct` into `dst` which must be already allocated.
-+	@return : size of compressed data (<= `dstCapacity`),
-+			  or 0 if compressed data could not fit into `dst`,
-+			  or an errorCode, which can be tested using FSE_isError() */
-+FSE_PUBLIC_API size_t FSE_compress_usingCTable(void *dst, size_t dstCapacity, const void *src, size_t srcSize, const FSE_CTable *ct);
-+
-+/*!
-+Tutorial :
-+----------
-+The first step is to count all symbols. FSE_count() does this job very fast.
-+Result will be saved into 'count', a table of unsigned int, which must be already allocated, and have 'maxSymbolValuePtr[0]+1' cells.
-+'src' is a table of bytes of size 'srcSize'. All values within 'src' MUST be <= maxSymbolValuePtr[0]
-+maxSymbolValuePtr[0] will be updated, with its real value (necessarily <= original value)
-+FSE_count() will return the number of occurrence of the most frequent symbol.
-+This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
-+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
-+
-+The next step is to normalize the frequencies.
-+FSE_normalizeCount() will ensure that sum of frequencies is == 2 ^'tableLog'.
-+It also guarantees a minimum of 1 to any Symbol with frequency >= 1.
-+You can use 'tableLog'==0 to mean "use default tableLog value".
-+If you are unsure of which tableLog value to use, you can ask FSE_optimalTableLog(),
-+which will provide the optimal valid tableLog given sourceSize, maxSymbolValue, and a user-defined maximum (0 means "default").
-+
-+The result of FSE_normalizeCount() will be saved into a table,
-+called 'normalizedCounter', which is a table of signed short.
-+'normalizedCounter' must be already allocated, and have at least 'maxSymbolValue+1' cells.
-+The return value is tableLog if everything proceeded as expected.
-+It is 0 if there is a single symbol within distribution.
-+If there is an error (ex: invalid tableLog value), the function will return an ErrorCode (which can be tested using FSE_isError()).
-+
-+'normalizedCounter' can be saved in a compact manner to a memory area using FSE_writeNCount().
-+'buffer' must be already allocated.
-+For guaranteed success, buffer size must be at least FSE_headerBound().
-+The result of the function is the number of bytes written into 'buffer'.
-+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError(); ex : buffer size too small).
-+
-+'normalizedCounter' can then be used to create the compression table 'CTable'.
-+The space required by 'CTable' must be already allocated, using FSE_createCTable().
-+You can then use FSE_buildCTable() to fill 'CTable'.
-+If there is an error, both functions will return an ErrorCode (which can be tested using FSE_isError()).
-+
-+'CTable' can then be used to compress 'src', with FSE_compress_usingCTable().
-+Similar to FSE_count(), the convention is that 'src' is assumed to be a table of char of size 'srcSize'
-+The function returns the size of compressed data (without header), necessarily <= `dstCapacity`.
-+If it returns '0', compressed data could not fit into 'dst'.
-+If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
-+*/
-+
-+/* *** DECOMPRESSION *** */
-+
-+/*! FSE_readNCount():
-+	Read compactly saved 'normalizedCounter' from 'rBuffer'.
-+	@return : size read from 'rBuffer',
-+			  or an errorCode, which can be tested using FSE_isError().
-+			  maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
-+FSE_PUBLIC_API size_t FSE_readNCount(short *normalizedCounter, unsigned *maxSymbolValuePtr, unsigned *tableLogPtr, const void *rBuffer, size_t rBuffSize);
-+
-+/*! Constructor and Destructor of FSE_DTable.
-+	Note that its size depends on 'tableLog' */
-+typedef unsigned FSE_DTable; /* don't allocate that. It's just a way to be more restrictive than void* */
-+
-+/*! FSE_buildDTable():
-+	Builds 'dt', which must be already allocated, using FSE_createDTable().
-+	return : 0, or an errorCode, which can be tested using FSE_isError() */
-+FSE_PUBLIC_API size_t FSE_buildDTable_wksp(FSE_DTable *dt, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void *workspace, size_t workspaceSize);
-+
-+/*! FSE_decompress_usingDTable():
-+	Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
-+	into `dst` which must be already allocated.
-+	@return : size of regenerated data (necessarily <= `dstCapacity`),
-+			  or an errorCode, which can be tested using FSE_isError() */
-+FSE_PUBLIC_API size_t FSE_decompress_usingDTable(void *dst, size_t dstCapacity, const void *cSrc, size_t cSrcSize, const FSE_DTable *dt);
-+
-+/*!
-+Tutorial :
-+----------
-+(Note : these functions only decompress FSE-compressed blocks.
-+ If block is uncompressed, use memcpy() instead
-+ If block is a single repeated byte, use memset() instead )
-+
-+The first step is to obtain the normalized frequencies of symbols.
-+This can be performed by FSE_readNCount() if it was saved using FSE_writeNCount().
-+'normalizedCounter' must be already allocated, and have at least 'maxSymbolValuePtr[0]+1' cells of signed short.
-+In practice, that means it's necessary to know 'maxSymbolValue' beforehand,
-+or size the table to handle worst case situations (typically 256).
-+FSE_readNCount() will provide 'tableLog' and 'maxSymbolValue'.
-+The result of FSE_readNCount() is the number of bytes read from 'rBuffer'.
-+Note that 'rBufferSize' must be at least 4 bytes, even if useful information is less than that.
-+If there is an error, the function will return an error code, which can be tested using FSE_isError().
-+
-+The next step is to build the decompression tables 'FSE_DTable' from 'normalizedCounter'.
-+This is performed by the function FSE_buildDTable().
-+The space required by 'FSE_DTable' must be already allocated using FSE_createDTable().
-+If there is an error, the function will return an error code, which can be tested using FSE_isError().
-+
-+`FSE_DTable` can then be used to decompress `cSrc`, with FSE_decompress_usingDTable().
-+`cSrcSize` must be strictly correct, otherwise decompression will fail.
-+FSE_decompress_usingDTable() result will tell how many bytes were regenerated (<=`dstCapacity`).
-+If there is an error, the function will return an error code, which can be tested using FSE_isError(). (ex: dst buffer too small)
-+*/
-+
-+/* *** Dependency *** */
-+#include "bitstream.h"
-+
-+/* *****************************************
-+*  Static allocation
-+*******************************************/
-+/* FSE buffer bounds */
-+#define FSE_NCOUNTBOUND 512
-+#define FSE_BLOCKBOUND(size) (size + (size >> 7))
-+#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size)) /* Macro version, useful for static allocation */
-+
-+/* It is possible to statically allocate FSE CTable/DTable as a table of FSE_CTable/FSE_DTable using below macros */
-+#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) (1 + (1 << (maxTableLog - 1)) + ((maxSymbolValue + 1) * 2))
-+#define FSE_DTABLE_SIZE_U32(maxTableLog) (1 + (1 << maxTableLog))
-+
-+/* *****************************************
-+*  FSE advanced API
-+*******************************************/
-+/* FSE_count_wksp() :
-+ * Same as FSE_count(), but using an externally provided scratch buffer.
-+ * `workSpace` size must be table of >= `1024` unsigned
-+ */
-+size_t FSE_count_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned *workSpace);
-+
-+/* FSE_countFast_wksp() :
-+ * Same as FSE_countFast(), but using an externally provided scratch buffer.
-+ * `workSpace` must be a table of minimum `1024` unsigned
-+ */
-+size_t FSE_countFast_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize, unsigned *workSpace);
-+
-+/*! FSE_count_simple
-+ * Same as FSE_countFast(), but does not use any additional memory (not even on stack).
-+ * This function is unsafe, and will segfault if any value within `src` is `> *maxSymbolValuePtr` (presuming it's also the size of `count`).
-+*/
-+size_t FSE_count_simple(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize);
-+
-+unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus);
-+/**< same as FSE_optimalTableLog(), which used `minus==2` */
-+
-+size_t FSE_buildCTable_raw(FSE_CTable *ct, unsigned nbBits);
-+/**< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
-+
-+size_t FSE_buildCTable_rle(FSE_CTable *ct, unsigned char symbolValue);
-+/**< build a fake FSE_CTable, designed to compress always the same symbolValue */
-+
-+/* FSE_buildCTable_wksp() :
-+ * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
-+ * `wkspSize` must be >= `(1<= BIT_DStream_completed
-+
-+When it's done, verify decompression is fully completed, by checking both DStream and the relevant states.
-+Checking if DStream has reached its end is performed by :
-+	BIT_endOfDStream(&DStream);
-+Check also the states. There might be some symbols left there, if some high probability ones (>50%) are possible.
-+	FSE_endOfDState(&DState);
-+*/
-+
-+/* *****************************************
-+*  FSE unsafe API
-+*******************************************/
-+static unsigned char FSE_decodeSymbolFast(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD);
-+/* faster, but works only if nbBits is always >= 1 (otherwise, result will be corrupted) */
-+
-+/* *****************************************
-+*  Implementation of inlined functions
-+*******************************************/
-+typedef struct {
-+	int deltaFindState;
-+	U32 deltaNbBits;
-+} FSE_symbolCompressionTransform; /* total 8 bytes */
-+
-+ZSTD_STATIC void FSE_initCState(FSE_CState_t *statePtr, const FSE_CTable *ct)
-+{
-+	const void *ptr = ct;
-+	const U16 *u16ptr = (const U16 *)ptr;
-+	const U32 tableLog = ZSTD_read16(ptr);
-+	statePtr->value = (ptrdiff_t)1 << tableLog;
-+	statePtr->stateTable = u16ptr + 2;
-+	statePtr->symbolTT = ((const U32 *)ct + 1 + (tableLog ? (1 << (tableLog - 1)) : 1));
-+	statePtr->stateLog = tableLog;
-+}
-+
-+/*! FSE_initCState2() :
-+*   Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
-+*   uses the smallest state value possible, saving the cost of this symbol */
-+ZSTD_STATIC void FSE_initCState2(FSE_CState_t *statePtr, const FSE_CTable *ct, U32 symbol)
-+{
-+	FSE_initCState(statePtr, ct);
-+	{
-+		const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform *)(statePtr->symbolTT))[symbol];
-+		const U16 *stateTable = (const U16 *)(statePtr->stateTable);
-+		U32 nbBitsOut = (U32)((symbolTT.deltaNbBits + (1 << 15)) >> 16);
-+		statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
-+		statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-+	}
-+}
-+
-+ZSTD_STATIC void FSE_encodeSymbol(BIT_CStream_t *bitC, FSE_CState_t *statePtr, U32 symbol)
-+{
-+	const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform *)(statePtr->symbolTT))[symbol];
-+	const U16 *const stateTable = (const U16 *)(statePtr->stateTable);
-+	U32 nbBitsOut = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
-+	BIT_addBits(bitC, statePtr->value, nbBitsOut);
-+	statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-+}
-+
-+ZSTD_STATIC void FSE_flushCState(BIT_CStream_t *bitC, const FSE_CState_t *statePtr)
-+{
-+	BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
-+	BIT_flushBits(bitC);
-+}
-+
-+/* ======    Decompression    ====== */
-+
-+typedef struct {
-+	U16 tableLog;
-+	U16 fastMode;
-+} FSE_DTableHeader; /* sizeof U32 */
-+
-+typedef struct {
-+	unsigned short newState;
-+	unsigned char symbol;
-+	unsigned char nbBits;
-+} FSE_decode_t; /* size == U32 */
-+
-+ZSTD_STATIC void FSE_initDState(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD, const FSE_DTable *dt)
-+{
-+	const void *ptr = dt;
-+	const FSE_DTableHeader *const DTableH = (const FSE_DTableHeader *)ptr;
-+	DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
-+	BIT_reloadDStream(bitD);
-+	DStatePtr->table = dt + 1;
-+}
-+
-+ZSTD_STATIC BYTE FSE_peekSymbol(const FSE_DState_t *DStatePtr)
-+{
-+	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-+	return DInfo.symbol;
-+}
-+
-+ZSTD_STATIC void FSE_updateState(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD)
-+{
-+	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-+	U32 const nbBits = DInfo.nbBits;
-+	size_t const lowBits = BIT_readBits(bitD, nbBits);
-+	DStatePtr->state = DInfo.newState + lowBits;
-+}
-+
-+ZSTD_STATIC BYTE FSE_decodeSymbol(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD)
-+{
-+	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-+	U32 const nbBits = DInfo.nbBits;
-+	BYTE const symbol = DInfo.symbol;
-+	size_t const lowBits = BIT_readBits(bitD, nbBits);
-+
-+	DStatePtr->state = DInfo.newState + lowBits;
-+	return symbol;
-+}
-+
-+/*! FSE_decodeSymbolFast() :
-+	unsafe, only works if no symbol has a probability > 50% */
-+ZSTD_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD)
-+{
-+	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-+	U32 const nbBits = DInfo.nbBits;
-+	BYTE const symbol = DInfo.symbol;
-+	size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
-+
-+	DStatePtr->state = DInfo.newState + lowBits;
-+	return symbol;
-+}
-+
-+ZSTD_STATIC unsigned FSE_endOfDState(const FSE_DState_t *DStatePtr) { return DStatePtr->state == 0; }
-+
-+/* **************************************************************
-+*  Tuning parameters
-+****************************************************************/
-+/*!MEMORY_USAGE :
-+*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
-+*  Increasing memory usage improves compression ratio
-+*  Reduced memory usage can improve speed, due to cache effect
-+*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
-+#ifndef FSE_MAX_MEMORY_USAGE
-+#define FSE_MAX_MEMORY_USAGE 14
-+#endif
-+#ifndef FSE_DEFAULT_MEMORY_USAGE
-+#define FSE_DEFAULT_MEMORY_USAGE 13
-+#endif
-+
-+/*!FSE_MAX_SYMBOL_VALUE :
-+*  Maximum symbol value authorized.
-+*  Required for proper stack allocation */
-+#ifndef FSE_MAX_SYMBOL_VALUE
-+#define FSE_MAX_SYMBOL_VALUE 255
-+#endif
-+
-+/* **************************************************************
-+*  template functions type & suffix
-+****************************************************************/
-+#define FSE_FUNCTION_TYPE BYTE
-+#define FSE_FUNCTION_EXTENSION
-+#define FSE_DECODE_TYPE FSE_decode_t
-+
-+/* ***************************************************************
-+*  Constants
-+*****************************************************************/
-+#define FSE_MAX_TABLELOG (FSE_MAX_MEMORY_USAGE - 2)
-+#define FSE_MAX_TABLESIZE (1U << FSE_MAX_TABLELOG)
-+#define FSE_MAXTABLESIZE_MASK (FSE_MAX_TABLESIZE - 1)
-+#define FSE_DEFAULT_TABLELOG (FSE_DEFAULT_MEMORY_USAGE - 2)
-+#define FSE_MIN_TABLELOG 5
-+
-+#define FSE_TABLELOG_ABSOLUTE_MAX 15
-+#if FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX
-+#error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
-+#endif
-+
-+#define FSE_TABLESTEP(tableSize) ((tableSize >> 1) + (tableSize >> 3) + 3)
-+
-+#endif /* FSE_H */
-diff --git a/lib/zstd/fse_compress.c b/lib/zstd/fse_compress.c
-new file mode 100644
-index 0000000..ef3d174
---- /dev/null
-+++ b/lib/zstd/fse_compress.c
-@@ -0,0 +1,795 @@
-+/*
-+ * FSE : Finite State Entropy encoder
-+ * Copyright (C) 2013-2015, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+
-+/* **************************************************************
-+*  Compiler specifics
-+****************************************************************/
-+#define FORCE_INLINE static __always_inline
-+
-+/* **************************************************************
-+*  Includes
-+****************************************************************/
-+#include "bitstream.h"
-+#include "fse.h"
-+#include 
-+#include 
-+#include 
-+#include  /* memcpy, memset */
-+
-+/* **************************************************************
-+*  Error Management
-+****************************************************************/
-+#define FSE_STATIC_ASSERT(c)                                   \
-+	{                                                      \
-+		enum { FSE_static_assert = 1 / (int)(!!(c)) }; \
-+	} /* use only *after* variable declarations */
-+
-+/* **************************************************************
-+*  Templates
-+****************************************************************/
-+/*
-+  designed to be included
-+  for type-specific functions (template emulation in C)
-+  Objective is to write these functions only once, for improved maintenance
-+*/
-+
-+/* safety checks */
-+#ifndef FSE_FUNCTION_EXTENSION
-+#error "FSE_FUNCTION_EXTENSION must be defined"
-+#endif
-+#ifndef FSE_FUNCTION_TYPE
-+#error "FSE_FUNCTION_TYPE must be defined"
-+#endif
-+
-+/* Function names */
-+#define FSE_CAT(X, Y) X##Y
-+#define FSE_FUNCTION_NAME(X, Y) FSE_CAT(X, Y)
-+#define FSE_TYPE_NAME(X, Y) FSE_CAT(X, Y)
-+
-+/* Function templates */
-+
-+/* FSE_buildCTable_wksp() :
-+ * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
-+ * wkspSize should be sized to handle worst case situation, which is `1<> 1 : 1);
-+	FSE_symbolCompressionTransform *const symbolTT = (FSE_symbolCompressionTransform *)(FSCT);
-+	U32 const step = FSE_TABLESTEP(tableSize);
-+	U32 highThreshold = tableSize - 1;
-+
-+	U32 *cumul;
-+	FSE_FUNCTION_TYPE *tableSymbol;
-+	size_t spaceUsed32 = 0;
-+
-+	cumul = (U32 *)workspace + spaceUsed32;
-+	spaceUsed32 += FSE_MAX_SYMBOL_VALUE + 2;
-+	tableSymbol = (FSE_FUNCTION_TYPE *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(sizeof(FSE_FUNCTION_TYPE) * ((size_t)1 << tableLog), sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	/* CTable header */
-+	tableU16[-2] = (U16)tableLog;
-+	tableU16[-1] = (U16)maxSymbolValue;
-+
-+	/* For explanations on how to distribute symbol values over the table :
-+	*  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
-+
-+	/* symbol start positions */
-+	{
-+		U32 u;
-+		cumul[0] = 0;
-+		for (u = 1; u <= maxSymbolValue + 1; u++) {
-+			if (normalizedCounter[u - 1] == -1) { /* Low proba symbol */
-+				cumul[u] = cumul[u - 1] + 1;
-+				tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u - 1);
-+			} else {
-+				cumul[u] = cumul[u - 1] + normalizedCounter[u - 1];
-+			}
-+		}
-+		cumul[maxSymbolValue + 1] = tableSize + 1;
-+	}
-+
-+	/* Spread symbols */
-+	{
-+		U32 position = 0;
-+		U32 symbol;
-+		for (symbol = 0; symbol <= maxSymbolValue; symbol++) {
-+			int nbOccurences;
-+			for (nbOccurences = 0; nbOccurences < normalizedCounter[symbol]; nbOccurences++) {
-+				tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;
-+				position = (position + step) & tableMask;
-+				while (position > highThreshold)
-+					position = (position + step) & tableMask; /* Low proba area */
-+			}
-+		}
-+
-+		if (position != 0)
-+			return ERROR(GENERIC); /* Must have gone through all positions */
-+	}
-+
-+	/* Build table */
-+	{
-+		U32 u;
-+		for (u = 0; u < tableSize; u++) {
-+			FSE_FUNCTION_TYPE s = tableSymbol[u];	/* note : static analyzer may not understand tableSymbol is properly initialized */
-+			tableU16[cumul[s]++] = (U16)(tableSize + u); /* TableU16 : sorted by symbol order; gives next state value */
-+		}
-+	}
-+
-+	/* Build Symbol Transformation Table */
-+	{
-+		unsigned total = 0;
-+		unsigned s;
-+		for (s = 0; s <= maxSymbolValue; s++) {
-+			switch (normalizedCounter[s]) {
-+			case 0: break;
-+
-+			case -1:
-+			case 1:
-+				symbolTT[s].deltaNbBits = (tableLog << 16) - (1 << tableLog);
-+				symbolTT[s].deltaFindState = total - 1;
-+				total++;
-+				break;
-+			default: {
-+				U32 const maxBitsOut = tableLog - BIT_highbit32(normalizedCounter[s] - 1);
-+				U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;
-+				symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;
-+				symbolTT[s].deltaFindState = total - normalizedCounter[s];
-+				total += normalizedCounter[s];
-+			}
-+			}
-+		}
-+	}
-+
-+	return 0;
-+}
-+
-+/*-**************************************************************
-+*  FSE NCount encoding-decoding
-+****************************************************************/
-+size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog)
-+{
-+	size_t const maxHeaderSize = (((maxSymbolValue + 1) * tableLog) >> 3) + 3;
-+	return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND; /* maxSymbolValue==0 ? use default */
-+}
-+
-+static size_t FSE_writeNCount_generic(void *header, size_t headerBufferSize, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
-+				      unsigned writeIsSafe)
-+{
-+	BYTE *const ostart = (BYTE *)header;
-+	BYTE *out = ostart;
-+	BYTE *const oend = ostart + headerBufferSize;
-+	int nbBits;
-+	const int tableSize = 1 << tableLog;
-+	int remaining;
-+	int threshold;
-+	U32 bitStream;
-+	int bitCount;
-+	unsigned charnum = 0;
-+	int previous0 = 0;
-+
-+	bitStream = 0;
-+	bitCount = 0;
-+	/* Table Size */
-+	bitStream += (tableLog - FSE_MIN_TABLELOG) << bitCount;
-+	bitCount += 4;
-+
-+	/* Init */
-+	remaining = tableSize + 1; /* +1 for extra accuracy */
-+	threshold = tableSize;
-+	nbBits = tableLog + 1;
-+
-+	while (remaining > 1) { /* stops at 1 */
-+		if (previous0) {
-+			unsigned start = charnum;
-+			while (!normalizedCounter[charnum])
-+				charnum++;
-+			while (charnum >= start + 24) {
-+				start += 24;
-+				bitStream += 0xFFFFU << bitCount;
-+				if ((!writeIsSafe) && (out > oend - 2))
-+					return ERROR(dstSize_tooSmall); /* Buffer overflow */
-+				out[0] = (BYTE)bitStream;
-+				out[1] = (BYTE)(bitStream >> 8);
-+				out += 2;
-+				bitStream >>= 16;
-+			}
-+			while (charnum >= start + 3) {
-+				start += 3;
-+				bitStream += 3 << bitCount;
-+				bitCount += 2;
-+			}
-+			bitStream += (charnum - start) << bitCount;
-+			bitCount += 2;
-+			if (bitCount > 16) {
-+				if ((!writeIsSafe) && (out > oend - 2))
-+					return ERROR(dstSize_tooSmall); /* Buffer overflow */
-+				out[0] = (BYTE)bitStream;
-+				out[1] = (BYTE)(bitStream >> 8);
-+				out += 2;
-+				bitStream >>= 16;
-+				bitCount -= 16;
-+			}
-+		}
-+		{
-+			int count = normalizedCounter[charnum++];
-+			int const max = (2 * threshold - 1) - remaining;
-+			remaining -= count < 0 ? -count : count;
-+			count++; /* +1 for extra accuracy */
-+			if (count >= threshold)
-+				count += max; /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
-+			bitStream += count << bitCount;
-+			bitCount += nbBits;
-+			bitCount -= (count < max);
-+			previous0 = (count == 1);
-+			if (remaining < 1)
-+				return ERROR(GENERIC);
-+			while (remaining < threshold)
-+				nbBits--, threshold >>= 1;
-+		}
-+		if (bitCount > 16) {
-+			if ((!writeIsSafe) && (out > oend - 2))
-+				return ERROR(dstSize_tooSmall); /* Buffer overflow */
-+			out[0] = (BYTE)bitStream;
-+			out[1] = (BYTE)(bitStream >> 8);
-+			out += 2;
-+			bitStream >>= 16;
-+			bitCount -= 16;
-+		}
-+	}
-+
-+	/* flush remaining bitStream */
-+	if ((!writeIsSafe) && (out > oend - 2))
-+		return ERROR(dstSize_tooSmall); /* Buffer overflow */
-+	out[0] = (BYTE)bitStream;
-+	out[1] = (BYTE)(bitStream >> 8);
-+	out += (bitCount + 7) / 8;
-+
-+	if (charnum > maxSymbolValue + 1)
-+		return ERROR(GENERIC);
-+
-+	return (out - ostart);
-+}
-+
-+size_t FSE_writeNCount(void *buffer, size_t bufferSize, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-+{
-+	if (tableLog > FSE_MAX_TABLELOG)
-+		return ERROR(tableLog_tooLarge); /* Unsupported */
-+	if (tableLog < FSE_MIN_TABLELOG)
-+		return ERROR(GENERIC); /* Unsupported */
-+
-+	if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
-+		return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
-+
-+	return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);
-+}
-+
-+/*-**************************************************************
-+*  Counting histogram
-+****************************************************************/
-+/*! FSE_count_simple
-+	This function counts byte values within `src`, and store the histogram into table `count`.
-+	It doesn't use any additional memory.
-+	But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.
-+	For this reason, prefer using a table `count` with 256 elements.
-+	@return : count of most numerous element
-+*/
-+size_t FSE_count_simple(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize)
-+{
-+	const BYTE *ip = (const BYTE *)src;
-+	const BYTE *const end = ip + srcSize;
-+	unsigned maxSymbolValue = *maxSymbolValuePtr;
-+	unsigned max = 0;
-+
-+	memset(count, 0, (maxSymbolValue + 1) * sizeof(*count));
-+	if (srcSize == 0) {
-+		*maxSymbolValuePtr = 0;
-+		return 0;
-+	}
-+
-+	while (ip < end)
-+		count[*ip++]++;
-+
-+	while (!count[maxSymbolValue])
-+		maxSymbolValue--;
-+	*maxSymbolValuePtr = maxSymbolValue;
-+
-+	{
-+		U32 s;
-+		for (s = 0; s <= maxSymbolValue; s++)
-+			if (count[s] > max)
-+				max = count[s];
-+	}
-+
-+	return (size_t)max;
-+}
-+
-+/* FSE_count_parallel_wksp() :
-+ * Same as FSE_count_parallel(), but using an externally provided scratch buffer.
-+ * `workSpace` size must be a minimum of `1024 * sizeof(unsigned)`` */
-+static size_t FSE_count_parallel_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned checkMax,
-+				      unsigned *const workSpace)
-+{
-+	const BYTE *ip = (const BYTE *)source;
-+	const BYTE *const iend = ip + sourceSize;
-+	unsigned maxSymbolValue = *maxSymbolValuePtr;
-+	unsigned max = 0;
-+	U32 *const Counting1 = workSpace;
-+	U32 *const Counting2 = Counting1 + 256;
-+	U32 *const Counting3 = Counting2 + 256;
-+	U32 *const Counting4 = Counting3 + 256;
-+
-+	memset(Counting1, 0, 4 * 256 * sizeof(unsigned));
-+
-+	/* safety checks */
-+	if (!sourceSize) {
-+		memset(count, 0, maxSymbolValue + 1);
-+		*maxSymbolValuePtr = 0;
-+		return 0;
-+	}
-+	if (!maxSymbolValue)
-+		maxSymbolValue = 255; /* 0 == default */
-+
-+	/* by stripes of 16 bytes */
-+	{
-+		U32 cached = ZSTD_read32(ip);
-+		ip += 4;
-+		while (ip < iend - 15) {
-+			U32 c = cached;
-+			cached = ZSTD_read32(ip);
-+			ip += 4;
-+			Counting1[(BYTE)c]++;
-+			Counting2[(BYTE)(c >> 8)]++;
-+			Counting3[(BYTE)(c >> 16)]++;
-+			Counting4[c >> 24]++;
-+			c = cached;
-+			cached = ZSTD_read32(ip);
-+			ip += 4;
-+			Counting1[(BYTE)c]++;
-+			Counting2[(BYTE)(c >> 8)]++;
-+			Counting3[(BYTE)(c >> 16)]++;
-+			Counting4[c >> 24]++;
-+			c = cached;
-+			cached = ZSTD_read32(ip);
-+			ip += 4;
-+			Counting1[(BYTE)c]++;
-+			Counting2[(BYTE)(c >> 8)]++;
-+			Counting3[(BYTE)(c >> 16)]++;
-+			Counting4[c >> 24]++;
-+			c = cached;
-+			cached = ZSTD_read32(ip);
-+			ip += 4;
-+			Counting1[(BYTE)c]++;
-+			Counting2[(BYTE)(c >> 8)]++;
-+			Counting3[(BYTE)(c >> 16)]++;
-+			Counting4[c >> 24]++;
-+		}
-+		ip -= 4;
-+	}
-+
-+	/* finish last symbols */
-+	while (ip < iend)
-+		Counting1[*ip++]++;
-+
-+	if (checkMax) { /* verify stats will fit into destination table */
-+		U32 s;
-+		for (s = 255; s > maxSymbolValue; s--) {
-+			Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
-+			if (Counting1[s])
-+				return ERROR(maxSymbolValue_tooSmall);
-+		}
-+	}
-+
-+	{
-+		U32 s;
-+		for (s = 0; s <= maxSymbolValue; s++) {
-+			count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
-+			if (count[s] > max)
-+				max = count[s];
-+		}
-+	}
-+
-+	while (!count[maxSymbolValue])
-+		maxSymbolValue--;
-+	*maxSymbolValuePtr = maxSymbolValue;
-+	return (size_t)max;
-+}
-+
-+/* FSE_countFast_wksp() :
-+ * Same as FSE_countFast(), but using an externally provided scratch buffer.
-+ * `workSpace` size must be table of >= `1024` unsigned */
-+size_t FSE_countFast_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned *workSpace)
-+{
-+	if (sourceSize < 1500)
-+		return FSE_count_simple(count, maxSymbolValuePtr, source, sourceSize);
-+	return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
-+}
-+
-+/* FSE_count_wksp() :
-+ * Same as FSE_count(), but using an externally provided scratch buffer.
-+ * `workSpace` size must be table of >= `1024` unsigned */
-+size_t FSE_count_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned *workSpace)
-+{
-+	if (*maxSymbolValuePtr < 255)
-+		return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 1, workSpace);
-+	*maxSymbolValuePtr = 255;
-+	return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
-+}
-+
-+/*-**************************************************************
-+*  FSE Compression Code
-+****************************************************************/
-+/*! FSE_sizeof_CTable() :
-+	FSE_CTable is a variable size structure which contains :
-+	`U16 tableLog;`
-+	`U16 maxSymbolValue;`
-+	`U16 nextStateNumber[1 << tableLog];`                         // This size is variable
-+	`FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable
-+Allocation is manual (C standard does not support variable-size structures).
-+*/
-+size_t FSE_sizeof_CTable(unsigned maxSymbolValue, unsigned tableLog)
-+{
-+	if (tableLog > FSE_MAX_TABLELOG)
-+		return ERROR(tableLog_tooLarge);
-+	return FSE_CTABLE_SIZE_U32(tableLog, maxSymbolValue) * sizeof(U32);
-+}
-+
-+/* provides the minimum logSize to safely represent a distribution */
-+static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
-+{
-+	U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
-+	U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
-+	U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
-+	return minBits;
-+}
-+
-+unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
-+{
-+	U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
-+	U32 tableLog = maxTableLog;
-+	U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
-+	if (tableLog == 0)
-+		tableLog = FSE_DEFAULT_TABLELOG;
-+	if (maxBitsSrc < tableLog)
-+		tableLog = maxBitsSrc; /* Accuracy can be reduced */
-+	if (minBits > tableLog)
-+		tableLog = minBits; /* Need a minimum to safely represent all symbol values */
-+	if (tableLog < FSE_MIN_TABLELOG)
-+		tableLog = FSE_MIN_TABLELOG;
-+	if (tableLog > FSE_MAX_TABLELOG)
-+		tableLog = FSE_MAX_TABLELOG;
-+	return tableLog;
-+}
-+
-+unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
-+{
-+	return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
-+}
-+
-+/* Secondary normalization method.
-+   To be used when primary method fails. */
-+
-+static size_t FSE_normalizeM2(short *norm, U32 tableLog, const unsigned *count, size_t total, U32 maxSymbolValue)
-+{
-+	short const NOT_YET_ASSIGNED = -2;
-+	U32 s;
-+	U32 distributed = 0;
-+	U32 ToDistribute;
-+
-+	/* Init */
-+	U32 const lowThreshold = (U32)(total >> tableLog);
-+	U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
-+
-+	for (s = 0; s <= maxSymbolValue; s++) {
-+		if (count[s] == 0) {
-+			norm[s] = 0;
-+			continue;
-+		}
-+		if (count[s] <= lowThreshold) {
-+			norm[s] = -1;
-+			distributed++;
-+			total -= count[s];
-+			continue;
-+		}
-+		if (count[s] <= lowOne) {
-+			norm[s] = 1;
-+			distributed++;
-+			total -= count[s];
-+			continue;
-+		}
-+
-+		norm[s] = NOT_YET_ASSIGNED;
-+	}
-+	ToDistribute = (1 << tableLog) - distributed;
-+
-+	if ((total / ToDistribute) > lowOne) {
-+		/* risk of rounding to zero */
-+		lowOne = (U32)((total * 3) / (ToDistribute * 2));
-+		for (s = 0; s <= maxSymbolValue; s++) {
-+			if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
-+				norm[s] = 1;
-+				distributed++;
-+				total -= count[s];
-+				continue;
-+			}
-+		}
-+		ToDistribute = (1 << tableLog) - distributed;
-+	}
-+
-+	if (distributed == maxSymbolValue + 1) {
-+		/* all values are pretty poor;
-+		   probably incompressible data (should have already been detected);
-+		   find max, then give all remaining points to max */
-+		U32 maxV = 0, maxC = 0;
-+		for (s = 0; s <= maxSymbolValue; s++)
-+			if (count[s] > maxC)
-+				maxV = s, maxC = count[s];
-+		norm[maxV] += (short)ToDistribute;
-+		return 0;
-+	}
-+
-+	if (total == 0) {
-+		/* all of the symbols were low enough for the lowOne or lowThreshold */
-+		for (s = 0; ToDistribute > 0; s = (s + 1) % (maxSymbolValue + 1))
-+			if (norm[s] > 0)
-+				ToDistribute--, norm[s]++;
-+		return 0;
-+	}
-+
-+	{
-+		U64 const vStepLog = 62 - tableLog;
-+		U64 const mid = (1ULL << (vStepLog - 1)) - 1;
-+		U64 const rStep = div_u64((((U64)1 << vStepLog) * ToDistribute) + mid, (U32)total); /* scale on remaining */
-+		U64 tmpTotal = mid;
-+		for (s = 0; s <= maxSymbolValue; s++) {
-+			if (norm[s] == NOT_YET_ASSIGNED) {
-+				U64 const end = tmpTotal + (count[s] * rStep);
-+				U32 const sStart = (U32)(tmpTotal >> vStepLog);
-+				U32 const sEnd = (U32)(end >> vStepLog);
-+				U32 const weight = sEnd - sStart;
-+				if (weight < 1)
-+					return ERROR(GENERIC);
-+				norm[s] = (short)weight;
-+				tmpTotal = end;
-+			}
-+		}
-+	}
-+
-+	return 0;
-+}
-+
-+size_t FSE_normalizeCount(short *normalizedCounter, unsigned tableLog, const unsigned *count, size_t total, unsigned maxSymbolValue)
-+{
-+	/* Sanity checks */
-+	if (tableLog == 0)
-+		tableLog = FSE_DEFAULT_TABLELOG;
-+	if (tableLog < FSE_MIN_TABLELOG)
-+		return ERROR(GENERIC); /* Unsupported size */
-+	if (tableLog > FSE_MAX_TABLELOG)
-+		return ERROR(tableLog_tooLarge); /* Unsupported size */
-+	if (tableLog < FSE_minTableLog(total, maxSymbolValue))
-+		return ERROR(GENERIC); /* Too small tableLog, compression potentially impossible */
-+
-+	{
-+		U32 const rtbTable[] = {0, 473195, 504333, 520860, 550000, 700000, 750000, 830000};
-+		U64 const scale = 62 - tableLog;
-+		U64 const step = div_u64((U64)1 << 62, (U32)total); /* <== here, one division ! */
-+		U64 const vStep = 1ULL << (scale - 20);
-+		int stillToDistribute = 1 << tableLog;
-+		unsigned s;
-+		unsigned largest = 0;
-+		short largestP = 0;
-+		U32 lowThreshold = (U32)(total >> tableLog);
-+
-+		for (s = 0; s <= maxSymbolValue; s++) {
-+			if (count[s] == total)
-+				return 0; /* rle special case */
-+			if (count[s] == 0) {
-+				normalizedCounter[s] = 0;
-+				continue;
-+			}
-+			if (count[s] <= lowThreshold) {
-+				normalizedCounter[s] = -1;
-+				stillToDistribute--;
-+			} else {
-+				short proba = (short)((count[s] * step) >> scale);
-+				if (proba < 8) {
-+					U64 restToBeat = vStep * rtbTable[proba];
-+					proba += (count[s] * step) - ((U64)proba << scale) > restToBeat;
-+				}
-+				if (proba > largestP)
-+					largestP = proba, largest = s;
-+				normalizedCounter[s] = proba;
-+				stillToDistribute -= proba;
-+			}
-+		}
-+		if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
-+			/* corner case, need another normalization method */
-+			size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
-+			if (FSE_isError(errorCode))
-+				return errorCode;
-+		} else
-+			normalizedCounter[largest] += (short)stillToDistribute;
-+	}
-+
-+	return tableLog;
-+}
-+
-+/* fake FSE_CTable, for raw (uncompressed) input */
-+size_t FSE_buildCTable_raw(FSE_CTable *ct, unsigned nbBits)
-+{
-+	const unsigned tableSize = 1 << nbBits;
-+	const unsigned tableMask = tableSize - 1;
-+	const unsigned maxSymbolValue = tableMask;
-+	void *const ptr = ct;
-+	U16 *const tableU16 = ((U16 *)ptr) + 2;
-+	void *const FSCT = ((U32 *)ptr) + 1 /* header */ + (tableSize >> 1); /* assumption : tableLog >= 1 */
-+	FSE_symbolCompressionTransform *const symbolTT = (FSE_symbolCompressionTransform *)(FSCT);
-+	unsigned s;
-+
-+	/* Sanity checks */
-+	if (nbBits < 1)
-+		return ERROR(GENERIC); /* min size */
-+
-+	/* header */
-+	tableU16[-2] = (U16)nbBits;
-+	tableU16[-1] = (U16)maxSymbolValue;
-+
-+	/* Build table */
-+	for (s = 0; s < tableSize; s++)
-+		tableU16[s] = (U16)(tableSize + s);
-+
-+	/* Build Symbol Transformation Table */
-+	{
-+		const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
-+		for (s = 0; s <= maxSymbolValue; s++) {
-+			symbolTT[s].deltaNbBits = deltaNbBits;
-+			symbolTT[s].deltaFindState = s - 1;
-+		}
-+	}
-+
-+	return 0;
-+}
-+
-+/* fake FSE_CTable, for rle input (always same symbol) */
-+size_t FSE_buildCTable_rle(FSE_CTable *ct, BYTE symbolValue)
-+{
-+	void *ptr = ct;
-+	U16 *tableU16 = ((U16 *)ptr) + 2;
-+	void *FSCTptr = (U32 *)ptr + 2;
-+	FSE_symbolCompressionTransform *symbolTT = (FSE_symbolCompressionTransform *)FSCTptr;
-+
-+	/* header */
-+	tableU16[-2] = (U16)0;
-+	tableU16[-1] = (U16)symbolValue;
-+
-+	/* Build table */
-+	tableU16[0] = 0;
-+	tableU16[1] = 0; /* just in case */
-+
-+	/* Build Symbol Transformation Table */
-+	symbolTT[symbolValue].deltaNbBits = 0;
-+	symbolTT[symbolValue].deltaFindState = 0;
-+
-+	return 0;
-+}
-+
-+static size_t FSE_compress_usingCTable_generic(void *dst, size_t dstSize, const void *src, size_t srcSize, const FSE_CTable *ct, const unsigned fast)
-+{
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *ip = iend;
-+
-+	BIT_CStream_t bitC;
-+	FSE_CState_t CState1, CState2;
-+
-+	/* init */
-+	if (srcSize <= 2)
-+		return 0;
-+	{
-+		size_t const initError = BIT_initCStream(&bitC, dst, dstSize);
-+		if (FSE_isError(initError))
-+			return 0; /* not enough space available to write a bitstream */
-+	}
-+
-+#define FSE_FLUSHBITS(s) (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
-+
-+	if (srcSize & 1) {
-+		FSE_initCState2(&CState1, ct, *--ip);
-+		FSE_initCState2(&CState2, ct, *--ip);
-+		FSE_encodeSymbol(&bitC, &CState1, *--ip);
-+		FSE_FLUSHBITS(&bitC);
-+	} else {
-+		FSE_initCState2(&CState2, ct, *--ip);
-+		FSE_initCState2(&CState1, ct, *--ip);
-+	}
-+
-+	/* join to mod 4 */
-+	srcSize -= 2;
-+	if ((sizeof(bitC.bitContainer) * 8 > FSE_MAX_TABLELOG * 4 + 7) && (srcSize & 2)) { /* test bit 2 */
-+		FSE_encodeSymbol(&bitC, &CState2, *--ip);
-+		FSE_encodeSymbol(&bitC, &CState1, *--ip);
-+		FSE_FLUSHBITS(&bitC);
-+	}
-+
-+	/* 2 or 4 encoding per loop */
-+	while (ip > istart) {
-+
-+		FSE_encodeSymbol(&bitC, &CState2, *--ip);
-+
-+		if (sizeof(bitC.bitContainer) * 8 < FSE_MAX_TABLELOG * 2 + 7) /* this test must be static */
-+			FSE_FLUSHBITS(&bitC);
-+
-+		FSE_encodeSymbol(&bitC, &CState1, *--ip);
-+
-+		if (sizeof(bitC.bitContainer) * 8 > FSE_MAX_TABLELOG * 4 + 7) { /* this test must be static */
-+			FSE_encodeSymbol(&bitC, &CState2, *--ip);
-+			FSE_encodeSymbol(&bitC, &CState1, *--ip);
-+		}
-+
-+		FSE_FLUSHBITS(&bitC);
-+	}
-+
-+	FSE_flushCState(&bitC, &CState2);
-+	FSE_flushCState(&bitC, &CState1);
-+	return BIT_closeCStream(&bitC);
-+}
-+
-+size_t FSE_compress_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const FSE_CTable *ct)
-+{
-+	unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
-+
-+	if (fast)
-+		return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
-+	else
-+		return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
-+}
-+
-+size_t FSE_compressBound(size_t size) { return FSE_COMPRESSBOUND(size); }
-diff --git a/lib/zstd/fse_decompress.c b/lib/zstd/fse_decompress.c
-new file mode 100644
-index 0000000..a84300e
---- /dev/null
-+++ b/lib/zstd/fse_decompress.c
-@@ -0,0 +1,332 @@
-+/*
-+ * FSE : Finite State Entropy decoder
-+ * Copyright (C) 2013-2015, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+
-+/* **************************************************************
-+*  Compiler specifics
-+****************************************************************/
-+#define FORCE_INLINE static __always_inline
-+
-+/* **************************************************************
-+*  Includes
-+****************************************************************/
-+#include "bitstream.h"
-+#include "fse.h"
-+#include 
-+#include 
-+#include  /* memcpy, memset */
-+
-+/* **************************************************************
-+*  Error Management
-+****************************************************************/
-+#define FSE_isError ERR_isError
-+#define FSE_STATIC_ASSERT(c)                                   \
-+	{                                                      \
-+		enum { FSE_static_assert = 1 / (int)(!!(c)) }; \
-+	} /* use only *after* variable declarations */
-+
-+/* check and forward error code */
-+#define CHECK_F(f)                  \
-+	{                           \
-+		size_t const e = f; \
-+		if (FSE_isError(e)) \
-+			return e;   \
-+	}
-+
-+/* **************************************************************
-+*  Templates
-+****************************************************************/
-+/*
-+  designed to be included
-+  for type-specific functions (template emulation in C)
-+  Objective is to write these functions only once, for improved maintenance
-+*/
-+
-+/* safety checks */
-+#ifndef FSE_FUNCTION_EXTENSION
-+#error "FSE_FUNCTION_EXTENSION must be defined"
-+#endif
-+#ifndef FSE_FUNCTION_TYPE
-+#error "FSE_FUNCTION_TYPE must be defined"
-+#endif
-+
-+/* Function names */
-+#define FSE_CAT(X, Y) X##Y
-+#define FSE_FUNCTION_NAME(X, Y) FSE_CAT(X, Y)
-+#define FSE_TYPE_NAME(X, Y) FSE_CAT(X, Y)
-+
-+/* Function templates */
-+
-+size_t FSE_buildDTable_wksp(FSE_DTable *dt, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void *workspace, size_t workspaceSize)
-+{
-+	void *const tdPtr = dt + 1; /* because *dt is unsigned, 32-bits aligned on 32-bits */
-+	FSE_DECODE_TYPE *const tableDecode = (FSE_DECODE_TYPE *)(tdPtr);
-+	U16 *symbolNext = (U16 *)workspace;
-+
-+	U32 const maxSV1 = maxSymbolValue + 1;
-+	U32 const tableSize = 1 << tableLog;
-+	U32 highThreshold = tableSize - 1;
-+
-+	/* Sanity Checks */
-+	if (workspaceSize < sizeof(U16) * (FSE_MAX_SYMBOL_VALUE + 1))
-+		return ERROR(tableLog_tooLarge);
-+	if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE)
-+		return ERROR(maxSymbolValue_tooLarge);
-+	if (tableLog > FSE_MAX_TABLELOG)
-+		return ERROR(tableLog_tooLarge);
-+
-+	/* Init, lay down lowprob symbols */
-+	{
-+		FSE_DTableHeader DTableH;
-+		DTableH.tableLog = (U16)tableLog;
-+		DTableH.fastMode = 1;
-+		{
-+			S16 const largeLimit = (S16)(1 << (tableLog - 1));
-+			U32 s;
-+			for (s = 0; s < maxSV1; s++) {
-+				if (normalizedCounter[s] == -1) {
-+					tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
-+					symbolNext[s] = 1;
-+				} else {
-+					if (normalizedCounter[s] >= largeLimit)
-+						DTableH.fastMode = 0;
-+					symbolNext[s] = normalizedCounter[s];
-+				}
-+			}
-+		}
-+		memcpy(dt, &DTableH, sizeof(DTableH));
-+	}
-+
-+	/* Spread symbols */
-+	{
-+		U32 const tableMask = tableSize - 1;
-+		U32 const step = FSE_TABLESTEP(tableSize);
-+		U32 s, position = 0;
-+		for (s = 0; s < maxSV1; s++) {
-+			int i;
-+			for (i = 0; i < normalizedCounter[s]; i++) {
-+				tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
-+				position = (position + step) & tableMask;
-+				while (position > highThreshold)
-+					position = (position + step) & tableMask; /* lowprob area */
-+			}
-+		}
-+		if (position != 0)
-+			return ERROR(GENERIC); /* position must reach all cells once, otherwise normalizedCounter is incorrect */
-+	}
-+
-+	/* Build Decoding table */
-+	{
-+		U32 u;
-+		for (u = 0; u < tableSize; u++) {
-+			FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol);
-+			U16 nextState = symbolNext[symbol]++;
-+			tableDecode[u].nbBits = (BYTE)(tableLog - BIT_highbit32((U32)nextState));
-+			tableDecode[u].newState = (U16)((nextState << tableDecode[u].nbBits) - tableSize);
-+		}
-+	}
-+
-+	return 0;
-+}
-+
-+/*-*******************************************************
-+*  Decompression (Byte symbols)
-+*********************************************************/
-+size_t FSE_buildDTable_rle(FSE_DTable *dt, BYTE symbolValue)
-+{
-+	void *ptr = dt;
-+	FSE_DTableHeader *const DTableH = (FSE_DTableHeader *)ptr;
-+	void *dPtr = dt + 1;
-+	FSE_decode_t *const cell = (FSE_decode_t *)dPtr;
-+
-+	DTableH->tableLog = 0;
-+	DTableH->fastMode = 0;
-+
-+	cell->newState = 0;
-+	cell->symbol = symbolValue;
-+	cell->nbBits = 0;
-+
-+	return 0;
-+}
-+
-+size_t FSE_buildDTable_raw(FSE_DTable *dt, unsigned nbBits)
-+{
-+	void *ptr = dt;
-+	FSE_DTableHeader *const DTableH = (FSE_DTableHeader *)ptr;
-+	void *dPtr = dt + 1;
-+	FSE_decode_t *const dinfo = (FSE_decode_t *)dPtr;
-+	const unsigned tableSize = 1 << nbBits;
-+	const unsigned tableMask = tableSize - 1;
-+	const unsigned maxSV1 = tableMask + 1;
-+	unsigned s;
-+
-+	/* Sanity checks */
-+	if (nbBits < 1)
-+		return ERROR(GENERIC); /* min size */
-+
-+	/* Build Decoding Table */
-+	DTableH->tableLog = (U16)nbBits;
-+	DTableH->fastMode = 1;
-+	for (s = 0; s < maxSV1; s++) {
-+		dinfo[s].newState = 0;
-+		dinfo[s].symbol = (BYTE)s;
-+		dinfo[s].nbBits = (BYTE)nbBits;
-+	}
-+
-+	return 0;
-+}
-+
-+FORCE_INLINE size_t FSE_decompress_usingDTable_generic(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const FSE_DTable *dt,
-+						       const unsigned fast)
-+{
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *op = ostart;
-+	BYTE *const omax = op + maxDstSize;
-+	BYTE *const olimit = omax - 3;
-+
-+	BIT_DStream_t bitD;
-+	FSE_DState_t state1;
-+	FSE_DState_t state2;
-+
-+	/* Init */
-+	CHECK_F(BIT_initDStream(&bitD, cSrc, cSrcSize));
-+
-+	FSE_initDState(&state1, &bitD, dt);
-+	FSE_initDState(&state2, &bitD, dt);
-+
-+#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
-+
-+	/* 4 symbols per loop */
-+	for (; (BIT_reloadDStream(&bitD) == BIT_DStream_unfinished) & (op < olimit); op += 4) {
-+		op[0] = FSE_GETSYMBOL(&state1);
-+
-+		if (FSE_MAX_TABLELOG * 2 + 7 > sizeof(bitD.bitContainer) * 8) /* This test must be static */
-+			BIT_reloadDStream(&bitD);
-+
-+		op[1] = FSE_GETSYMBOL(&state2);
-+
-+		if (FSE_MAX_TABLELOG * 4 + 7 > sizeof(bitD.bitContainer) * 8) /* This test must be static */
-+		{
-+			if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) {
-+				op += 2;
-+				break;
-+			}
-+		}
-+
-+		op[2] = FSE_GETSYMBOL(&state1);
-+
-+		if (FSE_MAX_TABLELOG * 2 + 7 > sizeof(bitD.bitContainer) * 8) /* This test must be static */
-+			BIT_reloadDStream(&bitD);
-+
-+		op[3] = FSE_GETSYMBOL(&state2);
-+	}
-+
-+	/* tail */
-+	/* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
-+	while (1) {
-+		if (op > (omax - 2))
-+			return ERROR(dstSize_tooSmall);
-+		*op++ = FSE_GETSYMBOL(&state1);
-+		if (BIT_reloadDStream(&bitD) == BIT_DStream_overflow) {
-+			*op++ = FSE_GETSYMBOL(&state2);
-+			break;
-+		}
-+
-+		if (op > (omax - 2))
-+			return ERROR(dstSize_tooSmall);
-+		*op++ = FSE_GETSYMBOL(&state2);
-+		if (BIT_reloadDStream(&bitD) == BIT_DStream_overflow) {
-+			*op++ = FSE_GETSYMBOL(&state1);
-+			break;
-+		}
-+	}
-+
-+	return op - ostart;
-+}
-+
-+size_t FSE_decompress_usingDTable(void *dst, size_t originalSize, const void *cSrc, size_t cSrcSize, const FSE_DTable *dt)
-+{
-+	const void *ptr = dt;
-+	const FSE_DTableHeader *DTableH = (const FSE_DTableHeader *)ptr;
-+	const U32 fastMode = DTableH->fastMode;
-+
-+	/* select fast mode (static) */
-+	if (fastMode)
-+		return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
-+	return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
-+}
-+
-+size_t FSE_decompress_wksp(void *dst, size_t dstCapacity, const void *cSrc, size_t cSrcSize, unsigned maxLog, void *workspace, size_t workspaceSize)
-+{
-+	const BYTE *const istart = (const BYTE *)cSrc;
-+	const BYTE *ip = istart;
-+	unsigned tableLog;
-+	unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
-+	size_t NCountLength;
-+
-+	FSE_DTable *dt;
-+	short *counting;
-+	size_t spaceUsed32 = 0;
-+
-+	FSE_STATIC_ASSERT(sizeof(FSE_DTable) == sizeof(U32));
-+
-+	dt = (FSE_DTable *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += FSE_DTABLE_SIZE_U32(maxLog);
-+	counting = (short *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(sizeof(short) * (FSE_MAX_SYMBOL_VALUE + 1), sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	/* normal FSE decoding mode */
-+	NCountLength = FSE_readNCount(counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
-+	if (FSE_isError(NCountLength))
-+		return NCountLength;
-+	// if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size; supposed to be already checked in NCountLength, only remaining
-+	// case : NCountLength==cSrcSize */
-+	if (tableLog > maxLog)
-+		return ERROR(tableLog_tooLarge);
-+	ip += NCountLength;
-+	cSrcSize -= NCountLength;
-+
-+	CHECK_F(FSE_buildDTable_wksp(dt, counting, maxSymbolValue, tableLog, workspace, workspaceSize));
-+
-+	return FSE_decompress_usingDTable(dst, dstCapacity, ip, cSrcSize, dt); /* always return, even if it is an error code */
-+}
-diff --git a/lib/zstd/huf.h b/lib/zstd/huf.h
-new file mode 100644
-index 0000000..2143da2
---- /dev/null
-+++ b/lib/zstd/huf.h
-@@ -0,0 +1,212 @@
-+/*
-+ * Huffman coder, part of New Generation Entropy library
-+ * header file
-+ * Copyright (C) 2013-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+#ifndef HUF_H_298734234
-+#define HUF_H_298734234
-+
-+/* *** Dependencies *** */
-+#include  /* size_t */
-+
-+/* ***   Tool functions *** */
-+#define HUF_BLOCKSIZE_MAX (128 * 1024) /**< maximum input size for a single block compressed with HUF_compress */
-+size_t HUF_compressBound(size_t size); /**< maximum compressed size (worst case) */
-+
-+/* Error Management */
-+unsigned HUF_isError(size_t code); /**< tells if a return value is an error code */
-+
-+/* ***   Advanced function   *** */
-+
-+/** HUF_compress4X_wksp() :
-+*   Same as HUF_compress2(), but uses externally allocated `workSpace`, which must be a table of >= 1024 unsigned */
-+size_t HUF_compress4X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-+			   size_t wkspSize); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-+
-+/* *** Dependencies *** */
-+#include "mem.h" /* U32 */
-+
-+/* *** Constants *** */
-+#define HUF_TABLELOG_MAX 12     /* max configured tableLog (for static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */
-+#define HUF_TABLELOG_DEFAULT 11 /* tableLog by default, when not specified */
-+#define HUF_SYMBOLVALUE_MAX 255
-+
-+#define HUF_TABLELOG_ABSOLUTEMAX 15 /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
-+#if (HUF_TABLELOG_MAX > HUF_TABLELOG_ABSOLUTEMAX)
-+#error "HUF_TABLELOG_MAX is too large !"
-+#endif
-+
-+/* ****************************************
-+*  Static allocation
-+******************************************/
-+/* HUF buffer bounds */
-+#define HUF_CTABLEBOUND 129
-+#define HUF_BLOCKBOUND(size) (size + (size >> 8) + 8)			 /* only true if incompressible pre-filtered with fast heuristic */
-+#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size)) /* Macro version, useful for static allocation */
-+
-+/* static allocation of HUF's Compression Table */
-+#define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
-+	U32 name##hb[maxSymbolValue + 1];              \
-+	void *name##hv = &(name##hb);                  \
-+	HUF_CElt *name = (HUF_CElt *)(name##hv) /* no final ; */
-+
-+/* static allocation of HUF's DTable */
-+typedef U32 HUF_DTable;
-+#define HUF_DTABLE_SIZE(maxTableLog) (1 + (1 << (maxTableLog)))
-+#define HUF_CREATE_STATIC_DTABLEX2(DTable, maxTableLog) HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = {((U32)((maxTableLog)-1) * 0x01000001)}
-+#define HUF_CREATE_STATIC_DTABLEX4(DTable, maxTableLog) HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = {((U32)(maxTableLog)*0x01000001)}
-+
-+/* The workspace must have alignment at least 4 and be at least this large */
-+#define HUF_COMPRESS_WORKSPACE_SIZE (6 << 10)
-+#define HUF_COMPRESS_WORKSPACE_SIZE_U32 (HUF_COMPRESS_WORKSPACE_SIZE / sizeof(U32))
-+
-+/* The workspace must have alignment at least 4 and be at least this large */
-+#define HUF_DECOMPRESS_WORKSPACE_SIZE (3 << 10)
-+#define HUF_DECOMPRESS_WORKSPACE_SIZE_U32 (HUF_DECOMPRESS_WORKSPACE_SIZE / sizeof(U32))
-+
-+/* ****************************************
-+*  Advanced decompression functions
-+******************************************/
-+size_t HUF_decompress4X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize); /**< decodes RLE and uncompressed */
-+size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-+				size_t workspaceSize);							       /**< considers RLE and uncompressed as errors */
-+size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-+				   size_t workspaceSize); /**< single-symbol decoder */
-+size_t HUF_decompress4X4_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-+				   size_t workspaceSize); /**< double-symbols decoder */
-+
-+/* ****************************************
-+*  HUF detailed API
-+******************************************/
-+/*!
-+HUF_compress() does the following:
-+1. count symbol occurrence from source[] into table count[] using FSE_count()
-+2. (optional) refine tableLog using HUF_optimalTableLog()
-+3. build Huffman table from count using HUF_buildCTable()
-+4. save Huffman table to memory buffer using HUF_writeCTable_wksp()
-+5. encode the data stream using HUF_compress4X_usingCTable()
-+
-+The following API allows targeting specific sub-functions for advanced tasks.
-+For example, it's possible to compress several blocks using the same 'CTable',
-+or to save and regenerate 'CTable' using external methods.
-+*/
-+/* FSE_count() : find it within "fse.h" */
-+unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
-+typedef struct HUF_CElt_s HUF_CElt; /* incomplete type */
-+size_t HUF_writeCTable_wksp(void *dst, size_t maxDstSize, const HUF_CElt *CTable, unsigned maxSymbolValue, unsigned huffLog, void *workspace, size_t workspaceSize);
-+size_t HUF_compress4X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable);
-+
-+typedef enum {
-+	HUF_repeat_none,  /**< Cannot use the previous table */
-+	HUF_repeat_check, /**< Can use the previous table but it must be checked. Note : The previous table must have been constructed by HUF_compress{1,
-+			     4}X_repeat */
-+	HUF_repeat_valid  /**< Can use the previous table and it is asumed to be valid */
-+} HUF_repeat;
-+/** HUF_compress4X_repeat() :
-+*   Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
-+*   If it uses hufTable it does not modify hufTable or repeat.
-+*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
-+*   If preferRepeat then the old table will always be used if valid. */
-+size_t HUF_compress4X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-+			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat,
-+			     int preferRepeat); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-+
-+/** HUF_buildCTable_wksp() :
-+ *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
-+ *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
-+ */
-+size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize);
-+
-+/*! HUF_readStats() :
-+	Read compact Huffman tree, saved by HUF_writeCTable().
-+	`huffWeight` is destination buffer.
-+	@return : size read from `src` , or an error Code .
-+	Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
-+size_t HUF_readStats_wksp(BYTE *huffWeight, size_t hwSize, U32 *rankStats, U32 *nbSymbolsPtr, U32 *tableLogPtr, const void *src, size_t srcSize,
-+			  void *workspace, size_t workspaceSize);
-+
-+/** HUF_readCTable() :
-+*   Loading a CTable saved with HUF_writeCTable() */
-+size_t HUF_readCTable_wksp(HUF_CElt *CTable, unsigned maxSymbolValue, const void *src, size_t srcSize, void *workspace, size_t workspaceSize);
-+
-+/*
-+HUF_decompress() does the following:
-+1. select the decompression algorithm (X2, X4) based on pre-computed heuristics
-+2. build Huffman table from save, using HUF_readDTableXn()
-+3. decode 1 or 4 segments in parallel using HUF_decompressSXn_usingDTable
-+*/
-+
-+/** HUF_selectDecoder() :
-+*   Tells which decoder is likely to decode faster,
-+*   based on a set of pre-determined metrics.
-+*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
-+*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
-+U32 HUF_selectDecoder(size_t dstSize, size_t cSrcSize);
-+
-+size_t HUF_readDTableX2_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize);
-+size_t HUF_readDTableX4_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize);
-+
-+size_t HUF_decompress4X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-+size_t HUF_decompress4X2_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-+size_t HUF_decompress4X4_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-+
-+/* single stream variants */
-+
-+size_t HUF_compress1X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-+			   size_t wkspSize); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-+size_t HUF_compress1X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable);
-+/** HUF_compress1X_repeat() :
-+*   Same as HUF_compress1X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
-+*   If it uses hufTable it does not modify hufTable or repeat.
-+*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
-+*   If preferRepeat then the old table will always be used if valid. */
-+size_t HUF_compress1X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-+			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat,
-+			     int preferRepeat); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-+
-+size_t HUF_decompress1X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize);
-+size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-+				   size_t workspaceSize); /**< single-symbol decoder */
-+size_t HUF_decompress1X4_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-+				   size_t workspaceSize); /**< double-symbols decoder */
-+
-+size_t HUF_decompress1X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize,
-+				    const HUF_DTable *DTable); /**< automatic selection of sing or double symbol decoder, based on DTable */
-+size_t HUF_decompress1X2_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-+size_t HUF_decompress1X4_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-+
-+#endif /* HUF_H_298734234 */
-diff --git a/lib/zstd/huf_compress.c b/lib/zstd/huf_compress.c
-new file mode 100644
-index 0000000..40055a7
---- /dev/null
-+++ b/lib/zstd/huf_compress.c
-@@ -0,0 +1,770 @@
-+/*
-+ * Huffman encoder, part of New Generation Entropy library
-+ * Copyright (C) 2013-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+
-+/* **************************************************************
-+*  Includes
-+****************************************************************/
-+#include "bitstream.h"
-+#include "fse.h" /* header compression */
-+#include "huf.h"
-+#include 
-+#include  /* memcpy, memset */
-+
-+/* **************************************************************
-+*  Error Management
-+****************************************************************/
-+#define HUF_STATIC_ASSERT(c)                                   \
-+	{                                                      \
-+		enum { HUF_static_assert = 1 / (int)(!!(c)) }; \
-+	} /* use only *after* variable declarations */
-+#define CHECK_V_F(e, f)     \
-+	size_t const e = f; \
-+	if (ERR_isError(e)) \
-+	return f
-+#define CHECK_F(f)                        \
-+	{                                 \
-+		CHECK_V_F(_var_err__, f); \
-+	}
-+
-+/* **************************************************************
-+*  Utils
-+****************************************************************/
-+unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
-+{
-+	return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
-+}
-+
-+/* *******************************************************
-+*  HUF : Huffman block compression
-+*********************************************************/
-+/* HUF_compressWeights() :
-+ * Same as FSE_compress(), but dedicated to huff0's weights compression.
-+ * The use case needs much less stack memory.
-+ * Note : all elements within weightTable are supposed to be <= HUF_TABLELOG_MAX.
-+ */
-+#define MAX_FSE_TABLELOG_FOR_HUFF_HEADER 6
-+size_t HUF_compressWeights_wksp(void *dst, size_t dstSize, const void *weightTable, size_t wtSize, void *workspace, size_t workspaceSize)
-+{
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *op = ostart;
-+	BYTE *const oend = ostart + dstSize;
-+
-+	U32 maxSymbolValue = HUF_TABLELOG_MAX;
-+	U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
-+
-+	FSE_CTable *CTable;
-+	U32 *count;
-+	S16 *norm;
-+	size_t spaceUsed32 = 0;
-+
-+	HUF_STATIC_ASSERT(sizeof(FSE_CTable) == sizeof(U32));
-+
-+	CTable = (FSE_CTable *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX);
-+	count = (U32 *)workspace + spaceUsed32;
-+	spaceUsed32 += HUF_TABLELOG_MAX + 1;
-+	norm = (S16 *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(sizeof(S16) * (HUF_TABLELOG_MAX + 1), sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	/* init conditions */
-+	if (wtSize <= 1)
-+		return 0; /* Not compressible */
-+
-+	/* Scan input and build symbol stats */
-+	{
-+		CHECK_V_F(maxCount, FSE_count_simple(count, &maxSymbolValue, weightTable, wtSize));
-+		if (maxCount == wtSize)
-+			return 1; /* only a single symbol in src : rle */
-+		if (maxCount == 1)
-+			return 0; /* each symbol present maximum once => not compressible */
-+	}
-+
-+	tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
-+	CHECK_F(FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue));
-+
-+	/* Write table description header */
-+	{
-+		CHECK_V_F(hSize, FSE_writeNCount(op, oend - op, norm, maxSymbolValue, tableLog));
-+		op += hSize;
-+	}
-+
-+	/* Compress */
-+	CHECK_F(FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, workspace, workspaceSize));
-+	{
-+		CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, weightTable, wtSize, CTable));
-+		if (cSize == 0)
-+			return 0; /* not enough space for compressed data */
-+		op += cSize;
-+	}
-+
-+	return op - ostart;
-+}
-+
-+struct HUF_CElt_s {
-+	U16 val;
-+	BYTE nbBits;
-+}; /* typedef'd to HUF_CElt within "huf.h" */
-+
-+/*! HUF_writeCTable_wksp() :
-+	`CTable` : Huffman tree to save, using huf representation.
-+	@return : size of saved CTable */
-+size_t HUF_writeCTable_wksp(void *dst, size_t maxDstSize, const HUF_CElt *CTable, U32 maxSymbolValue, U32 huffLog, void *workspace, size_t workspaceSize)
-+{
-+	BYTE *op = (BYTE *)dst;
-+	U32 n;
-+
-+	BYTE *bitsToWeight;
-+	BYTE *huffWeight;
-+	size_t spaceUsed32 = 0;
-+
-+	bitsToWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(HUF_TABLELOG_MAX + 1, sizeof(U32)) >> 2;
-+	huffWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX, sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	/* check conditions */
-+	if (maxSymbolValue > HUF_SYMBOLVALUE_MAX)
-+		return ERROR(maxSymbolValue_tooLarge);
-+
-+	/* convert to weight */
-+	bitsToWeight[0] = 0;
-+	for (n = 1; n < huffLog + 1; n++)
-+		bitsToWeight[n] = (BYTE)(huffLog + 1 - n);
-+	for (n = 0; n < maxSymbolValue; n++)
-+		huffWeight[n] = bitsToWeight[CTable[n].nbBits];
-+
-+	/* attempt weights compression by FSE */
-+	{
-+		CHECK_V_F(hSize, HUF_compressWeights_wksp(op + 1, maxDstSize - 1, huffWeight, maxSymbolValue, workspace, workspaceSize));
-+		if ((hSize > 1) & (hSize < maxSymbolValue / 2)) { /* FSE compressed */
-+			op[0] = (BYTE)hSize;
-+			return hSize + 1;
-+		}
-+	}
-+
-+	/* write raw values as 4-bits (max : 15) */
-+	if (maxSymbolValue > (256 - 128))
-+		return ERROR(GENERIC); /* should not happen : likely means source cannot be compressed */
-+	if (((maxSymbolValue + 1) / 2) + 1 > maxDstSize)
-+		return ERROR(dstSize_tooSmall); /* not enough space within dst buffer */
-+	op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue - 1));
-+	huffWeight[maxSymbolValue] = 0; /* to be sure it doesn't cause msan issue in final combination */
-+	for (n = 0; n < maxSymbolValue; n += 2)
-+		op[(n / 2) + 1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n + 1]);
-+	return ((maxSymbolValue + 1) / 2) + 1;
-+}
-+
-+size_t HUF_readCTable_wksp(HUF_CElt *CTable, U32 maxSymbolValue, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-+{
-+	U32 *rankVal;
-+	BYTE *huffWeight;
-+	U32 tableLog = 0;
-+	U32 nbSymbols = 0;
-+	size_t readSize;
-+	size_t spaceUsed32 = 0;
-+
-+	rankVal = (U32 *)workspace + spaceUsed32;
-+	spaceUsed32 += HUF_TABLELOG_ABSOLUTEMAX + 1;
-+	huffWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	/* get symbol weights */
-+	readSize = HUF_readStats_wksp(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize, workspace, workspaceSize);
-+	if (ERR_isError(readSize))
-+		return readSize;
-+
-+	/* check result */
-+	if (tableLog > HUF_TABLELOG_MAX)
-+		return ERROR(tableLog_tooLarge);
-+	if (nbSymbols > maxSymbolValue + 1)
-+		return ERROR(maxSymbolValue_tooSmall);
-+
-+	/* Prepare base value per rank */
-+	{
-+		U32 n, nextRankStart = 0;
-+		for (n = 1; n <= tableLog; n++) {
-+			U32 curr = nextRankStart;
-+			nextRankStart += (rankVal[n] << (n - 1));
-+			rankVal[n] = curr;
-+		}
-+	}
-+
-+	/* fill nbBits */
-+	{
-+		U32 n;
-+		for (n = 0; n < nbSymbols; n++) {
-+			const U32 w = huffWeight[n];
-+			CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
-+		}
-+	}
-+
-+	/* fill val */
-+	{
-+		U16 nbPerRank[HUF_TABLELOG_MAX + 2] = {0}; /* support w=0=>n=tableLog+1 */
-+		U16 valPerRank[HUF_TABLELOG_MAX + 2] = {0};
-+		{
-+			U32 n;
-+			for (n = 0; n < nbSymbols; n++)
-+				nbPerRank[CTable[n].nbBits]++;
-+		}
-+		/* determine stating value per rank */
-+		valPerRank[tableLog + 1] = 0; /* for w==0 */
-+		{
-+			U16 min = 0;
-+			U32 n;
-+			for (n = tableLog; n > 0; n--) { /* start at n=tablelog <-> w=1 */
-+				valPerRank[n] = min;     /* get starting value within each rank */
-+				min += nbPerRank[n];
-+				min >>= 1;
-+			}
-+		}
-+		/* assign value within rank, symbol order */
-+		{
-+			U32 n;
-+			for (n = 0; n <= maxSymbolValue; n++)
-+				CTable[n].val = valPerRank[CTable[n].nbBits]++;
-+		}
-+	}
-+
-+	return readSize;
-+}
-+
-+typedef struct nodeElt_s {
-+	U32 count;
-+	U16 parent;
-+	BYTE byte;
-+	BYTE nbBits;
-+} nodeElt;
-+
-+static U32 HUF_setMaxHeight(nodeElt *huffNode, U32 lastNonNull, U32 maxNbBits)
-+{
-+	const U32 largestBits = huffNode[lastNonNull].nbBits;
-+	if (largestBits <= maxNbBits)
-+		return largestBits; /* early exit : no elt > maxNbBits */
-+
-+	/* there are several too large elements (at least >= 2) */
-+	{
-+		int totalCost = 0;
-+		const U32 baseCost = 1 << (largestBits - maxNbBits);
-+		U32 n = lastNonNull;
-+
-+		while (huffNode[n].nbBits > maxNbBits) {
-+			totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
-+			huffNode[n].nbBits = (BYTE)maxNbBits;
-+			n--;
-+		} /* n stops at huffNode[n].nbBits <= maxNbBits */
-+		while (huffNode[n].nbBits == maxNbBits)
-+			n--; /* n end at index of smallest symbol using < maxNbBits */
-+
-+		/* renorm totalCost */
-+		totalCost >>= (largestBits - maxNbBits); /* note : totalCost is necessarily a multiple of baseCost */
-+
-+		/* repay normalized cost */
-+		{
-+			U32 const noSymbol = 0xF0F0F0F0;
-+			U32 rankLast[HUF_TABLELOG_MAX + 2];
-+			int pos;
-+
-+			/* Get pos of last (smallest) symbol per rank */
-+			memset(rankLast, 0xF0, sizeof(rankLast));
-+			{
-+				U32 currNbBits = maxNbBits;
-+				for (pos = n; pos >= 0; pos--) {
-+					if (huffNode[pos].nbBits >= currNbBits)
-+						continue;
-+					currNbBits = huffNode[pos].nbBits; /* < maxNbBits */
-+					rankLast[maxNbBits - currNbBits] = pos;
-+				}
-+			}
-+
-+			while (totalCost > 0) {
-+				U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
-+				for (; nBitsToDecrease > 1; nBitsToDecrease--) {
-+					U32 highPos = rankLast[nBitsToDecrease];
-+					U32 lowPos = rankLast[nBitsToDecrease - 1];
-+					if (highPos == noSymbol)
-+						continue;
-+					if (lowPos == noSymbol)
-+						break;
-+					{
-+						U32 const highTotal = huffNode[highPos].count;
-+						U32 const lowTotal = 2 * huffNode[lowPos].count;
-+						if (highTotal <= lowTotal)
-+							break;
-+					}
-+				}
-+				/* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
-+				/* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
-+				while ((nBitsToDecrease <= HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))
-+					nBitsToDecrease++;
-+				totalCost -= 1 << (nBitsToDecrease - 1);
-+				if (rankLast[nBitsToDecrease - 1] == noSymbol)
-+					rankLast[nBitsToDecrease - 1] = rankLast[nBitsToDecrease]; /* this rank is no longer empty */
-+				huffNode[rankLast[nBitsToDecrease]].nbBits++;
-+				if (rankLast[nBitsToDecrease] == 0) /* special case, reached largest symbol */
-+					rankLast[nBitsToDecrease] = noSymbol;
-+				else {
-+					rankLast[nBitsToDecrease]--;
-+					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
-+						rankLast[nBitsToDecrease] = noSymbol; /* this rank is now empty */
-+				}
-+			} /* while (totalCost > 0) */
-+
-+			while (totalCost < 0) {		       /* Sometimes, cost correction overshoot */
-+				if (rankLast[1] == noSymbol) { /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0
-+								  (using maxNbBits) */
-+					while (huffNode[n].nbBits == maxNbBits)
-+						n--;
-+					huffNode[n + 1].nbBits--;
-+					rankLast[1] = n + 1;
-+					totalCost++;
-+					continue;
-+				}
-+				huffNode[rankLast[1] + 1].nbBits--;
-+				rankLast[1]++;
-+				totalCost++;
-+			}
-+		}
-+	} /* there are several too large elements (at least >= 2) */
-+
-+	return maxNbBits;
-+}
-+
-+typedef struct {
-+	U32 base;
-+	U32 curr;
-+} rankPos;
-+
-+static void HUF_sort(nodeElt *huffNode, const U32 *count, U32 maxSymbolValue)
-+{
-+	rankPos rank[32];
-+	U32 n;
-+
-+	memset(rank, 0, sizeof(rank));
-+	for (n = 0; n <= maxSymbolValue; n++) {
-+		U32 r = BIT_highbit32(count[n] + 1);
-+		rank[r].base++;
-+	}
-+	for (n = 30; n > 0; n--)
-+		rank[n - 1].base += rank[n].base;
-+	for (n = 0; n < 32; n++)
-+		rank[n].curr = rank[n].base;
-+	for (n = 0; n <= maxSymbolValue; n++) {
-+		U32 const c = count[n];
-+		U32 const r = BIT_highbit32(c + 1) + 1;
-+		U32 pos = rank[r].curr++;
-+		while ((pos > rank[r].base) && (c > huffNode[pos - 1].count))
-+			huffNode[pos] = huffNode[pos - 1], pos--;
-+		huffNode[pos].count = c;
-+		huffNode[pos].byte = (BYTE)n;
-+	}
-+}
-+
-+/** HUF_buildCTable_wksp() :
-+ *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
-+ *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
-+ */
-+#define STARTNODE (HUF_SYMBOLVALUE_MAX + 1)
-+typedef nodeElt huffNodeTable[2 * HUF_SYMBOLVALUE_MAX + 1 + 1];
-+size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize)
-+{
-+	nodeElt *const huffNode0 = (nodeElt *)workSpace;
-+	nodeElt *const huffNode = huffNode0 + 1;
-+	U32 n, nonNullRank;
-+	int lowS, lowN;
-+	U16 nodeNb = STARTNODE;
-+	U32 nodeRoot;
-+
-+	/* safety checks */
-+	if (wkspSize < sizeof(huffNodeTable))
-+		return ERROR(GENERIC); /* workSpace is not large enough */
-+	if (maxNbBits == 0)
-+		maxNbBits = HUF_TABLELOG_DEFAULT;
-+	if (maxSymbolValue > HUF_SYMBOLVALUE_MAX)
-+		return ERROR(GENERIC);
-+	memset(huffNode0, 0, sizeof(huffNodeTable));
-+
-+	/* sort, decreasing order */
-+	HUF_sort(huffNode, count, maxSymbolValue);
-+
-+	/* init for parents */
-+	nonNullRank = maxSymbolValue;
-+	while (huffNode[nonNullRank].count == 0)
-+		nonNullRank--;
-+	lowS = nonNullRank;
-+	nodeRoot = nodeNb + lowS - 1;
-+	lowN = nodeNb;
-+	huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS - 1].count;
-+	huffNode[lowS].parent = huffNode[lowS - 1].parent = nodeNb;
-+	nodeNb++;
-+	lowS -= 2;
-+	for (n = nodeNb; n <= nodeRoot; n++)
-+		huffNode[n].count = (U32)(1U << 30);
-+	huffNode0[0].count = (U32)(1U << 31); /* fake entry, strong barrier */
-+
-+	/* create parents */
-+	while (nodeNb <= nodeRoot) {
-+		U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-+		U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-+		huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
-+		huffNode[n1].parent = huffNode[n2].parent = nodeNb;
-+		nodeNb++;
-+	}
-+
-+	/* distribute weights (unlimited tree height) */
-+	huffNode[nodeRoot].nbBits = 0;
-+	for (n = nodeRoot - 1; n >= STARTNODE; n--)
-+		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
-+	for (n = 0; n <= nonNullRank; n++)
-+		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
-+
-+	/* enforce maxTableLog */
-+	maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
-+
-+	/* fill result into tree (val, nbBits) */
-+	{
-+		U16 nbPerRank[HUF_TABLELOG_MAX + 1] = {0};
-+		U16 valPerRank[HUF_TABLELOG_MAX + 1] = {0};
-+		if (maxNbBits > HUF_TABLELOG_MAX)
-+			return ERROR(GENERIC); /* check fit into table */
-+		for (n = 0; n <= nonNullRank; n++)
-+			nbPerRank[huffNode[n].nbBits]++;
-+		/* determine stating value per rank */
-+		{
-+			U16 min = 0;
-+			for (n = maxNbBits; n > 0; n--) {
-+				valPerRank[n] = min; /* get starting value within each rank */
-+				min += nbPerRank[n];
-+				min >>= 1;
-+			}
-+		}
-+		for (n = 0; n <= maxSymbolValue; n++)
-+			tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */
-+		for (n = 0; n <= maxSymbolValue; n++)
-+			tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */
-+	}
-+
-+	return maxNbBits;
-+}
-+
-+static size_t HUF_estimateCompressedSize(HUF_CElt *CTable, const unsigned *count, unsigned maxSymbolValue)
-+{
-+	size_t nbBits = 0;
-+	int s;
-+	for (s = 0; s <= (int)maxSymbolValue; ++s) {
-+		nbBits += CTable[s].nbBits * count[s];
-+	}
-+	return nbBits >> 3;
-+}
-+
-+static int HUF_validateCTable(const HUF_CElt *CTable, const unsigned *count, unsigned maxSymbolValue)
-+{
-+	int bad = 0;
-+	int s;
-+	for (s = 0; s <= (int)maxSymbolValue; ++s) {
-+		bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
-+	}
-+	return !bad;
-+}
-+
-+static void HUF_encodeSymbol(BIT_CStream_t *bitCPtr, U32 symbol, const HUF_CElt *CTable)
-+{
-+	BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
-+}
-+
-+size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
-+
-+#define HUF_FLUSHBITS(s)  BIT_flushBits(s)
-+
-+#define HUF_FLUSHBITS_1(stream)                                            \
-+	if (sizeof((stream)->bitContainer) * 8 < HUF_TABLELOG_MAX * 2 + 7) \
-+	HUF_FLUSHBITS(stream)
-+
-+#define HUF_FLUSHBITS_2(stream)                                            \
-+	if (sizeof((stream)->bitContainer) * 8 < HUF_TABLELOG_MAX * 4 + 7) \
-+	HUF_FLUSHBITS(stream)
-+
-+size_t HUF_compress1X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable)
-+{
-+	const BYTE *ip = (const BYTE *)src;
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *const oend = ostart + dstSize;
-+	BYTE *op = ostart;
-+	size_t n;
-+	BIT_CStream_t bitC;
-+
-+	/* init */
-+	if (dstSize < 8)
-+		return 0; /* not enough space to compress */
-+	{
-+		size_t const initErr = BIT_initCStream(&bitC, op, oend - op);
-+		if (HUF_isError(initErr))
-+			return 0;
-+	}
-+
-+	n = srcSize & ~3; /* join to mod 4 */
-+	switch (srcSize & 3) {
-+	case 3: HUF_encodeSymbol(&bitC, ip[n + 2], CTable); HUF_FLUSHBITS_2(&bitC);
-+	case 2: HUF_encodeSymbol(&bitC, ip[n + 1], CTable); HUF_FLUSHBITS_1(&bitC);
-+	case 1: HUF_encodeSymbol(&bitC, ip[n + 0], CTable); HUF_FLUSHBITS(&bitC);
-+	case 0:
-+	default:;
-+	}
-+
-+	for (; n > 0; n -= 4) { /* note : n&3==0 at this stage */
-+		HUF_encodeSymbol(&bitC, ip[n - 1], CTable);
-+		HUF_FLUSHBITS_1(&bitC);
-+		HUF_encodeSymbol(&bitC, ip[n - 2], CTable);
-+		HUF_FLUSHBITS_2(&bitC);
-+		HUF_encodeSymbol(&bitC, ip[n - 3], CTable);
-+		HUF_FLUSHBITS_1(&bitC);
-+		HUF_encodeSymbol(&bitC, ip[n - 4], CTable);
-+		HUF_FLUSHBITS(&bitC);
-+	}
-+
-+	return BIT_closeCStream(&bitC);
-+}
-+
-+size_t HUF_compress4X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable)
-+{
-+	size_t const segmentSize = (srcSize + 3) / 4; /* first 3 segments */
-+	const BYTE *ip = (const BYTE *)src;
-+	const BYTE *const iend = ip + srcSize;
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *const oend = ostart + dstSize;
-+	BYTE *op = ostart;
-+
-+	if (dstSize < 6 + 1 + 1 + 1 + 8)
-+		return 0; /* minimum space to compress successfully */
-+	if (srcSize < 12)
-+		return 0; /* no saving possible : too small input */
-+	op += 6;	  /* jumpTable */
-+
-+	{
-+		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, segmentSize, CTable));
-+		if (cSize == 0)
-+			return 0;
-+		ZSTD_writeLE16(ostart, (U16)cSize);
-+		op += cSize;
-+	}
-+
-+	ip += segmentSize;
-+	{
-+		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, segmentSize, CTable));
-+		if (cSize == 0)
-+			return 0;
-+		ZSTD_writeLE16(ostart + 2, (U16)cSize);
-+		op += cSize;
-+	}
-+
-+	ip += segmentSize;
-+	{
-+		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, segmentSize, CTable));
-+		if (cSize == 0)
-+			return 0;
-+		ZSTD_writeLE16(ostart + 4, (U16)cSize);
-+		op += cSize;
-+	}
-+
-+	ip += segmentSize;
-+	{
-+		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, iend - ip, CTable));
-+		if (cSize == 0)
-+			return 0;
-+		op += cSize;
-+	}
-+
-+	return op - ostart;
-+}
-+
-+static size_t HUF_compressCTable_internal(BYTE *const ostart, BYTE *op, BYTE *const oend, const void *src, size_t srcSize, unsigned singleStream,
-+					  const HUF_CElt *CTable)
-+{
-+	size_t const cSize =
-+	    singleStream ? HUF_compress1X_usingCTable(op, oend - op, src, srcSize, CTable) : HUF_compress4X_usingCTable(op, oend - op, src, srcSize, CTable);
-+	if (HUF_isError(cSize)) {
-+		return cSize;
-+	}
-+	if (cSize == 0) {
-+		return 0;
-+	} /* uncompressible */
-+	op += cSize;
-+	/* check compressibility */
-+	if ((size_t)(op - ostart) >= srcSize - 1) {
-+		return 0;
-+	}
-+	return op - ostart;
-+}
-+
-+/* `workSpace` must a table of at least 1024 unsigned */
-+static size_t HUF_compress_internal(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog,
-+				    unsigned singleStream, void *workSpace, size_t wkspSize, HUF_CElt *oldHufTable, HUF_repeat *repeat, int preferRepeat)
-+{
-+	BYTE *const ostart = (BYTE *)dst;
-+	BYTE *const oend = ostart + dstSize;
-+	BYTE *op = ostart;
-+
-+	U32 *count;
-+	size_t const countSize = sizeof(U32) * (HUF_SYMBOLVALUE_MAX + 1);
-+	HUF_CElt *CTable;
-+	size_t const CTableSize = sizeof(HUF_CElt) * (HUF_SYMBOLVALUE_MAX + 1);
-+
-+	/* checks & inits */
-+	if (wkspSize < sizeof(huffNodeTable) + countSize + CTableSize)
-+		return ERROR(GENERIC);
-+	if (!srcSize)
-+		return 0; /* Uncompressed (note : 1 means rle, so first byte must be correct) */
-+	if (!dstSize)
-+		return 0; /* cannot fit within dst budget */
-+	if (srcSize > HUF_BLOCKSIZE_MAX)
-+		return ERROR(srcSize_wrong); /* curr block size limit */
-+	if (huffLog > HUF_TABLELOG_MAX)
-+		return ERROR(tableLog_tooLarge);
-+	if (!maxSymbolValue)
-+		maxSymbolValue = HUF_SYMBOLVALUE_MAX;
-+	if (!huffLog)
-+		huffLog = HUF_TABLELOG_DEFAULT;
-+
-+	count = (U32 *)workSpace;
-+	workSpace = (BYTE *)workSpace + countSize;
-+	wkspSize -= countSize;
-+	CTable = (HUF_CElt *)workSpace;
-+	workSpace = (BYTE *)workSpace + CTableSize;
-+	wkspSize -= CTableSize;
-+
-+	/* Heuristic : If we don't need to check the validity of the old table use the old table for small inputs */
-+	if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
-+		return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-+	}
-+
-+	/* Scan input and build symbol stats */
-+	{
-+		CHECK_V_F(largest, FSE_count_wksp(count, &maxSymbolValue, (const BYTE *)src, srcSize, (U32 *)workSpace));
-+		if (largest == srcSize) {
-+			*ostart = ((const BYTE *)src)[0];
-+			return 1;
-+		} /* single symbol, rle */
-+		if (largest <= (srcSize >> 7) + 1)
-+			return 0; /* Fast heuristic : not compressible enough */
-+	}
-+
-+	/* Check validity of previous table */
-+	if (repeat && *repeat == HUF_repeat_check && !HUF_validateCTable(oldHufTable, count, maxSymbolValue)) {
-+		*repeat = HUF_repeat_none;
-+	}
-+	/* Heuristic : use existing table for small inputs */
-+	if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
-+		return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-+	}
-+
-+	/* Build Huffman Tree */
-+	huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
-+	{
-+		CHECK_V_F(maxBits, HUF_buildCTable_wksp(CTable, count, maxSymbolValue, huffLog, workSpace, wkspSize));
-+		huffLog = (U32)maxBits;
-+		/* Zero the unused symbols so we can check it for validity */
-+		memset(CTable + maxSymbolValue + 1, 0, CTableSize - (maxSymbolValue + 1) * sizeof(HUF_CElt));
-+	}
-+
-+	/* Write table description header */
-+	{
-+		CHECK_V_F(hSize, HUF_writeCTable_wksp(op, dstSize, CTable, maxSymbolValue, huffLog, workSpace, wkspSize));
-+		/* Check if using the previous table will be beneficial */
-+		if (repeat && *repeat != HUF_repeat_none) {
-+			size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, count, maxSymbolValue);
-+			size_t const newSize = HUF_estimateCompressedSize(CTable, count, maxSymbolValue);
-+			if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
-+				return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-+			}
-+		}
-+		/* Use the new table */
-+		if (hSize + 12ul >= srcSize) {
-+			return 0;
-+		}
-+		op += hSize;
-+		if (repeat) {
-+			*repeat = HUF_repeat_none;
-+		}
-+		if (oldHufTable) {
-+			memcpy(oldHufTable, CTable, CTableSize);
-+		} /* Save the new table */
-+	}
-+	return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, CTable);
-+}
-+
-+size_t HUF_compress1X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-+			   size_t wkspSize)
-+{
-+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, NULL, NULL, 0);
-+}
-+
-+size_t HUF_compress1X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-+			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat, int preferRepeat)
-+{
-+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat,
-+				     preferRepeat);
-+}
-+
-+size_t HUF_compress4X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-+			   size_t wkspSize)
-+{
-+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, NULL, NULL, 0);
-+}
-+
-+size_t HUF_compress4X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-+			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat, int preferRepeat)
-+{
-+	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat,
-+				     preferRepeat);
-+}
-diff --git a/lib/zstd/huf_decompress.c b/lib/zstd/huf_decompress.c
-new file mode 100644
-index 0000000..6526482
---- /dev/null
-+++ b/lib/zstd/huf_decompress.c
-@@ -0,0 +1,960 @@
-+/*
-+ * Huffman decoder, part of New Generation Entropy library
-+ * Copyright (C) 2013-2016, Yann Collet.
-+ *
-+ * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-+ *
-+ * Redistribution and use in source and binary forms, with or without
-+ * modification, are permitted provided that the following conditions are
-+ * met:
-+ *
-+ *   * Redistributions of source code must retain the above copyright
-+ * notice, this list of conditions and the following disclaimer.
-+ *   * Redistributions in binary form must reproduce the above
-+ * copyright notice, this list of conditions and the following disclaimer
-+ * in the documentation and/or other materials provided with the
-+ * distribution.
-+ *
-+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ *
-+ * You can contact the author at :
-+ * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-+ */
-+
-+/* **************************************************************
-+*  Compiler specifics
-+****************************************************************/
-+#define FORCE_INLINE static __always_inline
-+
-+/* **************************************************************
-+*  Dependencies
-+****************************************************************/
-+#include "bitstream.h" /* BIT_* */
-+#include "fse.h"       /* header compression */
-+#include "huf.h"
-+#include 
-+#include 
-+#include  /* memcpy, memset */
-+
-+/* **************************************************************
-+*  Error Management
-+****************************************************************/
-+#define HUF_STATIC_ASSERT(c)                                   \
-+	{                                                      \
-+		enum { HUF_static_assert = 1 / (int)(!!(c)) }; \
-+	} /* use only *after* variable declarations */
-+
-+/*-***************************/
-+/*  generic DTableDesc       */
-+/*-***************************/
-+
-+typedef struct {
-+	BYTE maxTableLog;
-+	BYTE tableType;
-+	BYTE tableLog;
-+	BYTE reserved;
-+} DTableDesc;
-+
-+static DTableDesc HUF_getDTableDesc(const HUF_DTable *table)
-+{
-+	DTableDesc dtd;
-+	memcpy(&dtd, table, sizeof(dtd));
-+	return dtd;
-+}
-+
-+/*-***************************/
-+/*  single-symbol decoding   */
-+/*-***************************/
-+
-+typedef struct {
-+	BYTE byte;
-+	BYTE nbBits;
-+} HUF_DEltX2; /* single-symbol decoding */
-+
-+size_t HUF_readDTableX2_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-+{
-+	U32 tableLog = 0;
-+	U32 nbSymbols = 0;
-+	size_t iSize;
-+	void *const dtPtr = DTable + 1;
-+	HUF_DEltX2 *const dt = (HUF_DEltX2 *)dtPtr;
-+
-+	U32 *rankVal;
-+	BYTE *huffWeight;
-+	size_t spaceUsed32 = 0;
-+
-+	rankVal = (U32 *)workspace + spaceUsed32;
-+	spaceUsed32 += HUF_TABLELOG_ABSOLUTEMAX + 1;
-+	huffWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	HUF_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
-+	/* memset(huffWeight, 0, sizeof(huffWeight)); */ /* is not necessary, even though some analyzer complain ... */
-+
-+	iSize = HUF_readStats_wksp(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize, workspace, workspaceSize);
-+	if (HUF_isError(iSize))
-+		return iSize;
-+
-+	/* Table header */
-+	{
-+		DTableDesc dtd = HUF_getDTableDesc(DTable);
-+		if (tableLog > (U32)(dtd.maxTableLog + 1))
-+			return ERROR(tableLog_tooLarge); /* DTable too small, Huffman tree cannot fit in */
-+		dtd.tableType = 0;
-+		dtd.tableLog = (BYTE)tableLog;
-+		memcpy(DTable, &dtd, sizeof(dtd));
-+	}
-+
-+	/* Calculate starting value for each rank */
-+	{
-+		U32 n, nextRankStart = 0;
-+		for (n = 1; n < tableLog + 1; n++) {
-+			U32 const curr = nextRankStart;
-+			nextRankStart += (rankVal[n] << (n - 1));
-+			rankVal[n] = curr;
-+		}
-+	}
-+
-+	/* fill DTable */
-+	{
-+		U32 n;
-+		for (n = 0; n < nbSymbols; n++) {
-+			U32 const w = huffWeight[n];
-+			U32 const length = (1 << w) >> 1;
-+			U32 u;
-+			HUF_DEltX2 D;
-+			D.byte = (BYTE)n;
-+			D.nbBits = (BYTE)(tableLog + 1 - w);
-+			for (u = rankVal[w]; u < rankVal[w] + length; u++)
-+				dt[u] = D;
-+			rankVal[w] += length;
-+		}
-+	}
-+
-+	return iSize;
-+}
-+
-+static BYTE HUF_decodeSymbolX2(BIT_DStream_t *Dstream, const HUF_DEltX2 *dt, const U32 dtLog)
-+{
-+	size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
-+	BYTE const c = dt[val].byte;
-+	BIT_skipBits(Dstream, dt[val].nbBits);
-+	return c;
-+}
-+
-+#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
-+
-+#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr)         \
-+	if (ZSTD_64bits() || (HUF_TABLELOG_MAX <= 12)) \
-+	HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-+
-+#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
-+	if (ZSTD_64bits())                     \
-+	HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-+
-+FORCE_INLINE size_t HUF_decodeStreamX2(BYTE *p, BIT_DStream_t *const bitDPtr, BYTE *const pEnd, const HUF_DEltX2 *const dt, const U32 dtLog)
-+{
-+	BYTE *const pStart = p;
-+
-+	/* up to 4 symbols at a time */
-+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd - 4)) {
-+		HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-+		HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
-+		HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-+		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-+	}
-+
-+	/* closer to the end */
-+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
-+		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-+
-+	/* no more data to retrieve from bitstream, hence no need to reload */
-+	while (p < pEnd)
-+		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-+
-+	return pEnd - pStart;
-+}
-+
-+static size_t HUF_decompress1X2_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	BYTE *op = (BYTE *)dst;
-+	BYTE *const oend = op + dstSize;
-+	const void *dtPtr = DTable + 1;
-+	const HUF_DEltX2 *const dt = (const HUF_DEltX2 *)dtPtr;
-+	BIT_DStream_t bitD;
-+	DTableDesc const dtd = HUF_getDTableDesc(DTable);
-+	U32 const dtLog = dtd.tableLog;
-+
-+	{
-+		size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-+		if (HUF_isError(errorCode))
-+			return errorCode;
-+	}
-+
-+	HUF_decodeStreamX2(op, &bitD, oend, dt, dtLog);
-+
-+	/* check */
-+	if (!BIT_endOfDStream(&bitD))
-+		return ERROR(corruption_detected);
-+
-+	return dstSize;
-+}
-+
-+size_t HUF_decompress1X2_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	DTableDesc dtd = HUF_getDTableDesc(DTable);
-+	if (dtd.tableType != 0)
-+		return ERROR(GENERIC);
-+	return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-+}
-+
-+size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable *DCtx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	const BYTE *ip = (const BYTE *)cSrc;
-+
-+	size_t const hSize = HUF_readDTableX2_wksp(DCtx, cSrc, cSrcSize, workspace, workspaceSize);
-+	if (HUF_isError(hSize))
-+		return hSize;
-+	if (hSize >= cSrcSize)
-+		return ERROR(srcSize_wrong);
-+	ip += hSize;
-+	cSrcSize -= hSize;
-+
-+	return HUF_decompress1X2_usingDTable_internal(dst, dstSize, ip, cSrcSize, DCtx);
-+}
-+
-+static size_t HUF_decompress4X2_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	/* Check */
-+	if (cSrcSize < 10)
-+		return ERROR(corruption_detected); /* strict minimum : jump table + 1 byte per stream */
-+
-+	{
-+		const BYTE *const istart = (const BYTE *)cSrc;
-+		BYTE *const ostart = (BYTE *)dst;
-+		BYTE *const oend = ostart + dstSize;
-+		const void *const dtPtr = DTable + 1;
-+		const HUF_DEltX2 *const dt = (const HUF_DEltX2 *)dtPtr;
-+
-+		/* Init */
-+		BIT_DStream_t bitD1;
-+		BIT_DStream_t bitD2;
-+		BIT_DStream_t bitD3;
-+		BIT_DStream_t bitD4;
-+		size_t const length1 = ZSTD_readLE16(istart);
-+		size_t const length2 = ZSTD_readLE16(istart + 2);
-+		size_t const length3 = ZSTD_readLE16(istart + 4);
-+		size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-+		const BYTE *const istart1 = istart + 6; /* jumpTable */
-+		const BYTE *const istart2 = istart1 + length1;
-+		const BYTE *const istart3 = istart2 + length2;
-+		const BYTE *const istart4 = istart3 + length3;
-+		const size_t segmentSize = (dstSize + 3) / 4;
-+		BYTE *const opStart2 = ostart + segmentSize;
-+		BYTE *const opStart3 = opStart2 + segmentSize;
-+		BYTE *const opStart4 = opStart3 + segmentSize;
-+		BYTE *op1 = ostart;
-+		BYTE *op2 = opStart2;
-+		BYTE *op3 = opStart3;
-+		BYTE *op4 = opStart4;
-+		U32 endSignal;
-+		DTableDesc const dtd = HUF_getDTableDesc(DTable);
-+		U32 const dtLog = dtd.tableLog;
-+
-+		if (length4 > cSrcSize)
-+			return ERROR(corruption_detected); /* overflow */
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+
-+		/* 16-32 symbols per loop (4-8 symbols per stream) */
-+		endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-+		for (; (endSignal == BIT_DStream_unfinished) && (op4 < (oend - 7));) {
-+			HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-+			HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
-+			HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-+			HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
-+			endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-+		}
-+
-+		/* check corruption */
-+		if (op1 > opStart2)
-+			return ERROR(corruption_detected);
-+		if (op2 > opStart3)
-+			return ERROR(corruption_detected);
-+		if (op3 > opStart4)
-+			return ERROR(corruption_detected);
-+		/* note : op4 supposed already verified within main loop */
-+
-+		/* finish bitStreams one by one */
-+		HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
-+		HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
-+		HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
-+		HUF_decodeStreamX2(op4, &bitD4, oend, dt, dtLog);
-+
-+		/* check */
-+		endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-+		if (!endSignal)
-+			return ERROR(corruption_detected);
-+
-+		/* decoded size */
-+		return dstSize;
-+	}
-+}
-+
-+size_t HUF_decompress4X2_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	DTableDesc dtd = HUF_getDTableDesc(DTable);
-+	if (dtd.tableType != 0)
-+		return ERROR(GENERIC);
-+	return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-+}
-+
-+size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	const BYTE *ip = (const BYTE *)cSrc;
-+
-+	size_t const hSize = HUF_readDTableX2_wksp(dctx, cSrc, cSrcSize, workspace, workspaceSize);
-+	if (HUF_isError(hSize))
-+		return hSize;
-+	if (hSize >= cSrcSize)
-+		return ERROR(srcSize_wrong);
-+	ip += hSize;
-+	cSrcSize -= hSize;
-+
-+	return HUF_decompress4X2_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
-+}
-+
-+/* *************************/
-+/* double-symbols decoding */
-+/* *************************/
-+typedef struct {
-+	U16 sequence;
-+	BYTE nbBits;
-+	BYTE length;
-+} HUF_DEltX4; /* double-symbols decoding */
-+
-+typedef struct {
-+	BYTE symbol;
-+	BYTE weight;
-+} sortedSymbol_t;
-+
-+/* HUF_fillDTableX4Level2() :
-+ * `rankValOrigin` must be a table of at least (HUF_TABLELOG_MAX + 1) U32 */
-+static void HUF_fillDTableX4Level2(HUF_DEltX4 *DTable, U32 sizeLog, const U32 consumed, const U32 *rankValOrigin, const int minWeight,
-+				   const sortedSymbol_t *sortedSymbols, const U32 sortedListSize, U32 nbBitsBaseline, U16 baseSeq)
-+{
-+	HUF_DEltX4 DElt;
-+	U32 rankVal[HUF_TABLELOG_MAX + 1];
-+
-+	/* get pre-calculated rankVal */
-+	memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-+
-+	/* fill skipped values */
-+	if (minWeight > 1) {
-+		U32 i, skipSize = rankVal[minWeight];
-+		ZSTD_writeLE16(&(DElt.sequence), baseSeq);
-+		DElt.nbBits = (BYTE)(consumed);
-+		DElt.length = 1;
-+		for (i = 0; i < skipSize; i++)
-+			DTable[i] = DElt;
-+	}
-+
-+	/* fill DTable */
-+	{
-+		U32 s;
-+		for (s = 0; s < sortedListSize; s++) { /* note : sortedSymbols already skipped */
-+			const U32 symbol = sortedSymbols[s].symbol;
-+			const U32 weight = sortedSymbols[s].weight;
-+			const U32 nbBits = nbBitsBaseline - weight;
-+			const U32 length = 1 << (sizeLog - nbBits);
-+			const U32 start = rankVal[weight];
-+			U32 i = start;
-+			const U32 end = start + length;
-+
-+			ZSTD_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8)));
-+			DElt.nbBits = (BYTE)(nbBits + consumed);
-+			DElt.length = 2;
-+			do {
-+				DTable[i++] = DElt;
-+			} while (i < end); /* since length >= 1 */
-+
-+			rankVal[weight] += length;
-+		}
-+	}
-+}
-+
-+typedef U32 rankVal_t[HUF_TABLELOG_MAX][HUF_TABLELOG_MAX + 1];
-+typedef U32 rankValCol_t[HUF_TABLELOG_MAX + 1];
-+
-+static void HUF_fillDTableX4(HUF_DEltX4 *DTable, const U32 targetLog, const sortedSymbol_t *sortedList, const U32 sortedListSize, const U32 *rankStart,
-+			     rankVal_t rankValOrigin, const U32 maxWeight, const U32 nbBitsBaseline)
-+{
-+	U32 rankVal[HUF_TABLELOG_MAX + 1];
-+	const int scaleLog = nbBitsBaseline - targetLog; /* note : targetLog >= srcLog, hence scaleLog <= 1 */
-+	const U32 minBits = nbBitsBaseline - maxWeight;
-+	U32 s;
-+
-+	memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-+
-+	/* fill DTable */
-+	for (s = 0; s < sortedListSize; s++) {
-+		const U16 symbol = sortedList[s].symbol;
-+		const U32 weight = sortedList[s].weight;
-+		const U32 nbBits = nbBitsBaseline - weight;
-+		const U32 start = rankVal[weight];
-+		const U32 length = 1 << (targetLog - nbBits);
-+
-+		if (targetLog - nbBits >= minBits) { /* enough room for a second symbol */
-+			U32 sortedRank;
-+			int minWeight = nbBits + scaleLog;
-+			if (minWeight < 1)
-+				minWeight = 1;
-+			sortedRank = rankStart[minWeight];
-+			HUF_fillDTableX4Level2(DTable + start, targetLog - nbBits, nbBits, rankValOrigin[nbBits], minWeight, sortedList + sortedRank,
-+					       sortedListSize - sortedRank, nbBitsBaseline, symbol);
-+		} else {
-+			HUF_DEltX4 DElt;
-+			ZSTD_writeLE16(&(DElt.sequence), symbol);
-+			DElt.nbBits = (BYTE)(nbBits);
-+			DElt.length = 1;
-+			{
-+				U32 const end = start + length;
-+				U32 u;
-+				for (u = start; u < end; u++)
-+					DTable[u] = DElt;
-+			}
-+		}
-+		rankVal[weight] += length;
-+	}
-+}
-+
-+size_t HUF_readDTableX4_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-+{
-+	U32 tableLog, maxW, sizeOfSort, nbSymbols;
-+	DTableDesc dtd = HUF_getDTableDesc(DTable);
-+	U32 const maxTableLog = dtd.maxTableLog;
-+	size_t iSize;
-+	void *dtPtr = DTable + 1; /* force compiler to avoid strict-aliasing */
-+	HUF_DEltX4 *const dt = (HUF_DEltX4 *)dtPtr;
-+	U32 *rankStart;
-+
-+	rankValCol_t *rankVal;
-+	U32 *rankStats;
-+	U32 *rankStart0;
-+	sortedSymbol_t *sortedSymbol;
-+	BYTE *weightList;
-+	size_t spaceUsed32 = 0;
-+
-+	HUF_STATIC_ASSERT((sizeof(rankValCol_t) & 3) == 0);
-+
-+	rankVal = (rankValCol_t *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += (sizeof(rankValCol_t) * HUF_TABLELOG_MAX) >> 2;
-+	rankStats = (U32 *)workspace + spaceUsed32;
-+	spaceUsed32 += HUF_TABLELOG_MAX + 1;
-+	rankStart0 = (U32 *)workspace + spaceUsed32;
-+	spaceUsed32 += HUF_TABLELOG_MAX + 2;
-+	sortedSymbol = (sortedSymbol_t *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(sizeof(sortedSymbol_t) * (HUF_SYMBOLVALUE_MAX + 1), sizeof(U32)) >> 2;
-+	weightList = (BYTE *)((U32 *)workspace + spaceUsed32);
-+	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-+
-+	if ((spaceUsed32 << 2) > workspaceSize)
-+		return ERROR(tableLog_tooLarge);
-+	workspace = (U32 *)workspace + spaceUsed32;
-+	workspaceSize -= (spaceUsed32 << 2);
-+
-+	rankStart = rankStart0 + 1;
-+	memset(rankStats, 0, sizeof(U32) * (2 * HUF_TABLELOG_MAX + 2 + 1));
-+
-+	HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(HUF_DTable)); /* if compiler fails here, assertion is wrong */
-+	if (maxTableLog > HUF_TABLELOG_MAX)
-+		return ERROR(tableLog_tooLarge);
-+	/* memset(weightList, 0, sizeof(weightList)); */ /* is not necessary, even though some analyzer complain ... */
-+
-+	iSize = HUF_readStats_wksp(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize, workspace, workspaceSize);
-+	if (HUF_isError(iSize))
-+		return iSize;
-+
-+	/* check result */
-+	if (tableLog > maxTableLog)
-+		return ERROR(tableLog_tooLarge); /* DTable can't fit code depth */
-+
-+	/* find maxWeight */
-+	for (maxW = tableLog; rankStats[maxW] == 0; maxW--) {
-+	} /* necessarily finds a solution before 0 */
-+
-+	/* Get start index of each weight */
-+	{
-+		U32 w, nextRankStart = 0;
-+		for (w = 1; w < maxW + 1; w++) {
-+			U32 curr = nextRankStart;
-+			nextRankStart += rankStats[w];
-+			rankStart[w] = curr;
-+		}
-+		rankStart[0] = nextRankStart; /* put all 0w symbols at the end of sorted list*/
-+		sizeOfSort = nextRankStart;
-+	}
-+
-+	/* sort symbols by weight */
-+	{
-+		U32 s;
-+		for (s = 0; s < nbSymbols; s++) {
-+			U32 const w = weightList[s];
-+			U32 const r = rankStart[w]++;
-+			sortedSymbol[r].symbol = (BYTE)s;
-+			sortedSymbol[r].weight = (BYTE)w;
-+		}
-+		rankStart[0] = 0; /* forget 0w symbols; this is beginning of weight(1) */
-+	}
-+
-+	/* Build rankVal */
-+	{
-+		U32 *const rankVal0 = rankVal[0];
-+		{
-+			int const rescale = (maxTableLog - tableLog) - 1; /* tableLog <= maxTableLog */
-+			U32 nextRankVal = 0;
-+			U32 w;
-+			for (w = 1; w < maxW + 1; w++) {
-+				U32 curr = nextRankVal;
-+				nextRankVal += rankStats[w] << (w + rescale);
-+				rankVal0[w] = curr;
-+			}
-+		}
-+		{
-+			U32 const minBits = tableLog + 1 - maxW;
-+			U32 consumed;
-+			for (consumed = minBits; consumed < maxTableLog - minBits + 1; consumed++) {
-+				U32 *const rankValPtr = rankVal[consumed];
-+				U32 w;
-+				for (w = 1; w < maxW + 1; w++) {
-+					rankValPtr[w] = rankVal0[w] >> consumed;
-+				}
-+			}
-+		}
-+	}
-+
-+	HUF_fillDTableX4(dt, maxTableLog, sortedSymbol, sizeOfSort, rankStart0, rankVal, maxW, tableLog + 1);
-+
-+	dtd.tableLog = (BYTE)maxTableLog;
-+	dtd.tableType = 1;
-+	memcpy(DTable, &dtd, sizeof(dtd));
-+	return iSize;
-+}
-+
-+static U32 HUF_decodeSymbolX4(void *op, BIT_DStream_t *DStream, const HUF_DEltX4 *dt, const U32 dtLog)
-+{
-+	size_t const val = BIT_lookBitsFast(DStream, dtLog); /* note : dtLog >= 1 */
-+	memcpy(op, dt + val, 2);
-+	BIT_skipBits(DStream, dt[val].nbBits);
-+	return dt[val].length;
-+}
-+
-+static U32 HUF_decodeLastSymbolX4(void *op, BIT_DStream_t *DStream, const HUF_DEltX4 *dt, const U32 dtLog)
-+{
-+	size_t const val = BIT_lookBitsFast(DStream, dtLog); /* note : dtLog >= 1 */
-+	memcpy(op, dt + val, 1);
-+	if (dt[val].length == 1)
-+		BIT_skipBits(DStream, dt[val].nbBits);
-+	else {
-+		if (DStream->bitsConsumed < (sizeof(DStream->bitContainer) * 8)) {
-+			BIT_skipBits(DStream, dt[val].nbBits);
-+			if (DStream->bitsConsumed > (sizeof(DStream->bitContainer) * 8))
-+				/* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
-+				DStream->bitsConsumed = (sizeof(DStream->bitContainer) * 8);
-+		}
-+	}
-+	return 1;
-+}
-+
-+#define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-+
-+#define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr)         \
-+	if (ZSTD_64bits() || (HUF_TABLELOG_MAX <= 12)) \
-+	ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-+
-+#define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \
-+	if (ZSTD_64bits())                     \
-+	ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-+
-+FORCE_INLINE size_t HUF_decodeStreamX4(BYTE *p, BIT_DStream_t *bitDPtr, BYTE *const pEnd, const HUF_DEltX4 *const dt, const U32 dtLog)
-+{
-+	BYTE *const pStart = p;
-+
-+	/* up to 8 symbols at a time */
-+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd - (sizeof(bitDPtr->bitContainer) - 1))) {
-+		HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-+		HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
-+		HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-+		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-+	}
-+
-+	/* closer to end : up to 2 symbols at a time */
-+	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd - 2))
-+		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-+
-+	while (p <= pEnd - 2)
-+		HUF_DECODE_SYMBOLX4_0(p, bitDPtr); /* no need to reload : reached the end of DStream */
-+
-+	if (p < pEnd)
-+		p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
-+
-+	return p - pStart;
-+}
-+
-+static size_t HUF_decompress1X4_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	BIT_DStream_t bitD;
-+
-+	/* Init */
-+	{
-+		size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-+		if (HUF_isError(errorCode))
-+			return errorCode;
-+	}
-+
-+	/* decode */
-+	{
-+		BYTE *const ostart = (BYTE *)dst;
-+		BYTE *const oend = ostart + dstSize;
-+		const void *const dtPtr = DTable + 1; /* force compiler to not use strict-aliasing */
-+		const HUF_DEltX4 *const dt = (const HUF_DEltX4 *)dtPtr;
-+		DTableDesc const dtd = HUF_getDTableDesc(DTable);
-+		HUF_decodeStreamX4(ostart, &bitD, oend, dt, dtd.tableLog);
-+	}
-+
-+	/* check */
-+	if (!BIT_endOfDStream(&bitD))
-+		return ERROR(corruption_detected);
-+
-+	/* decoded size */
-+	return dstSize;
-+}
-+
-+size_t HUF_decompress1X4_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	DTableDesc dtd = HUF_getDTableDesc(DTable);
-+	if (dtd.tableType != 1)
-+		return ERROR(GENERIC);
-+	return HUF_decompress1X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-+}
-+
-+size_t HUF_decompress1X4_DCtx_wksp(HUF_DTable *DCtx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	const BYTE *ip = (const BYTE *)cSrc;
-+
-+	size_t const hSize = HUF_readDTableX4_wksp(DCtx, cSrc, cSrcSize, workspace, workspaceSize);
-+	if (HUF_isError(hSize))
-+		return hSize;
-+	if (hSize >= cSrcSize)
-+		return ERROR(srcSize_wrong);
-+	ip += hSize;
-+	cSrcSize -= hSize;
-+
-+	return HUF_decompress1X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, DCtx);
-+}
-+
-+static size_t HUF_decompress4X4_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	if (cSrcSize < 10)
-+		return ERROR(corruption_detected); /* strict minimum : jump table + 1 byte per stream */
-+
-+	{
-+		const BYTE *const istart = (const BYTE *)cSrc;
-+		BYTE *const ostart = (BYTE *)dst;
-+		BYTE *const oend = ostart + dstSize;
-+		const void *const dtPtr = DTable + 1;
-+		const HUF_DEltX4 *const dt = (const HUF_DEltX4 *)dtPtr;
-+
-+		/* Init */
-+		BIT_DStream_t bitD1;
-+		BIT_DStream_t bitD2;
-+		BIT_DStream_t bitD3;
-+		BIT_DStream_t bitD4;
-+		size_t const length1 = ZSTD_readLE16(istart);
-+		size_t const length2 = ZSTD_readLE16(istart + 2);
-+		size_t const length3 = ZSTD_readLE16(istart + 4);
-+		size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-+		const BYTE *const istart1 = istart + 6; /* jumpTable */
-+		const BYTE *const istart2 = istart1 + length1;
-+		const BYTE *const istart3 = istart2 + length2;
-+		const BYTE *const istart4 = istart3 + length3;
-+		size_t const segmentSize = (dstSize + 3) / 4;
-+		BYTE *const opStart2 = ostart + segmentSize;
-+		BYTE *const opStart3 = opStart2 + segmentSize;
-+		BYTE *const opStart4 = opStart3 + segmentSize;
-+		BYTE *op1 = ostart;
-+		BYTE *op2 = opStart2;
-+		BYTE *op3 = opStart3;
-+		BYTE *op4 = opStart4;
-+		U32 endSignal;
-+		DTableDesc const dtd = HUF_getDTableDesc(DTable);
-+		U32 const dtLog = dtd.tableLog;
-+
-+		if (length4 > cSrcSize)
-+			return ERROR(corruption_detected); /* overflow */
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+		{
-+			size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-+			if (HUF_isError(errorCode))
-+				return errorCode;
-+		}
-+
-+		/* 16-32 symbols per loop (4-8 symbols per stream) */
-+		endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-+		for (; (endSignal == BIT_DStream_unfinished) & (op4 < (oend - (sizeof(bitD4.bitContainer) - 1)));) {
-+			HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-+			HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
-+			HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-+			HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
-+			HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
-+			HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
-+			HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
-+
-+			endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-+		}
-+
-+		/* check corruption */
-+		if (op1 > opStart2)
-+			return ERROR(corruption_detected);
-+		if (op2 > opStart3)
-+			return ERROR(corruption_detected);
-+		if (op3 > opStart4)
-+			return ERROR(corruption_detected);
-+		/* note : op4 already verified within main loop */
-+
-+		/* finish bitStreams one by one */
-+		HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
-+		HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
-+		HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
-+		HUF_decodeStreamX4(op4, &bitD4, oend, dt, dtLog);
-+
-+		/* check */
-+		{
-+			U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-+			if (!endCheck)
-+				return ERROR(corruption_detected);
-+		}
-+
-+		/* decoded size */
-+		return dstSize;
-+	}
-+}
-+
-+size_t HUF_decompress4X4_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	DTableDesc dtd = HUF_getDTableDesc(DTable);
-+	if (dtd.tableType != 1)
-+		return ERROR(GENERIC);
-+	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-+}
-+
-+size_t HUF_decompress4X4_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	const BYTE *ip = (const BYTE *)cSrc;
-+
-+	size_t hSize = HUF_readDTableX4_wksp(dctx, cSrc, cSrcSize, workspace, workspaceSize);
-+	if (HUF_isError(hSize))
-+		return hSize;
-+	if (hSize >= cSrcSize)
-+		return ERROR(srcSize_wrong);
-+	ip += hSize;
-+	cSrcSize -= hSize;
-+
-+	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
-+}
-+
-+/* ********************************/
-+/* Generic decompression selector */
-+/* ********************************/
-+
-+size_t HUF_decompress1X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	DTableDesc const dtd = HUF_getDTableDesc(DTable);
-+	return dtd.tableType ? HUF_decompress1X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable)
-+			     : HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
-+}
-+
-+size_t HUF_decompress4X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-+{
-+	DTableDesc const dtd = HUF_getDTableDesc(DTable);
-+	return dtd.tableType ? HUF_decompress4X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable)
-+			     : HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
-+}
-+
-+typedef struct {
-+	U32 tableTime;
-+	U32 decode256Time;
-+} algo_time_t;
-+static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, quad */] = {
-+    /* single, double, quad */
-+    {{0, 0}, {1, 1}, {2, 2}},		     /* Q==0 : impossible */
-+    {{0, 0}, {1, 1}, {2, 2}},		     /* Q==1 : impossible */
-+    {{38, 130}, {1313, 74}, {2151, 38}},     /* Q == 2 : 12-18% */
-+    {{448, 128}, {1353, 74}, {2238, 41}},    /* Q == 3 : 18-25% */
-+    {{556, 128}, {1353, 74}, {2238, 47}},    /* Q == 4 : 25-32% */
-+    {{714, 128}, {1418, 74}, {2436, 53}},    /* Q == 5 : 32-38% */
-+    {{883, 128}, {1437, 74}, {2464, 61}},    /* Q == 6 : 38-44% */
-+    {{897, 128}, {1515, 75}, {2622, 68}},    /* Q == 7 : 44-50% */
-+    {{926, 128}, {1613, 75}, {2730, 75}},    /* Q == 8 : 50-56% */
-+    {{947, 128}, {1729, 77}, {3359, 77}},    /* Q == 9 : 56-62% */
-+    {{1107, 128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
-+    {{1177, 128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
-+    {{1242, 128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
-+    {{1349, 128}, {2644, 106}, {5260, 106}}, /* Q ==13 : 81-87% */
-+    {{1455, 128}, {2422, 124}, {4174, 124}}, /* Q ==14 : 87-93% */
-+    {{722, 128}, {1891, 145}, {1936, 146}},  /* Q ==15 : 93-99% */
-+};
-+
-+/** HUF_selectDecoder() :
-+*   Tells which decoder is likely to decode faster,
-+*   based on a set of pre-determined metrics.
-+*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
-+*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
-+U32 HUF_selectDecoder(size_t dstSize, size_t cSrcSize)
-+{
-+	/* decoder timing evaluation */
-+	U32 const Q = (U32)(cSrcSize * 16 / dstSize); /* Q < 16 since dstSize > cSrcSize */
-+	U32 const D256 = (U32)(dstSize >> 8);
-+	U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
-+	U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
-+	DTime1 += DTime1 >> 3; /* advantage to algorithm using less memory, for cache eviction */
-+
-+	return DTime1 < DTime0;
-+}
-+
-+typedef size_t (*decompressionAlgo)(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize);
-+
-+size_t HUF_decompress4X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	/* validation checks */
-+	if (dstSize == 0)
-+		return ERROR(dstSize_tooSmall);
-+	if (cSrcSize > dstSize)
-+		return ERROR(corruption_detected); /* invalid */
-+	if (cSrcSize == dstSize) {
-+		memcpy(dst, cSrc, dstSize);
-+		return dstSize;
-+	} /* not compressed */
-+	if (cSrcSize == 1) {
-+		memset(dst, *(const BYTE *)cSrc, dstSize);
-+		return dstSize;
-+	} /* RLE */
-+
-+	{
-+		U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-+		return algoNb ? HUF_decompress4X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize)
-+			      : HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize);
-+	}
-+}
-+
-+size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	/* validation checks */
-+	if (dstSize == 0)
-+		return ERROR(dstSize_tooSmall);
-+	if ((cSrcSize >= dstSize) || (cSrcSize <= 1))
-+		return ERROR(corruption_detected); /* invalid */
-+
-+	{
-+		U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-+		return algoNb ? HUF_decompress4X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize)
-+			      : HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize);
-+	}
-+}
-+
-+size_t HUF_decompress1X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-+{
-+	/* validation checks */
-+	if (dstSize == 0)
-+		return ERROR(dstSize_tooSmall);
-+	if (cSrcSize > dstSize)
-+		return ERROR(corruption_detected); /* invalid */
-+	if (cSrcSize == dstSize) {
-+		memcpy(dst, cSrc, dstSize);
-+		return dstSize;
-+	} /* not compressed */
-+	if (cSrcSize == 1) {
-+		memset(dst, *(const BYTE *)cSrc, dstSize);
-+		return dstSize;
-+	} /* RLE */
-+
-+	{
-+		U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-+		return algoNb ? HUF_decompress1X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize)
-+			      : HUF_decompress1X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize);
-+	}
-+}
-diff --git a/lib/zstd/mem.h b/lib/zstd/mem.h
-new file mode 100644
-index 0000000..42a697b
---- /dev/null
-+++ b/lib/zstd/mem.h
-@@ -0,0 +1,149 @@
-+/**
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+#ifndef MEM_H_MODULE
-+#define MEM_H_MODULE
-+
-+/*-****************************************
-+*  Dependencies
-+******************************************/
-+#include 
-+#include  /* memcpy */
-+#include   /* size_t, ptrdiff_t */
-+
-+/*-****************************************
-+*  Compiler specifics
-+******************************************/
-+#define ZSTD_STATIC static __inline __attribute__((unused))
-+
-+/*-**************************************************************
-+*  Basic Types
-+*****************************************************************/
-+typedef uint8_t BYTE;
-+typedef uint16_t U16;
-+typedef int16_t S16;
-+typedef uint32_t U32;
-+typedef int32_t S32;
-+typedef uint64_t U64;
-+typedef int64_t S64;
-+typedef ptrdiff_t iPtrDiff;
-+typedef uintptr_t uPtrDiff;
-+
-+/*-**************************************************************
-+*  Memory I/O
-+*****************************************************************/
-+ZSTD_STATIC unsigned ZSTD_32bits(void) { return sizeof(size_t) == 4; }
-+ZSTD_STATIC unsigned ZSTD_64bits(void) { return sizeof(size_t) == 8; }
-+
-+#if defined(__LITTLE_ENDIAN)
-+#define ZSTD_LITTLE_ENDIAN 1
-+#else
-+#define ZSTD_LITTLE_ENDIAN 0
-+#endif
-+
-+ZSTD_STATIC unsigned ZSTD_isLittleEndian(void) { return ZSTD_LITTLE_ENDIAN; }
-+
-+ZSTD_STATIC U16 ZSTD_read16(const void *memPtr) { return get_unaligned((const U16 *)memPtr); }
-+
-+ZSTD_STATIC U32 ZSTD_read32(const void *memPtr) { return get_unaligned((const U32 *)memPtr); }
-+
-+ZSTD_STATIC U64 ZSTD_read64(const void *memPtr) { return get_unaligned((const U64 *)memPtr); }
-+
-+ZSTD_STATIC size_t ZSTD_readST(const void *memPtr) { return get_unaligned((const size_t *)memPtr); }
-+
-+ZSTD_STATIC void ZSTD_write16(void *memPtr, U16 value) { put_unaligned(value, (U16 *)memPtr); }
-+
-+ZSTD_STATIC void ZSTD_write32(void *memPtr, U32 value) { put_unaligned(value, (U32 *)memPtr); }
-+
-+ZSTD_STATIC void ZSTD_write64(void *memPtr, U64 value) { put_unaligned(value, (U64 *)memPtr); }
-+
-+/*=== Little endian r/w ===*/
-+
-+ZSTD_STATIC U16 ZSTD_readLE16(const void *memPtr) { return get_unaligned_le16(memPtr); }
-+
-+ZSTD_STATIC void ZSTD_writeLE16(void *memPtr, U16 val) { put_unaligned_le16(val, memPtr); }
-+
-+ZSTD_STATIC U32 ZSTD_readLE24(const void *memPtr) { return ZSTD_readLE16(memPtr) + (((const BYTE *)memPtr)[2] << 16); }
-+
-+ZSTD_STATIC void ZSTD_writeLE24(void *memPtr, U32 val)
-+{
-+	ZSTD_writeLE16(memPtr, (U16)val);
-+	((BYTE *)memPtr)[2] = (BYTE)(val >> 16);
-+}
-+
-+ZSTD_STATIC U32 ZSTD_readLE32(const void *memPtr) { return get_unaligned_le32(memPtr); }
-+
-+ZSTD_STATIC void ZSTD_writeLE32(void *memPtr, U32 val32) { put_unaligned_le32(val32, memPtr); }
-+
-+ZSTD_STATIC U64 ZSTD_readLE64(const void *memPtr) { return get_unaligned_le64(memPtr); }
-+
-+ZSTD_STATIC void ZSTD_writeLE64(void *memPtr, U64 val64) { put_unaligned_le64(val64, memPtr); }
-+
-+ZSTD_STATIC size_t ZSTD_readLEST(const void *memPtr)
-+{
-+	if (ZSTD_32bits())
-+		return (size_t)ZSTD_readLE32(memPtr);
-+	else
-+		return (size_t)ZSTD_readLE64(memPtr);
-+}
-+
-+ZSTD_STATIC void ZSTD_writeLEST(void *memPtr, size_t val)
-+{
-+	if (ZSTD_32bits())
-+		ZSTD_writeLE32(memPtr, (U32)val);
-+	else
-+		ZSTD_writeLE64(memPtr, (U64)val);
-+}
-+
-+/*=== Big endian r/w ===*/
-+
-+ZSTD_STATIC U32 ZSTD_readBE32(const void *memPtr) { return get_unaligned_be32(memPtr); }
-+
-+ZSTD_STATIC void ZSTD_writeBE32(void *memPtr, U32 val32) { put_unaligned_be32(val32, memPtr); }
-+
-+ZSTD_STATIC U64 ZSTD_readBE64(const void *memPtr) { return get_unaligned_be64(memPtr); }
-+
-+ZSTD_STATIC void ZSTD_writeBE64(void *memPtr, U64 val64) { put_unaligned_be64(val64, memPtr); }
-+
-+ZSTD_STATIC size_t ZSTD_readBEST(const void *memPtr)
-+{
-+	if (ZSTD_32bits())
-+		return (size_t)ZSTD_readBE32(memPtr);
-+	else
-+		return (size_t)ZSTD_readBE64(memPtr);
-+}
-+
-+ZSTD_STATIC void ZSTD_writeBEST(void *memPtr, size_t val)
-+{
-+	if (ZSTD_32bits())
-+		ZSTD_writeBE32(memPtr, (U32)val);
-+	else
-+		ZSTD_writeBE64(memPtr, (U64)val);
-+}
-+
-+/* function safe only for comparisons */
-+ZSTD_STATIC U32 ZSTD_readMINMATCH(const void *memPtr, U32 length)
-+{
-+	switch (length) {
-+	default:
-+	case 4: return ZSTD_read32(memPtr);
-+	case 3:
-+		if (ZSTD_isLittleEndian())
-+			return ZSTD_read32(memPtr) << 8;
-+		else
-+			return ZSTD_read32(memPtr) >> 8;
-+	}
-+}
-+
-+#endif /* MEM_H_MODULE */
-diff --git a/lib/zstd/zstd_common.c b/lib/zstd/zstd_common.c
-new file mode 100644
-index 0000000..e5f06d7
---- /dev/null
-+++ b/lib/zstd/zstd_common.c
-@@ -0,0 +1,73 @@
-+/**
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+/*-*************************************
-+*  Dependencies
-+***************************************/
-+#include "error_private.h"
-+#include "zstd_internal.h" /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
-+#include 
-+
-+/*=**************************************************************
-+*  Custom allocator
-+****************************************************************/
-+
-+#define stack_push(stack, size)                                 \
-+	({                                                      \
-+		void *const ptr = ZSTD_PTR_ALIGN((stack)->ptr); \
-+		(stack)->ptr = (char *)ptr + (size);            \
-+		(stack)->ptr <= (stack)->end ? ptr : NULL;      \
-+	})
-+
-+ZSTD_customMem ZSTD_initStack(void *workspace, size_t workspaceSize)
-+{
-+	ZSTD_customMem stackMem = {ZSTD_stackAlloc, ZSTD_stackFree, workspace};
-+	ZSTD_stack *stack = (ZSTD_stack *)workspace;
-+	/* Verify preconditions */
-+	if (!workspace || workspaceSize < sizeof(ZSTD_stack) || workspace != ZSTD_PTR_ALIGN(workspace)) {
-+		ZSTD_customMem error = {NULL, NULL, NULL};
-+		return error;
-+	}
-+	/* Initialize the stack */
-+	stack->ptr = workspace;
-+	stack->end = (char *)workspace + workspaceSize;
-+	stack_push(stack, sizeof(ZSTD_stack));
-+	return stackMem;
-+}
-+
-+void *ZSTD_stackAllocAll(void *opaque, size_t *size)
-+{
-+	ZSTD_stack *stack = (ZSTD_stack *)opaque;
-+	*size = (BYTE const *)stack->end - (BYTE *)ZSTD_PTR_ALIGN(stack->ptr);
-+	return stack_push(stack, *size);
-+}
-+
-+void *ZSTD_stackAlloc(void *opaque, size_t size)
-+{
-+	ZSTD_stack *stack = (ZSTD_stack *)opaque;
-+	return stack_push(stack, size);
-+}
-+void ZSTD_stackFree(void *opaque, void *address)
-+{
-+	(void)opaque;
-+	(void)address;
-+}
-+
-+void *ZSTD_malloc(size_t size, ZSTD_customMem customMem) { return customMem.customAlloc(customMem.opaque, size); }
-+
-+void ZSTD_free(void *ptr, ZSTD_customMem customMem)
-+{
-+	if (ptr != NULL)
-+		customMem.customFree(customMem.opaque, ptr);
-+}
-diff --git a/lib/zstd/zstd_internal.h b/lib/zstd/zstd_internal.h
-new file mode 100644
-index 0000000..a0fb83e
---- /dev/null
-+++ b/lib/zstd/zstd_internal.h
-@@ -0,0 +1,261 @@
-+/**
-+ * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+#ifndef ZSTD_CCOMMON_H_MODULE
-+#define ZSTD_CCOMMON_H_MODULE
-+
-+/*-*******************************************************
-+*  Compiler specifics
-+*********************************************************/
-+#define FORCE_INLINE static __always_inline
-+#define FORCE_NOINLINE static noinline
-+
-+/*-*************************************
-+*  Dependencies
-+***************************************/
-+#include "error_private.h"
-+#include "mem.h"
-+#include 
-+#include 
-+#include 
-+#include 
-+
-+/*-*************************************
-+*  shared macros
-+***************************************/
-+#define MIN(a, b) ((a) < (b) ? (a) : (b))
-+#define MAX(a, b) ((a) > (b) ? (a) : (b))
-+#define CHECK_F(f)                       \
-+	{                                \
-+		size_t const errcod = f; \
-+		if (ERR_isError(errcod)) \
-+			return errcod;   \
-+	} /* check and Forward error code */
-+#define CHECK_E(f, e)                    \
-+	{                                \
-+		size_t const errcod = f; \
-+		if (ERR_isError(errcod)) \
-+			return ERROR(e); \
-+	} /* check and send Error code */
-+#define ZSTD_STATIC_ASSERT(c)                                   \
-+	{                                                       \
-+		enum { ZSTD_static_assert = 1 / (int)(!!(c)) }; \
-+	}
-+
-+/*-*************************************
-+*  Common constants
-+***************************************/
-+#define ZSTD_OPT_NUM (1 << 12)
-+#define ZSTD_DICT_MAGIC 0xEC30A437 /* v0.7+ */
-+
-+#define ZSTD_REP_NUM 3		      /* number of repcodes */
-+#define ZSTD_REP_CHECK (ZSTD_REP_NUM) /* number of repcodes to check by the optimal parser */
-+#define ZSTD_REP_MOVE (ZSTD_REP_NUM - 1)
-+#define ZSTD_REP_MOVE_OPT (ZSTD_REP_NUM)
-+static const U32 repStartValue[ZSTD_REP_NUM] = {1, 4, 8};
-+
-+#define KB *(1 << 10)
-+#define MB *(1 << 20)
-+#define GB *(1U << 30)
-+
-+#define BIT7 128
-+#define BIT6 64
-+#define BIT5 32
-+#define BIT4 16
-+#define BIT1 2
-+#define BIT0 1
-+
-+#define ZSTD_WINDOWLOG_ABSOLUTEMIN 10
-+static const size_t ZSTD_fcs_fieldSize[4] = {0, 2, 4, 8};
-+static const size_t ZSTD_did_fieldSize[4] = {0, 1, 2, 4};
-+
-+#define ZSTD_BLOCKHEADERSIZE 3 /* C standard doesn't allow `static const` variable to be init using another `static const` variable */
-+static const size_t ZSTD_blockHeaderSize = ZSTD_BLOCKHEADERSIZE;
-+typedef enum { bt_raw, bt_rle, bt_compressed, bt_reserved } blockType_e;
-+
-+#define MIN_SEQUENCES_SIZE 1									  /* nbSeq==0 */
-+#define MIN_CBLOCK_SIZE (1 /*litCSize*/ + 1 /* RLE or RAW */ + MIN_SEQUENCES_SIZE /* nbSeq==0 */) /* for a non-null block */
-+
-+#define HufLog 12
-+typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingType_e;
-+
-+#define LONGNBSEQ 0x7F00
-+
-+#define MINMATCH 3
-+#define EQUAL_READ32 4
-+
-+#define Litbits 8
-+#define MaxLit ((1 << Litbits) - 1)
-+#define MaxML 52
-+#define MaxLL 35
-+#define MaxOff 28
-+#define MaxSeq MAX(MaxLL, MaxML) /* Assumption : MaxOff < MaxLL,MaxML */
-+#define MLFSELog 9
-+#define LLFSELog 9
-+#define OffFSELog 8
-+
-+static const U32 LL_bits[MaxLL + 1] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
-+static const S16 LL_defaultNorm[MaxLL + 1] = {4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1, -1, -1, -1, -1};
-+#define LL_DEFAULTNORMLOG 6 /* for static allocation */
-+static const U32 LL_defaultNormLog = LL_DEFAULTNORMLOG;
-+
-+static const U32 ML_bits[MaxML + 1] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  0, 0,
-+				       0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
-+static const S16 ML_defaultNorm[MaxML + 1] = {1, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  1,  1,  1,  1,  1,  1, 1,
-+					      1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1};
-+#define ML_DEFAULTNORMLOG 6 /* for static allocation */
-+static const U32 ML_defaultNormLog = ML_DEFAULTNORMLOG;
-+
-+static const S16 OF_defaultNorm[MaxOff + 1] = {1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1};
-+#define OF_DEFAULTNORMLOG 5 /* for static allocation */
-+static const U32 OF_defaultNormLog = OF_DEFAULTNORMLOG;
-+
-+/*-*******************************************
-+*  Shared functions to include for inlining
-+*********************************************/
-+ZSTD_STATIC void ZSTD_copy8(void *dst, const void *src) {
-+	memcpy(dst, src, 8);
-+}
-+/*! ZSTD_wildcopy() :
-+*   custom version of memcpy(), can copy up to 7 bytes too many (8 bytes if length==0) */
-+#define WILDCOPY_OVERLENGTH 8
-+ZSTD_STATIC void ZSTD_wildcopy(void *dst, const void *src, ptrdiff_t length)
-+{
-+	const BYTE* ip = (const BYTE*)src;
-+	BYTE* op = (BYTE*)dst;
-+	BYTE* const oend = op + length;
-+	/* Work around https://gcc.gnu.org/bugzilla/show_bug.cgi?id=81388.
-+	 * Avoid the bad case where the loop only runs once by handling the
-+	 * special case separately. This doesn't trigger the bug because it
-+	 * doesn't involve pointer/integer overflow.
-+	 */
-+	if (length <= 8)
-+		return ZSTD_copy8(dst, src);
-+	do {
-+		ZSTD_copy8(op, ip);
-+		op += 8;
-+		ip += 8;
-+	} while (op < oend);
-+}
-+
-+/*-*******************************************
-+*  Private interfaces
-+*********************************************/
-+typedef struct ZSTD_stats_s ZSTD_stats_t;
-+
-+typedef struct {
-+	U32 off;
-+	U32 len;
-+} ZSTD_match_t;
-+
-+typedef struct {
-+	U32 price;
-+	U32 off;
-+	U32 mlen;
-+	U32 litlen;
-+	U32 rep[ZSTD_REP_NUM];
-+} ZSTD_optimal_t;
-+
-+typedef struct seqDef_s {
-+	U32 offset;
-+	U16 litLength;
-+	U16 matchLength;
-+} seqDef;
-+
-+typedef struct {
-+	seqDef *sequencesStart;
-+	seqDef *sequences;
-+	BYTE *litStart;
-+	BYTE *lit;
-+	BYTE *llCode;
-+	BYTE *mlCode;
-+	BYTE *ofCode;
-+	U32 longLengthID; /* 0 == no longLength; 1 == Lit.longLength; 2 == Match.longLength; */
-+	U32 longLengthPos;
-+	/* opt */
-+	ZSTD_optimal_t *priceTable;
-+	ZSTD_match_t *matchTable;
-+	U32 *matchLengthFreq;
-+	U32 *litLengthFreq;
-+	U32 *litFreq;
-+	U32 *offCodeFreq;
-+	U32 matchLengthSum;
-+	U32 matchSum;
-+	U32 litLengthSum;
-+	U32 litSum;
-+	U32 offCodeSum;
-+	U32 log2matchLengthSum;
-+	U32 log2matchSum;
-+	U32 log2litLengthSum;
-+	U32 log2litSum;
-+	U32 log2offCodeSum;
-+	U32 factor;
-+	U32 staticPrices;
-+	U32 cachedPrice;
-+	U32 cachedLitLength;
-+	const BYTE *cachedLiterals;
-+} seqStore_t;
-+
-+const seqStore_t *ZSTD_getSeqStore(const ZSTD_CCtx *ctx);
-+void ZSTD_seqToCodes(const seqStore_t *seqStorePtr);
-+int ZSTD_isSkipFrame(ZSTD_DCtx *dctx);
-+
-+/*= Custom memory allocation functions */
-+typedef void *(*ZSTD_allocFunction)(void *opaque, size_t size);
-+typedef void (*ZSTD_freeFunction)(void *opaque, void *address);
-+typedef struct {
-+	ZSTD_allocFunction customAlloc;
-+	ZSTD_freeFunction customFree;
-+	void *opaque;
-+} ZSTD_customMem;
-+
-+void *ZSTD_malloc(size_t size, ZSTD_customMem customMem);
-+void ZSTD_free(void *ptr, ZSTD_customMem customMem);
-+
-+/*====== stack allocation  ======*/
-+
-+typedef struct {
-+	void *ptr;
-+	const void *end;
-+} ZSTD_stack;
-+
-+#define ZSTD_ALIGN(x) ALIGN(x, sizeof(size_t))
-+#define ZSTD_PTR_ALIGN(p) PTR_ALIGN(p, sizeof(size_t))
-+
-+ZSTD_customMem ZSTD_initStack(void *workspace, size_t workspaceSize);
-+
-+void *ZSTD_stackAllocAll(void *opaque, size_t *size);
-+void *ZSTD_stackAlloc(void *opaque, size_t size);
-+void ZSTD_stackFree(void *opaque, void *address);
-+
-+/*======  common function  ======*/
-+
-+ZSTD_STATIC U32 ZSTD_highbit32(U32 val) { return 31 - __builtin_clz(val); }
-+
-+/* hidden functions */
-+
-+/* ZSTD_invalidateRepCodes() :
-+ * ensures next compression will not use repcodes from previous block.
-+ * Note : only works with regular variant;
-+ *        do not use with extDict variant ! */
-+void ZSTD_invalidateRepCodes(ZSTD_CCtx *cctx);
-+
-+size_t ZSTD_freeCCtx(ZSTD_CCtx *cctx);
-+size_t ZSTD_freeDCtx(ZSTD_DCtx *dctx);
-+size_t ZSTD_freeCDict(ZSTD_CDict *cdict);
-+size_t ZSTD_freeDDict(ZSTD_DDict *cdict);
-+size_t ZSTD_freeCStream(ZSTD_CStream *zcs);
-+size_t ZSTD_freeDStream(ZSTD_DStream *zds);
-+
-+#endif /* ZSTD_CCOMMON_H_MODULE */
-diff --git a/lib/zstd/zstd_opt.h b/lib/zstd/zstd_opt.h
-new file mode 100644
-index 0000000..ecdd725
---- /dev/null
-+++ b/lib/zstd/zstd_opt.h
-@@ -0,0 +1,1012 @@
-+/**
-+ * Copyright (c) 2016-present, Przemyslaw Skibinski, Yann Collet, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This source code is licensed under the BSD-style license found in the
-+ * LICENSE file in the root directory of https://github.com/facebook/zstd.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it under
-+ * the terms of the GNU General Public License version 2 as published by the
-+ * Free Software Foundation. This program is dual-licensed; you may select
-+ * either version 2 of the GNU General Public License ("GPL") or BSD license
-+ * ("BSD").
-+ */
-+
-+/* Note : this file is intended to be included within zstd_compress.c */
-+
-+#ifndef ZSTD_OPT_H_91842398743
-+#define ZSTD_OPT_H_91842398743
-+
-+#define ZSTD_LITFREQ_ADD 2
-+#define ZSTD_FREQ_DIV 4
-+#define ZSTD_MAX_PRICE (1 << 30)
-+
-+/*-*************************************
-+*  Price functions for optimal parser
-+***************************************/
-+FORCE_INLINE void ZSTD_setLog2Prices(seqStore_t *ssPtr)
-+{
-+	ssPtr->log2matchLengthSum = ZSTD_highbit32(ssPtr->matchLengthSum + 1);
-+	ssPtr->log2litLengthSum = ZSTD_highbit32(ssPtr->litLengthSum + 1);
-+	ssPtr->log2litSum = ZSTD_highbit32(ssPtr->litSum + 1);
-+	ssPtr->log2offCodeSum = ZSTD_highbit32(ssPtr->offCodeSum + 1);
-+	ssPtr->factor = 1 + ((ssPtr->litSum >> 5) / ssPtr->litLengthSum) + ((ssPtr->litSum << 1) / (ssPtr->litSum + ssPtr->matchSum));
-+}
-+
-+ZSTD_STATIC void ZSTD_rescaleFreqs(seqStore_t *ssPtr, const BYTE *src, size_t srcSize)
-+{
-+	unsigned u;
-+
-+	ssPtr->cachedLiterals = NULL;
-+	ssPtr->cachedPrice = ssPtr->cachedLitLength = 0;
-+	ssPtr->staticPrices = 0;
-+
-+	if (ssPtr->litLengthSum == 0) {
-+		if (srcSize <= 1024)
-+			ssPtr->staticPrices = 1;
-+
-+		for (u = 0; u <= MaxLit; u++)
-+			ssPtr->litFreq[u] = 0;
-+		for (u = 0; u < srcSize; u++)
-+			ssPtr->litFreq[src[u]]++;
-+
-+		ssPtr->litSum = 0;
-+		ssPtr->litLengthSum = MaxLL + 1;
-+		ssPtr->matchLengthSum = MaxML + 1;
-+		ssPtr->offCodeSum = (MaxOff + 1);
-+		ssPtr->matchSum = (ZSTD_LITFREQ_ADD << Litbits);
-+
-+		for (u = 0; u <= MaxLit; u++) {
-+			ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u] >> ZSTD_FREQ_DIV);
-+			ssPtr->litSum += ssPtr->litFreq[u];
-+		}
-+		for (u = 0; u <= MaxLL; u++)
-+			ssPtr->litLengthFreq[u] = 1;
-+		for (u = 0; u <= MaxML; u++)
-+			ssPtr->matchLengthFreq[u] = 1;
-+		for (u = 0; u <= MaxOff; u++)
-+			ssPtr->offCodeFreq[u] = 1;
-+	} else {
-+		ssPtr->matchLengthSum = 0;
-+		ssPtr->litLengthSum = 0;
-+		ssPtr->offCodeSum = 0;
-+		ssPtr->matchSum = 0;
-+		ssPtr->litSum = 0;
-+
-+		for (u = 0; u <= MaxLit; u++) {
-+			ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u] >> (ZSTD_FREQ_DIV + 1));
-+			ssPtr->litSum += ssPtr->litFreq[u];
-+		}
-+		for (u = 0; u <= MaxLL; u++) {
-+			ssPtr->litLengthFreq[u] = 1 + (ssPtr->litLengthFreq[u] >> (ZSTD_FREQ_DIV + 1));
-+			ssPtr->litLengthSum += ssPtr->litLengthFreq[u];
-+		}
-+		for (u = 0; u <= MaxML; u++) {
-+			ssPtr->matchLengthFreq[u] = 1 + (ssPtr->matchLengthFreq[u] >> ZSTD_FREQ_DIV);
-+			ssPtr->matchLengthSum += ssPtr->matchLengthFreq[u];
-+			ssPtr->matchSum += ssPtr->matchLengthFreq[u] * (u + 3);
-+		}
-+		ssPtr->matchSum *= ZSTD_LITFREQ_ADD;
-+		for (u = 0; u <= MaxOff; u++) {
-+			ssPtr->offCodeFreq[u] = 1 + (ssPtr->offCodeFreq[u] >> ZSTD_FREQ_DIV);
-+			ssPtr->offCodeSum += ssPtr->offCodeFreq[u];
-+		}
-+	}
-+
-+	ZSTD_setLog2Prices(ssPtr);
-+}
-+
-+FORCE_INLINE U32 ZSTD_getLiteralPrice(seqStore_t *ssPtr, U32 litLength, const BYTE *literals)
-+{
-+	U32 price, u;
-+
-+	if (ssPtr->staticPrices)
-+		return ZSTD_highbit32((U32)litLength + 1) + (litLength * 6);
-+
-+	if (litLength == 0)
-+		return ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[0] + 1);
-+
-+	/* literals */
-+	if (ssPtr->cachedLiterals == literals) {
-+		U32 const additional = litLength - ssPtr->cachedLitLength;
-+		const BYTE *literals2 = ssPtr->cachedLiterals + ssPtr->cachedLitLength;
-+		price = ssPtr->cachedPrice + additional * ssPtr->log2litSum;
-+		for (u = 0; u < additional; u++)
-+			price -= ZSTD_highbit32(ssPtr->litFreq[literals2[u]] + 1);
-+		ssPtr->cachedPrice = price;
-+		ssPtr->cachedLitLength = litLength;
-+	} else {
-+		price = litLength * ssPtr->log2litSum;
-+		for (u = 0; u < litLength; u++)
-+			price -= ZSTD_highbit32(ssPtr->litFreq[literals[u]] + 1);
-+
-+		if (litLength >= 12) {
-+			ssPtr->cachedLiterals = literals;
-+			ssPtr->cachedPrice = price;
-+			ssPtr->cachedLitLength = litLength;
-+		}
-+	}
-+
-+	/* literal Length */
-+	{
-+		const BYTE LL_deltaCode = 19;
-+		const BYTE llCode = (litLength > 63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-+		price += LL_bits[llCode] + ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[llCode] + 1);
-+	}
-+
-+	return price;
-+}
-+
-+FORCE_INLINE U32 ZSTD_getPrice(seqStore_t *seqStorePtr, U32 litLength, const BYTE *literals, U32 offset, U32 matchLength, const int ultra)
-+{
-+	/* offset */
-+	U32 price;
-+	BYTE const offCode = (BYTE)ZSTD_highbit32(offset + 1);
-+
-+	if (seqStorePtr->staticPrices)
-+		return ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + ZSTD_highbit32((U32)matchLength + 1) + 16 + offCode;
-+
-+	price = offCode + seqStorePtr->log2offCodeSum - ZSTD_highbit32(seqStorePtr->offCodeFreq[offCode] + 1);
-+	if (!ultra && offCode >= 20)
-+		price += (offCode - 19) * 2;
-+
-+	/* match Length */
-+	{
-+		const BYTE ML_deltaCode = 36;
-+		const BYTE mlCode = (matchLength > 127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
-+		price += ML_bits[mlCode] + seqStorePtr->log2matchLengthSum - ZSTD_highbit32(seqStorePtr->matchLengthFreq[mlCode] + 1);
-+	}
-+
-+	return price + ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + seqStorePtr->factor;
-+}
-+
-+ZSTD_STATIC void ZSTD_updatePrice(seqStore_t *seqStorePtr, U32 litLength, const BYTE *literals, U32 offset, U32 matchLength)
-+{
-+	U32 u;
-+
-+	/* literals */
-+	seqStorePtr->litSum += litLength * ZSTD_LITFREQ_ADD;
-+	for (u = 0; u < litLength; u++)
-+		seqStorePtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
-+
-+	/* literal Length */
-+	{
-+		const BYTE LL_deltaCode = 19;
-+		const BYTE llCode = (litLength > 63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-+		seqStorePtr->litLengthFreq[llCode]++;
-+		seqStorePtr->litLengthSum++;
-+	}
-+
-+	/* match offset */
-+	{
-+		BYTE const offCode = (BYTE)ZSTD_highbit32(offset + 1);
-+		seqStorePtr->offCodeSum++;
-+		seqStorePtr->offCodeFreq[offCode]++;
-+	}
-+
-+	/* match Length */
-+	{
-+		const BYTE ML_deltaCode = 36;
-+		const BYTE mlCode = (matchLength > 127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
-+		seqStorePtr->matchLengthFreq[mlCode]++;
-+		seqStorePtr->matchLengthSum++;
-+	}
-+
-+	ZSTD_setLog2Prices(seqStorePtr);
-+}
-+
-+#define SET_PRICE(pos, mlen_, offset_, litlen_, price_)           \
-+	{                                                         \
-+		while (last_pos < pos) {                          \
-+			opt[last_pos + 1].price = ZSTD_MAX_PRICE; \
-+			last_pos++;                               \
-+		}                                                 \
-+		opt[pos].mlen = mlen_;                            \
-+		opt[pos].off = offset_;                           \
-+		opt[pos].litlen = litlen_;                        \
-+		opt[pos].price = price_;                          \
-+	}
-+
-+/* Update hashTable3 up to ip (excluded)
-+   Assumption : always within prefix (i.e. not within extDict) */
-+FORCE_INLINE
-+U32 ZSTD_insertAndFindFirstIndexHash3(ZSTD_CCtx *zc, const BYTE *ip)
-+{
-+	U32 *const hashTable3 = zc->hashTable3;
-+	U32 const hashLog3 = zc->hashLog3;
-+	const BYTE *const base = zc->base;
-+	U32 idx = zc->nextToUpdate3;
-+	const U32 target = zc->nextToUpdate3 = (U32)(ip - base);
-+	const size_t hash3 = ZSTD_hash3Ptr(ip, hashLog3);
-+
-+	while (idx < target) {
-+		hashTable3[ZSTD_hash3Ptr(base + idx, hashLog3)] = idx;
-+		idx++;
-+	}
-+
-+	return hashTable3[hash3];
-+}
-+
-+/*-*************************************
-+*  Binary Tree search
-+***************************************/
-+static U32 ZSTD_insertBtAndGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, U32 nbCompares, const U32 mls, U32 extDict,
-+					 ZSTD_match_t *matches, const U32 minMatchLen)
-+{
-+	const BYTE *const base = zc->base;
-+	const U32 curr = (U32)(ip - base);
-+	const U32 hashLog = zc->params.cParams.hashLog;
-+	const size_t h = ZSTD_hashPtr(ip, hashLog, mls);
-+	U32 *const hashTable = zc->hashTable;
-+	U32 matchIndex = hashTable[h];
-+	U32 *const bt = zc->chainTable;
-+	const U32 btLog = zc->params.cParams.chainLog - 1;
-+	const U32 btMask = (1U << btLog) - 1;
-+	size_t commonLengthSmaller = 0, commonLengthLarger = 0;
-+	const BYTE *const dictBase = zc->dictBase;
-+	const U32 dictLimit = zc->dictLimit;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+	const BYTE *const prefixStart = base + dictLimit;
-+	const U32 btLow = btMask >= curr ? 0 : curr - btMask;
-+	const U32 windowLow = zc->lowLimit;
-+	U32 *smallerPtr = bt + 2 * (curr & btMask);
-+	U32 *largerPtr = bt + 2 * (curr & btMask) + 1;
-+	U32 matchEndIdx = curr + 8;
-+	U32 dummy32; /* to be nullified at the end */
-+	U32 mnum = 0;
-+
-+	const U32 minMatch = (mls == 3) ? 3 : 4;
-+	size_t bestLength = minMatchLen - 1;
-+
-+	if (minMatch == 3) { /* HC3 match finder */
-+		U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3(zc, ip);
-+		if (matchIndex3 > windowLow && (curr - matchIndex3 < (1 << 18))) {
-+			const BYTE *match;
-+			size_t currMl = 0;
-+			if ((!extDict) || matchIndex3 >= dictLimit) {
-+				match = base + matchIndex3;
-+				if (match[bestLength] == ip[bestLength])
-+					currMl = ZSTD_count(ip, match, iLimit);
-+			} else {
-+				match = dictBase + matchIndex3;
-+				if (ZSTD_readMINMATCH(match, MINMATCH) ==
-+				    ZSTD_readMINMATCH(ip, MINMATCH)) /* assumption : matchIndex3 <= dictLimit-4 (by table construction) */
-+					currMl = ZSTD_count_2segments(ip + MINMATCH, match + MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH;
-+			}
-+
-+			/* save best solution */
-+			if (currMl > bestLength) {
-+				bestLength = currMl;
-+				matches[mnum].off = ZSTD_REP_MOVE_OPT + curr - matchIndex3;
-+				matches[mnum].len = (U32)currMl;
-+				mnum++;
-+				if (currMl > ZSTD_OPT_NUM)
-+					goto update;
-+				if (ip + currMl == iLimit)
-+					goto update; /* best possible, and avoid read overflow*/
-+			}
-+		}
-+	}
-+
-+	hashTable[h] = curr; /* Update Hash Table */
-+
-+	while (nbCompares-- && (matchIndex > windowLow)) {
-+		U32 *nextPtr = bt + 2 * (matchIndex & btMask);
-+		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
-+		const BYTE *match;
-+
-+		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
-+			match = base + matchIndex;
-+			if (match[matchLength] == ip[matchLength]) {
-+				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iLimit) + 1;
-+			}
-+		} else {
-+			match = dictBase + matchIndex;
-+			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iLimit, dictEnd, prefixStart);
-+			if (matchIndex + matchLength >= dictLimit)
-+				match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
-+		}
-+
-+		if (matchLength > bestLength) {
-+			if (matchLength > matchEndIdx - matchIndex)
-+				matchEndIdx = matchIndex + (U32)matchLength;
-+			bestLength = matchLength;
-+			matches[mnum].off = ZSTD_REP_MOVE_OPT + curr - matchIndex;
-+			matches[mnum].len = (U32)matchLength;
-+			mnum++;
-+			if (matchLength > ZSTD_OPT_NUM)
-+				break;
-+			if (ip + matchLength == iLimit) /* equal : no way to know if inf or sup */
-+				break;			/* drop, to guarantee consistency (miss a little bit of compression) */
-+		}
-+
-+		if (match[matchLength] < ip[matchLength]) {
-+			/* match is smaller than curr */
-+			*smallerPtr = matchIndex;	  /* update smaller idx */
-+			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
-+			if (matchIndex <= btLow) {
-+				smallerPtr = &dummy32;
-+				break;
-+			}			  /* beyond tree size, stop the search */
-+			smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */
-+			matchIndex = nextPtr[1];  /* new matchIndex larger than previous (closer to curr) */
-+		} else {
-+			/* match is larger than curr */
-+			*largerPtr = matchIndex;
-+			commonLengthLarger = matchLength;
-+			if (matchIndex <= btLow) {
-+				largerPtr = &dummy32;
-+				break;
-+			} /* beyond tree size, stop the search */
-+			largerPtr = nextPtr;
-+			matchIndex = nextPtr[0];
-+		}
-+	}
-+
-+	*smallerPtr = *largerPtr = 0;
-+
-+update:
-+	zc->nextToUpdate = (matchEndIdx > curr + 8) ? matchEndIdx - 8 : curr + 1;
-+	return mnum;
-+}
-+
-+/** Tree updater, providing best match */
-+static U32 ZSTD_BtGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls, ZSTD_match_t *matches,
-+				const U32 minMatchLen)
-+{
-+	if (ip < zc->base + zc->nextToUpdate)
-+		return 0; /* skipped area */
-+	ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-+	return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen);
-+}
-+
-+static U32 ZSTD_BtGetAllMatches_selectMLS(ZSTD_CCtx *zc, /* Index table will be updated */
-+					  const BYTE *ip, const BYTE *const iHighLimit, const U32 maxNbAttempts, const U32 matchLengthSearch,
-+					  ZSTD_match_t *matches, const U32 minMatchLen)
-+{
-+	switch (matchLengthSearch) {
-+	case 3: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
-+	default:
-+	case 4: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
-+	case 5: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
-+	case 7:
-+	case 6: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
-+	}
-+}
-+
-+/** Tree updater, providing best match */
-+static U32 ZSTD_BtGetAllMatches_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls,
-+					ZSTD_match_t *matches, const U32 minMatchLen)
-+{
-+	if (ip < zc->base + zc->nextToUpdate)
-+		return 0; /* skipped area */
-+	ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-+	return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen);
-+}
-+
-+static U32 ZSTD_BtGetAllMatches_selectMLS_extDict(ZSTD_CCtx *zc, /* Index table will be updated */
-+						  const BYTE *ip, const BYTE *const iHighLimit, const U32 maxNbAttempts, const U32 matchLengthSearch,
-+						  ZSTD_match_t *matches, const U32 minMatchLen)
-+{
-+	switch (matchLengthSearch) {
-+	case 3: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
-+	default:
-+	case 4: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
-+	case 5: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
-+	case 7:
-+	case 6: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
-+	}
-+}
-+
-+/*-*******************************
-+*  Optimal parser
-+*********************************/
-+FORCE_INLINE
-+void ZSTD_compressBlock_opt_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const int ultra)
-+{
-+	seqStore_t *seqStorePtr = &(ctx->seqStore);
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - 8;
-+	const BYTE *const base = ctx->base;
-+	const BYTE *const prefixStart = base + ctx->dictLimit;
-+
-+	const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
-+	const U32 sufficient_len = ctx->params.cParams.targetLength;
-+	const U32 mls = ctx->params.cParams.searchLength;
-+	const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
-+
-+	ZSTD_optimal_t *opt = seqStorePtr->priceTable;
-+	ZSTD_match_t *matches = seqStorePtr->matchTable;
-+	const BYTE *inr;
-+	U32 offset, rep[ZSTD_REP_NUM];
-+
-+	/* init */
-+	ctx->nextToUpdate3 = ctx->nextToUpdate;
-+	ZSTD_rescaleFreqs(seqStorePtr, (const BYTE *)src, srcSize);
-+	ip += (ip == prefixStart);
-+	{
-+		U32 i;
-+		for (i = 0; i < ZSTD_REP_NUM; i++)
-+			rep[i] = ctx->rep[i];
-+	}
-+
-+	/* Match Loop */
-+	while (ip < ilimit) {
-+		U32 cur, match_num, last_pos, litlen, price;
-+		U32 u, mlen, best_mlen, best_off, litLength;
-+		memset(opt, 0, sizeof(ZSTD_optimal_t));
-+		last_pos = 0;
-+		litlen = (U32)(ip - anchor);
-+
-+		/* check repCode */
-+		{
-+			U32 i, last_i = ZSTD_REP_CHECK + (ip == anchor);
-+			for (i = (ip == anchor); i < last_i; i++) {
-+				const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
-+				if ((repCur > 0) && (repCur < (S32)(ip - prefixStart)) &&
-+				    (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repCur, minMatch))) {
-+					mlen = (U32)ZSTD_count(ip + minMatch, ip + minMatch - repCur, iend) + minMatch;
-+					if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
-+						best_mlen = mlen;
-+						best_off = i;
-+						cur = 0;
-+						last_pos = 1;
-+						goto _storeSequence;
-+					}
-+					best_off = i - (ip == anchor);
-+					do {
-+						price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-+						if (mlen > last_pos || price < opt[mlen].price)
-+							SET_PRICE(mlen, mlen, i, litlen, price); /* note : macro modifies last_pos */
-+						mlen--;
-+					} while (mlen >= minMatch);
-+				}
-+			}
-+		}
-+
-+		match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, ip, iend, maxSearches, mls, matches, minMatch);
-+
-+		if (!last_pos && !match_num) {
-+			ip++;
-+			continue;
-+		}
-+
-+		if (match_num && (matches[match_num - 1].len > sufficient_len || matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-+			best_mlen = matches[match_num - 1].len;
-+			best_off = matches[match_num - 1].off;
-+			cur = 0;
-+			last_pos = 1;
-+			goto _storeSequence;
-+		}
-+
-+		/* set prices using matches at position = 0 */
-+		best_mlen = (last_pos) ? last_pos : minMatch;
-+		for (u = 0; u < match_num; u++) {
-+			mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-+			best_mlen = matches[u].len;
-+			while (mlen <= best_mlen) {
-+				price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-+				if (mlen > last_pos || price < opt[mlen].price)
-+					SET_PRICE(mlen, mlen, matches[u].off, litlen, price); /* note : macro modifies last_pos */
-+				mlen++;
-+			}
-+		}
-+
-+		if (last_pos < minMatch) {
-+			ip++;
-+			continue;
-+		}
-+
-+		/* initialize opt[0] */
-+		{
-+			U32 i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				opt[0].rep[i] = rep[i];
-+		}
-+		opt[0].mlen = 1;
-+		opt[0].litlen = litlen;
-+
-+		/* check further positions */
-+		for (cur = 1; cur <= last_pos; cur++) {
-+			inr = ip + cur;
-+
-+			if (opt[cur - 1].mlen == 1) {
-+				litlen = opt[cur - 1].litlen + 1;
-+				if (cur > litlen) {
-+					price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen);
-+				} else
-+					price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
-+			} else {
-+				litlen = 1;
-+				price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1);
-+			}
-+
-+			if (cur > last_pos || price <= opt[cur].price)
-+				SET_PRICE(cur, 1, 0, litlen, price);
-+
-+			if (cur == last_pos)
-+				break;
-+
-+			if (inr > ilimit) /* last match must start at a minimum distance of 8 from oend */
-+				continue;
-+
-+			mlen = opt[cur].mlen;
-+			if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
-+				opt[cur].rep[2] = opt[cur - mlen].rep[1];
-+				opt[cur].rep[1] = opt[cur - mlen].rep[0];
-+				opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
-+			} else {
-+				opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur - mlen].rep[1] : opt[cur - mlen].rep[2];
-+				opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur - mlen].rep[0] : opt[cur - mlen].rep[1];
-+				opt[cur].rep[0] =
-+				    ((opt[cur].off == ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur - mlen].rep[0] - 1) : (opt[cur - mlen].rep[opt[cur].off]);
-+			}
-+
-+			best_mlen = minMatch;
-+			{
-+				U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
-+				for (i = (opt[cur].mlen != 1); i < last_i; i++) { /* check rep */
-+					const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
-+					if ((repCur > 0) && (repCur < (S32)(inr - prefixStart)) &&
-+					    (ZSTD_readMINMATCH(inr, minMatch) == ZSTD_readMINMATCH(inr - repCur, minMatch))) {
-+						mlen = (U32)ZSTD_count(inr + minMatch, inr + minMatch - repCur, iend) + minMatch;
-+
-+						if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
-+							best_mlen = mlen;
-+							best_off = i;
-+							last_pos = cur + 1;
-+							goto _storeSequence;
-+						}
-+
-+						best_off = i - (opt[cur].mlen != 1);
-+						if (mlen > best_mlen)
-+							best_mlen = mlen;
-+
-+						do {
-+							if (opt[cur].mlen == 1) {
-+								litlen = opt[cur].litlen;
-+								if (cur > litlen) {
-+									price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr - litlen,
-+															best_off, mlen - MINMATCH, ultra);
-+								} else
-+									price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-+							} else {
-+								litlen = 0;
-+								price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
-+							}
-+
-+							if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
-+								SET_PRICE(cur + mlen, mlen, i, litlen, price);
-+							mlen--;
-+						} while (mlen >= minMatch);
-+					}
-+				}
-+			}
-+
-+			match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, inr, iend, maxSearches, mls, matches, best_mlen);
-+
-+			if (match_num > 0 && (matches[match_num - 1].len > sufficient_len || cur + matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-+				best_mlen = matches[match_num - 1].len;
-+				best_off = matches[match_num - 1].off;
-+				last_pos = cur + 1;
-+				goto _storeSequence;
-+			}
-+
-+			/* set prices using matches at position = cur */
-+			for (u = 0; u < match_num; u++) {
-+				mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-+				best_mlen = matches[u].len;
-+
-+				while (mlen <= best_mlen) {
-+					if (opt[cur].mlen == 1) {
-+						litlen = opt[cur].litlen;
-+						if (cur > litlen)
-+							price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip + cur - litlen,
-+													matches[u].off - 1, mlen - MINMATCH, ultra);
-+						else
-+							price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-+					} else {
-+						litlen = 0;
-+						price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off - 1, mlen - MINMATCH, ultra);
-+					}
-+
-+					if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
-+						SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
-+
-+					mlen++;
-+				}
-+			}
-+		}
-+
-+		best_mlen = opt[last_pos].mlen;
-+		best_off = opt[last_pos].off;
-+		cur = last_pos - best_mlen;
-+
-+	/* store sequence */
-+_storeSequence: /* cur, last_pos, best_mlen, best_off have to be set */
-+		opt[0].mlen = 1;
-+
-+		while (1) {
-+			mlen = opt[cur].mlen;
-+			offset = opt[cur].off;
-+			opt[cur].mlen = best_mlen;
-+			opt[cur].off = best_off;
-+			best_mlen = mlen;
-+			best_off = offset;
-+			if (mlen > cur)
-+				break;
-+			cur -= mlen;
-+		}
-+
-+		for (u = 0; u <= last_pos;) {
-+			u += opt[u].mlen;
-+		}
-+
-+		for (cur = 0; cur < last_pos;) {
-+			mlen = opt[cur].mlen;
-+			if (mlen == 1) {
-+				ip++;
-+				cur++;
-+				continue;
-+			}
-+			offset = opt[cur].off;
-+			cur += mlen;
-+			litLength = (U32)(ip - anchor);
-+
-+			if (offset > ZSTD_REP_MOVE_OPT) {
-+				rep[2] = rep[1];
-+				rep[1] = rep[0];
-+				rep[0] = offset - ZSTD_REP_MOVE_OPT;
-+				offset--;
-+			} else {
-+				if (offset != 0) {
-+					best_off = (offset == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
-+					if (offset != 1)
-+						rep[2] = rep[1];
-+					rep[1] = rep[0];
-+					rep[0] = best_off;
-+				}
-+				if (litLength == 0)
-+					offset--;
-+			}
-+
-+			ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-+			anchor = ip = ip + mlen;
-+		}
-+	} /* for (cur=0; cur < last_pos; ) */
-+
-+	/* Save reps for next block */
-+	{
-+		int i;
-+		for (i = 0; i < ZSTD_REP_NUM; i++)
-+			ctx->repToConfirm[i] = rep[i];
-+	}
-+
-+	/* Last Literals */
-+	{
-+		size_t const lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+FORCE_INLINE
-+void ZSTD_compressBlock_opt_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const int ultra)
-+{
-+	seqStore_t *seqStorePtr = &(ctx->seqStore);
-+	const BYTE *const istart = (const BYTE *)src;
-+	const BYTE *ip = istart;
-+	const BYTE *anchor = istart;
-+	const BYTE *const iend = istart + srcSize;
-+	const BYTE *const ilimit = iend - 8;
-+	const BYTE *const base = ctx->base;
-+	const U32 lowestIndex = ctx->lowLimit;
-+	const U32 dictLimit = ctx->dictLimit;
-+	const BYTE *const prefixStart = base + dictLimit;
-+	const BYTE *const dictBase = ctx->dictBase;
-+	const BYTE *const dictEnd = dictBase + dictLimit;
-+
-+	const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
-+	const U32 sufficient_len = ctx->params.cParams.targetLength;
-+	const U32 mls = ctx->params.cParams.searchLength;
-+	const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
-+
-+	ZSTD_optimal_t *opt = seqStorePtr->priceTable;
-+	ZSTD_match_t *matches = seqStorePtr->matchTable;
-+	const BYTE *inr;
-+
-+	/* init */
-+	U32 offset, rep[ZSTD_REP_NUM];
-+	{
-+		U32 i;
-+		for (i = 0; i < ZSTD_REP_NUM; i++)
-+			rep[i] = ctx->rep[i];
-+	}
-+
-+	ctx->nextToUpdate3 = ctx->nextToUpdate;
-+	ZSTD_rescaleFreqs(seqStorePtr, (const BYTE *)src, srcSize);
-+	ip += (ip == prefixStart);
-+
-+	/* Match Loop */
-+	while (ip < ilimit) {
-+		U32 cur, match_num, last_pos, litlen, price;
-+		U32 u, mlen, best_mlen, best_off, litLength;
-+		U32 curr = (U32)(ip - base);
-+		memset(opt, 0, sizeof(ZSTD_optimal_t));
-+		last_pos = 0;
-+		opt[0].litlen = (U32)(ip - anchor);
-+
-+		/* check repCode */
-+		{
-+			U32 i, last_i = ZSTD_REP_CHECK + (ip == anchor);
-+			for (i = (ip == anchor); i < last_i; i++) {
-+				const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
-+				const U32 repIndex = (U32)(curr - repCur);
-+				const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-+				const BYTE *const repMatch = repBase + repIndex;
-+				if ((repCur > 0 && repCur <= (S32)curr) &&
-+				    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-+				    && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch))) {
-+					/* repcode detected we should take it */
-+					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-+					mlen = (U32)ZSTD_count_2segments(ip + minMatch, repMatch + minMatch, iend, repEnd, prefixStart) + minMatch;
-+
-+					if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
-+						best_mlen = mlen;
-+						best_off = i;
-+						cur = 0;
-+						last_pos = 1;
-+						goto _storeSequence;
-+					}
-+
-+					best_off = i - (ip == anchor);
-+					litlen = opt[0].litlen;
-+					do {
-+						price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-+						if (mlen > last_pos || price < opt[mlen].price)
-+							SET_PRICE(mlen, mlen, i, litlen, price); /* note : macro modifies last_pos */
-+						mlen--;
-+					} while (mlen >= minMatch);
-+				}
-+			}
-+		}
-+
-+		match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, ip, iend, maxSearches, mls, matches, minMatch); /* first search (depth 0) */
-+
-+		if (!last_pos && !match_num) {
-+			ip++;
-+			continue;
-+		}
-+
-+		{
-+			U32 i;
-+			for (i = 0; i < ZSTD_REP_NUM; i++)
-+				opt[0].rep[i] = rep[i];
-+		}
-+		opt[0].mlen = 1;
-+
-+		if (match_num && (matches[match_num - 1].len > sufficient_len || matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-+			best_mlen = matches[match_num - 1].len;
-+			best_off = matches[match_num - 1].off;
-+			cur = 0;
-+			last_pos = 1;
-+			goto _storeSequence;
-+		}
-+
-+		best_mlen = (last_pos) ? last_pos : minMatch;
-+
-+		/* set prices using matches at position = 0 */
-+		for (u = 0; u < match_num; u++) {
-+			mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-+			best_mlen = matches[u].len;
-+			litlen = opt[0].litlen;
-+			while (mlen <= best_mlen) {
-+				price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-+				if (mlen > last_pos || price < opt[mlen].price)
-+					SET_PRICE(mlen, mlen, matches[u].off, litlen, price);
-+				mlen++;
-+			}
-+		}
-+
-+		if (last_pos < minMatch) {
-+			ip++;
-+			continue;
-+		}
-+
-+		/* check further positions */
-+		for (cur = 1; cur <= last_pos; cur++) {
-+			inr = ip + cur;
-+
-+			if (opt[cur - 1].mlen == 1) {
-+				litlen = opt[cur - 1].litlen + 1;
-+				if (cur > litlen) {
-+					price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen);
-+				} else
-+					price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
-+			} else {
-+				litlen = 1;
-+				price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1);
-+			}
-+
-+			if (cur > last_pos || price <= opt[cur].price)
-+				SET_PRICE(cur, 1, 0, litlen, price);
-+
-+			if (cur == last_pos)
-+				break;
-+
-+			if (inr > ilimit) /* last match must start at a minimum distance of 8 from oend */
-+				continue;
-+
-+			mlen = opt[cur].mlen;
-+			if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
-+				opt[cur].rep[2] = opt[cur - mlen].rep[1];
-+				opt[cur].rep[1] = opt[cur - mlen].rep[0];
-+				opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
-+			} else {
-+				opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur - mlen].rep[1] : opt[cur - mlen].rep[2];
-+				opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur - mlen].rep[0] : opt[cur - mlen].rep[1];
-+				opt[cur].rep[0] =
-+				    ((opt[cur].off == ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur - mlen].rep[0] - 1) : (opt[cur - mlen].rep[opt[cur].off]);
-+			}
-+
-+			best_mlen = minMatch;
-+			{
-+				U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
-+				for (i = (mlen != 1); i < last_i; i++) {
-+					const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
-+					const U32 repIndex = (U32)(curr + cur - repCur);
-+					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-+					const BYTE *const repMatch = repBase + repIndex;
-+					if ((repCur > 0 && repCur <= (S32)(curr + cur)) &&
-+					    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-+					    && (ZSTD_readMINMATCH(inr, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch))) {
-+						/* repcode detected */
-+						const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-+						mlen = (U32)ZSTD_count_2segments(inr + minMatch, repMatch + minMatch, iend, repEnd, prefixStart) + minMatch;
-+
-+						if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
-+							best_mlen = mlen;
-+							best_off = i;
-+							last_pos = cur + 1;
-+							goto _storeSequence;
-+						}
-+
-+						best_off = i - (opt[cur].mlen != 1);
-+						if (mlen > best_mlen)
-+							best_mlen = mlen;
-+
-+						do {
-+							if (opt[cur].mlen == 1) {
-+								litlen = opt[cur].litlen;
-+								if (cur > litlen) {
-+									price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr - litlen,
-+															best_off, mlen - MINMATCH, ultra);
-+								} else
-+									price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-+							} else {
-+								litlen = 0;
-+								price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
-+							}
-+
-+							if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
-+								SET_PRICE(cur + mlen, mlen, i, litlen, price);
-+							mlen--;
-+						} while (mlen >= minMatch);
-+					}
-+				}
-+			}
-+
-+			match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, inr, iend, maxSearches, mls, matches, minMatch);
-+
-+			if (match_num > 0 && (matches[match_num - 1].len > sufficient_len || cur + matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-+				best_mlen = matches[match_num - 1].len;
-+				best_off = matches[match_num - 1].off;
-+				last_pos = cur + 1;
-+				goto _storeSequence;
-+			}
-+
-+			/* set prices using matches at position = cur */
-+			for (u = 0; u < match_num; u++) {
-+				mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-+				best_mlen = matches[u].len;
-+
-+				while (mlen <= best_mlen) {
-+					if (opt[cur].mlen == 1) {
-+						litlen = opt[cur].litlen;
-+						if (cur > litlen)
-+							price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip + cur - litlen,
-+													matches[u].off - 1, mlen - MINMATCH, ultra);
-+						else
-+							price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-+					} else {
-+						litlen = 0;
-+						price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off - 1, mlen - MINMATCH, ultra);
-+					}
-+
-+					if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
-+						SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
-+
-+					mlen++;
-+				}
-+			}
-+		} /* for (cur = 1; cur <= last_pos; cur++) */
-+
-+		best_mlen = opt[last_pos].mlen;
-+		best_off = opt[last_pos].off;
-+		cur = last_pos - best_mlen;
-+
-+	/* store sequence */
-+_storeSequence: /* cur, last_pos, best_mlen, best_off have to be set */
-+		opt[0].mlen = 1;
-+
-+		while (1) {
-+			mlen = opt[cur].mlen;
-+			offset = opt[cur].off;
-+			opt[cur].mlen = best_mlen;
-+			opt[cur].off = best_off;
-+			best_mlen = mlen;
-+			best_off = offset;
-+			if (mlen > cur)
-+				break;
-+			cur -= mlen;
-+		}
-+
-+		for (u = 0; u <= last_pos;) {
-+			u += opt[u].mlen;
-+		}
-+
-+		for (cur = 0; cur < last_pos;) {
-+			mlen = opt[cur].mlen;
-+			if (mlen == 1) {
-+				ip++;
-+				cur++;
-+				continue;
-+			}
-+			offset = opt[cur].off;
-+			cur += mlen;
-+			litLength = (U32)(ip - anchor);
-+
-+			if (offset > ZSTD_REP_MOVE_OPT) {
-+				rep[2] = rep[1];
-+				rep[1] = rep[0];
-+				rep[0] = offset - ZSTD_REP_MOVE_OPT;
-+				offset--;
-+			} else {
-+				if (offset != 0) {
-+					best_off = (offset == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
-+					if (offset != 1)
-+						rep[2] = rep[1];
-+					rep[1] = rep[0];
-+					rep[0] = best_off;
-+				}
-+
-+				if (litLength == 0)
-+					offset--;
-+			}
-+
-+			ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-+			ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-+			anchor = ip = ip + mlen;
-+		}
-+	} /* for (cur=0; cur < last_pos; ) */
-+
-+	/* Save reps for next block */
-+	{
-+		int i;
-+		for (i = 0; i < ZSTD_REP_NUM; i++)
-+			ctx->repToConfirm[i] = rep[i];
-+	}
-+
-+	/* Last Literals */
-+	{
-+		size_t lastLLSize = iend - anchor;
-+		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-+		seqStorePtr->lit += lastLLSize;
-+	}
-+}
-+
-+#endif /* ZSTD_OPT_H_91842398743 */
---
-2.9.5
diff --git a/priv/zstd/contrib/linux-kernel/0003-btrfs-Add-zstd-support.patch b/priv/zstd/contrib/linux-kernel/0003-btrfs-Add-zstd-support.patch
deleted file mode 100644
index edc7839..0000000
--- a/priv/zstd/contrib/linux-kernel/0003-btrfs-Add-zstd-support.patch
+++ /dev/null
@@ -1,740 +0,0 @@
-From 8a9dddfbf6551afea73911e367dd4be64d62b9fd Mon Sep 17 00:00:00 2001
-From: Nick Terrell 
-Date: Mon, 17 Jul 2017 17:08:39 -0700
-Subject: [PATCH v5 3/5] btrfs: Add zstd support
-
-Add zstd compression and decompression support to BtrFS. zstd at its
-fastest level compresses almost as well as zlib, while offering much
-faster compression and decompression, approaching lzo speeds.
-
-I benchmarked btrfs with zstd compression against no compression, lzo
-compression, and zlib compression. I benchmarked two scenarios. Copying
-a set of files to btrfs, and then reading the files. Copying a tarball
-to btrfs, extracting it to btrfs, and then reading the extracted files.
-After every operation, I call `sync` and include the sync time.
-Between every pair of operations I unmount and remount the filesystem
-to avoid caching. The benchmark files can be found in the upstream
-zstd source repository under
-`contrib/linux-kernel/{btrfs-benchmark.sh,btrfs-extract-benchmark.sh}`
-[1] [2].
-
-I ran the benchmarks on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-The VM is running on a MacBook Pro with a 3.1 GHz Intel Core i7 processor,
-16 GB of RAM, and a SSD.
-
-The first compression benchmark is copying 10 copies of the unzipped
-Silesia corpus [3] into a BtrFS filesystem mounted with
-`-o compress-force=Method`. The decompression benchmark times how long
-it takes to `tar` all 10 copies into `/dev/null`. The compression ratio is
-measured by comparing the output of `df` and `du`. See the benchmark file
-[1] for details. I benchmarked multiple zstd compression levels, although
-the patch uses zstd level 1.
-
-| Method  | Ratio | Compression MB/s | Decompression speed |
-|---------|-------|------------------|---------------------|
-| None    |  0.99 |              504 |                 686 |
-| lzo     |  1.66 |              398 |                 442 |
-| zlib    |  2.58 |               65 |                 241 |
-| zstd 1  |  2.57 |              260 |                 383 |
-| zstd 3  |  2.71 |              174 |                 408 |
-| zstd 6  |  2.87 |               70 |                 398 |
-| zstd 9  |  2.92 |               43 |                 406 |
-| zstd 12 |  2.93 |               21 |                 408 |
-| zstd 15 |  3.01 |               11 |                 354 |
-
-The next benchmark first copies `linux-4.11.6.tar` [4] to btrfs. Then it
-measures the compression ratio, extracts the tar, and deletes the tar.
-Then it measures the compression ratio again, and `tar`s the extracted
-files into `/dev/null`. See the benchmark file [2] for details.
-
-| Method | Tar Ratio | Extract Ratio | Copy (s) | Extract (s)| Read (s) |
-|--------|-----------|---------------|----------|------------|----------|
-| None   |      0.97 |          0.78 |    0.981 |      5.501 |    8.807 |
-| lzo    |      2.06 |          1.38 |    1.631 |      8.458 |    8.585 |
-| zlib   |      3.40 |          1.86 |    7.750 |     21.544 |   11.744 |
-| zstd 1 |      3.57 |          1.85 |    2.579 |     11.479 |    9.389 |
-
-[1] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/btrfs-benchmark.sh
-[2] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/btrfs-extract-benchmark.sh
-[3] http://sun.aei.polsl.pl/~sdeor/index.php?page=silesia
-[4] https://cdn.kernel.org/pub/linux/kernel/v4.x/linux-4.11.6.tar.xz
-
-zstd source repository: https://github.com/facebook/zstd
-
-Signed-off-by: Nick Terrell 
----
-v2 -> v3:
-- Port upstream BtrFS commits e1ddce71d6, 389a6cfc2a, and 6acafd1eff
-- Change default compression level for BtrFS to 3
-
-v3 -> v4:
-- Add missing includes, which fixes the aarch64 build
-- Fix minor linter warnings
-
- fs/btrfs/Kconfig           |   2 +
- fs/btrfs/Makefile          |   2 +-
- fs/btrfs/compression.c     |   1 +
- fs/btrfs/compression.h     |   6 +-
- fs/btrfs/ctree.h           |   1 +
- fs/btrfs/disk-io.c         |   2 +
- fs/btrfs/ioctl.c           |   6 +-
- fs/btrfs/props.c           |   6 +
- fs/btrfs/super.c           |  12 +-
- fs/btrfs/sysfs.c           |   2 +
- fs/btrfs/zstd.c            | 432 +++++++++++++++++++++++++++++++++++++++++++++
- include/uapi/linux/btrfs.h |   8 +-
- 12 files changed, 468 insertions(+), 12 deletions(-)
- create mode 100644 fs/btrfs/zstd.c
-
-diff --git a/fs/btrfs/Kconfig b/fs/btrfs/Kconfig
-index 80e9c18..a26c63b 100644
---- a/fs/btrfs/Kconfig
-+++ b/fs/btrfs/Kconfig
-@@ -6,6 +6,8 @@ config BTRFS_FS
- 	select ZLIB_DEFLATE
- 	select LZO_COMPRESS
- 	select LZO_DECOMPRESS
-+	select ZSTD_COMPRESS
-+	select ZSTD_DECOMPRESS
- 	select RAID6_PQ
- 	select XOR_BLOCKS
- 	select SRCU
-diff --git a/fs/btrfs/Makefile b/fs/btrfs/Makefile
-index 128ce17..962a95a 100644
---- a/fs/btrfs/Makefile
-+++ b/fs/btrfs/Makefile
-@@ -6,7 +6,7 @@ btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
- 	   transaction.o inode.o file.o tree-defrag.o \
- 	   extent_map.o sysfs.o struct-funcs.o xattr.o ordered-data.o \
- 	   extent_io.o volumes.o async-thread.o ioctl.o locking.o orphan.o \
--	   export.o tree-log.o free-space-cache.o zlib.o lzo.o \
-+	   export.o tree-log.o free-space-cache.o zlib.o lzo.o zstd.o \
- 	   compression.o delayed-ref.o relocation.o delayed-inode.o scrub.o \
- 	   reada.o backref.o ulist.o qgroup.o send.o dev-replace.o raid56.o \
- 	   uuid-tree.o props.o hash.o free-space-tree.o
-diff --git a/fs/btrfs/compression.c b/fs/btrfs/compression.c
-index d2ef9ac..4ff42d1 100644
---- a/fs/btrfs/compression.c
-+++ b/fs/btrfs/compression.c
-@@ -704,6 +704,7 @@ static struct {
- static const struct btrfs_compress_op * const btrfs_compress_op[] = {
- 	&btrfs_zlib_compress,
- 	&btrfs_lzo_compress,
-+	&btrfs_zstd_compress,
- };
-
- void __init btrfs_init_compress(void)
-diff --git a/fs/btrfs/compression.h b/fs/btrfs/compression.h
-index 87f6d33..2269e00 100644
---- a/fs/btrfs/compression.h
-+++ b/fs/btrfs/compression.h
-@@ -99,8 +99,9 @@ enum btrfs_compression_type {
- 	BTRFS_COMPRESS_NONE  = 0,
- 	BTRFS_COMPRESS_ZLIB  = 1,
- 	BTRFS_COMPRESS_LZO   = 2,
--	BTRFS_COMPRESS_TYPES = 2,
--	BTRFS_COMPRESS_LAST  = 3,
-+	BTRFS_COMPRESS_ZSTD  = 3,
-+	BTRFS_COMPRESS_TYPES = 3,
-+	BTRFS_COMPRESS_LAST  = 4,
- };
-
- struct btrfs_compress_op {
-@@ -128,5 +129,6 @@ struct btrfs_compress_op {
-
- extern const struct btrfs_compress_op btrfs_zlib_compress;
- extern const struct btrfs_compress_op btrfs_lzo_compress;
-+extern const struct btrfs_compress_op btrfs_zstd_compress;
-
- #endif
-diff --git a/fs/btrfs/ctree.h b/fs/btrfs/ctree.h
-index 3f3eb7b..845d77c 100644
---- a/fs/btrfs/ctree.h
-+++ b/fs/btrfs/ctree.h
-@@ -270,6 +270,7 @@ struct btrfs_super_block {
- 	 BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS |		\
- 	 BTRFS_FEATURE_INCOMPAT_BIG_METADATA |		\
- 	 BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO |		\
-+	 BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD |		\
- 	 BTRFS_FEATURE_INCOMPAT_RAID56 |		\
- 	 BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF |		\
- 	 BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA |	\
-diff --git a/fs/btrfs/disk-io.c b/fs/btrfs/disk-io.c
-index 080e2eb..04632f4 100644
---- a/fs/btrfs/disk-io.c
-+++ b/fs/btrfs/disk-io.c
-@@ -2828,6 +2828,8 @@ int open_ctree(struct super_block *sb,
- 	features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
- 	if (fs_info->compress_type == BTRFS_COMPRESS_LZO)
- 		features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
-+	else if (fs_info->compress_type == BTRFS_COMPRESS_ZSTD)
-+		features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD;
-
- 	if (features & BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)
- 		btrfs_info(fs_info, "has skinny extents");
-diff --git a/fs/btrfs/ioctl.c b/fs/btrfs/ioctl.c
-index fa1b78c..b9963d9 100644
---- a/fs/btrfs/ioctl.c
-+++ b/fs/btrfs/ioctl.c
-@@ -327,8 +327,10 @@ static int btrfs_ioctl_setflags(struct file *file, void __user *arg)
-
- 		if (fs_info->compress_type == BTRFS_COMPRESS_LZO)
- 			comp = "lzo";
--		else
-+		else if (fs_info->compress_type == BTRFS_COMPRESS_ZLIB)
- 			comp = "zlib";
-+		else
-+			comp = "zstd";
- 		ret = btrfs_set_prop(inode, "btrfs.compression",
- 				     comp, strlen(comp), 0);
- 		if (ret)
-@@ -1466,6 +1468,8 @@ int btrfs_defrag_file(struct inode *inode, struct file *file,
-
- 	if (range->compress_type == BTRFS_COMPRESS_LZO) {
- 		btrfs_set_fs_incompat(fs_info, COMPRESS_LZO);
-+	} else if (range->compress_type == BTRFS_COMPRESS_ZSTD) {
-+		btrfs_set_fs_incompat(fs_info, COMPRESS_ZSTD);
- 	}
-
- 	ret = defrag_count;
-diff --git a/fs/btrfs/props.c b/fs/btrfs/props.c
-index 4b23ae5..20631e9 100644
---- a/fs/btrfs/props.c
-+++ b/fs/btrfs/props.c
-@@ -390,6 +390,8 @@ static int prop_compression_validate(const char *value, size_t len)
- 		return 0;
- 	else if (!strncmp("zlib", value, len))
- 		return 0;
-+	else if (!strncmp("zstd", value, len))
-+		return 0;
-
- 	return -EINVAL;
- }
-@@ -412,6 +414,8 @@ static int prop_compression_apply(struct inode *inode,
- 		type = BTRFS_COMPRESS_LZO;
- 	else if (!strncmp("zlib", value, len))
- 		type = BTRFS_COMPRESS_ZLIB;
-+	else if (!strncmp("zstd", value, len))
-+		type = BTRFS_COMPRESS_ZSTD;
- 	else
- 		return -EINVAL;
-
-@@ -429,6 +433,8 @@ static const char *prop_compression_extract(struct inode *inode)
- 		return "zlib";
- 	case BTRFS_COMPRESS_LZO:
- 		return "lzo";
-+	case BTRFS_COMPRESS_ZSTD:
-+		return "zstd";
- 	}
-
- 	return NULL;
-diff --git a/fs/btrfs/super.c b/fs/btrfs/super.c
-index 12540b6..c370dea 100644
---- a/fs/btrfs/super.c
-+++ b/fs/btrfs/super.c
-@@ -513,6 +513,14 @@ int btrfs_parse_options(struct btrfs_fs_info *info, char *options,
- 				btrfs_clear_opt(info->mount_opt, NODATASUM);
- 				btrfs_set_fs_incompat(info, COMPRESS_LZO);
- 				no_compress = 0;
-+			} else if (strcmp(args[0].from, "zstd") == 0) {
-+				compress_type = "zstd";
-+				info->compress_type = BTRFS_COMPRESS_ZSTD;
-+				btrfs_set_opt(info->mount_opt, COMPRESS);
-+				btrfs_clear_opt(info->mount_opt, NODATACOW);
-+				btrfs_clear_opt(info->mount_opt, NODATASUM);
-+				btrfs_set_fs_incompat(info, COMPRESS_ZSTD);
-+				no_compress = 0;
- 			} else if (strncmp(args[0].from, "no", 2) == 0) {
- 				compress_type = "no";
- 				btrfs_clear_opt(info->mount_opt, COMPRESS);
-@@ -1227,8 +1235,10 @@ static int btrfs_show_options(struct seq_file *seq, struct dentry *dentry)
- 	if (btrfs_test_opt(info, COMPRESS)) {
- 		if (info->compress_type == BTRFS_COMPRESS_ZLIB)
- 			compress_type = "zlib";
--		else
-+		else if (info->compress_type == BTRFS_COMPRESS_LZO)
- 			compress_type = "lzo";
-+		else
-+			compress_type = "zstd";
- 		if (btrfs_test_opt(info, FORCE_COMPRESS))
- 			seq_printf(seq, ",compress-force=%s", compress_type);
- 		else
-diff --git a/fs/btrfs/sysfs.c b/fs/btrfs/sysfs.c
-index c2d5f35..2b6d37c 100644
---- a/fs/btrfs/sysfs.c
-+++ b/fs/btrfs/sysfs.c
-@@ -200,6 +200,7 @@ BTRFS_FEAT_ATTR_INCOMPAT(mixed_backref, MIXED_BACKREF);
- BTRFS_FEAT_ATTR_INCOMPAT(default_subvol, DEFAULT_SUBVOL);
- BTRFS_FEAT_ATTR_INCOMPAT(mixed_groups, MIXED_GROUPS);
- BTRFS_FEAT_ATTR_INCOMPAT(compress_lzo, COMPRESS_LZO);
-+BTRFS_FEAT_ATTR_INCOMPAT(compress_zstd, COMPRESS_ZSTD);
- BTRFS_FEAT_ATTR_INCOMPAT(big_metadata, BIG_METADATA);
- BTRFS_FEAT_ATTR_INCOMPAT(extended_iref, EXTENDED_IREF);
- BTRFS_FEAT_ATTR_INCOMPAT(raid56, RAID56);
-@@ -212,6 +213,7 @@ static struct attribute *btrfs_supported_feature_attrs[] = {
- 	BTRFS_FEAT_ATTR_PTR(default_subvol),
- 	BTRFS_FEAT_ATTR_PTR(mixed_groups),
- 	BTRFS_FEAT_ATTR_PTR(compress_lzo),
-+	BTRFS_FEAT_ATTR_PTR(compress_zstd),
- 	BTRFS_FEAT_ATTR_PTR(big_metadata),
- 	BTRFS_FEAT_ATTR_PTR(extended_iref),
- 	BTRFS_FEAT_ATTR_PTR(raid56),
-diff --git a/fs/btrfs/zstd.c b/fs/btrfs/zstd.c
-new file mode 100644
-index 0000000..607ce47
---- /dev/null
-+++ b/fs/btrfs/zstd.c
-@@ -0,0 +1,432 @@
-+/*
-+ * Copyright (c) 2016-present, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This program is free software; you can redistribute it and/or
-+ * modify it under the terms of the GNU General Public
-+ * License v2 as published by the Free Software Foundation.
-+ *
-+ * This program is distributed in the hope that it will be useful,
-+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
-+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-+ * General Public License for more details.
-+ */
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include "compression.h"
-+
-+#define ZSTD_BTRFS_MAX_WINDOWLOG 17
-+#define ZSTD_BTRFS_MAX_INPUT (1 << ZSTD_BTRFS_MAX_WINDOWLOG)
-+#define ZSTD_BTRFS_DEFAULT_LEVEL 3
-+
-+static ZSTD_parameters zstd_get_btrfs_parameters(size_t src_len)
-+{
-+	ZSTD_parameters params = ZSTD_getParams(ZSTD_BTRFS_DEFAULT_LEVEL,
-+						src_len, 0);
-+
-+	if (params.cParams.windowLog > ZSTD_BTRFS_MAX_WINDOWLOG)
-+		params.cParams.windowLog = ZSTD_BTRFS_MAX_WINDOWLOG;
-+	WARN_ON(src_len > ZSTD_BTRFS_MAX_INPUT);
-+	return params;
-+}
-+
-+struct workspace {
-+	void *mem;
-+	size_t size;
-+	char *buf;
-+	struct list_head list;
-+};
-+
-+static void zstd_free_workspace(struct list_head *ws)
-+{
-+	struct workspace *workspace = list_entry(ws, struct workspace, list);
-+
-+	kvfree(workspace->mem);
-+	kfree(workspace->buf);
-+	kfree(workspace);
-+}
-+
-+static struct list_head *zstd_alloc_workspace(void)
-+{
-+	ZSTD_parameters params =
-+			zstd_get_btrfs_parameters(ZSTD_BTRFS_MAX_INPUT);
-+	struct workspace *workspace;
-+
-+	workspace = kzalloc(sizeof(*workspace), GFP_KERNEL);
-+	if (!workspace)
-+		return ERR_PTR(-ENOMEM);
-+
-+	workspace->size = max_t(size_t,
-+			ZSTD_CStreamWorkspaceBound(params.cParams),
-+			ZSTD_DStreamWorkspaceBound(ZSTD_BTRFS_MAX_INPUT));
-+	workspace->mem = kvmalloc(workspace->size, GFP_KERNEL);
-+	workspace->buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
-+	if (!workspace->mem || !workspace->buf)
-+		goto fail;
-+
-+	INIT_LIST_HEAD(&workspace->list);
-+
-+	return &workspace->list;
-+fail:
-+	zstd_free_workspace(&workspace->list);
-+	return ERR_PTR(-ENOMEM);
-+}
-+
-+static int zstd_compress_pages(struct list_head *ws,
-+		struct address_space *mapping,
-+		u64 start,
-+		struct page **pages,
-+		unsigned long *out_pages,
-+		unsigned long *total_in,
-+		unsigned long *total_out)
-+{
-+	struct workspace *workspace = list_entry(ws, struct workspace, list);
-+	ZSTD_CStream *stream;
-+	int ret = 0;
-+	int nr_pages = 0;
-+	struct page *in_page = NULL;  /* The current page to read */
-+	struct page *out_page = NULL; /* The current page to write to */
-+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-+	unsigned long tot_in = 0;
-+	unsigned long tot_out = 0;
-+	unsigned long len = *total_out;
-+	const unsigned long nr_dest_pages = *out_pages;
-+	unsigned long max_out = nr_dest_pages * PAGE_SIZE;
-+	ZSTD_parameters params = zstd_get_btrfs_parameters(len);
-+
-+	*out_pages = 0;
-+	*total_out = 0;
-+	*total_in = 0;
-+
-+	/* Initialize the stream */
-+	stream = ZSTD_initCStream(params, len, workspace->mem,
-+			workspace->size);
-+	if (!stream) {
-+		pr_warn("BTRFS: ZSTD_initCStream failed\n");
-+		ret = -EIO;
-+		goto out;
-+	}
-+
-+	/* map in the first page of input data */
-+	in_page = find_get_page(mapping, start >> PAGE_SHIFT);
-+	in_buf.src = kmap(in_page);
-+	in_buf.pos = 0;
-+	in_buf.size = min_t(size_t, len, PAGE_SIZE);
-+
-+
-+	/* Allocate and map in the output buffer */
-+	out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
-+	if (out_page == NULL) {
-+		ret = -ENOMEM;
-+		goto out;
-+	}
-+	pages[nr_pages++] = out_page;
-+	out_buf.dst = kmap(out_page);
-+	out_buf.pos = 0;
-+	out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
-+
-+	while (1) {
-+		size_t ret2;
-+
-+		ret2 = ZSTD_compressStream(stream, &out_buf, &in_buf);
-+		if (ZSTD_isError(ret2)) {
-+			pr_debug("BTRFS: ZSTD_compressStream returned %d\n",
-+					ZSTD_getErrorCode(ret2));
-+			ret = -EIO;
-+			goto out;
-+		}
-+
-+		/* Check to see if we are making it bigger */
-+		if (tot_in + in_buf.pos > 8192 &&
-+				tot_in + in_buf.pos <
-+				tot_out + out_buf.pos) {
-+			ret = -E2BIG;
-+			goto out;
-+		}
-+
-+		/* We've reached the end of our output range */
-+		if (out_buf.pos >= max_out) {
-+			tot_out += out_buf.pos;
-+			ret = -E2BIG;
-+			goto out;
-+		}
-+
-+		/* Check if we need more output space */
-+		if (out_buf.pos == out_buf.size) {
-+			tot_out += PAGE_SIZE;
-+			max_out -= PAGE_SIZE;
-+			kunmap(out_page);
-+			if (nr_pages == nr_dest_pages) {
-+				out_page = NULL;
-+				ret = -E2BIG;
-+				goto out;
-+			}
-+			out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
-+			if (out_page == NULL) {
-+				ret = -ENOMEM;
-+				goto out;
-+			}
-+			pages[nr_pages++] = out_page;
-+			out_buf.dst = kmap(out_page);
-+			out_buf.pos = 0;
-+			out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
-+		}
-+
-+		/* We've reached the end of the input */
-+		if (in_buf.pos >= len) {
-+			tot_in += in_buf.pos;
-+			break;
-+		}
-+
-+		/* Check if we need more input */
-+		if (in_buf.pos == in_buf.size) {
-+			tot_in += PAGE_SIZE;
-+			kunmap(in_page);
-+			put_page(in_page);
-+
-+			start += PAGE_SIZE;
-+			len -= PAGE_SIZE;
-+			in_page = find_get_page(mapping, start >> PAGE_SHIFT);
-+			in_buf.src = kmap(in_page);
-+			in_buf.pos = 0;
-+			in_buf.size = min_t(size_t, len, PAGE_SIZE);
-+		}
-+	}
-+	while (1) {
-+		size_t ret2;
-+
-+		ret2 = ZSTD_endStream(stream, &out_buf);
-+		if (ZSTD_isError(ret2)) {
-+			pr_debug("BTRFS: ZSTD_endStream returned %d\n",
-+					ZSTD_getErrorCode(ret2));
-+			ret = -EIO;
-+			goto out;
-+		}
-+		if (ret2 == 0) {
-+			tot_out += out_buf.pos;
-+			break;
-+		}
-+		if (out_buf.pos >= max_out) {
-+			tot_out += out_buf.pos;
-+			ret = -E2BIG;
-+			goto out;
-+		}
-+
-+		tot_out += PAGE_SIZE;
-+		max_out -= PAGE_SIZE;
-+		kunmap(out_page);
-+		if (nr_pages == nr_dest_pages) {
-+			out_page = NULL;
-+			ret = -E2BIG;
-+			goto out;
-+		}
-+		out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
-+		if (out_page == NULL) {
-+			ret = -ENOMEM;
-+			goto out;
-+		}
-+		pages[nr_pages++] = out_page;
-+		out_buf.dst = kmap(out_page);
-+		out_buf.pos = 0;
-+		out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
-+	}
-+
-+	if (tot_out >= tot_in) {
-+		ret = -E2BIG;
-+		goto out;
-+	}
-+
-+	ret = 0;
-+	*total_in = tot_in;
-+	*total_out = tot_out;
-+out:
-+	*out_pages = nr_pages;
-+	/* Cleanup */
-+	if (in_page) {
-+		kunmap(in_page);
-+		put_page(in_page);
-+	}
-+	if (out_page)
-+		kunmap(out_page);
-+	return ret;
-+}
-+
-+static int zstd_decompress_bio(struct list_head *ws, struct compressed_bio *cb)
-+{
-+	struct workspace *workspace = list_entry(ws, struct workspace, list);
-+	struct page **pages_in = cb->compressed_pages;
-+	u64 disk_start = cb->start;
-+	struct bio *orig_bio = cb->orig_bio;
-+	size_t srclen = cb->compressed_len;
-+	ZSTD_DStream *stream;
-+	int ret = 0;
-+	unsigned long page_in_index = 0;
-+	unsigned long total_pages_in = DIV_ROUND_UP(srclen, PAGE_SIZE);
-+	unsigned long buf_start;
-+	unsigned long total_out = 0;
-+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-+
-+	stream = ZSTD_initDStream(
-+			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
-+	if (!stream) {
-+		pr_debug("BTRFS: ZSTD_initDStream failed\n");
-+		ret = -EIO;
-+		goto done;
-+	}
-+
-+	in_buf.src = kmap(pages_in[page_in_index]);
-+	in_buf.pos = 0;
-+	in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
-+
-+	out_buf.dst = workspace->buf;
-+	out_buf.pos = 0;
-+	out_buf.size = PAGE_SIZE;
-+
-+	while (1) {
-+		size_t ret2;
-+
-+		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-+		if (ZSTD_isError(ret2)) {
-+			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-+					ZSTD_getErrorCode(ret2));
-+			ret = -EIO;
-+			goto done;
-+		}
-+		buf_start = total_out;
-+		total_out += out_buf.pos;
-+		out_buf.pos = 0;
-+
-+		ret = btrfs_decompress_buf2page(out_buf.dst, buf_start,
-+				total_out, disk_start, orig_bio);
-+		if (ret == 0)
-+			break;
-+
-+		if (in_buf.pos >= srclen)
-+			break;
-+
-+		/* Check if we've hit the end of a frame */
-+		if (ret2 == 0)
-+			break;
-+
-+		if (in_buf.pos == in_buf.size) {
-+			kunmap(pages_in[page_in_index++]);
-+			if (page_in_index >= total_pages_in) {
-+				in_buf.src = NULL;
-+				ret = -EIO;
-+				goto done;
-+			}
-+			srclen -= PAGE_SIZE;
-+			in_buf.src = kmap(pages_in[page_in_index]);
-+			in_buf.pos = 0;
-+			in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
-+		}
-+	}
-+	ret = 0;
-+	zero_fill_bio(orig_bio);
-+done:
-+	if (in_buf.src)
-+		kunmap(pages_in[page_in_index]);
-+	return ret;
-+}
-+
-+static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
-+		struct page *dest_page,
-+		unsigned long start_byte,
-+		size_t srclen, size_t destlen)
-+{
-+	struct workspace *workspace = list_entry(ws, struct workspace, list);
-+	ZSTD_DStream *stream;
-+	int ret = 0;
-+	size_t ret2;
-+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-+	unsigned long total_out = 0;
-+	unsigned long pg_offset = 0;
-+	char *kaddr;
-+
-+	stream = ZSTD_initDStream(
-+			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
-+	if (!stream) {
-+		pr_warn("BTRFS: ZSTD_initDStream failed\n");
-+		ret = -EIO;
-+		goto finish;
-+	}
-+
-+	destlen = min_t(size_t, destlen, PAGE_SIZE);
-+
-+	in_buf.src = data_in;
-+	in_buf.pos = 0;
-+	in_buf.size = srclen;
-+
-+	out_buf.dst = workspace->buf;
-+	out_buf.pos = 0;
-+	out_buf.size = PAGE_SIZE;
-+
-+	ret2 = 1;
-+	while (pg_offset < destlen && in_buf.pos < in_buf.size) {
-+		unsigned long buf_start;
-+		unsigned long buf_offset;
-+		unsigned long bytes;
-+
-+		/* Check if the frame is over and we still need more input */
-+		if (ret2 == 0) {
-+			pr_debug("BTRFS: ZSTD_decompressStream ended early\n");
-+			ret = -EIO;
-+			goto finish;
-+		}
-+		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-+		if (ZSTD_isError(ret2)) {
-+			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-+					ZSTD_getErrorCode(ret2));
-+			ret = -EIO;
-+			goto finish;
-+		}
-+
-+		buf_start = total_out;
-+		total_out += out_buf.pos;
-+		out_buf.pos = 0;
-+
-+		if (total_out <= start_byte)
-+			continue;
-+
-+		if (total_out > start_byte && buf_start < start_byte)
-+			buf_offset = start_byte - buf_start;
-+		else
-+			buf_offset = 0;
-+
-+		bytes = min_t(unsigned long, destlen - pg_offset,
-+				out_buf.size - buf_offset);
-+
-+		kaddr = kmap_atomic(dest_page);
-+		memcpy(kaddr + pg_offset, out_buf.dst + buf_offset, bytes);
-+		kunmap_atomic(kaddr);
-+
-+		pg_offset += bytes;
-+	}
-+	ret = 0;
-+finish:
-+	if (pg_offset < destlen) {
-+		kaddr = kmap_atomic(dest_page);
-+		memset(kaddr + pg_offset, 0, destlen - pg_offset);
-+		kunmap_atomic(kaddr);
-+	}
-+	return ret;
-+}
-+
-+const struct btrfs_compress_op btrfs_zstd_compress = {
-+	.alloc_workspace = zstd_alloc_workspace,
-+	.free_workspace = zstd_free_workspace,
-+	.compress_pages = zstd_compress_pages,
-+	.decompress_bio = zstd_decompress_bio,
-+	.decompress = zstd_decompress,
-+};
-diff --git a/include/uapi/linux/btrfs.h b/include/uapi/linux/btrfs.h
-index 9aa74f3..378230c 100644
---- a/include/uapi/linux/btrfs.h
-+++ b/include/uapi/linux/btrfs.h
-@@ -255,13 +255,7 @@ struct btrfs_ioctl_fs_info_args {
- #define BTRFS_FEATURE_INCOMPAT_DEFAULT_SUBVOL	(1ULL << 1)
- #define BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS	(1ULL << 2)
- #define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO	(1ULL << 3)
--/*
-- * some patches floated around with a second compression method
-- * lets save that incompat here for when they do get in
-- * Note we don't actually support it, we're just reserving the
-- * number
-- */
--#define BTRFS_FEATURE_INCOMPAT_COMPRESS_LZOv2	(1ULL << 4)
-+#define BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD	(1ULL << 4)
-
- /*
-  * older kernels tried to do bigger metadata blocks, but the
---
-2.9.3
diff --git a/priv/zstd/contrib/linux-kernel/0004-squashfs-Add-zstd-support.patch b/priv/zstd/contrib/linux-kernel/0004-squashfs-Add-zstd-support.patch
deleted file mode 100644
index 36cdf71..0000000
--- a/priv/zstd/contrib/linux-kernel/0004-squashfs-Add-zstd-support.patch
+++ /dev/null
@@ -1,306 +0,0 @@
-From 46bf8f6d30d6ddf2446c110f122482b5e5e16933 Mon Sep 17 00:00:00 2001
-From: Sean Purcell 
-Date: Mon, 17 Jul 2017 17:08:59 -0700
-Subject: [PATCH v5 4/5] squashfs: Add zstd support
-
-Add zstd compression and decompression support to SquashFS. zstd is a
-great fit for SquashFS because it can compress at ratios approaching xz,
-while decompressing twice as fast as zlib. For SquashFS in particular,
-it can decompress as fast as lzo and lz4. It also has the flexibility
-to turn down the compression ratio for faster compression times.
-
-The compression benchmark is run on the file tree from the SquashFS archive
-found in ubuntu-16.10-desktop-amd64.iso [1]. It uses `mksquashfs` with the
-default block size (128 KB) and and various compression algorithms/levels.
-xz and zstd are also benchmarked with 256 KB blocks. The decompression
-benchmark times how long it takes to `tar` the file tree into `/dev/null`.
-See the benchmark file in the upstream zstd source repository located under
-`contrib/linux-kernel/squashfs-benchmark.sh` [2] for details.
-
-I ran the benchmarks on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-The VM is running on a MacBook Pro with a 3.1 GHz Intel Core i7 processor,
-16 GB of RAM, and a SSD.
-
-| Method         | Ratio | Compression MB/s | Decompression MB/s |
-|----------------|-------|------------------|--------------------|
-| gzip           |  2.92 |               15 |                128 |
-| lzo            |  2.64 |              9.5 |                217 |
-| lz4            |  2.12 |               94 |                218 |
-| xz             |  3.43 |              5.5 |                 35 |
-| xz 256 KB      |  3.53 |              5.4 |                 40 |
-| zstd 1         |  2.71 |               96 |                210 |
-| zstd 5         |  2.93 |               69 |                198 |
-| zstd 10        |  3.01 |               41 |                225 |
-| zstd 15        |  3.13 |             11.4 |                224 |
-| zstd 16 256 KB |  3.24 |              8.1 |                210 |
-
-This patch was written by Sean Purcell , but I will be
-taking over the submission process.
-
-[1] http://releases.ubuntu.com/16.10/
-[2] https://github.com/facebook/zstd/blob/dev/contrib/linux-kernel/squashfs-benchmark.sh
-
-zstd source repository: https://github.com/facebook/zstd
-
-Signed-off-by: Sean Purcell 
-Signed-off-by: Nick Terrell 
----
-v3 -> v4:
-- Fix minor linter warnings
-
-v4 -> v5:
-- Fix ZSTD_DStream initialization code in squashfs
-- Fix patch documentation to reflect that Sean Purcell is the author
-
- fs/squashfs/Kconfig        |  14 +++++
- fs/squashfs/Makefile       |   1 +
- fs/squashfs/decompressor.c |   7 +++
- fs/squashfs/decompressor.h |   4 ++
- fs/squashfs/squashfs_fs.h  |   1 +
- fs/squashfs/zstd_wrapper.c | 151 +++++++++++++++++++++++++++++++++++++++++++++
- 6 files changed, 178 insertions(+)
- create mode 100644 fs/squashfs/zstd_wrapper.c
-
-diff --git a/fs/squashfs/Kconfig b/fs/squashfs/Kconfig
-index ffb093e..1adb334 100644
---- a/fs/squashfs/Kconfig
-+++ b/fs/squashfs/Kconfig
-@@ -165,6 +165,20 @@ config SQUASHFS_XZ
-
- 	  If unsure, say N.
-
-+config SQUASHFS_ZSTD
-+	bool "Include support for ZSTD compressed file systems"
-+	depends on SQUASHFS
-+	select ZSTD_DECOMPRESS
-+	help
-+	  Saying Y here includes support for reading Squashfs file systems
-+	  compressed with ZSTD compression.  ZSTD gives better compression than
-+	  the default ZLIB compression, while using less CPU.
-+
-+	  ZSTD is not the standard compression used in Squashfs and so most
-+	  file systems will be readable without selecting this option.
-+
-+	  If unsure, say N.
-+
- config SQUASHFS_4K_DEVBLK_SIZE
- 	bool "Use 4K device block size?"
- 	depends on SQUASHFS
-diff --git a/fs/squashfs/Makefile b/fs/squashfs/Makefile
-index 246a6f3..6655631 100644
---- a/fs/squashfs/Makefile
-+++ b/fs/squashfs/Makefile
-@@ -15,3 +15,4 @@ squashfs-$(CONFIG_SQUASHFS_LZ4) += lz4_wrapper.o
- squashfs-$(CONFIG_SQUASHFS_LZO) += lzo_wrapper.o
- squashfs-$(CONFIG_SQUASHFS_XZ) += xz_wrapper.o
- squashfs-$(CONFIG_SQUASHFS_ZLIB) += zlib_wrapper.o
-+squashfs-$(CONFIG_SQUASHFS_ZSTD) += zstd_wrapper.o
-diff --git a/fs/squashfs/decompressor.c b/fs/squashfs/decompressor.c
-index d2bc136..8366398 100644
---- a/fs/squashfs/decompressor.c
-+++ b/fs/squashfs/decompressor.c
-@@ -65,6 +65,12 @@ static const struct squashfs_decompressor squashfs_zlib_comp_ops = {
- };
- #endif
-
-+#ifndef CONFIG_SQUASHFS_ZSTD
-+static const struct squashfs_decompressor squashfs_zstd_comp_ops = {
-+	NULL, NULL, NULL, NULL, ZSTD_COMPRESSION, "zstd", 0
-+};
-+#endif
-+
- static const struct squashfs_decompressor squashfs_unknown_comp_ops = {
- 	NULL, NULL, NULL, NULL, 0, "unknown", 0
- };
-@@ -75,6 +81,7 @@ static const struct squashfs_decompressor *decompressor[] = {
- 	&squashfs_lzo_comp_ops,
- 	&squashfs_xz_comp_ops,
- 	&squashfs_lzma_unsupported_comp_ops,
-+	&squashfs_zstd_comp_ops,
- 	&squashfs_unknown_comp_ops
- };
-
-diff --git a/fs/squashfs/decompressor.h b/fs/squashfs/decompressor.h
-index a25713c..0f5a8e4 100644
---- a/fs/squashfs/decompressor.h
-+++ b/fs/squashfs/decompressor.h
-@@ -58,4 +58,8 @@ extern const struct squashfs_decompressor squashfs_lzo_comp_ops;
- extern const struct squashfs_decompressor squashfs_zlib_comp_ops;
- #endif
-
-+#ifdef CONFIG_SQUASHFS_ZSTD
-+extern const struct squashfs_decompressor squashfs_zstd_comp_ops;
-+#endif
-+
- #endif
-diff --git a/fs/squashfs/squashfs_fs.h b/fs/squashfs/squashfs_fs.h
-index 506f4ba..24d12fd 100644
---- a/fs/squashfs/squashfs_fs.h
-+++ b/fs/squashfs/squashfs_fs.h
-@@ -241,6 +241,7 @@ struct meta_index {
- #define LZO_COMPRESSION		3
- #define XZ_COMPRESSION		4
- #define LZ4_COMPRESSION		5
-+#define ZSTD_COMPRESSION	6
-
- struct squashfs_super_block {
- 	__le32			s_magic;
-diff --git a/fs/squashfs/zstd_wrapper.c b/fs/squashfs/zstd_wrapper.c
-new file mode 100644
-index 0000000..eeaabf8
---- /dev/null
-+++ b/fs/squashfs/zstd_wrapper.c
-@@ -0,0 +1,151 @@
-+/*
-+ * Squashfs - a compressed read only filesystem for Linux
-+ *
-+ * Copyright (c) 2016-present, Facebook, Inc.
-+ * All rights reserved.
-+ *
-+ * This program is free software; you can redistribute it and/or
-+ * modify it under the terms of the GNU General Public License
-+ * as published by the Free Software Foundation; either version 2,
-+ * or (at your option) any later version.
-+ *
-+ * This program is distributed in the hope that it will be useful,
-+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
-+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-+ * GNU General Public License for more details.
-+ *
-+ * zstd_wrapper.c
-+ */
-+
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+
-+#include "squashfs_fs.h"
-+#include "squashfs_fs_sb.h"
-+#include "squashfs.h"
-+#include "decompressor.h"
-+#include "page_actor.h"
-+
-+struct workspace {
-+	void *mem;
-+	size_t mem_size;
-+	size_t window_size;
-+};
-+
-+static void *zstd_init(struct squashfs_sb_info *msblk, void *buff)
-+{
-+	struct workspace *wksp = kmalloc(sizeof(*wksp), GFP_KERNEL);
-+
-+	if (wksp == NULL)
-+		goto failed;
-+	wksp->window_size = max_t(size_t,
-+			msblk->block_size, SQUASHFS_METADATA_SIZE);
-+	wksp->mem_size = ZSTD_DStreamWorkspaceBound(wksp->window_size);
-+	wksp->mem = vmalloc(wksp->mem_size);
-+	if (wksp->mem == NULL)
-+		goto failed;
-+
-+	return wksp;
-+
-+failed:
-+	ERROR("Failed to allocate zstd workspace\n");
-+	kfree(wksp);
-+	return ERR_PTR(-ENOMEM);
-+}
-+
-+
-+static void zstd_free(void *strm)
-+{
-+	struct workspace *wksp = strm;
-+
-+	if (wksp)
-+		vfree(wksp->mem);
-+	kfree(wksp);
-+}
-+
-+
-+static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
-+	struct buffer_head **bh, int b, int offset, int length,
-+	struct squashfs_page_actor *output)
-+{
-+	struct workspace *wksp = strm;
-+	ZSTD_DStream *stream;
-+	size_t total_out = 0;
-+	size_t zstd_err;
-+	int k = 0;
-+	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-+	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-+
-+	stream = ZSTD_initDStream(wksp->window_size, wksp->mem, wksp->mem_size);
-+
-+	if (!stream) {
-+		ERROR("Failed to initialize zstd decompressor\n");
-+		goto out;
-+	}
-+
-+	out_buf.size = PAGE_SIZE;
-+	out_buf.dst = squashfs_first_page(output);
-+
-+	do {
-+		if (in_buf.pos == in_buf.size && k < b) {
-+			int avail = min(length, msblk->devblksize - offset);
-+
-+			length -= avail;
-+			in_buf.src = bh[k]->b_data + offset;
-+			in_buf.size = avail;
-+			in_buf.pos = 0;
-+			offset = 0;
-+		}
-+
-+		if (out_buf.pos == out_buf.size) {
-+			out_buf.dst = squashfs_next_page(output);
-+			if (out_buf.dst == NULL) {
-+				/* Shouldn't run out of pages
-+				 * before stream is done.
-+				 */
-+				squashfs_finish_page(output);
-+				goto out;
-+			}
-+			out_buf.pos = 0;
-+			out_buf.size = PAGE_SIZE;
-+		}
-+
-+		total_out -= out_buf.pos;
-+		zstd_err = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-+		total_out += out_buf.pos; /* add the additional data produced */
-+
-+		if (in_buf.pos == in_buf.size && k < b)
-+			put_bh(bh[k++]);
-+	} while (zstd_err != 0 && !ZSTD_isError(zstd_err));
-+
-+	squashfs_finish_page(output);
-+
-+	if (ZSTD_isError(zstd_err)) {
-+		ERROR("zstd decompression error: %d\n",
-+				(int)ZSTD_getErrorCode(zstd_err));
-+		goto out;
-+	}
-+
-+	if (k < b)
-+		goto out;
-+
-+	return (int)total_out;
-+
-+out:
-+	for (; k < b; k++)
-+		put_bh(bh[k]);
-+
-+	return -EIO;
-+}
-+
-+const struct squashfs_decompressor squashfs_zstd_comp_ops = {
-+	.init = zstd_init,
-+	.free = zstd_free,
-+	.decompress = zstd_uncompress,
-+	.id = ZSTD_COMPRESSION,
-+	.name = "zstd",
-+	.supported = 1
-+};
---
-2.9.3
diff --git a/priv/zstd/contrib/linux-kernel/0005-crypto-Add-zstd-support.patch b/priv/zstd/contrib/linux-kernel/0005-crypto-Add-zstd-support.patch
deleted file mode 100644
index 971b063..0000000
--- a/priv/zstd/contrib/linux-kernel/0005-crypto-Add-zstd-support.patch
+++ /dev/null
@@ -1,424 +0,0 @@
-From 308795a7713ca6fcd468b60fba9a2fca99cee6a0 Mon Sep 17 00:00:00 2001
-From: Nick Terrell 
-Date: Wed, 2 Aug 2017 18:02:13 -0700
-Subject: [PATCH v5 5/5] crypto: Add zstd support
-
-Adds zstd support to crypto and scompress. Only supports the default
-level.
-
-Signed-off-by: Nick Terrell 
----
- crypto/Kconfig   |   9 ++
- crypto/Makefile  |   1 +
- crypto/testmgr.c |  10 +++
- crypto/testmgr.h |  71 +++++++++++++++
- crypto/zstd.c    | 265 +++++++++++++++++++++++++++++++++++++++++++++++++++++++
- 5 files changed, 356 insertions(+)
- create mode 100644 crypto/zstd.c
-
-diff --git a/crypto/Kconfig b/crypto/Kconfig
-index caa770e..4fc3936 100644
---- a/crypto/Kconfig
-+++ b/crypto/Kconfig
-@@ -1662,6 +1662,15 @@ config CRYPTO_LZ4HC
- 	help
- 	  This is the LZ4 high compression mode algorithm.
-
-+config CRYPTO_ZSTD
-+	tristate "Zstd compression algorithm"
-+	select CRYPTO_ALGAPI
-+	select CRYPTO_ACOMP2
-+	select ZSTD_COMPRESS
-+	select ZSTD_DECOMPRESS
-+	help
-+	  This is the zstd algorithm.
-+
- comment "Random Number Generation"
-
- config CRYPTO_ANSI_CPRNG
-diff --git a/crypto/Makefile b/crypto/Makefile
-index d41f033..b22e1e8 100644
---- a/crypto/Makefile
-+++ b/crypto/Makefile
-@@ -133,6 +133,7 @@ obj-$(CONFIG_CRYPTO_USER_API_HASH) += algif_hash.o
- obj-$(CONFIG_CRYPTO_USER_API_SKCIPHER) += algif_skcipher.o
- obj-$(CONFIG_CRYPTO_USER_API_RNG) += algif_rng.o
- obj-$(CONFIG_CRYPTO_USER_API_AEAD) += algif_aead.o
-+obj-$(CONFIG_CRYPTO_ZSTD) += zstd.o
-
- ecdh_generic-y := ecc.o
- ecdh_generic-y += ecdh.o
-diff --git a/crypto/testmgr.c b/crypto/testmgr.c
-index 7125ba3..8a124d3 100644
---- a/crypto/testmgr.c
-+++ b/crypto/testmgr.c
-@@ -3603,6 +3603,16 @@ static const struct alg_test_desc alg_test_descs[] = {
- 				.decomp = __VECS(zlib_deflate_decomp_tv_template)
- 			}
- 		}
-+	}, {
-+		.alg = "zstd",
-+		.test = alg_test_comp,
-+		.fips_allowed = 1,
-+		.suite = {
-+			.comp = {
-+				.comp = __VECS(zstd_comp_tv_template),
-+				.decomp = __VECS(zstd_decomp_tv_template)
-+			}
-+		}
- 	}
- };
-
-diff --git a/crypto/testmgr.h b/crypto/testmgr.h
-index 6ceb0e2..e6b5920 100644
---- a/crypto/testmgr.h
-+++ b/crypto/testmgr.h
-@@ -34631,4 +34631,75 @@ static const struct comp_testvec lz4hc_decomp_tv_template[] = {
- 	},
- };
-
-+static const struct comp_testvec zstd_comp_tv_template[] = {
-+	{
-+		.inlen	= 68,
-+		.outlen	= 39,
-+		.input	= "The algorithm is zstd. "
-+			  "The algorithm is zstd. "
-+			  "The algorithm is zstd.",
-+		.output	= "\x28\xb5\x2f\xfd\x00\x50\xf5\x00\x00\xb8\x54\x68\x65"
-+			  "\x20\x61\x6c\x67\x6f\x72\x69\x74\x68\x6d\x20\x69\x73"
-+			  "\x20\x7a\x73\x74\x64\x2e\x20\x01\x00\x55\x73\x36\x01"
-+			  ,
-+	},
-+	{
-+		.inlen	= 244,
-+		.outlen	= 151,
-+		.input	= "zstd, short for Zstandard, is a fast lossless "
-+			  "compression algorithm, targeting real-time "
-+			  "compression scenarios at zlib-level and better "
-+			  "compression ratios. The zstd compression library "
-+			  "provides in-memory compression and decompression "
-+			  "functions.",
-+		.output	= "\x28\xb5\x2f\xfd\x00\x50\x75\x04\x00\x42\x4b\x1e\x17"
-+			  "\x90\x81\x31\x00\xf2\x2f\xe4\x36\xc9\xef\x92\x88\x32"
-+			  "\xc9\xf2\x24\x94\xd8\x68\x9a\x0f\x00\x0c\xc4\x31\x6f"
-+			  "\x0d\x0c\x38\xac\x5c\x48\x03\xcd\x63\x67\xc0\xf3\xad"
-+			  "\x4e\x90\xaa\x78\xa0\xa4\xc5\x99\xda\x2f\xb6\x24\x60"
-+			  "\xe2\x79\x4b\xaa\xb6\x6b\x85\x0b\xc9\xc6\x04\x66\x86"
-+			  "\xe2\xcc\xe2\x25\x3f\x4f\x09\xcd\xb8\x9d\xdb\xc1\x90"
-+			  "\xa9\x11\xbc\x35\x44\x69\x2d\x9c\x64\x4f\x13\x31\x64"
-+			  "\xcc\xfb\x4d\x95\x93\x86\x7f\x33\x7f\x1a\xef\xe9\x30"
-+			  "\xf9\x67\xa1\x94\x0a\x69\x0f\x60\xcd\xc3\xab\x99\xdc"
-+			  "\x42\xed\x97\x05\x00\x33\xc3\x15\x95\x3a\x06\xa0\x0e"
-+			  "\x20\xa9\x0e\x82\xb9\x43\x45\x01",
-+	},
-+};
-+
-+static const struct comp_testvec zstd_decomp_tv_template[] = {
-+	{
-+		.inlen	= 43,
-+		.outlen	= 68,
-+		.input	= "\x28\xb5\x2f\xfd\x04\x50\xf5\x00\x00\xb8\x54\x68\x65"
-+			  "\x20\x61\x6c\x67\x6f\x72\x69\x74\x68\x6d\x20\x69\x73"
-+			  "\x20\x7a\x73\x74\x64\x2e\x20\x01\x00\x55\x73\x36\x01"
-+			  "\x6b\xf4\x13\x35",
-+		.output	= "The algorithm is zstd. "
-+			  "The algorithm is zstd. "
-+			  "The algorithm is zstd.",
-+	},
-+	{
-+		.inlen	= 155,
-+		.outlen	= 244,
-+		.input	= "\x28\xb5\x2f\xfd\x04\x50\x75\x04\x00\x42\x4b\x1e\x17"
-+			  "\x90\x81\x31\x00\xf2\x2f\xe4\x36\xc9\xef\x92\x88\x32"
-+			  "\xc9\xf2\x24\x94\xd8\x68\x9a\x0f\x00\x0c\xc4\x31\x6f"
-+			  "\x0d\x0c\x38\xac\x5c\x48\x03\xcd\x63\x67\xc0\xf3\xad"
-+			  "\x4e\x90\xaa\x78\xa0\xa4\xc5\x99\xda\x2f\xb6\x24\x60"
-+			  "\xe2\x79\x4b\xaa\xb6\x6b\x85\x0b\xc9\xc6\x04\x66\x86"
-+			  "\xe2\xcc\xe2\x25\x3f\x4f\x09\xcd\xb8\x9d\xdb\xc1\x90"
-+			  "\xa9\x11\xbc\x35\x44\x69\x2d\x9c\x64\x4f\x13\x31\x64"
-+			  "\xcc\xfb\x4d\x95\x93\x86\x7f\x33\x7f\x1a\xef\xe9\x30"
-+			  "\xf9\x67\xa1\x94\x0a\x69\x0f\x60\xcd\xc3\xab\x99\xdc"
-+			  "\x42\xed\x97\x05\x00\x33\xc3\x15\x95\x3a\x06\xa0\x0e"
-+			  "\x20\xa9\x0e\x82\xb9\x43\x45\x01\xaa\x6d\xda\x0d",
-+		.output	= "zstd, short for Zstandard, is a fast lossless "
-+			  "compression algorithm, targeting real-time "
-+			  "compression scenarios at zlib-level and better "
-+			  "compression ratios. The zstd compression library "
-+			  "provides in-memory compression and decompression "
-+			  "functions.",
-+	},
-+};
- #endif	/* _CRYPTO_TESTMGR_H */
-diff --git a/crypto/zstd.c b/crypto/zstd.c
-new file mode 100644
-index 0000000..9a76b3e
---- /dev/null
-+++ b/crypto/zstd.c
-@@ -0,0 +1,265 @@
-+/*
-+ * Cryptographic API.
-+ *
-+ * Copyright (c) 2017-present, Facebook, Inc.
-+ *
-+ * This program is free software; you can redistribute it and/or modify it
-+ * under the terms of the GNU General Public License version 2 as published by
-+ * the Free Software Foundation.
-+ *
-+ * This program is distributed in the hope that it will be useful, but WITHOUT
-+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
-+ * more details.
-+ */
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+
-+
-+#define ZSTD_DEF_LEVEL	3
-+
-+struct zstd_ctx {
-+	ZSTD_CCtx *cctx;
-+	ZSTD_DCtx *dctx;
-+	void *cwksp;
-+	void *dwksp;
-+};
-+
-+static ZSTD_parameters zstd_params(void)
-+{
-+	return ZSTD_getParams(ZSTD_DEF_LEVEL, 0, 0);
-+}
-+
-+static int zstd_comp_init(struct zstd_ctx *ctx)
-+{
-+	int ret = 0;
-+	const ZSTD_parameters params = zstd_params();
-+	const size_t wksp_size = ZSTD_CCtxWorkspaceBound(params.cParams);
-+
-+	ctx->cwksp = vzalloc(wksp_size);
-+	if (!ctx->cwksp) {
-+		ret = -ENOMEM;
-+		goto out;
-+	}
-+
-+	ctx->cctx = ZSTD_initCCtx(ctx->cwksp, wksp_size);
-+	if (!ctx->cctx) {
-+		ret = -EINVAL;
-+		goto out_free;
-+	}
-+out:
-+	return ret;
-+out_free:
-+	vfree(ctx->cwksp);
-+	goto out;
-+}
-+
-+static int zstd_decomp_init(struct zstd_ctx *ctx)
-+{
-+	int ret = 0;
-+	const size_t wksp_size = ZSTD_DCtxWorkspaceBound();
-+
-+	ctx->dwksp = vzalloc(wksp_size);
-+	if (!ctx->dwksp) {
-+		ret = -ENOMEM;
-+		goto out;
-+	}
-+
-+	ctx->dctx = ZSTD_initDCtx(ctx->dwksp, wksp_size);
-+	if (!ctx->dctx) {
-+		ret = -EINVAL;
-+		goto out_free;
-+	}
-+out:
-+	return ret;
-+out_free:
-+	vfree(ctx->dwksp);
-+	goto out;
-+}
-+
-+static void zstd_comp_exit(struct zstd_ctx *ctx)
-+{
-+	vfree(ctx->cwksp);
-+	ctx->cwksp = NULL;
-+	ctx->cctx = NULL;
-+}
-+
-+static void zstd_decomp_exit(struct zstd_ctx *ctx)
-+{
-+	vfree(ctx->dwksp);
-+	ctx->dwksp = NULL;
-+	ctx->dctx = NULL;
-+}
-+
-+static int __zstd_init(void *ctx)
-+{
-+	int ret;
-+
-+	ret = zstd_comp_init(ctx);
-+	if (ret)
-+		return ret;
-+	ret = zstd_decomp_init(ctx);
-+	if (ret)
-+		zstd_comp_exit(ctx);
-+	return ret;
-+}
-+
-+static void *zstd_alloc_ctx(struct crypto_scomp *tfm)
-+{
-+	int ret;
-+	struct zstd_ctx *ctx;
-+
-+	ctx = kzalloc(sizeof(*ctx), GFP_KERNEL);
-+	if (!ctx)
-+		return ERR_PTR(-ENOMEM);
-+
-+	ret = __zstd_init(ctx);
-+	if (ret) {
-+		kfree(ctx);
-+		return ERR_PTR(ret);
-+	}
-+
-+	return ctx;
-+}
-+
-+static int zstd_init(struct crypto_tfm *tfm)
-+{
-+	struct zstd_ctx *ctx = crypto_tfm_ctx(tfm);
-+
-+	return __zstd_init(ctx);
-+}
-+
-+static void __zstd_exit(void *ctx)
-+{
-+	zstd_comp_exit(ctx);
-+	zstd_decomp_exit(ctx);
-+}
-+
-+static void zstd_free_ctx(struct crypto_scomp *tfm, void *ctx)
-+{
-+	__zstd_exit(ctx);
-+	kzfree(ctx);
-+}
-+
-+static void zstd_exit(struct crypto_tfm *tfm)
-+{
-+	struct zstd_ctx *ctx = crypto_tfm_ctx(tfm);
-+
-+	__zstd_exit(ctx);
-+}
-+
-+static int __zstd_compress(const u8 *src, unsigned int slen,
-+			   u8 *dst, unsigned int *dlen, void *ctx)
-+{
-+	size_t out_len;
-+	struct zstd_ctx *zctx = ctx;
-+	const ZSTD_parameters params = zstd_params();
-+
-+	out_len = ZSTD_compressCCtx(zctx->cctx, dst, *dlen, src, slen, params);
-+	if (ZSTD_isError(out_len))
-+		return -EINVAL;
-+	*dlen = out_len;
-+	return 0;
-+}
-+
-+static int zstd_compress(struct crypto_tfm *tfm, const u8 *src,
-+			 unsigned int slen, u8 *dst, unsigned int *dlen)
-+{
-+	struct zstd_ctx *ctx = crypto_tfm_ctx(tfm);
-+
-+	return __zstd_compress(src, slen, dst, dlen, ctx);
-+}
-+
-+static int zstd_scompress(struct crypto_scomp *tfm, const u8 *src,
-+			  unsigned int slen, u8 *dst, unsigned int *dlen,
-+			  void *ctx)
-+{
-+	return __zstd_compress(src, slen, dst, dlen, ctx);
-+}
-+
-+static int __zstd_decompress(const u8 *src, unsigned int slen,
-+			     u8 *dst, unsigned int *dlen, void *ctx)
-+{
-+	size_t out_len;
-+	struct zstd_ctx *zctx = ctx;
-+
-+	out_len = ZSTD_decompressDCtx(zctx->dctx, dst, *dlen, src, slen);
-+	if (ZSTD_isError(out_len))
-+		return -EINVAL;
-+	*dlen = out_len;
-+	return 0;
-+}
-+
-+static int zstd_decompress(struct crypto_tfm *tfm, const u8 *src,
-+			   unsigned int slen, u8 *dst, unsigned int *dlen)
-+{
-+	struct zstd_ctx *ctx = crypto_tfm_ctx(tfm);
-+
-+	return __zstd_decompress(src, slen, dst, dlen, ctx);
-+}
-+
-+static int zstd_sdecompress(struct crypto_scomp *tfm, const u8 *src,
-+			    unsigned int slen, u8 *dst, unsigned int *dlen,
-+			    void *ctx)
-+{
-+	return __zstd_decompress(src, slen, dst, dlen, ctx);
-+}
-+
-+static struct crypto_alg alg = {
-+	.cra_name		= "zstd",
-+	.cra_flags		= CRYPTO_ALG_TYPE_COMPRESS,
-+	.cra_ctxsize		= sizeof(struct zstd_ctx),
-+	.cra_module		= THIS_MODULE,
-+	.cra_init		= zstd_init,
-+	.cra_exit		= zstd_exit,
-+	.cra_u			= { .compress = {
-+	.coa_compress		= zstd_compress,
-+	.coa_decompress		= zstd_decompress } }
-+};
-+
-+static struct scomp_alg scomp = {
-+	.alloc_ctx		= zstd_alloc_ctx,
-+	.free_ctx		= zstd_free_ctx,
-+	.compress		= zstd_scompress,
-+	.decompress		= zstd_sdecompress,
-+	.base			= {
-+		.cra_name	= "zstd",
-+		.cra_driver_name = "zstd-scomp",
-+		.cra_module	 = THIS_MODULE,
-+	}
-+};
-+
-+static int __init zstd_mod_init(void)
-+{
-+	int ret;
-+
-+	ret = crypto_register_alg(&alg);
-+	if (ret)
-+		return ret;
-+
-+	ret = crypto_register_scomp(&scomp);
-+	if (ret)
-+		crypto_unregister_alg(&alg);
-+
-+	return ret;
-+}
-+
-+static void __exit zstd_mod_fini(void)
-+{
-+	crypto_unregister_alg(&alg);
-+	crypto_unregister_scomp(&scomp);
-+}
-+
-+module_init(zstd_mod_init);
-+module_exit(zstd_mod_fini);
-+
-+MODULE_LICENSE("GPL");
-+MODULE_DESCRIPTION("Zstd Compression Algorithm");
-+MODULE_ALIAS_CRYPTO("zstd");
---
-2.9.3
diff --git a/priv/zstd/contrib/linux-kernel/0006-squashfs-tools-Add-zstd-support.patch b/priv/zstd/contrib/linux-kernel/0006-squashfs-tools-Add-zstd-support.patch
deleted file mode 100644
index ca638f2..0000000
--- a/priv/zstd/contrib/linux-kernel/0006-squashfs-tools-Add-zstd-support.patch
+++ /dev/null
@@ -1,420 +0,0 @@
-From 57a3cf95b276946559f9e044c7352c11303bb9c1 Mon Sep 17 00:00:00 2001
-From: Sean Purcell 
-Date: Thu, 3 Aug 2017 17:47:03 -0700
-Subject: [PATCH v6] squashfs-tools: Add zstd support
-
-This patch adds zstd support to squashfs-tools. It works with zstd
-versions >= 1.0.0. It was originally written by Sean Purcell.
-
-Signed-off-by: Sean Purcell 
-Signed-off-by: Nick Terrell 
----
-v4 -> v5:
-- Fix patch documentation to reflect that Sean Purcell is the author
-- Don't strip trailing whitespace of unreleated code
-- Make zstd_display_options() static
-
-v5 -> v6:
-- Fix build instructions in Makefile
-
- squashfs-tools/Makefile       |  20 ++++
- squashfs-tools/compressor.c   |   8 ++
- squashfs-tools/squashfs_fs.h  |   1 +
- squashfs-tools/zstd_wrapper.c | 254 ++++++++++++++++++++++++++++++++++++++++++
- squashfs-tools/zstd_wrapper.h |  48 ++++++++
- 5 files changed, 331 insertions(+)
- create mode 100644 squashfs-tools/zstd_wrapper.c
- create mode 100644 squashfs-tools/zstd_wrapper.h
-
-diff --git a/squashfs-tools/Makefile b/squashfs-tools/Makefile
-index 52d2582..22fc559 100644
---- a/squashfs-tools/Makefile
-+++ b/squashfs-tools/Makefile
-@@ -75,6 +75,18 @@ GZIP_SUPPORT = 1
- #LZMA_SUPPORT = 1
- #LZMA_DIR = ../../../../LZMA/lzma465
-
-+
-+########### Building ZSTD support ############
-+#
-+# The ZSTD library is supported
-+# ZSTD homepage: http://zstd.net
-+# ZSTD source repository: https://github.com/facebook/zstd
-+#
-+# To build using the ZSTD library - install the library and uncomment the
-+# ZSTD_SUPPORT line below.
-+#
-+#ZSTD_SUPPORT = 1
-+
- ######## Specifying default compression ########
- #
- # The next line specifies which compression algorithm is used by default
-@@ -177,6 +189,14 @@ LIBS += -llz4
- COMPRESSORS += lz4
- endif
-
-+ifeq ($(ZSTD_SUPPORT),1)
-+CFLAGS += -DZSTD_SUPPORT
-+MKSQUASHFS_OBJS += zstd_wrapper.o
-+UNSQUASHFS_OBJS += zstd_wrapper.o
-+LIBS += -lzstd
-+COMPRESSORS += zstd
-+endif
-+
- ifeq ($(XATTR_SUPPORT),1)
- ifeq ($(XATTR_DEFAULT),1)
- CFLAGS += -DXATTR_SUPPORT -DXATTR_DEFAULT
-diff --git a/squashfs-tools/compressor.c b/squashfs-tools/compressor.c
-index 525e316..02b5e90 100644
---- a/squashfs-tools/compressor.c
-+++ b/squashfs-tools/compressor.c
-@@ -65,6 +65,13 @@ static struct compressor xz_comp_ops = {
- extern struct compressor xz_comp_ops;
- #endif
-
-+#ifndef ZSTD_SUPPORT
-+static struct compressor zstd_comp_ops = {
-+	ZSTD_COMPRESSION, "zstd"
-+};
-+#else
-+extern struct compressor zstd_comp_ops;
-+#endif
-
- static struct compressor unknown_comp_ops = {
- 	0, "unknown"
-@@ -77,6 +84,7 @@ struct compressor *compressor[] = {
- 	&lzo_comp_ops,
- 	&lz4_comp_ops,
- 	&xz_comp_ops,
-+	&zstd_comp_ops,
- 	&unknown_comp_ops
- };
-
-diff --git a/squashfs-tools/squashfs_fs.h b/squashfs-tools/squashfs_fs.h
-index 791fe12..afca918 100644
---- a/squashfs-tools/squashfs_fs.h
-+++ b/squashfs-tools/squashfs_fs.h
-@@ -277,6 +277,7 @@ typedef long long		squashfs_inode;
- #define LZO_COMPRESSION		3
- #define XZ_COMPRESSION		4
- #define LZ4_COMPRESSION		5
-+#define ZSTD_COMPRESSION	6
-
- struct squashfs_super_block {
- 	unsigned int		s_magic;
-diff --git a/squashfs-tools/zstd_wrapper.c b/squashfs-tools/zstd_wrapper.c
-new file mode 100644
-index 0000000..dcab75a
---- /dev/null
-+++ b/squashfs-tools/zstd_wrapper.c
-@@ -0,0 +1,254 @@
-+/*
-+ * Copyright (c) 2017
-+ * Phillip Lougher 
-+ *
-+ * This program is free software; you can redistribute it and/or
-+ * modify it under the terms of the GNU General Public License
-+ * as published by the Free Software Foundation; either version 2,
-+ * or (at your option) any later version.
-+ *
-+ * This program is distributed in the hope that it will be useful,
-+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
-+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-+ * GNU General Public License for more details.
-+ *
-+ * zstd_wrapper.c
-+ *
-+ * Support for ZSTD compression http://zstd.net
-+ */
-+
-+#include 
-+#include 
-+#include 
-+#include 
-+#include 
-+
-+#include "squashfs_fs.h"
-+#include "zstd_wrapper.h"
-+#include "compressor.h"
-+
-+static int compression_level = ZSTD_DEFAULT_COMPRESSION_LEVEL;
-+
-+/*
-+ * This function is called by the options parsing code in mksquashfs.c
-+ * to parse any -X compressor option.
-+ *
-+ * This function returns:
-+ *	>=0 (number of additional args parsed) on success
-+ *	-1 if the option was unrecognised, or
-+ *	-2 if the option was recognised, but otherwise bad in
-+ *	   some way (e.g. invalid parameter)
-+ *
-+ * Note: this function sets internal compressor state, but does not
-+ * pass back the results of the parsing other than success/failure.
-+ * The zstd_dump_options() function is called later to get the options in
-+ * a format suitable for writing to the filesystem.
-+ */
-+static int zstd_options(char *argv[], int argc)
-+{
-+	if (strcmp(argv[0], "-Xcompression-level") == 0) {
-+		if (argc < 2) {
-+			fprintf(stderr, "zstd: -Xcompression-level missing "
-+				"compression level\n");
-+			fprintf(stderr, "zstd: -Xcompression-level it should "
-+				"be 1 <= n <= %d\n", ZSTD_maxCLevel());
-+			goto failed;
-+		}
-+
-+		compression_level = atoi(argv[1]);
-+		if (compression_level < 1 ||
-+		    compression_level > ZSTD_maxCLevel()) {
-+			fprintf(stderr, "zstd: -Xcompression-level invalid, it "
-+				"should be 1 <= n <= %d\n", ZSTD_maxCLevel());
-+			goto failed;
-+		}
-+
-+		return 1;
-+	}
-+
-+	return -1;
-+failed:
-+	return -2;
-+}
-+
-+/*
-+ * This function is called by mksquashfs to dump the parsed
-+ * compressor options in a format suitable for writing to the
-+ * compressor options field in the filesystem (stored immediately
-+ * after the superblock).
-+ *
-+ * This function returns a pointer to the compression options structure
-+ * to be stored (and the size), or NULL if there are no compression
-+ * options.
-+ */
-+static void *zstd_dump_options(int block_size, int *size)
-+{
-+	static struct zstd_comp_opts comp_opts;
-+
-+	/* don't return anything if the options are all default */
-+	if (compression_level == ZSTD_DEFAULT_COMPRESSION_LEVEL)
-+		return NULL;
-+
-+	comp_opts.compression_level = compression_level;
-+
-+	SQUASHFS_INSWAP_COMP_OPTS(&comp_opts);
-+
-+	*size = sizeof(comp_opts);
-+	return &comp_opts;
-+}
-+
-+/*
-+ * This function is a helper specifically for the append mode of
-+ * mksquashfs.  Its purpose is to set the internal compressor state
-+ * to the stored compressor options in the passed compressor options
-+ * structure.
-+ *
-+ * In effect this function sets up the compressor options
-+ * to the same state they were when the filesystem was originally
-+ * generated, this is to ensure on appending, the compressor uses
-+ * the same compression options that were used to generate the
-+ * original filesystem.
-+ *
-+ * Note, even if there are no compressor options, this function is still
-+ * called with an empty compressor structure (size == 0), to explicitly
-+ * set the default options, this is to ensure any user supplied
-+ * -X options on the appending mksquashfs command line are over-ridden.
-+ *
-+ * This function returns 0 on sucessful extraction of options, and -1 on error.
-+ */
-+static int zstd_extract_options(int block_size, void *buffer, int size)
-+{
-+	struct zstd_comp_opts *comp_opts = buffer;
-+
-+	if (size == 0) {
-+		/* Set default values */
-+		compression_level = ZSTD_DEFAULT_COMPRESSION_LEVEL;
-+		return 0;
-+	}
-+
-+	/* we expect a comp_opts structure of sufficient size to be present */
-+	if (size < sizeof(*comp_opts))
-+		goto failed;
-+
-+	SQUASHFS_INSWAP_COMP_OPTS(comp_opts);
-+
-+	if (comp_opts->compression_level < 1 ||
-+	    comp_opts->compression_level > ZSTD_maxCLevel()) {
-+		fprintf(stderr, "zstd: bad compression level in compression "
-+			"options structure\n");
-+		goto failed;
-+	}
-+
-+	compression_level = comp_opts->compression_level;
-+
-+	return 0;
-+
-+failed:
-+	fprintf(stderr, "zstd: error reading stored compressor options from "
-+		"filesystem!\n");
-+
-+	return -1;
-+}
-+
-+static void zstd_display_options(void *buffer, int size)
-+{
-+	struct zstd_comp_opts *comp_opts = buffer;
-+
-+	/* we expect a comp_opts structure of sufficient size to be present */
-+	if (size < sizeof(*comp_opts))
-+		goto failed;
-+
-+	SQUASHFS_INSWAP_COMP_OPTS(comp_opts);
-+
-+	if (comp_opts->compression_level < 1 ||
-+	    comp_opts->compression_level > ZSTD_maxCLevel()) {
-+		fprintf(stderr, "zstd: bad compression level in compression "
-+			"options structure\n");
-+		goto failed;
-+	}
-+
-+	printf("\tcompression-level %d\n", comp_opts->compression_level);
-+
-+	return;
-+
-+failed:
-+	fprintf(stderr, "zstd: error reading stored compressor options from "
-+		"filesystem!\n");
-+}
-+
-+/*
-+ * This function is called by mksquashfs to initialise the
-+ * compressor, before compress() is called.
-+ *
-+ * This function returns 0 on success, and -1 on error.
-+ */
-+static int zstd_init(void **strm, int block_size, int datablock)
-+{
-+	ZSTD_CCtx *cctx = ZSTD_createCCtx();
-+
-+	if (!cctx) {
-+		fprintf(stderr, "zstd: failed to allocate compression "
-+			"context!\n");
-+		return -1;
-+	}
-+
-+	*strm = cctx;
-+	return 0;
-+}
-+
-+static int zstd_compress(void *strm, void *dest, void *src, int size,
-+			 int block_size, int *error)
-+{
-+	const size_t res = ZSTD_compressCCtx((ZSTD_CCtx*)strm, dest, block_size,
-+					     src, size, compression_level);
-+
-+	if (ZSTD_isError(res)) {
-+		/* FIXME:
-+		 * zstd does not expose stable error codes. The error enum may
-+		 * change between versions. Until upstream zstd stablizes the
-+		 * error codes, we have no way of knowing why the error occurs.
-+		 * zstd shouldn't fail to compress any input unless there isn't
-+		 * enough output space. We assume that is the cause and return
-+		 * the special error code for not enough output space.
-+		 */
-+		return 0;
-+	}
-+
-+	return (int)res;
-+}
-+
-+static int zstd_uncompress(void *dest, void *src, int size, int outsize,
-+			   int *error)
-+{
-+	const size_t res = ZSTD_decompress(dest, outsize, src, size);
-+
-+	if (ZSTD_isError(res)) {
-+		fprintf(stderr, "\t%d %d\n", outsize, size);
-+
-+		*error = (int)ZSTD_getErrorCode(res);
-+		return -1;
-+	}
-+
-+	return (int)res;
-+}
-+
-+static void zstd_usage(void)
-+{
-+	fprintf(stderr, "\t  -Xcompression-level \n");
-+	fprintf(stderr, "\t\t should be 1 .. %d (default "
-+		"%d)\n", ZSTD_maxCLevel(), ZSTD_DEFAULT_COMPRESSION_LEVEL);
-+}
-+
-+struct compressor zstd_comp_ops = {
-+	.init = zstd_init,
-+	.compress = zstd_compress,
-+	.uncompress = zstd_uncompress,
-+	.options = zstd_options,
-+	.dump_options = zstd_dump_options,
-+	.extract_options = zstd_extract_options,
-+	.display_options = zstd_display_options,
-+	.usage = zstd_usage,
-+	.id = ZSTD_COMPRESSION,
-+	.name = "zstd",
-+	.supported = 1
-+};
-diff --git a/squashfs-tools/zstd_wrapper.h b/squashfs-tools/zstd_wrapper.h
-new file mode 100644
-index 0000000..4fbef0a
---- /dev/null
-+++ b/squashfs-tools/zstd_wrapper.h
-@@ -0,0 +1,48 @@
-+#ifndef ZSTD_WRAPPER_H
-+#define ZSTD_WRAPPER_H
-+/*
-+ * Squashfs
-+ *
-+ * Copyright (c) 2017
-+ * Phillip Lougher 
-+ *
-+ * This program is free software; you can redistribute it and/or
-+ * modify it under the terms of the GNU General Public License
-+ * as published by the Free Software Foundation; either version 2,
-+ * or (at your option) any later version.
-+ *
-+ * This program is distributed in the hope that it will be useful,
-+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
-+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-+ * GNU General Public License for more details.
-+ *
-+ * zstd_wrapper.h
-+ *
-+ */
-+
-+#ifndef linux
-+#define __BYTE_ORDER BYTE_ORDER
-+#define __BIG_ENDIAN BIG_ENDIAN
-+#define __LITTLE_ENDIAN LITTLE_ENDIAN
-+#else
-+#include 
-+#endif
-+
-+#if __BYTE_ORDER == __BIG_ENDIAN
-+extern unsigned int inswap_le16(unsigned short);
-+extern unsigned int inswap_le32(unsigned int);
-+
-+#define SQUASHFS_INSWAP_COMP_OPTS(s) { \
-+	(s)->compression_level = inswap_le32((s)->compression_level); \
-+}
-+#else
-+#define SQUASHFS_INSWAP_COMP_OPTS(s)
-+#endif
-+
-+/* Default compression */
-+#define ZSTD_DEFAULT_COMPRESSION_LEVEL 15
-+
-+struct zstd_comp_opts {
-+	int compression_level;
-+};
-+#endif
---
-2.9.5
diff --git a/priv/zstd/contrib/linux-kernel/COPYING b/priv/zstd/contrib/linux-kernel/COPYING
deleted file mode 100644
index ecbc059..0000000
--- a/priv/zstd/contrib/linux-kernel/COPYING
+++ /dev/null
@@ -1,339 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
- 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Lesser General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-                            NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    
-    Copyright (C)   
-
-    This program is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License along
-    with this program; if not, write to the Free Software Foundation, Inc.,
-    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  , 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.
\ No newline at end of file
diff --git a/priv/zstd/contrib/linux-kernel/README.md b/priv/zstd/contrib/linux-kernel/README.md
deleted file mode 100644
index 86552b8..0000000
--- a/priv/zstd/contrib/linux-kernel/README.md
+++ /dev/null
@@ -1,101 +0,0 @@
-# Linux Kernel Patch
-
-There are four pieces, the `xxhash` kernel module, the `zstd_compress` and `zstd_decompress` kernel modules, the BtrFS patch, and the SquashFS patch.
-The patches are based off of the linux kernel master branch.
-
-## xxHash kernel module
-
-* The patch is located in `xxhash.diff`.
-* The header is in `include/linux/xxhash.h`.
-* The source is in `lib/xxhash.c`.
-* `test/XXHashUserLandTest.cpp` contains tests for the patch in userland by mocking the kernel headers.
-  I tested the tests by commenting a line of of each branch in `xxhash.c` one line at a time, and made sure the tests failed.
-  It can be run with the following commands:
-  ```
-  cd test && make googletest && make XXHashUserLandTest && ./XXHashUserLandTest
-  ```
-* I also benchmarked the `xxhash` module against upstream xxHash, and made sure that they ran at the same speed.
-
-## Zstd Kernel modules
-
-* The (large) patch is located in `zstd.diff`, which depends on `xxhash.diff`.
-* The header is in `include/linux/zstd.h`.
-* It is split up into `zstd_compress` and `zstd_decompress`, which can be loaded independently.
-* Source files are in `lib/zstd/`.
-* `lib/Kconfig` and `lib/Makefile` need to be modified by applying `lib/Kconfig.diff` and `lib/Makefile.diff` respectively.
-  These changes are also included in the `zstd.diff`.
-* `test/UserlandTest.cpp` contains tests for the patch in userland by mocking the kernel headers.
-  It can be run with the following commands:
-  ```
-  cd test && make googletest && make UserlandTest && ./UserlandTest
-  ```
-
-## BtrFS
-
-* The patch is located in `btrfs.diff`.
-* Additionally `fs/btrfs/zstd.c` is provided as a source for convenience.
-* The patch seems to be working, it doesn't crash the kernel, and compresses at speeds and ratios that are expected.
-  It could still use some more testing for fringe features, like printing options.
-
-### Benchmarks
-
-Benchmarks run on a Ubuntu 14.04 with 2 cores and 4 GiB of RAM.
-The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor,
-16 GB of ram, and a SSD.
-The kernel running was built from the master branch with the patch.
-
-The compression benchmark is copying 10 copies of the
-unzipped [silesia corpus](http://mattmahoney.net/dc/silesia.html) into a BtrFS
-filesystem mounted with `-o compress-force={none, lzo, zlib, zstd}`.
-The decompression benchmark is timing how long it takes to `tar` all 10 copies
-into `/dev/null`.
-The compression ratio is measured by comparing the output of `df` and `du`.
-See `btrfs-benchmark.sh` for details.
-
-| Algorithm | Compression ratio | Compression speed | Decompression speed |
-|-----------|-------------------|-------------------|---------------------|
-| None      | 0.99              | 504 MB/s          | 686 MB/s            |
-| lzo       | 1.66              | 398 MB/s          | 442 MB/s            |
-| zlib      | 2.58              | 65 MB/s           | 241 MB/s            |
-| zstd 1    | 2.57              | 260 MB/s          | 383 MB/s            |
-| zstd 3    | 2.71              | 174 MB/s          | 408 MB/s            |
-| zstd 6    | 2.87              | 70 MB/s           | 398 MB/s            |
-| zstd 9    | 2.92              | 43 MB/s           | 406 MB/s            |
-| zstd 12   | 2.93              | 21 MB/s           | 408 MB/s            |
-| zstd 15   | 3.01              | 11 MB/s           | 354 MB/s            |
-
-
-## SquashFS
-
-* The patch is located in `squashfs.diff`
-* Additionally `fs/squashfs/zstd_wrapper.c` is provided as a source for convenience.
-* The patch has been tested on the master branch of the kernel.
-
-### Benchmarks
-
-Benchmarks run on a Ubuntu 14.04 with 2 cores and 4 GiB of RAM.
-The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor,
-16 GB of ram, and a SSD.
-The kernel running was built from the master branch with the patch.
-
-The compression benchmark is the file tree from the SquashFS archive found in the
-Ubuntu 16.10 desktop image (ubuntu-16.10-desktop-amd64.iso).
-The compression benchmark uses mksquashfs with the default block size (128 KB)
-and various compression algorithms/compression levels.
-`xz` and `zstd` are also benchmarked with 256 KB blocks.
-The decompression benchmark is timing how long it takes to `tar` the file tree
-into `/dev/null`.
-See `squashfs-benchmark.sh` for details.
-
-| Algorithm      | Compression ratio | Compression speed | Decompression speed |
-|----------------|-------------------|-------------------|---------------------|
-| gzip           | 2.92              |   15 MB/s         | 128 MB/s            |
-| lzo            | 2.64              |  9.5 MB/s         | 217 MB/s            |
-| lz4            | 2.12              |   94 MB/s         | 218 MB/s            |
-| xz             | 3.43              |  5.5 MB/s         |  35 MB/s            |
-| xz 256 KB      | 3.53              |  5.4 MB/s         |  40 MB/s            |
-| zstd 1         | 2.71              |   96 MB/s         | 210 MB/s            |
-| zstd 5         | 2.93              |   69 MB/s         | 198 MB/s            |
-| zstd 10        | 3.01              |   41 MB/s         | 225 MB/s            |
-| zstd 15        | 3.13              | 11.4 MB/s         | 224 MB/s            |
-| zstd 16 256 KB | 3.24              |  8.1 MB/s         | 210 MB/s            |
diff --git a/priv/zstd/contrib/linux-kernel/btrfs-benchmark.sh b/priv/zstd/contrib/linux-kernel/btrfs-benchmark.sh
deleted file mode 100755
index 5e28da9..0000000
--- a/priv/zstd/contrib/linux-kernel/btrfs-benchmark.sh
+++ /dev/null
@@ -1,104 +0,0 @@
-# !/bin/sh
-set -e
-
-# Benchmarks run on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-# The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor and
-# 16 GB of RAM and an SSD.
-
-# silesia is a directory that can be downloaded from
-# http://mattmahoney.net/dc/silesia.html
-# ls -l silesia/
-# total 203M
-# -rwxr-xr-x 1 terrelln 9.8M Apr 12  2002 dickens
-# -rwxr-xr-x 1 terrelln  49M May 31  2002 mozilla
-# -rwxr-xr-x 1 terrelln 9.6M Mar 20  2003 mr
-# -rwxr-xr-x 1 terrelln  32M Apr  2  2002 nci
-# -rwxr-xr-x 1 terrelln 5.9M Jul  4  2002 ooffice
-# -rwxr-xr-x 1 terrelln 9.7M Apr 11  2002 osdb
-# -rwxr-xr-x 1 terrelln 6.4M Apr  2  2002 reymont
-# -rwxr-xr-x 1 terrelln  21M Mar 25  2002 samba
-# -rwxr-xr-x 1 terrelln 7.0M Mar 24  2002 sao
-# -rwxr-xr-x 1 terrelln  40M Mar 25  2002 webster
-# -rwxr-xr-x 1 terrelln 8.1M Apr  4  2002 x-ray
-# -rwxr-xr-x 1 terrelln 5.1M Nov 30  2000 xml
-
-# $HOME is on a ext4 filesystem
-BENCHMARK_DIR="$HOME/silesia/"
-N=10
-
-# Normalize the environment
-sudo umount /mnt/btrfs 2> /dev/null > /dev/null || true
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-sudo rm -rf /mnt/btrfs/*
-sync
-sudo umount /mnt/btrfs
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-
-# Run the benchmark
-echo "Compression"
-time sh -c "for i in \$(seq $N); do sudo cp -r $BENCHMARK_DIR /mnt/btrfs/\$i; done; sync"
-
-echo "Approximate compression ratio"
-printf "%d / %d\n"                                                             \
-  $(df /mnt/btrfs --output=used -B 1 | tail -n 1)                              \
-  $(sudo du /mnt/btrfs -b -d 0 | tr '\t' '\n' | head -n 1);
-
-# Unmount and remount to avoid any caching
-sudo umount /mnt/btrfs
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-
-echo "Decompression"
-time sudo tar -c /mnt/btrfs 2> /dev/null | wc -c > /dev/null
-
-sudo rm -rf /mnt/btrfs/*
-sudo umount /mnt/btrfs
-
-# Run for each of -o compress-force={none, lzo, zlib, zstd} 5 times and take the
-# min time and ratio.
-# Ran zstd with compression levels {1, 3, 6, 9, 12, 15}.
-# Original size: 2119415342 B (using du /mnt/btrfs)
-
-# none
-# compress: 4.205 s
-# decompress: 3.090 s
-# ratio: 0.99
-
-# lzo
-# compress: 5.328 s
-# decompress: 4.793 s
-# ratio: 1.66
-
-# zlib
-# compress: 32.588 s
-# decompress: 8.791 s
-# ratio : 2.58
-
-# zstd 1
-# compress: 8.147 s
-# decompress: 5.527 s
-# ratio : 2.57
-
-# zstd 3
-# compress: 12.207 s
-# decompress: 5.195 s
-# ratio : 2.71
-
-# zstd 6
-# compress: 30.253 s
-# decompress: 5.324 s
-# ratio : 2.87
-
-# zstd 9
-# compress: 49.659 s
-# decompress: 5.220 s
-# ratio : 2.92
-
-# zstd 12
-# compress: 99.245 s
-# decompress: 5.193 s
-# ratio : 2.93
-
-# zstd 15
-# compress: 196.997 s
-# decompress: 5.992 s
-# ratio : 3.01
diff --git a/priv/zstd/contrib/linux-kernel/btrfs-extract-benchmark.sh b/priv/zstd/contrib/linux-kernel/btrfs-extract-benchmark.sh
deleted file mode 100755
index 69721d0..0000000
--- a/priv/zstd/contrib/linux-kernel/btrfs-extract-benchmark.sh
+++ /dev/null
@@ -1,99 +0,0 @@
-# !/bin/sh
-set -e
-
-# Benchmarks run on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-# The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor and
-# 16 GB of RAM and an SSD.
-
-# silesia is a directory that can be downloaded from
-# http://mattmahoney.net/dc/silesia.html
-# ls -l silesia/
-# total 203M
-# -rwxr-xr-x 1 terrelln 9.8M Apr 12  2002 dickens
-# -rwxr-xr-x 1 terrelln  49M May 31  2002 mozilla
-# -rwxr-xr-x 1 terrelln 9.6M Mar 20  2003 mr
-# -rwxr-xr-x 1 terrelln  32M Apr  2  2002 nci
-# -rwxr-xr-x 1 terrelln 5.9M Jul  4  2002 ooffice
-# -rwxr-xr-x 1 terrelln 9.7M Apr 11  2002 osdb
-# -rwxr-xr-x 1 terrelln 6.4M Apr  2  2002 reymont
-# -rwxr-xr-x 1 terrelln  21M Mar 25  2002 samba
-# -rwxr-xr-x 1 terrelln 7.0M Mar 24  2002 sao
-# -rwxr-xr-x 1 terrelln  40M Mar 25  2002 webster
-# -rwxr-xr-x 1 terrelln 8.1M Apr  4  2002 x-ray
-# -rwxr-xr-x 1 terrelln 5.1M Nov 30  2000 xml
-
-# $HOME is on a ext4 filesystem
-BENCHMARK_FILE="linux-4.11.6.tar"
-BENCHMARK_DIR="$HOME/$BENCHMARK_FILE"
-
-# Normalize the environment
-sudo umount /mnt/btrfs 2> /dev/null > /dev/null || true
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-sudo rm -rf /mnt/btrfs/*
-sync
-sudo umount /mnt/btrfs
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-
-# Run the benchmark
-echo "Copy"
-time sh -c "sudo cp -r $BENCHMARK_DIR /mnt/btrfs/$BENCHMARK_FILE && sync"
-
-echo "Approximate tarred compression ratio"
-printf "%d / %d\n"                                                             \
-  $(df /mnt/btrfs --output=used -B 1 | tail -n 1)                              \
-  $(sudo du /mnt/btrfs -b -d 0 | tr '\t' '\n' | head -n 1);
-
-# Unmount and remount to avoid any caching
-sudo umount /mnt/btrfs
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-
-echo "Extract"
-time sh -c "sudo tar -C /mnt/btrfs -xf /mnt/btrfs/$BENCHMARK_FILE && sync"
-
-# Remove the tarball, leaving only the extracted data
-sudo rm /mnt/btrfs/$BENCHMARK_FILE
-# Unmount and remount to avoid any caching
-sudo umount /mnt/btrfs
-sudo mount -t btrfs $@ /dev/sda3 /mnt/btrfs
-
-echo "Approximate extracted compression ratio"
-printf "%d / %d\n"                                                             \
-  $(df /mnt/btrfs --output=used -B 1 | tail -n 1)                              \
-  $(sudo du /mnt/btrfs -b -d 0 | tr '\t' '\n' | head -n 1);
-
-echo "Read"
-time sudo tar -c /mnt/btrfs 2> /dev/null | wc -c > /dev/null
-
-sudo rm -rf /mnt/btrfs/*
-sudo umount /mnt/btrfs
-
-# Run for each of -o compress-force={none, lzo, zlib, zstd} 5 times and take the
-# min time and ratio.
-
-# none
-# copy: 0.981 s
-# extract: 5.501 s
-# read: 8.807 s
-# tarball ratio: 0.97
-# extracted ratio: 0.78
-
-# lzo
-# copy: 1.631 s
-# extract: 8.458 s
-# read: 8.585 s
-# tarball ratio: 2.06
-# extracted ratio: 1.38
-
-# zlib
-# copy: 7.750 s
-# extract: 21.544 s
-# read: 11.744 s
-# tarball ratio : 3.40
-# extracted ratio: 1.86
-
-# zstd 1
-# copy: 2.579 s
-# extract: 11.479 s
-# read: 9.389 s
-# tarball ratio : 3.57
-# extracted ratio: 1.85
diff --git a/priv/zstd/contrib/linux-kernel/fs/btrfs/zstd.c b/priv/zstd/contrib/linux-kernel/fs/btrfs/zstd.c
deleted file mode 100644
index 607ce47..0000000
--- a/priv/zstd/contrib/linux-kernel/fs/btrfs/zstd.c
+++ /dev/null
@@ -1,432 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public
- * License v2 as published by the Free Software Foundation.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * General Public License for more details.
- */
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include "compression.h"
-
-#define ZSTD_BTRFS_MAX_WINDOWLOG 17
-#define ZSTD_BTRFS_MAX_INPUT (1 << ZSTD_BTRFS_MAX_WINDOWLOG)
-#define ZSTD_BTRFS_DEFAULT_LEVEL 3
-
-static ZSTD_parameters zstd_get_btrfs_parameters(size_t src_len)
-{
-	ZSTD_parameters params = ZSTD_getParams(ZSTD_BTRFS_DEFAULT_LEVEL,
-						src_len, 0);
-
-	if (params.cParams.windowLog > ZSTD_BTRFS_MAX_WINDOWLOG)
-		params.cParams.windowLog = ZSTD_BTRFS_MAX_WINDOWLOG;
-	WARN_ON(src_len > ZSTD_BTRFS_MAX_INPUT);
-	return params;
-}
-
-struct workspace {
-	void *mem;
-	size_t size;
-	char *buf;
-	struct list_head list;
-};
-
-static void zstd_free_workspace(struct list_head *ws)
-{
-	struct workspace *workspace = list_entry(ws, struct workspace, list);
-
-	kvfree(workspace->mem);
-	kfree(workspace->buf);
-	kfree(workspace);
-}
-
-static struct list_head *zstd_alloc_workspace(void)
-{
-	ZSTD_parameters params =
-			zstd_get_btrfs_parameters(ZSTD_BTRFS_MAX_INPUT);
-	struct workspace *workspace;
-
-	workspace = kzalloc(sizeof(*workspace), GFP_KERNEL);
-	if (!workspace)
-		return ERR_PTR(-ENOMEM);
-
-	workspace->size = max_t(size_t,
-			ZSTD_CStreamWorkspaceBound(params.cParams),
-			ZSTD_DStreamWorkspaceBound(ZSTD_BTRFS_MAX_INPUT));
-	workspace->mem = kvmalloc(workspace->size, GFP_KERNEL);
-	workspace->buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
-	if (!workspace->mem || !workspace->buf)
-		goto fail;
-
-	INIT_LIST_HEAD(&workspace->list);
-
-	return &workspace->list;
-fail:
-	zstd_free_workspace(&workspace->list);
-	return ERR_PTR(-ENOMEM);
-}
-
-static int zstd_compress_pages(struct list_head *ws,
-		struct address_space *mapping,
-		u64 start,
-		struct page **pages,
-		unsigned long *out_pages,
-		unsigned long *total_in,
-		unsigned long *total_out)
-{
-	struct workspace *workspace = list_entry(ws, struct workspace, list);
-	ZSTD_CStream *stream;
-	int ret = 0;
-	int nr_pages = 0;
-	struct page *in_page = NULL;  /* The current page to read */
-	struct page *out_page = NULL; /* The current page to write to */
-	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-	unsigned long tot_in = 0;
-	unsigned long tot_out = 0;
-	unsigned long len = *total_out;
-	const unsigned long nr_dest_pages = *out_pages;
-	unsigned long max_out = nr_dest_pages * PAGE_SIZE;
-	ZSTD_parameters params = zstd_get_btrfs_parameters(len);
-
-	*out_pages = 0;
-	*total_out = 0;
-	*total_in = 0;
-
-	/* Initialize the stream */
-	stream = ZSTD_initCStream(params, len, workspace->mem,
-			workspace->size);
-	if (!stream) {
-		pr_warn("BTRFS: ZSTD_initCStream failed\n");
-		ret = -EIO;
-		goto out;
-	}
-
-	/* map in the first page of input data */
-	in_page = find_get_page(mapping, start >> PAGE_SHIFT);
-	in_buf.src = kmap(in_page);
-	in_buf.pos = 0;
-	in_buf.size = min_t(size_t, len, PAGE_SIZE);
-
-
-	/* Allocate and map in the output buffer */
-	out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
-	if (out_page == NULL) {
-		ret = -ENOMEM;
-		goto out;
-	}
-	pages[nr_pages++] = out_page;
-	out_buf.dst = kmap(out_page);
-	out_buf.pos = 0;
-	out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
-
-	while (1) {
-		size_t ret2;
-
-		ret2 = ZSTD_compressStream(stream, &out_buf, &in_buf);
-		if (ZSTD_isError(ret2)) {
-			pr_debug("BTRFS: ZSTD_compressStream returned %d\n",
-					ZSTD_getErrorCode(ret2));
-			ret = -EIO;
-			goto out;
-		}
-
-		/* Check to see if we are making it bigger */
-		if (tot_in + in_buf.pos > 8192 &&
-				tot_in + in_buf.pos <
-				tot_out + out_buf.pos) {
-			ret = -E2BIG;
-			goto out;
-		}
-
-		/* We've reached the end of our output range */
-		if (out_buf.pos >= max_out) {
-			tot_out += out_buf.pos;
-			ret = -E2BIG;
-			goto out;
-		}
-
-		/* Check if we need more output space */
-		if (out_buf.pos == out_buf.size) {
-			tot_out += PAGE_SIZE;
-			max_out -= PAGE_SIZE;
-			kunmap(out_page);
-			if (nr_pages == nr_dest_pages) {
-				out_page = NULL;
-				ret = -E2BIG;
-				goto out;
-			}
-			out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
-			if (out_page == NULL) {
-				ret = -ENOMEM;
-				goto out;
-			}
-			pages[nr_pages++] = out_page;
-			out_buf.dst = kmap(out_page);
-			out_buf.pos = 0;
-			out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
-		}
-
-		/* We've reached the end of the input */
-		if (in_buf.pos >= len) {
-			tot_in += in_buf.pos;
-			break;
-		}
-
-		/* Check if we need more input */
-		if (in_buf.pos == in_buf.size) {
-			tot_in += PAGE_SIZE;
-			kunmap(in_page);
-			put_page(in_page);
-
-			start += PAGE_SIZE;
-			len -= PAGE_SIZE;
-			in_page = find_get_page(mapping, start >> PAGE_SHIFT);
-			in_buf.src = kmap(in_page);
-			in_buf.pos = 0;
-			in_buf.size = min_t(size_t, len, PAGE_SIZE);
-		}
-	}
-	while (1) {
-		size_t ret2;
-
-		ret2 = ZSTD_endStream(stream, &out_buf);
-		if (ZSTD_isError(ret2)) {
-			pr_debug("BTRFS: ZSTD_endStream returned %d\n",
-					ZSTD_getErrorCode(ret2));
-			ret = -EIO;
-			goto out;
-		}
-		if (ret2 == 0) {
-			tot_out += out_buf.pos;
-			break;
-		}
-		if (out_buf.pos >= max_out) {
-			tot_out += out_buf.pos;
-			ret = -E2BIG;
-			goto out;
-		}
-
-		tot_out += PAGE_SIZE;
-		max_out -= PAGE_SIZE;
-		kunmap(out_page);
-		if (nr_pages == nr_dest_pages) {
-			out_page = NULL;
-			ret = -E2BIG;
-			goto out;
-		}
-		out_page = alloc_page(GFP_NOFS | __GFP_HIGHMEM);
-		if (out_page == NULL) {
-			ret = -ENOMEM;
-			goto out;
-		}
-		pages[nr_pages++] = out_page;
-		out_buf.dst = kmap(out_page);
-		out_buf.pos = 0;
-		out_buf.size = min_t(size_t, max_out, PAGE_SIZE);
-	}
-
-	if (tot_out >= tot_in) {
-		ret = -E2BIG;
-		goto out;
-	}
-
-	ret = 0;
-	*total_in = tot_in;
-	*total_out = tot_out;
-out:
-	*out_pages = nr_pages;
-	/* Cleanup */
-	if (in_page) {
-		kunmap(in_page);
-		put_page(in_page);
-	}
-	if (out_page)
-		kunmap(out_page);
-	return ret;
-}
-
-static int zstd_decompress_bio(struct list_head *ws, struct compressed_bio *cb)
-{
-	struct workspace *workspace = list_entry(ws, struct workspace, list);
-	struct page **pages_in = cb->compressed_pages;
-	u64 disk_start = cb->start;
-	struct bio *orig_bio = cb->orig_bio;
-	size_t srclen = cb->compressed_len;
-	ZSTD_DStream *stream;
-	int ret = 0;
-	unsigned long page_in_index = 0;
-	unsigned long total_pages_in = DIV_ROUND_UP(srclen, PAGE_SIZE);
-	unsigned long buf_start;
-	unsigned long total_out = 0;
-	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-
-	stream = ZSTD_initDStream(
-			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
-	if (!stream) {
-		pr_debug("BTRFS: ZSTD_initDStream failed\n");
-		ret = -EIO;
-		goto done;
-	}
-
-	in_buf.src = kmap(pages_in[page_in_index]);
-	in_buf.pos = 0;
-	in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
-
-	out_buf.dst = workspace->buf;
-	out_buf.pos = 0;
-	out_buf.size = PAGE_SIZE;
-
-	while (1) {
-		size_t ret2;
-
-		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-		if (ZSTD_isError(ret2)) {
-			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-					ZSTD_getErrorCode(ret2));
-			ret = -EIO;
-			goto done;
-		}
-		buf_start = total_out;
-		total_out += out_buf.pos;
-		out_buf.pos = 0;
-
-		ret = btrfs_decompress_buf2page(out_buf.dst, buf_start,
-				total_out, disk_start, orig_bio);
-		if (ret == 0)
-			break;
-
-		if (in_buf.pos >= srclen)
-			break;
-
-		/* Check if we've hit the end of a frame */
-		if (ret2 == 0)
-			break;
-
-		if (in_buf.pos == in_buf.size) {
-			kunmap(pages_in[page_in_index++]);
-			if (page_in_index >= total_pages_in) {
-				in_buf.src = NULL;
-				ret = -EIO;
-				goto done;
-			}
-			srclen -= PAGE_SIZE;
-			in_buf.src = kmap(pages_in[page_in_index]);
-			in_buf.pos = 0;
-			in_buf.size = min_t(size_t, srclen, PAGE_SIZE);
-		}
-	}
-	ret = 0;
-	zero_fill_bio(orig_bio);
-done:
-	if (in_buf.src)
-		kunmap(pages_in[page_in_index]);
-	return ret;
-}
-
-static int zstd_decompress(struct list_head *ws, unsigned char *data_in,
-		struct page *dest_page,
-		unsigned long start_byte,
-		size_t srclen, size_t destlen)
-{
-	struct workspace *workspace = list_entry(ws, struct workspace, list);
-	ZSTD_DStream *stream;
-	int ret = 0;
-	size_t ret2;
-	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-	unsigned long total_out = 0;
-	unsigned long pg_offset = 0;
-	char *kaddr;
-
-	stream = ZSTD_initDStream(
-			ZSTD_BTRFS_MAX_INPUT, workspace->mem, workspace->size);
-	if (!stream) {
-		pr_warn("BTRFS: ZSTD_initDStream failed\n");
-		ret = -EIO;
-		goto finish;
-	}
-
-	destlen = min_t(size_t, destlen, PAGE_SIZE);
-
-	in_buf.src = data_in;
-	in_buf.pos = 0;
-	in_buf.size = srclen;
-
-	out_buf.dst = workspace->buf;
-	out_buf.pos = 0;
-	out_buf.size = PAGE_SIZE;
-
-	ret2 = 1;
-	while (pg_offset < destlen && in_buf.pos < in_buf.size) {
-		unsigned long buf_start;
-		unsigned long buf_offset;
-		unsigned long bytes;
-
-		/* Check if the frame is over and we still need more input */
-		if (ret2 == 0) {
-			pr_debug("BTRFS: ZSTD_decompressStream ended early\n");
-			ret = -EIO;
-			goto finish;
-		}
-		ret2 = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-		if (ZSTD_isError(ret2)) {
-			pr_debug("BTRFS: ZSTD_decompressStream returned %d\n",
-					ZSTD_getErrorCode(ret2));
-			ret = -EIO;
-			goto finish;
-		}
-
-		buf_start = total_out;
-		total_out += out_buf.pos;
-		out_buf.pos = 0;
-
-		if (total_out <= start_byte)
-			continue;
-
-		if (total_out > start_byte && buf_start < start_byte)
-			buf_offset = start_byte - buf_start;
-		else
-			buf_offset = 0;
-
-		bytes = min_t(unsigned long, destlen - pg_offset,
-				out_buf.size - buf_offset);
-
-		kaddr = kmap_atomic(dest_page);
-		memcpy(kaddr + pg_offset, out_buf.dst + buf_offset, bytes);
-		kunmap_atomic(kaddr);
-
-		pg_offset += bytes;
-	}
-	ret = 0;
-finish:
-	if (pg_offset < destlen) {
-		kaddr = kmap_atomic(dest_page);
-		memset(kaddr + pg_offset, 0, destlen - pg_offset);
-		kunmap_atomic(kaddr);
-	}
-	return ret;
-}
-
-const struct btrfs_compress_op btrfs_zstd_compress = {
-	.alloc_workspace = zstd_alloc_workspace,
-	.free_workspace = zstd_free_workspace,
-	.compress_pages = zstd_compress_pages,
-	.decompress_bio = zstd_decompress_bio,
-	.decompress = zstd_decompress,
-};
diff --git a/priv/zstd/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c b/priv/zstd/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
deleted file mode 100644
index eeaabf8..0000000
--- a/priv/zstd/contrib/linux-kernel/fs/squashfs/zstd_wrapper.c
+++ /dev/null
@@ -1,151 +0,0 @@
-/*
- * Squashfs - a compressed read only filesystem for Linux
- *
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2,
- * or (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * zstd_wrapper.c
- */
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#include "squashfs_fs.h"
-#include "squashfs_fs_sb.h"
-#include "squashfs.h"
-#include "decompressor.h"
-#include "page_actor.h"
-
-struct workspace {
-	void *mem;
-	size_t mem_size;
-	size_t window_size;
-};
-
-static void *zstd_init(struct squashfs_sb_info *msblk, void *buff)
-{
-	struct workspace *wksp = kmalloc(sizeof(*wksp), GFP_KERNEL);
-
-	if (wksp == NULL)
-		goto failed;
-	wksp->window_size = max_t(size_t,
-			msblk->block_size, SQUASHFS_METADATA_SIZE);
-	wksp->mem_size = ZSTD_DStreamWorkspaceBound(wksp->window_size);
-	wksp->mem = vmalloc(wksp->mem_size);
-	if (wksp->mem == NULL)
-		goto failed;
-
-	return wksp;
-
-failed:
-	ERROR("Failed to allocate zstd workspace\n");
-	kfree(wksp);
-	return ERR_PTR(-ENOMEM);
-}
-
-
-static void zstd_free(void *strm)
-{
-	struct workspace *wksp = strm;
-
-	if (wksp)
-		vfree(wksp->mem);
-	kfree(wksp);
-}
-
-
-static int zstd_uncompress(struct squashfs_sb_info *msblk, void *strm,
-	struct buffer_head **bh, int b, int offset, int length,
-	struct squashfs_page_actor *output)
-{
-	struct workspace *wksp = strm;
-	ZSTD_DStream *stream;
-	size_t total_out = 0;
-	size_t zstd_err;
-	int k = 0;
-	ZSTD_inBuffer in_buf = { NULL, 0, 0 };
-	ZSTD_outBuffer out_buf = { NULL, 0, 0 };
-
-	stream = ZSTD_initDStream(wksp->window_size, wksp->mem, wksp->mem_size);
-
-	if (!stream) {
-		ERROR("Failed to initialize zstd decompressor\n");
-		goto out;
-	}
-
-	out_buf.size = PAGE_SIZE;
-	out_buf.dst = squashfs_first_page(output);
-
-	do {
-		if (in_buf.pos == in_buf.size && k < b) {
-			int avail = min(length, msblk->devblksize - offset);
-
-			length -= avail;
-			in_buf.src = bh[k]->b_data + offset;
-			in_buf.size = avail;
-			in_buf.pos = 0;
-			offset = 0;
-		}
-
-		if (out_buf.pos == out_buf.size) {
-			out_buf.dst = squashfs_next_page(output);
-			if (out_buf.dst == NULL) {
-				/* Shouldn't run out of pages
-				 * before stream is done.
-				 */
-				squashfs_finish_page(output);
-				goto out;
-			}
-			out_buf.pos = 0;
-			out_buf.size = PAGE_SIZE;
-		}
-
-		total_out -= out_buf.pos;
-		zstd_err = ZSTD_decompressStream(stream, &out_buf, &in_buf);
-		total_out += out_buf.pos; /* add the additional data produced */
-
-		if (in_buf.pos == in_buf.size && k < b)
-			put_bh(bh[k++]);
-	} while (zstd_err != 0 && !ZSTD_isError(zstd_err));
-
-	squashfs_finish_page(output);
-
-	if (ZSTD_isError(zstd_err)) {
-		ERROR("zstd decompression error: %d\n",
-				(int)ZSTD_getErrorCode(zstd_err));
-		goto out;
-	}
-
-	if (k < b)
-		goto out;
-
-	return (int)total_out;
-
-out:
-	for (; k < b; k++)
-		put_bh(bh[k]);
-
-	return -EIO;
-}
-
-const struct squashfs_decompressor squashfs_zstd_comp_ops = {
-	.init = zstd_init,
-	.free = zstd_free,
-	.decompress = zstd_uncompress,
-	.id = ZSTD_COMPRESSION,
-	.name = "zstd",
-	.supported = 1
-};
diff --git a/priv/zstd/contrib/linux-kernel/include/linux/xxhash.h b/priv/zstd/contrib/linux-kernel/include/linux/xxhash.h
deleted file mode 100644
index 9e1f42c..0000000
--- a/priv/zstd/contrib/linux-kernel/include/linux/xxhash.h
+++ /dev/null
@@ -1,236 +0,0 @@
-/*
- * xxHash - Extremely Fast Hash algorithm
- * Copyright (C) 2012-2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- *     notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- *     copyright notice, this list of conditions and the following disclaimer
- *     in the documentation and/or other materials provided with the
- *     distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at:
- * - xxHash homepage: http://cyan4973.github.io/xxHash/
- * - xxHash source repository: https://github.com/Cyan4973/xxHash
- */
-
-/*
- * Notice extracted from xxHash homepage:
- *
- * xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
- * It also successfully passes all tests from the SMHasher suite.
- *
- * Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2
- * Duo @3GHz)
- *
- * Name            Speed       Q.Score   Author
- * xxHash          5.4 GB/s     10
- * CrapWow         3.2 GB/s      2       Andrew
- * MumurHash 3a    2.7 GB/s     10       Austin Appleby
- * SpookyHash      2.0 GB/s     10       Bob Jenkins
- * SBox            1.4 GB/s      9       Bret Mulvey
- * Lookup3         1.2 GB/s      9       Bob Jenkins
- * SuperFastHash   1.2 GB/s      1       Paul Hsieh
- * CityHash64      1.05 GB/s    10       Pike & Alakuijala
- * FNV             0.55 GB/s     5       Fowler, Noll, Vo
- * CRC32           0.43 GB/s     9
- * MD5-32          0.33 GB/s    10       Ronald L. Rivest
- * SHA1-32         0.28 GB/s    10
- *
- * Q.Score is a measure of quality of the hash function.
- * It depends on successfully passing SMHasher test set.
- * 10 is a perfect score.
- *
- * A 64-bits version, named xxh64 offers much better speed,
- * but for 64-bits applications only.
- * Name     Speed on 64 bits    Speed on 32 bits
- * xxh64       13.8 GB/s            1.9 GB/s
- * xxh32        6.8 GB/s            6.0 GB/s
- */
-
-#ifndef XXHASH_H
-#define XXHASH_H
-
-#include 
-
-/*-****************************
- * Simple Hash Functions
- *****************************/
-
-/**
- * xxh32() - calculate the 32-bit hash of the input with a given seed.
- *
- * @input:  The data to hash.
- * @length: The length of the data to hash.
- * @seed:   The seed can be used to alter the result predictably.
- *
- * Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
- *
- * Return:  The 32-bit hash of the data.
- */
-uint32_t xxh32(const void *input, size_t length, uint32_t seed);
-
-/**
- * xxh64() - calculate the 64-bit hash of the input with a given seed.
- *
- * @input:  The data to hash.
- * @length: The length of the data to hash.
- * @seed:   The seed can be used to alter the result predictably.
- *
- * This function runs 2x faster on 64-bit systems, but slower on 32-bit systems.
- *
- * Return:  The 64-bit hash of the data.
- */
-uint64_t xxh64(const void *input, size_t length, uint64_t seed);
-
-/*-****************************
- * Streaming Hash Functions
- *****************************/
-
-/*
- * These definitions are only meant to allow allocation of XXH state
- * statically, on stack, or in a struct for example.
- * Do not use members directly.
- */
-
-/**
- * struct xxh32_state - private xxh32 state, do not use members directly
- */
-struct xxh32_state {
-	uint32_t total_len_32;
-	uint32_t large_len;
-	uint32_t v1;
-	uint32_t v2;
-	uint32_t v3;
-	uint32_t v4;
-	uint32_t mem32[4];
-	uint32_t memsize;
-};
-
-/**
- * struct xxh32_state - private xxh64 state, do not use members directly
- */
-struct xxh64_state {
-	uint64_t total_len;
-	uint64_t v1;
-	uint64_t v2;
-	uint64_t v3;
-	uint64_t v4;
-	uint64_t mem64[4];
-	uint32_t memsize;
-};
-
-/**
- * xxh32_reset() - reset the xxh32 state to start a new hashing operation
- *
- * @state: The xxh32 state to reset.
- * @seed:  Initialize the hash state with this seed.
- *
- * Call this function on any xxh32_state to prepare for a new hashing operation.
- */
-void xxh32_reset(struct xxh32_state *state, uint32_t seed);
-
-/**
- * xxh32_update() - hash the data given and update the xxh32 state
- *
- * @state:  The xxh32 state to update.
- * @input:  The data to hash.
- * @length: The length of the data to hash.
- *
- * After calling xxh32_reset() call xxh32_update() as many times as necessary.
- *
- * Return:  Zero on success, otherwise an error code.
- */
-int xxh32_update(struct xxh32_state *state, const void *input, size_t length);
-
-/**
- * xxh32_digest() - produce the current xxh32 hash
- *
- * @state: Produce the current xxh32 hash of this state.
- *
- * A hash value can be produced at any time. It is still possible to continue
- * inserting input into the hash state after a call to xxh32_digest(), and
- * generate new hashes later on, by calling xxh32_digest() again.
- *
- * Return: The xxh32 hash stored in the state.
- */
-uint32_t xxh32_digest(const struct xxh32_state *state);
-
-/**
- * xxh64_reset() - reset the xxh64 state to start a new hashing operation
- *
- * @state: The xxh64 state to reset.
- * @seed:  Initialize the hash state with this seed.
- */
-void xxh64_reset(struct xxh64_state *state, uint64_t seed);
-
-/**
- * xxh64_update() - hash the data given and update the xxh64 state
- * @state:  The xxh64 state to update.
- * @input:  The data to hash.
- * @length: The length of the data to hash.
- *
- * After calling xxh64_reset() call xxh64_update() as many times as necessary.
- *
- * Return:  Zero on success, otherwise an error code.
- */
-int xxh64_update(struct xxh64_state *state, const void *input, size_t length);
-
-/**
- * xxh64_digest() - produce the current xxh64 hash
- *
- * @state: Produce the current xxh64 hash of this state.
- *
- * A hash value can be produced at any time. It is still possible to continue
- * inserting input into the hash state after a call to xxh64_digest(), and
- * generate new hashes later on, by calling xxh64_digest() again.
- *
- * Return: The xxh64 hash stored in the state.
- */
-uint64_t xxh64_digest(const struct xxh64_state *state);
-
-/*-**************************
- * Utils
- ***************************/
-
-/**
- * xxh32_copy_state() - copy the source state into the destination state
- *
- * @src: The source xxh32 state.
- * @dst: The destination xxh32 state.
- */
-void xxh32_copy_state(struct xxh32_state *dst, const struct xxh32_state *src);
-
-/**
- * xxh64_copy_state() - copy the source state into the destination state
- *
- * @src: The source xxh64 state.
- * @dst: The destination xxh64 state.
- */
-void xxh64_copy_state(struct xxh64_state *dst, const struct xxh64_state *src);
-
-#endif /* XXHASH_H */
diff --git a/priv/zstd/contrib/linux-kernel/include/linux/zstd.h b/priv/zstd/contrib/linux-kernel/include/linux/zstd.h
deleted file mode 100644
index 305efd0..0000000
--- a/priv/zstd/contrib/linux-kernel/include/linux/zstd.h
+++ /dev/null
@@ -1,1155 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-#ifndef ZSTD_H
-#define ZSTD_H
-
-/* ======   Dependency   ======*/
-#include    /* size_t */
-
-
-/*-*****************************************************************************
- * Introduction
- *
- * zstd, short for Zstandard, is a fast lossless compression algorithm,
- * targeting real-time compression scenarios at zlib-level and better
- * compression ratios. The zstd compression library provides in-memory
- * compression and decompression functions. The library supports compression
- * levels from 1 up to ZSTD_maxCLevel() which is 22. Levels >= 20, labeled
- * ultra, should be used with caution, as they require more memory.
- * Compression can be done in:
- *  - a single step, reusing a context (described as Explicit memory management)
- *  - unbounded multiple steps (described as Streaming compression)
- * The compression ratio achievable on small data can be highly improved using
- * compression with a dictionary in:
- *  - a single step (described as Simple dictionary API)
- *  - a single step, reusing a dictionary (described as Fast dictionary API)
- ******************************************************************************/
-
-/*======  Helper functions  ======*/
-
-/**
- * enum ZSTD_ErrorCode - zstd error codes
- *
- * Functions that return size_t can be checked for errors using ZSTD_isError()
- * and the ZSTD_ErrorCode can be extracted using ZSTD_getErrorCode().
- */
-typedef enum {
-	ZSTD_error_no_error,
-	ZSTD_error_GENERIC,
-	ZSTD_error_prefix_unknown,
-	ZSTD_error_version_unsupported,
-	ZSTD_error_parameter_unknown,
-	ZSTD_error_frameParameter_unsupported,
-	ZSTD_error_frameParameter_unsupportedBy32bits,
-	ZSTD_error_frameParameter_windowTooLarge,
-	ZSTD_error_compressionParameter_unsupported,
-	ZSTD_error_init_missing,
-	ZSTD_error_memory_allocation,
-	ZSTD_error_stage_wrong,
-	ZSTD_error_dstSize_tooSmall,
-	ZSTD_error_srcSize_wrong,
-	ZSTD_error_corruption_detected,
-	ZSTD_error_checksum_wrong,
-	ZSTD_error_tableLog_tooLarge,
-	ZSTD_error_maxSymbolValue_tooLarge,
-	ZSTD_error_maxSymbolValue_tooSmall,
-	ZSTD_error_dictionary_corrupted,
-	ZSTD_error_dictionary_wrong,
-	ZSTD_error_dictionaryCreation_failed,
-	ZSTD_error_maxCode
-} ZSTD_ErrorCode;
-
-/**
- * ZSTD_maxCLevel() - maximum compression level available
- *
- * Return: Maximum compression level available.
- */
-int ZSTD_maxCLevel(void);
-/**
- * ZSTD_compressBound() - maximum compressed size in worst case scenario
- * @srcSize: The size of the data to compress.
- *
- * Return:   The maximum compressed size in the worst case scenario.
- */
-size_t ZSTD_compressBound(size_t srcSize);
-/**
- * ZSTD_isError() - tells if a size_t function result is an error code
- * @code:  The function result to check for error.
- *
- * Return: Non-zero iff the code is an error.
- */
-static __attribute__((unused)) unsigned int ZSTD_isError(size_t code)
-{
-	return code > (size_t)-ZSTD_error_maxCode;
-}
-/**
- * ZSTD_getErrorCode() - translates an error function result to a ZSTD_ErrorCode
- * @functionResult: The result of a function for which ZSTD_isError() is true.
- *
- * Return:          The ZSTD_ErrorCode corresponding to the functionResult or 0
- *                  if the functionResult isn't an error.
- */
-static __attribute__((unused)) ZSTD_ErrorCode ZSTD_getErrorCode(
-	size_t functionResult)
-{
-	if (!ZSTD_isError(functionResult))
-		return (ZSTD_ErrorCode)0;
-	return (ZSTD_ErrorCode)(0 - functionResult);
-}
-
-/**
- * enum ZSTD_strategy - zstd compression search strategy
- *
- * From faster to stronger.
- */
-typedef enum {
-	ZSTD_fast,
-	ZSTD_dfast,
-	ZSTD_greedy,
-	ZSTD_lazy,
-	ZSTD_lazy2,
-	ZSTD_btlazy2,
-	ZSTD_btopt,
-	ZSTD_btopt2
-} ZSTD_strategy;
-
-/**
- * struct ZSTD_compressionParameters - zstd compression parameters
- * @windowLog:    Log of the largest match distance. Larger means more
- *                compression, and more memory needed during decompression.
- * @chainLog:     Fully searched segment. Larger means more compression, slower,
- *                and more memory (useless for fast).
- * @hashLog:      Dispatch table. Larger means more compression,
- *                slower, and more memory.
- * @searchLog:    Number of searches. Larger means more compression and slower.
- * @searchLength: Match length searched. Larger means faster decompression,
- *                sometimes less compression.
- * @targetLength: Acceptable match size for optimal parser (only). Larger means
- *                more compression, and slower.
- * @strategy:     The zstd compression strategy.
- */
-typedef struct {
-	unsigned int windowLog;
-	unsigned int chainLog;
-	unsigned int hashLog;
-	unsigned int searchLog;
-	unsigned int searchLength;
-	unsigned int targetLength;
-	ZSTD_strategy strategy;
-} ZSTD_compressionParameters;
-
-/**
- * struct ZSTD_frameParameters - zstd frame parameters
- * @contentSizeFlag: Controls whether content size will be present in the frame
- *                   header (when known).
- * @checksumFlag:    Controls whether a 32-bit checksum is generated at the end
- *                   of the frame for error detection.
- * @noDictIDFlag:    Controls whether dictID will be saved into the frame header
- *                   when using dictionary compression.
- *
- * The default value is all fields set to 0.
- */
-typedef struct {
-	unsigned int contentSizeFlag;
-	unsigned int checksumFlag;
-	unsigned int noDictIDFlag;
-} ZSTD_frameParameters;
-
-/**
- * struct ZSTD_parameters - zstd parameters
- * @cParams: The compression parameters.
- * @fParams: The frame parameters.
- */
-typedef struct {
-	ZSTD_compressionParameters cParams;
-	ZSTD_frameParameters fParams;
-} ZSTD_parameters;
-
-/**
- * ZSTD_getCParams() - returns ZSTD_compressionParameters for selected level
- * @compressionLevel: The compression level from 1 to ZSTD_maxCLevel().
- * @estimatedSrcSize: The estimated source size to compress or 0 if unknown.
- * @dictSize:         The dictionary size or 0 if a dictionary isn't being used.
- *
- * Return:            The selected ZSTD_compressionParameters.
- */
-ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel,
-	unsigned long long estimatedSrcSize, size_t dictSize);
-
-/**
- * ZSTD_getParams() - returns ZSTD_parameters for selected level
- * @compressionLevel: The compression level from 1 to ZSTD_maxCLevel().
- * @estimatedSrcSize: The estimated source size to compress or 0 if unknown.
- * @dictSize:         The dictionary size or 0 if a dictionary isn't being used.
- *
- * The same as ZSTD_getCParams() except also selects the default frame
- * parameters (all zero).
- *
- * Return:            The selected ZSTD_parameters.
- */
-ZSTD_parameters ZSTD_getParams(int compressionLevel,
-	unsigned long long estimatedSrcSize, size_t dictSize);
-
-/*-*************************************
- * Explicit memory management
- **************************************/
-
-/**
- * ZSTD_CCtxWorkspaceBound() - amount of memory needed to initialize a ZSTD_CCtx
- * @cParams: The compression parameters to be used for compression.
- *
- * If multiple compression parameters might be used, the caller must call
- * ZSTD_CCtxWorkspaceBound() for each set of parameters and use the maximum
- * size.
- *
- * Return:   A lower bound on the size of the workspace that is passed to
- *           ZSTD_initCCtx().
- */
-size_t ZSTD_CCtxWorkspaceBound(ZSTD_compressionParameters cParams);
-
-/**
- * struct ZSTD_CCtx - the zstd compression context
- *
- * When compressing many times it is recommended to allocate a context just once
- * and reuse it for each successive compression operation.
- */
-typedef struct ZSTD_CCtx_s ZSTD_CCtx;
-/**
- * ZSTD_initCCtx() - initialize a zstd compression context
- * @workspace:     The workspace to emplace the context into. It must outlive
- *                 the returned context.
- * @workspaceSize: The size of workspace. Use ZSTD_CCtxWorkspaceBound() to
- *                 determine how large the workspace must be.
- *
- * Return:         A compression context emplaced into workspace.
- */
-ZSTD_CCtx *ZSTD_initCCtx(void *workspace, size_t workspaceSize);
-
-/**
- * ZSTD_compressCCtx() - compress src into dst
- * @ctx:         The context. Must have been initialized with a workspace at
- *               least as large as ZSTD_CCtxWorkspaceBound(params.cParams).
- * @dst:         The buffer to compress src into.
- * @dstCapacity: The size of the destination buffer. May be any size, but
- *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
- * @src:         The data to compress.
- * @srcSize:     The size of the data to compress.
- * @params:      The parameters to use for compression. See ZSTD_getParams().
- *
- * Return:       The compressed size or an error, which can be checked using
- *               ZSTD_isError().
- */
-size_t ZSTD_compressCCtx(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize, ZSTD_parameters params);
-
-/**
- * ZSTD_DCtxWorkspaceBound() - amount of memory needed to initialize a ZSTD_DCtx
- *
- * Return: A lower bound on the size of the workspace that is passed to
- *         ZSTD_initDCtx().
- */
-size_t ZSTD_DCtxWorkspaceBound(void);
-
-/**
- * struct ZSTD_DCtx - the zstd decompression context
- *
- * When decompressing many times it is recommended to allocate a context just
- * once and reuse it for each successive decompression operation.
- */
-typedef struct ZSTD_DCtx_s ZSTD_DCtx;
-/**
- * ZSTD_initDCtx() - initialize a zstd decompression context
- * @workspace:     The workspace to emplace the context into. It must outlive
- *                 the returned context.
- * @workspaceSize: The size of workspace. Use ZSTD_DCtxWorkspaceBound() to
- *                 determine how large the workspace must be.
- *
- * Return:         A decompression context emplaced into workspace.
- */
-ZSTD_DCtx *ZSTD_initDCtx(void *workspace, size_t workspaceSize);
-
-/**
- * ZSTD_decompressDCtx() - decompress zstd compressed src into dst
- * @ctx:         The decompression context.
- * @dst:         The buffer to decompress src into.
- * @dstCapacity: The size of the destination buffer. Must be at least as large
- *               as the decompressed size. If the caller cannot upper bound the
- *               decompressed size, then it's better to use the streaming API.
- * @src:         The zstd compressed data to decompress. Multiple concatenated
- *               frames and skippable frames are allowed.
- * @srcSize:     The exact size of the data to decompress.
- *
- * Return:       The decompressed size or an error, which can be checked using
- *               ZSTD_isError().
- */
-size_t ZSTD_decompressDCtx(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize);
-
-/*-************************
- * Simple dictionary API
- **************************/
-
-/**
- * ZSTD_compress_usingDict() - compress src into dst using a dictionary
- * @ctx:         The context. Must have been initialized with a workspace at
- *               least as large as ZSTD_CCtxWorkspaceBound(params.cParams).
- * @dst:         The buffer to compress src into.
- * @dstCapacity: The size of the destination buffer. May be any size, but
- *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
- * @src:         The data to compress.
- * @srcSize:     The size of the data to compress.
- * @dict:        The dictionary to use for compression.
- * @dictSize:    The size of the dictionary.
- * @params:      The parameters to use for compression. See ZSTD_getParams().
- *
- * Compression using a predefined dictionary. The same dictionary must be used
- * during decompression.
- *
- * Return:       The compressed size or an error, which can be checked using
- *               ZSTD_isError().
- */
-size_t ZSTD_compress_usingDict(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize, const void *dict, size_t dictSize,
-	ZSTD_parameters params);
-
-/**
- * ZSTD_decompress_usingDict() - decompress src into dst using a dictionary
- * @ctx:         The decompression context.
- * @dst:         The buffer to decompress src into.
- * @dstCapacity: The size of the destination buffer. Must be at least as large
- *               as the decompressed size. If the caller cannot upper bound the
- *               decompressed size, then it's better to use the streaming API.
- * @src:         The zstd compressed data to decompress. Multiple concatenated
- *               frames and skippable frames are allowed.
- * @srcSize:     The exact size of the data to decompress.
- * @dict:        The dictionary to use for decompression. The same dictionary
- *               must've been used to compress the data.
- * @dictSize:    The size of the dictionary.
- *
- * Return:       The decompressed size or an error, which can be checked using
- *               ZSTD_isError().
- */
-size_t ZSTD_decompress_usingDict(ZSTD_DCtx *ctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize, const void *dict, size_t dictSize);
-
-/*-**************************
- * Fast dictionary API
- ***************************/
-
-/**
- * ZSTD_CDictWorkspaceBound() - memory needed to initialize a ZSTD_CDict
- * @cParams: The compression parameters to be used for compression.
- *
- * Return:   A lower bound on the size of the workspace that is passed to
- *           ZSTD_initCDict().
- */
-size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams);
-
-/**
- * struct ZSTD_CDict - a digested dictionary to be used for compression
- */
-typedef struct ZSTD_CDict_s ZSTD_CDict;
-
-/**
- * ZSTD_initCDict() - initialize a digested dictionary for compression
- * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
- *                 ZSTD_CDict so it must outlive the returned ZSTD_CDict.
- * @dictSize:      The size of the dictionary.
- * @params:        The parameters to use for compression. See ZSTD_getParams().
- * @workspace:     The workspace. It must outlive the returned ZSTD_CDict.
- * @workspaceSize: The workspace size. Must be at least
- *                 ZSTD_CDictWorkspaceBound(params.cParams).
- *
- * When compressing multiple messages / blocks with the same dictionary it is
- * recommended to load it just once. The ZSTD_CDict merely references the
- * dictBuffer, so it must outlive the returned ZSTD_CDict.
- *
- * Return:         The digested dictionary emplaced into workspace.
- */
-ZSTD_CDict *ZSTD_initCDict(const void *dictBuffer, size_t dictSize,
-	ZSTD_parameters params, void *workspace, size_t workspaceSize);
-
-/**
- * ZSTD_compress_usingCDict() - compress src into dst using a ZSTD_CDict
- * @ctx:         The context. Must have been initialized with a workspace at
- *               least as large as ZSTD_CCtxWorkspaceBound(cParams) where
- *               cParams are the compression parameters used to initialize the
- *               cdict.
- * @dst:         The buffer to compress src into.
- * @dstCapacity: The size of the destination buffer. May be any size, but
- *               ZSTD_compressBound(srcSize) is guaranteed to be large enough.
- * @src:         The data to compress.
- * @srcSize:     The size of the data to compress.
- * @cdict:       The digested dictionary to use for compression.
- * @params:      The parameters to use for compression. See ZSTD_getParams().
- *
- * Compression using a digested dictionary. The same dictionary must be used
- * during decompression.
- *
- * Return:       The compressed size or an error, which can be checked using
- *               ZSTD_isError().
- */
-size_t ZSTD_compress_usingCDict(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize, const ZSTD_CDict *cdict);
-
-
-/**
- * ZSTD_DDictWorkspaceBound() - memory needed to initialize a ZSTD_DDict
- *
- * Return:  A lower bound on the size of the workspace that is passed to
- *          ZSTD_initDDict().
- */
-size_t ZSTD_DDictWorkspaceBound(void);
-
-/**
- * struct ZSTD_DDict - a digested dictionary to be used for decompression
- */
-typedef struct ZSTD_DDict_s ZSTD_DDict;
-
-/**
- * ZSTD_initDDict() - initialize a digested dictionary for decompression
- * @dictBuffer:    The dictionary to digest. The buffer is referenced by the
- *                 ZSTD_DDict so it must outlive the returned ZSTD_DDict.
- * @dictSize:      The size of the dictionary.
- * @workspace:     The workspace. It must outlive the returned ZSTD_DDict.
- * @workspaceSize: The workspace size. Must be at least
- *                 ZSTD_DDictWorkspaceBound().
- *
- * When decompressing multiple messages / blocks with the same dictionary it is
- * recommended to load it just once. The ZSTD_DDict merely references the
- * dictBuffer, so it must outlive the returned ZSTD_DDict.
- *
- * Return:         The digested dictionary emplaced into workspace.
- */
-ZSTD_DDict *ZSTD_initDDict(const void *dictBuffer, size_t dictSize,
-	void *workspace, size_t workspaceSize);
-
-/**
- * ZSTD_decompress_usingDDict() - decompress src into dst using a ZSTD_DDict
- * @ctx:         The decompression context.
- * @dst:         The buffer to decompress src into.
- * @dstCapacity: The size of the destination buffer. Must be at least as large
- *               as the decompressed size. If the caller cannot upper bound the
- *               decompressed size, then it's better to use the streaming API.
- * @src:         The zstd compressed data to decompress. Multiple concatenated
- *               frames and skippable frames are allowed.
- * @srcSize:     The exact size of the data to decompress.
- * @ddict:       The digested dictionary to use for decompression. The same
- *               dictionary must've been used to compress the data.
- *
- * Return:       The decompressed size or an error, which can be checked using
- *               ZSTD_isError().
- */
-size_t ZSTD_decompress_usingDDict(ZSTD_DCtx *dctx, void *dst,
-	size_t dstCapacity, const void *src, size_t srcSize,
-	const ZSTD_DDict *ddict);
-
-
-/*-**************************
- * Streaming
- ***************************/
-
-/**
- * struct ZSTD_inBuffer - input buffer for streaming
- * @src:  Start of the input buffer.
- * @size: Size of the input buffer.
- * @pos:  Position where reading stopped. Will be updated.
- *        Necessarily 0 <= pos <= size.
- */
-typedef struct ZSTD_inBuffer_s {
-	const void *src;
-	size_t size;
-	size_t pos;
-} ZSTD_inBuffer;
-
-/**
- * struct ZSTD_outBuffer - output buffer for streaming
- * @dst:  Start of the output buffer.
- * @size: Size of the output buffer.
- * @pos:  Position where writing stopped. Will be updated.
- *        Necessarily 0 <= pos <= size.
- */
-typedef struct ZSTD_outBuffer_s {
-	void *dst;
-	size_t size;
-	size_t pos;
-} ZSTD_outBuffer;
-
-
-
-/*-*****************************************************************************
- * Streaming compression - HowTo
- *
- * A ZSTD_CStream object is required to track streaming operation.
- * Use ZSTD_initCStream() to initialize a ZSTD_CStream object.
- * ZSTD_CStream objects can be reused multiple times on consecutive compression
- * operations. It is recommended to re-use ZSTD_CStream in situations where many
- * streaming operations will be achieved consecutively. Use one separate
- * ZSTD_CStream per thread for parallel execution.
- *
- * Use ZSTD_compressStream() repetitively to consume input stream.
- * The function will automatically update both `pos` fields.
- * Note that it may not consume the entire input, in which case `pos < size`,
- * and it's up to the caller to present again remaining data.
- * It returns a hint for the preferred number of bytes to use as an input for
- * the next function call.
- *
- * At any moment, it's possible to flush whatever data remains within internal
- * buffer, using ZSTD_flushStream(). `output->pos` will be updated. There might
- * still be some content left within the internal buffer if `output->size` is
- * too small. It returns the number of bytes left in the internal buffer and
- * must be called until it returns 0.
- *
- * ZSTD_endStream() instructs to finish a frame. It will perform a flush and
- * write frame epilogue. The epilogue is required for decoders to consider a
- * frame completed. Similar to ZSTD_flushStream(), it may not be able to flush
- * the full content if `output->size` is too small. In which case, call again
- * ZSTD_endStream() to complete the flush. It returns the number of bytes left
- * in the internal buffer and must be called until it returns 0.
- ******************************************************************************/
-
-/**
- * ZSTD_CStreamWorkspaceBound() - memory needed to initialize a ZSTD_CStream
- * @cParams: The compression parameters to be used for compression.
- *
- * Return:   A lower bound on the size of the workspace that is passed to
- *           ZSTD_initCStream() and ZSTD_initCStream_usingCDict().
- */
-size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams);
-
-/**
- * struct ZSTD_CStream - the zstd streaming compression context
- */
-typedef struct ZSTD_CStream_s ZSTD_CStream;
-
-/*===== ZSTD_CStream management functions =====*/
-/**
- * ZSTD_initCStream() - initialize a zstd streaming compression context
- * @params:         The zstd compression parameters.
- * @pledgedSrcSize: If params.fParams.contentSizeFlag == 1 then the caller must
- *                  pass the source size (zero means empty source). Otherwise,
- *                  the caller may optionally pass the source size, or zero if
- *                  unknown.
- * @workspace:      The workspace to emplace the context into. It must outlive
- *                  the returned context.
- * @workspaceSize:  The size of workspace.
- *                  Use ZSTD_CStreamWorkspaceBound(params.cParams) to determine
- *                  how large the workspace must be.
- *
- * Return:          The zstd streaming compression context.
- */
-ZSTD_CStream *ZSTD_initCStream(ZSTD_parameters params,
-	unsigned long long pledgedSrcSize, void *workspace,
-	size_t workspaceSize);
-
-/**
- * ZSTD_initCStream_usingCDict() - initialize a streaming compression context
- * @cdict:          The digested dictionary to use for compression.
- * @pledgedSrcSize: Optionally the source size, or zero if unknown.
- * @workspace:      The workspace to emplace the context into. It must outlive
- *                  the returned context.
- * @workspaceSize:  The size of workspace. Call ZSTD_CStreamWorkspaceBound()
- *                  with the cParams used to initialize the cdict to determine
- *                  how large the workspace must be.
- *
- * Return:          The zstd streaming compression context.
- */
-ZSTD_CStream *ZSTD_initCStream_usingCDict(const ZSTD_CDict *cdict,
-	unsigned long long pledgedSrcSize, void *workspace,
-	size_t workspaceSize);
-
-/*===== Streaming compression functions =====*/
-/**
- * ZSTD_resetCStream() - reset the context using parameters from creation
- * @zcs:            The zstd streaming compression context to reset.
- * @pledgedSrcSize: Optionally the source size, or zero if unknown.
- *
- * Resets the context using the parameters from creation. Skips dictionary
- * loading, since it can be reused. If `pledgedSrcSize` is non-zero the frame
- * content size is always written into the frame header.
- *
- * Return:          Zero or an error, which can be checked using ZSTD_isError().
- */
-size_t ZSTD_resetCStream(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize);
-/**
- * ZSTD_compressStream() - streaming compress some of input into output
- * @zcs:    The zstd streaming compression context.
- * @output: Destination buffer. `output->pos` is updated to indicate how much
- *          compressed data was written.
- * @input:  Source buffer. `input->pos` is updated to indicate how much data was
- *          read. Note that it may not consume the entire input, in which case
- *          `input->pos < input->size`, and it's up to the caller to present
- *          remaining data again.
- *
- * The `input` and `output` buffers may be any size. Guaranteed to make some
- * forward progress if `input` and `output` are not empty.
- *
- * Return:  A hint for the number of bytes to use as the input for the next
- *          function call or an error, which can be checked using
- *          ZSTD_isError().
- */
-size_t ZSTD_compressStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output,
-	ZSTD_inBuffer *input);
-/**
- * ZSTD_flushStream() - flush internal buffers into output
- * @zcs:    The zstd streaming compression context.
- * @output: Destination buffer. `output->pos` is updated to indicate how much
- *          compressed data was written.
- *
- * ZSTD_flushStream() must be called until it returns 0, meaning all the data
- * has been flushed. Since ZSTD_flushStream() causes a block to be ended,
- * calling it too often will degrade the compression ratio.
- *
- * Return:  The number of bytes still present within internal buffers or an
- *          error, which can be checked using ZSTD_isError().
- */
-size_t ZSTD_flushStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output);
-/**
- * ZSTD_endStream() - flush internal buffers into output and end the frame
- * @zcs:    The zstd streaming compression context.
- * @output: Destination buffer. `output->pos` is updated to indicate how much
- *          compressed data was written.
- *
- * ZSTD_endStream() must be called until it returns 0, meaning all the data has
- * been flushed and the frame epilogue has been written.
- *
- * Return:  The number of bytes still present within internal buffers or an
- *          error, which can be checked using ZSTD_isError().
- */
-size_t ZSTD_endStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output);
-
-/**
- * ZSTD_CStreamInSize() - recommended size for the input buffer
- *
- * Return: The recommended size for the input buffer.
- */
-size_t ZSTD_CStreamInSize(void);
-/**
- * ZSTD_CStreamOutSize() - recommended size for the output buffer
- *
- * When the output buffer is at least this large, it is guaranteed to be large
- * enough to flush at least one complete compressed block.
- *
- * Return: The recommended size for the output buffer.
- */
-size_t ZSTD_CStreamOutSize(void);
-
-
-
-/*-*****************************************************************************
- * Streaming decompression - HowTo
- *
- * A ZSTD_DStream object is required to track streaming operations.
- * Use ZSTD_initDStream() to initialize a ZSTD_DStream object.
- * ZSTD_DStream objects can be re-used multiple times.
- *
- * Use ZSTD_decompressStream() repetitively to consume your input.
- * The function will update both `pos` fields.
- * If `input->pos < input->size`, some input has not been consumed.
- * It's up to the caller to present again remaining data.
- * If `output->pos < output->size`, decoder has flushed everything it could.
- * Returns 0 iff a frame is completely decoded and fully flushed.
- * Otherwise it returns a suggested next input size that will never load more
- * than the current frame.
- ******************************************************************************/
-
-/**
- * ZSTD_DStreamWorkspaceBound() - memory needed to initialize a ZSTD_DStream
- * @maxWindowSize: The maximum window size allowed for compressed frames.
- *
- * Return:         A lower bound on the size of the workspace that is passed to
- *                 ZSTD_initDStream() and ZSTD_initDStream_usingDDict().
- */
-size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize);
-
-/**
- * struct ZSTD_DStream - the zstd streaming decompression context
- */
-typedef struct ZSTD_DStream_s ZSTD_DStream;
-/*===== ZSTD_DStream management functions =====*/
-/**
- * ZSTD_initDStream() - initialize a zstd streaming decompression context
- * @maxWindowSize: The maximum window size allowed for compressed frames.
- * @workspace:     The workspace to emplace the context into. It must outlive
- *                 the returned context.
- * @workspaceSize: The size of workspace.
- *                 Use ZSTD_DStreamWorkspaceBound(maxWindowSize) to determine
- *                 how large the workspace must be.
- *
- * Return:         The zstd streaming decompression context.
- */
-ZSTD_DStream *ZSTD_initDStream(size_t maxWindowSize, void *workspace,
-	size_t workspaceSize);
-/**
- * ZSTD_initDStream_usingDDict() - initialize streaming decompression context
- * @maxWindowSize: The maximum window size allowed for compressed frames.
- * @ddict:         The digested dictionary to use for decompression.
- * @workspace:     The workspace to emplace the context into. It must outlive
- *                 the returned context.
- * @workspaceSize: The size of workspace.
- *                 Use ZSTD_DStreamWorkspaceBound(maxWindowSize) to determine
- *                 how large the workspace must be.
- *
- * Return:         The zstd streaming decompression context.
- */
-ZSTD_DStream *ZSTD_initDStream_usingDDict(size_t maxWindowSize,
-	const ZSTD_DDict *ddict, void *workspace, size_t workspaceSize);
-
-/*===== Streaming decompression functions =====*/
-/**
- * ZSTD_resetDStream() - reset the context using parameters from creation
- * @zds:   The zstd streaming decompression context to reset.
- *
- * Resets the context using the parameters from creation. Skips dictionary
- * loading, since it can be reused.
- *
- * Return: Zero or an error, which can be checked using ZSTD_isError().
- */
-size_t ZSTD_resetDStream(ZSTD_DStream *zds);
-/**
- * ZSTD_decompressStream() - streaming decompress some of input into output
- * @zds:    The zstd streaming decompression context.
- * @output: Destination buffer. `output.pos` is updated to indicate how much
- *          decompressed data was written.
- * @input:  Source buffer. `input.pos` is updated to indicate how much data was
- *          read. Note that it may not consume the entire input, in which case
- *          `input.pos < input.size`, and it's up to the caller to present
- *          remaining data again.
- *
- * The `input` and `output` buffers may be any size. Guaranteed to make some
- * forward progress if `input` and `output` are not empty.
- * ZSTD_decompressStream() will not consume the last byte of the frame until
- * the entire frame is flushed.
- *
- * Return:  Returns 0 iff a frame is completely decoded and fully flushed.
- *          Otherwise returns a hint for the number of bytes to use as the input
- *          for the next function call or an error, which can be checked using
- *          ZSTD_isError(). The size hint will never load more than the frame.
- */
-size_t ZSTD_decompressStream(ZSTD_DStream *zds, ZSTD_outBuffer *output,
-	ZSTD_inBuffer *input);
-
-/**
- * ZSTD_DStreamInSize() - recommended size for the input buffer
- *
- * Return: The recommended size for the input buffer.
- */
-size_t ZSTD_DStreamInSize(void);
-/**
- * ZSTD_DStreamOutSize() - recommended size for the output buffer
- *
- * When the output buffer is at least this large, it is guaranteed to be large
- * enough to flush at least one complete decompressed block.
- *
- * Return: The recommended size for the output buffer.
- */
-size_t ZSTD_DStreamOutSize(void);
-
-
-/* --- Constants ---*/
-#define ZSTD_MAGICNUMBER            0xFD2FB528   /* >= v0.8.0 */
-#define ZSTD_MAGIC_SKIPPABLE_START  0x184D2A50U
-
-#define ZSTD_CONTENTSIZE_UNKNOWN (0ULL - 1)
-#define ZSTD_CONTENTSIZE_ERROR   (0ULL - 2)
-
-#define ZSTD_WINDOWLOG_MAX_32  27
-#define ZSTD_WINDOWLOG_MAX_64  27
-#define ZSTD_WINDOWLOG_MAX \
-	((unsigned int)(sizeof(size_t) == 4 \
-		? ZSTD_WINDOWLOG_MAX_32 \
-		: ZSTD_WINDOWLOG_MAX_64))
-#define ZSTD_WINDOWLOG_MIN 10
-#define ZSTD_HASHLOG_MAX ZSTD_WINDOWLOG_MAX
-#define ZSTD_HASHLOG_MIN        6
-#define ZSTD_CHAINLOG_MAX     (ZSTD_WINDOWLOG_MAX+1)
-#define ZSTD_CHAINLOG_MIN      ZSTD_HASHLOG_MIN
-#define ZSTD_HASHLOG3_MAX      17
-#define ZSTD_SEARCHLOG_MAX    (ZSTD_WINDOWLOG_MAX-1)
-#define ZSTD_SEARCHLOG_MIN      1
-/* only for ZSTD_fast, other strategies are limited to 6 */
-#define ZSTD_SEARCHLENGTH_MAX   7
-/* only for ZSTD_btopt, other strategies are limited to 4 */
-#define ZSTD_SEARCHLENGTH_MIN   3
-#define ZSTD_TARGETLENGTH_MIN   4
-#define ZSTD_TARGETLENGTH_MAX 999
-
-/* for static allocation */
-#define ZSTD_FRAMEHEADERSIZE_MAX 18
-#define ZSTD_FRAMEHEADERSIZE_MIN  6
-static const size_t ZSTD_frameHeaderSize_prefix = 5;
-static const size_t ZSTD_frameHeaderSize_min = ZSTD_FRAMEHEADERSIZE_MIN;
-static const size_t ZSTD_frameHeaderSize_max = ZSTD_FRAMEHEADERSIZE_MAX;
-/* magic number + skippable frame length */
-static const size_t ZSTD_skippableHeaderSize = 8;
-
-
-/*-*************************************
- * Compressed size functions
- **************************************/
-
-/**
- * ZSTD_findFrameCompressedSize() - returns the size of a compressed frame
- * @src:     Source buffer. It should point to the start of a zstd encoded frame
- *           or a skippable frame.
- * @srcSize: The size of the source buffer. It must be at least as large as the
- *           size of the frame.
- *
- * Return:   The compressed size of the frame pointed to by `src` or an error,
- *           which can be check with ZSTD_isError().
- *           Suitable to pass to ZSTD_decompress() or similar functions.
- */
-size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize);
-
-/*-*************************************
- * Decompressed size functions
- **************************************/
-/**
- * ZSTD_getFrameContentSize() - returns the content size in a zstd frame header
- * @src:     It should point to the start of a zstd encoded frame.
- * @srcSize: The size of the source buffer. It must be at least as large as the
- *           frame header. `ZSTD_frameHeaderSize_max` is always large enough.
- *
- * Return:   The frame content size stored in the frame header if known.
- *           `ZSTD_CONTENTSIZE_UNKNOWN` if the content size isn't stored in the
- *           frame header. `ZSTD_CONTENTSIZE_ERROR` on invalid input.
- */
-unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
-
-/**
- * ZSTD_findDecompressedSize() - returns decompressed size of a series of frames
- * @src:     It should point to the start of a series of zstd encoded and/or
- *           skippable frames.
- * @srcSize: The exact size of the series of frames.
- *
- * If any zstd encoded frame in the series doesn't have the frame content size
- * set, `ZSTD_CONTENTSIZE_UNKNOWN` is returned. But frame content size is always
- * set when using ZSTD_compress(). The decompressed size can be very large.
- * If the source is untrusted, the decompressed size could be wrong or
- * intentionally modified. Always ensure the result fits within the
- * application's authorized limits. ZSTD_findDecompressedSize() handles multiple
- * frames, and so it must traverse the input to read each frame header. This is
- * efficient as most of the data is skipped, however it does mean that all frame
- * data must be present and valid.
- *
- * Return:   Decompressed size of all the data contained in the frames if known.
- *           `ZSTD_CONTENTSIZE_UNKNOWN` if the decompressed size is unknown.
- *           `ZSTD_CONTENTSIZE_ERROR` if an error occurred.
- */
-unsigned long long ZSTD_findDecompressedSize(const void *src, size_t srcSize);
-
-/*-*************************************
- * Advanced compression functions
- **************************************/
-/**
- * ZSTD_checkCParams() - ensure parameter values remain within authorized range
- * @cParams: The zstd compression parameters.
- *
- * Return:   Zero or an error, which can be checked using ZSTD_isError().
- */
-size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams);
-
-/**
- * ZSTD_adjustCParams() - optimize parameters for a given srcSize and dictSize
- * @srcSize:  Optionally the estimated source size, or zero if unknown.
- * @dictSize: Optionally the estimated dictionary size, or zero if unknown.
- *
- * Return:    The optimized parameters.
- */
-ZSTD_compressionParameters ZSTD_adjustCParams(
-	ZSTD_compressionParameters cParams, unsigned long long srcSize,
-	size_t dictSize);
-
-/*--- Advanced decompression functions ---*/
-
-/**
- * ZSTD_isFrame() - returns true iff the buffer starts with a valid frame
- * @buffer: The source buffer to check.
- * @size:   The size of the source buffer, must be at least 4 bytes.
- *
- * Return: True iff the buffer starts with a zstd or skippable frame identifier.
- */
-unsigned int ZSTD_isFrame(const void *buffer, size_t size);
-
-/**
- * ZSTD_getDictID_fromDict() - returns the dictionary id stored in a dictionary
- * @dict:     The dictionary buffer.
- * @dictSize: The size of the dictionary buffer.
- *
- * Return:    The dictionary id stored within the dictionary or 0 if the
- *            dictionary is not a zstd dictionary. If it returns 0 the
- *            dictionary can still be loaded as a content-only dictionary.
- */
-unsigned int ZSTD_getDictID_fromDict(const void *dict, size_t dictSize);
-
-/**
- * ZSTD_getDictID_fromDDict() - returns the dictionary id stored in a ZSTD_DDict
- * @ddict: The ddict to find the id of.
- *
- * Return: The dictionary id stored within `ddict` or 0 if the dictionary is not
- *         a zstd dictionary. If it returns 0 `ddict` will be loaded as a
- *         content-only dictionary.
- */
-unsigned int ZSTD_getDictID_fromDDict(const ZSTD_DDict *ddict);
-
-/**
- * ZSTD_getDictID_fromFrame() - returns the dictionary id stored in a zstd frame
- * @src:     Source buffer. It must be a zstd encoded frame.
- * @srcSize: The size of the source buffer. It must be at least as large as the
- *           frame header. `ZSTD_frameHeaderSize_max` is always large enough.
- *
- * Return:   The dictionary id required to decompress the frame stored within
- *           `src` or 0 if the dictionary id could not be decoded. It can return
- *           0 if the frame does not require a dictionary, the dictionary id
- *           wasn't stored in the frame, `src` is not a zstd frame, or `srcSize`
- *           is too small.
- */
-unsigned int ZSTD_getDictID_fromFrame(const void *src, size_t srcSize);
-
-/**
- * struct ZSTD_frameParams - zstd frame parameters stored in the frame header
- * @frameContentSize: The frame content size, or 0 if not present.
- * @windowSize:       The window size, or 0 if the frame is a skippable frame.
- * @dictID:           The dictionary id, or 0 if not present.
- * @checksumFlag:     Whether a checksum was used.
- */
-typedef struct {
-	unsigned long long frameContentSize;
-	unsigned int windowSize;
-	unsigned int dictID;
-	unsigned int checksumFlag;
-} ZSTD_frameParams;
-
-/**
- * ZSTD_getFrameParams() - extracts parameters from a zstd or skippable frame
- * @fparamsPtr: On success the frame parameters are written here.
- * @src:        The source buffer. It must point to a zstd or skippable frame.
- * @srcSize:    The size of the source buffer. `ZSTD_frameHeaderSize_max` is
- *              always large enough to succeed.
- *
- * Return:      0 on success. If more data is required it returns how many bytes
- *              must be provided to make forward progress. Otherwise it returns
- *              an error, which can be checked using ZSTD_isError().
- */
-size_t ZSTD_getFrameParams(ZSTD_frameParams *fparamsPtr, const void *src,
-	size_t srcSize);
-
-/*-*****************************************************************************
- * Buffer-less and synchronous inner streaming functions
- *
- * This is an advanced API, giving full control over buffer management, for
- * users which need direct control over memory.
- * But it's also a complex one, with many restrictions (documented below).
- * Prefer using normal streaming API for an easier experience
- ******************************************************************************/
-
-/*-*****************************************************************************
- * Buffer-less streaming compression (synchronous mode)
- *
- * A ZSTD_CCtx object is required to track streaming operations.
- * Use ZSTD_initCCtx() to initialize a context.
- * ZSTD_CCtx object can be re-used multiple times within successive compression
- * operations.
- *
- * Start by initializing a context.
- * Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary
- * compression,
- * or ZSTD_compressBegin_advanced(), for finer parameter control.
- * It's also possible to duplicate a reference context which has already been
- * initialized, using ZSTD_copyCCtx()
- *
- * Then, consume your input using ZSTD_compressContinue().
- * There are some important considerations to keep in mind when using this
- * advanced function :
- * - ZSTD_compressContinue() has no internal buffer. It uses externally provided
- *   buffer only.
- * - Interface is synchronous : input is consumed entirely and produce 1+
- *   (or more) compressed blocks.
- * - Caller must ensure there is enough space in `dst` to store compressed data
- *   under worst case scenario. Worst case evaluation is provided by
- *   ZSTD_compressBound().
- *   ZSTD_compressContinue() doesn't guarantee recover after a failed
- *   compression.
- * - ZSTD_compressContinue() presumes prior input ***is still accessible and
- *   unmodified*** (up to maximum distance size, see WindowLog).
- *   It remembers all previous contiguous blocks, plus one separated memory
- *   segment (which can itself consists of multiple contiguous blocks)
- * - ZSTD_compressContinue() detects that prior input has been overwritten when
- *   `src` buffer overlaps. In which case, it will "discard" the relevant memory
- *   section from its history.
- *
- * Finish a frame with ZSTD_compressEnd(), which will write the last block(s)
- * and optional checksum. It's possible to use srcSize==0, in which case, it
- * will write a final empty block to end the frame. Without last block mark,
- * frames will be considered unfinished (corrupted) by decoders.
- *
- * `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress some new
- * frame.
- ******************************************************************************/
-
-/*=====   Buffer-less streaming compression functions  =====*/
-size_t ZSTD_compressBegin(ZSTD_CCtx *cctx, int compressionLevel);
-size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx *cctx, const void *dict,
-	size_t dictSize, int compressionLevel);
-size_t ZSTD_compressBegin_advanced(ZSTD_CCtx *cctx, const void *dict,
-	size_t dictSize, ZSTD_parameters params,
-	unsigned long long pledgedSrcSize);
-size_t ZSTD_copyCCtx(ZSTD_CCtx *cctx, const ZSTD_CCtx *preparedCCtx,
-	unsigned long long pledgedSrcSize);
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx *cctx, const ZSTD_CDict *cdict,
-	unsigned long long pledgedSrcSize);
-size_t ZSTD_compressContinue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize);
-size_t ZSTD_compressEnd(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize);
-
-
-
-/*-*****************************************************************************
- * Buffer-less streaming decompression (synchronous mode)
- *
- * A ZSTD_DCtx object is required to track streaming operations.
- * Use ZSTD_initDCtx() to initialize a context.
- * A ZSTD_DCtx object can be re-used multiple times.
- *
- * First typical operation is to retrieve frame parameters, using
- * ZSTD_getFrameParams(). It fills a ZSTD_frameParams structure which provide
- * important information to correctly decode the frame, such as the minimum
- * rolling buffer size to allocate to decompress data (`windowSize`), and the
- * dictionary ID used.
- * Note: content size is optional, it may not be present. 0 means unknown.
- * Note that these values could be wrong, either because of data malformation,
- * or because an attacker is spoofing deliberate false information. As a
- * consequence, check that values remain within valid application range,
- * especially `windowSize`, before allocation. Each application can set its own
- * limit, depending on local restrictions. For extended interoperability, it is
- * recommended to support at least 8 MB.
- * Frame parameters are extracted from the beginning of the compressed frame.
- * Data fragment must be large enough to ensure successful decoding, typically
- * `ZSTD_frameHeaderSize_max` bytes.
- * Result: 0: successful decoding, the `ZSTD_frameParams` structure is filled.
- *        >0: `srcSize` is too small, provide at least this many bytes.
- *        errorCode, which can be tested using ZSTD_isError().
- *
- * Start decompression, with ZSTD_decompressBegin() or
- * ZSTD_decompressBegin_usingDict(). Alternatively, you can copy a prepared
- * context, using ZSTD_copyDCtx().
- *
- * Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue()
- * alternatively.
- * ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize'
- * to ZSTD_decompressContinue().
- * ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will
- * fail.
- *
- * The result of ZSTD_decompressContinue() is the number of bytes regenerated
- * within 'dst' (necessarily <= dstCapacity). It can be zero, which is not an
- * error; it just means ZSTD_decompressContinue() has decoded some metadata
- * item. It can also be an error code, which can be tested with ZSTD_isError().
- *
- * ZSTD_decompressContinue() needs previous data blocks during decompression, up
- * to `windowSize`. They should preferably be located contiguously, prior to
- * current block. Alternatively, a round buffer of sufficient size is also
- * possible. Sufficient size is determined by frame parameters.
- * ZSTD_decompressContinue() is very sensitive to contiguity, if 2 blocks don't
- * follow each other, make sure that either the compressor breaks contiguity at
- * the same place, or that previous contiguous segment is large enough to
- * properly handle maximum back-reference.
- *
- * A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
- * Context can then be reset to start a new decompression.
- *
- * Note: it's possible to know if next input to present is a header or a block,
- * using ZSTD_nextInputType(). This information is not required to properly
- * decode a frame.
- *
- * == Special case: skippable frames ==
- *
- * Skippable frames allow integration of user-defined data into a flow of
- * concatenated frames. Skippable frames will be ignored (skipped) by a
- * decompressor. The format of skippable frames is as follows:
- * a) Skippable frame ID - 4 Bytes, Little endian format, any value from
- *    0x184D2A50 to 0x184D2A5F
- * b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
- * c) Frame Content - any content (User Data) of length equal to Frame Size
- * For skippable frames ZSTD_decompressContinue() always returns 0.
- * For skippable frames ZSTD_getFrameParams() returns fparamsPtr->windowLog==0
- * what means that a frame is skippable.
- * Note: If fparamsPtr->frameContentSize==0, it is ambiguous: the frame might
- *       actually be a zstd encoded frame with no content. For purposes of
- *       decompression, it is valid in both cases to skip the frame using
- *       ZSTD_findFrameCompressedSize() to find its size in bytes.
- * It also returns frame size as fparamsPtr->frameContentSize.
- ******************************************************************************/
-
-/*=====   Buffer-less streaming decompression functions  =====*/
-size_t ZSTD_decompressBegin(ZSTD_DCtx *dctx);
-size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx *dctx, const void *dict,
-	size_t dictSize);
-void   ZSTD_copyDCtx(ZSTD_DCtx *dctx, const ZSTD_DCtx *preparedDCtx);
-size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx *dctx);
-size_t ZSTD_decompressContinue(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize);
-typedef enum {
-	ZSTDnit_frameHeader,
-	ZSTDnit_blockHeader,
-	ZSTDnit_block,
-	ZSTDnit_lastBlock,
-	ZSTDnit_checksum,
-	ZSTDnit_skippableFrame
-} ZSTD_nextInputType_e;
-ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx *dctx);
-
-/*-*****************************************************************************
- * Block functions
- *
- * Block functions produce and decode raw zstd blocks, without frame metadata.
- * Frame metadata cost is typically ~18 bytes, which can be non-negligible for
- * very small blocks (< 100 bytes). User will have to take in charge required
- * information to regenerate data, such as compressed and content sizes.
- *
- * A few rules to respect:
- * - Compressing and decompressing require a context structure
- *   + Use ZSTD_initCCtx() and ZSTD_initDCtx()
- * - It is necessary to init context before starting
- *   + compression : ZSTD_compressBegin()
- *   + decompression : ZSTD_decompressBegin()
- *   + variants _usingDict() are also allowed
- *   + copyCCtx() and copyDCtx() work too
- * - Block size is limited, it must be <= ZSTD_getBlockSizeMax()
- *   + If you need to compress more, cut data into multiple blocks
- *   + Consider using the regular ZSTD_compress() instead, as frame metadata
- *     costs become negligible when source size is large.
- * - When a block is considered not compressible enough, ZSTD_compressBlock()
- *   result will be zero. In which case, nothing is produced into `dst`.
- *   + User must test for such outcome and deal directly with uncompressed data
- *   + ZSTD_decompressBlock() doesn't accept uncompressed data as input!!!
- *   + In case of multiple successive blocks, decoder must be informed of
- *     uncompressed block existence to follow proper history. Use
- *     ZSTD_insertBlock() in such a case.
- ******************************************************************************/
-
-/* Define for static allocation */
-#define ZSTD_BLOCKSIZE_ABSOLUTEMAX (128 * 1024)
-/*=====   Raw zstd block functions  =====*/
-size_t ZSTD_getBlockSizeMax(ZSTD_CCtx *cctx);
-size_t ZSTD_compressBlock(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize);
-size_t ZSTD_decompressBlock(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity,
-	const void *src, size_t srcSize);
-size_t ZSTD_insertBlock(ZSTD_DCtx *dctx, const void *blockStart,
-	size_t blockSize);
-
-#endif  /* ZSTD_H */
diff --git a/priv/zstd/contrib/linux-kernel/kernelize.sh b/priv/zstd/contrib/linux-kernel/kernelize.sh
deleted file mode 100755
index 21aa2ec..0000000
--- a/priv/zstd/contrib/linux-kernel/kernelize.sh
+++ /dev/null
@@ -1,110 +0,0 @@
-#!/bin/sh
-set -e
-
-# Constants
-SED_COMMANDS="commands.tmp"
-CLANG_FORMAT="clang-format-3.9"
-INCLUDE='include/linux/'
-LIB='lib/zstd/'
-SPACES='    '
-TAB=$'\t'
-TMP="replacements.tmp"
-
-function prompt() {
-  while true; do
-    read -p "$1 [Y/n]" yn
-    case $yn in
-        '' ) yes='yes'; break;;
-        [Yy]* ) yes='yes'; break;;
-        [Nn]* ) yes=''; break;;
-        * ) echo "Please answer yes or no.";;
-    esac
-done
-}
-
-function check_not_present() {
-  grep "$1" $INCLUDE*.h ${LIB}*.{h,c} && exit 1 || true
-}
-
-function check_not_present_in_file() {
-  grep "$1" "$2" && exit 1 || true
-}
-
-function check_present_in_file() {
-  grep "$1" "$2" > /dev/null 2> /dev/null || exit 1
-}
-
-echo "Files: " $INCLUDE*.h $LIB*.{h,c}
-
-prompt "Do you wish to replace 4 spaces with a tab?"
-if [ ! -z "$yes" ]
-then
-  # Check files for existing tabs
-  grep "$TAB" $INCLUDE*.h $LIB*.{h,c} && exit 1 || true
-  # Replace the first tab on every line
-  sed -i '' "s/^$SPACES/$TAB/" $INCLUDE*.h $LIB*.{h,c}
-
-  # Execute once and then execute as long as replacements are happening
-  more_work="yes"
-  while [ ! -z "$more_work" ]
-  do
-    rm -f $TMP
-    # Replaces $SPACES that directly follow a $TAB with a $TAB.
-    # $TMP will be non-empty if any replacements took place.
-    sed -i '' "s/$TAB$SPACES/$TAB$TAB/w $TMP" $INCLUDE*.h $LIB*.{h,c}
-    more_work=$(cat "$TMP")
-  done
-  rm -f $TMP
-fi
-
-prompt "Do you wish to replace '{   ' with a tab?"
-if [ ! -z "$yes" ]
-then
-  sed -i '' "s/$TAB{   /$TAB{$TAB/g" $INCLUDE*.h $LIB*.{h,c}
-fi
-
-rm -f $SED_COMMANDS
-cat > $SED_COMMANDS <
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
-/*-*************************************
- * Macros
- **************************************/
-#define xxh_rotl32(x, r) ((x << r) | (x >> (32 - r)))
-#define xxh_rotl64(x, r) ((x << r) | (x >> (64 - r)))
-
-#ifdef __LITTLE_ENDIAN
-# define XXH_CPU_LITTLE_ENDIAN 1
-#else
-# define XXH_CPU_LITTLE_ENDIAN 0
-#endif
-
-/*-*************************************
- * Constants
- **************************************/
-static const uint32_t PRIME32_1 = 2654435761U;
-static const uint32_t PRIME32_2 = 2246822519U;
-static const uint32_t PRIME32_3 = 3266489917U;
-static const uint32_t PRIME32_4 =  668265263U;
-static const uint32_t PRIME32_5 =  374761393U;
-
-static const uint64_t PRIME64_1 = 11400714785074694791ULL;
-static const uint64_t PRIME64_2 = 14029467366897019727ULL;
-static const uint64_t PRIME64_3 =  1609587929392839161ULL;
-static const uint64_t PRIME64_4 =  9650029242287828579ULL;
-static const uint64_t PRIME64_5 =  2870177450012600261ULL;
-
-/*-**************************
- *  Utils
- ***************************/
-void xxh32_copy_state(struct xxh32_state *dst, const struct xxh32_state *src)
-{
-	memcpy(dst, src, sizeof(*dst));
-}
-EXPORT_SYMBOL(xxh32_copy_state);
-
-void xxh64_copy_state(struct xxh64_state *dst, const struct xxh64_state *src)
-{
-	memcpy(dst, src, sizeof(*dst));
-}
-EXPORT_SYMBOL(xxh64_copy_state);
-
-/*-***************************
- * Simple Hash Functions
- ****************************/
-static uint32_t xxh32_round(uint32_t seed, const uint32_t input)
-{
-	seed += input * PRIME32_2;
-	seed = xxh_rotl32(seed, 13);
-	seed *= PRIME32_1;
-	return seed;
-}
-
-uint32_t xxh32(const void *input, const size_t len, const uint32_t seed)
-{
-	const uint8_t *p = (const uint8_t *)input;
-	const uint8_t *b_end = p + len;
-	uint32_t h32;
-
-	if (len >= 16) {
-		const uint8_t *const limit = b_end - 16;
-		uint32_t v1 = seed + PRIME32_1 + PRIME32_2;
-		uint32_t v2 = seed + PRIME32_2;
-		uint32_t v3 = seed + 0;
-		uint32_t v4 = seed - PRIME32_1;
-
-		do {
-			v1 = xxh32_round(v1, get_unaligned_le32(p));
-			p += 4;
-			v2 = xxh32_round(v2, get_unaligned_le32(p));
-			p += 4;
-			v3 = xxh32_round(v3, get_unaligned_le32(p));
-			p += 4;
-			v4 = xxh32_round(v4, get_unaligned_le32(p));
-			p += 4;
-		} while (p <= limit);
-
-		h32 = xxh_rotl32(v1, 1) + xxh_rotl32(v2, 7) +
-			xxh_rotl32(v3, 12) + xxh_rotl32(v4, 18);
-	} else {
-		h32 = seed + PRIME32_5;
-	}
-
-	h32 += (uint32_t)len;
-
-	while (p + 4 <= b_end) {
-		h32 += get_unaligned_le32(p) * PRIME32_3;
-		h32 = xxh_rotl32(h32, 17) * PRIME32_4;
-		p += 4;
-	}
-
-	while (p < b_end) {
-		h32 += (*p) * PRIME32_5;
-		h32 = xxh_rotl32(h32, 11) * PRIME32_1;
-		p++;
-	}
-
-	h32 ^= h32 >> 15;
-	h32 *= PRIME32_2;
-	h32 ^= h32 >> 13;
-	h32 *= PRIME32_3;
-	h32 ^= h32 >> 16;
-
-	return h32;
-}
-EXPORT_SYMBOL(xxh32);
-
-static uint64_t xxh64_round(uint64_t acc, const uint64_t input)
-{
-	acc += input * PRIME64_2;
-	acc = xxh_rotl64(acc, 31);
-	acc *= PRIME64_1;
-	return acc;
-}
-
-static uint64_t xxh64_merge_round(uint64_t acc, uint64_t val)
-{
-	val = xxh64_round(0, val);
-	acc ^= val;
-	acc = acc * PRIME64_1 + PRIME64_4;
-	return acc;
-}
-
-uint64_t xxh64(const void *input, const size_t len, const uint64_t seed)
-{
-	const uint8_t *p = (const uint8_t *)input;
-	const uint8_t *const b_end = p + len;
-	uint64_t h64;
-
-	if (len >= 32) {
-		const uint8_t *const limit = b_end - 32;
-		uint64_t v1 = seed + PRIME64_1 + PRIME64_2;
-		uint64_t v2 = seed + PRIME64_2;
-		uint64_t v3 = seed + 0;
-		uint64_t v4 = seed - PRIME64_1;
-
-		do {
-			v1 = xxh64_round(v1, get_unaligned_le64(p));
-			p += 8;
-			v2 = xxh64_round(v2, get_unaligned_le64(p));
-			p += 8;
-			v3 = xxh64_round(v3, get_unaligned_le64(p));
-			p += 8;
-			v4 = xxh64_round(v4, get_unaligned_le64(p));
-			p += 8;
-		} while (p <= limit);
-
-		h64 = xxh_rotl64(v1, 1) + xxh_rotl64(v2, 7) +
-			xxh_rotl64(v3, 12) + xxh_rotl64(v4, 18);
-		h64 = xxh64_merge_round(h64, v1);
-		h64 = xxh64_merge_round(h64, v2);
-		h64 = xxh64_merge_round(h64, v3);
-		h64 = xxh64_merge_round(h64, v4);
-
-	} else {
-		h64  = seed + PRIME64_5;
-	}
-
-	h64 += (uint64_t)len;
-
-	while (p + 8 <= b_end) {
-		const uint64_t k1 = xxh64_round(0, get_unaligned_le64(p));
-
-		h64 ^= k1;
-		h64 = xxh_rotl64(h64, 27) * PRIME64_1 + PRIME64_4;
-		p += 8;
-	}
-
-	if (p + 4 <= b_end) {
-		h64 ^= (uint64_t)(get_unaligned_le32(p)) * PRIME64_1;
-		h64 = xxh_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-		p += 4;
-	}
-
-	while (p < b_end) {
-		h64 ^= (*p) * PRIME64_5;
-		h64 = xxh_rotl64(h64, 11) * PRIME64_1;
-		p++;
-	}
-
-	h64 ^= h64 >> 33;
-	h64 *= PRIME64_2;
-	h64 ^= h64 >> 29;
-	h64 *= PRIME64_3;
-	h64 ^= h64 >> 32;
-
-	return h64;
-}
-EXPORT_SYMBOL(xxh64);
-
-/*-**************************************************
- * Advanced Hash Functions
- ***************************************************/
-void xxh32_reset(struct xxh32_state *statePtr, const uint32_t seed)
-{
-	/* use a local state for memcpy() to avoid strict-aliasing warnings */
-	struct xxh32_state state;
-
-	memset(&state, 0, sizeof(state));
-	state.v1 = seed + PRIME32_1 + PRIME32_2;
-	state.v2 = seed + PRIME32_2;
-	state.v3 = seed + 0;
-	state.v4 = seed - PRIME32_1;
-	memcpy(statePtr, &state, sizeof(state));
-}
-EXPORT_SYMBOL(xxh32_reset);
-
-void xxh64_reset(struct xxh64_state *statePtr, const uint64_t seed)
-{
-	/* use a local state for memcpy() to avoid strict-aliasing warnings */
-	struct xxh64_state state;
-
-	memset(&state, 0, sizeof(state));
-	state.v1 = seed + PRIME64_1 + PRIME64_2;
-	state.v2 = seed + PRIME64_2;
-	state.v3 = seed + 0;
-	state.v4 = seed - PRIME64_1;
-	memcpy(statePtr, &state, sizeof(state));
-}
-EXPORT_SYMBOL(xxh64_reset);
-
-int xxh32_update(struct xxh32_state *state, const void *input, const size_t len)
-{
-	const uint8_t *p = (const uint8_t *)input;
-	const uint8_t *const b_end = p + len;
-
-	if (input == NULL)
-		return -EINVAL;
-
-	state->total_len_32 += (uint32_t)len;
-	state->large_len |= (len >= 16) | (state->total_len_32 >= 16);
-
-	if (state->memsize + len < 16) { /* fill in tmp buffer */
-		memcpy((uint8_t *)(state->mem32) + state->memsize, input, len);
-		state->memsize += (uint32_t)len;
-		return 0;
-	}
-
-	if (state->memsize) { /* some data left from previous update */
-		const uint32_t *p32 = state->mem32;
-
-		memcpy((uint8_t *)(state->mem32) + state->memsize, input,
-			16 - state->memsize);
-
-		state->v1 = xxh32_round(state->v1, get_unaligned_le32(p32));
-		p32++;
-		state->v2 = xxh32_round(state->v2, get_unaligned_le32(p32));
-		p32++;
-		state->v3 = xxh32_round(state->v3, get_unaligned_le32(p32));
-		p32++;
-		state->v4 = xxh32_round(state->v4, get_unaligned_le32(p32));
-		p32++;
-
-		p += 16-state->memsize;
-		state->memsize = 0;
-	}
-
-	if (p <= b_end - 16) {
-		const uint8_t *const limit = b_end - 16;
-		uint32_t v1 = state->v1;
-		uint32_t v2 = state->v2;
-		uint32_t v3 = state->v3;
-		uint32_t v4 = state->v4;
-
-		do {
-			v1 = xxh32_round(v1, get_unaligned_le32(p));
-			p += 4;
-			v2 = xxh32_round(v2, get_unaligned_le32(p));
-			p += 4;
-			v3 = xxh32_round(v3, get_unaligned_le32(p));
-			p += 4;
-			v4 = xxh32_round(v4, get_unaligned_le32(p));
-			p += 4;
-		} while (p <= limit);
-
-		state->v1 = v1;
-		state->v2 = v2;
-		state->v3 = v3;
-		state->v4 = v4;
-	}
-
-	if (p < b_end) {
-		memcpy(state->mem32, p, (size_t)(b_end-p));
-		state->memsize = (uint32_t)(b_end-p);
-	}
-
-	return 0;
-}
-EXPORT_SYMBOL(xxh32_update);
-
-uint32_t xxh32_digest(const struct xxh32_state *state)
-{
-	const uint8_t *p = (const uint8_t *)state->mem32;
-	const uint8_t *const b_end = (const uint8_t *)(state->mem32) +
-		state->memsize;
-	uint32_t h32;
-
-	if (state->large_len) {
-		h32 = xxh_rotl32(state->v1, 1) + xxh_rotl32(state->v2, 7) +
-			xxh_rotl32(state->v3, 12) + xxh_rotl32(state->v4, 18);
-	} else {
-		h32 = state->v3 /* == seed */ + PRIME32_5;
-	}
-
-	h32 += state->total_len_32;
-
-	while (p + 4 <= b_end) {
-		h32 += get_unaligned_le32(p) * PRIME32_3;
-		h32 = xxh_rotl32(h32, 17) * PRIME32_4;
-		p += 4;
-	}
-
-	while (p < b_end) {
-		h32 += (*p) * PRIME32_5;
-		h32 = xxh_rotl32(h32, 11) * PRIME32_1;
-		p++;
-	}
-
-	h32 ^= h32 >> 15;
-	h32 *= PRIME32_2;
-	h32 ^= h32 >> 13;
-	h32 *= PRIME32_3;
-	h32 ^= h32 >> 16;
-
-	return h32;
-}
-EXPORT_SYMBOL(xxh32_digest);
-
-int xxh64_update(struct xxh64_state *state, const void *input, const size_t len)
-{
-	const uint8_t *p = (const uint8_t *)input;
-	const uint8_t *const b_end = p + len;
-
-	if (input == NULL)
-		return -EINVAL;
-
-	state->total_len += len;
-
-	if (state->memsize + len < 32) { /* fill in tmp buffer */
-		memcpy(((uint8_t *)state->mem64) + state->memsize, input, len);
-		state->memsize += (uint32_t)len;
-		return 0;
-	}
-
-	if (state->memsize) { /* tmp buffer is full */
-		uint64_t *p64 = state->mem64;
-
-		memcpy(((uint8_t *)p64) + state->memsize, input,
-			32 - state->memsize);
-
-		state->v1 = xxh64_round(state->v1, get_unaligned_le64(p64));
-		p64++;
-		state->v2 = xxh64_round(state->v2, get_unaligned_le64(p64));
-		p64++;
-		state->v3 = xxh64_round(state->v3, get_unaligned_le64(p64));
-		p64++;
-		state->v4 = xxh64_round(state->v4, get_unaligned_le64(p64));
-
-		p += 32 - state->memsize;
-		state->memsize = 0;
-	}
-
-	if (p + 32 <= b_end) {
-		const uint8_t *const limit = b_end - 32;
-		uint64_t v1 = state->v1;
-		uint64_t v2 = state->v2;
-		uint64_t v3 = state->v3;
-		uint64_t v4 = state->v4;
-
-		do {
-			v1 = xxh64_round(v1, get_unaligned_le64(p));
-			p += 8;
-			v2 = xxh64_round(v2, get_unaligned_le64(p));
-			p += 8;
-			v3 = xxh64_round(v3, get_unaligned_le64(p));
-			p += 8;
-			v4 = xxh64_round(v4, get_unaligned_le64(p));
-			p += 8;
-		} while (p <= limit);
-
-		state->v1 = v1;
-		state->v2 = v2;
-		state->v3 = v3;
-		state->v4 = v4;
-	}
-
-	if (p < b_end) {
-		memcpy(state->mem64, p, (size_t)(b_end-p));
-		state->memsize = (uint32_t)(b_end - p);
-	}
-
-	return 0;
-}
-EXPORT_SYMBOL(xxh64_update);
-
-uint64_t xxh64_digest(const struct xxh64_state *state)
-{
-	const uint8_t *p = (const uint8_t *)state->mem64;
-	const uint8_t *const b_end = (const uint8_t *)state->mem64 +
-		state->memsize;
-	uint64_t h64;
-
-	if (state->total_len >= 32) {
-		const uint64_t v1 = state->v1;
-		const uint64_t v2 = state->v2;
-		const uint64_t v3 = state->v3;
-		const uint64_t v4 = state->v4;
-
-		h64 = xxh_rotl64(v1, 1) + xxh_rotl64(v2, 7) +
-			xxh_rotl64(v3, 12) + xxh_rotl64(v4, 18);
-		h64 = xxh64_merge_round(h64, v1);
-		h64 = xxh64_merge_round(h64, v2);
-		h64 = xxh64_merge_round(h64, v3);
-		h64 = xxh64_merge_round(h64, v4);
-	} else {
-		h64  = state->v3 + PRIME64_5;
-	}
-
-	h64 += (uint64_t)state->total_len;
-
-	while (p + 8 <= b_end) {
-		const uint64_t k1 = xxh64_round(0, get_unaligned_le64(p));
-
-		h64 ^= k1;
-		h64 = xxh_rotl64(h64, 27) * PRIME64_1 + PRIME64_4;
-		p += 8;
-	}
-
-	if (p + 4 <= b_end) {
-		h64 ^= (uint64_t)(get_unaligned_le32(p)) * PRIME64_1;
-		h64 = xxh_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-		p += 4;
-	}
-
-	while (p < b_end) {
-		h64 ^= (*p) * PRIME64_5;
-		h64 = xxh_rotl64(h64, 11) * PRIME64_1;
-		p++;
-	}
-
-	h64 ^= h64 >> 33;
-	h64 *= PRIME64_2;
-	h64 ^= h64 >> 29;
-	h64 *= PRIME64_3;
-	h64 ^= h64 >> 32;
-
-	return h64;
-}
-EXPORT_SYMBOL(xxh64_digest);
-
-MODULE_LICENSE("Dual BSD/GPL");
-MODULE_DESCRIPTION("xxHash");
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/.clang-format b/priv/zstd/contrib/linux-kernel/lib/zstd/.clang-format
deleted file mode 100644
index 0c6cf3b..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/.clang-format
+++ /dev/null
@@ -1,11 +0,0 @@
-BasedOnStyle: LLVM
-IndentWidth: 8
-UseTab: Always
-BreakBeforeBraces: Linux
-AllowShortIfStatementsOnASingleLine: false
-IndentCaseLabels: false
-
-ColumnLimit: 160
-AlignEscapedNewlinesLeft: true
-ReflowComments: true
-AllowShortCaseLabelsOnASingleLine: true
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/Makefile b/priv/zstd/contrib/linux-kernel/lib/zstd/Makefile
deleted file mode 100644
index dd0a359..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/Makefile
+++ /dev/null
@@ -1,18 +0,0 @@
-obj-$(CONFIG_ZSTD_COMPRESS) += zstd_compress.o
-obj-$(CONFIG_ZSTD_DECOMPRESS) += zstd_decompress.o
-
-ccflags-y += -O3
-
-# Object files unique to zstd_compress and zstd_decompress
-zstd_compress-y := fse_compress.o huf_compress.o compress.o
-zstd_decompress-y := huf_decompress.o decompress.o
-
-# These object files are shared between the modules.
-# Always add them to zstd_compress.
-# Unless both zstd_compress and zstd_decompress are built in
-# then also add them to zstd_decompress.
-zstd_compress-y += entropy_common.o fse_decompress.o zstd_common.o
-
-ifneq ($(CONFIG_ZSTD_COMPRESS)$(CONFIG_ZSTD_DECOMPRESS),yy)
-	zstd_decompress-y += entropy_common.o fse_decompress.o zstd_common.o
-endif
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/bitstream.h b/priv/zstd/contrib/linux-kernel/lib/zstd/bitstream.h
deleted file mode 100644
index a826b99..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/bitstream.h
+++ /dev/null
@@ -1,374 +0,0 @@
-/*
- * bitstream
- * Part of FSE library
- * header file (to include)
- * Copyright (C) 2013-2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-#ifndef BITSTREAM_H_MODULE
-#define BITSTREAM_H_MODULE
-
-/*
-*  This API consists of small unitary functions, which must be inlined for best performance.
-*  Since link-time-optimization is not available for all compilers,
-*  these functions are defined into a .h to be included.
-*/
-
-/*-****************************************
-*  Dependencies
-******************************************/
-#include "error_private.h" /* error codes and messages */
-#include "mem.h"	   /* unaligned access routines */
-
-/*=========================================
-*  Target specific
-=========================================*/
-#define STREAM_ACCUMULATOR_MIN_32 25
-#define STREAM_ACCUMULATOR_MIN_64 57
-#define STREAM_ACCUMULATOR_MIN ((U32)(ZSTD_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
-
-/*-******************************************
-*  bitStream encoding API (write forward)
-********************************************/
-/* bitStream can mix input from multiple sources.
-*  A critical property of these streams is that they encode and decode in **reverse** direction.
-*  So the first bit sequence you add will be the last to be read, like a LIFO stack.
-*/
-typedef struct {
-	size_t bitContainer;
-	int bitPos;
-	char *startPtr;
-	char *ptr;
-	char *endPtr;
-} BIT_CStream_t;
-
-ZSTD_STATIC size_t BIT_initCStream(BIT_CStream_t *bitC, void *dstBuffer, size_t dstCapacity);
-ZSTD_STATIC void BIT_addBits(BIT_CStream_t *bitC, size_t value, unsigned nbBits);
-ZSTD_STATIC void BIT_flushBits(BIT_CStream_t *bitC);
-ZSTD_STATIC size_t BIT_closeCStream(BIT_CStream_t *bitC);
-
-/* Start with initCStream, providing the size of buffer to write into.
-*  bitStream will never write outside of this buffer.
-*  `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
-*
-*  bits are first added to a local register.
-*  Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
-*  Writing data into memory is an explicit operation, performed by the flushBits function.
-*  Hence keep track how many bits are potentially stored into local register to avoid register overflow.
-*  After a flushBits, a maximum of 7 bits might still be stored into local register.
-*
-*  Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
-*
-*  Last operation is to close the bitStream.
-*  The function returns the final size of CStream in bytes.
-*  If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
-*/
-
-/*-********************************************
-*  bitStream decoding API (read backward)
-**********************************************/
-typedef struct {
-	size_t bitContainer;
-	unsigned bitsConsumed;
-	const char *ptr;
-	const char *start;
-} BIT_DStream_t;
-
-typedef enum {
-	BIT_DStream_unfinished = 0,
-	BIT_DStream_endOfBuffer = 1,
-	BIT_DStream_completed = 2,
-	BIT_DStream_overflow = 3
-} BIT_DStream_status; /* result of BIT_reloadDStream() */
-/* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
-
-ZSTD_STATIC size_t BIT_initDStream(BIT_DStream_t *bitD, const void *srcBuffer, size_t srcSize);
-ZSTD_STATIC size_t BIT_readBits(BIT_DStream_t *bitD, unsigned nbBits);
-ZSTD_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t *bitD);
-ZSTD_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t *bitD);
-
-/* Start by invoking BIT_initDStream().
-*  A chunk of the bitStream is then stored into a local register.
-*  Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
-*  You can then retrieve bitFields stored into the local register, **in reverse order**.
-*  Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
-*  A reload guarantee a minimum of ((8*sizeof(bitD->bitContainer))-7) bits when its result is BIT_DStream_unfinished.
-*  Otherwise, it can be less than that, so proceed accordingly.
-*  Checking if DStream has reached its end can be performed with BIT_endOfDStream().
-*/
-
-/*-****************************************
-*  unsafe API
-******************************************/
-ZSTD_STATIC void BIT_addBitsFast(BIT_CStream_t *bitC, size_t value, unsigned nbBits);
-/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
-
-ZSTD_STATIC void BIT_flushBitsFast(BIT_CStream_t *bitC);
-/* unsafe version; does not check buffer overflow */
-
-ZSTD_STATIC size_t BIT_readBitsFast(BIT_DStream_t *bitD, unsigned nbBits);
-/* faster, but works only if nbBits >= 1 */
-
-/*-**************************************************************
-*  Internal functions
-****************************************************************/
-ZSTD_STATIC unsigned BIT_highbit32(register U32 val) { return 31 - __builtin_clz(val); }
-
-/*=====    Local Constants   =====*/
-static const unsigned BIT_mask[] = {0,       1,       3,       7,	0xF,      0x1F,     0x3F,     0x7F,      0xFF,
-				    0x1FF,   0x3FF,   0x7FF,   0xFFF,    0x1FFF,   0x3FFF,   0x7FFF,   0xFFFF,    0x1FFFF,
-				    0x3FFFF, 0x7FFFF, 0xFFFFF, 0x1FFFFF, 0x3FFFFF, 0x7FFFFF, 0xFFFFFF, 0x1FFFFFF, 0x3FFFFFF}; /* up to 26 bits */
-
-/*-**************************************************************
-*  bitStream encoding
-****************************************************************/
-/*! BIT_initCStream() :
- *  `dstCapacity` must be > sizeof(void*)
- *  @return : 0 if success,
-			  otherwise an error code (can be tested using ERR_isError() ) */
-ZSTD_STATIC size_t BIT_initCStream(BIT_CStream_t *bitC, void *startPtr, size_t dstCapacity)
-{
-	bitC->bitContainer = 0;
-	bitC->bitPos = 0;
-	bitC->startPtr = (char *)startPtr;
-	bitC->ptr = bitC->startPtr;
-	bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->ptr);
-	if (dstCapacity <= sizeof(bitC->ptr))
-		return ERROR(dstSize_tooSmall);
-	return 0;
-}
-
-/*! BIT_addBits() :
-	can add up to 26 bits into `bitC`.
-	Does not check for register overflow ! */
-ZSTD_STATIC void BIT_addBits(BIT_CStream_t *bitC, size_t value, unsigned nbBits)
-{
-	bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
-	bitC->bitPos += nbBits;
-}
-
-/*! BIT_addBitsFast() :
- *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
-ZSTD_STATIC void BIT_addBitsFast(BIT_CStream_t *bitC, size_t value, unsigned nbBits)
-{
-	bitC->bitContainer |= value << bitC->bitPos;
-	bitC->bitPos += nbBits;
-}
-
-/*! BIT_flushBitsFast() :
- *  unsafe version; does not check buffer overflow */
-ZSTD_STATIC void BIT_flushBitsFast(BIT_CStream_t *bitC)
-{
-	size_t const nbBytes = bitC->bitPos >> 3;
-	ZSTD_writeLEST(bitC->ptr, bitC->bitContainer);
-	bitC->ptr += nbBytes;
-	bitC->bitPos &= 7;
-	bitC->bitContainer >>= nbBytes * 8; /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
-}
-
-/*! BIT_flushBits() :
- *  safe version; check for buffer overflow, and prevents it.
- *  note : does not signal buffer overflow. This will be revealed later on using BIT_closeCStream() */
-ZSTD_STATIC void BIT_flushBits(BIT_CStream_t *bitC)
-{
-	size_t const nbBytes = bitC->bitPos >> 3;
-	ZSTD_writeLEST(bitC->ptr, bitC->bitContainer);
-	bitC->ptr += nbBytes;
-	if (bitC->ptr > bitC->endPtr)
-		bitC->ptr = bitC->endPtr;
-	bitC->bitPos &= 7;
-	bitC->bitContainer >>= nbBytes * 8; /* if bitPos >= sizeof(bitContainer)*8 --> undefined behavior */
-}
-
-/*! BIT_closeCStream() :
- *  @return : size of CStream, in bytes,
-			  or 0 if it could not fit into dstBuffer */
-ZSTD_STATIC size_t BIT_closeCStream(BIT_CStream_t *bitC)
-{
-	BIT_addBitsFast(bitC, 1, 1); /* endMark */
-	BIT_flushBits(bitC);
-
-	if (bitC->ptr >= bitC->endPtr)
-		return 0; /* doesn't fit within authorized budget : cancel */
-
-	return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
-}
-
-/*-********************************************************
-* bitStream decoding
-**********************************************************/
-/*! BIT_initDStream() :
-*   Initialize a BIT_DStream_t.
-*   `bitD` : a pointer to an already allocated BIT_DStream_t structure.
-*   `srcSize` must be the *exact* size of the bitStream, in bytes.
-*   @return : size of stream (== srcSize) or an errorCode if a problem is detected
-*/
-ZSTD_STATIC size_t BIT_initDStream(BIT_DStream_t *bitD, const void *srcBuffer, size_t srcSize)
-{
-	if (srcSize < 1) {
-		memset(bitD, 0, sizeof(*bitD));
-		return ERROR(srcSize_wrong);
-	}
-
-	if (srcSize >= sizeof(bitD->bitContainer)) { /* normal case */
-		bitD->start = (const char *)srcBuffer;
-		bitD->ptr = (const char *)srcBuffer + srcSize - sizeof(bitD->bitContainer);
-		bitD->bitContainer = ZSTD_readLEST(bitD->ptr);
-		{
-			BYTE const lastByte = ((const BYTE *)srcBuffer)[srcSize - 1];
-			bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0; /* ensures bitsConsumed is always set */
-			if (lastByte == 0)
-				return ERROR(GENERIC); /* endMark not present */
-		}
-	} else {
-		bitD->start = (const char *)srcBuffer;
-		bitD->ptr = bitD->start;
-		bitD->bitContainer = *(const BYTE *)(bitD->start);
-		switch (srcSize) {
-		case 7: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[6]) << (sizeof(bitD->bitContainer) * 8 - 16);
-		case 6: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[5]) << (sizeof(bitD->bitContainer) * 8 - 24);
-		case 5: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[4]) << (sizeof(bitD->bitContainer) * 8 - 32);
-		case 4: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[3]) << 24;
-		case 3: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[2]) << 16;
-		case 2: bitD->bitContainer += (size_t)(((const BYTE *)(srcBuffer))[1]) << 8;
-		default:;
-		}
-		{
-			BYTE const lastByte = ((const BYTE *)srcBuffer)[srcSize - 1];
-			bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
-			if (lastByte == 0)
-				return ERROR(GENERIC); /* endMark not present */
-		}
-		bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize) * 8;
-	}
-
-	return srcSize;
-}
-
-ZSTD_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start) { return bitContainer >> start; }
-
-ZSTD_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits) { return (bitContainer >> start) & BIT_mask[nbBits]; }
-
-ZSTD_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits) { return bitContainer & BIT_mask[nbBits]; }
-
-/*! BIT_lookBits() :
- *  Provides next n bits from local register.
- *  local register is not modified.
- *  On 32-bits, maxNbBits==24.
- *  On 64-bits, maxNbBits==56.
- *  @return : value extracted
- */
-ZSTD_STATIC size_t BIT_lookBits(const BIT_DStream_t *bitD, U32 nbBits)
-{
-	U32 const bitMask = sizeof(bitD->bitContainer) * 8 - 1;
-	return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask - nbBits) & bitMask);
-}
-
-/*! BIT_lookBitsFast() :
-*   unsafe version; only works only if nbBits >= 1 */
-ZSTD_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t *bitD, U32 nbBits)
-{
-	U32 const bitMask = sizeof(bitD->bitContainer) * 8 - 1;
-	return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask + 1) - nbBits) & bitMask);
-}
-
-ZSTD_STATIC void BIT_skipBits(BIT_DStream_t *bitD, U32 nbBits) { bitD->bitsConsumed += nbBits; }
-
-/*! BIT_readBits() :
- *  Read (consume) next n bits from local register and update.
- *  Pay attention to not read more than nbBits contained into local register.
- *  @return : extracted value.
- */
-ZSTD_STATIC size_t BIT_readBits(BIT_DStream_t *bitD, U32 nbBits)
-{
-	size_t const value = BIT_lookBits(bitD, nbBits);
-	BIT_skipBits(bitD, nbBits);
-	return value;
-}
-
-/*! BIT_readBitsFast() :
-*   unsafe version; only works only if nbBits >= 1 */
-ZSTD_STATIC size_t BIT_readBitsFast(BIT_DStream_t *bitD, U32 nbBits)
-{
-	size_t const value = BIT_lookBitsFast(bitD, nbBits);
-	BIT_skipBits(bitD, nbBits);
-	return value;
-}
-
-/*! BIT_reloadDStream() :
-*   Refill `bitD` from buffer previously set in BIT_initDStream() .
-*   This function is safe, it guarantees it will not read beyond src buffer.
-*   @return : status of `BIT_DStream_t` internal register.
-			  if status == BIT_DStream_unfinished, internal register is filled with >= (sizeof(bitD->bitContainer)*8 - 7) bits */
-ZSTD_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t *bitD)
-{
-	if (bitD->bitsConsumed > (sizeof(bitD->bitContainer) * 8)) /* should not happen => corruption detected */
-		return BIT_DStream_overflow;
-
-	if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer)) {
-		bitD->ptr -= bitD->bitsConsumed >> 3;
-		bitD->bitsConsumed &= 7;
-		bitD->bitContainer = ZSTD_readLEST(bitD->ptr);
-		return BIT_DStream_unfinished;
-	}
-	if (bitD->ptr == bitD->start) {
-		if (bitD->bitsConsumed < sizeof(bitD->bitContainer) * 8)
-			return BIT_DStream_endOfBuffer;
-		return BIT_DStream_completed;
-	}
-	{
-		U32 nbBytes = bitD->bitsConsumed >> 3;
-		BIT_DStream_status result = BIT_DStream_unfinished;
-		if (bitD->ptr - nbBytes < bitD->start) {
-			nbBytes = (U32)(bitD->ptr - bitD->start); /* ptr > start */
-			result = BIT_DStream_endOfBuffer;
-		}
-		bitD->ptr -= nbBytes;
-		bitD->bitsConsumed -= nbBytes * 8;
-		bitD->bitContainer = ZSTD_readLEST(bitD->ptr); /* reminder : srcSize > sizeof(bitD) */
-		return result;
-	}
-}
-
-/*! BIT_endOfDStream() :
-*   @return Tells if DStream has exactly reached its end (all bits consumed).
-*/
-ZSTD_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t *DStream)
-{
-	return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer) * 8));
-}
-
-#endif /* BITSTREAM_H_MODULE */
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/compress.c b/priv/zstd/contrib/linux-kernel/lib/zstd/compress.c
deleted file mode 100644
index ff18ae6..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/compress.c
+++ /dev/null
@@ -1,3482 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include "fse.h"
-#include "huf.h"
-#include "mem.h"
-#include "zstd_internal.h" /* includes zstd.h */
-#include 
-#include 
-#include  /* memset */
-
-/*-*************************************
-*  Constants
-***************************************/
-static const U32 g_searchStrength = 8; /* control skip over incompressible data */
-#define HASH_READ_SIZE 8
-typedef enum { ZSTDcs_created = 0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
-
-/*-*************************************
-*  Helper functions
-***************************************/
-size_t ZSTD_compressBound(size_t srcSize) { return FSE_compressBound(srcSize) + 12; }
-
-/*-*************************************
-*  Sequence storage
-***************************************/
-static void ZSTD_resetSeqStore(seqStore_t *ssPtr)
-{
-	ssPtr->lit = ssPtr->litStart;
-	ssPtr->sequences = ssPtr->sequencesStart;
-	ssPtr->longLengthID = 0;
-}
-
-/*-*************************************
-*  Context memory management
-***************************************/
-struct ZSTD_CCtx_s {
-	const BYTE *nextSrc;  /* next block here to continue on curr prefix */
-	const BYTE *base;     /* All regular indexes relative to this position */
-	const BYTE *dictBase; /* extDict indexes relative to this position */
-	U32 dictLimit;	/* below that point, need extDict */
-	U32 lowLimit;	 /* below that point, no more data */
-	U32 nextToUpdate;     /* index from which to continue dictionary update */
-	U32 nextToUpdate3;    /* index from which to continue dictionary update */
-	U32 hashLog3;	 /* dispatch table : larger == faster, more memory */
-	U32 loadedDictEnd;    /* index of end of dictionary */
-	U32 forceWindow;      /* force back-references to respect limit of 1< 3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
-	size_t const h3Size = ((size_t)1) << hashLog3;
-	size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-	size_t const optSpace =
-	    ((MaxML + 1) + (MaxLL + 1) + (MaxOff + 1) + (1 << Litbits)) * sizeof(U32) + (ZSTD_OPT_NUM + 1) * (sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-	size_t const workspaceSize = tableSpace + (256 * sizeof(U32)) /* huffTable */ + tokenSpace +
-				     (((cParams.strategy == ZSTD_btopt) || (cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
-
-	return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_CCtx)) + ZSTD_ALIGN(workspaceSize);
-}
-
-static ZSTD_CCtx *ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
-{
-	ZSTD_CCtx *cctx;
-	if (!customMem.customAlloc || !customMem.customFree)
-		return NULL;
-	cctx = (ZSTD_CCtx *)ZSTD_malloc(sizeof(ZSTD_CCtx), customMem);
-	if (!cctx)
-		return NULL;
-	memset(cctx, 0, sizeof(ZSTD_CCtx));
-	cctx->customMem = customMem;
-	return cctx;
-}
-
-ZSTD_CCtx *ZSTD_initCCtx(void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	ZSTD_CCtx *cctx = ZSTD_createCCtx_advanced(stackMem);
-	if (cctx) {
-		cctx->workSpace = ZSTD_stackAllocAll(cctx->customMem.opaque, &cctx->workSpaceSize);
-	}
-	return cctx;
-}
-
-size_t ZSTD_freeCCtx(ZSTD_CCtx *cctx)
-{
-	if (cctx == NULL)
-		return 0; /* support free on NULL */
-	ZSTD_free(cctx->workSpace, cctx->customMem);
-	ZSTD_free(cctx, cctx->customMem);
-	return 0; /* reserved as a potential error code in the future */
-}
-
-const seqStore_t *ZSTD_getSeqStore(const ZSTD_CCtx *ctx) /* hidden interface */ { return &(ctx->seqStore); }
-
-static ZSTD_parameters ZSTD_getParamsFromCCtx(const ZSTD_CCtx *cctx) { return cctx->params; }
-
-/** ZSTD_checkParams() :
-	ensure param values remain within authorized range.
-	@return : 0, or an error code if one value is beyond authorized range */
-size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
-{
-#define CLAMPCHECK(val, min, max)                                       \
-	{                                                               \
-		if ((val < min) | (val > max))                          \
-			return ERROR(compressionParameter_unsupported); \
-	}
-	CLAMPCHECK(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
-	CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
-	CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-	CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-	CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
-	CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
-	if ((U32)(cParams.strategy) > (U32)ZSTD_btopt2)
-		return ERROR(compressionParameter_unsupported);
-	return 0;
-}
-
-/** ZSTD_cycleLog() :
- *  condition for correct operation : hashLog > 1 */
-static U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat)
-{
-	U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
-	return hashLog - btScale;
-}
-
-/** ZSTD_adjustCParams() :
-	optimize `cPar` for a given input (`srcSize` and `dictSize`).
-	mostly downsizing to reduce memory consumption and initialization.
-	Both `srcSize` and `dictSize` are optional (use 0 if unknown),
-	but if both are 0, no optimization can be done.
-	Note : cPar is considered validated at this stage. Use ZSTD_checkParams() to ensure that. */
-ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize)
-{
-	if (srcSize + dictSize == 0)
-		return cPar; /* no size information available : no adjustment */
-
-	/* resize params, to use less memory when necessary */
-	{
-		U32 const minSrcSize = (srcSize == 0) ? 500 : 0;
-		U64 const rSize = srcSize + dictSize + minSrcSize;
-		if (rSize < ((U64)1 << ZSTD_WINDOWLOG_MAX)) {
-			U32 const srcLog = MAX(ZSTD_HASHLOG_MIN, ZSTD_highbit32((U32)(rSize)-1) + 1);
-			if (cPar.windowLog > srcLog)
-				cPar.windowLog = srcLog;
-		}
-	}
-	if (cPar.hashLog > cPar.windowLog)
-		cPar.hashLog = cPar.windowLog;
-	{
-		U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
-		if (cycleLog > cPar.windowLog)
-			cPar.chainLog -= (cycleLog - cPar.windowLog);
-	}
-
-	if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN)
-		cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN; /* required for frame header */
-
-	return cPar;
-}
-
-static U32 ZSTD_equivalentParams(ZSTD_parameters param1, ZSTD_parameters param2)
-{
-	return (param1.cParams.hashLog == param2.cParams.hashLog) & (param1.cParams.chainLog == param2.cParams.chainLog) &
-	       (param1.cParams.strategy == param2.cParams.strategy) & ((param1.cParams.searchLength == 3) == (param2.cParams.searchLength == 3));
-}
-
-/*! ZSTD_continueCCtx() :
-	reuse CCtx without reset (note : requires no dictionary) */
-static size_t ZSTD_continueCCtx(ZSTD_CCtx *cctx, ZSTD_parameters params, U64 frameContentSize)
-{
-	U32 const end = (U32)(cctx->nextSrc - cctx->base);
-	cctx->params = params;
-	cctx->frameContentSize = frameContentSize;
-	cctx->lowLimit = end;
-	cctx->dictLimit = end;
-	cctx->nextToUpdate = end + 1;
-	cctx->stage = ZSTDcs_init;
-	cctx->dictID = 0;
-	cctx->loadedDictEnd = 0;
-	{
-		int i;
-		for (i = 0; i < ZSTD_REP_NUM; i++)
-			cctx->rep[i] = repStartValue[i];
-	}
-	cctx->seqStore.litLengthSum = 0; /* force reset of btopt stats */
-	xxh64_reset(&cctx->xxhState, 0);
-	return 0;
-}
-
-typedef enum { ZSTDcrp_continue, ZSTDcrp_noMemset, ZSTDcrp_fullReset } ZSTD_compResetPolicy_e;
-
-/*! ZSTD_resetCCtx_advanced() :
-	note : `params` must be validated */
-static size_t ZSTD_resetCCtx_advanced(ZSTD_CCtx *zc, ZSTD_parameters params, U64 frameContentSize, ZSTD_compResetPolicy_e const crp)
-{
-	if (crp == ZSTDcrp_continue)
-		if (ZSTD_equivalentParams(params, zc->params)) {
-			zc->flagStaticTables = 0;
-			zc->flagStaticHufTable = HUF_repeat_none;
-			return ZSTD_continueCCtx(zc, params, frameContentSize);
-		}
-
-	{
-		size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, (size_t)1 << params.cParams.windowLog);
-		U32 const divider = (params.cParams.searchLength == 3) ? 3 : 4;
-		size_t const maxNbSeq = blockSize / divider;
-		size_t const tokenSpace = blockSize + 11 * maxNbSeq;
-		size_t const chainSize = (params.cParams.strategy == ZSTD_fast) ? 0 : (1 << params.cParams.chainLog);
-		size_t const hSize = ((size_t)1) << params.cParams.hashLog;
-		U32 const hashLog3 = (params.cParams.searchLength > 3) ? 0 : MIN(ZSTD_HASHLOG3_MAX, params.cParams.windowLog);
-		size_t const h3Size = ((size_t)1) << hashLog3;
-		size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-		void *ptr;
-
-		/* Check if workSpace is large enough, alloc a new one if needed */
-		{
-			size_t const optSpace = ((MaxML + 1) + (MaxLL + 1) + (MaxOff + 1) + (1 << Litbits)) * sizeof(U32) +
-						(ZSTD_OPT_NUM + 1) * (sizeof(ZSTD_match_t) + sizeof(ZSTD_optimal_t));
-			size_t const neededSpace = tableSpace + (256 * sizeof(U32)) /* huffTable */ + tokenSpace +
-						   (((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) ? optSpace : 0);
-			if (zc->workSpaceSize < neededSpace) {
-				ZSTD_free(zc->workSpace, zc->customMem);
-				zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
-				if (zc->workSpace == NULL)
-					return ERROR(memory_allocation);
-				zc->workSpaceSize = neededSpace;
-			}
-		}
-
-		if (crp != ZSTDcrp_noMemset)
-			memset(zc->workSpace, 0, tableSpace); /* reset tables only */
-		xxh64_reset(&zc->xxhState, 0);
-		zc->hashLog3 = hashLog3;
-		zc->hashTable = (U32 *)(zc->workSpace);
-		zc->chainTable = zc->hashTable + hSize;
-		zc->hashTable3 = zc->chainTable + chainSize;
-		ptr = zc->hashTable3 + h3Size;
-		zc->hufTable = (HUF_CElt *)ptr;
-		zc->flagStaticTables = 0;
-		zc->flagStaticHufTable = HUF_repeat_none;
-		ptr = ((U32 *)ptr) + 256; /* note : HUF_CElt* is incomplete type, size is simulated using U32 */
-
-		zc->nextToUpdate = 1;
-		zc->nextSrc = NULL;
-		zc->base = NULL;
-		zc->dictBase = NULL;
-		zc->dictLimit = 0;
-		zc->lowLimit = 0;
-		zc->params = params;
-		zc->blockSize = blockSize;
-		zc->frameContentSize = frameContentSize;
-		{
-			int i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				zc->rep[i] = repStartValue[i];
-		}
-
-		if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btopt2)) {
-			zc->seqStore.litFreq = (U32 *)ptr;
-			zc->seqStore.litLengthFreq = zc->seqStore.litFreq + (1 << Litbits);
-			zc->seqStore.matchLengthFreq = zc->seqStore.litLengthFreq + (MaxLL + 1);
-			zc->seqStore.offCodeFreq = zc->seqStore.matchLengthFreq + (MaxML + 1);
-			ptr = zc->seqStore.offCodeFreq + (MaxOff + 1);
-			zc->seqStore.matchTable = (ZSTD_match_t *)ptr;
-			ptr = zc->seqStore.matchTable + ZSTD_OPT_NUM + 1;
-			zc->seqStore.priceTable = (ZSTD_optimal_t *)ptr;
-			ptr = zc->seqStore.priceTable + ZSTD_OPT_NUM + 1;
-			zc->seqStore.litLengthSum = 0;
-		}
-		zc->seqStore.sequencesStart = (seqDef *)ptr;
-		ptr = zc->seqStore.sequencesStart + maxNbSeq;
-		zc->seqStore.llCode = (BYTE *)ptr;
-		zc->seqStore.mlCode = zc->seqStore.llCode + maxNbSeq;
-		zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
-		zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
-
-		zc->stage = ZSTDcs_init;
-		zc->dictID = 0;
-		zc->loadedDictEnd = 0;
-
-		return 0;
-	}
-}
-
-/* ZSTD_invalidateRepCodes() :
- * ensures next compression will not use repcodes from previous block.
- * Note : only works with regular variant;
- *        do not use with extDict variant ! */
-void ZSTD_invalidateRepCodes(ZSTD_CCtx *cctx)
-{
-	int i;
-	for (i = 0; i < ZSTD_REP_NUM; i++)
-		cctx->rep[i] = 0;
-}
-
-/*! ZSTD_copyCCtx() :
-*   Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
-*   Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
-*   @return : 0, or an error code */
-size_t ZSTD_copyCCtx(ZSTD_CCtx *dstCCtx, const ZSTD_CCtx *srcCCtx, unsigned long long pledgedSrcSize)
-{
-	if (srcCCtx->stage != ZSTDcs_init)
-		return ERROR(stage_wrong);
-
-	memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
-	{
-		ZSTD_parameters params = srcCCtx->params;
-		params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-		ZSTD_resetCCtx_advanced(dstCCtx, params, pledgedSrcSize, ZSTDcrp_noMemset);
-	}
-
-	/* copy tables */
-	{
-		size_t const chainSize = (srcCCtx->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << srcCCtx->params.cParams.chainLog);
-		size_t const hSize = ((size_t)1) << srcCCtx->params.cParams.hashLog;
-		size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
-		size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-		memcpy(dstCCtx->workSpace, srcCCtx->workSpace, tableSpace);
-	}
-
-	/* copy dictionary offsets */
-	dstCCtx->nextToUpdate = srcCCtx->nextToUpdate;
-	dstCCtx->nextToUpdate3 = srcCCtx->nextToUpdate3;
-	dstCCtx->nextSrc = srcCCtx->nextSrc;
-	dstCCtx->base = srcCCtx->base;
-	dstCCtx->dictBase = srcCCtx->dictBase;
-	dstCCtx->dictLimit = srcCCtx->dictLimit;
-	dstCCtx->lowLimit = srcCCtx->lowLimit;
-	dstCCtx->loadedDictEnd = srcCCtx->loadedDictEnd;
-	dstCCtx->dictID = srcCCtx->dictID;
-
-	/* copy entropy tables */
-	dstCCtx->flagStaticTables = srcCCtx->flagStaticTables;
-	dstCCtx->flagStaticHufTable = srcCCtx->flagStaticHufTable;
-	if (srcCCtx->flagStaticTables) {
-		memcpy(dstCCtx->litlengthCTable, srcCCtx->litlengthCTable, sizeof(dstCCtx->litlengthCTable));
-		memcpy(dstCCtx->matchlengthCTable, srcCCtx->matchlengthCTable, sizeof(dstCCtx->matchlengthCTable));
-		memcpy(dstCCtx->offcodeCTable, srcCCtx->offcodeCTable, sizeof(dstCCtx->offcodeCTable));
-	}
-	if (srcCCtx->flagStaticHufTable) {
-		memcpy(dstCCtx->hufTable, srcCCtx->hufTable, 256 * 4);
-	}
-
-	return 0;
-}
-
-/*! ZSTD_reduceTable() :
-*   reduce table indexes by `reducerValue` */
-static void ZSTD_reduceTable(U32 *const table, U32 const size, U32 const reducerValue)
-{
-	U32 u;
-	for (u = 0; u < size; u++) {
-		if (table[u] < reducerValue)
-			table[u] = 0;
-		else
-			table[u] -= reducerValue;
-	}
-}
-
-/*! ZSTD_reduceIndex() :
-*   rescale all indexes to avoid future overflow (indexes are U32) */
-static void ZSTD_reduceIndex(ZSTD_CCtx *zc, const U32 reducerValue)
-{
-	{
-		U32 const hSize = 1 << zc->params.cParams.hashLog;
-		ZSTD_reduceTable(zc->hashTable, hSize, reducerValue);
-	}
-
-	{
-		U32 const chainSize = (zc->params.cParams.strategy == ZSTD_fast) ? 0 : (1 << zc->params.cParams.chainLog);
-		ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue);
-	}
-
-	{
-		U32 const h3Size = (zc->hashLog3) ? 1 << zc->hashLog3 : 0;
-		ZSTD_reduceTable(zc->hashTable3, h3Size, reducerValue);
-	}
-}
-
-/*-*******************************************************
-*  Block entropic compression
-*********************************************************/
-
-/* See doc/zstd_compression_format.md for detailed format description */
-
-size_t ZSTD_noCompressBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	if (srcSize + ZSTD_blockHeaderSize > dstCapacity)
-		return ERROR(dstSize_tooSmall);
-	memcpy((BYTE *)dst + ZSTD_blockHeaderSize, src, srcSize);
-	ZSTD_writeLE24(dst, (U32)(srcSize << 2) + (U32)bt_raw);
-	return ZSTD_blockHeaderSize + srcSize;
-}
-
-static size_t ZSTD_noCompressLiterals(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	BYTE *const ostart = (BYTE * const)dst;
-	U32 const flSize = 1 + (srcSize > 31) + (srcSize > 4095);
-
-	if (srcSize + flSize > dstCapacity)
-		return ERROR(dstSize_tooSmall);
-
-	switch (flSize) {
-	case 1: /* 2 - 1 - 5 */ ostart[0] = (BYTE)((U32)set_basic + (srcSize << 3)); break;
-	case 2: /* 2 - 2 - 12 */ ZSTD_writeLE16(ostart, (U16)((U32)set_basic + (1 << 2) + (srcSize << 4))); break;
-	default: /*note : should not be necessary : flSize is within {1,2,3} */
-	case 3: /* 2 - 2 - 20 */ ZSTD_writeLE32(ostart, (U32)((U32)set_basic + (3 << 2) + (srcSize << 4))); break;
-	}
-
-	memcpy(ostart + flSize, src, srcSize);
-	return srcSize + flSize;
-}
-
-static size_t ZSTD_compressRleLiteralsBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	BYTE *const ostart = (BYTE * const)dst;
-	U32 const flSize = 1 + (srcSize > 31) + (srcSize > 4095);
-
-	(void)dstCapacity; /* dstCapacity already guaranteed to be >=4, hence large enough */
-
-	switch (flSize) {
-	case 1: /* 2 - 1 - 5 */ ostart[0] = (BYTE)((U32)set_rle + (srcSize << 3)); break;
-	case 2: /* 2 - 2 - 12 */ ZSTD_writeLE16(ostart, (U16)((U32)set_rle + (1 << 2) + (srcSize << 4))); break;
-	default: /*note : should not be necessary : flSize is necessarily within {1,2,3} */
-	case 3: /* 2 - 2 - 20 */ ZSTD_writeLE32(ostart, (U32)((U32)set_rle + (3 << 2) + (srcSize << 4))); break;
-	}
-
-	ostart[flSize] = *(const BYTE *)src;
-	return flSize + 1;
-}
-
-static size_t ZSTD_minGain(size_t srcSize) { return (srcSize >> 6) + 2; }
-
-static size_t ZSTD_compressLiterals(ZSTD_CCtx *zc, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	size_t const minGain = ZSTD_minGain(srcSize);
-	size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
-	BYTE *const ostart = (BYTE *)dst;
-	U32 singleStream = srcSize < 256;
-	symbolEncodingType_e hType = set_compressed;
-	size_t cLitSize;
-
-/* small ? don't even attempt compression (speed opt) */
-#define LITERAL_NOENTROPY 63
-	{
-		size_t const minLitSize = zc->flagStaticHufTable == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
-		if (srcSize <= minLitSize)
-			return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-	}
-
-	if (dstCapacity < lhSize + 1)
-		return ERROR(dstSize_tooSmall); /* not enough space for compression */
-	{
-		HUF_repeat repeat = zc->flagStaticHufTable;
-		int const preferRepeat = zc->params.cParams.strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
-		if (repeat == HUF_repeat_valid && lhSize == 3)
-			singleStream = 1;
-		cLitSize = singleStream ? HUF_compress1X_repeat(ostart + lhSize, dstCapacity - lhSize, src, srcSize, 255, 11, zc->tmpCounters,
-								sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat)
-					: HUF_compress4X_repeat(ostart + lhSize, dstCapacity - lhSize, src, srcSize, 255, 11, zc->tmpCounters,
-								sizeof(zc->tmpCounters), zc->hufTable, &repeat, preferRepeat);
-		if (repeat != HUF_repeat_none) {
-			hType = set_repeat;
-		} /* reused the existing table */
-		else {
-			zc->flagStaticHufTable = HUF_repeat_check;
-		} /* now have a table to reuse */
-	}
-
-	if ((cLitSize == 0) | (cLitSize >= srcSize - minGain)) {
-		zc->flagStaticHufTable = HUF_repeat_none;
-		return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-	}
-	if (cLitSize == 1) {
-		zc->flagStaticHufTable = HUF_repeat_none;
-		return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
-	}
-
-	/* Build header */
-	switch (lhSize) {
-	case 3: /* 2 - 2 - 10 - 10 */
-	{
-		U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize << 4) + ((U32)cLitSize << 14);
-		ZSTD_writeLE24(ostart, lhc);
-		break;
-	}
-	case 4: /* 2 - 2 - 14 - 14 */
-	{
-		U32 const lhc = hType + (2 << 2) + ((U32)srcSize << 4) + ((U32)cLitSize << 18);
-		ZSTD_writeLE32(ostart, lhc);
-		break;
-	}
-	default: /* should not be necessary, lhSize is only {3,4,5} */
-	case 5:  /* 2 - 2 - 18 - 18 */
-	{
-		U32 const lhc = hType + (3 << 2) + ((U32)srcSize << 4) + ((U32)cLitSize << 22);
-		ZSTD_writeLE32(ostart, lhc);
-		ostart[4] = (BYTE)(cLitSize >> 10);
-		break;
-	}
-	}
-	return lhSize + cLitSize;
-}
-
-static const BYTE LL_Code[64] = {0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15, 16, 16, 17, 17, 18, 18,
-				 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23,
-				 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24};
-
-static const BYTE ML_Code[128] = {0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,
-				  26, 27, 28, 29, 30, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37, 38, 38, 38, 38,
-				  38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
-				  40, 40, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 42, 42, 42, 42, 42, 42, 42, 42,
-				  42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42};
-
-void ZSTD_seqToCodes(const seqStore_t *seqStorePtr)
-{
-	BYTE const LL_deltaCode = 19;
-	BYTE const ML_deltaCode = 36;
-	const seqDef *const sequences = seqStorePtr->sequencesStart;
-	BYTE *const llCodeTable = seqStorePtr->llCode;
-	BYTE *const ofCodeTable = seqStorePtr->ofCode;
-	BYTE *const mlCodeTable = seqStorePtr->mlCode;
-	U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-	U32 u;
-	for (u = 0; u < nbSeq; u++) {
-		U32 const llv = sequences[u].litLength;
-		U32 const mlv = sequences[u].matchLength;
-		llCodeTable[u] = (llv > 63) ? (BYTE)ZSTD_highbit32(llv) + LL_deltaCode : LL_Code[llv];
-		ofCodeTable[u] = (BYTE)ZSTD_highbit32(sequences[u].offset);
-		mlCodeTable[u] = (mlv > 127) ? (BYTE)ZSTD_highbit32(mlv) + ML_deltaCode : ML_Code[mlv];
-	}
-	if (seqStorePtr->longLengthID == 1)
-		llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
-	if (seqStorePtr->longLengthID == 2)
-		mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
-}
-
-ZSTD_STATIC size_t ZSTD_compressSequences_internal(ZSTD_CCtx *zc, void *dst, size_t dstCapacity)
-{
-	const int longOffsets = zc->params.cParams.windowLog > STREAM_ACCUMULATOR_MIN;
-	const seqStore_t *seqStorePtr = &(zc->seqStore);
-	FSE_CTable *CTable_LitLength = zc->litlengthCTable;
-	FSE_CTable *CTable_OffsetBits = zc->offcodeCTable;
-	FSE_CTable *CTable_MatchLength = zc->matchlengthCTable;
-	U32 LLtype, Offtype, MLtype; /* compressed, raw or rle */
-	const seqDef *const sequences = seqStorePtr->sequencesStart;
-	const BYTE *const ofCodeTable = seqStorePtr->ofCode;
-	const BYTE *const llCodeTable = seqStorePtr->llCode;
-	const BYTE *const mlCodeTable = seqStorePtr->mlCode;
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *const oend = ostart + dstCapacity;
-	BYTE *op = ostart;
-	size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
-	BYTE *seqHead;
-
-	U32 *count;
-	S16 *norm;
-	U32 *workspace;
-	size_t workspaceSize = sizeof(zc->tmpCounters);
-	{
-		size_t spaceUsed32 = 0;
-		count = (U32 *)zc->tmpCounters + spaceUsed32;
-		spaceUsed32 += MaxSeq + 1;
-		norm = (S16 *)((U32 *)zc->tmpCounters + spaceUsed32);
-		spaceUsed32 += ALIGN(sizeof(S16) * (MaxSeq + 1), sizeof(U32)) >> 2;
-
-		workspace = (U32 *)zc->tmpCounters + spaceUsed32;
-		workspaceSize -= (spaceUsed32 << 2);
-	}
-
-	/* Compress literals */
-	{
-		const BYTE *const literals = seqStorePtr->litStart;
-		size_t const litSize = seqStorePtr->lit - literals;
-		size_t const cSize = ZSTD_compressLiterals(zc, op, dstCapacity, literals, litSize);
-		if (ZSTD_isError(cSize))
-			return cSize;
-		op += cSize;
-	}
-
-	/* Sequences Header */
-	if ((oend - op) < 3 /*max nbSeq Size*/ + 1 /*seqHead */)
-		return ERROR(dstSize_tooSmall);
-	if (nbSeq < 0x7F)
-		*op++ = (BYTE)nbSeq;
-	else if (nbSeq < LONGNBSEQ)
-		op[0] = (BYTE)((nbSeq >> 8) + 0x80), op[1] = (BYTE)nbSeq, op += 2;
-	else
-		op[0] = 0xFF, ZSTD_writeLE16(op + 1, (U16)(nbSeq - LONGNBSEQ)), op += 3;
-	if (nbSeq == 0)
-		return op - ostart;
-
-	/* seqHead : flags for FSE encoding type */
-	seqHead = op++;
-
-#define MIN_SEQ_FOR_DYNAMIC_FSE 64
-#define MAX_SEQ_FOR_STATIC_FSE 1000
-
-	/* convert length/distances into codes */
-	ZSTD_seqToCodes(seqStorePtr);
-
-	/* CTable for Literal Lengths */
-	{
-		U32 max = MaxLL;
-		size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, workspace);
-		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-			*op++ = llCodeTable[0];
-			FSE_buildCTable_rle(CTable_LitLength, (BYTE)max);
-			LLtype = set_rle;
-		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-			LLtype = set_repeat;
-		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (LL_defaultNormLog - 1)))) {
-			FSE_buildCTable_wksp(CTable_LitLength, LL_defaultNorm, MaxLL, LL_defaultNormLog, workspace, workspaceSize);
-			LLtype = set_basic;
-		} else {
-			size_t nbSeq_1 = nbSeq;
-			const U32 tableLog = FSE_optimalTableLog(LLFSELog, nbSeq, max);
-			if (count[llCodeTable[nbSeq - 1]] > 1) {
-				count[llCodeTable[nbSeq - 1]]--;
-				nbSeq_1--;
-			}
-			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-			{
-				size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog); /* overflow protected */
-				if (FSE_isError(NCountSize))
-					return NCountSize;
-				op += NCountSize;
-			}
-			FSE_buildCTable_wksp(CTable_LitLength, norm, max, tableLog, workspace, workspaceSize);
-			LLtype = set_compressed;
-		}
-	}
-
-	/* CTable for Offsets */
-	{
-		U32 max = MaxOff;
-		size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, workspace);
-		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-			*op++ = ofCodeTable[0];
-			FSE_buildCTable_rle(CTable_OffsetBits, (BYTE)max);
-			Offtype = set_rle;
-		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-			Offtype = set_repeat;
-		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (OF_defaultNormLog - 1)))) {
-			FSE_buildCTable_wksp(CTable_OffsetBits, OF_defaultNorm, MaxOff, OF_defaultNormLog, workspace, workspaceSize);
-			Offtype = set_basic;
-		} else {
-			size_t nbSeq_1 = nbSeq;
-			const U32 tableLog = FSE_optimalTableLog(OffFSELog, nbSeq, max);
-			if (count[ofCodeTable[nbSeq - 1]] > 1) {
-				count[ofCodeTable[nbSeq - 1]]--;
-				nbSeq_1--;
-			}
-			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-			{
-				size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog); /* overflow protected */
-				if (FSE_isError(NCountSize))
-					return NCountSize;
-				op += NCountSize;
-			}
-			FSE_buildCTable_wksp(CTable_OffsetBits, norm, max, tableLog, workspace, workspaceSize);
-			Offtype = set_compressed;
-		}
-	}
-
-	/* CTable for MatchLengths */
-	{
-		U32 max = MaxML;
-		size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, workspace);
-		if ((mostFrequent == nbSeq) && (nbSeq > 2)) {
-			*op++ = *mlCodeTable;
-			FSE_buildCTable_rle(CTable_MatchLength, (BYTE)max);
-			MLtype = set_rle;
-		} else if ((zc->flagStaticTables) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-			MLtype = set_repeat;
-		} else if ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (ML_defaultNormLog - 1)))) {
-			FSE_buildCTable_wksp(CTable_MatchLength, ML_defaultNorm, MaxML, ML_defaultNormLog, workspace, workspaceSize);
-			MLtype = set_basic;
-		} else {
-			size_t nbSeq_1 = nbSeq;
-			const U32 tableLog = FSE_optimalTableLog(MLFSELog, nbSeq, max);
-			if (count[mlCodeTable[nbSeq - 1]] > 1) {
-				count[mlCodeTable[nbSeq - 1]]--;
-				nbSeq_1--;
-			}
-			FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max);
-			{
-				size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog); /* overflow protected */
-				if (FSE_isError(NCountSize))
-					return NCountSize;
-				op += NCountSize;
-			}
-			FSE_buildCTable_wksp(CTable_MatchLength, norm, max, tableLog, workspace, workspaceSize);
-			MLtype = set_compressed;
-		}
-	}
-
-	*seqHead = (BYTE)((LLtype << 6) + (Offtype << 4) + (MLtype << 2));
-	zc->flagStaticTables = 0;
-
-	/* Encoding Sequences */
-	{
-		BIT_CStream_t blockStream;
-		FSE_CState_t stateMatchLength;
-		FSE_CState_t stateOffsetBits;
-		FSE_CState_t stateLitLength;
-
-		CHECK_E(BIT_initCStream(&blockStream, op, oend - op), dstSize_tooSmall); /* not enough space remaining */
-
-		/* first symbols */
-		FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq - 1]);
-		FSE_initCState2(&stateOffsetBits, CTable_OffsetBits, ofCodeTable[nbSeq - 1]);
-		FSE_initCState2(&stateLitLength, CTable_LitLength, llCodeTable[nbSeq - 1]);
-		BIT_addBits(&blockStream, sequences[nbSeq - 1].litLength, LL_bits[llCodeTable[nbSeq - 1]]);
-		if (ZSTD_32bits())
-			BIT_flushBits(&blockStream);
-		BIT_addBits(&blockStream, sequences[nbSeq - 1].matchLength, ML_bits[mlCodeTable[nbSeq - 1]]);
-		if (ZSTD_32bits())
-			BIT_flushBits(&blockStream);
-		if (longOffsets) {
-			U32 const ofBits = ofCodeTable[nbSeq - 1];
-			int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN - 1);
-			if (extraBits) {
-				BIT_addBits(&blockStream, sequences[nbSeq - 1].offset, extraBits);
-				BIT_flushBits(&blockStream);
-			}
-			BIT_addBits(&blockStream, sequences[nbSeq - 1].offset >> extraBits, ofBits - extraBits);
-		} else {
-			BIT_addBits(&blockStream, sequences[nbSeq - 1].offset, ofCodeTable[nbSeq - 1]);
-		}
-		BIT_flushBits(&blockStream);
-
-		{
-			size_t n;
-			for (n = nbSeq - 2; n < nbSeq; n--) { /* intentional underflow */
-				BYTE const llCode = llCodeTable[n];
-				BYTE const ofCode = ofCodeTable[n];
-				BYTE const mlCode = mlCodeTable[n];
-				U32 const llBits = LL_bits[llCode];
-				U32 const ofBits = ofCode; /* 32b*/ /* 64b*/
-				U32 const mlBits = ML_bits[mlCode];
-				/* (7)*/							    /* (7)*/
-				FSE_encodeSymbol(&blockStream, &stateOffsetBits, ofCode); /* 15 */  /* 15 */
-				FSE_encodeSymbol(&blockStream, &stateMatchLength, mlCode); /* 24 */ /* 24 */
-				if (ZSTD_32bits())
-					BIT_flushBits(&blockStream);				  /* (7)*/
-				FSE_encodeSymbol(&blockStream, &stateLitLength, llCode); /* 16 */ /* 33 */
-				if (ZSTD_32bits() || (ofBits + mlBits + llBits >= 64 - 7 - (LLFSELog + MLFSELog + OffFSELog)))
-					BIT_flushBits(&blockStream); /* (7)*/
-				BIT_addBits(&blockStream, sequences[n].litLength, llBits);
-				if (ZSTD_32bits() && ((llBits + mlBits) > 24))
-					BIT_flushBits(&blockStream);
-				BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
-				if (ZSTD_32bits())
-					BIT_flushBits(&blockStream); /* (7)*/
-				if (longOffsets) {
-					int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN - 1);
-					if (extraBits) {
-						BIT_addBits(&blockStream, sequences[n].offset, extraBits);
-						BIT_flushBits(&blockStream); /* (7)*/
-					}
-					BIT_addBits(&blockStream, sequences[n].offset >> extraBits, ofBits - extraBits); /* 31 */
-				} else {
-					BIT_addBits(&blockStream, sequences[n].offset, ofBits); /* 31 */
-				}
-				BIT_flushBits(&blockStream); /* (7)*/
-			}
-		}
-
-		FSE_flushCState(&blockStream, &stateMatchLength);
-		FSE_flushCState(&blockStream, &stateOffsetBits);
-		FSE_flushCState(&blockStream, &stateLitLength);
-
-		{
-			size_t const streamSize = BIT_closeCStream(&blockStream);
-			if (streamSize == 0)
-				return ERROR(dstSize_tooSmall); /* not enough space */
-			op += streamSize;
-		}
-	}
-	return op - ostart;
-}
-
-ZSTD_STATIC size_t ZSTD_compressSequences(ZSTD_CCtx *zc, void *dst, size_t dstCapacity, size_t srcSize)
-{
-	size_t const cSize = ZSTD_compressSequences_internal(zc, dst, dstCapacity);
-	size_t const minGain = ZSTD_minGain(srcSize);
-	size_t const maxCSize = srcSize - minGain;
-	/* If the srcSize <= dstCapacity, then there is enough space to write a
-	 * raw uncompressed block. Since we ran out of space, the block must not
-	 * be compressible, so fall back to a raw uncompressed block.
-	 */
-	int const uncompressibleError = cSize == ERROR(dstSize_tooSmall) && srcSize <= dstCapacity;
-	int i;
-
-	if (ZSTD_isError(cSize) && !uncompressibleError)
-		return cSize;
-	if (cSize >= maxCSize || uncompressibleError) {
-		zc->flagStaticHufTable = HUF_repeat_none;
-		return 0;
-	}
-	/* confirm repcodes */
-	for (i = 0; i < ZSTD_REP_NUM; i++)
-		zc->rep[i] = zc->repToConfirm[i];
-	return cSize;
-}
-
-/*! ZSTD_storeSeq() :
-	Store a sequence (literal length, literals, offset code and match length code) into seqStore_t.
-	`offsetCode` : distance to match, or 0 == repCode.
-	`matchCode` : matchLength - MINMATCH
-*/
-ZSTD_STATIC void ZSTD_storeSeq(seqStore_t *seqStorePtr, size_t litLength, const void *literals, U32 offsetCode, size_t matchCode)
-{
-	/* copy Literals */
-	ZSTD_wildcopy(seqStorePtr->lit, literals, litLength);
-	seqStorePtr->lit += litLength;
-
-	/* literal Length */
-	if (litLength > 0xFFFF) {
-		seqStorePtr->longLengthID = 1;
-		seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-	}
-	seqStorePtr->sequences[0].litLength = (U16)litLength;
-
-	/* match offset */
-	seqStorePtr->sequences[0].offset = offsetCode + 1;
-
-	/* match Length */
-	if (matchCode > 0xFFFF) {
-		seqStorePtr->longLengthID = 2;
-		seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-	}
-	seqStorePtr->sequences[0].matchLength = (U16)matchCode;
-
-	seqStorePtr->sequences++;
-}
-
-/*-*************************************
-*  Match length counter
-***************************************/
-static unsigned ZSTD_NbCommonBytes(register size_t val)
-{
-	if (ZSTD_isLittleEndian()) {
-		if (ZSTD_64bits()) {
-			return (__builtin_ctzll((U64)val) >> 3);
-		} else { /* 32 bits */
-			return (__builtin_ctz((U32)val) >> 3);
-		}
-	} else { /* Big Endian CPU */
-		if (ZSTD_64bits()) {
-			return (__builtin_clzll(val) >> 3);
-		} else { /* 32 bits */
-			return (__builtin_clz((U32)val) >> 3);
-		}
-	}
-}
-
-static size_t ZSTD_count(const BYTE *pIn, const BYTE *pMatch, const BYTE *const pInLimit)
-{
-	const BYTE *const pStart = pIn;
-	const BYTE *const pInLoopLimit = pInLimit - (sizeof(size_t) - 1);
-
-	while (pIn < pInLoopLimit) {
-		size_t const diff = ZSTD_readST(pMatch) ^ ZSTD_readST(pIn);
-		if (!diff) {
-			pIn += sizeof(size_t);
-			pMatch += sizeof(size_t);
-			continue;
-		}
-		pIn += ZSTD_NbCommonBytes(diff);
-		return (size_t)(pIn - pStart);
-	}
-	if (ZSTD_64bits())
-		if ((pIn < (pInLimit - 3)) && (ZSTD_read32(pMatch) == ZSTD_read32(pIn))) {
-			pIn += 4;
-			pMatch += 4;
-		}
-	if ((pIn < (pInLimit - 1)) && (ZSTD_read16(pMatch) == ZSTD_read16(pIn))) {
-		pIn += 2;
-		pMatch += 2;
-	}
-	if ((pIn < pInLimit) && (*pMatch == *pIn))
-		pIn++;
-	return (size_t)(pIn - pStart);
-}
-
-/** ZSTD_count_2segments() :
-*   can count match length with `ip` & `match` in 2 different segments.
-*   convention : on reaching mEnd, match count continue starting from iStart
-*/
-static size_t ZSTD_count_2segments(const BYTE *ip, const BYTE *match, const BYTE *iEnd, const BYTE *mEnd, const BYTE *iStart)
-{
-	const BYTE *const vEnd = MIN(ip + (mEnd - match), iEnd);
-	size_t const matchLength = ZSTD_count(ip, match, vEnd);
-	if (match + matchLength != mEnd)
-		return matchLength;
-	return matchLength + ZSTD_count(ip + matchLength, iStart, iEnd);
-}
-
-/*-*************************************
-*  Hashes
-***************************************/
-static const U32 prime3bytes = 506832829U;
-static U32 ZSTD_hash3(U32 u, U32 h) { return ((u << (32 - 24)) * prime3bytes) >> (32 - h); }
-ZSTD_STATIC size_t ZSTD_hash3Ptr(const void *ptr, U32 h) { return ZSTD_hash3(ZSTD_readLE32(ptr), h); } /* only in zstd_opt.h */
-
-static const U32 prime4bytes = 2654435761U;
-static U32 ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32 - h); }
-static size_t ZSTD_hash4Ptr(const void *ptr, U32 h) { return ZSTD_hash4(ZSTD_read32(ptr), h); }
-
-static const U64 prime5bytes = 889523592379ULL;
-static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u << (64 - 40)) * prime5bytes) >> (64 - h)); }
-static size_t ZSTD_hash5Ptr(const void *p, U32 h) { return ZSTD_hash5(ZSTD_readLE64(p), h); }
-
-static const U64 prime6bytes = 227718039650203ULL;
-static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u << (64 - 48)) * prime6bytes) >> (64 - h)); }
-static size_t ZSTD_hash6Ptr(const void *p, U32 h) { return ZSTD_hash6(ZSTD_readLE64(p), h); }
-
-static const U64 prime7bytes = 58295818150454627ULL;
-static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u << (64 - 56)) * prime7bytes) >> (64 - h)); }
-static size_t ZSTD_hash7Ptr(const void *p, U32 h) { return ZSTD_hash7(ZSTD_readLE64(p), h); }
-
-static const U64 prime8bytes = 0xCF1BBCDCB7A56463ULL;
-static size_t ZSTD_hash8(U64 u, U32 h) { return (size_t)(((u)*prime8bytes) >> (64 - h)); }
-static size_t ZSTD_hash8Ptr(const void *p, U32 h) { return ZSTD_hash8(ZSTD_readLE64(p), h); }
-
-static size_t ZSTD_hashPtr(const void *p, U32 hBits, U32 mls)
-{
-	switch (mls) {
-	// case 3: return ZSTD_hash3Ptr(p, hBits);
-	default:
-	case 4: return ZSTD_hash4Ptr(p, hBits);
-	case 5: return ZSTD_hash5Ptr(p, hBits);
-	case 6: return ZSTD_hash6Ptr(p, hBits);
-	case 7: return ZSTD_hash7Ptr(p, hBits);
-	case 8: return ZSTD_hash8Ptr(p, hBits);
-	}
-}
-
-/*-*************************************
-*  Fast Scan
-***************************************/
-static void ZSTD_fillHashTable(ZSTD_CCtx *zc, const void *end, const U32 mls)
-{
-	U32 *const hashTable = zc->hashTable;
-	U32 const hBits = zc->params.cParams.hashLog;
-	const BYTE *const base = zc->base;
-	const BYTE *ip = base + zc->nextToUpdate;
-	const BYTE *const iend = ((const BYTE *)end) - HASH_READ_SIZE;
-	const size_t fastHashFillStep = 3;
-
-	while (ip <= iend) {
-		hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
-		ip += fastHashFillStep;
-	}
-}
-
-FORCE_INLINE
-void ZSTD_compressBlock_fast_generic(ZSTD_CCtx *cctx, const void *src, size_t srcSize, const U32 mls)
-{
-	U32 *const hashTable = cctx->hashTable;
-	U32 const hBits = cctx->params.cParams.hashLog;
-	seqStore_t *seqStorePtr = &(cctx->seqStore);
-	const BYTE *const base = cctx->base;
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const U32 lowestIndex = cctx->dictLimit;
-	const BYTE *const lowest = base + lowestIndex;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - HASH_READ_SIZE;
-	U32 offset_1 = cctx->rep[0], offset_2 = cctx->rep[1];
-	U32 offsetSaved = 0;
-
-	/* init */
-	ip += (ip == lowest);
-	{
-		U32 const maxRep = (U32)(ip - lowest);
-		if (offset_2 > maxRep)
-			offsetSaved = offset_2, offset_2 = 0;
-		if (offset_1 > maxRep)
-			offsetSaved = offset_1, offset_1 = 0;
-	}
-
-	/* Main Search Loop */
-	while (ip < ilimit) { /* < instead of <=, because repcode check at (ip+1) */
-		size_t mLength;
-		size_t const h = ZSTD_hashPtr(ip, hBits, mls);
-		U32 const curr = (U32)(ip - base);
-		U32 const matchIndex = hashTable[h];
-		const BYTE *match = base + matchIndex;
-		hashTable[h] = curr; /* update hash table */
-
-		if ((offset_1 > 0) & (ZSTD_read32(ip + 1 - offset_1) == ZSTD_read32(ip + 1))) {
-			mLength = ZSTD_count(ip + 1 + 4, ip + 1 + 4 - offset_1, iend) + 4;
-			ip++;
-			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-		} else {
-			U32 offset;
-			if ((matchIndex <= lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) {
-				ip += ((ip - anchor) >> g_searchStrength) + 1;
-				continue;
-			}
-			mLength = ZSTD_count(ip + 4, match + 4, iend) + 4;
-			offset = (U32)(ip - match);
-			while (((ip > anchor) & (match > lowest)) && (ip[-1] == match[-1])) {
-				ip--;
-				match--;
-				mLength++;
-			} /* catch up */
-			offset_2 = offset_1;
-			offset_1 = offset;
-
-			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-		}
-
-		/* match found */
-		ip += mLength;
-		anchor = ip;
-
-		if (ip <= ilimit) {
-			/* Fill Table */
-			hashTable[ZSTD_hashPtr(base + curr + 2, hBits, mls)] = curr + 2; /* here because curr+2 could be > iend-8 */
-			hashTable[ZSTD_hashPtr(ip - 2, hBits, mls)] = (U32)(ip - 2 - base);
-			/* check immediate repcode */
-			while ((ip <= ilimit) && ((offset_2 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_2)))) {
-				/* store sequence */
-				size_t const rLength = ZSTD_count(ip + 4, ip + 4 - offset_2, iend) + 4;
-				{
-					U32 const tmpOff = offset_2;
-					offset_2 = offset_1;
-					offset_1 = tmpOff;
-				} /* swap offset_2 <=> offset_1 */
-				hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
-				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength - MINMATCH);
-				ip += rLength;
-				anchor = ip;
-				continue; /* faster when present ... (?) */
-			}
-		}
-	}
-
-	/* save reps for next block */
-	cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-	cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-static void ZSTD_compressBlock_fast(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	const U32 mls = ctx->params.cParams.searchLength;
-	switch (mls) {
-	default: /* includes case 3 */
-	case 4: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4); return;
-	case 5: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 5); return;
-	case 6: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 6); return;
-	case 7: ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 7); return;
-	}
-}
-
-static void ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 mls)
-{
-	U32 *hashTable = ctx->hashTable;
-	const U32 hBits = ctx->params.cParams.hashLog;
-	seqStore_t *seqStorePtr = &(ctx->seqStore);
-	const BYTE *const base = ctx->base;
-	const BYTE *const dictBase = ctx->dictBase;
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const U32 lowestIndex = ctx->lowLimit;
-	const BYTE *const dictStart = dictBase + lowestIndex;
-	const U32 dictLimit = ctx->dictLimit;
-	const BYTE *const lowPrefixPtr = base + dictLimit;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - 8;
-	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
-
-	/* Search Loop */
-	while (ip < ilimit) { /* < instead of <=, because (ip+1) */
-		const size_t h = ZSTD_hashPtr(ip, hBits, mls);
-		const U32 matchIndex = hashTable[h];
-		const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base;
-		const BYTE *match = matchBase + matchIndex;
-		const U32 curr = (U32)(ip - base);
-		const U32 repIndex = curr + 1 - offset_1; /* offset_1 expected <= curr +1 */
-		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
-		const BYTE *repMatch = repBase + repIndex;
-		size_t mLength;
-		hashTable[h] = curr; /* update hash table */
-
-		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
-		    (ZSTD_read32(repMatch) == ZSTD_read32(ip + 1))) {
-			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-			mLength = ZSTD_count_2segments(ip + 1 + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repMatchEnd, lowPrefixPtr) + EQUAL_READ32;
-			ip++;
-			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-		} else {
-			if ((matchIndex < lowestIndex) || (ZSTD_read32(match) != ZSTD_read32(ip))) {
-				ip += ((ip - anchor) >> g_searchStrength) + 1;
-				continue;
-			}
-			{
-				const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-				const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-				U32 offset;
-				mLength = ZSTD_count_2segments(ip + EQUAL_READ32, match + EQUAL_READ32, iend, matchEnd, lowPrefixPtr) + EQUAL_READ32;
-				while (((ip > anchor) & (match > lowMatchPtr)) && (ip[-1] == match[-1])) {
-					ip--;
-					match--;
-					mLength++;
-				} /* catch up */
-				offset = curr - matchIndex;
-				offset_2 = offset_1;
-				offset_1 = offset;
-				ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-			}
-		}
-
-		/* found a match : store it */
-		ip += mLength;
-		anchor = ip;
-
-		if (ip <= ilimit) {
-			/* Fill Table */
-			hashTable[ZSTD_hashPtr(base + curr + 2, hBits, mls)] = curr + 2;
-			hashTable[ZSTD_hashPtr(ip - 2, hBits, mls)] = (U32)(ip - 2 - base);
-			/* check immediate repcode */
-			while (ip <= ilimit) {
-				U32 const curr2 = (U32)(ip - base);
-				U32 const repIndex2 = curr2 - offset_2;
-				const BYTE *repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-				if ((((U32)((dictLimit - 1) - repIndex2) >= 3) & (repIndex2 > lowestIndex)) /* intentional overflow */
-				    && (ZSTD_read32(repMatch2) == ZSTD_read32(ip))) {
-					const BYTE *const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-					size_t repLength2 =
-					    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch2 + EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
-					U32 tmpOffset = offset_2;
-					offset_2 = offset_1;
-					offset_1 = tmpOffset; /* swap offset_2 <=> offset_1 */
-					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2 - MINMATCH);
-					hashTable[ZSTD_hashPtr(ip, hBits, mls)] = curr2;
-					ip += repLength2;
-					anchor = ip;
-					continue;
-				}
-				break;
-			}
-		}
-	}
-
-	/* save reps for next block */
-	ctx->repToConfirm[0] = offset_1;
-	ctx->repToConfirm[1] = offset_2;
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-static void ZSTD_compressBlock_fast_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	U32 const mls = ctx->params.cParams.searchLength;
-	switch (mls) {
-	default: /* includes case 3 */
-	case 4: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4); return;
-	case 5: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 5); return;
-	case 6: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 6); return;
-	case 7: ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 7); return;
-	}
-}
-
-/*-*************************************
-*  Double Fast
-***************************************/
-static void ZSTD_fillDoubleHashTable(ZSTD_CCtx *cctx, const void *end, const U32 mls)
-{
-	U32 *const hashLarge = cctx->hashTable;
-	U32 const hBitsL = cctx->params.cParams.hashLog;
-	U32 *const hashSmall = cctx->chainTable;
-	U32 const hBitsS = cctx->params.cParams.chainLog;
-	const BYTE *const base = cctx->base;
-	const BYTE *ip = base + cctx->nextToUpdate;
-	const BYTE *const iend = ((const BYTE *)end) - HASH_READ_SIZE;
-	const size_t fastHashFillStep = 3;
-
-	while (ip <= iend) {
-		hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
-		hashLarge[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
-		ip += fastHashFillStep;
-	}
-}
-
-FORCE_INLINE
-void ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx *cctx, const void *src, size_t srcSize, const U32 mls)
-{
-	U32 *const hashLong = cctx->hashTable;
-	const U32 hBitsL = cctx->params.cParams.hashLog;
-	U32 *const hashSmall = cctx->chainTable;
-	const U32 hBitsS = cctx->params.cParams.chainLog;
-	seqStore_t *seqStorePtr = &(cctx->seqStore);
-	const BYTE *const base = cctx->base;
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const U32 lowestIndex = cctx->dictLimit;
-	const BYTE *const lowest = base + lowestIndex;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - HASH_READ_SIZE;
-	U32 offset_1 = cctx->rep[0], offset_2 = cctx->rep[1];
-	U32 offsetSaved = 0;
-
-	/* init */
-	ip += (ip == lowest);
-	{
-		U32 const maxRep = (U32)(ip - lowest);
-		if (offset_2 > maxRep)
-			offsetSaved = offset_2, offset_2 = 0;
-		if (offset_1 > maxRep)
-			offsetSaved = offset_1, offset_1 = 0;
-	}
-
-	/* Main Search Loop */
-	while (ip < ilimit) { /* < instead of <=, because repcode check at (ip+1) */
-		size_t mLength;
-		size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
-		size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
-		U32 const curr = (U32)(ip - base);
-		U32 const matchIndexL = hashLong[h2];
-		U32 const matchIndexS = hashSmall[h];
-		const BYTE *matchLong = base + matchIndexL;
-		const BYTE *match = base + matchIndexS;
-		hashLong[h2] = hashSmall[h] = curr; /* update hash tables */
-
-		if ((offset_1 > 0) & (ZSTD_read32(ip + 1 - offset_1) == ZSTD_read32(ip + 1))) { /* note : by construction, offset_1 <= curr */
-			mLength = ZSTD_count(ip + 1 + 4, ip + 1 + 4 - offset_1, iend) + 4;
-			ip++;
-			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-		} else {
-			U32 offset;
-			if ((matchIndexL > lowestIndex) && (ZSTD_read64(matchLong) == ZSTD_read64(ip))) {
-				mLength = ZSTD_count(ip + 8, matchLong + 8, iend) + 8;
-				offset = (U32)(ip - matchLong);
-				while (((ip > anchor) & (matchLong > lowest)) && (ip[-1] == matchLong[-1])) {
-					ip--;
-					matchLong--;
-					mLength++;
-				} /* catch up */
-			} else if ((matchIndexS > lowestIndex) && (ZSTD_read32(match) == ZSTD_read32(ip))) {
-				size_t const h3 = ZSTD_hashPtr(ip + 1, hBitsL, 8);
-				U32 const matchIndex3 = hashLong[h3];
-				const BYTE *match3 = base + matchIndex3;
-				hashLong[h3] = curr + 1;
-				if ((matchIndex3 > lowestIndex) && (ZSTD_read64(match3) == ZSTD_read64(ip + 1))) {
-					mLength = ZSTD_count(ip + 9, match3 + 8, iend) + 8;
-					ip++;
-					offset = (U32)(ip - match3);
-					while (((ip > anchor) & (match3 > lowest)) && (ip[-1] == match3[-1])) {
-						ip--;
-						match3--;
-						mLength++;
-					} /* catch up */
-				} else {
-					mLength = ZSTD_count(ip + 4, match + 4, iend) + 4;
-					offset = (U32)(ip - match);
-					while (((ip > anchor) & (match > lowest)) && (ip[-1] == match[-1])) {
-						ip--;
-						match--;
-						mLength++;
-					} /* catch up */
-				}
-			} else {
-				ip += ((ip - anchor) >> g_searchStrength) + 1;
-				continue;
-			}
-
-			offset_2 = offset_1;
-			offset_1 = offset;
-
-			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-		}
-
-		/* match found */
-		ip += mLength;
-		anchor = ip;
-
-		if (ip <= ilimit) {
-			/* Fill Table */
-			hashLong[ZSTD_hashPtr(base + curr + 2, hBitsL, 8)] = hashSmall[ZSTD_hashPtr(base + curr + 2, hBitsS, mls)] =
-			    curr + 2; /* here because curr+2 could be > iend-8 */
-			hashLong[ZSTD_hashPtr(ip - 2, hBitsL, 8)] = hashSmall[ZSTD_hashPtr(ip - 2, hBitsS, mls)] = (U32)(ip - 2 - base);
-
-			/* check immediate repcode */
-			while ((ip <= ilimit) && ((offset_2 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_2)))) {
-				/* store sequence */
-				size_t const rLength = ZSTD_count(ip + 4, ip + 4 - offset_2, iend) + 4;
-				{
-					U32 const tmpOff = offset_2;
-					offset_2 = offset_1;
-					offset_1 = tmpOff;
-				} /* swap offset_2 <=> offset_1 */
-				hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
-				hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
-				ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength - MINMATCH);
-				ip += rLength;
-				anchor = ip;
-				continue; /* faster when present ... (?) */
-			}
-		}
-	}
-
-	/* save reps for next block */
-	cctx->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-	cctx->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-static void ZSTD_compressBlock_doubleFast(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	const U32 mls = ctx->params.cParams.searchLength;
-	switch (mls) {
-	default: /* includes case 3 */
-	case 4: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4); return;
-	case 5: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 5); return;
-	case 6: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 6); return;
-	case 7: ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 7); return;
-	}
-}
-
-static void ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 mls)
-{
-	U32 *const hashLong = ctx->hashTable;
-	U32 const hBitsL = ctx->params.cParams.hashLog;
-	U32 *const hashSmall = ctx->chainTable;
-	U32 const hBitsS = ctx->params.cParams.chainLog;
-	seqStore_t *seqStorePtr = &(ctx->seqStore);
-	const BYTE *const base = ctx->base;
-	const BYTE *const dictBase = ctx->dictBase;
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const U32 lowestIndex = ctx->lowLimit;
-	const BYTE *const dictStart = dictBase + lowestIndex;
-	const U32 dictLimit = ctx->dictLimit;
-	const BYTE *const lowPrefixPtr = base + dictLimit;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - 8;
-	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
-
-	/* Search Loop */
-	while (ip < ilimit) { /* < instead of <=, because (ip+1) */
-		const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
-		const U32 matchIndex = hashSmall[hSmall];
-		const BYTE *matchBase = matchIndex < dictLimit ? dictBase : base;
-		const BYTE *match = matchBase + matchIndex;
-
-		const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
-		const U32 matchLongIndex = hashLong[hLong];
-		const BYTE *matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
-		const BYTE *matchLong = matchLongBase + matchLongIndex;
-
-		const U32 curr = (U32)(ip - base);
-		const U32 repIndex = curr + 1 - offset_1; /* offset_1 expected <= curr +1 */
-		const BYTE *repBase = repIndex < dictLimit ? dictBase : base;
-		const BYTE *repMatch = repBase + repIndex;
-		size_t mLength;
-		hashSmall[hSmall] = hashLong[hLong] = curr; /* update hash table */
-
-		if ((((U32)((dictLimit - 1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex)) &&
-		    (ZSTD_read32(repMatch) == ZSTD_read32(ip + 1))) {
-			const BYTE *repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-			mLength = ZSTD_count_2segments(ip + 1 + 4, repMatch + 4, iend, repMatchEnd, lowPrefixPtr) + 4;
-			ip++;
-			ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, 0, mLength - MINMATCH);
-		} else {
-			if ((matchLongIndex > lowestIndex) && (ZSTD_read64(matchLong) == ZSTD_read64(ip))) {
-				const BYTE *matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
-				const BYTE *lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
-				U32 offset;
-				mLength = ZSTD_count_2segments(ip + 8, matchLong + 8, iend, matchEnd, lowPrefixPtr) + 8;
-				offset = curr - matchLongIndex;
-				while (((ip > anchor) & (matchLong > lowMatchPtr)) && (ip[-1] == matchLong[-1])) {
-					ip--;
-					matchLong--;
-					mLength++;
-				} /* catch up */
-				offset_2 = offset_1;
-				offset_1 = offset;
-				ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-
-			} else if ((matchIndex > lowestIndex) && (ZSTD_read32(match) == ZSTD_read32(ip))) {
-				size_t const h3 = ZSTD_hashPtr(ip + 1, hBitsL, 8);
-				U32 const matchIndex3 = hashLong[h3];
-				const BYTE *const match3Base = matchIndex3 < dictLimit ? dictBase : base;
-				const BYTE *match3 = match3Base + matchIndex3;
-				U32 offset;
-				hashLong[h3] = curr + 1;
-				if ((matchIndex3 > lowestIndex) && (ZSTD_read64(match3) == ZSTD_read64(ip + 1))) {
-					const BYTE *matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
-					const BYTE *lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
-					mLength = ZSTD_count_2segments(ip + 9, match3 + 8, iend, matchEnd, lowPrefixPtr) + 8;
-					ip++;
-					offset = curr + 1 - matchIndex3;
-					while (((ip > anchor) & (match3 > lowMatchPtr)) && (ip[-1] == match3[-1])) {
-						ip--;
-						match3--;
-						mLength++;
-					} /* catch up */
-				} else {
-					const BYTE *matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-					const BYTE *lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-					mLength = ZSTD_count_2segments(ip + 4, match + 4, iend, matchEnd, lowPrefixPtr) + 4;
-					offset = curr - matchIndex;
-					while (((ip > anchor) & (match > lowMatchPtr)) && (ip[-1] == match[-1])) {
-						ip--;
-						match--;
-						mLength++;
-					} /* catch up */
-				}
-				offset_2 = offset_1;
-				offset_1 = offset;
-				ZSTD_storeSeq(seqStorePtr, ip - anchor, anchor, offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-
-			} else {
-				ip += ((ip - anchor) >> g_searchStrength) + 1;
-				continue;
-			}
-		}
-
-		/* found a match : store it */
-		ip += mLength;
-		anchor = ip;
-
-		if (ip <= ilimit) {
-			/* Fill Table */
-			hashSmall[ZSTD_hashPtr(base + curr + 2, hBitsS, mls)] = curr + 2;
-			hashLong[ZSTD_hashPtr(base + curr + 2, hBitsL, 8)] = curr + 2;
-			hashSmall[ZSTD_hashPtr(ip - 2, hBitsS, mls)] = (U32)(ip - 2 - base);
-			hashLong[ZSTD_hashPtr(ip - 2, hBitsL, 8)] = (U32)(ip - 2 - base);
-			/* check immediate repcode */
-			while (ip <= ilimit) {
-				U32 const curr2 = (U32)(ip - base);
-				U32 const repIndex2 = curr2 - offset_2;
-				const BYTE *repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-				if ((((U32)((dictLimit - 1) - repIndex2) >= 3) & (repIndex2 > lowestIndex)) /* intentional overflow */
-				    && (ZSTD_read32(repMatch2) == ZSTD_read32(ip))) {
-					const BYTE *const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-					size_t const repLength2 =
-					    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch2 + EQUAL_READ32, iend, repEnd2, lowPrefixPtr) + EQUAL_READ32;
-					U32 tmpOffset = offset_2;
-					offset_2 = offset_1;
-					offset_1 = tmpOffset; /* swap offset_2 <=> offset_1 */
-					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2 - MINMATCH);
-					hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = curr2;
-					hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = curr2;
-					ip += repLength2;
-					anchor = ip;
-					continue;
-				}
-				break;
-			}
-		}
-	}
-
-	/* save reps for next block */
-	ctx->repToConfirm[0] = offset_1;
-	ctx->repToConfirm[1] = offset_2;
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-static void ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	U32 const mls = ctx->params.cParams.searchLength;
-	switch (mls) {
-	default: /* includes case 3 */
-	case 4: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4); return;
-	case 5: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 5); return;
-	case 6: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 6); return;
-	case 7: ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 7); return;
-	}
-}
-
-/*-*************************************
-*  Binary Tree search
-***************************************/
-/** ZSTD_insertBt1() : add one or multiple positions to tree.
-*   ip : assumed <= iend-8 .
-*   @return : nb of positions added */
-static U32 ZSTD_insertBt1(ZSTD_CCtx *zc, const BYTE *const ip, const U32 mls, const BYTE *const iend, U32 nbCompares, U32 extDict)
-{
-	U32 *const hashTable = zc->hashTable;
-	U32 const hashLog = zc->params.cParams.hashLog;
-	size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
-	U32 *const bt = zc->chainTable;
-	U32 const btLog = zc->params.cParams.chainLog - 1;
-	U32 const btMask = (1 << btLog) - 1;
-	U32 matchIndex = hashTable[h];
-	size_t commonLengthSmaller = 0, commonLengthLarger = 0;
-	const BYTE *const base = zc->base;
-	const BYTE *const dictBase = zc->dictBase;
-	const U32 dictLimit = zc->dictLimit;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const BYTE *const prefixStart = base + dictLimit;
-	const BYTE *match;
-	const U32 curr = (U32)(ip - base);
-	const U32 btLow = btMask >= curr ? 0 : curr - btMask;
-	U32 *smallerPtr = bt + 2 * (curr & btMask);
-	U32 *largerPtr = smallerPtr + 1;
-	U32 dummy32; /* to be nullified at the end */
-	U32 const windowLow = zc->lowLimit;
-	U32 matchEndIdx = curr + 8;
-	size_t bestLength = 8;
-
-	hashTable[h] = curr; /* Update Hash Table */
-
-	while (nbCompares-- && (matchIndex > windowLow)) {
-		U32 *const nextPtr = bt + 2 * (matchIndex & btMask);
-		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
-
-		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
-			match = base + matchIndex;
-			if (match[matchLength] == ip[matchLength])
-				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iend) + 1;
-		} else {
-			match = dictBase + matchIndex;
-			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iend, dictEnd, prefixStart);
-			if (matchIndex + matchLength >= dictLimit)
-				match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
-		}
-
-		if (matchLength > bestLength) {
-			bestLength = matchLength;
-			if (matchLength > matchEndIdx - matchIndex)
-				matchEndIdx = matchIndex + (U32)matchLength;
-		}
-
-		if (ip + matchLength == iend) /* equal : no way to know if inf or sup */
-			break;		      /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt the tree */
-
-		if (match[matchLength] < ip[matchLength]) { /* necessarily within correct buffer */
-			/* match is smaller than curr */
-			*smallerPtr = matchIndex;	  /* update smaller idx */
-			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
-			if (matchIndex <= btLow) {
-				smallerPtr = &dummy32;
-				break;
-			}			  /* beyond tree size, stop the search */
-			smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */
-			matchIndex = nextPtr[1];  /* new matchIndex larger than previous (closer to curr) */
-		} else {
-			/* match is larger than curr */
-			*largerPtr = matchIndex;
-			commonLengthLarger = matchLength;
-			if (matchIndex <= btLow) {
-				largerPtr = &dummy32;
-				break;
-			} /* beyond tree size, stop the search */
-			largerPtr = nextPtr;
-			matchIndex = nextPtr[0];
-		}
-	}
-
-	*smallerPtr = *largerPtr = 0;
-	if (bestLength > 384)
-		return MIN(192, (U32)(bestLength - 384)); /* speed optimization */
-	if (matchEndIdx > curr + 8)
-		return matchEndIdx - curr - 8;
-	return 1;
-}
-
-static size_t ZSTD_insertBtAndFindBestMatch(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, size_t *offsetPtr, U32 nbCompares, const U32 mls,
-					    U32 extDict)
-{
-	U32 *const hashTable = zc->hashTable;
-	U32 const hashLog = zc->params.cParams.hashLog;
-	size_t const h = ZSTD_hashPtr(ip, hashLog, mls);
-	U32 *const bt = zc->chainTable;
-	U32 const btLog = zc->params.cParams.chainLog - 1;
-	U32 const btMask = (1 << btLog) - 1;
-	U32 matchIndex = hashTable[h];
-	size_t commonLengthSmaller = 0, commonLengthLarger = 0;
-	const BYTE *const base = zc->base;
-	const BYTE *const dictBase = zc->dictBase;
-	const U32 dictLimit = zc->dictLimit;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const BYTE *const prefixStart = base + dictLimit;
-	const U32 curr = (U32)(ip - base);
-	const U32 btLow = btMask >= curr ? 0 : curr - btMask;
-	const U32 windowLow = zc->lowLimit;
-	U32 *smallerPtr = bt + 2 * (curr & btMask);
-	U32 *largerPtr = bt + 2 * (curr & btMask) + 1;
-	U32 matchEndIdx = curr + 8;
-	U32 dummy32; /* to be nullified at the end */
-	size_t bestLength = 0;
-
-	hashTable[h] = curr; /* Update Hash Table */
-
-	while (nbCompares-- && (matchIndex > windowLow)) {
-		U32 *const nextPtr = bt + 2 * (matchIndex & btMask);
-		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
-		const BYTE *match;
-
-		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
-			match = base + matchIndex;
-			if (match[matchLength] == ip[matchLength])
-				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iend) + 1;
-		} else {
-			match = dictBase + matchIndex;
-			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iend, dictEnd, prefixStart);
-			if (matchIndex + matchLength >= dictLimit)
-				match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
-		}
-
-		if (matchLength > bestLength) {
-			if (matchLength > matchEndIdx - matchIndex)
-				matchEndIdx = matchIndex + (U32)matchLength;
-			if ((4 * (int)(matchLength - bestLength)) > (int)(ZSTD_highbit32(curr - matchIndex + 1) - ZSTD_highbit32((U32)offsetPtr[0] + 1)))
-				bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + curr - matchIndex;
-			if (ip + matchLength == iend) /* equal : no way to know if inf or sup */
-				break;		      /* drop, to guarantee consistency (miss a little bit of compression) */
-		}
-
-		if (match[matchLength] < ip[matchLength]) {
-			/* match is smaller than curr */
-			*smallerPtr = matchIndex;	  /* update smaller idx */
-			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
-			if (matchIndex <= btLow) {
-				smallerPtr = &dummy32;
-				break;
-			}			  /* beyond tree size, stop the search */
-			smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */
-			matchIndex = nextPtr[1];  /* new matchIndex larger than previous (closer to curr) */
-		} else {
-			/* match is larger than curr */
-			*largerPtr = matchIndex;
-			commonLengthLarger = matchLength;
-			if (matchIndex <= btLow) {
-				largerPtr = &dummy32;
-				break;
-			} /* beyond tree size, stop the search */
-			largerPtr = nextPtr;
-			matchIndex = nextPtr[0];
-		}
-	}
-
-	*smallerPtr = *largerPtr = 0;
-
-	zc->nextToUpdate = (matchEndIdx > curr + 8) ? matchEndIdx - 8 : curr + 1;
-	return bestLength;
-}
-
-static void ZSTD_updateTree(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, const U32 nbCompares, const U32 mls)
-{
-	const BYTE *const base = zc->base;
-	const U32 target = (U32)(ip - base);
-	U32 idx = zc->nextToUpdate;
-
-	while (idx < target)
-		idx += ZSTD_insertBt1(zc, base + idx, mls, iend, nbCompares, 0);
-}
-
-/** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
-static size_t ZSTD_BtFindBestMatch(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls)
-{
-	if (ip < zc->base + zc->nextToUpdate)
-		return 0; /* skipped area */
-	ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-	return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0);
-}
-
-static size_t ZSTD_BtFindBestMatch_selectMLS(ZSTD_CCtx *zc, /* Index table will be updated */
-					     const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 matchLengthSearch)
-{
-	switch (matchLengthSearch) {
-	default: /* includes case 3 */
-	case 4: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-	case 5: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-	case 7:
-	case 6: return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-	}
-}
-
-static void ZSTD_updateTree_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iend, const U32 nbCompares, const U32 mls)
-{
-	const BYTE *const base = zc->base;
-	const U32 target = (U32)(ip - base);
-	U32 idx = zc->nextToUpdate;
-
-	while (idx < target)
-		idx += ZSTD_insertBt1(zc, base + idx, mls, iend, nbCompares, 1);
-}
-
-/** Tree updater, providing best match */
-static size_t ZSTD_BtFindBestMatch_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-					   const U32 mls)
-{
-	if (ip < zc->base + zc->nextToUpdate)
-		return 0; /* skipped area */
-	ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-	return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1);
-}
-
-static size_t ZSTD_BtFindBestMatch_selectMLS_extDict(ZSTD_CCtx *zc, /* Index table will be updated */
-						     const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-						     const U32 matchLengthSearch)
-{
-	switch (matchLengthSearch) {
-	default: /* includes case 3 */
-	case 4: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-	case 5: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-	case 7:
-	case 6: return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-	}
-}
-
-/* *********************************
-*  Hash Chain
-***********************************/
-#define NEXT_IN_CHAIN(d, mask) chainTable[(d)&mask]
-
-/* Update chains up to ip (excluded)
-   Assumption : always within prefix (i.e. not within extDict) */
-FORCE_INLINE
-U32 ZSTD_insertAndFindFirstIndex(ZSTD_CCtx *zc, const BYTE *ip, U32 mls)
-{
-	U32 *const hashTable = zc->hashTable;
-	const U32 hashLog = zc->params.cParams.hashLog;
-	U32 *const chainTable = zc->chainTable;
-	const U32 chainMask = (1 << zc->params.cParams.chainLog) - 1;
-	const BYTE *const base = zc->base;
-	const U32 target = (U32)(ip - base);
-	U32 idx = zc->nextToUpdate;
-
-	while (idx < target) { /* catch up */
-		size_t const h = ZSTD_hashPtr(base + idx, hashLog, mls);
-		NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
-		hashTable[h] = idx;
-		idx++;
-	}
-
-	zc->nextToUpdate = target;
-	return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
-}
-
-/* inlining is important to hardwire a hot branch (template emulation) */
-FORCE_INLINE
-size_t ZSTD_HcFindBestMatch_generic(ZSTD_CCtx *zc, /* Index table will be updated */
-				    const BYTE *const ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts, const U32 mls,
-				    const U32 extDict)
-{
-	U32 *const chainTable = zc->chainTable;
-	const U32 chainSize = (1 << zc->params.cParams.chainLog);
-	const U32 chainMask = chainSize - 1;
-	const BYTE *const base = zc->base;
-	const BYTE *const dictBase = zc->dictBase;
-	const U32 dictLimit = zc->dictLimit;
-	const BYTE *const prefixStart = base + dictLimit;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const U32 lowLimit = zc->lowLimit;
-	const U32 curr = (U32)(ip - base);
-	const U32 minChain = curr > chainSize ? curr - chainSize : 0;
-	int nbAttempts = maxNbAttempts;
-	size_t ml = EQUAL_READ32 - 1;
-
-	/* HC4 match finder */
-	U32 matchIndex = ZSTD_insertAndFindFirstIndex(zc, ip, mls);
-
-	for (; (matchIndex > lowLimit) & (nbAttempts > 0); nbAttempts--) {
-		const BYTE *match;
-		size_t currMl = 0;
-		if ((!extDict) || matchIndex >= dictLimit) {
-			match = base + matchIndex;
-			if (match[ml] == ip[ml]) /* potentially better */
-				currMl = ZSTD_count(ip, match, iLimit);
-		} else {
-			match = dictBase + matchIndex;
-			if (ZSTD_read32(match) == ZSTD_read32(ip)) /* assumption : matchIndex <= dictLimit-4 (by table construction) */
-				currMl = ZSTD_count_2segments(ip + EQUAL_READ32, match + EQUAL_READ32, iLimit, dictEnd, prefixStart) + EQUAL_READ32;
-		}
-
-		/* save best solution */
-		if (currMl > ml) {
-			ml = currMl;
-			*offsetPtr = curr - matchIndex + ZSTD_REP_MOVE;
-			if (ip + currMl == iLimit)
-				break; /* best possible, and avoid read overflow*/
-		}
-
-		if (matchIndex <= minChain)
-			break;
-		matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
-	}
-
-	return ml;
-}
-
-FORCE_INLINE size_t ZSTD_HcFindBestMatch_selectMLS(ZSTD_CCtx *zc, const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-						   const U32 matchLengthSearch)
-{
-	switch (matchLengthSearch) {
-	default: /* includes case 3 */
-	case 4: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
-	case 5: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
-	case 7:
-	case 6: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
-	}
-}
-
-FORCE_INLINE size_t ZSTD_HcFindBestMatch_extDict_selectMLS(ZSTD_CCtx *zc, const BYTE *ip, const BYTE *const iLimit, size_t *offsetPtr, const U32 maxNbAttempts,
-							   const U32 matchLengthSearch)
-{
-	switch (matchLengthSearch) {
-	default: /* includes case 3 */
-	case 4: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
-	case 5: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
-	case 7:
-	case 6: return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
-	}
-}
-
-/* *******************************
-*  Common parser - lazy strategy
-*********************************/
-FORCE_INLINE
-void ZSTD_compressBlock_lazy_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 searchMethod, const U32 depth)
-{
-	seqStore_t *seqStorePtr = &(ctx->seqStore);
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - 8;
-	const BYTE *const base = ctx->base + ctx->dictLimit;
-
-	U32 const maxSearches = 1 << ctx->params.cParams.searchLog;
-	U32 const mls = ctx->params.cParams.searchLength;
-
-	typedef size_t (*searchMax_f)(ZSTD_CCtx * zc, const BYTE *ip, const BYTE *iLimit, size_t *offsetPtr, U32 maxNbAttempts, U32 matchLengthSearch);
-	searchMax_f const searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS : ZSTD_HcFindBestMatch_selectMLS;
-	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1], savedOffset = 0;
-
-	/* init */
-	ip += (ip == base);
-	ctx->nextToUpdate3 = ctx->nextToUpdate;
-	{
-		U32 const maxRep = (U32)(ip - base);
-		if (offset_2 > maxRep)
-			savedOffset = offset_2, offset_2 = 0;
-		if (offset_1 > maxRep)
-			savedOffset = offset_1, offset_1 = 0;
-	}
-
-	/* Match Loop */
-	while (ip < ilimit) {
-		size_t matchLength = 0;
-		size_t offset = 0;
-		const BYTE *start = ip + 1;
-
-		/* check repCode */
-		if ((offset_1 > 0) & (ZSTD_read32(ip + 1) == ZSTD_read32(ip + 1 - offset_1))) {
-			/* repcode : we take it */
-			matchLength = ZSTD_count(ip + 1 + EQUAL_READ32, ip + 1 + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
-			if (depth == 0)
-				goto _storeSequence;
-		}
-
-		/* first search (depth 0) */
-		{
-			size_t offsetFound = 99999999;
-			size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-			if (ml2 > matchLength)
-				matchLength = ml2, start = ip, offset = offsetFound;
-		}
-
-		if (matchLength < EQUAL_READ32) {
-			ip += ((ip - anchor) >> g_searchStrength) + 1; /* jump faster over incompressible sections */
-			continue;
-		}
-
-		/* let's try to find a better solution */
-		if (depth >= 1)
-			while (ip < ilimit) {
-				ip++;
-				if ((offset) && ((offset_1 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_1)))) {
-					size_t const mlRep = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
-					int const gain2 = (int)(mlRep * 3);
-					int const gain1 = (int)(matchLength * 3 - ZSTD_highbit32((U32)offset + 1) + 1);
-					if ((mlRep >= EQUAL_READ32) && (gain2 > gain1))
-						matchLength = mlRep, offset = 0, start = ip;
-				}
-				{
-					size_t offset2 = 99999999;
-					size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-					int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-					int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 4);
-					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-						matchLength = ml2, offset = offset2, start = ip;
-						continue; /* search a better one */
-					}
-				}
-
-				/* let's find an even better one */
-				if ((depth == 2) && (ip < ilimit)) {
-					ip++;
-					if ((offset) && ((offset_1 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_1)))) {
-						size_t const ml2 = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_1, iend) + EQUAL_READ32;
-						int const gain2 = (int)(ml2 * 4);
-						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 1);
-						if ((ml2 >= EQUAL_READ32) && (gain2 > gain1))
-							matchLength = ml2, offset = 0, start = ip;
-					}
-					{
-						size_t offset2 = 99999999;
-						size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-						int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 7);
-						if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-							matchLength = ml2, offset = offset2, start = ip;
-							continue;
-						}
-					}
-				}
-				break; /* nothing found : store previous solution */
-			}
-
-		/* NOTE:
-		 * start[-offset+ZSTD_REP_MOVE-1] is undefined behavior.
-		 * (-offset+ZSTD_REP_MOVE-1) is unsigned, and is added to start, which
-		 * overflows the pointer, which is undefined behavior.
-		 */
-		/* catch up */
-		if (offset) {
-			while ((start > anchor) && (start > base + offset - ZSTD_REP_MOVE) &&
-			       (start[-1] == (start-offset+ZSTD_REP_MOVE)[-1])) /* only search for offset within prefix */
-			{
-				start--;
-				matchLength++;
-			}
-			offset_2 = offset_1;
-			offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-		}
-
-	/* store sequence */
-_storeSequence:
-		{
-			size_t const litLength = start - anchor;
-			ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength - MINMATCH);
-			anchor = ip = start + matchLength;
-		}
-
-		/* check immediate repcode */
-		while ((ip <= ilimit) && ((offset_2 > 0) & (ZSTD_read32(ip) == ZSTD_read32(ip - offset_2)))) {
-			/* store sequence */
-			matchLength = ZSTD_count(ip + EQUAL_READ32, ip + EQUAL_READ32 - offset_2, iend) + EQUAL_READ32;
-			offset = offset_2;
-			offset_2 = offset_1;
-			offset_1 = (U32)offset; /* swap repcodes */
-			ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength - MINMATCH);
-			ip += matchLength;
-			anchor = ip;
-			continue; /* faster when present ... (?) */
-		}
-	}
-
-	/* Save reps for next block */
-	ctx->repToConfirm[0] = offset_1 ? offset_1 : savedOffset;
-	ctx->repToConfirm[1] = offset_2 ? offset_2 : savedOffset;
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-static void ZSTD_compressBlock_btlazy2(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 1, 2); }
-
-static void ZSTD_compressBlock_lazy2(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 2); }
-
-static void ZSTD_compressBlock_lazy(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 1); }
-
-static void ZSTD_compressBlock_greedy(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 0); }
-
-FORCE_INLINE
-void ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const U32 searchMethod, const U32 depth)
-{
-	seqStore_t *seqStorePtr = &(ctx->seqStore);
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - 8;
-	const BYTE *const base = ctx->base;
-	const U32 dictLimit = ctx->dictLimit;
-	const U32 lowestIndex = ctx->lowLimit;
-	const BYTE *const prefixStart = base + dictLimit;
-	const BYTE *const dictBase = ctx->dictBase;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const BYTE *const dictStart = dictBase + ctx->lowLimit;
-
-	const U32 maxSearches = 1 << ctx->params.cParams.searchLog;
-	const U32 mls = ctx->params.cParams.searchLength;
-
-	typedef size_t (*searchMax_f)(ZSTD_CCtx * zc, const BYTE *ip, const BYTE *iLimit, size_t *offsetPtr, U32 maxNbAttempts, U32 matchLengthSearch);
-	searchMax_f searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS_extDict : ZSTD_HcFindBestMatch_extDict_selectMLS;
-
-	U32 offset_1 = ctx->rep[0], offset_2 = ctx->rep[1];
-
-	/* init */
-	ctx->nextToUpdate3 = ctx->nextToUpdate;
-	ip += (ip == prefixStart);
-
-	/* Match Loop */
-	while (ip < ilimit) {
-		size_t matchLength = 0;
-		size_t offset = 0;
-		const BYTE *start = ip + 1;
-		U32 curr = (U32)(ip - base);
-
-		/* check repCode */
-		{
-			const U32 repIndex = (U32)(curr + 1 - offset_1);
-			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-			const BYTE *const repMatch = repBase + repIndex;
-			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-				if (ZSTD_read32(ip + 1) == ZSTD_read32(repMatch)) {
-					/* repcode detected we should take it */
-					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-					matchLength =
-					    ZSTD_count_2segments(ip + 1 + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-					if (depth == 0)
-						goto _storeSequence;
-				}
-		}
-
-		/* first search (depth 0) */
-		{
-			size_t offsetFound = 99999999;
-			size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-			if (ml2 > matchLength)
-				matchLength = ml2, start = ip, offset = offsetFound;
-		}
-
-		if (matchLength < EQUAL_READ32) {
-			ip += ((ip - anchor) >> g_searchStrength) + 1; /* jump faster over incompressible sections */
-			continue;
-		}
-
-		/* let's try to find a better solution */
-		if (depth >= 1)
-			while (ip < ilimit) {
-				ip++;
-				curr++;
-				/* check repCode */
-				if (offset) {
-					const U32 repIndex = (U32)(curr - offset_1);
-					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-					const BYTE *const repMatch = repBase + repIndex;
-					if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-						if (ZSTD_read32(ip) == ZSTD_read32(repMatch)) {
-							/* repcode detected */
-							const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-							size_t const repLength =
-							    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repEnd, prefixStart) +
-							    EQUAL_READ32;
-							int const gain2 = (int)(repLength * 3);
-							int const gain1 = (int)(matchLength * 3 - ZSTD_highbit32((U32)offset + 1) + 1);
-							if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
-								matchLength = repLength, offset = 0, start = ip;
-						}
-				}
-
-				/* search match, depth 1 */
-				{
-					size_t offset2 = 99999999;
-					size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-					int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-					int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 4);
-					if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-						matchLength = ml2, offset = offset2, start = ip;
-						continue; /* search a better one */
-					}
-				}
-
-				/* let's find an even better one */
-				if ((depth == 2) && (ip < ilimit)) {
-					ip++;
-					curr++;
-					/* check repCode */
-					if (offset) {
-						const U32 repIndex = (U32)(curr - offset_1);
-						const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-						const BYTE *const repMatch = repBase + repIndex;
-						if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-							if (ZSTD_read32(ip) == ZSTD_read32(repMatch)) {
-								/* repcode detected */
-								const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-								size_t repLength = ZSTD_count_2segments(ip + EQUAL_READ32, repMatch + EQUAL_READ32, iend,
-													repEnd, prefixStart) +
-										   EQUAL_READ32;
-								int gain2 = (int)(repLength * 4);
-								int gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 1);
-								if ((repLength >= EQUAL_READ32) && (gain2 > gain1))
-									matchLength = repLength, offset = 0, start = ip;
-							}
-					}
-
-					/* search match, depth 2 */
-					{
-						size_t offset2 = 99999999;
-						size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-						int const gain2 = (int)(ml2 * 4 - ZSTD_highbit32((U32)offset2 + 1)); /* raw approx */
-						int const gain1 = (int)(matchLength * 4 - ZSTD_highbit32((U32)offset + 1) + 7);
-						if ((ml2 >= EQUAL_READ32) && (gain2 > gain1)) {
-							matchLength = ml2, offset = offset2, start = ip;
-							continue;
-						}
-					}
-				}
-				break; /* nothing found : store previous solution */
-			}
-
-		/* catch up */
-		if (offset) {
-			U32 const matchIndex = (U32)((start - base) - (offset - ZSTD_REP_MOVE));
-			const BYTE *match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
-			const BYTE *const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
-			while ((start > anchor) && (match > mStart) && (start[-1] == match[-1])) {
-				start--;
-				match--;
-				matchLength++;
-			} /* catch up */
-			offset_2 = offset_1;
-			offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-		}
-
-	/* store sequence */
-	_storeSequence : {
-		size_t const litLength = start - anchor;
-		ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength - MINMATCH);
-		anchor = ip = start + matchLength;
-	}
-
-		/* check immediate repcode */
-		while (ip <= ilimit) {
-			const U32 repIndex = (U32)((ip - base) - offset_2);
-			const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-			const BYTE *const repMatch = repBase + repIndex;
-			if (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-				if (ZSTD_read32(ip) == ZSTD_read32(repMatch)) {
-					/* repcode detected we should take it */
-					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-					matchLength =
-					    ZSTD_count_2segments(ip + EQUAL_READ32, repMatch + EQUAL_READ32, iend, repEnd, prefixStart) + EQUAL_READ32;
-					offset = offset_2;
-					offset_2 = offset_1;
-					offset_1 = (U32)offset; /* swap offset history */
-					ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength - MINMATCH);
-					ip += matchLength;
-					anchor = ip;
-					continue; /* faster when present ... (?) */
-				}
-			break;
-		}
-	}
-
-	/* Save reps for next block */
-	ctx->repToConfirm[0] = offset_1;
-	ctx->repToConfirm[1] = offset_2;
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-void ZSTD_compressBlock_greedy_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize) { ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 0); }
-
-static void ZSTD_compressBlock_lazy_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 1);
-}
-
-static void ZSTD_compressBlock_lazy2_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 2);
-}
-
-static void ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-	ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 1, 2);
-}
-
-/* The optimal parser */
-#include "zstd_opt.h"
-
-static void ZSTD_compressBlock_btopt(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-#ifdef ZSTD_OPT_H_91842398743
-	ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0);
-#else
-	(void)ctx;
-	(void)src;
-	(void)srcSize;
-	return;
-#endif
-}
-
-static void ZSTD_compressBlock_btopt2(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-#ifdef ZSTD_OPT_H_91842398743
-	ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 1);
-#else
-	(void)ctx;
-	(void)src;
-	(void)srcSize;
-	return;
-#endif
-}
-
-static void ZSTD_compressBlock_btopt_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-#ifdef ZSTD_OPT_H_91842398743
-	ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 0);
-#else
-	(void)ctx;
-	(void)src;
-	(void)srcSize;
-	return;
-#endif
-}
-
-static void ZSTD_compressBlock_btopt2_extDict(ZSTD_CCtx *ctx, const void *src, size_t srcSize)
-{
-#ifdef ZSTD_OPT_H_91842398743
-	ZSTD_compressBlock_opt_extDict_generic(ctx, src, srcSize, 1);
-#else
-	(void)ctx;
-	(void)src;
-	(void)srcSize;
-	return;
-#endif
-}
-
-typedef void (*ZSTD_blockCompressor)(ZSTD_CCtx *ctx, const void *src, size_t srcSize);
-
-static ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict)
-{
-	static const ZSTD_blockCompressor blockCompressor[2][8] = {
-	    {ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy, ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2,
-	     ZSTD_compressBlock_btlazy2, ZSTD_compressBlock_btopt, ZSTD_compressBlock_btopt2},
-	    {ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict, ZSTD_compressBlock_lazy_extDict,
-	     ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict, ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btopt2_extDict}};
-
-	return blockCompressor[extDict][(U32)strat];
-}
-
-static size_t ZSTD_compressBlock_internal(ZSTD_CCtx *zc, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	ZSTD_blockCompressor const blockCompressor = ZSTD_selectBlockCompressor(zc->params.cParams.strategy, zc->lowLimit < zc->dictLimit);
-	const BYTE *const base = zc->base;
-	const BYTE *const istart = (const BYTE *)src;
-	const U32 curr = (U32)(istart - base);
-	if (srcSize < MIN_CBLOCK_SIZE + ZSTD_blockHeaderSize + 1)
-		return 0; /* don't even attempt compression below a certain srcSize */
-	ZSTD_resetSeqStore(&(zc->seqStore));
-	if (curr > zc->nextToUpdate + 384)
-		zc->nextToUpdate = curr - MIN(192, (U32)(curr - zc->nextToUpdate - 384)); /* update tree not updated after finding very long rep matches */
-	blockCompressor(zc, src, srcSize);
-	return ZSTD_compressSequences(zc, dst, dstCapacity, srcSize);
-}
-
-/*! ZSTD_compress_generic() :
-*   Compress a chunk of data into one or multiple blocks.
-*   All blocks will be terminated, all input will be consumed.
-*   Function will issue an error if there is not enough `dstCapacity` to hold the compressed content.
-*   Frame is supposed already started (header already produced)
-*   @return : compressed size, or an error code
-*/
-static size_t ZSTD_compress_generic(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, U32 lastFrameChunk)
-{
-	size_t blockSize = cctx->blockSize;
-	size_t remaining = srcSize;
-	const BYTE *ip = (const BYTE *)src;
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *op = ostart;
-	U32 const maxDist = 1 << cctx->params.cParams.windowLog;
-
-	if (cctx->params.fParams.checksumFlag && srcSize)
-		xxh64_update(&cctx->xxhState, src, srcSize);
-
-	while (remaining) {
-		U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
-		size_t cSize;
-
-		if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE)
-			return ERROR(dstSize_tooSmall); /* not enough space to store compressed block */
-		if (remaining < blockSize)
-			blockSize = remaining;
-
-		/* preemptive overflow correction */
-		if (cctx->lowLimit > (3U << 29)) {
-			U32 const cycleMask = (1 << ZSTD_cycleLog(cctx->params.cParams.hashLog, cctx->params.cParams.strategy)) - 1;
-			U32 const curr = (U32)(ip - cctx->base);
-			U32 const newCurr = (curr & cycleMask) + (1 << cctx->params.cParams.windowLog);
-			U32 const correction = curr - newCurr;
-			ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_64 <= 30);
-			ZSTD_reduceIndex(cctx, correction);
-			cctx->base += correction;
-			cctx->dictBase += correction;
-			cctx->lowLimit -= correction;
-			cctx->dictLimit -= correction;
-			if (cctx->nextToUpdate < correction)
-				cctx->nextToUpdate = 0;
-			else
-				cctx->nextToUpdate -= correction;
-		}
-
-		if ((U32)(ip + blockSize - cctx->base) > cctx->loadedDictEnd + maxDist) {
-			/* enforce maxDist */
-			U32 const newLowLimit = (U32)(ip + blockSize - cctx->base) - maxDist;
-			if (cctx->lowLimit < newLowLimit)
-				cctx->lowLimit = newLowLimit;
-			if (cctx->dictLimit < cctx->lowLimit)
-				cctx->dictLimit = cctx->lowLimit;
-		}
-
-		cSize = ZSTD_compressBlock_internal(cctx, op + ZSTD_blockHeaderSize, dstCapacity - ZSTD_blockHeaderSize, ip, blockSize);
-		if (ZSTD_isError(cSize))
-			return cSize;
-
-		if (cSize == 0) { /* block is not compressible */
-			U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw) << 1) + (U32)(blockSize << 3);
-			if (blockSize + ZSTD_blockHeaderSize > dstCapacity)
-				return ERROR(dstSize_tooSmall);
-			ZSTD_writeLE32(op, cBlockHeader24); /* no pb, 4th byte will be overwritten */
-			memcpy(op + ZSTD_blockHeaderSize, ip, blockSize);
-			cSize = ZSTD_blockHeaderSize + blockSize;
-		} else {
-			U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed) << 1) + (U32)(cSize << 3);
-			ZSTD_writeLE24(op, cBlockHeader24);
-			cSize += ZSTD_blockHeaderSize;
-		}
-
-		remaining -= blockSize;
-		dstCapacity -= cSize;
-		ip += blockSize;
-		op += cSize;
-	}
-
-	if (lastFrameChunk && (op > ostart))
-		cctx->stage = ZSTDcs_ending;
-	return op - ostart;
-}
-
-static size_t ZSTD_writeFrameHeader(void *dst, size_t dstCapacity, ZSTD_parameters params, U64 pledgedSrcSize, U32 dictID)
-{
-	BYTE *const op = (BYTE *)dst;
-	U32 const dictIDSizeCode = (dictID > 0) + (dictID >= 256) + (dictID >= 65536); /* 0-3 */
-	U32 const checksumFlag = params.fParams.checksumFlag > 0;
-	U32 const windowSize = 1U << params.cParams.windowLog;
-	U32 const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
-	BYTE const windowLogByte = (BYTE)((params.cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
-	U32 const fcsCode =
-	    params.fParams.contentSizeFlag ? (pledgedSrcSize >= 256) + (pledgedSrcSize >= 65536 + 256) + (pledgedSrcSize >= 0xFFFFFFFFU) : 0; /* 0-3 */
-	BYTE const frameHeaderDecriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag << 2) + (singleSegment << 5) + (fcsCode << 6));
-	size_t pos;
-
-	if (dstCapacity < ZSTD_frameHeaderSize_max)
-		return ERROR(dstSize_tooSmall);
-
-	ZSTD_writeLE32(dst, ZSTD_MAGICNUMBER);
-	op[4] = frameHeaderDecriptionByte;
-	pos = 5;
-	if (!singleSegment)
-		op[pos++] = windowLogByte;
-	switch (dictIDSizeCode) {
-	default: /* impossible */
-	case 0: break;
-	case 1:
-		op[pos] = (BYTE)(dictID);
-		pos++;
-		break;
-	case 2:
-		ZSTD_writeLE16(op + pos, (U16)dictID);
-		pos += 2;
-		break;
-	case 3:
-		ZSTD_writeLE32(op + pos, dictID);
-		pos += 4;
-		break;
-	}
-	switch (fcsCode) {
-	default: /* impossible */
-	case 0:
-		if (singleSegment)
-			op[pos++] = (BYTE)(pledgedSrcSize);
-		break;
-	case 1:
-		ZSTD_writeLE16(op + pos, (U16)(pledgedSrcSize - 256));
-		pos += 2;
-		break;
-	case 2:
-		ZSTD_writeLE32(op + pos, (U32)(pledgedSrcSize));
-		pos += 4;
-		break;
-	case 3:
-		ZSTD_writeLE64(op + pos, (U64)(pledgedSrcSize));
-		pos += 8;
-		break;
-	}
-	return pos;
-}
-
-static size_t ZSTD_compressContinue_internal(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, U32 frame, U32 lastFrameChunk)
-{
-	const BYTE *const ip = (const BYTE *)src;
-	size_t fhSize = 0;
-
-	if (cctx->stage == ZSTDcs_created)
-		return ERROR(stage_wrong); /* missing init (ZSTD_compressBegin) */
-
-	if (frame && (cctx->stage == ZSTDcs_init)) {
-		fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, cctx->frameContentSize, cctx->dictID);
-		if (ZSTD_isError(fhSize))
-			return fhSize;
-		dstCapacity -= fhSize;
-		dst = (char *)dst + fhSize;
-		cctx->stage = ZSTDcs_ongoing;
-	}
-
-	/* Check if blocks follow each other */
-	if (src != cctx->nextSrc) {
-		/* not contiguous */
-		ptrdiff_t const delta = cctx->nextSrc - ip;
-		cctx->lowLimit = cctx->dictLimit;
-		cctx->dictLimit = (U32)(cctx->nextSrc - cctx->base);
-		cctx->dictBase = cctx->base;
-		cctx->base -= delta;
-		cctx->nextToUpdate = cctx->dictLimit;
-		if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE)
-			cctx->lowLimit = cctx->dictLimit; /* too small extDict */
-	}
-
-	/* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
-	if ((ip + srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
-		ptrdiff_t const highInputIdx = (ip + srcSize) - cctx->dictBase;
-		U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
-		cctx->lowLimit = lowLimitMax;
-	}
-
-	cctx->nextSrc = ip + srcSize;
-
-	if (srcSize) {
-		size_t const cSize = frame ? ZSTD_compress_generic(cctx, dst, dstCapacity, src, srcSize, lastFrameChunk)
-					   : ZSTD_compressBlock_internal(cctx, dst, dstCapacity, src, srcSize);
-		if (ZSTD_isError(cSize))
-			return cSize;
-		return cSize + fhSize;
-	} else
-		return fhSize;
-}
-
-size_t ZSTD_compressContinue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 0);
-}
-
-size_t ZSTD_getBlockSizeMax(ZSTD_CCtx *cctx) { return MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, 1 << cctx->params.cParams.windowLog); }
-
-size_t ZSTD_compressBlock(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	size_t const blockSizeMax = ZSTD_getBlockSizeMax(cctx);
-	if (srcSize > blockSizeMax)
-		return ERROR(srcSize_wrong);
-	return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0, 0);
-}
-
-/*! ZSTD_loadDictionaryContent() :
- *  @return : 0, or an error code
- */
-static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx *zc, const void *src, size_t srcSize)
-{
-	const BYTE *const ip = (const BYTE *)src;
-	const BYTE *const iend = ip + srcSize;
-
-	/* input becomes curr prefix */
-	zc->lowLimit = zc->dictLimit;
-	zc->dictLimit = (U32)(zc->nextSrc - zc->base);
-	zc->dictBase = zc->base;
-	zc->base += ip - zc->nextSrc;
-	zc->nextToUpdate = zc->dictLimit;
-	zc->loadedDictEnd = zc->forceWindow ? 0 : (U32)(iend - zc->base);
-
-	zc->nextSrc = iend;
-	if (srcSize <= HASH_READ_SIZE)
-		return 0;
-
-	switch (zc->params.cParams.strategy) {
-	case ZSTD_fast: ZSTD_fillHashTable(zc, iend, zc->params.cParams.searchLength); break;
-
-	case ZSTD_dfast: ZSTD_fillDoubleHashTable(zc, iend, zc->params.cParams.searchLength); break;
-
-	case ZSTD_greedy:
-	case ZSTD_lazy:
-	case ZSTD_lazy2:
-		if (srcSize >= HASH_READ_SIZE)
-			ZSTD_insertAndFindFirstIndex(zc, iend - HASH_READ_SIZE, zc->params.cParams.searchLength);
-		break;
-
-	case ZSTD_btlazy2:
-	case ZSTD_btopt:
-	case ZSTD_btopt2:
-		if (srcSize >= HASH_READ_SIZE)
-			ZSTD_updateTree(zc, iend - HASH_READ_SIZE, iend, 1 << zc->params.cParams.searchLog, zc->params.cParams.searchLength);
-		break;
-
-	default:
-		return ERROR(GENERIC); /* strategy doesn't exist; impossible */
-	}
-
-	zc->nextToUpdate = (U32)(iend - zc->base);
-	return 0;
-}
-
-/* Dictionaries that assign zero probability to symbols that show up causes problems
-   when FSE encoding.  Refuse dictionaries that assign zero probability to symbols
-   that we may encounter during compression.
-   NOTE: This behavior is not standard and could be improved in the future. */
-static size_t ZSTD_checkDictNCount(short *normalizedCounter, unsigned dictMaxSymbolValue, unsigned maxSymbolValue)
-{
-	U32 s;
-	if (dictMaxSymbolValue < maxSymbolValue)
-		return ERROR(dictionary_corrupted);
-	for (s = 0; s <= maxSymbolValue; ++s) {
-		if (normalizedCounter[s] == 0)
-			return ERROR(dictionary_corrupted);
-	}
-	return 0;
-}
-
-/* Dictionary format :
- * See :
- * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
- */
-/*! ZSTD_loadZstdDictionary() :
- * @return : 0, or an error code
- *  assumptions : magic number supposed already checked
- *                dictSize supposed > 8
- */
-static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx *cctx, const void *dict, size_t dictSize)
-{
-	const BYTE *dictPtr = (const BYTE *)dict;
-	const BYTE *const dictEnd = dictPtr + dictSize;
-	short offcodeNCount[MaxOff + 1];
-	unsigned offcodeMaxValue = MaxOff;
-
-	dictPtr += 4; /* skip magic number */
-	cctx->dictID = cctx->params.fParams.noDictIDFlag ? 0 : ZSTD_readLE32(dictPtr);
-	dictPtr += 4;
-
-	{
-		size_t const hufHeaderSize = HUF_readCTable_wksp(cctx->hufTable, 255, dictPtr, dictEnd - dictPtr, cctx->tmpCounters, sizeof(cctx->tmpCounters));
-		if (HUF_isError(hufHeaderSize))
-			return ERROR(dictionary_corrupted);
-		dictPtr += hufHeaderSize;
-	}
-
-	{
-		unsigned offcodeLog;
-		size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd - dictPtr);
-		if (FSE_isError(offcodeHeaderSize))
-			return ERROR(dictionary_corrupted);
-		if (offcodeLog > OffFSELog)
-			return ERROR(dictionary_corrupted);
-		/* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
-		CHECK_E(FSE_buildCTable_wksp(cctx->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, cctx->tmpCounters, sizeof(cctx->tmpCounters)),
-			dictionary_corrupted);
-		dictPtr += offcodeHeaderSize;
-	}
-
-	{
-		short matchlengthNCount[MaxML + 1];
-		unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-		size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd - dictPtr);
-		if (FSE_isError(matchlengthHeaderSize))
-			return ERROR(dictionary_corrupted);
-		if (matchlengthLog > MLFSELog)
-			return ERROR(dictionary_corrupted);
-		/* Every match length code must have non-zero probability */
-		CHECK_F(ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
-		CHECK_E(
-		    FSE_buildCTable_wksp(cctx->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, cctx->tmpCounters, sizeof(cctx->tmpCounters)),
-		    dictionary_corrupted);
-		dictPtr += matchlengthHeaderSize;
-	}
-
-	{
-		short litlengthNCount[MaxLL + 1];
-		unsigned litlengthMaxValue = MaxLL, litlengthLog;
-		size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd - dictPtr);
-		if (FSE_isError(litlengthHeaderSize))
-			return ERROR(dictionary_corrupted);
-		if (litlengthLog > LLFSELog)
-			return ERROR(dictionary_corrupted);
-		/* Every literal length code must have non-zero probability */
-		CHECK_F(ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
-		CHECK_E(FSE_buildCTable_wksp(cctx->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, cctx->tmpCounters, sizeof(cctx->tmpCounters)),
-			dictionary_corrupted);
-		dictPtr += litlengthHeaderSize;
-	}
-
-	if (dictPtr + 12 > dictEnd)
-		return ERROR(dictionary_corrupted);
-	cctx->rep[0] = ZSTD_readLE32(dictPtr + 0);
-	cctx->rep[1] = ZSTD_readLE32(dictPtr + 4);
-	cctx->rep[2] = ZSTD_readLE32(dictPtr + 8);
-	dictPtr += 12;
-
-	{
-		size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
-		U32 offcodeMax = MaxOff;
-		if (dictContentSize <= ((U32)-1) - 128 KB) {
-			U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
-			offcodeMax = ZSTD_highbit32(maxOffset);		     /* Calculate minimum offset code required to represent maxOffset */
-		}
-		/* All offset values <= dictContentSize + 128 KB must be representable */
-		CHECK_F(ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
-		/* All repCodes must be <= dictContentSize and != 0*/
-		{
-			U32 u;
-			for (u = 0; u < 3; u++) {
-				if (cctx->rep[u] == 0)
-					return ERROR(dictionary_corrupted);
-				if (cctx->rep[u] > dictContentSize)
-					return ERROR(dictionary_corrupted);
-			}
-		}
-
-		cctx->flagStaticTables = 1;
-		cctx->flagStaticHufTable = HUF_repeat_valid;
-		return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
-	}
-}
-
-/** ZSTD_compress_insertDictionary() :
-*   @return : 0, or an error code */
-static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx *cctx, const void *dict, size_t dictSize)
-{
-	if ((dict == NULL) || (dictSize <= 8))
-		return 0;
-
-	/* dict as pure content */
-	if ((ZSTD_readLE32(dict) != ZSTD_DICT_MAGIC) || (cctx->forceRawDict))
-		return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
-
-	/* dict as zstd dictionary */
-	return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
-}
-
-/*! ZSTD_compressBegin_internal() :
-*   @return : 0, or an error code */
-static size_t ZSTD_compressBegin_internal(ZSTD_CCtx *cctx, const void *dict, size_t dictSize, ZSTD_parameters params, U64 pledgedSrcSize)
-{
-	ZSTD_compResetPolicy_e const crp = dictSize ? ZSTDcrp_fullReset : ZSTDcrp_continue;
-	CHECK_F(ZSTD_resetCCtx_advanced(cctx, params, pledgedSrcSize, crp));
-	return ZSTD_compress_insertDictionary(cctx, dict, dictSize);
-}
-
-/*! ZSTD_compressBegin_advanced() :
-*   @return : 0, or an error code */
-size_t ZSTD_compressBegin_advanced(ZSTD_CCtx *cctx, const void *dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize)
-{
-	/* compression parameters verification and optimization */
-	CHECK_F(ZSTD_checkCParams(params.cParams));
-	return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, pledgedSrcSize);
-}
-
-size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx *cctx, const void *dict, size_t dictSize, int compressionLevel)
-{
-	ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-	return ZSTD_compressBegin_internal(cctx, dict, dictSize, params, 0);
-}
-
-size_t ZSTD_compressBegin(ZSTD_CCtx *cctx, int compressionLevel) { return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel); }
-
-/*! ZSTD_writeEpilogue() :
-*   Ends a frame.
-*   @return : nb of bytes written into dst (or an error code) */
-static size_t ZSTD_writeEpilogue(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity)
-{
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *op = ostart;
-	size_t fhSize = 0;
-
-	if (cctx->stage == ZSTDcs_created)
-		return ERROR(stage_wrong); /* init missing */
-
-	/* special case : empty frame */
-	if (cctx->stage == ZSTDcs_init) {
-		fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->params, 0, 0);
-		if (ZSTD_isError(fhSize))
-			return fhSize;
-		dstCapacity -= fhSize;
-		op += fhSize;
-		cctx->stage = ZSTDcs_ongoing;
-	}
-
-	if (cctx->stage != ZSTDcs_ending) {
-		/* write one last empty block, make it the "last" block */
-		U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw) << 1) + 0;
-		if (dstCapacity < 4)
-			return ERROR(dstSize_tooSmall);
-		ZSTD_writeLE32(op, cBlockHeader24);
-		op += ZSTD_blockHeaderSize;
-		dstCapacity -= ZSTD_blockHeaderSize;
-	}
-
-	if (cctx->params.fParams.checksumFlag) {
-		U32 const checksum = (U32)xxh64_digest(&cctx->xxhState);
-		if (dstCapacity < 4)
-			return ERROR(dstSize_tooSmall);
-		ZSTD_writeLE32(op, checksum);
-		op += 4;
-	}
-
-	cctx->stage = ZSTDcs_created; /* return to "created but no init" status */
-	return op - ostart;
-}
-
-size_t ZSTD_compressEnd(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	size_t endResult;
-	size_t const cSize = ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1, 1);
-	if (ZSTD_isError(cSize))
-		return cSize;
-	endResult = ZSTD_writeEpilogue(cctx, (char *)dst + cSize, dstCapacity - cSize);
-	if (ZSTD_isError(endResult))
-		return endResult;
-	return cSize + endResult;
-}
-
-static size_t ZSTD_compress_internal(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize,
-				     ZSTD_parameters params)
-{
-	CHECK_F(ZSTD_compressBegin_internal(cctx, dict, dictSize, params, srcSize));
-	return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
-}
-
-size_t ZSTD_compress_usingDict(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize,
-			       ZSTD_parameters params)
-{
-	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
-}
-
-size_t ZSTD_compressCCtx(ZSTD_CCtx *ctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, ZSTD_parameters params)
-{
-	return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, NULL, 0, params);
-}
-
-/* =====  Dictionary API  ===== */
-
-struct ZSTD_CDict_s {
-	void *dictBuffer;
-	const void *dictContent;
-	size_t dictContentSize;
-	ZSTD_CCtx *refContext;
-}; /* typedef'd tp ZSTD_CDict within "zstd.h" */
-
-size_t ZSTD_CDictWorkspaceBound(ZSTD_compressionParameters cParams) { return ZSTD_CCtxWorkspaceBound(cParams) + ZSTD_ALIGN(sizeof(ZSTD_CDict)); }
-
-static ZSTD_CDict *ZSTD_createCDict_advanced(const void *dictBuffer, size_t dictSize, unsigned byReference, ZSTD_parameters params, ZSTD_customMem customMem)
-{
-	if (!customMem.customAlloc || !customMem.customFree)
-		return NULL;
-
-	{
-		ZSTD_CDict *const cdict = (ZSTD_CDict *)ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
-		ZSTD_CCtx *const cctx = ZSTD_createCCtx_advanced(customMem);
-
-		if (!cdict || !cctx) {
-			ZSTD_free(cdict, customMem);
-			ZSTD_freeCCtx(cctx);
-			return NULL;
-		}
-
-		if ((byReference) || (!dictBuffer) || (!dictSize)) {
-			cdict->dictBuffer = NULL;
-			cdict->dictContent = dictBuffer;
-		} else {
-			void *const internalBuffer = ZSTD_malloc(dictSize, customMem);
-			if (!internalBuffer) {
-				ZSTD_free(cctx, customMem);
-				ZSTD_free(cdict, customMem);
-				return NULL;
-			}
-			memcpy(internalBuffer, dictBuffer, dictSize);
-			cdict->dictBuffer = internalBuffer;
-			cdict->dictContent = internalBuffer;
-		}
-
-		{
-			size_t const errorCode = ZSTD_compressBegin_advanced(cctx, cdict->dictContent, dictSize, params, 0);
-			if (ZSTD_isError(errorCode)) {
-				ZSTD_free(cdict->dictBuffer, customMem);
-				ZSTD_free(cdict, customMem);
-				ZSTD_freeCCtx(cctx);
-				return NULL;
-			}
-		}
-
-		cdict->refContext = cctx;
-		cdict->dictContentSize = dictSize;
-		return cdict;
-	}
-}
-
-ZSTD_CDict *ZSTD_initCDict(const void *dict, size_t dictSize, ZSTD_parameters params, void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	return ZSTD_createCDict_advanced(dict, dictSize, 1, params, stackMem);
-}
-
-size_t ZSTD_freeCDict(ZSTD_CDict *cdict)
-{
-	if (cdict == NULL)
-		return 0; /* support free on NULL */
-	{
-		ZSTD_customMem const cMem = cdict->refContext->customMem;
-		ZSTD_freeCCtx(cdict->refContext);
-		ZSTD_free(cdict->dictBuffer, cMem);
-		ZSTD_free(cdict, cMem);
-		return 0;
-	}
-}
-
-static ZSTD_parameters ZSTD_getParamsFromCDict(const ZSTD_CDict *cdict) { return ZSTD_getParamsFromCCtx(cdict->refContext); }
-
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx *cctx, const ZSTD_CDict *cdict, unsigned long long pledgedSrcSize)
-{
-	if (cdict->dictContentSize)
-		CHECK_F(ZSTD_copyCCtx(cctx, cdict->refContext, pledgedSrcSize))
-	else {
-		ZSTD_parameters params = cdict->refContext->params;
-		params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-		CHECK_F(ZSTD_compressBegin_advanced(cctx, NULL, 0, params, pledgedSrcSize));
-	}
-	return 0;
-}
-
-/*! ZSTD_compress_usingCDict() :
-*   Compression using a digested Dictionary.
-*   Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-*   Note that compression level is decided during dictionary creation */
-size_t ZSTD_compress_usingCDict(ZSTD_CCtx *cctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const ZSTD_CDict *cdict)
-{
-	CHECK_F(ZSTD_compressBegin_usingCDict(cctx, cdict, srcSize));
-
-	if (cdict->refContext->params.fParams.contentSizeFlag == 1) {
-		cctx->params.fParams.contentSizeFlag = 1;
-		cctx->frameContentSize = srcSize;
-	} else {
-		cctx->params.fParams.contentSizeFlag = 0;
-	}
-
-	return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
-}
-
-/* ******************************************************************
-*  Streaming
-********************************************************************/
-
-typedef enum { zcss_init, zcss_load, zcss_flush, zcss_final } ZSTD_cStreamStage;
-
-struct ZSTD_CStream_s {
-	ZSTD_CCtx *cctx;
-	ZSTD_CDict *cdictLocal;
-	const ZSTD_CDict *cdict;
-	char *inBuff;
-	size_t inBuffSize;
-	size_t inToCompress;
-	size_t inBuffPos;
-	size_t inBuffTarget;
-	size_t blockSize;
-	char *outBuff;
-	size_t outBuffSize;
-	size_t outBuffContentSize;
-	size_t outBuffFlushedSize;
-	ZSTD_cStreamStage stage;
-	U32 checksum;
-	U32 frameEnded;
-	U64 pledgedSrcSize;
-	U64 inputProcessed;
-	ZSTD_parameters params;
-	ZSTD_customMem customMem;
-}; /* typedef'd to ZSTD_CStream within "zstd.h" */
-
-size_t ZSTD_CStreamWorkspaceBound(ZSTD_compressionParameters cParams)
-{
-	size_t const inBuffSize = (size_t)1 << cParams.windowLog;
-	size_t const blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, inBuffSize);
-	size_t const outBuffSize = ZSTD_compressBound(blockSize) + 1;
-
-	return ZSTD_CCtxWorkspaceBound(cParams) + ZSTD_ALIGN(sizeof(ZSTD_CStream)) + ZSTD_ALIGN(inBuffSize) + ZSTD_ALIGN(outBuffSize);
-}
-
-ZSTD_CStream *ZSTD_createCStream_advanced(ZSTD_customMem customMem)
-{
-	ZSTD_CStream *zcs;
-
-	if (!customMem.customAlloc || !customMem.customFree)
-		return NULL;
-
-	zcs = (ZSTD_CStream *)ZSTD_malloc(sizeof(ZSTD_CStream), customMem);
-	if (zcs == NULL)
-		return NULL;
-	memset(zcs, 0, sizeof(ZSTD_CStream));
-	memcpy(&zcs->customMem, &customMem, sizeof(ZSTD_customMem));
-	zcs->cctx = ZSTD_createCCtx_advanced(customMem);
-	if (zcs->cctx == NULL) {
-		ZSTD_freeCStream(zcs);
-		return NULL;
-	}
-	return zcs;
-}
-
-size_t ZSTD_freeCStream(ZSTD_CStream *zcs)
-{
-	if (zcs == NULL)
-		return 0; /* support free on NULL */
-	{
-		ZSTD_customMem const cMem = zcs->customMem;
-		ZSTD_freeCCtx(zcs->cctx);
-		zcs->cctx = NULL;
-		ZSTD_freeCDict(zcs->cdictLocal);
-		zcs->cdictLocal = NULL;
-		ZSTD_free(zcs->inBuff, cMem);
-		zcs->inBuff = NULL;
-		ZSTD_free(zcs->outBuff, cMem);
-		zcs->outBuff = NULL;
-		ZSTD_free(zcs, cMem);
-		return 0;
-	}
-}
-
-/*======   Initialization   ======*/
-
-size_t ZSTD_CStreamInSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
-size_t ZSTD_CStreamOutSize(void) { return ZSTD_compressBound(ZSTD_BLOCKSIZE_ABSOLUTEMAX) + ZSTD_blockHeaderSize + 4 /* 32-bits hash */; }
-
-static size_t ZSTD_resetCStream_internal(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize)
-{
-	if (zcs->inBuffSize == 0)
-		return ERROR(stage_wrong); /* zcs has not been init at least once => can't reset */
-
-	if (zcs->cdict)
-		CHECK_F(ZSTD_compressBegin_usingCDict(zcs->cctx, zcs->cdict, pledgedSrcSize))
-	else
-		CHECK_F(ZSTD_compressBegin_advanced(zcs->cctx, NULL, 0, zcs->params, pledgedSrcSize));
-
-	zcs->inToCompress = 0;
-	zcs->inBuffPos = 0;
-	zcs->inBuffTarget = zcs->blockSize;
-	zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-	zcs->stage = zcss_load;
-	zcs->frameEnded = 0;
-	zcs->pledgedSrcSize = pledgedSrcSize;
-	zcs->inputProcessed = 0;
-	return 0; /* ready to go */
-}
-
-size_t ZSTD_resetCStream(ZSTD_CStream *zcs, unsigned long long pledgedSrcSize)
-{
-
-	zcs->params.fParams.contentSizeFlag = (pledgedSrcSize > 0);
-
-	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
-}
-
-static size_t ZSTD_initCStream_advanced(ZSTD_CStream *zcs, const void *dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize)
-{
-	/* allocate buffers */
-	{
-		size_t const neededInBuffSize = (size_t)1 << params.cParams.windowLog;
-		if (zcs->inBuffSize < neededInBuffSize) {
-			zcs->inBuffSize = neededInBuffSize;
-			ZSTD_free(zcs->inBuff, zcs->customMem);
-			zcs->inBuff = (char *)ZSTD_malloc(neededInBuffSize, zcs->customMem);
-			if (zcs->inBuff == NULL)
-				return ERROR(memory_allocation);
-		}
-		zcs->blockSize = MIN(ZSTD_BLOCKSIZE_ABSOLUTEMAX, neededInBuffSize);
-	}
-	if (zcs->outBuffSize < ZSTD_compressBound(zcs->blockSize) + 1) {
-		zcs->outBuffSize = ZSTD_compressBound(zcs->blockSize) + 1;
-		ZSTD_free(zcs->outBuff, zcs->customMem);
-		zcs->outBuff = (char *)ZSTD_malloc(zcs->outBuffSize, zcs->customMem);
-		if (zcs->outBuff == NULL)
-			return ERROR(memory_allocation);
-	}
-
-	if (dict && dictSize >= 8) {
-		ZSTD_freeCDict(zcs->cdictLocal);
-		zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize, 0, params, zcs->customMem);
-		if (zcs->cdictLocal == NULL)
-			return ERROR(memory_allocation);
-		zcs->cdict = zcs->cdictLocal;
-	} else
-		zcs->cdict = NULL;
-
-	zcs->checksum = params.fParams.checksumFlag > 0;
-	zcs->params = params;
-
-	return ZSTD_resetCStream_internal(zcs, pledgedSrcSize);
-}
-
-ZSTD_CStream *ZSTD_initCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize, void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	ZSTD_CStream *const zcs = ZSTD_createCStream_advanced(stackMem);
-	if (zcs) {
-		size_t const code = ZSTD_initCStream_advanced(zcs, NULL, 0, params, pledgedSrcSize);
-		if (ZSTD_isError(code)) {
-			return NULL;
-		}
-	}
-	return zcs;
-}
-
-ZSTD_CStream *ZSTD_initCStream_usingCDict(const ZSTD_CDict *cdict, unsigned long long pledgedSrcSize, void *workspace, size_t workspaceSize)
-{
-	ZSTD_parameters const params = ZSTD_getParamsFromCDict(cdict);
-	ZSTD_CStream *const zcs = ZSTD_initCStream(params, pledgedSrcSize, workspace, workspaceSize);
-	if (zcs) {
-		zcs->cdict = cdict;
-		if (ZSTD_isError(ZSTD_resetCStream_internal(zcs, pledgedSrcSize))) {
-			return NULL;
-		}
-	}
-	return zcs;
-}
-
-/*======   Compression   ======*/
-
-typedef enum { zsf_gather, zsf_flush, zsf_end } ZSTD_flush_e;
-
-ZSTD_STATIC size_t ZSTD_limitCopy(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	size_t const length = MIN(dstCapacity, srcSize);
-	memcpy(dst, src, length);
-	return length;
-}
-
-static size_t ZSTD_compressStream_generic(ZSTD_CStream *zcs, void *dst, size_t *dstCapacityPtr, const void *src, size_t *srcSizePtr, ZSTD_flush_e const flush)
-{
-	U32 someMoreWork = 1;
-	const char *const istart = (const char *)src;
-	const char *const iend = istart + *srcSizePtr;
-	const char *ip = istart;
-	char *const ostart = (char *)dst;
-	char *const oend = ostart + *dstCapacityPtr;
-	char *op = ostart;
-
-	while (someMoreWork) {
-		switch (zcs->stage) {
-		case zcss_init:
-			return ERROR(init_missing); /* call ZBUFF_compressInit() first ! */
-
-		case zcss_load:
-			/* complete inBuffer */
-			{
-				size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
-				size_t const loaded = ZSTD_limitCopy(zcs->inBuff + zcs->inBuffPos, toLoad, ip, iend - ip);
-				zcs->inBuffPos += loaded;
-				ip += loaded;
-				if ((zcs->inBuffPos == zcs->inToCompress) || (!flush && (toLoad != loaded))) {
-					someMoreWork = 0;
-					break; /* not enough input to get a full block : stop there, wait for more */
-				}
-			}
-			/* compress curr block (note : this stage cannot be stopped in the middle) */
-			{
-				void *cDst;
-				size_t cSize;
-				size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
-				size_t oSize = oend - op;
-				if (oSize >= ZSTD_compressBound(iSize))
-					cDst = op; /* compress directly into output buffer (avoid flush stage) */
-				else
-					cDst = zcs->outBuff, oSize = zcs->outBuffSize;
-				cSize = (flush == zsf_end) ? ZSTD_compressEnd(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize)
-							   : ZSTD_compressContinue(zcs->cctx, cDst, oSize, zcs->inBuff + zcs->inToCompress, iSize);
-				if (ZSTD_isError(cSize))
-					return cSize;
-				if (flush == zsf_end)
-					zcs->frameEnded = 1;
-				/* prepare next block */
-				zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
-				if (zcs->inBuffTarget > zcs->inBuffSize)
-					zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize; /* note : inBuffSize >= blockSize */
-				zcs->inToCompress = zcs->inBuffPos;
-				if (cDst == op) {
-					op += cSize;
-					break;
-				} /* no need to flush */
-				zcs->outBuffContentSize = cSize;
-				zcs->outBuffFlushedSize = 0;
-				zcs->stage = zcss_flush; /* pass-through to flush stage */
-			}
-
-		case zcss_flush: {
-			size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-			size_t const flushed = ZSTD_limitCopy(op, oend - op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-			op += flushed;
-			zcs->outBuffFlushedSize += flushed;
-			if (toFlush != flushed) {
-				someMoreWork = 0;
-				break;
-			} /* dst too small to store flushed data : stop there */
-			zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-			zcs->stage = zcss_load;
-			break;
-		}
-
-		case zcss_final:
-			someMoreWork = 0; /* do nothing */
-			break;
-
-		default:
-			return ERROR(GENERIC); /* impossible */
-		}
-	}
-
-	*srcSizePtr = ip - istart;
-	*dstCapacityPtr = op - ostart;
-	zcs->inputProcessed += *srcSizePtr;
-	if (zcs->frameEnded)
-		return 0;
-	{
-		size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
-		if (hintInSize == 0)
-			hintInSize = zcs->blockSize;
-		return hintInSize;
-	}
-}
-
-size_t ZSTD_compressStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output, ZSTD_inBuffer *input)
-{
-	size_t sizeRead = input->size - input->pos;
-	size_t sizeWritten = output->size - output->pos;
-	size_t const result =
-	    ZSTD_compressStream_generic(zcs, (char *)(output->dst) + output->pos, &sizeWritten, (const char *)(input->src) + input->pos, &sizeRead, zsf_gather);
-	input->pos += sizeRead;
-	output->pos += sizeWritten;
-	return result;
-}
-
-/*======   Finalize   ======*/
-
-/*! ZSTD_flushStream() :
-*   @return : amount of data remaining to flush */
-size_t ZSTD_flushStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output)
-{
-	size_t srcSize = 0;
-	size_t sizeWritten = output->size - output->pos;
-	size_t const result = ZSTD_compressStream_generic(zcs, (char *)(output->dst) + output->pos, &sizeWritten, &srcSize,
-							  &srcSize, /* use a valid src address instead of NULL */
-							  zsf_flush);
-	output->pos += sizeWritten;
-	if (ZSTD_isError(result))
-		return result;
-	return zcs->outBuffContentSize - zcs->outBuffFlushedSize; /* remaining to flush */
-}
-
-size_t ZSTD_endStream(ZSTD_CStream *zcs, ZSTD_outBuffer *output)
-{
-	BYTE *const ostart = (BYTE *)(output->dst) + output->pos;
-	BYTE *const oend = (BYTE *)(output->dst) + output->size;
-	BYTE *op = ostart;
-
-	if ((zcs->pledgedSrcSize) && (zcs->inputProcessed != zcs->pledgedSrcSize))
-		return ERROR(srcSize_wrong); /* pledgedSrcSize not respected */
-
-	if (zcs->stage != zcss_final) {
-		/* flush whatever remains */
-		size_t srcSize = 0;
-		size_t sizeWritten = output->size - output->pos;
-		size_t const notEnded =
-		    ZSTD_compressStream_generic(zcs, ostart, &sizeWritten, &srcSize, &srcSize, zsf_end); /* use a valid src address instead of NULL */
-		size_t const remainingToFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-		op += sizeWritten;
-		if (remainingToFlush) {
-			output->pos += sizeWritten;
-			return remainingToFlush + ZSTD_BLOCKHEADERSIZE /* final empty block */ + (zcs->checksum * 4);
-		}
-		/* create epilogue */
-		zcs->stage = zcss_final;
-		zcs->outBuffContentSize = !notEnded ? 0 : ZSTD_compressEnd(zcs->cctx, zcs->outBuff, zcs->outBuffSize, NULL,
-									   0); /* write epilogue, including final empty block, into outBuff */
-	}
-
-	/* flush epilogue */
-	{
-		size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-		size_t const flushed = ZSTD_limitCopy(op, oend - op, zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-		op += flushed;
-		zcs->outBuffFlushedSize += flushed;
-		output->pos += op - ostart;
-		if (toFlush == flushed)
-			zcs->stage = zcss_init; /* end reached */
-		return toFlush - flushed;
-	}
-}
-
-/*-=====  Pre-defined compression levels  =====-*/
-
-#define ZSTD_DEFAULT_CLEVEL 1
-#define ZSTD_MAX_CLEVEL 22
-int ZSTD_maxCLevel(void) { return ZSTD_MAX_CLEVEL; }
-
-static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEVEL + 1] = {
-    {
-	/* "default" */
-	/* W,  C,  H,  S,  L, TL, strat */
-	{18, 12, 12, 1, 7, 16, ZSTD_fast},    /* level  0 - never used */
-	{19, 13, 14, 1, 7, 16, ZSTD_fast},    /* level  1 */
-	{19, 15, 16, 1, 6, 16, ZSTD_fast},    /* level  2 */
-	{20, 16, 17, 1, 5, 16, ZSTD_dfast},   /* level  3.*/
-	{20, 18, 18, 1, 5, 16, ZSTD_dfast},   /* level  4.*/
-	{20, 15, 18, 3, 5, 16, ZSTD_greedy},  /* level  5 */
-	{21, 16, 19, 2, 5, 16, ZSTD_lazy},    /* level  6 */
-	{21, 17, 20, 3, 5, 16, ZSTD_lazy},    /* level  7 */
-	{21, 18, 20, 3, 5, 16, ZSTD_lazy2},   /* level  8 */
-	{21, 20, 20, 3, 5, 16, ZSTD_lazy2},   /* level  9 */
-	{21, 19, 21, 4, 5, 16, ZSTD_lazy2},   /* level 10 */
-	{22, 20, 22, 4, 5, 16, ZSTD_lazy2},   /* level 11 */
-	{22, 20, 22, 5, 5, 16, ZSTD_lazy2},   /* level 12 */
-	{22, 21, 22, 5, 5, 16, ZSTD_lazy2},   /* level 13 */
-	{22, 21, 22, 6, 5, 16, ZSTD_lazy2},   /* level 14 */
-	{22, 21, 21, 5, 5, 16, ZSTD_btlazy2}, /* level 15 */
-	{23, 22, 22, 5, 5, 16, ZSTD_btlazy2}, /* level 16 */
-	{23, 21, 22, 4, 5, 24, ZSTD_btopt},   /* level 17 */
-	{23, 23, 22, 6, 5, 32, ZSTD_btopt},   /* level 18 */
-	{23, 23, 22, 6, 3, 48, ZSTD_btopt},   /* level 19 */
-	{25, 25, 23, 7, 3, 64, ZSTD_btopt2},  /* level 20 */
-	{26, 26, 23, 7, 3, 256, ZSTD_btopt2}, /* level 21 */
-	{27, 27, 25, 9, 3, 512, ZSTD_btopt2}, /* level 22 */
-    },
-    {
-	/* for srcSize <= 256 KB */
-	/* W,  C,  H,  S,  L,  T, strat */
-	{0, 0, 0, 0, 0, 0, ZSTD_fast},	 /* level  0 - not used */
-	{18, 13, 14, 1, 6, 8, ZSTD_fast},      /* level  1 */
-	{18, 14, 13, 1, 5, 8, ZSTD_dfast},     /* level  2 */
-	{18, 16, 15, 1, 5, 8, ZSTD_dfast},     /* level  3 */
-	{18, 15, 17, 1, 5, 8, ZSTD_greedy},    /* level  4.*/
-	{18, 16, 17, 4, 5, 8, ZSTD_greedy},    /* level  5.*/
-	{18, 16, 17, 3, 5, 8, ZSTD_lazy},      /* level  6.*/
-	{18, 17, 17, 4, 4, 8, ZSTD_lazy},      /* level  7 */
-	{18, 17, 17, 4, 4, 8, ZSTD_lazy2},     /* level  8 */
-	{18, 17, 17, 5, 4, 8, ZSTD_lazy2},     /* level  9 */
-	{18, 17, 17, 6, 4, 8, ZSTD_lazy2},     /* level 10 */
-	{18, 18, 17, 6, 4, 8, ZSTD_lazy2},     /* level 11.*/
-	{18, 18, 17, 7, 4, 8, ZSTD_lazy2},     /* level 12.*/
-	{18, 19, 17, 6, 4, 8, ZSTD_btlazy2},   /* level 13 */
-	{18, 18, 18, 4, 4, 16, ZSTD_btopt},    /* level 14.*/
-	{18, 18, 18, 4, 3, 16, ZSTD_btopt},    /* level 15.*/
-	{18, 19, 18, 6, 3, 32, ZSTD_btopt},    /* level 16.*/
-	{18, 19, 18, 8, 3, 64, ZSTD_btopt},    /* level 17.*/
-	{18, 19, 18, 9, 3, 128, ZSTD_btopt},   /* level 18.*/
-	{18, 19, 18, 10, 3, 256, ZSTD_btopt},  /* level 19.*/
-	{18, 19, 18, 11, 3, 512, ZSTD_btopt2}, /* level 20.*/
-	{18, 19, 18, 12, 3, 512, ZSTD_btopt2}, /* level 21.*/
-	{18, 19, 18, 13, 3, 512, ZSTD_btopt2}, /* level 22.*/
-    },
-    {
-	/* for srcSize <= 128 KB */
-	/* W,  C,  H,  S,  L,  T, strat */
-	{17, 12, 12, 1, 7, 8, ZSTD_fast},      /* level  0 - not used */
-	{17, 12, 13, 1, 6, 8, ZSTD_fast},      /* level  1 */
-	{17, 13, 16, 1, 5, 8, ZSTD_fast},      /* level  2 */
-	{17, 16, 16, 2, 5, 8, ZSTD_dfast},     /* level  3 */
-	{17, 13, 15, 3, 4, 8, ZSTD_greedy},    /* level  4 */
-	{17, 15, 17, 4, 4, 8, ZSTD_greedy},    /* level  5 */
-	{17, 16, 17, 3, 4, 8, ZSTD_lazy},      /* level  6 */
-	{17, 15, 17, 4, 4, 8, ZSTD_lazy2},     /* level  7 */
-	{17, 17, 17, 4, 4, 8, ZSTD_lazy2},     /* level  8 */
-	{17, 17, 17, 5, 4, 8, ZSTD_lazy2},     /* level  9 */
-	{17, 17, 17, 6, 4, 8, ZSTD_lazy2},     /* level 10 */
-	{17, 17, 17, 7, 4, 8, ZSTD_lazy2},     /* level 11 */
-	{17, 17, 17, 8, 4, 8, ZSTD_lazy2},     /* level 12 */
-	{17, 18, 17, 6, 4, 8, ZSTD_btlazy2},   /* level 13.*/
-	{17, 17, 17, 7, 3, 8, ZSTD_btopt},     /* level 14.*/
-	{17, 17, 17, 7, 3, 16, ZSTD_btopt},    /* level 15.*/
-	{17, 18, 17, 7, 3, 32, ZSTD_btopt},    /* level 16.*/
-	{17, 18, 17, 7, 3, 64, ZSTD_btopt},    /* level 17.*/
-	{17, 18, 17, 7, 3, 256, ZSTD_btopt},   /* level 18.*/
-	{17, 18, 17, 8, 3, 256, ZSTD_btopt},   /* level 19.*/
-	{17, 18, 17, 9, 3, 256, ZSTD_btopt2},  /* level 20.*/
-	{17, 18, 17, 10, 3, 256, ZSTD_btopt2}, /* level 21.*/
-	{17, 18, 17, 11, 3, 512, ZSTD_btopt2}, /* level 22.*/
-    },
-    {
-	/* for srcSize <= 16 KB */
-	/* W,  C,  H,  S,  L,  T, strat */
-	{14, 12, 12, 1, 7, 6, ZSTD_fast},      /* level  0 - not used */
-	{14, 14, 14, 1, 6, 6, ZSTD_fast},      /* level  1 */
-	{14, 14, 14, 1, 4, 6, ZSTD_fast},      /* level  2 */
-	{14, 14, 14, 1, 4, 6, ZSTD_dfast},     /* level  3.*/
-	{14, 14, 14, 4, 4, 6, ZSTD_greedy},    /* level  4.*/
-	{14, 14, 14, 3, 4, 6, ZSTD_lazy},      /* level  5.*/
-	{14, 14, 14, 4, 4, 6, ZSTD_lazy2},     /* level  6 */
-	{14, 14, 14, 5, 4, 6, ZSTD_lazy2},     /* level  7 */
-	{14, 14, 14, 6, 4, 6, ZSTD_lazy2},     /* level  8.*/
-	{14, 15, 14, 6, 4, 6, ZSTD_btlazy2},   /* level  9.*/
-	{14, 15, 14, 3, 3, 6, ZSTD_btopt},     /* level 10.*/
-	{14, 15, 14, 6, 3, 8, ZSTD_btopt},     /* level 11.*/
-	{14, 15, 14, 6, 3, 16, ZSTD_btopt},    /* level 12.*/
-	{14, 15, 14, 6, 3, 24, ZSTD_btopt},    /* level 13.*/
-	{14, 15, 15, 6, 3, 48, ZSTD_btopt},    /* level 14.*/
-	{14, 15, 15, 6, 3, 64, ZSTD_btopt},    /* level 15.*/
-	{14, 15, 15, 6, 3, 96, ZSTD_btopt},    /* level 16.*/
-	{14, 15, 15, 6, 3, 128, ZSTD_btopt},   /* level 17.*/
-	{14, 15, 15, 6, 3, 256, ZSTD_btopt},   /* level 18.*/
-	{14, 15, 15, 7, 3, 256, ZSTD_btopt},   /* level 19.*/
-	{14, 15, 15, 8, 3, 256, ZSTD_btopt2},  /* level 20.*/
-	{14, 15, 15, 9, 3, 256, ZSTD_btopt2},  /* level 21.*/
-	{14, 15, 15, 10, 3, 256, ZSTD_btopt2}, /* level 22.*/
-    },
-};
-
-/*! ZSTD_getCParams() :
-*   @return ZSTD_compressionParameters structure for a selected compression level, `srcSize` and `dictSize`.
-*   Size values are optional, provide 0 if not known or unused */
-ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long srcSize, size_t dictSize)
-{
-	ZSTD_compressionParameters cp;
-	size_t const addedSize = srcSize ? 0 : 500;
-	U64 const rSize = srcSize + dictSize ? srcSize + dictSize + addedSize : (U64)-1;
-	U32 const tableID = (rSize <= 256 KB) + (rSize <= 128 KB) + (rSize <= 16 KB); /* intentional underflow for srcSizeHint == 0 */
-	if (compressionLevel <= 0)
-		compressionLevel = ZSTD_DEFAULT_CLEVEL; /* 0 == default; no negative compressionLevel yet */
-	if (compressionLevel > ZSTD_MAX_CLEVEL)
-		compressionLevel = ZSTD_MAX_CLEVEL;
-	cp = ZSTD_defaultCParameters[tableID][compressionLevel];
-	if (ZSTD_32bits()) { /* auto-correction, for 32-bits mode */
-		if (cp.windowLog > ZSTD_WINDOWLOG_MAX)
-			cp.windowLog = ZSTD_WINDOWLOG_MAX;
-		if (cp.chainLog > ZSTD_CHAINLOG_MAX)
-			cp.chainLog = ZSTD_CHAINLOG_MAX;
-		if (cp.hashLog > ZSTD_HASHLOG_MAX)
-			cp.hashLog = ZSTD_HASHLOG_MAX;
-	}
-	cp = ZSTD_adjustCParams(cp, srcSize, dictSize);
-	return cp;
-}
-
-/*! ZSTD_getParams() :
-*   same as ZSTD_getCParams(), but @return a `ZSTD_parameters` object (instead of `ZSTD_compressionParameters`).
-*   All fields of `ZSTD_frameParameters` are set to default (0) */
-ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSize, size_t dictSize)
-{
-	ZSTD_parameters params;
-	ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, srcSize, dictSize);
-	memset(¶ms, 0, sizeof(params));
-	params.cParams = cParams;
-	return params;
-}
-
-EXPORT_SYMBOL(ZSTD_maxCLevel);
-EXPORT_SYMBOL(ZSTD_compressBound);
-
-EXPORT_SYMBOL(ZSTD_CCtxWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_initCCtx);
-EXPORT_SYMBOL(ZSTD_compressCCtx);
-EXPORT_SYMBOL(ZSTD_compress_usingDict);
-
-EXPORT_SYMBOL(ZSTD_CDictWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_initCDict);
-EXPORT_SYMBOL(ZSTD_compress_usingCDict);
-
-EXPORT_SYMBOL(ZSTD_CStreamWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_initCStream);
-EXPORT_SYMBOL(ZSTD_initCStream_usingCDict);
-EXPORT_SYMBOL(ZSTD_resetCStream);
-EXPORT_SYMBOL(ZSTD_compressStream);
-EXPORT_SYMBOL(ZSTD_flushStream);
-EXPORT_SYMBOL(ZSTD_endStream);
-EXPORT_SYMBOL(ZSTD_CStreamInSize);
-EXPORT_SYMBOL(ZSTD_CStreamOutSize);
-
-EXPORT_SYMBOL(ZSTD_getCParams);
-EXPORT_SYMBOL(ZSTD_getParams);
-EXPORT_SYMBOL(ZSTD_checkCParams);
-EXPORT_SYMBOL(ZSTD_adjustCParams);
-
-EXPORT_SYMBOL(ZSTD_compressBegin);
-EXPORT_SYMBOL(ZSTD_compressBegin_usingDict);
-EXPORT_SYMBOL(ZSTD_compressBegin_advanced);
-EXPORT_SYMBOL(ZSTD_copyCCtx);
-EXPORT_SYMBOL(ZSTD_compressBegin_usingCDict);
-EXPORT_SYMBOL(ZSTD_compressContinue);
-EXPORT_SYMBOL(ZSTD_compressEnd);
-
-EXPORT_SYMBOL(ZSTD_getBlockSizeMax);
-EXPORT_SYMBOL(ZSTD_compressBlock);
-
-MODULE_LICENSE("Dual BSD/GPL");
-MODULE_DESCRIPTION("Zstd Compressor");
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/decompress.c b/priv/zstd/contrib/linux-kernel/lib/zstd/decompress.c
deleted file mode 100644
index 72df482..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/decompress.c
+++ /dev/null
@@ -1,2526 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-/* ***************************************************************
-*  Tuning parameters
-*****************************************************************/
-/*!
-*  MAXWINDOWSIZE_DEFAULT :
-*  maximum window size accepted by DStream, by default.
-*  Frames requiring more memory will be rejected.
-*/
-#ifndef ZSTD_MAXWINDOWSIZE_DEFAULT
-#define ZSTD_MAXWINDOWSIZE_DEFAULT ((1 << ZSTD_WINDOWLOG_MAX) + 1) /* defined within zstd.h */
-#endif
-
-/*-*******************************************************
-*  Dependencies
-*********************************************************/
-#include "fse.h"
-#include "huf.h"
-#include "mem.h" /* low level memory routines */
-#include "zstd_internal.h"
-#include 
-#include 
-#include  /* memcpy, memmove, memset */
-
-#define ZSTD_PREFETCH(ptr) __builtin_prefetch(ptr, 0, 0)
-
-/*-*************************************
-*  Macros
-***************************************/
-#define ZSTD_isError ERR_isError /* for inlining */
-#define FSE_isError ERR_isError
-#define HUF_isError ERR_isError
-
-/*_*******************************************************
-*  Memory operations
-**********************************************************/
-static void ZSTD_copy4(void *dst, const void *src) { memcpy(dst, src, 4); }
-
-/*-*************************************************************
-*   Context management
-***************************************************************/
-typedef enum {
-	ZSTDds_getFrameHeaderSize,
-	ZSTDds_decodeFrameHeader,
-	ZSTDds_decodeBlockHeader,
-	ZSTDds_decompressBlock,
-	ZSTDds_decompressLastBlock,
-	ZSTDds_checkChecksum,
-	ZSTDds_decodeSkippableHeader,
-	ZSTDds_skipFrame
-} ZSTD_dStage;
-
-typedef struct {
-	FSE_DTable LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
-	FSE_DTable OFTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
-	FSE_DTable MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
-	HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)]; /* can accommodate HUF_decompress4X */
-	U64 workspace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32 / 2];
-	U32 rep[ZSTD_REP_NUM];
-} ZSTD_entropyTables_t;
-
-struct ZSTD_DCtx_s {
-	const FSE_DTable *LLTptr;
-	const FSE_DTable *MLTptr;
-	const FSE_DTable *OFTptr;
-	const HUF_DTable *HUFptr;
-	ZSTD_entropyTables_t entropy;
-	const void *previousDstEnd; /* detect continuity */
-	const void *base;	   /* start of curr segment */
-	const void *vBase;	  /* virtual start of previous segment if it was just before curr one */
-	const void *dictEnd;	/* end of previous segment */
-	size_t expected;
-	ZSTD_frameParams fParams;
-	blockType_e bType; /* used in ZSTD_decompressContinue(), to transfer blockType between header decoding and block decoding stages */
-	ZSTD_dStage stage;
-	U32 litEntropy;
-	U32 fseEntropy;
-	struct xxh64_state xxhState;
-	size_t headerSize;
-	U32 dictID;
-	const BYTE *litPtr;
-	ZSTD_customMem customMem;
-	size_t litSize;
-	size_t rleSize;
-	BYTE litBuffer[ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH];
-	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
-}; /* typedef'd to ZSTD_DCtx within "zstd.h" */
-
-size_t ZSTD_DCtxWorkspaceBound(void) { return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_DCtx)); }
-
-size_t ZSTD_decompressBegin(ZSTD_DCtx *dctx)
-{
-	dctx->expected = ZSTD_frameHeaderSize_prefix;
-	dctx->stage = ZSTDds_getFrameHeaderSize;
-	dctx->previousDstEnd = NULL;
-	dctx->base = NULL;
-	dctx->vBase = NULL;
-	dctx->dictEnd = NULL;
-	dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001); /* cover both little and big endian */
-	dctx->litEntropy = dctx->fseEntropy = 0;
-	dctx->dictID = 0;
-	ZSTD_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
-	memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue)); /* initial repcodes */
-	dctx->LLTptr = dctx->entropy.LLTable;
-	dctx->MLTptr = dctx->entropy.MLTable;
-	dctx->OFTptr = dctx->entropy.OFTable;
-	dctx->HUFptr = dctx->entropy.hufTable;
-	return 0;
-}
-
-ZSTD_DCtx *ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
-{
-	ZSTD_DCtx *dctx;
-
-	if (!customMem.customAlloc || !customMem.customFree)
-		return NULL;
-
-	dctx = (ZSTD_DCtx *)ZSTD_malloc(sizeof(ZSTD_DCtx), customMem);
-	if (!dctx)
-		return NULL;
-	memcpy(&dctx->customMem, &customMem, sizeof(customMem));
-	ZSTD_decompressBegin(dctx);
-	return dctx;
-}
-
-ZSTD_DCtx *ZSTD_initDCtx(void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	return ZSTD_createDCtx_advanced(stackMem);
-}
-
-size_t ZSTD_freeDCtx(ZSTD_DCtx *dctx)
-{
-	if (dctx == NULL)
-		return 0; /* support free on NULL */
-	ZSTD_free(dctx, dctx->customMem);
-	return 0; /* reserved as a potential error code in the future */
-}
-
-void ZSTD_copyDCtx(ZSTD_DCtx *dstDCtx, const ZSTD_DCtx *srcDCtx)
-{
-	size_t const workSpaceSize = (ZSTD_BLOCKSIZE_ABSOLUTEMAX + WILDCOPY_OVERLENGTH) + ZSTD_frameHeaderSize_max;
-	memcpy(dstDCtx, srcDCtx, sizeof(ZSTD_DCtx) - workSpaceSize); /* no need to copy workspace */
-}
-
-static void ZSTD_refDDict(ZSTD_DCtx *dstDCtx, const ZSTD_DDict *ddict);
-
-/*-*************************************************************
-*   Decompression section
-***************************************************************/
-
-/*! ZSTD_isFrame() :
- *  Tells if the content of `buffer` starts with a valid Frame Identifier.
- *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
- *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
- *  Note 3 : Skippable Frame Identifiers are considered valid. */
-unsigned ZSTD_isFrame(const void *buffer, size_t size)
-{
-	if (size < 4)
-		return 0;
-	{
-		U32 const magic = ZSTD_readLE32(buffer);
-		if (magic == ZSTD_MAGICNUMBER)
-			return 1;
-		if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START)
-			return 1;
-	}
-	return 0;
-}
-
-/** ZSTD_frameHeaderSize() :
-*   srcSize must be >= ZSTD_frameHeaderSize_prefix.
-*   @return : size of the Frame Header */
-static size_t ZSTD_frameHeaderSize(const void *src, size_t srcSize)
-{
-	if (srcSize < ZSTD_frameHeaderSize_prefix)
-		return ERROR(srcSize_wrong);
-	{
-		BYTE const fhd = ((const BYTE *)src)[4];
-		U32 const dictID = fhd & 3;
-		U32 const singleSegment = (fhd >> 5) & 1;
-		U32 const fcsId = fhd >> 6;
-		return ZSTD_frameHeaderSize_prefix + !singleSegment + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId] + (singleSegment && !fcsId);
-	}
-}
-
-/** ZSTD_getFrameParams() :
-*   decode Frame Header, or require larger `srcSize`.
-*   @return : 0, `fparamsPtr` is correctly filled,
-*            >0, `srcSize` is too small, result is expected `srcSize`,
-*             or an error code, which can be tested using ZSTD_isError() */
-size_t ZSTD_getFrameParams(ZSTD_frameParams *fparamsPtr, const void *src, size_t srcSize)
-{
-	const BYTE *ip = (const BYTE *)src;
-
-	if (srcSize < ZSTD_frameHeaderSize_prefix)
-		return ZSTD_frameHeaderSize_prefix;
-	if (ZSTD_readLE32(src) != ZSTD_MAGICNUMBER) {
-		if ((ZSTD_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-			if (srcSize < ZSTD_skippableHeaderSize)
-				return ZSTD_skippableHeaderSize; /* magic number + skippable frame length */
-			memset(fparamsPtr, 0, sizeof(*fparamsPtr));
-			fparamsPtr->frameContentSize = ZSTD_readLE32((const char *)src + 4);
-			fparamsPtr->windowSize = 0; /* windowSize==0 means a frame is skippable */
-			return 0;
-		}
-		return ERROR(prefix_unknown);
-	}
-
-	/* ensure there is enough `srcSize` to fully read/decode frame header */
-	{
-		size_t const fhsize = ZSTD_frameHeaderSize(src, srcSize);
-		if (srcSize < fhsize)
-			return fhsize;
-	}
-
-	{
-		BYTE const fhdByte = ip[4];
-		size_t pos = 5;
-		U32 const dictIDSizeCode = fhdByte & 3;
-		U32 const checksumFlag = (fhdByte >> 2) & 1;
-		U32 const singleSegment = (fhdByte >> 5) & 1;
-		U32 const fcsID = fhdByte >> 6;
-		U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;
-		U32 windowSize = 0;
-		U32 dictID = 0;
-		U64 frameContentSize = 0;
-		if ((fhdByte & 0x08) != 0)
-			return ERROR(frameParameter_unsupported); /* reserved bits, which must be zero */
-		if (!singleSegment) {
-			BYTE const wlByte = ip[pos++];
-			U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
-			if (windowLog > ZSTD_WINDOWLOG_MAX)
-				return ERROR(frameParameter_windowTooLarge); /* avoids issue with 1 << windowLog */
-			windowSize = (1U << windowLog);
-			windowSize += (windowSize >> 3) * (wlByte & 7);
-		}
-
-		switch (dictIDSizeCode) {
-		default: /* impossible */
-		case 0: break;
-		case 1:
-			dictID = ip[pos];
-			pos++;
-			break;
-		case 2:
-			dictID = ZSTD_readLE16(ip + pos);
-			pos += 2;
-			break;
-		case 3:
-			dictID = ZSTD_readLE32(ip + pos);
-			pos += 4;
-			break;
-		}
-		switch (fcsID) {
-		default: /* impossible */
-		case 0:
-			if (singleSegment)
-				frameContentSize = ip[pos];
-			break;
-		case 1: frameContentSize = ZSTD_readLE16(ip + pos) + 256; break;
-		case 2: frameContentSize = ZSTD_readLE32(ip + pos); break;
-		case 3: frameContentSize = ZSTD_readLE64(ip + pos); break;
-		}
-		if (!windowSize)
-			windowSize = (U32)frameContentSize;
-		if (windowSize > windowSizeMax)
-			return ERROR(frameParameter_windowTooLarge);
-		fparamsPtr->frameContentSize = frameContentSize;
-		fparamsPtr->windowSize = windowSize;
-		fparamsPtr->dictID = dictID;
-		fparamsPtr->checksumFlag = checksumFlag;
-	}
-	return 0;
-}
-
-/** ZSTD_getFrameContentSize() :
-*   compatible with legacy mode
-*   @return : decompressed size of the single frame pointed to be `src` if known, otherwise
-*             - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
-*             - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
-unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
-{
-	{
-		ZSTD_frameParams fParams;
-		if (ZSTD_getFrameParams(&fParams, src, srcSize) != 0)
-			return ZSTD_CONTENTSIZE_ERROR;
-		if (fParams.windowSize == 0) {
-			/* Either skippable or empty frame, size == 0 either way */
-			return 0;
-		} else if (fParams.frameContentSize != 0) {
-			return fParams.frameContentSize;
-		} else {
-			return ZSTD_CONTENTSIZE_UNKNOWN;
-		}
-	}
-}
-
-/** ZSTD_findDecompressedSize() :
- *  compatible with legacy mode
- *  `srcSize` must be the exact length of some number of ZSTD compressed and/or
- *      skippable frames
- *  @return : decompressed size of the frames contained */
-unsigned long long ZSTD_findDecompressedSize(const void *src, size_t srcSize)
-{
-	{
-		unsigned long long totalDstSize = 0;
-		while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-			const U32 magicNumber = ZSTD_readLE32(src);
-
-			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-				size_t skippableSize;
-				if (srcSize < ZSTD_skippableHeaderSize)
-					return ERROR(srcSize_wrong);
-				skippableSize = ZSTD_readLE32((const BYTE *)src + 4) + ZSTD_skippableHeaderSize;
-				if (srcSize < skippableSize) {
-					return ZSTD_CONTENTSIZE_ERROR;
-				}
-
-				src = (const BYTE *)src + skippableSize;
-				srcSize -= skippableSize;
-				continue;
-			}
-
-			{
-				unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-				if (ret >= ZSTD_CONTENTSIZE_ERROR)
-					return ret;
-
-				/* check for overflow */
-				if (totalDstSize + ret < totalDstSize)
-					return ZSTD_CONTENTSIZE_ERROR;
-				totalDstSize += ret;
-			}
-			{
-				size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
-				if (ZSTD_isError(frameSrcSize)) {
-					return ZSTD_CONTENTSIZE_ERROR;
-				}
-
-				src = (const BYTE *)src + frameSrcSize;
-				srcSize -= frameSrcSize;
-			}
-		}
-
-		if (srcSize) {
-			return ZSTD_CONTENTSIZE_ERROR;
-		}
-
-		return totalDstSize;
-	}
-}
-
-/** ZSTD_decodeFrameHeader() :
-*   `headerSize` must be the size provided by ZSTD_frameHeaderSize().
-*   @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
-static size_t ZSTD_decodeFrameHeader(ZSTD_DCtx *dctx, const void *src, size_t headerSize)
-{
-	size_t const result = ZSTD_getFrameParams(&(dctx->fParams), src, headerSize);
-	if (ZSTD_isError(result))
-		return result; /* invalid header */
-	if (result > 0)
-		return ERROR(srcSize_wrong); /* headerSize too small */
-	if (dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID))
-		return ERROR(dictionary_wrong);
-	if (dctx->fParams.checksumFlag)
-		xxh64_reset(&dctx->xxhState, 0);
-	return 0;
-}
-
-typedef struct {
-	blockType_e blockType;
-	U32 lastBlock;
-	U32 origSize;
-} blockProperties_t;
-
-/*! ZSTD_getcBlockSize() :
-*   Provides the size of compressed block from block header `src` */
-size_t ZSTD_getcBlockSize(const void *src, size_t srcSize, blockProperties_t *bpPtr)
-{
-	if (srcSize < ZSTD_blockHeaderSize)
-		return ERROR(srcSize_wrong);
-	{
-		U32 const cBlockHeader = ZSTD_readLE24(src);
-		U32 const cSize = cBlockHeader >> 3;
-		bpPtr->lastBlock = cBlockHeader & 1;
-		bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
-		bpPtr->origSize = cSize; /* only useful for RLE */
-		if (bpPtr->blockType == bt_rle)
-			return 1;
-		if (bpPtr->blockType == bt_reserved)
-			return ERROR(corruption_detected);
-		return cSize;
-	}
-}
-
-static size_t ZSTD_copyRawBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	if (srcSize > dstCapacity)
-		return ERROR(dstSize_tooSmall);
-	memcpy(dst, src, srcSize);
-	return srcSize;
-}
-
-static size_t ZSTD_setRleBlock(void *dst, size_t dstCapacity, const void *src, size_t srcSize, size_t regenSize)
-{
-	if (srcSize != 1)
-		return ERROR(srcSize_wrong);
-	if (regenSize > dstCapacity)
-		return ERROR(dstSize_tooSmall);
-	memset(dst, *(const BYTE *)src, regenSize);
-	return regenSize;
-}
-
-/*! ZSTD_decodeLiteralsBlock() :
-	@return : nb of bytes read from src (< srcSize ) */
-size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx *dctx, const void *src, size_t srcSize) /* note : srcSize < BLOCKSIZE */
-{
-	if (srcSize < MIN_CBLOCK_SIZE)
-		return ERROR(corruption_detected);
-
-	{
-		const BYTE *const istart = (const BYTE *)src;
-		symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
-
-		switch (litEncType) {
-		case set_repeat:
-			if (dctx->litEntropy == 0)
-				return ERROR(dictionary_corrupted);
-		/* fall-through */
-		case set_compressed:
-			if (srcSize < 5)
-				return ERROR(corruption_detected); /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3 */
-			{
-				size_t lhSize, litSize, litCSize;
-				U32 singleStream = 0;
-				U32 const lhlCode = (istart[0] >> 2) & 3;
-				U32 const lhc = ZSTD_readLE32(istart);
-				switch (lhlCode) {
-				case 0:
-				case 1:
-				default: /* note : default is impossible, since lhlCode into [0..3] */
-					/* 2 - 2 - 10 - 10 */
-					singleStream = !lhlCode;
-					lhSize = 3;
-					litSize = (lhc >> 4) & 0x3FF;
-					litCSize = (lhc >> 14) & 0x3FF;
-					break;
-				case 2:
-					/* 2 - 2 - 14 - 14 */
-					lhSize = 4;
-					litSize = (lhc >> 4) & 0x3FFF;
-					litCSize = lhc >> 18;
-					break;
-				case 3:
-					/* 2 - 2 - 18 - 18 */
-					lhSize = 5;
-					litSize = (lhc >> 4) & 0x3FFFF;
-					litCSize = (lhc >> 22) + (istart[4] << 10);
-					break;
-				}
-				if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX)
-					return ERROR(corruption_detected);
-				if (litCSize + lhSize > srcSize)
-					return ERROR(corruption_detected);
-
-				if (HUF_isError(
-					(litEncType == set_repeat)
-					    ? (singleStream ? HUF_decompress1X_usingDTable(dctx->litBuffer, litSize, istart + lhSize, litCSize, dctx->HUFptr)
-							    : HUF_decompress4X_usingDTable(dctx->litBuffer, litSize, istart + lhSize, litCSize, dctx->HUFptr))
-					    : (singleStream
-						   ? HUF_decompress1X2_DCtx_wksp(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart + lhSize, litCSize,
-										 dctx->entropy.workspace, sizeof(dctx->entropy.workspace))
-						   : HUF_decompress4X_hufOnly_wksp(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart + lhSize, litCSize,
-										   dctx->entropy.workspace, sizeof(dctx->entropy.workspace)))))
-					return ERROR(corruption_detected);
-
-				dctx->litPtr = dctx->litBuffer;
-				dctx->litSize = litSize;
-				dctx->litEntropy = 1;
-				if (litEncType == set_compressed)
-					dctx->HUFptr = dctx->entropy.hufTable;
-				memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-				return litCSize + lhSize;
-			}
-
-		case set_basic: {
-			size_t litSize, lhSize;
-			U32 const lhlCode = ((istart[0]) >> 2) & 3;
-			switch (lhlCode) {
-			case 0:
-			case 2:
-			default: /* note : default is impossible, since lhlCode into [0..3] */
-				lhSize = 1;
-				litSize = istart[0] >> 3;
-				break;
-			case 1:
-				lhSize = 2;
-				litSize = ZSTD_readLE16(istart) >> 4;
-				break;
-			case 3:
-				lhSize = 3;
-				litSize = ZSTD_readLE24(istart) >> 4;
-				break;
-			}
-
-			if (lhSize + litSize + WILDCOPY_OVERLENGTH > srcSize) { /* risk reading beyond src buffer with wildcopy */
-				if (litSize + lhSize > srcSize)
-					return ERROR(corruption_detected);
-				memcpy(dctx->litBuffer, istart + lhSize, litSize);
-				dctx->litPtr = dctx->litBuffer;
-				dctx->litSize = litSize;
-				memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-				return lhSize + litSize;
-			}
-			/* direct reference into compressed stream */
-			dctx->litPtr = istart + lhSize;
-			dctx->litSize = litSize;
-			return lhSize + litSize;
-		}
-
-		case set_rle: {
-			U32 const lhlCode = ((istart[0]) >> 2) & 3;
-			size_t litSize, lhSize;
-			switch (lhlCode) {
-			case 0:
-			case 2:
-			default: /* note : default is impossible, since lhlCode into [0..3] */
-				lhSize = 1;
-				litSize = istart[0] >> 3;
-				break;
-			case 1:
-				lhSize = 2;
-				litSize = ZSTD_readLE16(istart) >> 4;
-				break;
-			case 3:
-				lhSize = 3;
-				litSize = ZSTD_readLE24(istart) >> 4;
-				if (srcSize < 4)
-					return ERROR(corruption_detected); /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4 */
-				break;
-			}
-			if (litSize > ZSTD_BLOCKSIZE_ABSOLUTEMAX)
-				return ERROR(corruption_detected);
-			memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
-			dctx->litPtr = dctx->litBuffer;
-			dctx->litSize = litSize;
-			return lhSize + 1;
-		}
-		default:
-			return ERROR(corruption_detected); /* impossible */
-		}
-	}
-}
-
-typedef union {
-	FSE_decode_t realData;
-	U32 alignedBy4;
-} FSE_decode_t4;
-
-static const FSE_decode_t4 LL_defaultDTable[(1 << LL_DEFAULTNORMLOG) + 1] = {
-    {{LL_DEFAULTNORMLOG, 1, 1}}, /* header : tableLog, fastMode, fastMode */
-    {{0, 0, 4}},		 /* 0 : base, symbol, bits */
-    {{16, 0, 4}},
-    {{32, 1, 5}},
-    {{0, 3, 5}},
-    {{0, 4, 5}},
-    {{0, 6, 5}},
-    {{0, 7, 5}},
-    {{0, 9, 5}},
-    {{0, 10, 5}},
-    {{0, 12, 5}},
-    {{0, 14, 6}},
-    {{0, 16, 5}},
-    {{0, 18, 5}},
-    {{0, 19, 5}},
-    {{0, 21, 5}},
-    {{0, 22, 5}},
-    {{0, 24, 5}},
-    {{32, 25, 5}},
-    {{0, 26, 5}},
-    {{0, 27, 6}},
-    {{0, 29, 6}},
-    {{0, 31, 6}},
-    {{32, 0, 4}},
-    {{0, 1, 4}},
-    {{0, 2, 5}},
-    {{32, 4, 5}},
-    {{0, 5, 5}},
-    {{32, 7, 5}},
-    {{0, 8, 5}},
-    {{32, 10, 5}},
-    {{0, 11, 5}},
-    {{0, 13, 6}},
-    {{32, 16, 5}},
-    {{0, 17, 5}},
-    {{32, 19, 5}},
-    {{0, 20, 5}},
-    {{32, 22, 5}},
-    {{0, 23, 5}},
-    {{0, 25, 4}},
-    {{16, 25, 4}},
-    {{32, 26, 5}},
-    {{0, 28, 6}},
-    {{0, 30, 6}},
-    {{48, 0, 4}},
-    {{16, 1, 4}},
-    {{32, 2, 5}},
-    {{32, 3, 5}},
-    {{32, 5, 5}},
-    {{32, 6, 5}},
-    {{32, 8, 5}},
-    {{32, 9, 5}},
-    {{32, 11, 5}},
-    {{32, 12, 5}},
-    {{0, 15, 6}},
-    {{32, 17, 5}},
-    {{32, 18, 5}},
-    {{32, 20, 5}},
-    {{32, 21, 5}},
-    {{32, 23, 5}},
-    {{32, 24, 5}},
-    {{0, 35, 6}},
-    {{0, 34, 6}},
-    {{0, 33, 6}},
-    {{0, 32, 6}},
-}; /* LL_defaultDTable */
-
-static const FSE_decode_t4 ML_defaultDTable[(1 << ML_DEFAULTNORMLOG) + 1] = {
-    {{ML_DEFAULTNORMLOG, 1, 1}}, /* header : tableLog, fastMode, fastMode */
-    {{0, 0, 6}},		 /* 0 : base, symbol, bits */
-    {{0, 1, 4}},
-    {{32, 2, 5}},
-    {{0, 3, 5}},
-    {{0, 5, 5}},
-    {{0, 6, 5}},
-    {{0, 8, 5}},
-    {{0, 10, 6}},
-    {{0, 13, 6}},
-    {{0, 16, 6}},
-    {{0, 19, 6}},
-    {{0, 22, 6}},
-    {{0, 25, 6}},
-    {{0, 28, 6}},
-    {{0, 31, 6}},
-    {{0, 33, 6}},
-    {{0, 35, 6}},
-    {{0, 37, 6}},
-    {{0, 39, 6}},
-    {{0, 41, 6}},
-    {{0, 43, 6}},
-    {{0, 45, 6}},
-    {{16, 1, 4}},
-    {{0, 2, 4}},
-    {{32, 3, 5}},
-    {{0, 4, 5}},
-    {{32, 6, 5}},
-    {{0, 7, 5}},
-    {{0, 9, 6}},
-    {{0, 12, 6}},
-    {{0, 15, 6}},
-    {{0, 18, 6}},
-    {{0, 21, 6}},
-    {{0, 24, 6}},
-    {{0, 27, 6}},
-    {{0, 30, 6}},
-    {{0, 32, 6}},
-    {{0, 34, 6}},
-    {{0, 36, 6}},
-    {{0, 38, 6}},
-    {{0, 40, 6}},
-    {{0, 42, 6}},
-    {{0, 44, 6}},
-    {{32, 1, 4}},
-    {{48, 1, 4}},
-    {{16, 2, 4}},
-    {{32, 4, 5}},
-    {{32, 5, 5}},
-    {{32, 7, 5}},
-    {{32, 8, 5}},
-    {{0, 11, 6}},
-    {{0, 14, 6}},
-    {{0, 17, 6}},
-    {{0, 20, 6}},
-    {{0, 23, 6}},
-    {{0, 26, 6}},
-    {{0, 29, 6}},
-    {{0, 52, 6}},
-    {{0, 51, 6}},
-    {{0, 50, 6}},
-    {{0, 49, 6}},
-    {{0, 48, 6}},
-    {{0, 47, 6}},
-    {{0, 46, 6}},
-}; /* ML_defaultDTable */
-
-static const FSE_decode_t4 OF_defaultDTable[(1 << OF_DEFAULTNORMLOG) + 1] = {
-    {{OF_DEFAULTNORMLOG, 1, 1}}, /* header : tableLog, fastMode, fastMode */
-    {{0, 0, 5}},		 /* 0 : base, symbol, bits */
-    {{0, 6, 4}},
-    {{0, 9, 5}},
-    {{0, 15, 5}},
-    {{0, 21, 5}},
-    {{0, 3, 5}},
-    {{0, 7, 4}},
-    {{0, 12, 5}},
-    {{0, 18, 5}},
-    {{0, 23, 5}},
-    {{0, 5, 5}},
-    {{0, 8, 4}},
-    {{0, 14, 5}},
-    {{0, 20, 5}},
-    {{0, 2, 5}},
-    {{16, 7, 4}},
-    {{0, 11, 5}},
-    {{0, 17, 5}},
-    {{0, 22, 5}},
-    {{0, 4, 5}},
-    {{16, 8, 4}},
-    {{0, 13, 5}},
-    {{0, 19, 5}},
-    {{0, 1, 5}},
-    {{16, 6, 4}},
-    {{0, 10, 5}},
-    {{0, 16, 5}},
-    {{0, 28, 5}},
-    {{0, 27, 5}},
-    {{0, 26, 5}},
-    {{0, 25, 5}},
-    {{0, 24, 5}},
-}; /* OF_defaultDTable */
-
-/*! ZSTD_buildSeqTable() :
-	@return : nb bytes read from src,
-			  or an error code if it fails, testable with ZSTD_isError()
-*/
-static size_t ZSTD_buildSeqTable(FSE_DTable *DTableSpace, const FSE_DTable **DTablePtr, symbolEncodingType_e type, U32 max, U32 maxLog, const void *src,
-				 size_t srcSize, const FSE_decode_t4 *defaultTable, U32 flagRepeatTable, void *workspace, size_t workspaceSize)
-{
-	const void *const tmpPtr = defaultTable; /* bypass strict aliasing */
-	switch (type) {
-	case set_rle:
-		if (!srcSize)
-			return ERROR(srcSize_wrong);
-		if ((*(const BYTE *)src) > max)
-			return ERROR(corruption_detected);
-		FSE_buildDTable_rle(DTableSpace, *(const BYTE *)src);
-		*DTablePtr = DTableSpace;
-		return 1;
-	case set_basic: *DTablePtr = (const FSE_DTable *)tmpPtr; return 0;
-	case set_repeat:
-		if (!flagRepeatTable)
-			return ERROR(corruption_detected);
-		return 0;
-	default: /* impossible */
-	case set_compressed: {
-		U32 tableLog;
-		S16 *norm = (S16 *)workspace;
-		size_t const spaceUsed32 = ALIGN(sizeof(S16) * (MaxSeq + 1), sizeof(U32)) >> 2;
-
-		if ((spaceUsed32 << 2) > workspaceSize)
-			return ERROR(GENERIC);
-		workspace = (U32 *)workspace + spaceUsed32;
-		workspaceSize -= (spaceUsed32 << 2);
-		{
-			size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
-			if (FSE_isError(headerSize))
-				return ERROR(corruption_detected);
-			if (tableLog > maxLog)
-				return ERROR(corruption_detected);
-			FSE_buildDTable_wksp(DTableSpace, norm, max, tableLog, workspace, workspaceSize);
-			*DTablePtr = DTableSpace;
-			return headerSize;
-		}
-	}
-	}
-}
-
-size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx *dctx, int *nbSeqPtr, const void *src, size_t srcSize)
-{
-	const BYTE *const istart = (const BYTE *const)src;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *ip = istart;
-
-	/* check */
-	if (srcSize < MIN_SEQUENCES_SIZE)
-		return ERROR(srcSize_wrong);
-
-	/* SeqHead */
-	{
-		int nbSeq = *ip++;
-		if (!nbSeq) {
-			*nbSeqPtr = 0;
-			return 1;
-		}
-		if (nbSeq > 0x7F) {
-			if (nbSeq == 0xFF) {
-				if (ip + 2 > iend)
-					return ERROR(srcSize_wrong);
-				nbSeq = ZSTD_readLE16(ip) + LONGNBSEQ, ip += 2;
-			} else {
-				if (ip >= iend)
-					return ERROR(srcSize_wrong);
-				nbSeq = ((nbSeq - 0x80) << 8) + *ip++;
-			}
-		}
-		*nbSeqPtr = nbSeq;
-	}
-
-	/* FSE table descriptors */
-	if (ip + 4 > iend)
-		return ERROR(srcSize_wrong); /* minimum possible size */
-	{
-		symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
-		symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
-		symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
-		ip++;
-
-		/* Build DTables */
-		{
-			size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr, LLtype, MaxLL, LLFSELog, ip, iend - ip,
-								  LL_defaultDTable, dctx->fseEntropy, dctx->entropy.workspace, sizeof(dctx->entropy.workspace));
-			if (ZSTD_isError(llhSize))
-				return ERROR(corruption_detected);
-			ip += llhSize;
-		}
-		{
-			size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr, OFtype, MaxOff, OffFSELog, ip, iend - ip,
-								  OF_defaultDTable, dctx->fseEntropy, dctx->entropy.workspace, sizeof(dctx->entropy.workspace));
-			if (ZSTD_isError(ofhSize))
-				return ERROR(corruption_detected);
-			ip += ofhSize;
-		}
-		{
-			size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr, MLtype, MaxML, MLFSELog, ip, iend - ip,
-								  ML_defaultDTable, dctx->fseEntropy, dctx->entropy.workspace, sizeof(dctx->entropy.workspace));
-			if (ZSTD_isError(mlhSize))
-				return ERROR(corruption_detected);
-			ip += mlhSize;
-		}
-	}
-
-	return ip - istart;
-}
-
-typedef struct {
-	size_t litLength;
-	size_t matchLength;
-	size_t offset;
-	const BYTE *match;
-} seq_t;
-
-typedef struct {
-	BIT_DStream_t DStream;
-	FSE_DState_t stateLL;
-	FSE_DState_t stateOffb;
-	FSE_DState_t stateML;
-	size_t prevOffset[ZSTD_REP_NUM];
-	const BYTE *base;
-	size_t pos;
-	uPtrDiff gotoDict;
-} seqState_t;
-
-FORCE_NOINLINE
-size_t ZSTD_execSequenceLast7(BYTE *op, BYTE *const oend, seq_t sequence, const BYTE **litPtr, const BYTE *const litLimit, const BYTE *const base,
-			      const BYTE *const vBase, const BYTE *const dictEnd)
-{
-	BYTE *const oLitEnd = op + sequence.litLength;
-	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-	BYTE *const oMatchEnd = op + sequenceLength; /* risk : address space overflow (32-bits) */
-	BYTE *const oend_w = oend - WILDCOPY_OVERLENGTH;
-	const BYTE *const iLitEnd = *litPtr + sequence.litLength;
-	const BYTE *match = oLitEnd - sequence.offset;
-
-	/* check */
-	if (oMatchEnd > oend)
-		return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-	if (iLitEnd > litLimit)
-		return ERROR(corruption_detected); /* over-read beyond lit buffer */
-	if (oLitEnd <= oend_w)
-		return ERROR(GENERIC); /* Precondition */
-
-	/* copy literals */
-	if (op < oend_w) {
-		ZSTD_wildcopy(op, *litPtr, oend_w - op);
-		*litPtr += oend_w - op;
-		op = oend_w;
-	}
-	while (op < oLitEnd)
-		*op++ = *(*litPtr)++;
-
-	/* copy Match */
-	if (sequence.offset > (size_t)(oLitEnd - base)) {
-		/* offset beyond prefix */
-		if (sequence.offset > (size_t)(oLitEnd - vBase))
-			return ERROR(corruption_detected);
-		match = dictEnd - (base - match);
-		if (match + sequence.matchLength <= dictEnd) {
-			memmove(oLitEnd, match, sequence.matchLength);
-			return sequenceLength;
-		}
-		/* span extDict & currPrefixSegment */
-		{
-			size_t const length1 = dictEnd - match;
-			memmove(oLitEnd, match, length1);
-			op = oLitEnd + length1;
-			sequence.matchLength -= length1;
-			match = base;
-		}
-	}
-	while (op < oMatchEnd)
-		*op++ = *match++;
-	return sequenceLength;
-}
-
-static seq_t ZSTD_decodeSequence(seqState_t *seqState)
-{
-	seq_t seq;
-
-	U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-	U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-	U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb); /* <= maxOff, by table construction */
-
-	U32 const llBits = LL_bits[llCode];
-	U32 const mlBits = ML_bits[mlCode];
-	U32 const ofBits = ofCode;
-	U32 const totalBits = llBits + mlBits + ofBits;
-
-	static const U32 LL_base[MaxLL + 1] = {0,  1,  2,  3,  4,  5,  6,  7,  8,    9,     10,    11,    12,    13,     14,     15,     16,     18,
-					       20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000, 0x2000, 0x4000, 0x8000, 0x10000};
-
-	static const U32 ML_base[MaxML + 1] = {3,  4,  5,  6,  7,  8,  9,  10,   11,    12,    13,    14,    15,     16,     17,     18,     19,     20,
-					       21, 22, 23, 24, 25, 26, 27, 28,   29,    30,    31,    32,    33,     34,     35,     37,     39,     41,
-					       43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803, 0x1003, 0x2003, 0x4003, 0x8003, 0x10003};
-
-	static const U32 OF_base[MaxOff + 1] = {0,       1,	1,	5,	0xD,      0x1D,      0x3D,      0x7D,      0xFD,     0x1FD,
-						0x3FD,   0x7FD,    0xFFD,    0x1FFD,   0x3FFD,   0x7FFD,    0xFFFD,    0x1FFFD,   0x3FFFD,  0x7FFFD,
-						0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD, 0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD};
-
-	/* sequence */
-	{
-		size_t offset;
-		if (!ofCode)
-			offset = 0;
-		else {
-			offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits); /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-			if (ZSTD_32bits())
-				BIT_reloadDStream(&seqState->DStream);
-		}
-
-		if (ofCode <= 1) {
-			offset += (llCode == 0);
-			if (offset) {
-				size_t temp = (offset == 3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-				temp += !temp; /* 0 is not valid; input is corrupted; force offset to 1 */
-				if (offset != 1)
-					seqState->prevOffset[2] = seqState->prevOffset[1];
-				seqState->prevOffset[1] = seqState->prevOffset[0];
-				seqState->prevOffset[0] = offset = temp;
-			} else {
-				offset = seqState->prevOffset[0];
-			}
-		} else {
-			seqState->prevOffset[2] = seqState->prevOffset[1];
-			seqState->prevOffset[1] = seqState->prevOffset[0];
-			seqState->prevOffset[0] = offset;
-		}
-		seq.offset = offset;
-	}
-
-	seq.matchLength = ML_base[mlCode] + ((mlCode > 31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0); /* <=  16 bits */
-	if (ZSTD_32bits() && (mlBits + llBits > 24))
-		BIT_reloadDStream(&seqState->DStream);
-
-	seq.litLength = LL_base[llCode] + ((llCode > 15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0); /* <=  16 bits */
-	if (ZSTD_32bits() || (totalBits > 64 - 7 - (LLFSELog + MLFSELog + OffFSELog)))
-		BIT_reloadDStream(&seqState->DStream);
-
-	/* ANS state update */
-	FSE_updateState(&seqState->stateLL, &seqState->DStream); /* <=  9 bits */
-	FSE_updateState(&seqState->stateML, &seqState->DStream); /* <=  9 bits */
-	if (ZSTD_32bits())
-		BIT_reloadDStream(&seqState->DStream);		   /* <= 18 bits */
-	FSE_updateState(&seqState->stateOffb, &seqState->DStream); /* <=  8 bits */
-
-	seq.match = NULL;
-
-	return seq;
-}
-
-FORCE_INLINE
-size_t ZSTD_execSequence(BYTE *op, BYTE *const oend, seq_t sequence, const BYTE **litPtr, const BYTE *const litLimit, const BYTE *const base,
-			 const BYTE *const vBase, const BYTE *const dictEnd)
-{
-	BYTE *const oLitEnd = op + sequence.litLength;
-	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-	BYTE *const oMatchEnd = op + sequenceLength; /* risk : address space overflow (32-bits) */
-	BYTE *const oend_w = oend - WILDCOPY_OVERLENGTH;
-	const BYTE *const iLitEnd = *litPtr + sequence.litLength;
-	const BYTE *match = oLitEnd - sequence.offset;
-
-	/* check */
-	if (oMatchEnd > oend)
-		return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-	if (iLitEnd > litLimit)
-		return ERROR(corruption_detected); /* over-read beyond lit buffer */
-	if (oLitEnd > oend_w)
-		return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
-
-	/* copy Literals */
-	ZSTD_copy8(op, *litPtr);
-	if (sequence.litLength > 8)
-		ZSTD_wildcopy(op + 8, (*litPtr) + 8,
-			      sequence.litLength - 8); /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-	op = oLitEnd;
-	*litPtr = iLitEnd; /* update for next sequence */
-
-	/* copy Match */
-	if (sequence.offset > (size_t)(oLitEnd - base)) {
-		/* offset beyond prefix */
-		if (sequence.offset > (size_t)(oLitEnd - vBase))
-			return ERROR(corruption_detected);
-		match = dictEnd + (match - base);
-		if (match + sequence.matchLength <= dictEnd) {
-			memmove(oLitEnd, match, sequence.matchLength);
-			return sequenceLength;
-		}
-		/* span extDict & currPrefixSegment */
-		{
-			size_t const length1 = dictEnd - match;
-			memmove(oLitEnd, match, length1);
-			op = oLitEnd + length1;
-			sequence.matchLength -= length1;
-			match = base;
-			if (op > oend_w || sequence.matchLength < MINMATCH) {
-				U32 i;
-				for (i = 0; i < sequence.matchLength; ++i)
-					op[i] = match[i];
-				return sequenceLength;
-			}
-		}
-	}
-	/* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
-
-	/* match within prefix */
-	if (sequence.offset < 8) {
-		/* close range match, overlap */
-		static const U32 dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4};   /* added */
-		static const int dec64table[] = {8, 8, 8, 7, 8, 9, 10, 11}; /* subtracted */
-		int const sub2 = dec64table[sequence.offset];
-		op[0] = match[0];
-		op[1] = match[1];
-		op[2] = match[2];
-		op[3] = match[3];
-		match += dec32table[sequence.offset];
-		ZSTD_copy4(op + 4, match);
-		match -= sub2;
-	} else {
-		ZSTD_copy8(op, match);
-	}
-	op += 8;
-	match += 8;
-
-	if (oMatchEnd > oend - (16 - MINMATCH)) {
-		if (op < oend_w) {
-			ZSTD_wildcopy(op, match, oend_w - op);
-			match += oend_w - op;
-			op = oend_w;
-		}
-		while (op < oMatchEnd)
-			*op++ = *match++;
-	} else {
-		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength - 8); /* works even if matchLength < 8 */
-	}
-	return sequenceLength;
-}
-
-static size_t ZSTD_decompressSequences(ZSTD_DCtx *dctx, void *dst, size_t maxDstSize, const void *seqStart, size_t seqSize)
-{
-	const BYTE *ip = (const BYTE *)seqStart;
-	const BYTE *const iend = ip + seqSize;
-	BYTE *const ostart = (BYTE * const)dst;
-	BYTE *const oend = ostart + maxDstSize;
-	BYTE *op = ostart;
-	const BYTE *litPtr = dctx->litPtr;
-	const BYTE *const litEnd = litPtr + dctx->litSize;
-	const BYTE *const base = (const BYTE *)(dctx->base);
-	const BYTE *const vBase = (const BYTE *)(dctx->vBase);
-	const BYTE *const dictEnd = (const BYTE *)(dctx->dictEnd);
-	int nbSeq;
-
-	/* Build Decoding Tables */
-	{
-		size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-		if (ZSTD_isError(seqHSize))
-			return seqHSize;
-		ip += seqHSize;
-	}
-
-	/* Regen sequences */
-	if (nbSeq) {
-		seqState_t seqState;
-		dctx->fseEntropy = 1;
-		{
-			U32 i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				seqState.prevOffset[i] = dctx->entropy.rep[i];
-		}
-		CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend - ip), corruption_detected);
-		FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-		FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-		FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
-
-		for (; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && nbSeq;) {
-			nbSeq--;
-			{
-				seq_t const sequence = ZSTD_decodeSequence(&seqState);
-				size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, base, vBase, dictEnd);
-				if (ZSTD_isError(oneSeqSize))
-					return oneSeqSize;
-				op += oneSeqSize;
-			}
-		}
-
-		/* check if reached exact end */
-		if (nbSeq)
-			return ERROR(corruption_detected);
-		/* save reps for next block */
-		{
-			U32 i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]);
-		}
-	}
-
-	/* last literal segment */
-	{
-		size_t const lastLLSize = litEnd - litPtr;
-		if (lastLLSize > (size_t)(oend - op))
-			return ERROR(dstSize_tooSmall);
-		memcpy(op, litPtr, lastLLSize);
-		op += lastLLSize;
-	}
-
-	return op - ostart;
-}
-
-FORCE_INLINE seq_t ZSTD_decodeSequenceLong_generic(seqState_t *seqState, int const longOffsets)
-{
-	seq_t seq;
-
-	U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-	U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-	U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb); /* <= maxOff, by table construction */
-
-	U32 const llBits = LL_bits[llCode];
-	U32 const mlBits = ML_bits[mlCode];
-	U32 const ofBits = ofCode;
-	U32 const totalBits = llBits + mlBits + ofBits;
-
-	static const U32 LL_base[MaxLL + 1] = {0,  1,  2,  3,  4,  5,  6,  7,  8,    9,     10,    11,    12,    13,     14,     15,     16,     18,
-					       20, 22, 24, 28, 32, 40, 48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000, 0x2000, 0x4000, 0x8000, 0x10000};
-
-	static const U32 ML_base[MaxML + 1] = {3,  4,  5,  6,  7,  8,  9,  10,   11,    12,    13,    14,    15,     16,     17,     18,     19,     20,
-					       21, 22, 23, 24, 25, 26, 27, 28,   29,    30,    31,    32,    33,     34,     35,     37,     39,     41,
-					       43, 47, 51, 59, 67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803, 0x1003, 0x2003, 0x4003, 0x8003, 0x10003};
-
-	static const U32 OF_base[MaxOff + 1] = {0,       1,	1,	5,	0xD,      0x1D,      0x3D,      0x7D,      0xFD,     0x1FD,
-						0x3FD,   0x7FD,    0xFFD,    0x1FFD,   0x3FFD,   0x7FFD,    0xFFFD,    0x1FFFD,   0x3FFFD,  0x7FFFD,
-						0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD, 0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD};
-
-	/* sequence */
-	{
-		size_t offset;
-		if (!ofCode)
-			offset = 0;
-		else {
-			if (longOffsets) {
-				int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN);
-				offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
-				if (ZSTD_32bits() || extraBits)
-					BIT_reloadDStream(&seqState->DStream);
-				if (extraBits)
-					offset += BIT_readBitsFast(&seqState->DStream, extraBits);
-			} else {
-				offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits); /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-				if (ZSTD_32bits())
-					BIT_reloadDStream(&seqState->DStream);
-			}
-		}
-
-		if (ofCode <= 1) {
-			offset += (llCode == 0);
-			if (offset) {
-				size_t temp = (offset == 3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-				temp += !temp; /* 0 is not valid; input is corrupted; force offset to 1 */
-				if (offset != 1)
-					seqState->prevOffset[2] = seqState->prevOffset[1];
-				seqState->prevOffset[1] = seqState->prevOffset[0];
-				seqState->prevOffset[0] = offset = temp;
-			} else {
-				offset = seqState->prevOffset[0];
-			}
-		} else {
-			seqState->prevOffset[2] = seqState->prevOffset[1];
-			seqState->prevOffset[1] = seqState->prevOffset[0];
-			seqState->prevOffset[0] = offset;
-		}
-		seq.offset = offset;
-	}
-
-	seq.matchLength = ML_base[mlCode] + ((mlCode > 31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0); /* <=  16 bits */
-	if (ZSTD_32bits() && (mlBits + llBits > 24))
-		BIT_reloadDStream(&seqState->DStream);
-
-	seq.litLength = LL_base[llCode] + ((llCode > 15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0); /* <=  16 bits */
-	if (ZSTD_32bits() || (totalBits > 64 - 7 - (LLFSELog + MLFSELog + OffFSELog)))
-		BIT_reloadDStream(&seqState->DStream);
-
-	{
-		size_t const pos = seqState->pos + seq.litLength;
-		seq.match = seqState->base + pos - seq.offset; /* single memory segment */
-		if (seq.offset > pos)
-			seq.match += seqState->gotoDict; /* separate memory segment */
-		seqState->pos = pos + seq.matchLength;
-	}
-
-	/* ANS state update */
-	FSE_updateState(&seqState->stateLL, &seqState->DStream); /* <=  9 bits */
-	FSE_updateState(&seqState->stateML, &seqState->DStream); /* <=  9 bits */
-	if (ZSTD_32bits())
-		BIT_reloadDStream(&seqState->DStream);		   /* <= 18 bits */
-	FSE_updateState(&seqState->stateOffb, &seqState->DStream); /* <=  8 bits */
-
-	return seq;
-}
-
-static seq_t ZSTD_decodeSequenceLong(seqState_t *seqState, unsigned const windowSize)
-{
-	if (ZSTD_highbit32(windowSize) > STREAM_ACCUMULATOR_MIN) {
-		return ZSTD_decodeSequenceLong_generic(seqState, 1);
-	} else {
-		return ZSTD_decodeSequenceLong_generic(seqState, 0);
-	}
-}
-
-FORCE_INLINE
-size_t ZSTD_execSequenceLong(BYTE *op, BYTE *const oend, seq_t sequence, const BYTE **litPtr, const BYTE *const litLimit, const BYTE *const base,
-			     const BYTE *const vBase, const BYTE *const dictEnd)
-{
-	BYTE *const oLitEnd = op + sequence.litLength;
-	size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-	BYTE *const oMatchEnd = op + sequenceLength; /* risk : address space overflow (32-bits) */
-	BYTE *const oend_w = oend - WILDCOPY_OVERLENGTH;
-	const BYTE *const iLitEnd = *litPtr + sequence.litLength;
-	const BYTE *match = sequence.match;
-
-	/* check */
-	if (oMatchEnd > oend)
-		return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-	if (iLitEnd > litLimit)
-		return ERROR(corruption_detected); /* over-read beyond lit buffer */
-	if (oLitEnd > oend_w)
-		return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
-
-	/* copy Literals */
-	ZSTD_copy8(op, *litPtr);
-	if (sequence.litLength > 8)
-		ZSTD_wildcopy(op + 8, (*litPtr) + 8,
-			      sequence.litLength - 8); /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-	op = oLitEnd;
-	*litPtr = iLitEnd; /* update for next sequence */
-
-	/* copy Match */
-	if (sequence.offset > (size_t)(oLitEnd - base)) {
-		/* offset beyond prefix */
-		if (sequence.offset > (size_t)(oLitEnd - vBase))
-			return ERROR(corruption_detected);
-		if (match + sequence.matchLength <= dictEnd) {
-			memmove(oLitEnd, match, sequence.matchLength);
-			return sequenceLength;
-		}
-		/* span extDict & currPrefixSegment */
-		{
-			size_t const length1 = dictEnd - match;
-			memmove(oLitEnd, match, length1);
-			op = oLitEnd + length1;
-			sequence.matchLength -= length1;
-			match = base;
-			if (op > oend_w || sequence.matchLength < MINMATCH) {
-				U32 i;
-				for (i = 0; i < sequence.matchLength; ++i)
-					op[i] = match[i];
-				return sequenceLength;
-			}
-		}
-	}
-	/* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
-
-	/* match within prefix */
-	if (sequence.offset < 8) {
-		/* close range match, overlap */
-		static const U32 dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4};   /* added */
-		static const int dec64table[] = {8, 8, 8, 7, 8, 9, 10, 11}; /* subtracted */
-		int const sub2 = dec64table[sequence.offset];
-		op[0] = match[0];
-		op[1] = match[1];
-		op[2] = match[2];
-		op[3] = match[3];
-		match += dec32table[sequence.offset];
-		ZSTD_copy4(op + 4, match);
-		match -= sub2;
-	} else {
-		ZSTD_copy8(op, match);
-	}
-	op += 8;
-	match += 8;
-
-	if (oMatchEnd > oend - (16 - MINMATCH)) {
-		if (op < oend_w) {
-			ZSTD_wildcopy(op, match, oend_w - op);
-			match += oend_w - op;
-			op = oend_w;
-		}
-		while (op < oMatchEnd)
-			*op++ = *match++;
-	} else {
-		ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength - 8); /* works even if matchLength < 8 */
-	}
-	return sequenceLength;
-}
-
-static size_t ZSTD_decompressSequencesLong(ZSTD_DCtx *dctx, void *dst, size_t maxDstSize, const void *seqStart, size_t seqSize)
-{
-	const BYTE *ip = (const BYTE *)seqStart;
-	const BYTE *const iend = ip + seqSize;
-	BYTE *const ostart = (BYTE * const)dst;
-	BYTE *const oend = ostart + maxDstSize;
-	BYTE *op = ostart;
-	const BYTE *litPtr = dctx->litPtr;
-	const BYTE *const litEnd = litPtr + dctx->litSize;
-	const BYTE *const base = (const BYTE *)(dctx->base);
-	const BYTE *const vBase = (const BYTE *)(dctx->vBase);
-	const BYTE *const dictEnd = (const BYTE *)(dctx->dictEnd);
-	unsigned const windowSize = dctx->fParams.windowSize;
-	int nbSeq;
-
-	/* Build Decoding Tables */
-	{
-		size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-		if (ZSTD_isError(seqHSize))
-			return seqHSize;
-		ip += seqHSize;
-	}
-
-	/* Regen sequences */
-	if (nbSeq) {
-#define STORED_SEQS 4
-#define STOSEQ_MASK (STORED_SEQS - 1)
-#define ADVANCED_SEQS 4
-		seq_t *sequences = (seq_t *)dctx->entropy.workspace;
-		int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
-		seqState_t seqState;
-		int seqNb;
-		ZSTD_STATIC_ASSERT(sizeof(dctx->entropy.workspace) >= sizeof(seq_t) * STORED_SEQS);
-		dctx->fseEntropy = 1;
-		{
-			U32 i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				seqState.prevOffset[i] = dctx->entropy.rep[i];
-		}
-		seqState.base = base;
-		seqState.pos = (size_t)(op - base);
-		seqState.gotoDict = (uPtrDiff)dictEnd - (uPtrDiff)base; /* cast to avoid undefined behaviour */
-		CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend - ip), corruption_detected);
-		FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-		FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-		FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
-
-		/* prepare in advance */
-		for (seqNb = 0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && seqNb < seqAdvance; seqNb++) {
-			sequences[seqNb] = ZSTD_decodeSequenceLong(&seqState, windowSize);
-		}
-		if (seqNb < seqAdvance)
-			return ERROR(corruption_detected);
-
-		/* decode and decompress */
-		for (; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && seqNb < nbSeq; seqNb++) {
-			seq_t const sequence = ZSTD_decodeSequenceLong(&seqState, windowSize);
-			size_t const oneSeqSize =
-			    ZSTD_execSequenceLong(op, oend, sequences[(seqNb - ADVANCED_SEQS) & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
-			if (ZSTD_isError(oneSeqSize))
-				return oneSeqSize;
-			ZSTD_PREFETCH(sequence.match);
-			sequences[seqNb & STOSEQ_MASK] = sequence;
-			op += oneSeqSize;
-		}
-		if (seqNb < nbSeq)
-			return ERROR(corruption_detected);
-
-		/* finish queue */
-		seqNb -= seqAdvance;
-		for (; seqNb < nbSeq; seqNb++) {
-			size_t const oneSeqSize = ZSTD_execSequenceLong(op, oend, sequences[seqNb & STOSEQ_MASK], &litPtr, litEnd, base, vBase, dictEnd);
-			if (ZSTD_isError(oneSeqSize))
-				return oneSeqSize;
-			op += oneSeqSize;
-		}
-
-		/* save reps for next block */
-		{
-			U32 i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				dctx->entropy.rep[i] = (U32)(seqState.prevOffset[i]);
-		}
-	}
-
-	/* last literal segment */
-	{
-		size_t const lastLLSize = litEnd - litPtr;
-		if (lastLLSize > (size_t)(oend - op))
-			return ERROR(dstSize_tooSmall);
-		memcpy(op, litPtr, lastLLSize);
-		op += lastLLSize;
-	}
-
-	return op - ostart;
-}
-
-static size_t ZSTD_decompressBlock_internal(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{ /* blockType == blockCompressed */
-	const BYTE *ip = (const BYTE *)src;
-
-	if (srcSize >= ZSTD_BLOCKSIZE_ABSOLUTEMAX)
-		return ERROR(srcSize_wrong);
-
-	/* Decode literals section */
-	{
-		size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
-		if (ZSTD_isError(litCSize))
-			return litCSize;
-		ip += litCSize;
-		srcSize -= litCSize;
-	}
-	if (sizeof(size_t) > 4) /* do not enable prefetching on 32-bits x86, as it's performance detrimental */
-				/* likely because of register pressure */
-				/* if that's the correct cause, then 32-bits ARM should be affected differently */
-				/* it would be good to test this on ARM real hardware, to see if prefetch version improves speed */
-		if (dctx->fParams.windowSize > (1 << 23))
-			return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize);
-	return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize);
-}
-
-static void ZSTD_checkContinuity(ZSTD_DCtx *dctx, const void *dst)
-{
-	if (dst != dctx->previousDstEnd) { /* not contiguous */
-		dctx->dictEnd = dctx->previousDstEnd;
-		dctx->vBase = (const char *)dst - ((const char *)(dctx->previousDstEnd) - (const char *)(dctx->base));
-		dctx->base = dst;
-		dctx->previousDstEnd = dst;
-	}
-}
-
-size_t ZSTD_decompressBlock(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	size_t dSize;
-	ZSTD_checkContinuity(dctx, dst);
-	dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize);
-	dctx->previousDstEnd = (char *)dst + dSize;
-	return dSize;
-}
-
-/** ZSTD_insertBlock() :
-	insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
-size_t ZSTD_insertBlock(ZSTD_DCtx *dctx, const void *blockStart, size_t blockSize)
-{
-	ZSTD_checkContinuity(dctx, blockStart);
-	dctx->previousDstEnd = (const char *)blockStart + blockSize;
-	return blockSize;
-}
-
-size_t ZSTD_generateNxBytes(void *dst, size_t dstCapacity, BYTE byte, size_t length)
-{
-	if (length > dstCapacity)
-		return ERROR(dstSize_tooSmall);
-	memset(dst, byte, length);
-	return length;
-}
-
-/** ZSTD_findFrameCompressedSize() :
- *  compatible with legacy mode
- *  `src` must point to the start of a ZSTD frame, ZSTD legacy frame, or skippable frame
- *  `srcSize` must be at least as large as the frame contained
- *  @return : the compressed size of the frame starting at `src` */
-size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
-{
-	if (srcSize >= ZSTD_skippableHeaderSize && (ZSTD_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-		return ZSTD_skippableHeaderSize + ZSTD_readLE32((const BYTE *)src + 4);
-	} else {
-		const BYTE *ip = (const BYTE *)src;
-		const BYTE *const ipstart = ip;
-		size_t remainingSize = srcSize;
-		ZSTD_frameParams fParams;
-
-		size_t const headerSize = ZSTD_frameHeaderSize(ip, remainingSize);
-		if (ZSTD_isError(headerSize))
-			return headerSize;
-
-		/* Frame Header */
-		{
-			size_t const ret = ZSTD_getFrameParams(&fParams, ip, remainingSize);
-			if (ZSTD_isError(ret))
-				return ret;
-			if (ret > 0)
-				return ERROR(srcSize_wrong);
-		}
-
-		ip += headerSize;
-		remainingSize -= headerSize;
-
-		/* Loop on each block */
-		while (1) {
-			blockProperties_t blockProperties;
-			size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-			if (ZSTD_isError(cBlockSize))
-				return cBlockSize;
-
-			if (ZSTD_blockHeaderSize + cBlockSize > remainingSize)
-				return ERROR(srcSize_wrong);
-
-			ip += ZSTD_blockHeaderSize + cBlockSize;
-			remainingSize -= ZSTD_blockHeaderSize + cBlockSize;
-
-			if (blockProperties.lastBlock)
-				break;
-		}
-
-		if (fParams.checksumFlag) { /* Frame content checksum */
-			if (remainingSize < 4)
-				return ERROR(srcSize_wrong);
-			ip += 4;
-			remainingSize -= 4;
-		}
-
-		return ip - ipstart;
-	}
-}
-
-/*! ZSTD_decompressFrame() :
-*   @dctx must be properly initialized */
-static size_t ZSTD_decompressFrame(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void **srcPtr, size_t *srcSizePtr)
-{
-	const BYTE *ip = (const BYTE *)(*srcPtr);
-	BYTE *const ostart = (BYTE * const)dst;
-	BYTE *const oend = ostart + dstCapacity;
-	BYTE *op = ostart;
-	size_t remainingSize = *srcSizePtr;
-
-	/* check */
-	if (remainingSize < ZSTD_frameHeaderSize_min + ZSTD_blockHeaderSize)
-		return ERROR(srcSize_wrong);
-
-	/* Frame Header */
-	{
-		size_t const frameHeaderSize = ZSTD_frameHeaderSize(ip, ZSTD_frameHeaderSize_prefix);
-		if (ZSTD_isError(frameHeaderSize))
-			return frameHeaderSize;
-		if (remainingSize < frameHeaderSize + ZSTD_blockHeaderSize)
-			return ERROR(srcSize_wrong);
-		CHECK_F(ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize));
-		ip += frameHeaderSize;
-		remainingSize -= frameHeaderSize;
-	}
-
-	/* Loop on each block */
-	while (1) {
-		size_t decodedSize;
-		blockProperties_t blockProperties;
-		size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-		if (ZSTD_isError(cBlockSize))
-			return cBlockSize;
-
-		ip += ZSTD_blockHeaderSize;
-		remainingSize -= ZSTD_blockHeaderSize;
-		if (cBlockSize > remainingSize)
-			return ERROR(srcSize_wrong);
-
-		switch (blockProperties.blockType) {
-		case bt_compressed: decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend - op, ip, cBlockSize); break;
-		case bt_raw: decodedSize = ZSTD_copyRawBlock(op, oend - op, ip, cBlockSize); break;
-		case bt_rle: decodedSize = ZSTD_generateNxBytes(op, oend - op, *ip, blockProperties.origSize); break;
-		case bt_reserved:
-		default: return ERROR(corruption_detected);
-		}
-
-		if (ZSTD_isError(decodedSize))
-			return decodedSize;
-		if (dctx->fParams.checksumFlag)
-			xxh64_update(&dctx->xxhState, op, decodedSize);
-		op += decodedSize;
-		ip += cBlockSize;
-		remainingSize -= cBlockSize;
-		if (blockProperties.lastBlock)
-			break;
-	}
-
-	if (dctx->fParams.checksumFlag) { /* Frame content checksum verification */
-		U32 const checkCalc = (U32)xxh64_digest(&dctx->xxhState);
-		U32 checkRead;
-		if (remainingSize < 4)
-			return ERROR(checksum_wrong);
-		checkRead = ZSTD_readLE32(ip);
-		if (checkRead != checkCalc)
-			return ERROR(checksum_wrong);
-		ip += 4;
-		remainingSize -= 4;
-	}
-
-	/* Allow caller to get size read */
-	*srcPtr = ip;
-	*srcSizePtr = remainingSize;
-	return op - ostart;
-}
-
-static const void *ZSTD_DDictDictContent(const ZSTD_DDict *ddict);
-static size_t ZSTD_DDictDictSize(const ZSTD_DDict *ddict);
-
-static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize,
-					const ZSTD_DDict *ddict)
-{
-	void *const dststart = dst;
-
-	if (ddict) {
-		if (dict) {
-			/* programmer error, these two cases should be mutually exclusive */
-			return ERROR(GENERIC);
-		}
-
-		dict = ZSTD_DDictDictContent(ddict);
-		dictSize = ZSTD_DDictDictSize(ddict);
-	}
-
-	while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-		U32 magicNumber;
-
-		magicNumber = ZSTD_readLE32(src);
-		if (magicNumber != ZSTD_MAGICNUMBER) {
-			if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-				size_t skippableSize;
-				if (srcSize < ZSTD_skippableHeaderSize)
-					return ERROR(srcSize_wrong);
-				skippableSize = ZSTD_readLE32((const BYTE *)src + 4) + ZSTD_skippableHeaderSize;
-				if (srcSize < skippableSize) {
-					return ERROR(srcSize_wrong);
-				}
-
-				src = (const BYTE *)src + skippableSize;
-				srcSize -= skippableSize;
-				continue;
-			} else {
-				return ERROR(prefix_unknown);
-			}
-		}
-
-		if (ddict) {
-			/* we were called from ZSTD_decompress_usingDDict */
-			ZSTD_refDDict(dctx, ddict);
-		} else {
-			/* this will initialize correctly with no dict if dict == NULL, so
-			 * use this in all cases but ddict */
-			CHECK_F(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize));
-		}
-		ZSTD_checkContinuity(dctx, dst);
-
-		{
-			const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity, &src, &srcSize);
-			if (ZSTD_isError(res))
-				return res;
-			/* don't need to bounds check this, ZSTD_decompressFrame will have
-			 * already */
-			dst = (BYTE *)dst + res;
-			dstCapacity -= res;
-		}
-	}
-
-	if (srcSize)
-		return ERROR(srcSize_wrong); /* input not entirely consumed */
-
-	return (BYTE *)dst - (BYTE *)dststart;
-}
-
-size_t ZSTD_decompress_usingDict(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const void *dict, size_t dictSize)
-{
-	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
-}
-
-size_t ZSTD_decompressDCtx(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	return ZSTD_decompress_usingDict(dctx, dst, dstCapacity, src, srcSize, NULL, 0);
-}
-
-/*-**************************************
-*   Advanced Streaming Decompression API
-*   Bufferless and synchronous
-****************************************/
-size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx *dctx) { return dctx->expected; }
-
-ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx *dctx)
-{
-	switch (dctx->stage) {
-	default: /* should not happen */
-	case ZSTDds_getFrameHeaderSize:
-	case ZSTDds_decodeFrameHeader: return ZSTDnit_frameHeader;
-	case ZSTDds_decodeBlockHeader: return ZSTDnit_blockHeader;
-	case ZSTDds_decompressBlock: return ZSTDnit_block;
-	case ZSTDds_decompressLastBlock: return ZSTDnit_lastBlock;
-	case ZSTDds_checkChecksum: return ZSTDnit_checksum;
-	case ZSTDds_decodeSkippableHeader:
-	case ZSTDds_skipFrame: return ZSTDnit_skippableFrame;
-	}
-}
-
-int ZSTD_isSkipFrame(ZSTD_DCtx *dctx) { return dctx->stage == ZSTDds_skipFrame; } /* for zbuff */
-
-/** ZSTD_decompressContinue() :
-*   @return : nb of bytes generated into `dst` (necessarily <= `dstCapacity)
-*             or an error code, which can be tested using ZSTD_isError() */
-size_t ZSTD_decompressContinue(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	/* Sanity check */
-	if (srcSize != dctx->expected)
-		return ERROR(srcSize_wrong);
-	if (dstCapacity)
-		ZSTD_checkContinuity(dctx, dst);
-
-	switch (dctx->stage) {
-	case ZSTDds_getFrameHeaderSize:
-		if (srcSize != ZSTD_frameHeaderSize_prefix)
-			return ERROR(srcSize_wrong);					/* impossible */
-		if ((ZSTD_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) { /* skippable frame */
-			memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
-			dctx->expected = ZSTD_skippableHeaderSize - ZSTD_frameHeaderSize_prefix; /* magic number + skippable frame length */
-			dctx->stage = ZSTDds_decodeSkippableHeader;
-			return 0;
-		}
-		dctx->headerSize = ZSTD_frameHeaderSize(src, ZSTD_frameHeaderSize_prefix);
-		if (ZSTD_isError(dctx->headerSize))
-			return dctx->headerSize;
-		memcpy(dctx->headerBuffer, src, ZSTD_frameHeaderSize_prefix);
-		if (dctx->headerSize > ZSTD_frameHeaderSize_prefix) {
-			dctx->expected = dctx->headerSize - ZSTD_frameHeaderSize_prefix;
-			dctx->stage = ZSTDds_decodeFrameHeader;
-			return 0;
-		}
-		dctx->expected = 0; /* not necessary to copy more */
-
-	case ZSTDds_decodeFrameHeader:
-		memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
-		CHECK_F(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize));
-		dctx->expected = ZSTD_blockHeaderSize;
-		dctx->stage = ZSTDds_decodeBlockHeader;
-		return 0;
-
-	case ZSTDds_decodeBlockHeader: {
-		blockProperties_t bp;
-		size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
-		if (ZSTD_isError(cBlockSize))
-			return cBlockSize;
-		dctx->expected = cBlockSize;
-		dctx->bType = bp.blockType;
-		dctx->rleSize = bp.origSize;
-		if (cBlockSize) {
-			dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
-			return 0;
-		}
-		/* empty block */
-		if (bp.lastBlock) {
-			if (dctx->fParams.checksumFlag) {
-				dctx->expected = 4;
-				dctx->stage = ZSTDds_checkChecksum;
-			} else {
-				dctx->expected = 0; /* end of frame */
-				dctx->stage = ZSTDds_getFrameHeaderSize;
-			}
-		} else {
-			dctx->expected = 3; /* go directly to next header */
-			dctx->stage = ZSTDds_decodeBlockHeader;
-		}
-		return 0;
-	}
-	case ZSTDds_decompressLastBlock:
-	case ZSTDds_decompressBlock: {
-		size_t rSize;
-		switch (dctx->bType) {
-		case bt_compressed: rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize); break;
-		case bt_raw: rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize); break;
-		case bt_rle: rSize = ZSTD_setRleBlock(dst, dstCapacity, src, srcSize, dctx->rleSize); break;
-		case bt_reserved: /* should never happen */
-		default: return ERROR(corruption_detected);
-		}
-		if (ZSTD_isError(rSize))
-			return rSize;
-		if (dctx->fParams.checksumFlag)
-			xxh64_update(&dctx->xxhState, dst, rSize);
-
-		if (dctx->stage == ZSTDds_decompressLastBlock) { /* end of frame */
-			if (dctx->fParams.checksumFlag) {	/* another round for frame checksum */
-				dctx->expected = 4;
-				dctx->stage = ZSTDds_checkChecksum;
-			} else {
-				dctx->expected = 0; /* ends here */
-				dctx->stage = ZSTDds_getFrameHeaderSize;
-			}
-		} else {
-			dctx->stage = ZSTDds_decodeBlockHeader;
-			dctx->expected = ZSTD_blockHeaderSize;
-			dctx->previousDstEnd = (char *)dst + rSize;
-		}
-		return rSize;
-	}
-	case ZSTDds_checkChecksum: {
-		U32 const h32 = (U32)xxh64_digest(&dctx->xxhState);
-		U32 const check32 = ZSTD_readLE32(src); /* srcSize == 4, guaranteed by dctx->expected */
-		if (check32 != h32)
-			return ERROR(checksum_wrong);
-		dctx->expected = 0;
-		dctx->stage = ZSTDds_getFrameHeaderSize;
-		return 0;
-	}
-	case ZSTDds_decodeSkippableHeader: {
-		memcpy(dctx->headerBuffer + ZSTD_frameHeaderSize_prefix, src, dctx->expected);
-		dctx->expected = ZSTD_readLE32(dctx->headerBuffer + 4);
-		dctx->stage = ZSTDds_skipFrame;
-		return 0;
-	}
-	case ZSTDds_skipFrame: {
-		dctx->expected = 0;
-		dctx->stage = ZSTDds_getFrameHeaderSize;
-		return 0;
-	}
-	default:
-		return ERROR(GENERIC); /* impossible */
-	}
-}
-
-static size_t ZSTD_refDictContent(ZSTD_DCtx *dctx, const void *dict, size_t dictSize)
-{
-	dctx->dictEnd = dctx->previousDstEnd;
-	dctx->vBase = (const char *)dict - ((const char *)(dctx->previousDstEnd) - (const char *)(dctx->base));
-	dctx->base = dict;
-	dctx->previousDstEnd = (const char *)dict + dictSize;
-	return 0;
-}
-
-/* ZSTD_loadEntropy() :
- * dict : must point at beginning of a valid zstd dictionary
- * @return : size of entropy tables read */
-static size_t ZSTD_loadEntropy(ZSTD_entropyTables_t *entropy, const void *const dict, size_t const dictSize)
-{
-	const BYTE *dictPtr = (const BYTE *)dict;
-	const BYTE *const dictEnd = dictPtr + dictSize;
-
-	if (dictSize <= 8)
-		return ERROR(dictionary_corrupted);
-	dictPtr += 8; /* skip header = magic + dictID */
-
-	{
-		size_t const hSize = HUF_readDTableX4_wksp(entropy->hufTable, dictPtr, dictEnd - dictPtr, entropy->workspace, sizeof(entropy->workspace));
-		if (HUF_isError(hSize))
-			return ERROR(dictionary_corrupted);
-		dictPtr += hSize;
-	}
-
-	{
-		short offcodeNCount[MaxOff + 1];
-		U32 offcodeMaxValue = MaxOff, offcodeLog;
-		size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd - dictPtr);
-		if (FSE_isError(offcodeHeaderSize))
-			return ERROR(dictionary_corrupted);
-		if (offcodeLog > OffFSELog)
-			return ERROR(dictionary_corrupted);
-		CHECK_E(FSE_buildDTable_wksp(entropy->OFTable, offcodeNCount, offcodeMaxValue, offcodeLog, entropy->workspace, sizeof(entropy->workspace)), dictionary_corrupted);
-		dictPtr += offcodeHeaderSize;
-	}
-
-	{
-		short matchlengthNCount[MaxML + 1];
-		unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-		size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd - dictPtr);
-		if (FSE_isError(matchlengthHeaderSize))
-			return ERROR(dictionary_corrupted);
-		if (matchlengthLog > MLFSELog)
-			return ERROR(dictionary_corrupted);
-		CHECK_E(FSE_buildDTable_wksp(entropy->MLTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, entropy->workspace, sizeof(entropy->workspace)), dictionary_corrupted);
-		dictPtr += matchlengthHeaderSize;
-	}
-
-	{
-		short litlengthNCount[MaxLL + 1];
-		unsigned litlengthMaxValue = MaxLL, litlengthLog;
-		size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd - dictPtr);
-		if (FSE_isError(litlengthHeaderSize))
-			return ERROR(dictionary_corrupted);
-		if (litlengthLog > LLFSELog)
-			return ERROR(dictionary_corrupted);
-		CHECK_E(FSE_buildDTable_wksp(entropy->LLTable, litlengthNCount, litlengthMaxValue, litlengthLog, entropy->workspace, sizeof(entropy->workspace)), dictionary_corrupted);
-		dictPtr += litlengthHeaderSize;
-	}
-
-	if (dictPtr + 12 > dictEnd)
-		return ERROR(dictionary_corrupted);
-	{
-		int i;
-		size_t const dictContentSize = (size_t)(dictEnd - (dictPtr + 12));
-		for (i = 0; i < 3; i++) {
-			U32 const rep = ZSTD_readLE32(dictPtr);
-			dictPtr += 4;
-			if (rep == 0 || rep >= dictContentSize)
-				return ERROR(dictionary_corrupted);
-			entropy->rep[i] = rep;
-		}
-	}
-
-	return dictPtr - (const BYTE *)dict;
-}
-
-static size_t ZSTD_decompress_insertDictionary(ZSTD_DCtx *dctx, const void *dict, size_t dictSize)
-{
-	if (dictSize < 8)
-		return ZSTD_refDictContent(dctx, dict, dictSize);
-	{
-		U32 const magic = ZSTD_readLE32(dict);
-		if (magic != ZSTD_DICT_MAGIC) {
-			return ZSTD_refDictContent(dctx, dict, dictSize); /* pure content mode */
-		}
-	}
-	dctx->dictID = ZSTD_readLE32((const char *)dict + 4);
-
-	/* load entropy tables */
-	{
-		size_t const eSize = ZSTD_loadEntropy(&dctx->entropy, dict, dictSize);
-		if (ZSTD_isError(eSize))
-			return ERROR(dictionary_corrupted);
-		dict = (const char *)dict + eSize;
-		dictSize -= eSize;
-	}
-	dctx->litEntropy = dctx->fseEntropy = 1;
-
-	/* reference dictionary content */
-	return ZSTD_refDictContent(dctx, dict, dictSize);
-}
-
-size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx *dctx, const void *dict, size_t dictSize)
-{
-	CHECK_F(ZSTD_decompressBegin(dctx));
-	if (dict && dictSize)
-		CHECK_E(ZSTD_decompress_insertDictionary(dctx, dict, dictSize), dictionary_corrupted);
-	return 0;
-}
-
-/* ======   ZSTD_DDict   ====== */
-
-struct ZSTD_DDict_s {
-	void *dictBuffer;
-	const void *dictContent;
-	size_t dictSize;
-	ZSTD_entropyTables_t entropy;
-	U32 dictID;
-	U32 entropyPresent;
-	ZSTD_customMem cMem;
-}; /* typedef'd to ZSTD_DDict within "zstd.h" */
-
-size_t ZSTD_DDictWorkspaceBound(void) { return ZSTD_ALIGN(sizeof(ZSTD_stack)) + ZSTD_ALIGN(sizeof(ZSTD_DDict)); }
-
-static const void *ZSTD_DDictDictContent(const ZSTD_DDict *ddict) { return ddict->dictContent; }
-
-static size_t ZSTD_DDictDictSize(const ZSTD_DDict *ddict) { return ddict->dictSize; }
-
-static void ZSTD_refDDict(ZSTD_DCtx *dstDCtx, const ZSTD_DDict *ddict)
-{
-	ZSTD_decompressBegin(dstDCtx); /* init */
-	if (ddict) {		       /* support refDDict on NULL */
-		dstDCtx->dictID = ddict->dictID;
-		dstDCtx->base = ddict->dictContent;
-		dstDCtx->vBase = ddict->dictContent;
-		dstDCtx->dictEnd = (const BYTE *)ddict->dictContent + ddict->dictSize;
-		dstDCtx->previousDstEnd = dstDCtx->dictEnd;
-		if (ddict->entropyPresent) {
-			dstDCtx->litEntropy = 1;
-			dstDCtx->fseEntropy = 1;
-			dstDCtx->LLTptr = ddict->entropy.LLTable;
-			dstDCtx->MLTptr = ddict->entropy.MLTable;
-			dstDCtx->OFTptr = ddict->entropy.OFTable;
-			dstDCtx->HUFptr = ddict->entropy.hufTable;
-			dstDCtx->entropy.rep[0] = ddict->entropy.rep[0];
-			dstDCtx->entropy.rep[1] = ddict->entropy.rep[1];
-			dstDCtx->entropy.rep[2] = ddict->entropy.rep[2];
-		} else {
-			dstDCtx->litEntropy = 0;
-			dstDCtx->fseEntropy = 0;
-		}
-	}
-}
-
-static size_t ZSTD_loadEntropy_inDDict(ZSTD_DDict *ddict)
-{
-	ddict->dictID = 0;
-	ddict->entropyPresent = 0;
-	if (ddict->dictSize < 8)
-		return 0;
-	{
-		U32 const magic = ZSTD_readLE32(ddict->dictContent);
-		if (magic != ZSTD_DICT_MAGIC)
-			return 0; /* pure content mode */
-	}
-	ddict->dictID = ZSTD_readLE32((const char *)ddict->dictContent + 4);
-
-	/* load entropy tables */
-	CHECK_E(ZSTD_loadEntropy(&ddict->entropy, ddict->dictContent, ddict->dictSize), dictionary_corrupted);
-	ddict->entropyPresent = 1;
-	return 0;
-}
-
-static ZSTD_DDict *ZSTD_createDDict_advanced(const void *dict, size_t dictSize, unsigned byReference, ZSTD_customMem customMem)
-{
-	if (!customMem.customAlloc || !customMem.customFree)
-		return NULL;
-
-	{
-		ZSTD_DDict *const ddict = (ZSTD_DDict *)ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
-		if (!ddict)
-			return NULL;
-		ddict->cMem = customMem;
-
-		if ((byReference) || (!dict) || (!dictSize)) {
-			ddict->dictBuffer = NULL;
-			ddict->dictContent = dict;
-		} else {
-			void *const internalBuffer = ZSTD_malloc(dictSize, customMem);
-			if (!internalBuffer) {
-				ZSTD_freeDDict(ddict);
-				return NULL;
-			}
-			memcpy(internalBuffer, dict, dictSize);
-			ddict->dictBuffer = internalBuffer;
-			ddict->dictContent = internalBuffer;
-		}
-		ddict->dictSize = dictSize;
-		ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001); /* cover both little and big endian */
-		/* parse dictionary content */
-		{
-			size_t const errorCode = ZSTD_loadEntropy_inDDict(ddict);
-			if (ZSTD_isError(errorCode)) {
-				ZSTD_freeDDict(ddict);
-				return NULL;
-			}
-		}
-
-		return ddict;
-	}
-}
-
-/*! ZSTD_initDDict() :
-*   Create a digested dictionary, to start decompression without startup delay.
-*   `dict` content is copied inside DDict.
-*   Consequently, `dict` can be released after `ZSTD_DDict` creation */
-ZSTD_DDict *ZSTD_initDDict(const void *dict, size_t dictSize, void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	return ZSTD_createDDict_advanced(dict, dictSize, 1, stackMem);
-}
-
-size_t ZSTD_freeDDict(ZSTD_DDict *ddict)
-{
-	if (ddict == NULL)
-		return 0; /* support free on NULL */
-	{
-		ZSTD_customMem const cMem = ddict->cMem;
-		ZSTD_free(ddict->dictBuffer, cMem);
-		ZSTD_free(ddict, cMem);
-		return 0;
-	}
-}
-
-/*! ZSTD_getDictID_fromDict() :
- *  Provides the dictID stored within dictionary.
- *  if @return == 0, the dictionary is not conformant with Zstandard specification.
- *  It can still be loaded, but as a content-only dictionary. */
-unsigned ZSTD_getDictID_fromDict(const void *dict, size_t dictSize)
-{
-	if (dictSize < 8)
-		return 0;
-	if (ZSTD_readLE32(dict) != ZSTD_DICT_MAGIC)
-		return 0;
-	return ZSTD_readLE32((const char *)dict + 4);
-}
-
-/*! ZSTD_getDictID_fromDDict() :
- *  Provides the dictID of the dictionary loaded into `ddict`.
- *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
- *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
-unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict *ddict)
-{
-	if (ddict == NULL)
-		return 0;
-	return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
-}
-
-/*! ZSTD_getDictID_fromFrame() :
- *  Provides the dictID required to decompressed the frame stored within `src`.
- *  If @return == 0, the dictID could not be decoded.
- *  This could for one of the following reasons :
- *  - The frame does not require a dictionary to be decoded (most common case).
- *  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
- *    Note : this use case also happens when using a non-conformant dictionary.
- *  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
- *  - This is not a Zstandard frame.
- *  When identifying the exact failure cause, it's possible to used ZSTD_getFrameParams(), which will provide a more precise error code. */
-unsigned ZSTD_getDictID_fromFrame(const void *src, size_t srcSize)
-{
-	ZSTD_frameParams zfp = {0, 0, 0, 0};
-	size_t const hError = ZSTD_getFrameParams(&zfp, src, srcSize);
-	if (ZSTD_isError(hError))
-		return 0;
-	return zfp.dictID;
-}
-
-/*! ZSTD_decompress_usingDDict() :
-*   Decompression using a pre-digested Dictionary
-*   Use dictionary without significant overhead. */
-size_t ZSTD_decompress_usingDDict(ZSTD_DCtx *dctx, void *dst, size_t dstCapacity, const void *src, size_t srcSize, const ZSTD_DDict *ddict)
-{
-	/* pass content and size in case legacy frames are encountered */
-	return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, NULL, 0, ddict);
-}
-
-/*=====================================
-*   Streaming decompression
-*====================================*/
-
-typedef enum { zdss_init, zdss_loadHeader, zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
-
-/* *** Resource management *** */
-struct ZSTD_DStream_s {
-	ZSTD_DCtx *dctx;
-	ZSTD_DDict *ddictLocal;
-	const ZSTD_DDict *ddict;
-	ZSTD_frameParams fParams;
-	ZSTD_dStreamStage stage;
-	char *inBuff;
-	size_t inBuffSize;
-	size_t inPos;
-	size_t maxWindowSize;
-	char *outBuff;
-	size_t outBuffSize;
-	size_t outStart;
-	size_t outEnd;
-	size_t blockSize;
-	BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX]; /* tmp buffer to store frame header */
-	size_t lhSize;
-	ZSTD_customMem customMem;
-	void *legacyContext;
-	U32 previousLegacyVersion;
-	U32 legacyVersion;
-	U32 hostageByte;
-}; /* typedef'd to ZSTD_DStream within "zstd.h" */
-
-size_t ZSTD_DStreamWorkspaceBound(size_t maxWindowSize)
-{
-	size_t const blockSize = MIN(maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-	size_t const inBuffSize = blockSize;
-	size_t const outBuffSize = maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-	return ZSTD_DCtxWorkspaceBound() + ZSTD_ALIGN(sizeof(ZSTD_DStream)) + ZSTD_ALIGN(inBuffSize) + ZSTD_ALIGN(outBuffSize);
-}
-
-static ZSTD_DStream *ZSTD_createDStream_advanced(ZSTD_customMem customMem)
-{
-	ZSTD_DStream *zds;
-
-	if (!customMem.customAlloc || !customMem.customFree)
-		return NULL;
-
-	zds = (ZSTD_DStream *)ZSTD_malloc(sizeof(ZSTD_DStream), customMem);
-	if (zds == NULL)
-		return NULL;
-	memset(zds, 0, sizeof(ZSTD_DStream));
-	memcpy(&zds->customMem, &customMem, sizeof(ZSTD_customMem));
-	zds->dctx = ZSTD_createDCtx_advanced(customMem);
-	if (zds->dctx == NULL) {
-		ZSTD_freeDStream(zds);
-		return NULL;
-	}
-	zds->stage = zdss_init;
-	zds->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
-	return zds;
-}
-
-ZSTD_DStream *ZSTD_initDStream(size_t maxWindowSize, void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem const stackMem = ZSTD_initStack(workspace, workspaceSize);
-	ZSTD_DStream *zds = ZSTD_createDStream_advanced(stackMem);
-	if (!zds) {
-		return NULL;
-	}
-
-	zds->maxWindowSize = maxWindowSize;
-	zds->stage = zdss_loadHeader;
-	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-	ZSTD_freeDDict(zds->ddictLocal);
-	zds->ddictLocal = NULL;
-	zds->ddict = zds->ddictLocal;
-	zds->legacyVersion = 0;
-	zds->hostageByte = 0;
-
-	{
-		size_t const blockSize = MIN(zds->maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-		size_t const neededOutSize = zds->maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-
-		zds->inBuff = (char *)ZSTD_malloc(blockSize, zds->customMem);
-		zds->inBuffSize = blockSize;
-		zds->outBuff = (char *)ZSTD_malloc(neededOutSize, zds->customMem);
-		zds->outBuffSize = neededOutSize;
-		if (zds->inBuff == NULL || zds->outBuff == NULL) {
-			ZSTD_freeDStream(zds);
-			return NULL;
-		}
-	}
-	return zds;
-}
-
-ZSTD_DStream *ZSTD_initDStream_usingDDict(size_t maxWindowSize, const ZSTD_DDict *ddict, void *workspace, size_t workspaceSize)
-{
-	ZSTD_DStream *zds = ZSTD_initDStream(maxWindowSize, workspace, workspaceSize);
-	if (zds) {
-		zds->ddict = ddict;
-	}
-	return zds;
-}
-
-size_t ZSTD_freeDStream(ZSTD_DStream *zds)
-{
-	if (zds == NULL)
-		return 0; /* support free on null */
-	{
-		ZSTD_customMem const cMem = zds->customMem;
-		ZSTD_freeDCtx(zds->dctx);
-		zds->dctx = NULL;
-		ZSTD_freeDDict(zds->ddictLocal);
-		zds->ddictLocal = NULL;
-		ZSTD_free(zds->inBuff, cMem);
-		zds->inBuff = NULL;
-		ZSTD_free(zds->outBuff, cMem);
-		zds->outBuff = NULL;
-		ZSTD_free(zds, cMem);
-		return 0;
-	}
-}
-
-/* *** Initialization *** */
-
-size_t ZSTD_DStreamInSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX + ZSTD_blockHeaderSize; }
-size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_ABSOLUTEMAX; }
-
-size_t ZSTD_resetDStream(ZSTD_DStream *zds)
-{
-	zds->stage = zdss_loadHeader;
-	zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-	zds->legacyVersion = 0;
-	zds->hostageByte = 0;
-	return ZSTD_frameHeaderSize_prefix;
-}
-
-/* *****   Decompression   ***** */
-
-ZSTD_STATIC size_t ZSTD_limitCopy(void *dst, size_t dstCapacity, const void *src, size_t srcSize)
-{
-	size_t const length = MIN(dstCapacity, srcSize);
-	memcpy(dst, src, length);
-	return length;
-}
-
-size_t ZSTD_decompressStream(ZSTD_DStream *zds, ZSTD_outBuffer *output, ZSTD_inBuffer *input)
-{
-	const char *const istart = (const char *)(input->src) + input->pos;
-	const char *const iend = (const char *)(input->src) + input->size;
-	const char *ip = istart;
-	char *const ostart = (char *)(output->dst) + output->pos;
-	char *const oend = (char *)(output->dst) + output->size;
-	char *op = ostart;
-	U32 someMoreWork = 1;
-
-	while (someMoreWork) {
-		switch (zds->stage) {
-		case zdss_init:
-			ZSTD_resetDStream(zds); /* transparent reset on starting decoding a new frame */
-						/* fall-through */
-
-		case zdss_loadHeader: {
-			size_t const hSize = ZSTD_getFrameParams(&zds->fParams, zds->headerBuffer, zds->lhSize);
-			if (ZSTD_isError(hSize))
-				return hSize;
-			if (hSize != 0) {				   /* need more input */
-				size_t const toLoad = hSize - zds->lhSize; /* if hSize!=0, hSize > zds->lhSize */
-				if (toLoad > (size_t)(iend - ip)) {	/* not enough input to load full header */
-					memcpy(zds->headerBuffer + zds->lhSize, ip, iend - ip);
-					zds->lhSize += iend - ip;
-					input->pos = input->size;
-					return (MAX(ZSTD_frameHeaderSize_min, hSize) - zds->lhSize) +
-					       ZSTD_blockHeaderSize; /* remaining header bytes + next block header */
-				}
-				memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad);
-				zds->lhSize = hSize;
-				ip += toLoad;
-				break;
-			}
-
-			/* check for single-pass mode opportunity */
-			if (zds->fParams.frameContentSize && zds->fParams.windowSize /* skippable frame if == 0 */
-			    && (U64)(size_t)(oend - op) >= zds->fParams.frameContentSize) {
-				size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend - istart);
-				if (cSize <= (size_t)(iend - istart)) {
-					size_t const decompressedSize = ZSTD_decompress_usingDDict(zds->dctx, op, oend - op, istart, cSize, zds->ddict);
-					if (ZSTD_isError(decompressedSize))
-						return decompressedSize;
-					ip = istart + cSize;
-					op += decompressedSize;
-					zds->dctx->expected = 0;
-					zds->stage = zdss_init;
-					someMoreWork = 0;
-					break;
-				}
-			}
-
-			/* Consume header */
-			ZSTD_refDDict(zds->dctx, zds->ddict);
-			{
-				size_t const h1Size = ZSTD_nextSrcSizeToDecompress(zds->dctx); /* == ZSTD_frameHeaderSize_prefix */
-				CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer, h1Size));
-				{
-					size_t const h2Size = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-					CHECK_F(ZSTD_decompressContinue(zds->dctx, NULL, 0, zds->headerBuffer + h1Size, h2Size));
-				}
-			}
-
-			zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
-			if (zds->fParams.windowSize > zds->maxWindowSize)
-				return ERROR(frameParameter_windowTooLarge);
-
-			/* Buffers are preallocated, but double check */
-			{
-				size_t const blockSize = MIN(zds->maxWindowSize, ZSTD_BLOCKSIZE_ABSOLUTEMAX);
-				size_t const neededOutSize = zds->maxWindowSize + blockSize + WILDCOPY_OVERLENGTH * 2;
-				if (zds->inBuffSize < blockSize) {
-					return ERROR(GENERIC);
-				}
-				if (zds->outBuffSize < neededOutSize) {
-					return ERROR(GENERIC);
-				}
-				zds->blockSize = blockSize;
-			}
-			zds->stage = zdss_read;
-		}
-		/* pass-through */
-
-		case zdss_read: {
-			size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-			if (neededInSize == 0) { /* end of frame */
-				zds->stage = zdss_init;
-				someMoreWork = 0;
-				break;
-			}
-			if ((size_t)(iend - ip) >= neededInSize) { /* decode directly from src */
-				const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
-				size_t const decodedSize = ZSTD_decompressContinue(zds->dctx, zds->outBuff + zds->outStart,
-										   (isSkipFrame ? 0 : zds->outBuffSize - zds->outStart), ip, neededInSize);
-				if (ZSTD_isError(decodedSize))
-					return decodedSize;
-				ip += neededInSize;
-				if (!decodedSize && !isSkipFrame)
-					break; /* this was just a header */
-				zds->outEnd = zds->outStart + decodedSize;
-				zds->stage = zdss_flush;
-				break;
-			}
-			if (ip == iend) {
-				someMoreWork = 0;
-				break;
-			} /* no more input */
-			zds->stage = zdss_load;
-			/* pass-through */
-		}
-
-		case zdss_load: {
-			size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-			size_t const toLoad = neededInSize - zds->inPos; /* should always be <= remaining space within inBuff */
-			size_t loadedSize;
-			if (toLoad > zds->inBuffSize - zds->inPos)
-				return ERROR(corruption_detected); /* should never happen */
-			loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend - ip);
-			ip += loadedSize;
-			zds->inPos += loadedSize;
-			if (loadedSize < toLoad) {
-				someMoreWork = 0;
-				break;
-			} /* not enough input, wait for more */
-
-			/* decode loaded input */
-			{
-				const int isSkipFrame = ZSTD_isSkipFrame(zds->dctx);
-				size_t const decodedSize = ZSTD_decompressContinue(zds->dctx, zds->outBuff + zds->outStart, zds->outBuffSize - zds->outStart,
-										   zds->inBuff, neededInSize);
-				if (ZSTD_isError(decodedSize))
-					return decodedSize;
-				zds->inPos = 0; /* input is consumed */
-				if (!decodedSize && !isSkipFrame) {
-					zds->stage = zdss_read;
-					break;
-				} /* this was just a header */
-				zds->outEnd = zds->outStart + decodedSize;
-				zds->stage = zdss_flush;
-				/* pass-through */
-			}
-		}
-
-		case zdss_flush: {
-			size_t const toFlushSize = zds->outEnd - zds->outStart;
-			size_t const flushedSize = ZSTD_limitCopy(op, oend - op, zds->outBuff + zds->outStart, toFlushSize);
-			op += flushedSize;
-			zds->outStart += flushedSize;
-			if (flushedSize == toFlushSize) { /* flush completed */
-				zds->stage = zdss_read;
-				if (zds->outStart + zds->blockSize > zds->outBuffSize)
-					zds->outStart = zds->outEnd = 0;
-				break;
-			}
-			/* cannot complete flush */
-			someMoreWork = 0;
-			break;
-		}
-		default:
-			return ERROR(GENERIC); /* impossible */
-		}
-	}
-
-	/* result */
-	input->pos += (size_t)(ip - istart);
-	output->pos += (size_t)(op - ostart);
-	{
-		size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds->dctx);
-		if (!nextSrcSizeHint) {			    /* frame fully decoded */
-			if (zds->outEnd == zds->outStart) { /* output fully flushed */
-				if (zds->hostageByte) {
-					if (input->pos >= input->size) {
-						zds->stage = zdss_read;
-						return 1;
-					}	     /* can't release hostage (not present) */
-					input->pos++; /* release hostage */
-				}
-				return 0;
-			}
-			if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
-				input->pos--;    /* note : pos > 0, otherwise, impossible to finish reading last block */
-				zds->hostageByte = 1;
-			}
-			return 1;
-		}
-		nextSrcSizeHint += ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds->dctx) == ZSTDnit_block); /* preload header of next block */
-		if (zds->inPos > nextSrcSizeHint)
-			return ERROR(GENERIC); /* should never happen */
-		nextSrcSizeHint -= zds->inPos; /* already loaded*/
-		return nextSrcSizeHint;
-	}
-}
-
-EXPORT_SYMBOL(ZSTD_DCtxWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_initDCtx);
-EXPORT_SYMBOL(ZSTD_decompressDCtx);
-EXPORT_SYMBOL(ZSTD_decompress_usingDict);
-
-EXPORT_SYMBOL(ZSTD_DDictWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_initDDict);
-EXPORT_SYMBOL(ZSTD_decompress_usingDDict);
-
-EXPORT_SYMBOL(ZSTD_DStreamWorkspaceBound);
-EXPORT_SYMBOL(ZSTD_initDStream);
-EXPORT_SYMBOL(ZSTD_initDStream_usingDDict);
-EXPORT_SYMBOL(ZSTD_resetDStream);
-EXPORT_SYMBOL(ZSTD_decompressStream);
-EXPORT_SYMBOL(ZSTD_DStreamInSize);
-EXPORT_SYMBOL(ZSTD_DStreamOutSize);
-
-EXPORT_SYMBOL(ZSTD_findFrameCompressedSize);
-EXPORT_SYMBOL(ZSTD_getFrameContentSize);
-EXPORT_SYMBOL(ZSTD_findDecompressedSize);
-
-EXPORT_SYMBOL(ZSTD_isFrame);
-EXPORT_SYMBOL(ZSTD_getDictID_fromDict);
-EXPORT_SYMBOL(ZSTD_getDictID_fromDDict);
-EXPORT_SYMBOL(ZSTD_getDictID_fromFrame);
-
-EXPORT_SYMBOL(ZSTD_getFrameParams);
-EXPORT_SYMBOL(ZSTD_decompressBegin);
-EXPORT_SYMBOL(ZSTD_decompressBegin_usingDict);
-EXPORT_SYMBOL(ZSTD_copyDCtx);
-EXPORT_SYMBOL(ZSTD_nextSrcSizeToDecompress);
-EXPORT_SYMBOL(ZSTD_decompressContinue);
-EXPORT_SYMBOL(ZSTD_nextInputType);
-
-EXPORT_SYMBOL(ZSTD_decompressBlock);
-EXPORT_SYMBOL(ZSTD_insertBlock);
-
-MODULE_LICENSE("Dual BSD/GPL");
-MODULE_DESCRIPTION("Zstd Decompressor");
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/entropy_common.c b/priv/zstd/contrib/linux-kernel/lib/zstd/entropy_common.c
deleted file mode 100644
index 2b0a643..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/entropy_common.c
+++ /dev/null
@@ -1,243 +0,0 @@
-/*
- * Common functions of New Generation Entropy library
- * Copyright (C) 2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-
-/* *************************************
-*  Dependencies
-***************************************/
-#include "error_private.h" /* ERR_*, ERROR */
-#include "fse.h"
-#include "huf.h"
-#include "mem.h"
-
-/*===   Version   ===*/
-unsigned FSE_versionNumber(void) { return FSE_VERSION_NUMBER; }
-
-/*===   Error Management   ===*/
-unsigned FSE_isError(size_t code) { return ERR_isError(code); }
-
-unsigned HUF_isError(size_t code) { return ERR_isError(code); }
-
-/*-**************************************************************
-*  FSE NCount encoding-decoding
-****************************************************************/
-size_t FSE_readNCount(short *normalizedCounter, unsigned *maxSVPtr, unsigned *tableLogPtr, const void *headerBuffer, size_t hbSize)
-{
-	const BYTE *const istart = (const BYTE *)headerBuffer;
-	const BYTE *const iend = istart + hbSize;
-	const BYTE *ip = istart;
-	int nbBits;
-	int remaining;
-	int threshold;
-	U32 bitStream;
-	int bitCount;
-	unsigned charnum = 0;
-	int previous0 = 0;
-
-	if (hbSize < 4)
-		return ERROR(srcSize_wrong);
-	bitStream = ZSTD_readLE32(ip);
-	nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG; /* extract tableLog */
-	if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX)
-		return ERROR(tableLog_tooLarge);
-	bitStream >>= 4;
-	bitCount = 4;
-	*tableLogPtr = nbBits;
-	remaining = (1 << nbBits) + 1;
-	threshold = 1 << nbBits;
-	nbBits++;
-
-	while ((remaining > 1) & (charnum <= *maxSVPtr)) {
-		if (previous0) {
-			unsigned n0 = charnum;
-			while ((bitStream & 0xFFFF) == 0xFFFF) {
-				n0 += 24;
-				if (ip < iend - 5) {
-					ip += 2;
-					bitStream = ZSTD_readLE32(ip) >> bitCount;
-				} else {
-					bitStream >>= 16;
-					bitCount += 16;
-				}
-			}
-			while ((bitStream & 3) == 3) {
-				n0 += 3;
-				bitStream >>= 2;
-				bitCount += 2;
-			}
-			n0 += bitStream & 3;
-			bitCount += 2;
-			if (n0 > *maxSVPtr)
-				return ERROR(maxSymbolValue_tooSmall);
-			while (charnum < n0)
-				normalizedCounter[charnum++] = 0;
-			if ((ip <= iend - 7) || (ip + (bitCount >> 3) <= iend - 4)) {
-				ip += bitCount >> 3;
-				bitCount &= 7;
-				bitStream = ZSTD_readLE32(ip) >> bitCount;
-			} else {
-				bitStream >>= 2;
-			}
-		}
-		{
-			int const max = (2 * threshold - 1) - remaining;
-			int count;
-
-			if ((bitStream & (threshold - 1)) < (U32)max) {
-				count = bitStream & (threshold - 1);
-				bitCount += nbBits - 1;
-			} else {
-				count = bitStream & (2 * threshold - 1);
-				if (count >= threshold)
-					count -= max;
-				bitCount += nbBits;
-			}
-
-			count--;				 /* extra accuracy */
-			remaining -= count < 0 ? -count : count; /* -1 means +1 */
-			normalizedCounter[charnum++] = (short)count;
-			previous0 = !count;
-			while (remaining < threshold) {
-				nbBits--;
-				threshold >>= 1;
-			}
-
-			if ((ip <= iend - 7) || (ip + (bitCount >> 3) <= iend - 4)) {
-				ip += bitCount >> 3;
-				bitCount &= 7;
-			} else {
-				bitCount -= (int)(8 * (iend - 4 - ip));
-				ip = iend - 4;
-			}
-			bitStream = ZSTD_readLE32(ip) >> (bitCount & 31);
-		}
-	} /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
-	if (remaining != 1)
-		return ERROR(corruption_detected);
-	if (bitCount > 32)
-		return ERROR(corruption_detected);
-	*maxSVPtr = charnum - 1;
-
-	ip += (bitCount + 7) >> 3;
-	return ip - istart;
-}
-
-/*! HUF_readStats() :
-	Read compact Huffman tree, saved by HUF_writeCTable().
-	`huffWeight` is destination buffer.
-	`rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
-	@return : size read from `src` , or an error Code .
-	Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
-*/
-size_t HUF_readStats_wksp(BYTE *huffWeight, size_t hwSize, U32 *rankStats, U32 *nbSymbolsPtr, U32 *tableLogPtr, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-{
-	U32 weightTotal;
-	const BYTE *ip = (const BYTE *)src;
-	size_t iSize;
-	size_t oSize;
-
-	if (!srcSize)
-		return ERROR(srcSize_wrong);
-	iSize = ip[0];
-	/* memset(huffWeight, 0, hwSize);   */ /* is not necessary, even though some analyzer complain ... */
-
-	if (iSize >= 128) { /* special header */
-		oSize = iSize - 127;
-		iSize = ((oSize + 1) / 2);
-		if (iSize + 1 > srcSize)
-			return ERROR(srcSize_wrong);
-		if (oSize >= hwSize)
-			return ERROR(corruption_detected);
-		ip += 1;
-		{
-			U32 n;
-			for (n = 0; n < oSize; n += 2) {
-				huffWeight[n] = ip[n / 2] >> 4;
-				huffWeight[n + 1] = ip[n / 2] & 15;
-			}
-		}
-	} else {						 /* header compressed with FSE (normal case) */
-		if (iSize + 1 > srcSize)
-			return ERROR(srcSize_wrong);
-		oSize = FSE_decompress_wksp(huffWeight, hwSize - 1, ip + 1, iSize, 6, workspace, workspaceSize); /* max (hwSize-1) values decoded, as last one is implied */
-		if (FSE_isError(oSize))
-			return oSize;
-	}
-
-	/* collect weight stats */
-	memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
-	weightTotal = 0;
-	{
-		U32 n;
-		for (n = 0; n < oSize; n++) {
-			if (huffWeight[n] >= HUF_TABLELOG_MAX)
-				return ERROR(corruption_detected);
-			rankStats[huffWeight[n]]++;
-			weightTotal += (1 << huffWeight[n]) >> 1;
-		}
-	}
-	if (weightTotal == 0)
-		return ERROR(corruption_detected);
-
-	/* get last non-null symbol weight (implied, total must be 2^n) */
-	{
-		U32 const tableLog = BIT_highbit32(weightTotal) + 1;
-		if (tableLog > HUF_TABLELOG_MAX)
-			return ERROR(corruption_detected);
-		*tableLogPtr = tableLog;
-		/* determine last weight */
-		{
-			U32 const total = 1 << tableLog;
-			U32 const rest = total - weightTotal;
-			U32 const verif = 1 << BIT_highbit32(rest);
-			U32 const lastWeight = BIT_highbit32(rest) + 1;
-			if (verif != rest)
-				return ERROR(corruption_detected); /* last value must be a clean power of 2 */
-			huffWeight[oSize] = (BYTE)lastWeight;
-			rankStats[lastWeight]++;
-		}
-	}
-
-	/* check tree construction validity */
-	if ((rankStats[1] < 2) || (rankStats[1] & 1))
-		return ERROR(corruption_detected); /* by construction : at least 2 elts of rank 1, must be even */
-
-	/* results */
-	*nbSymbolsPtr = (U32)(oSize + 1);
-	return iSize + 1;
-}
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/error_private.h b/priv/zstd/contrib/linux-kernel/lib/zstd/error_private.h
deleted file mode 100644
index 2062ff0..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/error_private.h
+++ /dev/null
@@ -1,51 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-/* Note : this module is expected to remain private, do not expose it */
-
-#ifndef ERROR_H_MODULE
-#define ERROR_H_MODULE
-
-/* ****************************************
-*  Dependencies
-******************************************/
-#include  /* size_t */
-#include   /* enum list */
-
-/* ****************************************
-*  Compiler-specific
-******************************************/
-#define ERR_STATIC static __attribute__((unused))
-
-/*-****************************************
-*  Customization (error_public.h)
-******************************************/
-typedef ZSTD_ErrorCode ERR_enum;
-#define PREFIX(name) ZSTD_error_##name
-
-/*-****************************************
-*  Error codes handling
-******************************************/
-#define ERROR(name) ((size_t)-PREFIX(name))
-
-ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
-
-ERR_STATIC ERR_enum ERR_getErrorCode(size_t code)
-{
-	if (!ERR_isError(code))
-		return (ERR_enum)0;
-	return (ERR_enum)(0 - code);
-}
-
-#endif /* ERROR_H_MODULE */
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/fse.h b/priv/zstd/contrib/linux-kernel/lib/zstd/fse.h
deleted file mode 100644
index 7460ab0..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/fse.h
+++ /dev/null
@@ -1,575 +0,0 @@
-/*
- * FSE : Finite State Entropy codec
- * Public Prototypes declaration
- * Copyright (C) 2013-2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-#ifndef FSE_H
-#define FSE_H
-
-/*-*****************************************
-*  Dependencies
-******************************************/
-#include  /* size_t, ptrdiff_t */
-
-/*-*****************************************
-*  FSE_PUBLIC_API : control library symbols visibility
-******************************************/
-#define FSE_PUBLIC_API
-
-/*------   Version   ------*/
-#define FSE_VERSION_MAJOR 0
-#define FSE_VERSION_MINOR 9
-#define FSE_VERSION_RELEASE 0
-
-#define FSE_LIB_VERSION FSE_VERSION_MAJOR.FSE_VERSION_MINOR.FSE_VERSION_RELEASE
-#define FSE_QUOTE(str) #str
-#define FSE_EXPAND_AND_QUOTE(str) FSE_QUOTE(str)
-#define FSE_VERSION_STRING FSE_EXPAND_AND_QUOTE(FSE_LIB_VERSION)
-
-#define FSE_VERSION_NUMBER (FSE_VERSION_MAJOR * 100 * 100 + FSE_VERSION_MINOR * 100 + FSE_VERSION_RELEASE)
-FSE_PUBLIC_API unsigned FSE_versionNumber(void); /**< library version number; to be used when checking dll version */
-
-/*-*****************************************
-*  Tool functions
-******************************************/
-FSE_PUBLIC_API size_t FSE_compressBound(size_t size); /* maximum compressed size */
-
-/* Error Management */
-FSE_PUBLIC_API unsigned FSE_isError(size_t code); /* tells if a return value is an error code */
-
-/*-*****************************************
-*  FSE detailed API
-******************************************/
-/*!
-FSE_compress() does the following:
-1. count symbol occurrence from source[] into table count[]
-2. normalize counters so that sum(count[]) == Power_of_2 (2^tableLog)
-3. save normalized counters to memory buffer using writeNCount()
-4. build encoding table 'CTable' from normalized counters
-5. encode the data stream using encoding table 'CTable'
-
-FSE_decompress() does the following:
-1. read normalized counters with readNCount()
-2. build decoding table 'DTable' from normalized counters
-3. decode the data stream using decoding table 'DTable'
-
-The following API allows targeting specific sub-functions for advanced tasks.
-For example, it's possible to compress several blocks using the same 'CTable',
-or to save and provide normalized distribution using external method.
-*/
-
-/* *** COMPRESSION *** */
-/*! FSE_optimalTableLog():
-	dynamically downsize 'tableLog' when conditions are met.
-	It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
-	@return : recommended tableLog (necessarily <= 'maxTableLog') */
-FSE_PUBLIC_API unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
-
-/*! FSE_normalizeCount():
-	normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
-	'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
-	@return : tableLog,
-			  or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_normalizeCount(short *normalizedCounter, unsigned tableLog, const unsigned *count, size_t srcSize, unsigned maxSymbolValue);
-
-/*! FSE_NCountWriteBound():
-	Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
-	Typically useful for allocation purpose. */
-FSE_PUBLIC_API size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog);
-
-/*! FSE_writeNCount():
-	Compactly save 'normalizedCounter' into 'buffer'.
-	@return : size of the compressed table,
-			  or an errorCode, which can be tested using FSE_isError(). */
-FSE_PUBLIC_API size_t FSE_writeNCount(void *buffer, size_t bufferSize, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
-
-/*! Constructor and Destructor of FSE_CTable.
-	Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
-typedef unsigned FSE_CTable; /* don't allocate that. It's only meant to be more restrictive than void* */
-
-/*! FSE_compress_usingCTable():
-	Compress `src` using `ct` into `dst` which must be already allocated.
-	@return : size of compressed data (<= `dstCapacity`),
-			  or 0 if compressed data could not fit into `dst`,
-			  or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_compress_usingCTable(void *dst, size_t dstCapacity, const void *src, size_t srcSize, const FSE_CTable *ct);
-
-/*!
-Tutorial :
-----------
-The first step is to count all symbols. FSE_count() does this job very fast.
-Result will be saved into 'count', a table of unsigned int, which must be already allocated, and have 'maxSymbolValuePtr[0]+1' cells.
-'src' is a table of bytes of size 'srcSize'. All values within 'src' MUST be <= maxSymbolValuePtr[0]
-maxSymbolValuePtr[0] will be updated, with its real value (necessarily <= original value)
-FSE_count() will return the number of occurrence of the most frequent symbol.
-This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
-If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
-
-The next step is to normalize the frequencies.
-FSE_normalizeCount() will ensure that sum of frequencies is == 2 ^'tableLog'.
-It also guarantees a minimum of 1 to any Symbol with frequency >= 1.
-You can use 'tableLog'==0 to mean "use default tableLog value".
-If you are unsure of which tableLog value to use, you can ask FSE_optimalTableLog(),
-which will provide the optimal valid tableLog given sourceSize, maxSymbolValue, and a user-defined maximum (0 means "default").
-
-The result of FSE_normalizeCount() will be saved into a table,
-called 'normalizedCounter', which is a table of signed short.
-'normalizedCounter' must be already allocated, and have at least 'maxSymbolValue+1' cells.
-The return value is tableLog if everything proceeded as expected.
-It is 0 if there is a single symbol within distribution.
-If there is an error (ex: invalid tableLog value), the function will return an ErrorCode (which can be tested using FSE_isError()).
-
-'normalizedCounter' can be saved in a compact manner to a memory area using FSE_writeNCount().
-'buffer' must be already allocated.
-For guaranteed success, buffer size must be at least FSE_headerBound().
-The result of the function is the number of bytes written into 'buffer'.
-If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError(); ex : buffer size too small).
-
-'normalizedCounter' can then be used to create the compression table 'CTable'.
-The space required by 'CTable' must be already allocated, using FSE_createCTable().
-You can then use FSE_buildCTable() to fill 'CTable'.
-If there is an error, both functions will return an ErrorCode (which can be tested using FSE_isError()).
-
-'CTable' can then be used to compress 'src', with FSE_compress_usingCTable().
-Similar to FSE_count(), the convention is that 'src' is assumed to be a table of char of size 'srcSize'
-The function returns the size of compressed data (without header), necessarily <= `dstCapacity`.
-If it returns '0', compressed data could not fit into 'dst'.
-If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
-*/
-
-/* *** DECOMPRESSION *** */
-
-/*! FSE_readNCount():
-	Read compactly saved 'normalizedCounter' from 'rBuffer'.
-	@return : size read from 'rBuffer',
-			  or an errorCode, which can be tested using FSE_isError().
-			  maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
-FSE_PUBLIC_API size_t FSE_readNCount(short *normalizedCounter, unsigned *maxSymbolValuePtr, unsigned *tableLogPtr, const void *rBuffer, size_t rBuffSize);
-
-/*! Constructor and Destructor of FSE_DTable.
-	Note that its size depends on 'tableLog' */
-typedef unsigned FSE_DTable; /* don't allocate that. It's just a way to be more restrictive than void* */
-
-/*! FSE_buildDTable():
-	Builds 'dt', which must be already allocated, using FSE_createDTable().
-	return : 0, or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_buildDTable_wksp(FSE_DTable *dt, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void *workspace, size_t workspaceSize);
-
-/*! FSE_decompress_usingDTable():
-	Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
-	into `dst` which must be already allocated.
-	@return : size of regenerated data (necessarily <= `dstCapacity`),
-			  or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_decompress_usingDTable(void *dst, size_t dstCapacity, const void *cSrc, size_t cSrcSize, const FSE_DTable *dt);
-
-/*!
-Tutorial :
-----------
-(Note : these functions only decompress FSE-compressed blocks.
- If block is uncompressed, use memcpy() instead
- If block is a single repeated byte, use memset() instead )
-
-The first step is to obtain the normalized frequencies of symbols.
-This can be performed by FSE_readNCount() if it was saved using FSE_writeNCount().
-'normalizedCounter' must be already allocated, and have at least 'maxSymbolValuePtr[0]+1' cells of signed short.
-In practice, that means it's necessary to know 'maxSymbolValue' beforehand,
-or size the table to handle worst case situations (typically 256).
-FSE_readNCount() will provide 'tableLog' and 'maxSymbolValue'.
-The result of FSE_readNCount() is the number of bytes read from 'rBuffer'.
-Note that 'rBufferSize' must be at least 4 bytes, even if useful information is less than that.
-If there is an error, the function will return an error code, which can be tested using FSE_isError().
-
-The next step is to build the decompression tables 'FSE_DTable' from 'normalizedCounter'.
-This is performed by the function FSE_buildDTable().
-The space required by 'FSE_DTable' must be already allocated using FSE_createDTable().
-If there is an error, the function will return an error code, which can be tested using FSE_isError().
-
-`FSE_DTable` can then be used to decompress `cSrc`, with FSE_decompress_usingDTable().
-`cSrcSize` must be strictly correct, otherwise decompression will fail.
-FSE_decompress_usingDTable() result will tell how many bytes were regenerated (<=`dstCapacity`).
-If there is an error, the function will return an error code, which can be tested using FSE_isError(). (ex: dst buffer too small)
-*/
-
-/* *** Dependency *** */
-#include "bitstream.h"
-
-/* *****************************************
-*  Static allocation
-*******************************************/
-/* FSE buffer bounds */
-#define FSE_NCOUNTBOUND 512
-#define FSE_BLOCKBOUND(size) (size + (size >> 7))
-#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size)) /* Macro version, useful for static allocation */
-
-/* It is possible to statically allocate FSE CTable/DTable as a table of FSE_CTable/FSE_DTable using below macros */
-#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) (1 + (1 << (maxTableLog - 1)) + ((maxSymbolValue + 1) * 2))
-#define FSE_DTABLE_SIZE_U32(maxTableLog) (1 + (1 << maxTableLog))
-
-/* *****************************************
-*  FSE advanced API
-*******************************************/
-/* FSE_count_wksp() :
- * Same as FSE_count(), but using an externally provided scratch buffer.
- * `workSpace` size must be table of >= `1024` unsigned
- */
-size_t FSE_count_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned *workSpace);
-
-/* FSE_countFast_wksp() :
- * Same as FSE_countFast(), but using an externally provided scratch buffer.
- * `workSpace` must be a table of minimum `1024` unsigned
- */
-size_t FSE_countFast_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize, unsigned *workSpace);
-
-/*! FSE_count_simple
- * Same as FSE_countFast(), but does not use any additional memory (not even on stack).
- * This function is unsafe, and will segfault if any value within `src` is `> *maxSymbolValuePtr` (presuming it's also the size of `count`).
-*/
-size_t FSE_count_simple(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize);
-
-unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus);
-/**< same as FSE_optimalTableLog(), which used `minus==2` */
-
-size_t FSE_buildCTable_raw(FSE_CTable *ct, unsigned nbBits);
-/**< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
-
-size_t FSE_buildCTable_rle(FSE_CTable *ct, unsigned char symbolValue);
-/**< build a fake FSE_CTable, designed to compress always the same symbolValue */
-
-/* FSE_buildCTable_wksp() :
- * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
- * `wkspSize` must be >= `(1<= BIT_DStream_completed
-
-When it's done, verify decompression is fully completed, by checking both DStream and the relevant states.
-Checking if DStream has reached its end is performed by :
-	BIT_endOfDStream(&DStream);
-Check also the states. There might be some symbols left there, if some high probability ones (>50%) are possible.
-	FSE_endOfDState(&DState);
-*/
-
-/* *****************************************
-*  FSE unsafe API
-*******************************************/
-static unsigned char FSE_decodeSymbolFast(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD);
-/* faster, but works only if nbBits is always >= 1 (otherwise, result will be corrupted) */
-
-/* *****************************************
-*  Implementation of inlined functions
-*******************************************/
-typedef struct {
-	int deltaFindState;
-	U32 deltaNbBits;
-} FSE_symbolCompressionTransform; /* total 8 bytes */
-
-ZSTD_STATIC void FSE_initCState(FSE_CState_t *statePtr, const FSE_CTable *ct)
-{
-	const void *ptr = ct;
-	const U16 *u16ptr = (const U16 *)ptr;
-	const U32 tableLog = ZSTD_read16(ptr);
-	statePtr->value = (ptrdiff_t)1 << tableLog;
-	statePtr->stateTable = u16ptr + 2;
-	statePtr->symbolTT = ((const U32 *)ct + 1 + (tableLog ? (1 << (tableLog - 1)) : 1));
-	statePtr->stateLog = tableLog;
-}
-
-/*! FSE_initCState2() :
-*   Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
-*   uses the smallest state value possible, saving the cost of this symbol */
-ZSTD_STATIC void FSE_initCState2(FSE_CState_t *statePtr, const FSE_CTable *ct, U32 symbol)
-{
-	FSE_initCState(statePtr, ct);
-	{
-		const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform *)(statePtr->symbolTT))[symbol];
-		const U16 *stateTable = (const U16 *)(statePtr->stateTable);
-		U32 nbBitsOut = (U32)((symbolTT.deltaNbBits + (1 << 15)) >> 16);
-		statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
-		statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-	}
-}
-
-ZSTD_STATIC void FSE_encodeSymbol(BIT_CStream_t *bitC, FSE_CState_t *statePtr, U32 symbol)
-{
-	const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform *)(statePtr->symbolTT))[symbol];
-	const U16 *const stateTable = (const U16 *)(statePtr->stateTable);
-	U32 nbBitsOut = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
-	BIT_addBits(bitC, statePtr->value, nbBitsOut);
-	statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-}
-
-ZSTD_STATIC void FSE_flushCState(BIT_CStream_t *bitC, const FSE_CState_t *statePtr)
-{
-	BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
-	BIT_flushBits(bitC);
-}
-
-/* ======    Decompression    ====== */
-
-typedef struct {
-	U16 tableLog;
-	U16 fastMode;
-} FSE_DTableHeader; /* sizeof U32 */
-
-typedef struct {
-	unsigned short newState;
-	unsigned char symbol;
-	unsigned char nbBits;
-} FSE_decode_t; /* size == U32 */
-
-ZSTD_STATIC void FSE_initDState(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD, const FSE_DTable *dt)
-{
-	const void *ptr = dt;
-	const FSE_DTableHeader *const DTableH = (const FSE_DTableHeader *)ptr;
-	DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
-	BIT_reloadDStream(bitD);
-	DStatePtr->table = dt + 1;
-}
-
-ZSTD_STATIC BYTE FSE_peekSymbol(const FSE_DState_t *DStatePtr)
-{
-	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-	return DInfo.symbol;
-}
-
-ZSTD_STATIC void FSE_updateState(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD)
-{
-	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-	U32 const nbBits = DInfo.nbBits;
-	size_t const lowBits = BIT_readBits(bitD, nbBits);
-	DStatePtr->state = DInfo.newState + lowBits;
-}
-
-ZSTD_STATIC BYTE FSE_decodeSymbol(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD)
-{
-	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-	U32 const nbBits = DInfo.nbBits;
-	BYTE const symbol = DInfo.symbol;
-	size_t const lowBits = BIT_readBits(bitD, nbBits);
-
-	DStatePtr->state = DInfo.newState + lowBits;
-	return symbol;
-}
-
-/*! FSE_decodeSymbolFast() :
-	unsafe, only works if no symbol has a probability > 50% */
-ZSTD_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t *DStatePtr, BIT_DStream_t *bitD)
-{
-	FSE_decode_t const DInfo = ((const FSE_decode_t *)(DStatePtr->table))[DStatePtr->state];
-	U32 const nbBits = DInfo.nbBits;
-	BYTE const symbol = DInfo.symbol;
-	size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
-
-	DStatePtr->state = DInfo.newState + lowBits;
-	return symbol;
-}
-
-ZSTD_STATIC unsigned FSE_endOfDState(const FSE_DState_t *DStatePtr) { return DStatePtr->state == 0; }
-
-/* **************************************************************
-*  Tuning parameters
-****************************************************************/
-/*!MEMORY_USAGE :
-*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
-*  Increasing memory usage improves compression ratio
-*  Reduced memory usage can improve speed, due to cache effect
-*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
-#ifndef FSE_MAX_MEMORY_USAGE
-#define FSE_MAX_MEMORY_USAGE 14
-#endif
-#ifndef FSE_DEFAULT_MEMORY_USAGE
-#define FSE_DEFAULT_MEMORY_USAGE 13
-#endif
-
-/*!FSE_MAX_SYMBOL_VALUE :
-*  Maximum symbol value authorized.
-*  Required for proper stack allocation */
-#ifndef FSE_MAX_SYMBOL_VALUE
-#define FSE_MAX_SYMBOL_VALUE 255
-#endif
-
-/* **************************************************************
-*  template functions type & suffix
-****************************************************************/
-#define FSE_FUNCTION_TYPE BYTE
-#define FSE_FUNCTION_EXTENSION
-#define FSE_DECODE_TYPE FSE_decode_t
-
-/* ***************************************************************
-*  Constants
-*****************************************************************/
-#define FSE_MAX_TABLELOG (FSE_MAX_MEMORY_USAGE - 2)
-#define FSE_MAX_TABLESIZE (1U << FSE_MAX_TABLELOG)
-#define FSE_MAXTABLESIZE_MASK (FSE_MAX_TABLESIZE - 1)
-#define FSE_DEFAULT_TABLELOG (FSE_DEFAULT_MEMORY_USAGE - 2)
-#define FSE_MIN_TABLELOG 5
-
-#define FSE_TABLELOG_ABSOLUTE_MAX 15
-#if FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX
-#error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
-#endif
-
-#define FSE_TABLESTEP(tableSize) ((tableSize >> 1) + (tableSize >> 3) + 3)
-
-#endif /* FSE_H */
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/fse_compress.c b/priv/zstd/contrib/linux-kernel/lib/zstd/fse_compress.c
deleted file mode 100644
index ef3d174..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/fse_compress.c
+++ /dev/null
@@ -1,795 +0,0 @@
-/*
- * FSE : Finite State Entropy encoder
- * Copyright (C) 2013-2015, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-
-/* **************************************************************
-*  Compiler specifics
-****************************************************************/
-#define FORCE_INLINE static __always_inline
-
-/* **************************************************************
-*  Includes
-****************************************************************/
-#include "bitstream.h"
-#include "fse.h"
-#include 
-#include 
-#include 
-#include  /* memcpy, memset */
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define FSE_STATIC_ASSERT(c)                                   \
-	{                                                      \
-		enum { FSE_static_assert = 1 / (int)(!!(c)) }; \
-	} /* use only *after* variable declarations */
-
-/* **************************************************************
-*  Templates
-****************************************************************/
-/*
-  designed to be included
-  for type-specific functions (template emulation in C)
-  Objective is to write these functions only once, for improved maintenance
-*/
-
-/* safety checks */
-#ifndef FSE_FUNCTION_EXTENSION
-#error "FSE_FUNCTION_EXTENSION must be defined"
-#endif
-#ifndef FSE_FUNCTION_TYPE
-#error "FSE_FUNCTION_TYPE must be defined"
-#endif
-
-/* Function names */
-#define FSE_CAT(X, Y) X##Y
-#define FSE_FUNCTION_NAME(X, Y) FSE_CAT(X, Y)
-#define FSE_TYPE_NAME(X, Y) FSE_CAT(X, Y)
-
-/* Function templates */
-
-/* FSE_buildCTable_wksp() :
- * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
- * wkspSize should be sized to handle worst case situation, which is `1<> 1 : 1);
-	FSE_symbolCompressionTransform *const symbolTT = (FSE_symbolCompressionTransform *)(FSCT);
-	U32 const step = FSE_TABLESTEP(tableSize);
-	U32 highThreshold = tableSize - 1;
-
-	U32 *cumul;
-	FSE_FUNCTION_TYPE *tableSymbol;
-	size_t spaceUsed32 = 0;
-
-	cumul = (U32 *)workspace + spaceUsed32;
-	spaceUsed32 += FSE_MAX_SYMBOL_VALUE + 2;
-	tableSymbol = (FSE_FUNCTION_TYPE *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(sizeof(FSE_FUNCTION_TYPE) * ((size_t)1 << tableLog), sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	/* CTable header */
-	tableU16[-2] = (U16)tableLog;
-	tableU16[-1] = (U16)maxSymbolValue;
-
-	/* For explanations on how to distribute symbol values over the table :
-	*  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
-
-	/* symbol start positions */
-	{
-		U32 u;
-		cumul[0] = 0;
-		for (u = 1; u <= maxSymbolValue + 1; u++) {
-			if (normalizedCounter[u - 1] == -1) { /* Low proba symbol */
-				cumul[u] = cumul[u - 1] + 1;
-				tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u - 1);
-			} else {
-				cumul[u] = cumul[u - 1] + normalizedCounter[u - 1];
-			}
-		}
-		cumul[maxSymbolValue + 1] = tableSize + 1;
-	}
-
-	/* Spread symbols */
-	{
-		U32 position = 0;
-		U32 symbol;
-		for (symbol = 0; symbol <= maxSymbolValue; symbol++) {
-			int nbOccurences;
-			for (nbOccurences = 0; nbOccurences < normalizedCounter[symbol]; nbOccurences++) {
-				tableSymbol[position] = (FSE_FUNCTION_TYPE)symbol;
-				position = (position + step) & tableMask;
-				while (position > highThreshold)
-					position = (position + step) & tableMask; /* Low proba area */
-			}
-		}
-
-		if (position != 0)
-			return ERROR(GENERIC); /* Must have gone through all positions */
-	}
-
-	/* Build table */
-	{
-		U32 u;
-		for (u = 0; u < tableSize; u++) {
-			FSE_FUNCTION_TYPE s = tableSymbol[u];	/* note : static analyzer may not understand tableSymbol is properly initialized */
-			tableU16[cumul[s]++] = (U16)(tableSize + u); /* TableU16 : sorted by symbol order; gives next state value */
-		}
-	}
-
-	/* Build Symbol Transformation Table */
-	{
-		unsigned total = 0;
-		unsigned s;
-		for (s = 0; s <= maxSymbolValue; s++) {
-			switch (normalizedCounter[s]) {
-			case 0: break;
-
-			case -1:
-			case 1:
-				symbolTT[s].deltaNbBits = (tableLog << 16) - (1 << tableLog);
-				symbolTT[s].deltaFindState = total - 1;
-				total++;
-				break;
-			default: {
-				U32 const maxBitsOut = tableLog - BIT_highbit32(normalizedCounter[s] - 1);
-				U32 const minStatePlus = normalizedCounter[s] << maxBitsOut;
-				symbolTT[s].deltaNbBits = (maxBitsOut << 16) - minStatePlus;
-				symbolTT[s].deltaFindState = total - normalizedCounter[s];
-				total += normalizedCounter[s];
-			}
-			}
-		}
-	}
-
-	return 0;
-}
-
-/*-**************************************************************
-*  FSE NCount encoding-decoding
-****************************************************************/
-size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog)
-{
-	size_t const maxHeaderSize = (((maxSymbolValue + 1) * tableLog) >> 3) + 3;
-	return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND; /* maxSymbolValue==0 ? use default */
-}
-
-static size_t FSE_writeNCount_generic(void *header, size_t headerBufferSize, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
-				      unsigned writeIsSafe)
-{
-	BYTE *const ostart = (BYTE *)header;
-	BYTE *out = ostart;
-	BYTE *const oend = ostart + headerBufferSize;
-	int nbBits;
-	const int tableSize = 1 << tableLog;
-	int remaining;
-	int threshold;
-	U32 bitStream;
-	int bitCount;
-	unsigned charnum = 0;
-	int previous0 = 0;
-
-	bitStream = 0;
-	bitCount = 0;
-	/* Table Size */
-	bitStream += (tableLog - FSE_MIN_TABLELOG) << bitCount;
-	bitCount += 4;
-
-	/* Init */
-	remaining = tableSize + 1; /* +1 for extra accuracy */
-	threshold = tableSize;
-	nbBits = tableLog + 1;
-
-	while (remaining > 1) { /* stops at 1 */
-		if (previous0) {
-			unsigned start = charnum;
-			while (!normalizedCounter[charnum])
-				charnum++;
-			while (charnum >= start + 24) {
-				start += 24;
-				bitStream += 0xFFFFU << bitCount;
-				if ((!writeIsSafe) && (out > oend - 2))
-					return ERROR(dstSize_tooSmall); /* Buffer overflow */
-				out[0] = (BYTE)bitStream;
-				out[1] = (BYTE)(bitStream >> 8);
-				out += 2;
-				bitStream >>= 16;
-			}
-			while (charnum >= start + 3) {
-				start += 3;
-				bitStream += 3 << bitCount;
-				bitCount += 2;
-			}
-			bitStream += (charnum - start) << bitCount;
-			bitCount += 2;
-			if (bitCount > 16) {
-				if ((!writeIsSafe) && (out > oend - 2))
-					return ERROR(dstSize_tooSmall); /* Buffer overflow */
-				out[0] = (BYTE)bitStream;
-				out[1] = (BYTE)(bitStream >> 8);
-				out += 2;
-				bitStream >>= 16;
-				bitCount -= 16;
-			}
-		}
-		{
-			int count = normalizedCounter[charnum++];
-			int const max = (2 * threshold - 1) - remaining;
-			remaining -= count < 0 ? -count : count;
-			count++; /* +1 for extra accuracy */
-			if (count >= threshold)
-				count += max; /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
-			bitStream += count << bitCount;
-			bitCount += nbBits;
-			bitCount -= (count < max);
-			previous0 = (count == 1);
-			if (remaining < 1)
-				return ERROR(GENERIC);
-			while (remaining < threshold)
-				nbBits--, threshold >>= 1;
-		}
-		if (bitCount > 16) {
-			if ((!writeIsSafe) && (out > oend - 2))
-				return ERROR(dstSize_tooSmall); /* Buffer overflow */
-			out[0] = (BYTE)bitStream;
-			out[1] = (BYTE)(bitStream >> 8);
-			out += 2;
-			bitStream >>= 16;
-			bitCount -= 16;
-		}
-	}
-
-	/* flush remaining bitStream */
-	if ((!writeIsSafe) && (out > oend - 2))
-		return ERROR(dstSize_tooSmall); /* Buffer overflow */
-	out[0] = (BYTE)bitStream;
-	out[1] = (BYTE)(bitStream >> 8);
-	out += (bitCount + 7) / 8;
-
-	if (charnum > maxSymbolValue + 1)
-		return ERROR(GENERIC);
-
-	return (out - ostart);
-}
-
-size_t FSE_writeNCount(void *buffer, size_t bufferSize, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-{
-	if (tableLog > FSE_MAX_TABLELOG)
-		return ERROR(tableLog_tooLarge); /* Unsupported */
-	if (tableLog < FSE_MIN_TABLELOG)
-		return ERROR(GENERIC); /* Unsupported */
-
-	if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
-		return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
-
-	return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);
-}
-
-/*-**************************************************************
-*  Counting histogram
-****************************************************************/
-/*! FSE_count_simple
-	This function counts byte values within `src`, and store the histogram into table `count`.
-	It doesn't use any additional memory.
-	But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.
-	For this reason, prefer using a table `count` with 256 elements.
-	@return : count of most numerous element
-*/
-size_t FSE_count_simple(unsigned *count, unsigned *maxSymbolValuePtr, const void *src, size_t srcSize)
-{
-	const BYTE *ip = (const BYTE *)src;
-	const BYTE *const end = ip + srcSize;
-	unsigned maxSymbolValue = *maxSymbolValuePtr;
-	unsigned max = 0;
-
-	memset(count, 0, (maxSymbolValue + 1) * sizeof(*count));
-	if (srcSize == 0) {
-		*maxSymbolValuePtr = 0;
-		return 0;
-	}
-
-	while (ip < end)
-		count[*ip++]++;
-
-	while (!count[maxSymbolValue])
-		maxSymbolValue--;
-	*maxSymbolValuePtr = maxSymbolValue;
-
-	{
-		U32 s;
-		for (s = 0; s <= maxSymbolValue; s++)
-			if (count[s] > max)
-				max = count[s];
-	}
-
-	return (size_t)max;
-}
-
-/* FSE_count_parallel_wksp() :
- * Same as FSE_count_parallel(), but using an externally provided scratch buffer.
- * `workSpace` size must be a minimum of `1024 * sizeof(unsigned)`` */
-static size_t FSE_count_parallel_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned checkMax,
-				      unsigned *const workSpace)
-{
-	const BYTE *ip = (const BYTE *)source;
-	const BYTE *const iend = ip + sourceSize;
-	unsigned maxSymbolValue = *maxSymbolValuePtr;
-	unsigned max = 0;
-	U32 *const Counting1 = workSpace;
-	U32 *const Counting2 = Counting1 + 256;
-	U32 *const Counting3 = Counting2 + 256;
-	U32 *const Counting4 = Counting3 + 256;
-
-	memset(Counting1, 0, 4 * 256 * sizeof(unsigned));
-
-	/* safety checks */
-	if (!sourceSize) {
-		memset(count, 0, maxSymbolValue + 1);
-		*maxSymbolValuePtr = 0;
-		return 0;
-	}
-	if (!maxSymbolValue)
-		maxSymbolValue = 255; /* 0 == default */
-
-	/* by stripes of 16 bytes */
-	{
-		U32 cached = ZSTD_read32(ip);
-		ip += 4;
-		while (ip < iend - 15) {
-			U32 c = cached;
-			cached = ZSTD_read32(ip);
-			ip += 4;
-			Counting1[(BYTE)c]++;
-			Counting2[(BYTE)(c >> 8)]++;
-			Counting3[(BYTE)(c >> 16)]++;
-			Counting4[c >> 24]++;
-			c = cached;
-			cached = ZSTD_read32(ip);
-			ip += 4;
-			Counting1[(BYTE)c]++;
-			Counting2[(BYTE)(c >> 8)]++;
-			Counting3[(BYTE)(c >> 16)]++;
-			Counting4[c >> 24]++;
-			c = cached;
-			cached = ZSTD_read32(ip);
-			ip += 4;
-			Counting1[(BYTE)c]++;
-			Counting2[(BYTE)(c >> 8)]++;
-			Counting3[(BYTE)(c >> 16)]++;
-			Counting4[c >> 24]++;
-			c = cached;
-			cached = ZSTD_read32(ip);
-			ip += 4;
-			Counting1[(BYTE)c]++;
-			Counting2[(BYTE)(c >> 8)]++;
-			Counting3[(BYTE)(c >> 16)]++;
-			Counting4[c >> 24]++;
-		}
-		ip -= 4;
-	}
-
-	/* finish last symbols */
-	while (ip < iend)
-		Counting1[*ip++]++;
-
-	if (checkMax) { /* verify stats will fit into destination table */
-		U32 s;
-		for (s = 255; s > maxSymbolValue; s--) {
-			Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
-			if (Counting1[s])
-				return ERROR(maxSymbolValue_tooSmall);
-		}
-	}
-
-	{
-		U32 s;
-		for (s = 0; s <= maxSymbolValue; s++) {
-			count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
-			if (count[s] > max)
-				max = count[s];
-		}
-	}
-
-	while (!count[maxSymbolValue])
-		maxSymbolValue--;
-	*maxSymbolValuePtr = maxSymbolValue;
-	return (size_t)max;
-}
-
-/* FSE_countFast_wksp() :
- * Same as FSE_countFast(), but using an externally provided scratch buffer.
- * `workSpace` size must be table of >= `1024` unsigned */
-size_t FSE_countFast_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned *workSpace)
-{
-	if (sourceSize < 1500)
-		return FSE_count_simple(count, maxSymbolValuePtr, source, sourceSize);
-	return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
-}
-
-/* FSE_count_wksp() :
- * Same as FSE_count(), but using an externally provided scratch buffer.
- * `workSpace` size must be table of >= `1024` unsigned */
-size_t FSE_count_wksp(unsigned *count, unsigned *maxSymbolValuePtr, const void *source, size_t sourceSize, unsigned *workSpace)
-{
-	if (*maxSymbolValuePtr < 255)
-		return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 1, workSpace);
-	*maxSymbolValuePtr = 255;
-	return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
-}
-
-/*-**************************************************************
-*  FSE Compression Code
-****************************************************************/
-/*! FSE_sizeof_CTable() :
-	FSE_CTable is a variable size structure which contains :
-	`U16 tableLog;`
-	`U16 maxSymbolValue;`
-	`U16 nextStateNumber[1 << tableLog];`                         // This size is variable
-	`FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable
-Allocation is manual (C standard does not support variable-size structures).
-*/
-size_t FSE_sizeof_CTable(unsigned maxSymbolValue, unsigned tableLog)
-{
-	if (tableLog > FSE_MAX_TABLELOG)
-		return ERROR(tableLog_tooLarge);
-	return FSE_CTABLE_SIZE_U32(tableLog, maxSymbolValue) * sizeof(U32);
-}
-
-/* provides the minimum logSize to safely represent a distribution */
-static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
-{
-	U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
-	U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
-	U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
-	return minBits;
-}
-
-unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
-{
-	U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
-	U32 tableLog = maxTableLog;
-	U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
-	if (tableLog == 0)
-		tableLog = FSE_DEFAULT_TABLELOG;
-	if (maxBitsSrc < tableLog)
-		tableLog = maxBitsSrc; /* Accuracy can be reduced */
-	if (minBits > tableLog)
-		tableLog = minBits; /* Need a minimum to safely represent all symbol values */
-	if (tableLog < FSE_MIN_TABLELOG)
-		tableLog = FSE_MIN_TABLELOG;
-	if (tableLog > FSE_MAX_TABLELOG)
-		tableLog = FSE_MAX_TABLELOG;
-	return tableLog;
-}
-
-unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
-{
-	return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
-}
-
-/* Secondary normalization method.
-   To be used when primary method fails. */
-
-static size_t FSE_normalizeM2(short *norm, U32 tableLog, const unsigned *count, size_t total, U32 maxSymbolValue)
-{
-	short const NOT_YET_ASSIGNED = -2;
-	U32 s;
-	U32 distributed = 0;
-	U32 ToDistribute;
-
-	/* Init */
-	U32 const lowThreshold = (U32)(total >> tableLog);
-	U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
-
-	for (s = 0; s <= maxSymbolValue; s++) {
-		if (count[s] == 0) {
-			norm[s] = 0;
-			continue;
-		}
-		if (count[s] <= lowThreshold) {
-			norm[s] = -1;
-			distributed++;
-			total -= count[s];
-			continue;
-		}
-		if (count[s] <= lowOne) {
-			norm[s] = 1;
-			distributed++;
-			total -= count[s];
-			continue;
-		}
-
-		norm[s] = NOT_YET_ASSIGNED;
-	}
-	ToDistribute = (1 << tableLog) - distributed;
-
-	if ((total / ToDistribute) > lowOne) {
-		/* risk of rounding to zero */
-		lowOne = (U32)((total * 3) / (ToDistribute * 2));
-		for (s = 0; s <= maxSymbolValue; s++) {
-			if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
-				norm[s] = 1;
-				distributed++;
-				total -= count[s];
-				continue;
-			}
-		}
-		ToDistribute = (1 << tableLog) - distributed;
-	}
-
-	if (distributed == maxSymbolValue + 1) {
-		/* all values are pretty poor;
-		   probably incompressible data (should have already been detected);
-		   find max, then give all remaining points to max */
-		U32 maxV = 0, maxC = 0;
-		for (s = 0; s <= maxSymbolValue; s++)
-			if (count[s] > maxC)
-				maxV = s, maxC = count[s];
-		norm[maxV] += (short)ToDistribute;
-		return 0;
-	}
-
-	if (total == 0) {
-		/* all of the symbols were low enough for the lowOne or lowThreshold */
-		for (s = 0; ToDistribute > 0; s = (s + 1) % (maxSymbolValue + 1))
-			if (norm[s] > 0)
-				ToDistribute--, norm[s]++;
-		return 0;
-	}
-
-	{
-		U64 const vStepLog = 62 - tableLog;
-		U64 const mid = (1ULL << (vStepLog - 1)) - 1;
-		U64 const rStep = div_u64((((U64)1 << vStepLog) * ToDistribute) + mid, (U32)total); /* scale on remaining */
-		U64 tmpTotal = mid;
-		for (s = 0; s <= maxSymbolValue; s++) {
-			if (norm[s] == NOT_YET_ASSIGNED) {
-				U64 const end = tmpTotal + (count[s] * rStep);
-				U32 const sStart = (U32)(tmpTotal >> vStepLog);
-				U32 const sEnd = (U32)(end >> vStepLog);
-				U32 const weight = sEnd - sStart;
-				if (weight < 1)
-					return ERROR(GENERIC);
-				norm[s] = (short)weight;
-				tmpTotal = end;
-			}
-		}
-	}
-
-	return 0;
-}
-
-size_t FSE_normalizeCount(short *normalizedCounter, unsigned tableLog, const unsigned *count, size_t total, unsigned maxSymbolValue)
-{
-	/* Sanity checks */
-	if (tableLog == 0)
-		tableLog = FSE_DEFAULT_TABLELOG;
-	if (tableLog < FSE_MIN_TABLELOG)
-		return ERROR(GENERIC); /* Unsupported size */
-	if (tableLog > FSE_MAX_TABLELOG)
-		return ERROR(tableLog_tooLarge); /* Unsupported size */
-	if (tableLog < FSE_minTableLog(total, maxSymbolValue))
-		return ERROR(GENERIC); /* Too small tableLog, compression potentially impossible */
-
-	{
-		U32 const rtbTable[] = {0, 473195, 504333, 520860, 550000, 700000, 750000, 830000};
-		U64 const scale = 62 - tableLog;
-		U64 const step = div_u64((U64)1 << 62, (U32)total); /* <== here, one division ! */
-		U64 const vStep = 1ULL << (scale - 20);
-		int stillToDistribute = 1 << tableLog;
-		unsigned s;
-		unsigned largest = 0;
-		short largestP = 0;
-		U32 lowThreshold = (U32)(total >> tableLog);
-
-		for (s = 0; s <= maxSymbolValue; s++) {
-			if (count[s] == total)
-				return 0; /* rle special case */
-			if (count[s] == 0) {
-				normalizedCounter[s] = 0;
-				continue;
-			}
-			if (count[s] <= lowThreshold) {
-				normalizedCounter[s] = -1;
-				stillToDistribute--;
-			} else {
-				short proba = (short)((count[s] * step) >> scale);
-				if (proba < 8) {
-					U64 restToBeat = vStep * rtbTable[proba];
-					proba += (count[s] * step) - ((U64)proba << scale) > restToBeat;
-				}
-				if (proba > largestP)
-					largestP = proba, largest = s;
-				normalizedCounter[s] = proba;
-				stillToDistribute -= proba;
-			}
-		}
-		if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
-			/* corner case, need another normalization method */
-			size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
-			if (FSE_isError(errorCode))
-				return errorCode;
-		} else
-			normalizedCounter[largest] += (short)stillToDistribute;
-	}
-
-	return tableLog;
-}
-
-/* fake FSE_CTable, for raw (uncompressed) input */
-size_t FSE_buildCTable_raw(FSE_CTable *ct, unsigned nbBits)
-{
-	const unsigned tableSize = 1 << nbBits;
-	const unsigned tableMask = tableSize - 1;
-	const unsigned maxSymbolValue = tableMask;
-	void *const ptr = ct;
-	U16 *const tableU16 = ((U16 *)ptr) + 2;
-	void *const FSCT = ((U32 *)ptr) + 1 /* header */ + (tableSize >> 1); /* assumption : tableLog >= 1 */
-	FSE_symbolCompressionTransform *const symbolTT = (FSE_symbolCompressionTransform *)(FSCT);
-	unsigned s;
-
-	/* Sanity checks */
-	if (nbBits < 1)
-		return ERROR(GENERIC); /* min size */
-
-	/* header */
-	tableU16[-2] = (U16)nbBits;
-	tableU16[-1] = (U16)maxSymbolValue;
-
-	/* Build table */
-	for (s = 0; s < tableSize; s++)
-		tableU16[s] = (U16)(tableSize + s);
-
-	/* Build Symbol Transformation Table */
-	{
-		const U32 deltaNbBits = (nbBits << 16) - (1 << nbBits);
-		for (s = 0; s <= maxSymbolValue; s++) {
-			symbolTT[s].deltaNbBits = deltaNbBits;
-			symbolTT[s].deltaFindState = s - 1;
-		}
-	}
-
-	return 0;
-}
-
-/* fake FSE_CTable, for rle input (always same symbol) */
-size_t FSE_buildCTable_rle(FSE_CTable *ct, BYTE symbolValue)
-{
-	void *ptr = ct;
-	U16 *tableU16 = ((U16 *)ptr) + 2;
-	void *FSCTptr = (U32 *)ptr + 2;
-	FSE_symbolCompressionTransform *symbolTT = (FSE_symbolCompressionTransform *)FSCTptr;
-
-	/* header */
-	tableU16[-2] = (U16)0;
-	tableU16[-1] = (U16)symbolValue;
-
-	/* Build table */
-	tableU16[0] = 0;
-	tableU16[1] = 0; /* just in case */
-
-	/* Build Symbol Transformation Table */
-	symbolTT[symbolValue].deltaNbBits = 0;
-	symbolTT[symbolValue].deltaFindState = 0;
-
-	return 0;
-}
-
-static size_t FSE_compress_usingCTable_generic(void *dst, size_t dstSize, const void *src, size_t srcSize, const FSE_CTable *ct, const unsigned fast)
-{
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *ip = iend;
-
-	BIT_CStream_t bitC;
-	FSE_CState_t CState1, CState2;
-
-	/* init */
-	if (srcSize <= 2)
-		return 0;
-	{
-		size_t const initError = BIT_initCStream(&bitC, dst, dstSize);
-		if (FSE_isError(initError))
-			return 0; /* not enough space available to write a bitstream */
-	}
-
-#define FSE_FLUSHBITS(s) (fast ? BIT_flushBitsFast(s) : BIT_flushBits(s))
-
-	if (srcSize & 1) {
-		FSE_initCState2(&CState1, ct, *--ip);
-		FSE_initCState2(&CState2, ct, *--ip);
-		FSE_encodeSymbol(&bitC, &CState1, *--ip);
-		FSE_FLUSHBITS(&bitC);
-	} else {
-		FSE_initCState2(&CState2, ct, *--ip);
-		FSE_initCState2(&CState1, ct, *--ip);
-	}
-
-	/* join to mod 4 */
-	srcSize -= 2;
-	if ((sizeof(bitC.bitContainer) * 8 > FSE_MAX_TABLELOG * 4 + 7) && (srcSize & 2)) { /* test bit 2 */
-		FSE_encodeSymbol(&bitC, &CState2, *--ip);
-		FSE_encodeSymbol(&bitC, &CState1, *--ip);
-		FSE_FLUSHBITS(&bitC);
-	}
-
-	/* 2 or 4 encoding per loop */
-	while (ip > istart) {
-
-		FSE_encodeSymbol(&bitC, &CState2, *--ip);
-
-		if (sizeof(bitC.bitContainer) * 8 < FSE_MAX_TABLELOG * 2 + 7) /* this test must be static */
-			FSE_FLUSHBITS(&bitC);
-
-		FSE_encodeSymbol(&bitC, &CState1, *--ip);
-
-		if (sizeof(bitC.bitContainer) * 8 > FSE_MAX_TABLELOG * 4 + 7) { /* this test must be static */
-			FSE_encodeSymbol(&bitC, &CState2, *--ip);
-			FSE_encodeSymbol(&bitC, &CState1, *--ip);
-		}
-
-		FSE_FLUSHBITS(&bitC);
-	}
-
-	FSE_flushCState(&bitC, &CState2);
-	FSE_flushCState(&bitC, &CState1);
-	return BIT_closeCStream(&bitC);
-}
-
-size_t FSE_compress_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const FSE_CTable *ct)
-{
-	unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
-
-	if (fast)
-		return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
-	else
-		return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
-}
-
-size_t FSE_compressBound(size_t size) { return FSE_COMPRESSBOUND(size); }
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/fse_decompress.c b/priv/zstd/contrib/linux-kernel/lib/zstd/fse_decompress.c
deleted file mode 100644
index a84300e..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/fse_decompress.c
+++ /dev/null
@@ -1,332 +0,0 @@
-/*
- * FSE : Finite State Entropy decoder
- * Copyright (C) 2013-2015, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-
-/* **************************************************************
-*  Compiler specifics
-****************************************************************/
-#define FORCE_INLINE static __always_inline
-
-/* **************************************************************
-*  Includes
-****************************************************************/
-#include "bitstream.h"
-#include "fse.h"
-#include 
-#include 
-#include  /* memcpy, memset */
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define FSE_isError ERR_isError
-#define FSE_STATIC_ASSERT(c)                                   \
-	{                                                      \
-		enum { FSE_static_assert = 1 / (int)(!!(c)) }; \
-	} /* use only *after* variable declarations */
-
-/* check and forward error code */
-#define CHECK_F(f)                  \
-	{                           \
-		size_t const e = f; \
-		if (FSE_isError(e)) \
-			return e;   \
-	}
-
-/* **************************************************************
-*  Templates
-****************************************************************/
-/*
-  designed to be included
-  for type-specific functions (template emulation in C)
-  Objective is to write these functions only once, for improved maintenance
-*/
-
-/* safety checks */
-#ifndef FSE_FUNCTION_EXTENSION
-#error "FSE_FUNCTION_EXTENSION must be defined"
-#endif
-#ifndef FSE_FUNCTION_TYPE
-#error "FSE_FUNCTION_TYPE must be defined"
-#endif
-
-/* Function names */
-#define FSE_CAT(X, Y) X##Y
-#define FSE_FUNCTION_NAME(X, Y) FSE_CAT(X, Y)
-#define FSE_TYPE_NAME(X, Y) FSE_CAT(X, Y)
-
-/* Function templates */
-
-size_t FSE_buildDTable_wksp(FSE_DTable *dt, const short *normalizedCounter, unsigned maxSymbolValue, unsigned tableLog, void *workspace, size_t workspaceSize)
-{
-	void *const tdPtr = dt + 1; /* because *dt is unsigned, 32-bits aligned on 32-bits */
-	FSE_DECODE_TYPE *const tableDecode = (FSE_DECODE_TYPE *)(tdPtr);
-	U16 *symbolNext = (U16 *)workspace;
-
-	U32 const maxSV1 = maxSymbolValue + 1;
-	U32 const tableSize = 1 << tableLog;
-	U32 highThreshold = tableSize - 1;
-
-	/* Sanity Checks */
-	if (workspaceSize < sizeof(U16) * (FSE_MAX_SYMBOL_VALUE + 1))
-		return ERROR(tableLog_tooLarge);
-	if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE)
-		return ERROR(maxSymbolValue_tooLarge);
-	if (tableLog > FSE_MAX_TABLELOG)
-		return ERROR(tableLog_tooLarge);
-
-	/* Init, lay down lowprob symbols */
-	{
-		FSE_DTableHeader DTableH;
-		DTableH.tableLog = (U16)tableLog;
-		DTableH.fastMode = 1;
-		{
-			S16 const largeLimit = (S16)(1 << (tableLog - 1));
-			U32 s;
-			for (s = 0; s < maxSV1; s++) {
-				if (normalizedCounter[s] == -1) {
-					tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
-					symbolNext[s] = 1;
-				} else {
-					if (normalizedCounter[s] >= largeLimit)
-						DTableH.fastMode = 0;
-					symbolNext[s] = normalizedCounter[s];
-				}
-			}
-		}
-		memcpy(dt, &DTableH, sizeof(DTableH));
-	}
-
-	/* Spread symbols */
-	{
-		U32 const tableMask = tableSize - 1;
-		U32 const step = FSE_TABLESTEP(tableSize);
-		U32 s, position = 0;
-		for (s = 0; s < maxSV1; s++) {
-			int i;
-			for (i = 0; i < normalizedCounter[s]; i++) {
-				tableDecode[position].symbol = (FSE_FUNCTION_TYPE)s;
-				position = (position + step) & tableMask;
-				while (position > highThreshold)
-					position = (position + step) & tableMask; /* lowprob area */
-			}
-		}
-		if (position != 0)
-			return ERROR(GENERIC); /* position must reach all cells once, otherwise normalizedCounter is incorrect */
-	}
-
-	/* Build Decoding table */
-	{
-		U32 u;
-		for (u = 0; u < tableSize; u++) {
-			FSE_FUNCTION_TYPE const symbol = (FSE_FUNCTION_TYPE)(tableDecode[u].symbol);
-			U16 nextState = symbolNext[symbol]++;
-			tableDecode[u].nbBits = (BYTE)(tableLog - BIT_highbit32((U32)nextState));
-			tableDecode[u].newState = (U16)((nextState << tableDecode[u].nbBits) - tableSize);
-		}
-	}
-
-	return 0;
-}
-
-/*-*******************************************************
-*  Decompression (Byte symbols)
-*********************************************************/
-size_t FSE_buildDTable_rle(FSE_DTable *dt, BYTE symbolValue)
-{
-	void *ptr = dt;
-	FSE_DTableHeader *const DTableH = (FSE_DTableHeader *)ptr;
-	void *dPtr = dt + 1;
-	FSE_decode_t *const cell = (FSE_decode_t *)dPtr;
-
-	DTableH->tableLog = 0;
-	DTableH->fastMode = 0;
-
-	cell->newState = 0;
-	cell->symbol = symbolValue;
-	cell->nbBits = 0;
-
-	return 0;
-}
-
-size_t FSE_buildDTable_raw(FSE_DTable *dt, unsigned nbBits)
-{
-	void *ptr = dt;
-	FSE_DTableHeader *const DTableH = (FSE_DTableHeader *)ptr;
-	void *dPtr = dt + 1;
-	FSE_decode_t *const dinfo = (FSE_decode_t *)dPtr;
-	const unsigned tableSize = 1 << nbBits;
-	const unsigned tableMask = tableSize - 1;
-	const unsigned maxSV1 = tableMask + 1;
-	unsigned s;
-
-	/* Sanity checks */
-	if (nbBits < 1)
-		return ERROR(GENERIC); /* min size */
-
-	/* Build Decoding Table */
-	DTableH->tableLog = (U16)nbBits;
-	DTableH->fastMode = 1;
-	for (s = 0; s < maxSV1; s++) {
-		dinfo[s].newState = 0;
-		dinfo[s].symbol = (BYTE)s;
-		dinfo[s].nbBits = (BYTE)nbBits;
-	}
-
-	return 0;
-}
-
-FORCE_INLINE size_t FSE_decompress_usingDTable_generic(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const FSE_DTable *dt,
-						       const unsigned fast)
-{
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *op = ostart;
-	BYTE *const omax = op + maxDstSize;
-	BYTE *const olimit = omax - 3;
-
-	BIT_DStream_t bitD;
-	FSE_DState_t state1;
-	FSE_DState_t state2;
-
-	/* Init */
-	CHECK_F(BIT_initDStream(&bitD, cSrc, cSrcSize));
-
-	FSE_initDState(&state1, &bitD, dt);
-	FSE_initDState(&state2, &bitD, dt);
-
-#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
-
-	/* 4 symbols per loop */
-	for (; (BIT_reloadDStream(&bitD) == BIT_DStream_unfinished) & (op < olimit); op += 4) {
-		op[0] = FSE_GETSYMBOL(&state1);
-
-		if (FSE_MAX_TABLELOG * 2 + 7 > sizeof(bitD.bitContainer) * 8) /* This test must be static */
-			BIT_reloadDStream(&bitD);
-
-		op[1] = FSE_GETSYMBOL(&state2);
-
-		if (FSE_MAX_TABLELOG * 4 + 7 > sizeof(bitD.bitContainer) * 8) /* This test must be static */
-		{
-			if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) {
-				op += 2;
-				break;
-			}
-		}
-
-		op[2] = FSE_GETSYMBOL(&state1);
-
-		if (FSE_MAX_TABLELOG * 2 + 7 > sizeof(bitD.bitContainer) * 8) /* This test must be static */
-			BIT_reloadDStream(&bitD);
-
-		op[3] = FSE_GETSYMBOL(&state2);
-	}
-
-	/* tail */
-	/* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
-	while (1) {
-		if (op > (omax - 2))
-			return ERROR(dstSize_tooSmall);
-		*op++ = FSE_GETSYMBOL(&state1);
-		if (BIT_reloadDStream(&bitD) == BIT_DStream_overflow) {
-			*op++ = FSE_GETSYMBOL(&state2);
-			break;
-		}
-
-		if (op > (omax - 2))
-			return ERROR(dstSize_tooSmall);
-		*op++ = FSE_GETSYMBOL(&state2);
-		if (BIT_reloadDStream(&bitD) == BIT_DStream_overflow) {
-			*op++ = FSE_GETSYMBOL(&state1);
-			break;
-		}
-	}
-
-	return op - ostart;
-}
-
-size_t FSE_decompress_usingDTable(void *dst, size_t originalSize, const void *cSrc, size_t cSrcSize, const FSE_DTable *dt)
-{
-	const void *ptr = dt;
-	const FSE_DTableHeader *DTableH = (const FSE_DTableHeader *)ptr;
-	const U32 fastMode = DTableH->fastMode;
-
-	/* select fast mode (static) */
-	if (fastMode)
-		return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
-	return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
-}
-
-size_t FSE_decompress_wksp(void *dst, size_t dstCapacity, const void *cSrc, size_t cSrcSize, unsigned maxLog, void *workspace, size_t workspaceSize)
-{
-	const BYTE *const istart = (const BYTE *)cSrc;
-	const BYTE *ip = istart;
-	unsigned tableLog;
-	unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
-	size_t NCountLength;
-
-	FSE_DTable *dt;
-	short *counting;
-	size_t spaceUsed32 = 0;
-
-	FSE_STATIC_ASSERT(sizeof(FSE_DTable) == sizeof(U32));
-
-	dt = (FSE_DTable *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += FSE_DTABLE_SIZE_U32(maxLog);
-	counting = (short *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(sizeof(short) * (FSE_MAX_SYMBOL_VALUE + 1), sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	/* normal FSE decoding mode */
-	NCountLength = FSE_readNCount(counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
-	if (FSE_isError(NCountLength))
-		return NCountLength;
-	// if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size; supposed to be already checked in NCountLength, only remaining
-	// case : NCountLength==cSrcSize */
-	if (tableLog > maxLog)
-		return ERROR(tableLog_tooLarge);
-	ip += NCountLength;
-	cSrcSize -= NCountLength;
-
-	CHECK_F(FSE_buildDTable_wksp(dt, counting, maxSymbolValue, tableLog, workspace, workspaceSize));
-
-	return FSE_decompress_usingDTable(dst, dstCapacity, ip, cSrcSize, dt); /* always return, even if it is an error code */
-}
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/huf.h b/priv/zstd/contrib/linux-kernel/lib/zstd/huf.h
deleted file mode 100644
index 2143da2..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/huf.h
+++ /dev/null
@@ -1,212 +0,0 @@
-/*
- * Huffman coder, part of New Generation Entropy library
- * header file
- * Copyright (C) 2013-2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-#ifndef HUF_H_298734234
-#define HUF_H_298734234
-
-/* *** Dependencies *** */
-#include  /* size_t */
-
-/* ***   Tool functions *** */
-#define HUF_BLOCKSIZE_MAX (128 * 1024) /**< maximum input size for a single block compressed with HUF_compress */
-size_t HUF_compressBound(size_t size); /**< maximum compressed size (worst case) */
-
-/* Error Management */
-unsigned HUF_isError(size_t code); /**< tells if a return value is an error code */
-
-/* ***   Advanced function   *** */
-
-/** HUF_compress4X_wksp() :
-*   Same as HUF_compress2(), but uses externally allocated `workSpace`, which must be a table of >= 1024 unsigned */
-size_t HUF_compress4X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-			   size_t wkspSize); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-
-/* *** Dependencies *** */
-#include "mem.h" /* U32 */
-
-/* *** Constants *** */
-#define HUF_TABLELOG_MAX 12     /* max configured tableLog (for static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */
-#define HUF_TABLELOG_DEFAULT 11 /* tableLog by default, when not specified */
-#define HUF_SYMBOLVALUE_MAX 255
-
-#define HUF_TABLELOG_ABSOLUTEMAX 15 /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
-#if (HUF_TABLELOG_MAX > HUF_TABLELOG_ABSOLUTEMAX)
-#error "HUF_TABLELOG_MAX is too large !"
-#endif
-
-/* ****************************************
-*  Static allocation
-******************************************/
-/* HUF buffer bounds */
-#define HUF_CTABLEBOUND 129
-#define HUF_BLOCKBOUND(size) (size + (size >> 8) + 8)			 /* only true if incompressible pre-filtered with fast heuristic */
-#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size)) /* Macro version, useful for static allocation */
-
-/* static allocation of HUF's Compression Table */
-#define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
-	U32 name##hb[maxSymbolValue + 1];              \
-	void *name##hv = &(name##hb);                  \
-	HUF_CElt *name = (HUF_CElt *)(name##hv) /* no final ; */
-
-/* static allocation of HUF's DTable */
-typedef U32 HUF_DTable;
-#define HUF_DTABLE_SIZE(maxTableLog) (1 + (1 << (maxTableLog)))
-#define HUF_CREATE_STATIC_DTABLEX2(DTable, maxTableLog) HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = {((U32)((maxTableLog)-1) * 0x01000001)}
-#define HUF_CREATE_STATIC_DTABLEX4(DTable, maxTableLog) HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = {((U32)(maxTableLog)*0x01000001)}
-
-/* The workspace must have alignment at least 4 and be at least this large */
-#define HUF_COMPRESS_WORKSPACE_SIZE (6 << 10)
-#define HUF_COMPRESS_WORKSPACE_SIZE_U32 (HUF_COMPRESS_WORKSPACE_SIZE / sizeof(U32))
-
-/* The workspace must have alignment at least 4 and be at least this large */
-#define HUF_DECOMPRESS_WORKSPACE_SIZE (3 << 10)
-#define HUF_DECOMPRESS_WORKSPACE_SIZE_U32 (HUF_DECOMPRESS_WORKSPACE_SIZE / sizeof(U32))
-
-/* ****************************************
-*  Advanced decompression functions
-******************************************/
-size_t HUF_decompress4X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize); /**< decodes RLE and uncompressed */
-size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-				size_t workspaceSize);							       /**< considers RLE and uncompressed as errors */
-size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-				   size_t workspaceSize); /**< single-symbol decoder */
-size_t HUF_decompress4X4_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-				   size_t workspaceSize); /**< double-symbols decoder */
-
-/* ****************************************
-*  HUF detailed API
-******************************************/
-/*!
-HUF_compress() does the following:
-1. count symbol occurrence from source[] into table count[] using FSE_count()
-2. (optional) refine tableLog using HUF_optimalTableLog()
-3. build Huffman table from count using HUF_buildCTable()
-4. save Huffman table to memory buffer using HUF_writeCTable_wksp()
-5. encode the data stream using HUF_compress4X_usingCTable()
-
-The following API allows targeting specific sub-functions for advanced tasks.
-For example, it's possible to compress several blocks using the same 'CTable',
-or to save and regenerate 'CTable' using external methods.
-*/
-/* FSE_count() : find it within "fse.h" */
-unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
-typedef struct HUF_CElt_s HUF_CElt; /* incomplete type */
-size_t HUF_writeCTable_wksp(void *dst, size_t maxDstSize, const HUF_CElt *CTable, unsigned maxSymbolValue, unsigned huffLog, void *workspace, size_t workspaceSize);
-size_t HUF_compress4X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable);
-
-typedef enum {
-	HUF_repeat_none,  /**< Cannot use the previous table */
-	HUF_repeat_check, /**< Can use the previous table but it must be checked. Note : The previous table must have been constructed by HUF_compress{1,
-			     4}X_repeat */
-	HUF_repeat_valid  /**< Can use the previous table and it is asumed to be valid */
-} HUF_repeat;
-/** HUF_compress4X_repeat() :
-*   Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
-*   If it uses hufTable it does not modify hufTable or repeat.
-*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
-*   If preferRepeat then the old table will always be used if valid. */
-size_t HUF_compress4X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat,
-			     int preferRepeat); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-
-/** HUF_buildCTable_wksp() :
- *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
- *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
- */
-size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize);
-
-/*! HUF_readStats() :
-	Read compact Huffman tree, saved by HUF_writeCTable().
-	`huffWeight` is destination buffer.
-	@return : size read from `src` , or an error Code .
-	Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
-size_t HUF_readStats_wksp(BYTE *huffWeight, size_t hwSize, U32 *rankStats, U32 *nbSymbolsPtr, U32 *tableLogPtr, const void *src, size_t srcSize,
-			  void *workspace, size_t workspaceSize);
-
-/** HUF_readCTable() :
-*   Loading a CTable saved with HUF_writeCTable() */
-size_t HUF_readCTable_wksp(HUF_CElt *CTable, unsigned maxSymbolValue, const void *src, size_t srcSize, void *workspace, size_t workspaceSize);
-
-/*
-HUF_decompress() does the following:
-1. select the decompression algorithm (X2, X4) based on pre-computed heuristics
-2. build Huffman table from save, using HUF_readDTableXn()
-3. decode 1 or 4 segments in parallel using HUF_decompressSXn_usingDTable
-*/
-
-/** HUF_selectDecoder() :
-*   Tells which decoder is likely to decode faster,
-*   based on a set of pre-determined metrics.
-*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
-*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
-U32 HUF_selectDecoder(size_t dstSize, size_t cSrcSize);
-
-size_t HUF_readDTableX2_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize);
-size_t HUF_readDTableX4_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize);
-
-size_t HUF_decompress4X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-size_t HUF_decompress4X2_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-size_t HUF_decompress4X4_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-
-/* single stream variants */
-
-size_t HUF_compress1X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-			   size_t wkspSize); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-size_t HUF_compress1X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable);
-/** HUF_compress1X_repeat() :
-*   Same as HUF_compress1X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
-*   If it uses hufTable it does not modify hufTable or repeat.
-*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
-*   If preferRepeat then the old table will always be used if valid. */
-size_t HUF_compress1X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void *workSpace,
-			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat,
-			     int preferRepeat); /**< `workSpace` must be a table of at least HUF_COMPRESS_WORKSPACE_SIZE_U32 unsigned */
-
-size_t HUF_decompress1X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize);
-size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-				   size_t workspaceSize); /**< single-symbol decoder */
-size_t HUF_decompress1X4_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace,
-				   size_t workspaceSize); /**< double-symbols decoder */
-
-size_t HUF_decompress1X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize,
-				    const HUF_DTable *DTable); /**< automatic selection of sing or double symbol decoder, based on DTable */
-size_t HUF_decompress1X2_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-size_t HUF_decompress1X4_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable);
-
-#endif /* HUF_H_298734234 */
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/huf_compress.c b/priv/zstd/contrib/linux-kernel/lib/zstd/huf_compress.c
deleted file mode 100644
index 40055a7..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/huf_compress.c
+++ /dev/null
@@ -1,770 +0,0 @@
-/*
- * Huffman encoder, part of New Generation Entropy library
- * Copyright (C) 2013-2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-
-/* **************************************************************
-*  Includes
-****************************************************************/
-#include "bitstream.h"
-#include "fse.h" /* header compression */
-#include "huf.h"
-#include 
-#include  /* memcpy, memset */
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define HUF_STATIC_ASSERT(c)                                   \
-	{                                                      \
-		enum { HUF_static_assert = 1 / (int)(!!(c)) }; \
-	} /* use only *after* variable declarations */
-#define CHECK_V_F(e, f)     \
-	size_t const e = f; \
-	if (ERR_isError(e)) \
-	return f
-#define CHECK_F(f)                        \
-	{                                 \
-		CHECK_V_F(_var_err__, f); \
-	}
-
-/* **************************************************************
-*  Utils
-****************************************************************/
-unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
-{
-	return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
-}
-
-/* *******************************************************
-*  HUF : Huffman block compression
-*********************************************************/
-/* HUF_compressWeights() :
- * Same as FSE_compress(), but dedicated to huff0's weights compression.
- * The use case needs much less stack memory.
- * Note : all elements within weightTable are supposed to be <= HUF_TABLELOG_MAX.
- */
-#define MAX_FSE_TABLELOG_FOR_HUFF_HEADER 6
-size_t HUF_compressWeights_wksp(void *dst, size_t dstSize, const void *weightTable, size_t wtSize, void *workspace, size_t workspaceSize)
-{
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *op = ostart;
-	BYTE *const oend = ostart + dstSize;
-
-	U32 maxSymbolValue = HUF_TABLELOG_MAX;
-	U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
-
-	FSE_CTable *CTable;
-	U32 *count;
-	S16 *norm;
-	size_t spaceUsed32 = 0;
-
-	HUF_STATIC_ASSERT(sizeof(FSE_CTable) == sizeof(U32));
-
-	CTable = (FSE_CTable *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX);
-	count = (U32 *)workspace + spaceUsed32;
-	spaceUsed32 += HUF_TABLELOG_MAX + 1;
-	norm = (S16 *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(sizeof(S16) * (HUF_TABLELOG_MAX + 1), sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	/* init conditions */
-	if (wtSize <= 1)
-		return 0; /* Not compressible */
-
-	/* Scan input and build symbol stats */
-	{
-		CHECK_V_F(maxCount, FSE_count_simple(count, &maxSymbolValue, weightTable, wtSize));
-		if (maxCount == wtSize)
-			return 1; /* only a single symbol in src : rle */
-		if (maxCount == 1)
-			return 0; /* each symbol present maximum once => not compressible */
-	}
-
-	tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
-	CHECK_F(FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue));
-
-	/* Write table description header */
-	{
-		CHECK_V_F(hSize, FSE_writeNCount(op, oend - op, norm, maxSymbolValue, tableLog));
-		op += hSize;
-	}
-
-	/* Compress */
-	CHECK_F(FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, workspace, workspaceSize));
-	{
-		CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, weightTable, wtSize, CTable));
-		if (cSize == 0)
-			return 0; /* not enough space for compressed data */
-		op += cSize;
-	}
-
-	return op - ostart;
-}
-
-struct HUF_CElt_s {
-	U16 val;
-	BYTE nbBits;
-}; /* typedef'd to HUF_CElt within "huf.h" */
-
-/*! HUF_writeCTable_wksp() :
-	`CTable` : Huffman tree to save, using huf representation.
-	@return : size of saved CTable */
-size_t HUF_writeCTable_wksp(void *dst, size_t maxDstSize, const HUF_CElt *CTable, U32 maxSymbolValue, U32 huffLog, void *workspace, size_t workspaceSize)
-{
-	BYTE *op = (BYTE *)dst;
-	U32 n;
-
-	BYTE *bitsToWeight;
-	BYTE *huffWeight;
-	size_t spaceUsed32 = 0;
-
-	bitsToWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(HUF_TABLELOG_MAX + 1, sizeof(U32)) >> 2;
-	huffWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX, sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	/* check conditions */
-	if (maxSymbolValue > HUF_SYMBOLVALUE_MAX)
-		return ERROR(maxSymbolValue_tooLarge);
-
-	/* convert to weight */
-	bitsToWeight[0] = 0;
-	for (n = 1; n < huffLog + 1; n++)
-		bitsToWeight[n] = (BYTE)(huffLog + 1 - n);
-	for (n = 0; n < maxSymbolValue; n++)
-		huffWeight[n] = bitsToWeight[CTable[n].nbBits];
-
-	/* attempt weights compression by FSE */
-	{
-		CHECK_V_F(hSize, HUF_compressWeights_wksp(op + 1, maxDstSize - 1, huffWeight, maxSymbolValue, workspace, workspaceSize));
-		if ((hSize > 1) & (hSize < maxSymbolValue / 2)) { /* FSE compressed */
-			op[0] = (BYTE)hSize;
-			return hSize + 1;
-		}
-	}
-
-	/* write raw values as 4-bits (max : 15) */
-	if (maxSymbolValue > (256 - 128))
-		return ERROR(GENERIC); /* should not happen : likely means source cannot be compressed */
-	if (((maxSymbolValue + 1) / 2) + 1 > maxDstSize)
-		return ERROR(dstSize_tooSmall); /* not enough space within dst buffer */
-	op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue - 1));
-	huffWeight[maxSymbolValue] = 0; /* to be sure it doesn't cause msan issue in final combination */
-	for (n = 0; n < maxSymbolValue; n += 2)
-		op[(n / 2) + 1] = (BYTE)((huffWeight[n] << 4) + huffWeight[n + 1]);
-	return ((maxSymbolValue + 1) / 2) + 1;
-}
-
-size_t HUF_readCTable_wksp(HUF_CElt *CTable, U32 maxSymbolValue, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-{
-	U32 *rankVal;
-	BYTE *huffWeight;
-	U32 tableLog = 0;
-	U32 nbSymbols = 0;
-	size_t readSize;
-	size_t spaceUsed32 = 0;
-
-	rankVal = (U32 *)workspace + spaceUsed32;
-	spaceUsed32 += HUF_TABLELOG_ABSOLUTEMAX + 1;
-	huffWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	/* get symbol weights */
-	readSize = HUF_readStats_wksp(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize, workspace, workspaceSize);
-	if (ERR_isError(readSize))
-		return readSize;
-
-	/* check result */
-	if (tableLog > HUF_TABLELOG_MAX)
-		return ERROR(tableLog_tooLarge);
-	if (nbSymbols > maxSymbolValue + 1)
-		return ERROR(maxSymbolValue_tooSmall);
-
-	/* Prepare base value per rank */
-	{
-		U32 n, nextRankStart = 0;
-		for (n = 1; n <= tableLog; n++) {
-			U32 curr = nextRankStart;
-			nextRankStart += (rankVal[n] << (n - 1));
-			rankVal[n] = curr;
-		}
-	}
-
-	/* fill nbBits */
-	{
-		U32 n;
-		for (n = 0; n < nbSymbols; n++) {
-			const U32 w = huffWeight[n];
-			CTable[n].nbBits = (BYTE)(tableLog + 1 - w);
-		}
-	}
-
-	/* fill val */
-	{
-		U16 nbPerRank[HUF_TABLELOG_MAX + 2] = {0}; /* support w=0=>n=tableLog+1 */
-		U16 valPerRank[HUF_TABLELOG_MAX + 2] = {0};
-		{
-			U32 n;
-			for (n = 0; n < nbSymbols; n++)
-				nbPerRank[CTable[n].nbBits]++;
-		}
-		/* determine stating value per rank */
-		valPerRank[tableLog + 1] = 0; /* for w==0 */
-		{
-			U16 min = 0;
-			U32 n;
-			for (n = tableLog; n > 0; n--) { /* start at n=tablelog <-> w=1 */
-				valPerRank[n] = min;     /* get starting value within each rank */
-				min += nbPerRank[n];
-				min >>= 1;
-			}
-		}
-		/* assign value within rank, symbol order */
-		{
-			U32 n;
-			for (n = 0; n <= maxSymbolValue; n++)
-				CTable[n].val = valPerRank[CTable[n].nbBits]++;
-		}
-	}
-
-	return readSize;
-}
-
-typedef struct nodeElt_s {
-	U32 count;
-	U16 parent;
-	BYTE byte;
-	BYTE nbBits;
-} nodeElt;
-
-static U32 HUF_setMaxHeight(nodeElt *huffNode, U32 lastNonNull, U32 maxNbBits)
-{
-	const U32 largestBits = huffNode[lastNonNull].nbBits;
-	if (largestBits <= maxNbBits)
-		return largestBits; /* early exit : no elt > maxNbBits */
-
-	/* there are several too large elements (at least >= 2) */
-	{
-		int totalCost = 0;
-		const U32 baseCost = 1 << (largestBits - maxNbBits);
-		U32 n = lastNonNull;
-
-		while (huffNode[n].nbBits > maxNbBits) {
-			totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
-			huffNode[n].nbBits = (BYTE)maxNbBits;
-			n--;
-		} /* n stops at huffNode[n].nbBits <= maxNbBits */
-		while (huffNode[n].nbBits == maxNbBits)
-			n--; /* n end at index of smallest symbol using < maxNbBits */
-
-		/* renorm totalCost */
-		totalCost >>= (largestBits - maxNbBits); /* note : totalCost is necessarily a multiple of baseCost */
-
-		/* repay normalized cost */
-		{
-			U32 const noSymbol = 0xF0F0F0F0;
-			U32 rankLast[HUF_TABLELOG_MAX + 2];
-			int pos;
-
-			/* Get pos of last (smallest) symbol per rank */
-			memset(rankLast, 0xF0, sizeof(rankLast));
-			{
-				U32 currNbBits = maxNbBits;
-				for (pos = n; pos >= 0; pos--) {
-					if (huffNode[pos].nbBits >= currNbBits)
-						continue;
-					currNbBits = huffNode[pos].nbBits; /* < maxNbBits */
-					rankLast[maxNbBits - currNbBits] = pos;
-				}
-			}
-
-			while (totalCost > 0) {
-				U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
-				for (; nBitsToDecrease > 1; nBitsToDecrease--) {
-					U32 highPos = rankLast[nBitsToDecrease];
-					U32 lowPos = rankLast[nBitsToDecrease - 1];
-					if (highPos == noSymbol)
-						continue;
-					if (lowPos == noSymbol)
-						break;
-					{
-						U32 const highTotal = huffNode[highPos].count;
-						U32 const lowTotal = 2 * huffNode[lowPos].count;
-						if (highTotal <= lowTotal)
-							break;
-					}
-				}
-				/* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
-				/* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
-				while ((nBitsToDecrease <= HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))
-					nBitsToDecrease++;
-				totalCost -= 1 << (nBitsToDecrease - 1);
-				if (rankLast[nBitsToDecrease - 1] == noSymbol)
-					rankLast[nBitsToDecrease - 1] = rankLast[nBitsToDecrease]; /* this rank is no longer empty */
-				huffNode[rankLast[nBitsToDecrease]].nbBits++;
-				if (rankLast[nBitsToDecrease] == 0) /* special case, reached largest symbol */
-					rankLast[nBitsToDecrease] = noSymbol;
-				else {
-					rankLast[nBitsToDecrease]--;
-					if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits - nBitsToDecrease)
-						rankLast[nBitsToDecrease] = noSymbol; /* this rank is now empty */
-				}
-			} /* while (totalCost > 0) */
-
-			while (totalCost < 0) {		       /* Sometimes, cost correction overshoot */
-				if (rankLast[1] == noSymbol) { /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0
-								  (using maxNbBits) */
-					while (huffNode[n].nbBits == maxNbBits)
-						n--;
-					huffNode[n + 1].nbBits--;
-					rankLast[1] = n + 1;
-					totalCost++;
-					continue;
-				}
-				huffNode[rankLast[1] + 1].nbBits--;
-				rankLast[1]++;
-				totalCost++;
-			}
-		}
-	} /* there are several too large elements (at least >= 2) */
-
-	return maxNbBits;
-}
-
-typedef struct {
-	U32 base;
-	U32 curr;
-} rankPos;
-
-static void HUF_sort(nodeElt *huffNode, const U32 *count, U32 maxSymbolValue)
-{
-	rankPos rank[32];
-	U32 n;
-
-	memset(rank, 0, sizeof(rank));
-	for (n = 0; n <= maxSymbolValue; n++) {
-		U32 r = BIT_highbit32(count[n] + 1);
-		rank[r].base++;
-	}
-	for (n = 30; n > 0; n--)
-		rank[n - 1].base += rank[n].base;
-	for (n = 0; n < 32; n++)
-		rank[n].curr = rank[n].base;
-	for (n = 0; n <= maxSymbolValue; n++) {
-		U32 const c = count[n];
-		U32 const r = BIT_highbit32(c + 1) + 1;
-		U32 pos = rank[r].curr++;
-		while ((pos > rank[r].base) && (c > huffNode[pos - 1].count))
-			huffNode[pos] = huffNode[pos - 1], pos--;
-		huffNode[pos].count = c;
-		huffNode[pos].byte = (BYTE)n;
-	}
-}
-
-/** HUF_buildCTable_wksp() :
- *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
- *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
- */
-#define STARTNODE (HUF_SYMBOLVALUE_MAX + 1)
-typedef nodeElt huffNodeTable[2 * HUF_SYMBOLVALUE_MAX + 1 + 1];
-size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize)
-{
-	nodeElt *const huffNode0 = (nodeElt *)workSpace;
-	nodeElt *const huffNode = huffNode0 + 1;
-	U32 n, nonNullRank;
-	int lowS, lowN;
-	U16 nodeNb = STARTNODE;
-	U32 nodeRoot;
-
-	/* safety checks */
-	if (wkspSize < sizeof(huffNodeTable))
-		return ERROR(GENERIC); /* workSpace is not large enough */
-	if (maxNbBits == 0)
-		maxNbBits = HUF_TABLELOG_DEFAULT;
-	if (maxSymbolValue > HUF_SYMBOLVALUE_MAX)
-		return ERROR(GENERIC);
-	memset(huffNode0, 0, sizeof(huffNodeTable));
-
-	/* sort, decreasing order */
-	HUF_sort(huffNode, count, maxSymbolValue);
-
-	/* init for parents */
-	nonNullRank = maxSymbolValue;
-	while (huffNode[nonNullRank].count == 0)
-		nonNullRank--;
-	lowS = nonNullRank;
-	nodeRoot = nodeNb + lowS - 1;
-	lowN = nodeNb;
-	huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS - 1].count;
-	huffNode[lowS].parent = huffNode[lowS - 1].parent = nodeNb;
-	nodeNb++;
-	lowS -= 2;
-	for (n = nodeNb; n <= nodeRoot; n++)
-		huffNode[n].count = (U32)(1U << 30);
-	huffNode0[0].count = (U32)(1U << 31); /* fake entry, strong barrier */
-
-	/* create parents */
-	while (nodeNb <= nodeRoot) {
-		U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-		U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-		huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
-		huffNode[n1].parent = huffNode[n2].parent = nodeNb;
-		nodeNb++;
-	}
-
-	/* distribute weights (unlimited tree height) */
-	huffNode[nodeRoot].nbBits = 0;
-	for (n = nodeRoot - 1; n >= STARTNODE; n--)
-		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
-	for (n = 0; n <= nonNullRank; n++)
-		huffNode[n].nbBits = huffNode[huffNode[n].parent].nbBits + 1;
-
-	/* enforce maxTableLog */
-	maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
-
-	/* fill result into tree (val, nbBits) */
-	{
-		U16 nbPerRank[HUF_TABLELOG_MAX + 1] = {0};
-		U16 valPerRank[HUF_TABLELOG_MAX + 1] = {0};
-		if (maxNbBits > HUF_TABLELOG_MAX)
-			return ERROR(GENERIC); /* check fit into table */
-		for (n = 0; n <= nonNullRank; n++)
-			nbPerRank[huffNode[n].nbBits]++;
-		/* determine stating value per rank */
-		{
-			U16 min = 0;
-			for (n = maxNbBits; n > 0; n--) {
-				valPerRank[n] = min; /* get starting value within each rank */
-				min += nbPerRank[n];
-				min >>= 1;
-			}
-		}
-		for (n = 0; n <= maxSymbolValue; n++)
-			tree[huffNode[n].byte].nbBits = huffNode[n].nbBits; /* push nbBits per symbol, symbol order */
-		for (n = 0; n <= maxSymbolValue; n++)
-			tree[n].val = valPerRank[tree[n].nbBits]++; /* assign value within rank, symbol order */
-	}
-
-	return maxNbBits;
-}
-
-static size_t HUF_estimateCompressedSize(HUF_CElt *CTable, const unsigned *count, unsigned maxSymbolValue)
-{
-	size_t nbBits = 0;
-	int s;
-	for (s = 0; s <= (int)maxSymbolValue; ++s) {
-		nbBits += CTable[s].nbBits * count[s];
-	}
-	return nbBits >> 3;
-}
-
-static int HUF_validateCTable(const HUF_CElt *CTable, const unsigned *count, unsigned maxSymbolValue)
-{
-	int bad = 0;
-	int s;
-	for (s = 0; s <= (int)maxSymbolValue; ++s) {
-		bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
-	}
-	return !bad;
-}
-
-static void HUF_encodeSymbol(BIT_CStream_t *bitCPtr, U32 symbol, const HUF_CElt *CTable)
-{
-	BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
-}
-
-size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
-
-#define HUF_FLUSHBITS(s)  BIT_flushBits(s)
-
-#define HUF_FLUSHBITS_1(stream)                                            \
-	if (sizeof((stream)->bitContainer) * 8 < HUF_TABLELOG_MAX * 2 + 7) \
-	HUF_FLUSHBITS(stream)
-
-#define HUF_FLUSHBITS_2(stream)                                            \
-	if (sizeof((stream)->bitContainer) * 8 < HUF_TABLELOG_MAX * 4 + 7) \
-	HUF_FLUSHBITS(stream)
-
-size_t HUF_compress1X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable)
-{
-	const BYTE *ip = (const BYTE *)src;
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *const oend = ostart + dstSize;
-	BYTE *op = ostart;
-	size_t n;
-	BIT_CStream_t bitC;
-
-	/* init */
-	if (dstSize < 8)
-		return 0; /* not enough space to compress */
-	{
-		size_t const initErr = BIT_initCStream(&bitC, op, oend - op);
-		if (HUF_isError(initErr))
-			return 0;
-	}
-
-	n = srcSize & ~3; /* join to mod 4 */
-	switch (srcSize & 3) {
-	case 3: HUF_encodeSymbol(&bitC, ip[n + 2], CTable); HUF_FLUSHBITS_2(&bitC);
-	case 2: HUF_encodeSymbol(&bitC, ip[n + 1], CTable); HUF_FLUSHBITS_1(&bitC);
-	case 1: HUF_encodeSymbol(&bitC, ip[n + 0], CTable); HUF_FLUSHBITS(&bitC);
-	case 0:
-	default:;
-	}
-
-	for (; n > 0; n -= 4) { /* note : n&3==0 at this stage */
-		HUF_encodeSymbol(&bitC, ip[n - 1], CTable);
-		HUF_FLUSHBITS_1(&bitC);
-		HUF_encodeSymbol(&bitC, ip[n - 2], CTable);
-		HUF_FLUSHBITS_2(&bitC);
-		HUF_encodeSymbol(&bitC, ip[n - 3], CTable);
-		HUF_FLUSHBITS_1(&bitC);
-		HUF_encodeSymbol(&bitC, ip[n - 4], CTable);
-		HUF_FLUSHBITS(&bitC);
-	}
-
-	return BIT_closeCStream(&bitC);
-}
-
-size_t HUF_compress4X_usingCTable(void *dst, size_t dstSize, const void *src, size_t srcSize, const HUF_CElt *CTable)
-{
-	size_t const segmentSize = (srcSize + 3) / 4; /* first 3 segments */
-	const BYTE *ip = (const BYTE *)src;
-	const BYTE *const iend = ip + srcSize;
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *const oend = ostart + dstSize;
-	BYTE *op = ostart;
-
-	if (dstSize < 6 + 1 + 1 + 1 + 8)
-		return 0; /* minimum space to compress successfully */
-	if (srcSize < 12)
-		return 0; /* no saving possible : too small input */
-	op += 6;	  /* jumpTable */
-
-	{
-		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, segmentSize, CTable));
-		if (cSize == 0)
-			return 0;
-		ZSTD_writeLE16(ostart, (U16)cSize);
-		op += cSize;
-	}
-
-	ip += segmentSize;
-	{
-		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, segmentSize, CTable));
-		if (cSize == 0)
-			return 0;
-		ZSTD_writeLE16(ostart + 2, (U16)cSize);
-		op += cSize;
-	}
-
-	ip += segmentSize;
-	{
-		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, segmentSize, CTable));
-		if (cSize == 0)
-			return 0;
-		ZSTD_writeLE16(ostart + 4, (U16)cSize);
-		op += cSize;
-	}
-
-	ip += segmentSize;
-	{
-		CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend - op, ip, iend - ip, CTable));
-		if (cSize == 0)
-			return 0;
-		op += cSize;
-	}
-
-	return op - ostart;
-}
-
-static size_t HUF_compressCTable_internal(BYTE *const ostart, BYTE *op, BYTE *const oend, const void *src, size_t srcSize, unsigned singleStream,
-					  const HUF_CElt *CTable)
-{
-	size_t const cSize =
-	    singleStream ? HUF_compress1X_usingCTable(op, oend - op, src, srcSize, CTable) : HUF_compress4X_usingCTable(op, oend - op, src, srcSize, CTable);
-	if (HUF_isError(cSize)) {
-		return cSize;
-	}
-	if (cSize == 0) {
-		return 0;
-	} /* uncompressible */
-	op += cSize;
-	/* check compressibility */
-	if ((size_t)(op - ostart) >= srcSize - 1) {
-		return 0;
-	}
-	return op - ostart;
-}
-
-/* `workSpace` must a table of at least 1024 unsigned */
-static size_t HUF_compress_internal(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog,
-				    unsigned singleStream, void *workSpace, size_t wkspSize, HUF_CElt *oldHufTable, HUF_repeat *repeat, int preferRepeat)
-{
-	BYTE *const ostart = (BYTE *)dst;
-	BYTE *const oend = ostart + dstSize;
-	BYTE *op = ostart;
-
-	U32 *count;
-	size_t const countSize = sizeof(U32) * (HUF_SYMBOLVALUE_MAX + 1);
-	HUF_CElt *CTable;
-	size_t const CTableSize = sizeof(HUF_CElt) * (HUF_SYMBOLVALUE_MAX + 1);
-
-	/* checks & inits */
-	if (wkspSize < sizeof(huffNodeTable) + countSize + CTableSize)
-		return ERROR(GENERIC);
-	if (!srcSize)
-		return 0; /* Uncompressed (note : 1 means rle, so first byte must be correct) */
-	if (!dstSize)
-		return 0; /* cannot fit within dst budget */
-	if (srcSize > HUF_BLOCKSIZE_MAX)
-		return ERROR(srcSize_wrong); /* curr block size limit */
-	if (huffLog > HUF_TABLELOG_MAX)
-		return ERROR(tableLog_tooLarge);
-	if (!maxSymbolValue)
-		maxSymbolValue = HUF_SYMBOLVALUE_MAX;
-	if (!huffLog)
-		huffLog = HUF_TABLELOG_DEFAULT;
-
-	count = (U32 *)workSpace;
-	workSpace = (BYTE *)workSpace + countSize;
-	wkspSize -= countSize;
-	CTable = (HUF_CElt *)workSpace;
-	workSpace = (BYTE *)workSpace + CTableSize;
-	wkspSize -= CTableSize;
-
-	/* Heuristic : If we don't need to check the validity of the old table use the old table for small inputs */
-	if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
-		return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-	}
-
-	/* Scan input and build symbol stats */
-	{
-		CHECK_V_F(largest, FSE_count_wksp(count, &maxSymbolValue, (const BYTE *)src, srcSize, (U32 *)workSpace));
-		if (largest == srcSize) {
-			*ostart = ((const BYTE *)src)[0];
-			return 1;
-		} /* single symbol, rle */
-		if (largest <= (srcSize >> 7) + 1)
-			return 0; /* Fast heuristic : not compressible enough */
-	}
-
-	/* Check validity of previous table */
-	if (repeat && *repeat == HUF_repeat_check && !HUF_validateCTable(oldHufTable, count, maxSymbolValue)) {
-		*repeat = HUF_repeat_none;
-	}
-	/* Heuristic : use existing table for small inputs */
-	if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
-		return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-	}
-
-	/* Build Huffman Tree */
-	huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
-	{
-		CHECK_V_F(maxBits, HUF_buildCTable_wksp(CTable, count, maxSymbolValue, huffLog, workSpace, wkspSize));
-		huffLog = (U32)maxBits;
-		/* Zero the unused symbols so we can check it for validity */
-		memset(CTable + maxSymbolValue + 1, 0, CTableSize - (maxSymbolValue + 1) * sizeof(HUF_CElt));
-	}
-
-	/* Write table description header */
-	{
-		CHECK_V_F(hSize, HUF_writeCTable_wksp(op, dstSize, CTable, maxSymbolValue, huffLog, workSpace, wkspSize));
-		/* Check if using the previous table will be beneficial */
-		if (repeat && *repeat != HUF_repeat_none) {
-			size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, count, maxSymbolValue);
-			size_t const newSize = HUF_estimateCompressedSize(CTable, count, maxSymbolValue);
-			if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
-				return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-			}
-		}
-		/* Use the new table */
-		if (hSize + 12ul >= srcSize) {
-			return 0;
-		}
-		op += hSize;
-		if (repeat) {
-			*repeat = HUF_repeat_none;
-		}
-		if (oldHufTable) {
-			memcpy(oldHufTable, CTable, CTableSize);
-		} /* Save the new table */
-	}
-	return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, CTable);
-}
-
-size_t HUF_compress1X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-			   size_t wkspSize)
-{
-	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, NULL, NULL, 0);
-}
-
-size_t HUF_compress1X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat, int preferRepeat)
-{
-	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat,
-				     preferRepeat);
-}
-
-size_t HUF_compress4X_wksp(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-			   size_t wkspSize)
-{
-	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, NULL, NULL, 0);
-}
-
-size_t HUF_compress4X_repeat(void *dst, size_t dstSize, const void *src, size_t srcSize, unsigned maxSymbolValue, unsigned huffLog, void *workSpace,
-			     size_t wkspSize, HUF_CElt *hufTable, HUF_repeat *repeat, int preferRepeat)
-{
-	return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat,
-				     preferRepeat);
-}
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/huf_decompress.c b/priv/zstd/contrib/linux-kernel/lib/zstd/huf_decompress.c
deleted file mode 100644
index 6526482..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/huf_decompress.c
+++ /dev/null
@@ -1,960 +0,0 @@
-/*
- * Huffman decoder, part of New Generation Entropy library
- * Copyright (C) 2013-2016, Yann Collet.
- *
- * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *   * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *   * Redistributions in binary form must reproduce the above
- * copyright notice, this list of conditions and the following disclaimer
- * in the documentation and/or other materials provided with the
- * distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- *
- * You can contact the author at :
- * - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
- */
-
-/* **************************************************************
-*  Compiler specifics
-****************************************************************/
-#define FORCE_INLINE static __always_inline
-
-/* **************************************************************
-*  Dependencies
-****************************************************************/
-#include "bitstream.h" /* BIT_* */
-#include "fse.h"       /* header compression */
-#include "huf.h"
-#include 
-#include 
-#include  /* memcpy, memset */
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define HUF_STATIC_ASSERT(c)                                   \
-	{                                                      \
-		enum { HUF_static_assert = 1 / (int)(!!(c)) }; \
-	} /* use only *after* variable declarations */
-
-/*-***************************/
-/*  generic DTableDesc       */
-/*-***************************/
-
-typedef struct {
-	BYTE maxTableLog;
-	BYTE tableType;
-	BYTE tableLog;
-	BYTE reserved;
-} DTableDesc;
-
-static DTableDesc HUF_getDTableDesc(const HUF_DTable *table)
-{
-	DTableDesc dtd;
-	memcpy(&dtd, table, sizeof(dtd));
-	return dtd;
-}
-
-/*-***************************/
-/*  single-symbol decoding   */
-/*-***************************/
-
-typedef struct {
-	BYTE byte;
-	BYTE nbBits;
-} HUF_DEltX2; /* single-symbol decoding */
-
-size_t HUF_readDTableX2_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-{
-	U32 tableLog = 0;
-	U32 nbSymbols = 0;
-	size_t iSize;
-	void *const dtPtr = DTable + 1;
-	HUF_DEltX2 *const dt = (HUF_DEltX2 *)dtPtr;
-
-	U32 *rankVal;
-	BYTE *huffWeight;
-	size_t spaceUsed32 = 0;
-
-	rankVal = (U32 *)workspace + spaceUsed32;
-	spaceUsed32 += HUF_TABLELOG_ABSOLUTEMAX + 1;
-	huffWeight = (BYTE *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	HUF_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
-	/* memset(huffWeight, 0, sizeof(huffWeight)); */ /* is not necessary, even though some analyzer complain ... */
-
-	iSize = HUF_readStats_wksp(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize, workspace, workspaceSize);
-	if (HUF_isError(iSize))
-		return iSize;
-
-	/* Table header */
-	{
-		DTableDesc dtd = HUF_getDTableDesc(DTable);
-		if (tableLog > (U32)(dtd.maxTableLog + 1))
-			return ERROR(tableLog_tooLarge); /* DTable too small, Huffman tree cannot fit in */
-		dtd.tableType = 0;
-		dtd.tableLog = (BYTE)tableLog;
-		memcpy(DTable, &dtd, sizeof(dtd));
-	}
-
-	/* Calculate starting value for each rank */
-	{
-		U32 n, nextRankStart = 0;
-		for (n = 1; n < tableLog + 1; n++) {
-			U32 const curr = nextRankStart;
-			nextRankStart += (rankVal[n] << (n - 1));
-			rankVal[n] = curr;
-		}
-	}
-
-	/* fill DTable */
-	{
-		U32 n;
-		for (n = 0; n < nbSymbols; n++) {
-			U32 const w = huffWeight[n];
-			U32 const length = (1 << w) >> 1;
-			U32 u;
-			HUF_DEltX2 D;
-			D.byte = (BYTE)n;
-			D.nbBits = (BYTE)(tableLog + 1 - w);
-			for (u = rankVal[w]; u < rankVal[w] + length; u++)
-				dt[u] = D;
-			rankVal[w] += length;
-		}
-	}
-
-	return iSize;
-}
-
-static BYTE HUF_decodeSymbolX2(BIT_DStream_t *Dstream, const HUF_DEltX2 *dt, const U32 dtLog)
-{
-	size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
-	BYTE const c = dt[val].byte;
-	BIT_skipBits(Dstream, dt[val].nbBits);
-	return c;
-}
-
-#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr)         \
-	if (ZSTD_64bits() || (HUF_TABLELOG_MAX <= 12)) \
-	HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-
-#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
-	if (ZSTD_64bits())                     \
-	HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-
-FORCE_INLINE size_t HUF_decodeStreamX2(BYTE *p, BIT_DStream_t *const bitDPtr, BYTE *const pEnd, const HUF_DEltX2 *const dt, const U32 dtLog)
-{
-	BYTE *const pStart = p;
-
-	/* up to 4 symbols at a time */
-	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd - 4)) {
-		HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-		HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
-		HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-	}
-
-	/* closer to the end */
-	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
-		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-
-	/* no more data to retrieve from bitstream, hence no need to reload */
-	while (p < pEnd)
-		HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-
-	return pEnd - pStart;
-}
-
-static size_t HUF_decompress1X2_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	BYTE *op = (BYTE *)dst;
-	BYTE *const oend = op + dstSize;
-	const void *dtPtr = DTable + 1;
-	const HUF_DEltX2 *const dt = (const HUF_DEltX2 *)dtPtr;
-	BIT_DStream_t bitD;
-	DTableDesc const dtd = HUF_getDTableDesc(DTable);
-	U32 const dtLog = dtd.tableLog;
-
-	{
-		size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-		if (HUF_isError(errorCode))
-			return errorCode;
-	}
-
-	HUF_decodeStreamX2(op, &bitD, oend, dt, dtLog);
-
-	/* check */
-	if (!BIT_endOfDStream(&bitD))
-		return ERROR(corruption_detected);
-
-	return dstSize;
-}
-
-size_t HUF_decompress1X2_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	DTableDesc dtd = HUF_getDTableDesc(DTable);
-	if (dtd.tableType != 0)
-		return ERROR(GENERIC);
-	return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable *DCtx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	const BYTE *ip = (const BYTE *)cSrc;
-
-	size_t const hSize = HUF_readDTableX2_wksp(DCtx, cSrc, cSrcSize, workspace, workspaceSize);
-	if (HUF_isError(hSize))
-		return hSize;
-	if (hSize >= cSrcSize)
-		return ERROR(srcSize_wrong);
-	ip += hSize;
-	cSrcSize -= hSize;
-
-	return HUF_decompress1X2_usingDTable_internal(dst, dstSize, ip, cSrcSize, DCtx);
-}
-
-static size_t HUF_decompress4X2_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	/* Check */
-	if (cSrcSize < 10)
-		return ERROR(corruption_detected); /* strict minimum : jump table + 1 byte per stream */
-
-	{
-		const BYTE *const istart = (const BYTE *)cSrc;
-		BYTE *const ostart = (BYTE *)dst;
-		BYTE *const oend = ostart + dstSize;
-		const void *const dtPtr = DTable + 1;
-		const HUF_DEltX2 *const dt = (const HUF_DEltX2 *)dtPtr;
-
-		/* Init */
-		BIT_DStream_t bitD1;
-		BIT_DStream_t bitD2;
-		BIT_DStream_t bitD3;
-		BIT_DStream_t bitD4;
-		size_t const length1 = ZSTD_readLE16(istart);
-		size_t const length2 = ZSTD_readLE16(istart + 2);
-		size_t const length3 = ZSTD_readLE16(istart + 4);
-		size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-		const BYTE *const istart1 = istart + 6; /* jumpTable */
-		const BYTE *const istart2 = istart1 + length1;
-		const BYTE *const istart3 = istart2 + length2;
-		const BYTE *const istart4 = istart3 + length3;
-		const size_t segmentSize = (dstSize + 3) / 4;
-		BYTE *const opStart2 = ostart + segmentSize;
-		BYTE *const opStart3 = opStart2 + segmentSize;
-		BYTE *const opStart4 = opStart3 + segmentSize;
-		BYTE *op1 = ostart;
-		BYTE *op2 = opStart2;
-		BYTE *op3 = opStart3;
-		BYTE *op4 = opStart4;
-		U32 endSignal;
-		DTableDesc const dtd = HUF_getDTableDesc(DTable);
-		U32 const dtLog = dtd.tableLog;
-
-		if (length4 > cSrcSize)
-			return ERROR(corruption_detected); /* overflow */
-		{
-			size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-		{
-			size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-		{
-			size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-		{
-			size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-
-		/* 16-32 symbols per loop (4-8 symbols per stream) */
-		endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-		for (; (endSignal == BIT_DStream_unfinished) && (op4 < (oend - 7));) {
-			HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-			HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-			HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-			HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-			HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
-			HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
-			HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
-			HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
-			HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-			HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-			HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-			HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-			HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
-			HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
-			HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
-			HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
-			endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-		}
-
-		/* check corruption */
-		if (op1 > opStart2)
-			return ERROR(corruption_detected);
-		if (op2 > opStart3)
-			return ERROR(corruption_detected);
-		if (op3 > opStart4)
-			return ERROR(corruption_detected);
-		/* note : op4 supposed already verified within main loop */
-
-		/* finish bitStreams one by one */
-		HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
-		HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
-		HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
-		HUF_decodeStreamX2(op4, &bitD4, oend, dt, dtLog);
-
-		/* check */
-		endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-		if (!endSignal)
-			return ERROR(corruption_detected);
-
-		/* decoded size */
-		return dstSize;
-	}
-}
-
-size_t HUF_decompress4X2_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	DTableDesc dtd = HUF_getDTableDesc(DTable);
-	if (dtd.tableType != 0)
-		return ERROR(GENERIC);
-	return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	const BYTE *ip = (const BYTE *)cSrc;
-
-	size_t const hSize = HUF_readDTableX2_wksp(dctx, cSrc, cSrcSize, workspace, workspaceSize);
-	if (HUF_isError(hSize))
-		return hSize;
-	if (hSize >= cSrcSize)
-		return ERROR(srcSize_wrong);
-	ip += hSize;
-	cSrcSize -= hSize;
-
-	return HUF_decompress4X2_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
-}
-
-/* *************************/
-/* double-symbols decoding */
-/* *************************/
-typedef struct {
-	U16 sequence;
-	BYTE nbBits;
-	BYTE length;
-} HUF_DEltX4; /* double-symbols decoding */
-
-typedef struct {
-	BYTE symbol;
-	BYTE weight;
-} sortedSymbol_t;
-
-/* HUF_fillDTableX4Level2() :
- * `rankValOrigin` must be a table of at least (HUF_TABLELOG_MAX + 1) U32 */
-static void HUF_fillDTableX4Level2(HUF_DEltX4 *DTable, U32 sizeLog, const U32 consumed, const U32 *rankValOrigin, const int minWeight,
-				   const sortedSymbol_t *sortedSymbols, const U32 sortedListSize, U32 nbBitsBaseline, U16 baseSeq)
-{
-	HUF_DEltX4 DElt;
-	U32 rankVal[HUF_TABLELOG_MAX + 1];
-
-	/* get pre-calculated rankVal */
-	memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-
-	/* fill skipped values */
-	if (minWeight > 1) {
-		U32 i, skipSize = rankVal[minWeight];
-		ZSTD_writeLE16(&(DElt.sequence), baseSeq);
-		DElt.nbBits = (BYTE)(consumed);
-		DElt.length = 1;
-		for (i = 0; i < skipSize; i++)
-			DTable[i] = DElt;
-	}
-
-	/* fill DTable */
-	{
-		U32 s;
-		for (s = 0; s < sortedListSize; s++) { /* note : sortedSymbols already skipped */
-			const U32 symbol = sortedSymbols[s].symbol;
-			const U32 weight = sortedSymbols[s].weight;
-			const U32 nbBits = nbBitsBaseline - weight;
-			const U32 length = 1 << (sizeLog - nbBits);
-			const U32 start = rankVal[weight];
-			U32 i = start;
-			const U32 end = start + length;
-
-			ZSTD_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8)));
-			DElt.nbBits = (BYTE)(nbBits + consumed);
-			DElt.length = 2;
-			do {
-				DTable[i++] = DElt;
-			} while (i < end); /* since length >= 1 */
-
-			rankVal[weight] += length;
-		}
-	}
-}
-
-typedef U32 rankVal_t[HUF_TABLELOG_MAX][HUF_TABLELOG_MAX + 1];
-typedef U32 rankValCol_t[HUF_TABLELOG_MAX + 1];
-
-static void HUF_fillDTableX4(HUF_DEltX4 *DTable, const U32 targetLog, const sortedSymbol_t *sortedList, const U32 sortedListSize, const U32 *rankStart,
-			     rankVal_t rankValOrigin, const U32 maxWeight, const U32 nbBitsBaseline)
-{
-	U32 rankVal[HUF_TABLELOG_MAX + 1];
-	const int scaleLog = nbBitsBaseline - targetLog; /* note : targetLog >= srcLog, hence scaleLog <= 1 */
-	const U32 minBits = nbBitsBaseline - maxWeight;
-	U32 s;
-
-	memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-
-	/* fill DTable */
-	for (s = 0; s < sortedListSize; s++) {
-		const U16 symbol = sortedList[s].symbol;
-		const U32 weight = sortedList[s].weight;
-		const U32 nbBits = nbBitsBaseline - weight;
-		const U32 start = rankVal[weight];
-		const U32 length = 1 << (targetLog - nbBits);
-
-		if (targetLog - nbBits >= minBits) { /* enough room for a second symbol */
-			U32 sortedRank;
-			int minWeight = nbBits + scaleLog;
-			if (minWeight < 1)
-				minWeight = 1;
-			sortedRank = rankStart[minWeight];
-			HUF_fillDTableX4Level2(DTable + start, targetLog - nbBits, nbBits, rankValOrigin[nbBits], minWeight, sortedList + sortedRank,
-					       sortedListSize - sortedRank, nbBitsBaseline, symbol);
-		} else {
-			HUF_DEltX4 DElt;
-			ZSTD_writeLE16(&(DElt.sequence), symbol);
-			DElt.nbBits = (BYTE)(nbBits);
-			DElt.length = 1;
-			{
-				U32 const end = start + length;
-				U32 u;
-				for (u = start; u < end; u++)
-					DTable[u] = DElt;
-			}
-		}
-		rankVal[weight] += length;
-	}
-}
-
-size_t HUF_readDTableX4_wksp(HUF_DTable *DTable, const void *src, size_t srcSize, void *workspace, size_t workspaceSize)
-{
-	U32 tableLog, maxW, sizeOfSort, nbSymbols;
-	DTableDesc dtd = HUF_getDTableDesc(DTable);
-	U32 const maxTableLog = dtd.maxTableLog;
-	size_t iSize;
-	void *dtPtr = DTable + 1; /* force compiler to avoid strict-aliasing */
-	HUF_DEltX4 *const dt = (HUF_DEltX4 *)dtPtr;
-	U32 *rankStart;
-
-	rankValCol_t *rankVal;
-	U32 *rankStats;
-	U32 *rankStart0;
-	sortedSymbol_t *sortedSymbol;
-	BYTE *weightList;
-	size_t spaceUsed32 = 0;
-
-	HUF_STATIC_ASSERT((sizeof(rankValCol_t) & 3) == 0);
-
-	rankVal = (rankValCol_t *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += (sizeof(rankValCol_t) * HUF_TABLELOG_MAX) >> 2;
-	rankStats = (U32 *)workspace + spaceUsed32;
-	spaceUsed32 += HUF_TABLELOG_MAX + 1;
-	rankStart0 = (U32 *)workspace + spaceUsed32;
-	spaceUsed32 += HUF_TABLELOG_MAX + 2;
-	sortedSymbol = (sortedSymbol_t *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(sizeof(sortedSymbol_t) * (HUF_SYMBOLVALUE_MAX + 1), sizeof(U32)) >> 2;
-	weightList = (BYTE *)((U32 *)workspace + spaceUsed32);
-	spaceUsed32 += ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-
-	if ((spaceUsed32 << 2) > workspaceSize)
-		return ERROR(tableLog_tooLarge);
-	workspace = (U32 *)workspace + spaceUsed32;
-	workspaceSize -= (spaceUsed32 << 2);
-
-	rankStart = rankStart0 + 1;
-	memset(rankStats, 0, sizeof(U32) * (2 * HUF_TABLELOG_MAX + 2 + 1));
-
-	HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(HUF_DTable)); /* if compiler fails here, assertion is wrong */
-	if (maxTableLog > HUF_TABLELOG_MAX)
-		return ERROR(tableLog_tooLarge);
-	/* memset(weightList, 0, sizeof(weightList)); */ /* is not necessary, even though some analyzer complain ... */
-
-	iSize = HUF_readStats_wksp(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize, workspace, workspaceSize);
-	if (HUF_isError(iSize))
-		return iSize;
-
-	/* check result */
-	if (tableLog > maxTableLog)
-		return ERROR(tableLog_tooLarge); /* DTable can't fit code depth */
-
-	/* find maxWeight */
-	for (maxW = tableLog; rankStats[maxW] == 0; maxW--) {
-	} /* necessarily finds a solution before 0 */
-
-	/* Get start index of each weight */
-	{
-		U32 w, nextRankStart = 0;
-		for (w = 1; w < maxW + 1; w++) {
-			U32 curr = nextRankStart;
-			nextRankStart += rankStats[w];
-			rankStart[w] = curr;
-		}
-		rankStart[0] = nextRankStart; /* put all 0w symbols at the end of sorted list*/
-		sizeOfSort = nextRankStart;
-	}
-
-	/* sort symbols by weight */
-	{
-		U32 s;
-		for (s = 0; s < nbSymbols; s++) {
-			U32 const w = weightList[s];
-			U32 const r = rankStart[w]++;
-			sortedSymbol[r].symbol = (BYTE)s;
-			sortedSymbol[r].weight = (BYTE)w;
-		}
-		rankStart[0] = 0; /* forget 0w symbols; this is beginning of weight(1) */
-	}
-
-	/* Build rankVal */
-	{
-		U32 *const rankVal0 = rankVal[0];
-		{
-			int const rescale = (maxTableLog - tableLog) - 1; /* tableLog <= maxTableLog */
-			U32 nextRankVal = 0;
-			U32 w;
-			for (w = 1; w < maxW + 1; w++) {
-				U32 curr = nextRankVal;
-				nextRankVal += rankStats[w] << (w + rescale);
-				rankVal0[w] = curr;
-			}
-		}
-		{
-			U32 const minBits = tableLog + 1 - maxW;
-			U32 consumed;
-			for (consumed = minBits; consumed < maxTableLog - minBits + 1; consumed++) {
-				U32 *const rankValPtr = rankVal[consumed];
-				U32 w;
-				for (w = 1; w < maxW + 1; w++) {
-					rankValPtr[w] = rankVal0[w] >> consumed;
-				}
-			}
-		}
-	}
-
-	HUF_fillDTableX4(dt, maxTableLog, sortedSymbol, sizeOfSort, rankStart0, rankVal, maxW, tableLog + 1);
-
-	dtd.tableLog = (BYTE)maxTableLog;
-	dtd.tableType = 1;
-	memcpy(DTable, &dtd, sizeof(dtd));
-	return iSize;
-}
-
-static U32 HUF_decodeSymbolX4(void *op, BIT_DStream_t *DStream, const HUF_DEltX4 *dt, const U32 dtLog)
-{
-	size_t const val = BIT_lookBitsFast(DStream, dtLog); /* note : dtLog >= 1 */
-	memcpy(op, dt + val, 2);
-	BIT_skipBits(DStream, dt[val].nbBits);
-	return dt[val].length;
-}
-
-static U32 HUF_decodeLastSymbolX4(void *op, BIT_DStream_t *DStream, const HUF_DEltX4 *dt, const U32 dtLog)
-{
-	size_t const val = BIT_lookBitsFast(DStream, dtLog); /* note : dtLog >= 1 */
-	memcpy(op, dt + val, 1);
-	if (dt[val].length == 1)
-		BIT_skipBits(DStream, dt[val].nbBits);
-	else {
-		if (DStream->bitsConsumed < (sizeof(DStream->bitContainer) * 8)) {
-			BIT_skipBits(DStream, dt[val].nbBits);
-			if (DStream->bitsConsumed > (sizeof(DStream->bitContainer) * 8))
-				/* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
-				DStream->bitsConsumed = (sizeof(DStream->bitContainer) * 8);
-		}
-	}
-	return 1;
-}
-
-#define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr)         \
-	if (ZSTD_64bits() || (HUF_TABLELOG_MAX <= 12)) \
-	ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \
-	if (ZSTD_64bits())                     \
-	ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-FORCE_INLINE size_t HUF_decodeStreamX4(BYTE *p, BIT_DStream_t *bitDPtr, BYTE *const pEnd, const HUF_DEltX4 *const dt, const U32 dtLog)
-{
-	BYTE *const pStart = p;
-
-	/* up to 8 symbols at a time */
-	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd - (sizeof(bitDPtr->bitContainer) - 1))) {
-		HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-		HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
-		HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-	}
-
-	/* closer to end : up to 2 symbols at a time */
-	while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd - 2))
-		HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-
-	while (p <= pEnd - 2)
-		HUF_DECODE_SYMBOLX4_0(p, bitDPtr); /* no need to reload : reached the end of DStream */
-
-	if (p < pEnd)
-		p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
-
-	return p - pStart;
-}
-
-static size_t HUF_decompress1X4_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	BIT_DStream_t bitD;
-
-	/* Init */
-	{
-		size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-		if (HUF_isError(errorCode))
-			return errorCode;
-	}
-
-	/* decode */
-	{
-		BYTE *const ostart = (BYTE *)dst;
-		BYTE *const oend = ostart + dstSize;
-		const void *const dtPtr = DTable + 1; /* force compiler to not use strict-aliasing */
-		const HUF_DEltX4 *const dt = (const HUF_DEltX4 *)dtPtr;
-		DTableDesc const dtd = HUF_getDTableDesc(DTable);
-		HUF_decodeStreamX4(ostart, &bitD, oend, dt, dtd.tableLog);
-	}
-
-	/* check */
-	if (!BIT_endOfDStream(&bitD))
-		return ERROR(corruption_detected);
-
-	/* decoded size */
-	return dstSize;
-}
-
-size_t HUF_decompress1X4_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	DTableDesc dtd = HUF_getDTableDesc(DTable);
-	if (dtd.tableType != 1)
-		return ERROR(GENERIC);
-	return HUF_decompress1X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress1X4_DCtx_wksp(HUF_DTable *DCtx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	const BYTE *ip = (const BYTE *)cSrc;
-
-	size_t const hSize = HUF_readDTableX4_wksp(DCtx, cSrc, cSrcSize, workspace, workspaceSize);
-	if (HUF_isError(hSize))
-		return hSize;
-	if (hSize >= cSrcSize)
-		return ERROR(srcSize_wrong);
-	ip += hSize;
-	cSrcSize -= hSize;
-
-	return HUF_decompress1X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, DCtx);
-}
-
-static size_t HUF_decompress4X4_usingDTable_internal(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	if (cSrcSize < 10)
-		return ERROR(corruption_detected); /* strict minimum : jump table + 1 byte per stream */
-
-	{
-		const BYTE *const istart = (const BYTE *)cSrc;
-		BYTE *const ostart = (BYTE *)dst;
-		BYTE *const oend = ostart + dstSize;
-		const void *const dtPtr = DTable + 1;
-		const HUF_DEltX4 *const dt = (const HUF_DEltX4 *)dtPtr;
-
-		/* Init */
-		BIT_DStream_t bitD1;
-		BIT_DStream_t bitD2;
-		BIT_DStream_t bitD3;
-		BIT_DStream_t bitD4;
-		size_t const length1 = ZSTD_readLE16(istart);
-		size_t const length2 = ZSTD_readLE16(istart + 2);
-		size_t const length3 = ZSTD_readLE16(istart + 4);
-		size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-		const BYTE *const istart1 = istart + 6; /* jumpTable */
-		const BYTE *const istart2 = istart1 + length1;
-		const BYTE *const istart3 = istart2 + length2;
-		const BYTE *const istart4 = istart3 + length3;
-		size_t const segmentSize = (dstSize + 3) / 4;
-		BYTE *const opStart2 = ostart + segmentSize;
-		BYTE *const opStart3 = opStart2 + segmentSize;
-		BYTE *const opStart4 = opStart3 + segmentSize;
-		BYTE *op1 = ostart;
-		BYTE *op2 = opStart2;
-		BYTE *op3 = opStart3;
-		BYTE *op4 = opStart4;
-		U32 endSignal;
-		DTableDesc const dtd = HUF_getDTableDesc(DTable);
-		U32 const dtLog = dtd.tableLog;
-
-		if (length4 > cSrcSize)
-			return ERROR(corruption_detected); /* overflow */
-		{
-			size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-		{
-			size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-		{
-			size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-		{
-			size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-			if (HUF_isError(errorCode))
-				return errorCode;
-		}
-
-		/* 16-32 symbols per loop (4-8 symbols per stream) */
-		endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-		for (; (endSignal == BIT_DStream_unfinished) & (op4 < (oend - (sizeof(bitD4.bitContainer) - 1)));) {
-			HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-			HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-			HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-			HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-			HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
-			HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
-			HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
-			HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
-			HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-			HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-			HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-			HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-			HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
-			HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
-			HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
-			HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
-
-			endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-		}
-
-		/* check corruption */
-		if (op1 > opStart2)
-			return ERROR(corruption_detected);
-		if (op2 > opStart3)
-			return ERROR(corruption_detected);
-		if (op3 > opStart4)
-			return ERROR(corruption_detected);
-		/* note : op4 already verified within main loop */
-
-		/* finish bitStreams one by one */
-		HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
-		HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
-		HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
-		HUF_decodeStreamX4(op4, &bitD4, oend, dt, dtLog);
-
-		/* check */
-		{
-			U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-			if (!endCheck)
-				return ERROR(corruption_detected);
-		}
-
-		/* decoded size */
-		return dstSize;
-	}
-}
-
-size_t HUF_decompress4X4_usingDTable(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	DTableDesc dtd = HUF_getDTableDesc(DTable);
-	if (dtd.tableType != 1)
-		return ERROR(GENERIC);
-	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress4X4_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	const BYTE *ip = (const BYTE *)cSrc;
-
-	size_t hSize = HUF_readDTableX4_wksp(dctx, cSrc, cSrcSize, workspace, workspaceSize);
-	if (HUF_isError(hSize))
-		return hSize;
-	if (hSize >= cSrcSize)
-		return ERROR(srcSize_wrong);
-	ip += hSize;
-	cSrcSize -= hSize;
-
-	return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
-}
-
-/* ********************************/
-/* Generic decompression selector */
-/* ********************************/
-
-size_t HUF_decompress1X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	DTableDesc const dtd = HUF_getDTableDesc(DTable);
-	return dtd.tableType ? HUF_decompress1X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable)
-			     : HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress4X_usingDTable(void *dst, size_t maxDstSize, const void *cSrc, size_t cSrcSize, const HUF_DTable *DTable)
-{
-	DTableDesc const dtd = HUF_getDTableDesc(DTable);
-	return dtd.tableType ? HUF_decompress4X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable)
-			     : HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
-}
-
-typedef struct {
-	U32 tableTime;
-	U32 decode256Time;
-} algo_time_t;
-static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, quad */] = {
-    /* single, double, quad */
-    {{0, 0}, {1, 1}, {2, 2}},		     /* Q==0 : impossible */
-    {{0, 0}, {1, 1}, {2, 2}},		     /* Q==1 : impossible */
-    {{38, 130}, {1313, 74}, {2151, 38}},     /* Q == 2 : 12-18% */
-    {{448, 128}, {1353, 74}, {2238, 41}},    /* Q == 3 : 18-25% */
-    {{556, 128}, {1353, 74}, {2238, 47}},    /* Q == 4 : 25-32% */
-    {{714, 128}, {1418, 74}, {2436, 53}},    /* Q == 5 : 32-38% */
-    {{883, 128}, {1437, 74}, {2464, 61}},    /* Q == 6 : 38-44% */
-    {{897, 128}, {1515, 75}, {2622, 68}},    /* Q == 7 : 44-50% */
-    {{926, 128}, {1613, 75}, {2730, 75}},    /* Q == 8 : 50-56% */
-    {{947, 128}, {1729, 77}, {3359, 77}},    /* Q == 9 : 56-62% */
-    {{1107, 128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
-    {{1177, 128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
-    {{1242, 128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
-    {{1349, 128}, {2644, 106}, {5260, 106}}, /* Q ==13 : 81-87% */
-    {{1455, 128}, {2422, 124}, {4174, 124}}, /* Q ==14 : 87-93% */
-    {{722, 128}, {1891, 145}, {1936, 146}},  /* Q ==15 : 93-99% */
-};
-
-/** HUF_selectDecoder() :
-*   Tells which decoder is likely to decode faster,
-*   based on a set of pre-determined metrics.
-*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
-*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
-U32 HUF_selectDecoder(size_t dstSize, size_t cSrcSize)
-{
-	/* decoder timing evaluation */
-	U32 const Q = (U32)(cSrcSize * 16 / dstSize); /* Q < 16 since dstSize > cSrcSize */
-	U32 const D256 = (U32)(dstSize >> 8);
-	U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
-	U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
-	DTime1 += DTime1 >> 3; /* advantage to algorithm using less memory, for cache eviction */
-
-	return DTime1 < DTime0;
-}
-
-typedef size_t (*decompressionAlgo)(void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize);
-
-size_t HUF_decompress4X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	/* validation checks */
-	if (dstSize == 0)
-		return ERROR(dstSize_tooSmall);
-	if (cSrcSize > dstSize)
-		return ERROR(corruption_detected); /* invalid */
-	if (cSrcSize == dstSize) {
-		memcpy(dst, cSrc, dstSize);
-		return dstSize;
-	} /* not compressed */
-	if (cSrcSize == 1) {
-		memset(dst, *(const BYTE *)cSrc, dstSize);
-		return dstSize;
-	} /* RLE */
-
-	{
-		U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-		return algoNb ? HUF_decompress4X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize)
-			      : HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize);
-	}
-}
-
-size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	/* validation checks */
-	if (dstSize == 0)
-		return ERROR(dstSize_tooSmall);
-	if ((cSrcSize >= dstSize) || (cSrcSize <= 1))
-		return ERROR(corruption_detected); /* invalid */
-
-	{
-		U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-		return algoNb ? HUF_decompress4X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize)
-			      : HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize);
-	}
-}
-
-size_t HUF_decompress1X_DCtx_wksp(HUF_DTable *dctx, void *dst, size_t dstSize, const void *cSrc, size_t cSrcSize, void *workspace, size_t workspaceSize)
-{
-	/* validation checks */
-	if (dstSize == 0)
-		return ERROR(dstSize_tooSmall);
-	if (cSrcSize > dstSize)
-		return ERROR(corruption_detected); /* invalid */
-	if (cSrcSize == dstSize) {
-		memcpy(dst, cSrc, dstSize);
-		return dstSize;
-	} /* not compressed */
-	if (cSrcSize == 1) {
-		memset(dst, *(const BYTE *)cSrc, dstSize);
-		return dstSize;
-	} /* RLE */
-
-	{
-		U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-		return algoNb ? HUF_decompress1X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize)
-			      : HUF_decompress1X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workspace, workspaceSize);
-	}
-}
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/mem.h b/priv/zstd/contrib/linux-kernel/lib/zstd/mem.h
deleted file mode 100644
index 42a697b..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/mem.h
+++ /dev/null
@@ -1,149 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-#ifndef MEM_H_MODULE
-#define MEM_H_MODULE
-
-/*-****************************************
-*  Dependencies
-******************************************/
-#include 
-#include  /* memcpy */
-#include   /* size_t, ptrdiff_t */
-
-/*-****************************************
-*  Compiler specifics
-******************************************/
-#define ZSTD_STATIC static __inline __attribute__((unused))
-
-/*-**************************************************************
-*  Basic Types
-*****************************************************************/
-typedef uint8_t BYTE;
-typedef uint16_t U16;
-typedef int16_t S16;
-typedef uint32_t U32;
-typedef int32_t S32;
-typedef uint64_t U64;
-typedef int64_t S64;
-typedef ptrdiff_t iPtrDiff;
-typedef uintptr_t uPtrDiff;
-
-/*-**************************************************************
-*  Memory I/O
-*****************************************************************/
-ZSTD_STATIC unsigned ZSTD_32bits(void) { return sizeof(size_t) == 4; }
-ZSTD_STATIC unsigned ZSTD_64bits(void) { return sizeof(size_t) == 8; }
-
-#if defined(__LITTLE_ENDIAN)
-#define ZSTD_LITTLE_ENDIAN 1
-#else
-#define ZSTD_LITTLE_ENDIAN 0
-#endif
-
-ZSTD_STATIC unsigned ZSTD_isLittleEndian(void) { return ZSTD_LITTLE_ENDIAN; }
-
-ZSTD_STATIC U16 ZSTD_read16(const void *memPtr) { return get_unaligned((const U16 *)memPtr); }
-
-ZSTD_STATIC U32 ZSTD_read32(const void *memPtr) { return get_unaligned((const U32 *)memPtr); }
-
-ZSTD_STATIC U64 ZSTD_read64(const void *memPtr) { return get_unaligned((const U64 *)memPtr); }
-
-ZSTD_STATIC size_t ZSTD_readST(const void *memPtr) { return get_unaligned((const size_t *)memPtr); }
-
-ZSTD_STATIC void ZSTD_write16(void *memPtr, U16 value) { put_unaligned(value, (U16 *)memPtr); }
-
-ZSTD_STATIC void ZSTD_write32(void *memPtr, U32 value) { put_unaligned(value, (U32 *)memPtr); }
-
-ZSTD_STATIC void ZSTD_write64(void *memPtr, U64 value) { put_unaligned(value, (U64 *)memPtr); }
-
-/*=== Little endian r/w ===*/
-
-ZSTD_STATIC U16 ZSTD_readLE16(const void *memPtr) { return get_unaligned_le16(memPtr); }
-
-ZSTD_STATIC void ZSTD_writeLE16(void *memPtr, U16 val) { put_unaligned_le16(val, memPtr); }
-
-ZSTD_STATIC U32 ZSTD_readLE24(const void *memPtr) { return ZSTD_readLE16(memPtr) + (((const BYTE *)memPtr)[2] << 16); }
-
-ZSTD_STATIC void ZSTD_writeLE24(void *memPtr, U32 val)
-{
-	ZSTD_writeLE16(memPtr, (U16)val);
-	((BYTE *)memPtr)[2] = (BYTE)(val >> 16);
-}
-
-ZSTD_STATIC U32 ZSTD_readLE32(const void *memPtr) { return get_unaligned_le32(memPtr); }
-
-ZSTD_STATIC void ZSTD_writeLE32(void *memPtr, U32 val32) { put_unaligned_le32(val32, memPtr); }
-
-ZSTD_STATIC U64 ZSTD_readLE64(const void *memPtr) { return get_unaligned_le64(memPtr); }
-
-ZSTD_STATIC void ZSTD_writeLE64(void *memPtr, U64 val64) { put_unaligned_le64(val64, memPtr); }
-
-ZSTD_STATIC size_t ZSTD_readLEST(const void *memPtr)
-{
-	if (ZSTD_32bits())
-		return (size_t)ZSTD_readLE32(memPtr);
-	else
-		return (size_t)ZSTD_readLE64(memPtr);
-}
-
-ZSTD_STATIC void ZSTD_writeLEST(void *memPtr, size_t val)
-{
-	if (ZSTD_32bits())
-		ZSTD_writeLE32(memPtr, (U32)val);
-	else
-		ZSTD_writeLE64(memPtr, (U64)val);
-}
-
-/*=== Big endian r/w ===*/
-
-ZSTD_STATIC U32 ZSTD_readBE32(const void *memPtr) { return get_unaligned_be32(memPtr); }
-
-ZSTD_STATIC void ZSTD_writeBE32(void *memPtr, U32 val32) { put_unaligned_be32(val32, memPtr); }
-
-ZSTD_STATIC U64 ZSTD_readBE64(const void *memPtr) { return get_unaligned_be64(memPtr); }
-
-ZSTD_STATIC void ZSTD_writeBE64(void *memPtr, U64 val64) { put_unaligned_be64(val64, memPtr); }
-
-ZSTD_STATIC size_t ZSTD_readBEST(const void *memPtr)
-{
-	if (ZSTD_32bits())
-		return (size_t)ZSTD_readBE32(memPtr);
-	else
-		return (size_t)ZSTD_readBE64(memPtr);
-}
-
-ZSTD_STATIC void ZSTD_writeBEST(void *memPtr, size_t val)
-{
-	if (ZSTD_32bits())
-		ZSTD_writeBE32(memPtr, (U32)val);
-	else
-		ZSTD_writeBE64(memPtr, (U64)val);
-}
-
-/* function safe only for comparisons */
-ZSTD_STATIC U32 ZSTD_readMINMATCH(const void *memPtr, U32 length)
-{
-	switch (length) {
-	default:
-	case 4: return ZSTD_read32(memPtr);
-	case 3:
-		if (ZSTD_isLittleEndian())
-			return ZSTD_read32(memPtr) << 8;
-		else
-			return ZSTD_read32(memPtr) >> 8;
-	}
-}
-
-#endif /* MEM_H_MODULE */
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_common.c b/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_common.c
deleted file mode 100644
index e5f06d7..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_common.c
+++ /dev/null
@@ -1,73 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include "error_private.h"
-#include "zstd_internal.h" /* declaration of ZSTD_isError, ZSTD_getErrorName, ZSTD_getErrorCode, ZSTD_getErrorString, ZSTD_versionNumber */
-#include 
-
-/*=**************************************************************
-*  Custom allocator
-****************************************************************/
-
-#define stack_push(stack, size)                                 \
-	({                                                      \
-		void *const ptr = ZSTD_PTR_ALIGN((stack)->ptr); \
-		(stack)->ptr = (char *)ptr + (size);            \
-		(stack)->ptr <= (stack)->end ? ptr : NULL;      \
-	})
-
-ZSTD_customMem ZSTD_initStack(void *workspace, size_t workspaceSize)
-{
-	ZSTD_customMem stackMem = {ZSTD_stackAlloc, ZSTD_stackFree, workspace};
-	ZSTD_stack *stack = (ZSTD_stack *)workspace;
-	/* Verify preconditions */
-	if (!workspace || workspaceSize < sizeof(ZSTD_stack) || workspace != ZSTD_PTR_ALIGN(workspace)) {
-		ZSTD_customMem error = {NULL, NULL, NULL};
-		return error;
-	}
-	/* Initialize the stack */
-	stack->ptr = workspace;
-	stack->end = (char *)workspace + workspaceSize;
-	stack_push(stack, sizeof(ZSTD_stack));
-	return stackMem;
-}
-
-void *ZSTD_stackAllocAll(void *opaque, size_t *size)
-{
-	ZSTD_stack *stack = (ZSTD_stack *)opaque;
-	*size = (BYTE const *)stack->end - (BYTE *)ZSTD_PTR_ALIGN(stack->ptr);
-	return stack_push(stack, *size);
-}
-
-void *ZSTD_stackAlloc(void *opaque, size_t size)
-{
-	ZSTD_stack *stack = (ZSTD_stack *)opaque;
-	return stack_push(stack, size);
-}
-void ZSTD_stackFree(void *opaque, void *address)
-{
-	(void)opaque;
-	(void)address;
-}
-
-void *ZSTD_malloc(size_t size, ZSTD_customMem customMem) { return customMem.customAlloc(customMem.opaque, size); }
-
-void ZSTD_free(void *ptr, ZSTD_customMem customMem)
-{
-	if (ptr != NULL)
-		customMem.customFree(customMem.opaque, ptr);
-}
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_internal.h b/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_internal.h
deleted file mode 100644
index a0fb83e..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_internal.h
+++ /dev/null
@@ -1,261 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-#ifndef ZSTD_CCOMMON_H_MODULE
-#define ZSTD_CCOMMON_H_MODULE
-
-/*-*******************************************************
-*  Compiler specifics
-*********************************************************/
-#define FORCE_INLINE static __always_inline
-#define FORCE_NOINLINE static noinline
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include "error_private.h"
-#include "mem.h"
-#include 
-#include 
-#include 
-#include 
-
-/*-*************************************
-*  shared macros
-***************************************/
-#define MIN(a, b) ((a) < (b) ? (a) : (b))
-#define MAX(a, b) ((a) > (b) ? (a) : (b))
-#define CHECK_F(f)                       \
-	{                                \
-		size_t const errcod = f; \
-		if (ERR_isError(errcod)) \
-			return errcod;   \
-	} /* check and Forward error code */
-#define CHECK_E(f, e)                    \
-	{                                \
-		size_t const errcod = f; \
-		if (ERR_isError(errcod)) \
-			return ERROR(e); \
-	} /* check and send Error code */
-#define ZSTD_STATIC_ASSERT(c)                                   \
-	{                                                       \
-		enum { ZSTD_static_assert = 1 / (int)(!!(c)) }; \
-	}
-
-/*-*************************************
-*  Common constants
-***************************************/
-#define ZSTD_OPT_NUM (1 << 12)
-#define ZSTD_DICT_MAGIC 0xEC30A437 /* v0.7+ */
-
-#define ZSTD_REP_NUM 3		      /* number of repcodes */
-#define ZSTD_REP_CHECK (ZSTD_REP_NUM) /* number of repcodes to check by the optimal parser */
-#define ZSTD_REP_MOVE (ZSTD_REP_NUM - 1)
-#define ZSTD_REP_MOVE_OPT (ZSTD_REP_NUM)
-static const U32 repStartValue[ZSTD_REP_NUM] = {1, 4, 8};
-
-#define KB *(1 << 10)
-#define MB *(1 << 20)
-#define GB *(1U << 30)
-
-#define BIT7 128
-#define BIT6 64
-#define BIT5 32
-#define BIT4 16
-#define BIT1 2
-#define BIT0 1
-
-#define ZSTD_WINDOWLOG_ABSOLUTEMIN 10
-static const size_t ZSTD_fcs_fieldSize[4] = {0, 2, 4, 8};
-static const size_t ZSTD_did_fieldSize[4] = {0, 1, 2, 4};
-
-#define ZSTD_BLOCKHEADERSIZE 3 /* C standard doesn't allow `static const` variable to be init using another `static const` variable */
-static const size_t ZSTD_blockHeaderSize = ZSTD_BLOCKHEADERSIZE;
-typedef enum { bt_raw, bt_rle, bt_compressed, bt_reserved } blockType_e;
-
-#define MIN_SEQUENCES_SIZE 1									  /* nbSeq==0 */
-#define MIN_CBLOCK_SIZE (1 /*litCSize*/ + 1 /* RLE or RAW */ + MIN_SEQUENCES_SIZE /* nbSeq==0 */) /* for a non-null block */
-
-#define HufLog 12
-typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingType_e;
-
-#define LONGNBSEQ 0x7F00
-
-#define MINMATCH 3
-#define EQUAL_READ32 4
-
-#define Litbits 8
-#define MaxLit ((1 << Litbits) - 1)
-#define MaxML 52
-#define MaxLL 35
-#define MaxOff 28
-#define MaxSeq MAX(MaxLL, MaxML) /* Assumption : MaxOff < MaxLL,MaxML */
-#define MLFSELog 9
-#define LLFSELog 9
-#define OffFSELog 8
-
-static const U32 LL_bits[MaxLL + 1] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
-static const S16 LL_defaultNorm[MaxLL + 1] = {4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1, -1, -1, -1, -1};
-#define LL_DEFAULTNORMLOG 6 /* for static allocation */
-static const U32 LL_defaultNormLog = LL_DEFAULTNORMLOG;
-
-static const U32 ML_bits[MaxML + 1] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  0, 0,
-				       0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
-static const S16 ML_defaultNorm[MaxML + 1] = {1, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  1,  1,  1,  1,  1,  1, 1,
-					      1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1};
-#define ML_DEFAULTNORMLOG 6 /* for static allocation */
-static const U32 ML_defaultNormLog = ML_DEFAULTNORMLOG;
-
-static const S16 OF_defaultNorm[MaxOff + 1] = {1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1};
-#define OF_DEFAULTNORMLOG 5 /* for static allocation */
-static const U32 OF_defaultNormLog = OF_DEFAULTNORMLOG;
-
-/*-*******************************************
-*  Shared functions to include for inlining
-*********************************************/
-ZSTD_STATIC void ZSTD_copy8(void *dst, const void *src) {
-	memcpy(dst, src, 8);
-}
-/*! ZSTD_wildcopy() :
-*   custom version of memcpy(), can copy up to 7 bytes too many (8 bytes if length==0) */
-#define WILDCOPY_OVERLENGTH 8
-ZSTD_STATIC void ZSTD_wildcopy(void *dst, const void *src, ptrdiff_t length)
-{
-	const BYTE* ip = (const BYTE*)src;
-	BYTE* op = (BYTE*)dst;
-	BYTE* const oend = op + length;
-	/* Work around https://gcc.gnu.org/bugzilla/show_bug.cgi?id=81388.
-	 * Avoid the bad case where the loop only runs once by handling the
-	 * special case separately. This doesn't trigger the bug because it
-	 * doesn't involve pointer/integer overflow.
-	 */
-	if (length <= 8)
-		return ZSTD_copy8(dst, src);
-	do {
-		ZSTD_copy8(op, ip);
-		op += 8;
-		ip += 8;
-	} while (op < oend);
-}
-
-/*-*******************************************
-*  Private interfaces
-*********************************************/
-typedef struct ZSTD_stats_s ZSTD_stats_t;
-
-typedef struct {
-	U32 off;
-	U32 len;
-} ZSTD_match_t;
-
-typedef struct {
-	U32 price;
-	U32 off;
-	U32 mlen;
-	U32 litlen;
-	U32 rep[ZSTD_REP_NUM];
-} ZSTD_optimal_t;
-
-typedef struct seqDef_s {
-	U32 offset;
-	U16 litLength;
-	U16 matchLength;
-} seqDef;
-
-typedef struct {
-	seqDef *sequencesStart;
-	seqDef *sequences;
-	BYTE *litStart;
-	BYTE *lit;
-	BYTE *llCode;
-	BYTE *mlCode;
-	BYTE *ofCode;
-	U32 longLengthID; /* 0 == no longLength; 1 == Lit.longLength; 2 == Match.longLength; */
-	U32 longLengthPos;
-	/* opt */
-	ZSTD_optimal_t *priceTable;
-	ZSTD_match_t *matchTable;
-	U32 *matchLengthFreq;
-	U32 *litLengthFreq;
-	U32 *litFreq;
-	U32 *offCodeFreq;
-	U32 matchLengthSum;
-	U32 matchSum;
-	U32 litLengthSum;
-	U32 litSum;
-	U32 offCodeSum;
-	U32 log2matchLengthSum;
-	U32 log2matchSum;
-	U32 log2litLengthSum;
-	U32 log2litSum;
-	U32 log2offCodeSum;
-	U32 factor;
-	U32 staticPrices;
-	U32 cachedPrice;
-	U32 cachedLitLength;
-	const BYTE *cachedLiterals;
-} seqStore_t;
-
-const seqStore_t *ZSTD_getSeqStore(const ZSTD_CCtx *ctx);
-void ZSTD_seqToCodes(const seqStore_t *seqStorePtr);
-int ZSTD_isSkipFrame(ZSTD_DCtx *dctx);
-
-/*= Custom memory allocation functions */
-typedef void *(*ZSTD_allocFunction)(void *opaque, size_t size);
-typedef void (*ZSTD_freeFunction)(void *opaque, void *address);
-typedef struct {
-	ZSTD_allocFunction customAlloc;
-	ZSTD_freeFunction customFree;
-	void *opaque;
-} ZSTD_customMem;
-
-void *ZSTD_malloc(size_t size, ZSTD_customMem customMem);
-void ZSTD_free(void *ptr, ZSTD_customMem customMem);
-
-/*====== stack allocation  ======*/
-
-typedef struct {
-	void *ptr;
-	const void *end;
-} ZSTD_stack;
-
-#define ZSTD_ALIGN(x) ALIGN(x, sizeof(size_t))
-#define ZSTD_PTR_ALIGN(p) PTR_ALIGN(p, sizeof(size_t))
-
-ZSTD_customMem ZSTD_initStack(void *workspace, size_t workspaceSize);
-
-void *ZSTD_stackAllocAll(void *opaque, size_t *size);
-void *ZSTD_stackAlloc(void *opaque, size_t size);
-void ZSTD_stackFree(void *opaque, void *address);
-
-/*======  common function  ======*/
-
-ZSTD_STATIC U32 ZSTD_highbit32(U32 val) { return 31 - __builtin_clz(val); }
-
-/* hidden functions */
-
-/* ZSTD_invalidateRepCodes() :
- * ensures next compression will not use repcodes from previous block.
- * Note : only works with regular variant;
- *        do not use with extDict variant ! */
-void ZSTD_invalidateRepCodes(ZSTD_CCtx *cctx);
-
-size_t ZSTD_freeCCtx(ZSTD_CCtx *cctx);
-size_t ZSTD_freeDCtx(ZSTD_DCtx *dctx);
-size_t ZSTD_freeCDict(ZSTD_CDict *cdict);
-size_t ZSTD_freeDDict(ZSTD_DDict *cdict);
-size_t ZSTD_freeCStream(ZSTD_CStream *zcs);
-size_t ZSTD_freeDStream(ZSTD_DStream *zds);
-
-#endif /* ZSTD_CCOMMON_H_MODULE */
diff --git a/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_opt.h b/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_opt.h
deleted file mode 100644
index ecdd725..0000000
--- a/priv/zstd/contrib/linux-kernel/lib/zstd/zstd_opt.h
+++ /dev/null
@@ -1,1012 +0,0 @@
-/**
- * Copyright (c) 2016-present, Przemyslaw Skibinski, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under the BSD-style license found in the
- * LICENSE file in the root directory of https://github.com/facebook/zstd.
- *
- * This program is free software; you can redistribute it and/or modify it under
- * the terms of the GNU General Public License version 2 as published by the
- * Free Software Foundation. This program is dual-licensed; you may select
- * either version 2 of the GNU General Public License ("GPL") or BSD license
- * ("BSD").
- */
-
-/* Note : this file is intended to be included within zstd_compress.c */
-
-#ifndef ZSTD_OPT_H_91842398743
-#define ZSTD_OPT_H_91842398743
-
-#define ZSTD_LITFREQ_ADD 2
-#define ZSTD_FREQ_DIV 4
-#define ZSTD_MAX_PRICE (1 << 30)
-
-/*-*************************************
-*  Price functions for optimal parser
-***************************************/
-FORCE_INLINE void ZSTD_setLog2Prices(seqStore_t *ssPtr)
-{
-	ssPtr->log2matchLengthSum = ZSTD_highbit32(ssPtr->matchLengthSum + 1);
-	ssPtr->log2litLengthSum = ZSTD_highbit32(ssPtr->litLengthSum + 1);
-	ssPtr->log2litSum = ZSTD_highbit32(ssPtr->litSum + 1);
-	ssPtr->log2offCodeSum = ZSTD_highbit32(ssPtr->offCodeSum + 1);
-	ssPtr->factor = 1 + ((ssPtr->litSum >> 5) / ssPtr->litLengthSum) + ((ssPtr->litSum << 1) / (ssPtr->litSum + ssPtr->matchSum));
-}
-
-ZSTD_STATIC void ZSTD_rescaleFreqs(seqStore_t *ssPtr, const BYTE *src, size_t srcSize)
-{
-	unsigned u;
-
-	ssPtr->cachedLiterals = NULL;
-	ssPtr->cachedPrice = ssPtr->cachedLitLength = 0;
-	ssPtr->staticPrices = 0;
-
-	if (ssPtr->litLengthSum == 0) {
-		if (srcSize <= 1024)
-			ssPtr->staticPrices = 1;
-
-		for (u = 0; u <= MaxLit; u++)
-			ssPtr->litFreq[u] = 0;
-		for (u = 0; u < srcSize; u++)
-			ssPtr->litFreq[src[u]]++;
-
-		ssPtr->litSum = 0;
-		ssPtr->litLengthSum = MaxLL + 1;
-		ssPtr->matchLengthSum = MaxML + 1;
-		ssPtr->offCodeSum = (MaxOff + 1);
-		ssPtr->matchSum = (ZSTD_LITFREQ_ADD << Litbits);
-
-		for (u = 0; u <= MaxLit; u++) {
-			ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u] >> ZSTD_FREQ_DIV);
-			ssPtr->litSum += ssPtr->litFreq[u];
-		}
-		for (u = 0; u <= MaxLL; u++)
-			ssPtr->litLengthFreq[u] = 1;
-		for (u = 0; u <= MaxML; u++)
-			ssPtr->matchLengthFreq[u] = 1;
-		for (u = 0; u <= MaxOff; u++)
-			ssPtr->offCodeFreq[u] = 1;
-	} else {
-		ssPtr->matchLengthSum = 0;
-		ssPtr->litLengthSum = 0;
-		ssPtr->offCodeSum = 0;
-		ssPtr->matchSum = 0;
-		ssPtr->litSum = 0;
-
-		for (u = 0; u <= MaxLit; u++) {
-			ssPtr->litFreq[u] = 1 + (ssPtr->litFreq[u] >> (ZSTD_FREQ_DIV + 1));
-			ssPtr->litSum += ssPtr->litFreq[u];
-		}
-		for (u = 0; u <= MaxLL; u++) {
-			ssPtr->litLengthFreq[u] = 1 + (ssPtr->litLengthFreq[u] >> (ZSTD_FREQ_DIV + 1));
-			ssPtr->litLengthSum += ssPtr->litLengthFreq[u];
-		}
-		for (u = 0; u <= MaxML; u++) {
-			ssPtr->matchLengthFreq[u] = 1 + (ssPtr->matchLengthFreq[u] >> ZSTD_FREQ_DIV);
-			ssPtr->matchLengthSum += ssPtr->matchLengthFreq[u];
-			ssPtr->matchSum += ssPtr->matchLengthFreq[u] * (u + 3);
-		}
-		ssPtr->matchSum *= ZSTD_LITFREQ_ADD;
-		for (u = 0; u <= MaxOff; u++) {
-			ssPtr->offCodeFreq[u] = 1 + (ssPtr->offCodeFreq[u] >> ZSTD_FREQ_DIV);
-			ssPtr->offCodeSum += ssPtr->offCodeFreq[u];
-		}
-	}
-
-	ZSTD_setLog2Prices(ssPtr);
-}
-
-FORCE_INLINE U32 ZSTD_getLiteralPrice(seqStore_t *ssPtr, U32 litLength, const BYTE *literals)
-{
-	U32 price, u;
-
-	if (ssPtr->staticPrices)
-		return ZSTD_highbit32((U32)litLength + 1) + (litLength * 6);
-
-	if (litLength == 0)
-		return ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[0] + 1);
-
-	/* literals */
-	if (ssPtr->cachedLiterals == literals) {
-		U32 const additional = litLength - ssPtr->cachedLitLength;
-		const BYTE *literals2 = ssPtr->cachedLiterals + ssPtr->cachedLitLength;
-		price = ssPtr->cachedPrice + additional * ssPtr->log2litSum;
-		for (u = 0; u < additional; u++)
-			price -= ZSTD_highbit32(ssPtr->litFreq[literals2[u]] + 1);
-		ssPtr->cachedPrice = price;
-		ssPtr->cachedLitLength = litLength;
-	} else {
-		price = litLength * ssPtr->log2litSum;
-		for (u = 0; u < litLength; u++)
-			price -= ZSTD_highbit32(ssPtr->litFreq[literals[u]] + 1);
-
-		if (litLength >= 12) {
-			ssPtr->cachedLiterals = literals;
-			ssPtr->cachedPrice = price;
-			ssPtr->cachedLitLength = litLength;
-		}
-	}
-
-	/* literal Length */
-	{
-		const BYTE LL_deltaCode = 19;
-		const BYTE llCode = (litLength > 63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-		price += LL_bits[llCode] + ssPtr->log2litLengthSum - ZSTD_highbit32(ssPtr->litLengthFreq[llCode] + 1);
-	}
-
-	return price;
-}
-
-FORCE_INLINE U32 ZSTD_getPrice(seqStore_t *seqStorePtr, U32 litLength, const BYTE *literals, U32 offset, U32 matchLength, const int ultra)
-{
-	/* offset */
-	U32 price;
-	BYTE const offCode = (BYTE)ZSTD_highbit32(offset + 1);
-
-	if (seqStorePtr->staticPrices)
-		return ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + ZSTD_highbit32((U32)matchLength + 1) + 16 + offCode;
-
-	price = offCode + seqStorePtr->log2offCodeSum - ZSTD_highbit32(seqStorePtr->offCodeFreq[offCode] + 1);
-	if (!ultra && offCode >= 20)
-		price += (offCode - 19) * 2;
-
-	/* match Length */
-	{
-		const BYTE ML_deltaCode = 36;
-		const BYTE mlCode = (matchLength > 127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
-		price += ML_bits[mlCode] + seqStorePtr->log2matchLengthSum - ZSTD_highbit32(seqStorePtr->matchLengthFreq[mlCode] + 1);
-	}
-
-	return price + ZSTD_getLiteralPrice(seqStorePtr, litLength, literals) + seqStorePtr->factor;
-}
-
-ZSTD_STATIC void ZSTD_updatePrice(seqStore_t *seqStorePtr, U32 litLength, const BYTE *literals, U32 offset, U32 matchLength)
-{
-	U32 u;
-
-	/* literals */
-	seqStorePtr->litSum += litLength * ZSTD_LITFREQ_ADD;
-	for (u = 0; u < litLength; u++)
-		seqStorePtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
-
-	/* literal Length */
-	{
-		const BYTE LL_deltaCode = 19;
-		const BYTE llCode = (litLength > 63) ? (BYTE)ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-		seqStorePtr->litLengthFreq[llCode]++;
-		seqStorePtr->litLengthSum++;
-	}
-
-	/* match offset */
-	{
-		BYTE const offCode = (BYTE)ZSTD_highbit32(offset + 1);
-		seqStorePtr->offCodeSum++;
-		seqStorePtr->offCodeFreq[offCode]++;
-	}
-
-	/* match Length */
-	{
-		const BYTE ML_deltaCode = 36;
-		const BYTE mlCode = (matchLength > 127) ? (BYTE)ZSTD_highbit32(matchLength) + ML_deltaCode : ML_Code[matchLength];
-		seqStorePtr->matchLengthFreq[mlCode]++;
-		seqStorePtr->matchLengthSum++;
-	}
-
-	ZSTD_setLog2Prices(seqStorePtr);
-}
-
-#define SET_PRICE(pos, mlen_, offset_, litlen_, price_)           \
-	{                                                         \
-		while (last_pos < pos) {                          \
-			opt[last_pos + 1].price = ZSTD_MAX_PRICE; \
-			last_pos++;                               \
-		}                                                 \
-		opt[pos].mlen = mlen_;                            \
-		opt[pos].off = offset_;                           \
-		opt[pos].litlen = litlen_;                        \
-		opt[pos].price = price_;                          \
-	}
-
-/* Update hashTable3 up to ip (excluded)
-   Assumption : always within prefix (i.e. not within extDict) */
-FORCE_INLINE
-U32 ZSTD_insertAndFindFirstIndexHash3(ZSTD_CCtx *zc, const BYTE *ip)
-{
-	U32 *const hashTable3 = zc->hashTable3;
-	U32 const hashLog3 = zc->hashLog3;
-	const BYTE *const base = zc->base;
-	U32 idx = zc->nextToUpdate3;
-	const U32 target = zc->nextToUpdate3 = (U32)(ip - base);
-	const size_t hash3 = ZSTD_hash3Ptr(ip, hashLog3);
-
-	while (idx < target) {
-		hashTable3[ZSTD_hash3Ptr(base + idx, hashLog3)] = idx;
-		idx++;
-	}
-
-	return hashTable3[hash3];
-}
-
-/*-*************************************
-*  Binary Tree search
-***************************************/
-static U32 ZSTD_insertBtAndGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, U32 nbCompares, const U32 mls, U32 extDict,
-					 ZSTD_match_t *matches, const U32 minMatchLen)
-{
-	const BYTE *const base = zc->base;
-	const U32 curr = (U32)(ip - base);
-	const U32 hashLog = zc->params.cParams.hashLog;
-	const size_t h = ZSTD_hashPtr(ip, hashLog, mls);
-	U32 *const hashTable = zc->hashTable;
-	U32 matchIndex = hashTable[h];
-	U32 *const bt = zc->chainTable;
-	const U32 btLog = zc->params.cParams.chainLog - 1;
-	const U32 btMask = (1U << btLog) - 1;
-	size_t commonLengthSmaller = 0, commonLengthLarger = 0;
-	const BYTE *const dictBase = zc->dictBase;
-	const U32 dictLimit = zc->dictLimit;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-	const BYTE *const prefixStart = base + dictLimit;
-	const U32 btLow = btMask >= curr ? 0 : curr - btMask;
-	const U32 windowLow = zc->lowLimit;
-	U32 *smallerPtr = bt + 2 * (curr & btMask);
-	U32 *largerPtr = bt + 2 * (curr & btMask) + 1;
-	U32 matchEndIdx = curr + 8;
-	U32 dummy32; /* to be nullified at the end */
-	U32 mnum = 0;
-
-	const U32 minMatch = (mls == 3) ? 3 : 4;
-	size_t bestLength = minMatchLen - 1;
-
-	if (minMatch == 3) { /* HC3 match finder */
-		U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3(zc, ip);
-		if (matchIndex3 > windowLow && (curr - matchIndex3 < (1 << 18))) {
-			const BYTE *match;
-			size_t currMl = 0;
-			if ((!extDict) || matchIndex3 >= dictLimit) {
-				match = base + matchIndex3;
-				if (match[bestLength] == ip[bestLength])
-					currMl = ZSTD_count(ip, match, iLimit);
-			} else {
-				match = dictBase + matchIndex3;
-				if (ZSTD_readMINMATCH(match, MINMATCH) ==
-				    ZSTD_readMINMATCH(ip, MINMATCH)) /* assumption : matchIndex3 <= dictLimit-4 (by table construction) */
-					currMl = ZSTD_count_2segments(ip + MINMATCH, match + MINMATCH, iLimit, dictEnd, prefixStart) + MINMATCH;
-			}
-
-			/* save best solution */
-			if (currMl > bestLength) {
-				bestLength = currMl;
-				matches[mnum].off = ZSTD_REP_MOVE_OPT + curr - matchIndex3;
-				matches[mnum].len = (U32)currMl;
-				mnum++;
-				if (currMl > ZSTD_OPT_NUM)
-					goto update;
-				if (ip + currMl == iLimit)
-					goto update; /* best possible, and avoid read overflow*/
-			}
-		}
-	}
-
-	hashTable[h] = curr; /* Update Hash Table */
-
-	while (nbCompares-- && (matchIndex > windowLow)) {
-		U32 *nextPtr = bt + 2 * (matchIndex & btMask);
-		size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger); /* guaranteed minimum nb of common bytes */
-		const BYTE *match;
-
-		if ((!extDict) || (matchIndex + matchLength >= dictLimit)) {
-			match = base + matchIndex;
-			if (match[matchLength] == ip[matchLength]) {
-				matchLength += ZSTD_count(ip + matchLength + 1, match + matchLength + 1, iLimit) + 1;
-			}
-		} else {
-			match = dictBase + matchIndex;
-			matchLength += ZSTD_count_2segments(ip + matchLength, match + matchLength, iLimit, dictEnd, prefixStart);
-			if (matchIndex + matchLength >= dictLimit)
-				match = base + matchIndex; /* to prepare for next usage of match[matchLength] */
-		}
-
-		if (matchLength > bestLength) {
-			if (matchLength > matchEndIdx - matchIndex)
-				matchEndIdx = matchIndex + (U32)matchLength;
-			bestLength = matchLength;
-			matches[mnum].off = ZSTD_REP_MOVE_OPT + curr - matchIndex;
-			matches[mnum].len = (U32)matchLength;
-			mnum++;
-			if (matchLength > ZSTD_OPT_NUM)
-				break;
-			if (ip + matchLength == iLimit) /* equal : no way to know if inf or sup */
-				break;			/* drop, to guarantee consistency (miss a little bit of compression) */
-		}
-
-		if (match[matchLength] < ip[matchLength]) {
-			/* match is smaller than curr */
-			*smallerPtr = matchIndex;	  /* update smaller idx */
-			commonLengthSmaller = matchLength; /* all smaller will now have at least this guaranteed common length */
-			if (matchIndex <= btLow) {
-				smallerPtr = &dummy32;
-				break;
-			}			  /* beyond tree size, stop the search */
-			smallerPtr = nextPtr + 1; /* new "smaller" => larger of match */
-			matchIndex = nextPtr[1];  /* new matchIndex larger than previous (closer to curr) */
-		} else {
-			/* match is larger than curr */
-			*largerPtr = matchIndex;
-			commonLengthLarger = matchLength;
-			if (matchIndex <= btLow) {
-				largerPtr = &dummy32;
-				break;
-			} /* beyond tree size, stop the search */
-			largerPtr = nextPtr;
-			matchIndex = nextPtr[0];
-		}
-	}
-
-	*smallerPtr = *largerPtr = 0;
-
-update:
-	zc->nextToUpdate = (matchEndIdx > curr + 8) ? matchEndIdx - 8 : curr + 1;
-	return mnum;
-}
-
-/** Tree updater, providing best match */
-static U32 ZSTD_BtGetAllMatches(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls, ZSTD_match_t *matches,
-				const U32 minMatchLen)
-{
-	if (ip < zc->base + zc->nextToUpdate)
-		return 0; /* skipped area */
-	ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-	return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 0, matches, minMatchLen);
-}
-
-static U32 ZSTD_BtGetAllMatches_selectMLS(ZSTD_CCtx *zc, /* Index table will be updated */
-					  const BYTE *ip, const BYTE *const iHighLimit, const U32 maxNbAttempts, const U32 matchLengthSearch,
-					  ZSTD_match_t *matches, const U32 minMatchLen)
-{
-	switch (matchLengthSearch) {
-	case 3: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
-	default:
-	case 4: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
-	case 5: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
-	case 7:
-	case 6: return ZSTD_BtGetAllMatches(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
-	}
-}
-
-/** Tree updater, providing best match */
-static U32 ZSTD_BtGetAllMatches_extDict(ZSTD_CCtx *zc, const BYTE *const ip, const BYTE *const iLimit, const U32 maxNbAttempts, const U32 mls,
-					ZSTD_match_t *matches, const U32 minMatchLen)
-{
-	if (ip < zc->base + zc->nextToUpdate)
-		return 0; /* skipped area */
-	ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-	return ZSTD_insertBtAndGetAllMatches(zc, ip, iLimit, maxNbAttempts, mls, 1, matches, minMatchLen);
-}
-
-static U32 ZSTD_BtGetAllMatches_selectMLS_extDict(ZSTD_CCtx *zc, /* Index table will be updated */
-						  const BYTE *ip, const BYTE *const iHighLimit, const U32 maxNbAttempts, const U32 matchLengthSearch,
-						  ZSTD_match_t *matches, const U32 minMatchLen)
-{
-	switch (matchLengthSearch) {
-	case 3: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 3, matches, minMatchLen);
-	default:
-	case 4: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 4, matches, minMatchLen);
-	case 5: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 5, matches, minMatchLen);
-	case 7:
-	case 6: return ZSTD_BtGetAllMatches_extDict(zc, ip, iHighLimit, maxNbAttempts, 6, matches, minMatchLen);
-	}
-}
-
-/*-*******************************
-*  Optimal parser
-*********************************/
-FORCE_INLINE
-void ZSTD_compressBlock_opt_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const int ultra)
-{
-	seqStore_t *seqStorePtr = &(ctx->seqStore);
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - 8;
-	const BYTE *const base = ctx->base;
-	const BYTE *const prefixStart = base + ctx->dictLimit;
-
-	const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
-	const U32 sufficient_len = ctx->params.cParams.targetLength;
-	const U32 mls = ctx->params.cParams.searchLength;
-	const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
-
-	ZSTD_optimal_t *opt = seqStorePtr->priceTable;
-	ZSTD_match_t *matches = seqStorePtr->matchTable;
-	const BYTE *inr;
-	U32 offset, rep[ZSTD_REP_NUM];
-
-	/* init */
-	ctx->nextToUpdate3 = ctx->nextToUpdate;
-	ZSTD_rescaleFreqs(seqStorePtr, (const BYTE *)src, srcSize);
-	ip += (ip == prefixStart);
-	{
-		U32 i;
-		for (i = 0; i < ZSTD_REP_NUM; i++)
-			rep[i] = ctx->rep[i];
-	}
-
-	/* Match Loop */
-	while (ip < ilimit) {
-		U32 cur, match_num, last_pos, litlen, price;
-		U32 u, mlen, best_mlen, best_off, litLength;
-		memset(opt, 0, sizeof(ZSTD_optimal_t));
-		last_pos = 0;
-		litlen = (U32)(ip - anchor);
-
-		/* check repCode */
-		{
-			U32 i, last_i = ZSTD_REP_CHECK + (ip == anchor);
-			for (i = (ip == anchor); i < last_i; i++) {
-				const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
-				if ((repCur > 0) && (repCur < (S32)(ip - prefixStart)) &&
-				    (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repCur, minMatch))) {
-					mlen = (U32)ZSTD_count(ip + minMatch, ip + minMatch - repCur, iend) + minMatch;
-					if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
-						best_mlen = mlen;
-						best_off = i;
-						cur = 0;
-						last_pos = 1;
-						goto _storeSequence;
-					}
-					best_off = i - (ip == anchor);
-					do {
-						price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-						if (mlen > last_pos || price < opt[mlen].price)
-							SET_PRICE(mlen, mlen, i, litlen, price); /* note : macro modifies last_pos */
-						mlen--;
-					} while (mlen >= minMatch);
-				}
-			}
-		}
-
-		match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, ip, iend, maxSearches, mls, matches, minMatch);
-
-		if (!last_pos && !match_num) {
-			ip++;
-			continue;
-		}
-
-		if (match_num && (matches[match_num - 1].len > sufficient_len || matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-			best_mlen = matches[match_num - 1].len;
-			best_off = matches[match_num - 1].off;
-			cur = 0;
-			last_pos = 1;
-			goto _storeSequence;
-		}
-
-		/* set prices using matches at position = 0 */
-		best_mlen = (last_pos) ? last_pos : minMatch;
-		for (u = 0; u < match_num; u++) {
-			mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-			best_mlen = matches[u].len;
-			while (mlen <= best_mlen) {
-				price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-				if (mlen > last_pos || price < opt[mlen].price)
-					SET_PRICE(mlen, mlen, matches[u].off, litlen, price); /* note : macro modifies last_pos */
-				mlen++;
-			}
-		}
-
-		if (last_pos < minMatch) {
-			ip++;
-			continue;
-		}
-
-		/* initialize opt[0] */
-		{
-			U32 i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				opt[0].rep[i] = rep[i];
-		}
-		opt[0].mlen = 1;
-		opt[0].litlen = litlen;
-
-		/* check further positions */
-		for (cur = 1; cur <= last_pos; cur++) {
-			inr = ip + cur;
-
-			if (opt[cur - 1].mlen == 1) {
-				litlen = opt[cur - 1].litlen + 1;
-				if (cur > litlen) {
-					price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen);
-				} else
-					price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
-			} else {
-				litlen = 1;
-				price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1);
-			}
-
-			if (cur > last_pos || price <= opt[cur].price)
-				SET_PRICE(cur, 1, 0, litlen, price);
-
-			if (cur == last_pos)
-				break;
-
-			if (inr > ilimit) /* last match must start at a minimum distance of 8 from oend */
-				continue;
-
-			mlen = opt[cur].mlen;
-			if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
-				opt[cur].rep[2] = opt[cur - mlen].rep[1];
-				opt[cur].rep[1] = opt[cur - mlen].rep[0];
-				opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
-			} else {
-				opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur - mlen].rep[1] : opt[cur - mlen].rep[2];
-				opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur - mlen].rep[0] : opt[cur - mlen].rep[1];
-				opt[cur].rep[0] =
-				    ((opt[cur].off == ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur - mlen].rep[0] - 1) : (opt[cur - mlen].rep[opt[cur].off]);
-			}
-
-			best_mlen = minMatch;
-			{
-				U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
-				for (i = (opt[cur].mlen != 1); i < last_i; i++) { /* check rep */
-					const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
-					if ((repCur > 0) && (repCur < (S32)(inr - prefixStart)) &&
-					    (ZSTD_readMINMATCH(inr, minMatch) == ZSTD_readMINMATCH(inr - repCur, minMatch))) {
-						mlen = (U32)ZSTD_count(inr + minMatch, inr + minMatch - repCur, iend) + minMatch;
-
-						if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
-							best_mlen = mlen;
-							best_off = i;
-							last_pos = cur + 1;
-							goto _storeSequence;
-						}
-
-						best_off = i - (opt[cur].mlen != 1);
-						if (mlen > best_mlen)
-							best_mlen = mlen;
-
-						do {
-							if (opt[cur].mlen == 1) {
-								litlen = opt[cur].litlen;
-								if (cur > litlen) {
-									price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr - litlen,
-															best_off, mlen - MINMATCH, ultra);
-								} else
-									price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-							} else {
-								litlen = 0;
-								price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
-							}
-
-							if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
-								SET_PRICE(cur + mlen, mlen, i, litlen, price);
-							mlen--;
-						} while (mlen >= minMatch);
-					}
-				}
-			}
-
-			match_num = ZSTD_BtGetAllMatches_selectMLS(ctx, inr, iend, maxSearches, mls, matches, best_mlen);
-
-			if (match_num > 0 && (matches[match_num - 1].len > sufficient_len || cur + matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-				best_mlen = matches[match_num - 1].len;
-				best_off = matches[match_num - 1].off;
-				last_pos = cur + 1;
-				goto _storeSequence;
-			}
-
-			/* set prices using matches at position = cur */
-			for (u = 0; u < match_num; u++) {
-				mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-				best_mlen = matches[u].len;
-
-				while (mlen <= best_mlen) {
-					if (opt[cur].mlen == 1) {
-						litlen = opt[cur].litlen;
-						if (cur > litlen)
-							price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip + cur - litlen,
-													matches[u].off - 1, mlen - MINMATCH, ultra);
-						else
-							price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-					} else {
-						litlen = 0;
-						price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off - 1, mlen - MINMATCH, ultra);
-					}
-
-					if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
-						SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
-
-					mlen++;
-				}
-			}
-		}
-
-		best_mlen = opt[last_pos].mlen;
-		best_off = opt[last_pos].off;
-		cur = last_pos - best_mlen;
-
-	/* store sequence */
-_storeSequence: /* cur, last_pos, best_mlen, best_off have to be set */
-		opt[0].mlen = 1;
-
-		while (1) {
-			mlen = opt[cur].mlen;
-			offset = opt[cur].off;
-			opt[cur].mlen = best_mlen;
-			opt[cur].off = best_off;
-			best_mlen = mlen;
-			best_off = offset;
-			if (mlen > cur)
-				break;
-			cur -= mlen;
-		}
-
-		for (u = 0; u <= last_pos;) {
-			u += opt[u].mlen;
-		}
-
-		for (cur = 0; cur < last_pos;) {
-			mlen = opt[cur].mlen;
-			if (mlen == 1) {
-				ip++;
-				cur++;
-				continue;
-			}
-			offset = opt[cur].off;
-			cur += mlen;
-			litLength = (U32)(ip - anchor);
-
-			if (offset > ZSTD_REP_MOVE_OPT) {
-				rep[2] = rep[1];
-				rep[1] = rep[0];
-				rep[0] = offset - ZSTD_REP_MOVE_OPT;
-				offset--;
-			} else {
-				if (offset != 0) {
-					best_off = (offset == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
-					if (offset != 1)
-						rep[2] = rep[1];
-					rep[1] = rep[0];
-					rep[0] = best_off;
-				}
-				if (litLength == 0)
-					offset--;
-			}
-
-			ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-			ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-			anchor = ip = ip + mlen;
-		}
-	} /* for (cur=0; cur < last_pos; ) */
-
-	/* Save reps for next block */
-	{
-		int i;
-		for (i = 0; i < ZSTD_REP_NUM; i++)
-			ctx->repToConfirm[i] = rep[i];
-	}
-
-	/* Last Literals */
-	{
-		size_t const lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-FORCE_INLINE
-void ZSTD_compressBlock_opt_extDict_generic(ZSTD_CCtx *ctx, const void *src, size_t srcSize, const int ultra)
-{
-	seqStore_t *seqStorePtr = &(ctx->seqStore);
-	const BYTE *const istart = (const BYTE *)src;
-	const BYTE *ip = istart;
-	const BYTE *anchor = istart;
-	const BYTE *const iend = istart + srcSize;
-	const BYTE *const ilimit = iend - 8;
-	const BYTE *const base = ctx->base;
-	const U32 lowestIndex = ctx->lowLimit;
-	const U32 dictLimit = ctx->dictLimit;
-	const BYTE *const prefixStart = base + dictLimit;
-	const BYTE *const dictBase = ctx->dictBase;
-	const BYTE *const dictEnd = dictBase + dictLimit;
-
-	const U32 maxSearches = 1U << ctx->params.cParams.searchLog;
-	const U32 sufficient_len = ctx->params.cParams.targetLength;
-	const U32 mls = ctx->params.cParams.searchLength;
-	const U32 minMatch = (ctx->params.cParams.searchLength == 3) ? 3 : 4;
-
-	ZSTD_optimal_t *opt = seqStorePtr->priceTable;
-	ZSTD_match_t *matches = seqStorePtr->matchTable;
-	const BYTE *inr;
-
-	/* init */
-	U32 offset, rep[ZSTD_REP_NUM];
-	{
-		U32 i;
-		for (i = 0; i < ZSTD_REP_NUM; i++)
-			rep[i] = ctx->rep[i];
-	}
-
-	ctx->nextToUpdate3 = ctx->nextToUpdate;
-	ZSTD_rescaleFreqs(seqStorePtr, (const BYTE *)src, srcSize);
-	ip += (ip == prefixStart);
-
-	/* Match Loop */
-	while (ip < ilimit) {
-		U32 cur, match_num, last_pos, litlen, price;
-		U32 u, mlen, best_mlen, best_off, litLength;
-		U32 curr = (U32)(ip - base);
-		memset(opt, 0, sizeof(ZSTD_optimal_t));
-		last_pos = 0;
-		opt[0].litlen = (U32)(ip - anchor);
-
-		/* check repCode */
-		{
-			U32 i, last_i = ZSTD_REP_CHECK + (ip == anchor);
-			for (i = (ip == anchor); i < last_i; i++) {
-				const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : rep[i];
-				const U32 repIndex = (U32)(curr - repCur);
-				const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-				const BYTE *const repMatch = repBase + repIndex;
-				if ((repCur > 0 && repCur <= (S32)curr) &&
-				    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-				    && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch))) {
-					/* repcode detected we should take it */
-					const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-					mlen = (U32)ZSTD_count_2segments(ip + minMatch, repMatch + minMatch, iend, repEnd, prefixStart) + minMatch;
-
-					if (mlen > sufficient_len || mlen >= ZSTD_OPT_NUM) {
-						best_mlen = mlen;
-						best_off = i;
-						cur = 0;
-						last_pos = 1;
-						goto _storeSequence;
-					}
-
-					best_off = i - (ip == anchor);
-					litlen = opt[0].litlen;
-					do {
-						price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-						if (mlen > last_pos || price < opt[mlen].price)
-							SET_PRICE(mlen, mlen, i, litlen, price); /* note : macro modifies last_pos */
-						mlen--;
-					} while (mlen >= minMatch);
-				}
-			}
-		}
-
-		match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, ip, iend, maxSearches, mls, matches, minMatch); /* first search (depth 0) */
-
-		if (!last_pos && !match_num) {
-			ip++;
-			continue;
-		}
-
-		{
-			U32 i;
-			for (i = 0; i < ZSTD_REP_NUM; i++)
-				opt[0].rep[i] = rep[i];
-		}
-		opt[0].mlen = 1;
-
-		if (match_num && (matches[match_num - 1].len > sufficient_len || matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-			best_mlen = matches[match_num - 1].len;
-			best_off = matches[match_num - 1].off;
-			cur = 0;
-			last_pos = 1;
-			goto _storeSequence;
-		}
-
-		best_mlen = (last_pos) ? last_pos : minMatch;
-
-		/* set prices using matches at position = 0 */
-		for (u = 0; u < match_num; u++) {
-			mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-			best_mlen = matches[u].len;
-			litlen = opt[0].litlen;
-			while (mlen <= best_mlen) {
-				price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-				if (mlen > last_pos || price < opt[mlen].price)
-					SET_PRICE(mlen, mlen, matches[u].off, litlen, price);
-				mlen++;
-			}
-		}
-
-		if (last_pos < minMatch) {
-			ip++;
-			continue;
-		}
-
-		/* check further positions */
-		for (cur = 1; cur <= last_pos; cur++) {
-			inr = ip + cur;
-
-			if (opt[cur - 1].mlen == 1) {
-				litlen = opt[cur - 1].litlen + 1;
-				if (cur > litlen) {
-					price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen);
-				} else
-					price = ZSTD_getLiteralPrice(seqStorePtr, litlen, anchor);
-			} else {
-				litlen = 1;
-				price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1);
-			}
-
-			if (cur > last_pos || price <= opt[cur].price)
-				SET_PRICE(cur, 1, 0, litlen, price);
-
-			if (cur == last_pos)
-				break;
-
-			if (inr > ilimit) /* last match must start at a minimum distance of 8 from oend */
-				continue;
-
-			mlen = opt[cur].mlen;
-			if (opt[cur].off > ZSTD_REP_MOVE_OPT) {
-				opt[cur].rep[2] = opt[cur - mlen].rep[1];
-				opt[cur].rep[1] = opt[cur - mlen].rep[0];
-				opt[cur].rep[0] = opt[cur].off - ZSTD_REP_MOVE_OPT;
-			} else {
-				opt[cur].rep[2] = (opt[cur].off > 1) ? opt[cur - mlen].rep[1] : opt[cur - mlen].rep[2];
-				opt[cur].rep[1] = (opt[cur].off > 0) ? opt[cur - mlen].rep[0] : opt[cur - mlen].rep[1];
-				opt[cur].rep[0] =
-				    ((opt[cur].off == ZSTD_REP_MOVE_OPT) && (mlen != 1)) ? (opt[cur - mlen].rep[0] - 1) : (opt[cur - mlen].rep[opt[cur].off]);
-			}
-
-			best_mlen = minMatch;
-			{
-				U32 i, last_i = ZSTD_REP_CHECK + (mlen != 1);
-				for (i = (mlen != 1); i < last_i; i++) {
-					const S32 repCur = (i == ZSTD_REP_MOVE_OPT) ? (opt[cur].rep[0] - 1) : opt[cur].rep[i];
-					const U32 repIndex = (U32)(curr + cur - repCur);
-					const BYTE *const repBase = repIndex < dictLimit ? dictBase : base;
-					const BYTE *const repMatch = repBase + repIndex;
-					if ((repCur > 0 && repCur <= (S32)(curr + cur)) &&
-					    (((U32)((dictLimit - 1) - repIndex) >= 3) & (repIndex > lowestIndex)) /* intentional overflow */
-					    && (ZSTD_readMINMATCH(inr, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch))) {
-						/* repcode detected */
-						const BYTE *const repEnd = repIndex < dictLimit ? dictEnd : iend;
-						mlen = (U32)ZSTD_count_2segments(inr + minMatch, repMatch + minMatch, iend, repEnd, prefixStart) + minMatch;
-
-						if (mlen > sufficient_len || cur + mlen >= ZSTD_OPT_NUM) {
-							best_mlen = mlen;
-							best_off = i;
-							last_pos = cur + 1;
-							goto _storeSequence;
-						}
-
-						best_off = i - (opt[cur].mlen != 1);
-						if (mlen > best_mlen)
-							best_mlen = mlen;
-
-						do {
-							if (opt[cur].mlen == 1) {
-								litlen = opt[cur].litlen;
-								if (cur > litlen) {
-									price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, inr - litlen,
-															best_off, mlen - MINMATCH, ultra);
-								} else
-									price = ZSTD_getPrice(seqStorePtr, litlen, anchor, best_off, mlen - MINMATCH, ultra);
-							} else {
-								litlen = 0;
-								price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, best_off, mlen - MINMATCH, ultra);
-							}
-
-							if (cur + mlen > last_pos || price <= opt[cur + mlen].price)
-								SET_PRICE(cur + mlen, mlen, i, litlen, price);
-							mlen--;
-						} while (mlen >= minMatch);
-					}
-				}
-			}
-
-			match_num = ZSTD_BtGetAllMatches_selectMLS_extDict(ctx, inr, iend, maxSearches, mls, matches, minMatch);
-
-			if (match_num > 0 && (matches[match_num - 1].len > sufficient_len || cur + matches[match_num - 1].len >= ZSTD_OPT_NUM)) {
-				best_mlen = matches[match_num - 1].len;
-				best_off = matches[match_num - 1].off;
-				last_pos = cur + 1;
-				goto _storeSequence;
-			}
-
-			/* set prices using matches at position = cur */
-			for (u = 0; u < match_num; u++) {
-				mlen = (u > 0) ? matches[u - 1].len + 1 : best_mlen;
-				best_mlen = matches[u].len;
-
-				while (mlen <= best_mlen) {
-					if (opt[cur].mlen == 1) {
-						litlen = opt[cur].litlen;
-						if (cur > litlen)
-							price = opt[cur - litlen].price + ZSTD_getPrice(seqStorePtr, litlen, ip + cur - litlen,
-													matches[u].off - 1, mlen - MINMATCH, ultra);
-						else
-							price = ZSTD_getPrice(seqStorePtr, litlen, anchor, matches[u].off - 1, mlen - MINMATCH, ultra);
-					} else {
-						litlen = 0;
-						price = opt[cur].price + ZSTD_getPrice(seqStorePtr, 0, NULL, matches[u].off - 1, mlen - MINMATCH, ultra);
-					}
-
-					if (cur + mlen > last_pos || (price < opt[cur + mlen].price))
-						SET_PRICE(cur + mlen, mlen, matches[u].off, litlen, price);
-
-					mlen++;
-				}
-			}
-		} /* for (cur = 1; cur <= last_pos; cur++) */
-
-		best_mlen = opt[last_pos].mlen;
-		best_off = opt[last_pos].off;
-		cur = last_pos - best_mlen;
-
-	/* store sequence */
-_storeSequence: /* cur, last_pos, best_mlen, best_off have to be set */
-		opt[0].mlen = 1;
-
-		while (1) {
-			mlen = opt[cur].mlen;
-			offset = opt[cur].off;
-			opt[cur].mlen = best_mlen;
-			opt[cur].off = best_off;
-			best_mlen = mlen;
-			best_off = offset;
-			if (mlen > cur)
-				break;
-			cur -= mlen;
-		}
-
-		for (u = 0; u <= last_pos;) {
-			u += opt[u].mlen;
-		}
-
-		for (cur = 0; cur < last_pos;) {
-			mlen = opt[cur].mlen;
-			if (mlen == 1) {
-				ip++;
-				cur++;
-				continue;
-			}
-			offset = opt[cur].off;
-			cur += mlen;
-			litLength = (U32)(ip - anchor);
-
-			if (offset > ZSTD_REP_MOVE_OPT) {
-				rep[2] = rep[1];
-				rep[1] = rep[0];
-				rep[0] = offset - ZSTD_REP_MOVE_OPT;
-				offset--;
-			} else {
-				if (offset != 0) {
-					best_off = (offset == ZSTD_REP_MOVE_OPT) ? (rep[0] - 1) : (rep[offset]);
-					if (offset != 1)
-						rep[2] = rep[1];
-					rep[1] = rep[0];
-					rep[0] = best_off;
-				}
-
-				if (litLength == 0)
-					offset--;
-			}
-
-			ZSTD_updatePrice(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-			ZSTD_storeSeq(seqStorePtr, litLength, anchor, offset, mlen - MINMATCH);
-			anchor = ip = ip + mlen;
-		}
-	} /* for (cur=0; cur < last_pos; ) */
-
-	/* Save reps for next block */
-	{
-		int i;
-		for (i = 0; i < ZSTD_REP_NUM; i++)
-			ctx->repToConfirm[i] = rep[i];
-	}
-
-	/* Last Literals */
-	{
-		size_t lastLLSize = iend - anchor;
-		memcpy(seqStorePtr->lit, anchor, lastLLSize);
-		seqStorePtr->lit += lastLLSize;
-	}
-}
-
-#endif /* ZSTD_OPT_H_91842398743 */
diff --git a/priv/zstd/contrib/linux-kernel/squashfs-benchmark.sh b/priv/zstd/contrib/linux-kernel/squashfs-benchmark.sh
deleted file mode 100755
index 02dfd73..0000000
--- a/priv/zstd/contrib/linux-kernel/squashfs-benchmark.sh
+++ /dev/null
@@ -1,39 +0,0 @@
-# !/bin/sh
-set -e
-
-# Benchmarks run on a Ubuntu 14.04 VM with 2 cores and 4 GiB of RAM.
-# The VM is running on a Macbook Pro with a 3.1 GHz Intel Core i7 processor and
-# 16 GB of RAM and an SSD.
-
-# $BENCHMARK_DIR is generated with the following commands, from the Ubuntu image
-# ubuntu-16.10-desktop-amd64.iso.
-# > mkdir mnt
-# > sudo mount -o loop ubuntu-16.10-desktop-amd64.iso mnt
-# > cp mnt/casper/filesystem.squashfs .
-# > sudo unsquashfs filesystem.squashfs
-
-# $HOME is on a ext4 filesystem
-BENCHMARK_DIR="$HOME/squashfs-root/"
-BENCHMARK_FS="$HOME/filesystem.squashfs"
-
-# Normalize the environment
-sudo rm -f $BENCHMARK_FS 2> /dev/null > /dev/null || true
-sudo umount /mnt/squashfs 2> /dev/null > /dev/null || true
-
-# Run the benchmark
-echo "Compression"
-echo "sudo mksquashfs $BENCHMARK_DIR $BENCHMARK_FS $@"
-time sudo mksquashfs $BENCHMARK_DIR $BENCHMARK_FS $@ 2> /dev/null > /dev/null
-
-echo "Approximate compression ratio"
-printf "%d / %d\n"                                                             \
-  $(sudo du -sx --block-size=1 $BENCHMARK_DIR | cut -f1)                       \
-  $(sudo du -sx --block-size=1 $BENCHMARK_FS  | cut -f1);
-
-# Mount the filesystem
-sudo mount -t squashfs $BENCHMARK_FS /mnt/squashfs
-
-echo "Decompression"
-time sudo tar -c /mnt/squashfs 2> /dev/null | wc -c > /dev/null
-
-sudo umount /mnt/squashfs
diff --git a/priv/zstd/contrib/linux-kernel/test/.gitignore b/priv/zstd/contrib/linux-kernel/test/.gitignore
deleted file mode 100644
index 4fc1022..0000000
--- a/priv/zstd/contrib/linux-kernel/test/.gitignore
+++ /dev/null
@@ -1 +0,0 @@
-*Test
diff --git a/priv/zstd/contrib/linux-kernel/test/DecompressCrash.c b/priv/zstd/contrib/linux-kernel/test/DecompressCrash.c
deleted file mode 100644
index 2ab7dfe..0000000
--- a/priv/zstd/contrib/linux-kernel/test/DecompressCrash.c
+++ /dev/null
@@ -1,85 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/*
-  This program takes a file in input,
-  performs a zstd round-trip test (compression - decompress)
-  compares the result with original
-  and generates a crash (double free) on corruption detection.
-*/
-
-/*===========================================
-*   Dependencies
-*==========================================*/
-#include      /* size_t */
-#include      /* malloc, free, exit */
-#include       /* fprintf */
-#include 
-
-/*===========================================
-*   Macros
-*==========================================*/
-#define MIN(a,b)  ( (a) < (b) ? (a) : (b) )
-
-static ZSTD_DCtx *dctx = NULL;
-void *dws = NULL;
-static void* rBuff = NULL;
-static size_t buffSize = 0;
-
-static void crash(int errorCode){
-    /* abort if AFL/libfuzzer, exit otherwise */
-    #ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION /* could also use __AFL_COMPILER */
-        abort();
-    #else
-        exit(errorCode);
-    #endif
-}
-
-static void decompressCheck(const void* srcBuff, size_t srcBuffSize)
-{
-    size_t const neededBuffSize = 20 * srcBuffSize;
-
-    /* Allocate all buffers and contexts if not already allocated */
-    if (neededBuffSize > buffSize) {
-        free(rBuff);
-        buffSize = 0;
-
-        rBuff = malloc(neededBuffSize);
-        if (!rBuff) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-        buffSize = neededBuffSize;
-    }
-    if (!dctx) {
-        size_t const workspaceSize = ZSTD_DCtxWorkspaceBound();
-        dws = malloc(workspaceSize);
-        if (!dws) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-        dctx = ZSTD_initDCtx(dws, workspaceSize);
-        if (!dctx) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-    }
-    ZSTD_decompressDCtx(dctx, rBuff, buffSize, srcBuff, srcBuffSize);
-
-#ifndef SKIP_FREE
-    free(dws); dws = NULL; dctx = NULL;
-    free(rBuff); rBuff = NULL;
-    buffSize = 0;
-#endif
-}
-
-int LLVMFuzzerTestOneInput(const unsigned char *srcBuff, size_t srcBuffSize) {
-  decompressCheck(srcBuff, srcBuffSize);
-  return 0;
-}
diff --git a/priv/zstd/contrib/linux-kernel/test/Makefile b/priv/zstd/contrib/linux-kernel/test/Makefile
deleted file mode 100644
index 8411462..0000000
--- a/priv/zstd/contrib/linux-kernel/test/Makefile
+++ /dev/null
@@ -1,43 +0,0 @@
-
-IFLAGS := -isystem include/ -I ../include/ -I ../lib/zstd/ -isystem googletest/googletest/include -isystem ../../../lib/common/
-
-SOURCES := $(wildcard ../lib/zstd/*.c)
-OBJECTS := $(patsubst %.c,%.o,$(SOURCES))
-
-ARFLAGS := rcs
-CXXFLAGS += -std=c++11 -g -O3 -Wcast-align
-CFLAGS += -g -O3 -Wframe-larger-than=400 -Wcast-align
-CPPFLAGS += $(IFLAGS)
-
-../lib/zstd/libzstd.a: $(OBJECTS)
-	$(AR) $(ARFLAGS) $@ $^
-
-DecompressCrash: DecompressCrash.o $(OBJECTS) libFuzzer.a
-	$(CXX) $(CPPFLAGS) $(CXXFLAGS) $(LDFLAGS) $^ -o $@
-
-RoundTripCrash: RoundTripCrash.o $(OBJECTS) ../lib/xxhash.o libFuzzer.a
-	$(CXX) $(CPPFLAGS) $(CXXFLAGS) $(LDFLAGS) $^ -o $@
-
-UserlandTest: UserlandTest.cpp ../lib/zstd/libzstd.a ../lib/xxhash.o
-	$(CXX) $(CXXFLAGS) $(CPPFLAGS) $^ googletest/build/googlemock/gtest/libgtest.a googletest/build/googlemock/gtest/libgtest_main.a -o $@
-
-XXHashUserlandTest: XXHashUserlandTest.cpp ../lib/xxhash.o ../../../lib/common/xxhash.o
-	$(CXX) $(CXXFLAGS) $(CFLAGS) $(CPPFLAGS) $^ googletest/build/googlemock/gtest/libgtest.a googletest/build/googlemock/gtest/libgtest_main.a -o $@
-
-# Install libfuzzer
-libFuzzer.a:
-	@$(RM) -rf Fuzzer
-	@git clone https://chromium.googlesource.com/chromium/llvm-project/llvm/lib/Fuzzer
-	@./Fuzzer/build.sh
-
-# Install googletest
-.PHONY: googletest
-googletest:
-	@$(RM) -rf googletest
-	@git clone https://github.com/google/googletest
-	@mkdir -p googletest/build
-	@cd googletest/build && cmake .. && $(MAKE)
-
-clean:
-	$(RM) -f *.{o,a} ../lib/zstd/*.{o,a} ../lib/*.o
-	$(RM) -f DecompressCrash RoundTripCrash UserlandTest XXHashUserlandTest
diff --git a/priv/zstd/contrib/linux-kernel/test/RoundTripCrash.c b/priv/zstd/contrib/linux-kernel/test/RoundTripCrash.c
deleted file mode 100644
index 4f96802..0000000
--- a/priv/zstd/contrib/linux-kernel/test/RoundTripCrash.c
+++ /dev/null
@@ -1,162 +0,0 @@
-/**
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/*
-  This program takes a file in input,
-  performs a zstd round-trip test (compression - decompress)
-  compares the result with original
-  and generates a crash (double free) on corruption detection.
-*/
-
-/*===========================================
-*   Dependencies
-*==========================================*/
-#include      /* size_t */
-#include      /* malloc, free, exit */
-#include       /* fprintf */
-#include 
-#include 
-
-/*===========================================
-*   Macros
-*==========================================*/
-#define MIN(a,b)  ( (a) < (b) ? (a) : (b) )
-
-static const int kMaxClevel = 22;
-
-static ZSTD_CCtx *cctx = NULL;
-void *cws = NULL;
-static ZSTD_DCtx *dctx = NULL;
-void *dws = NULL;
-static void* cBuff = NULL;
-static void* rBuff = NULL;
-static size_t buffSize = 0;
-
-
-/** roundTripTest() :
-*   Compresses `srcBuff` into `compressedBuff`,
-*   then decompresses `compressedBuff` into `resultBuff`.
-*   Compression level used is derived from first content byte.
-*   @return : result of decompression, which should be == `srcSize`
-*          or an error code if either compression or decompression fails.
-*   Note : `compressedBuffCapacity` should be `>= ZSTD_compressBound(srcSize)`
-*          for compression to be guaranteed to work */
-static size_t roundTripTest(void* resultBuff, size_t resultBuffCapacity,
-                            void* compressedBuff, size_t compressedBuffCapacity,
-                      const void* srcBuff, size_t srcBuffSize)
-{
-    size_t const hashLength = MIN(128, srcBuffSize);
-    unsigned const h32 = xxh32(srcBuff, hashLength, 0);
-    int const cLevel = h32 % kMaxClevel;
-    ZSTD_parameters const params = ZSTD_getParams(cLevel, srcBuffSize, 0);
-    size_t const cSize = ZSTD_compressCCtx(cctx, compressedBuff, compressedBuffCapacity, srcBuff, srcBuffSize, params);
-    if (ZSTD_isError(cSize)) {
-        fprintf(stderr, "Compression error : %u \n", ZSTD_getErrorCode(cSize));
-        return cSize;
-    }
-    return ZSTD_decompressDCtx(dctx, resultBuff, resultBuffCapacity, compressedBuff, cSize);
-}
-
-
-static size_t checkBuffers(const void* buff1, const void* buff2, size_t buffSize)
-{
-    const char* ip1 = (const char*)buff1;
-    const char* ip2 = (const char*)buff2;
-    size_t pos;
-
-    for (pos=0; pos buffSize) {
-        free(cBuff);
-        free(rBuff);
-        buffSize = 0;
-
-        cBuff = malloc(neededBuffSize);
-        rBuff = malloc(neededBuffSize);
-        if (!cBuff || !rBuff) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-        buffSize = neededBuffSize;
-    }
-    if (!cctx) {
-        ZSTD_compressionParameters const params = ZSTD_getCParams(kMaxClevel, 0, 0);
-        size_t const workspaceSize = ZSTD_CCtxWorkspaceBound(params);
-        cws = malloc(workspaceSize);
-        if (!cws) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-        cctx = ZSTD_initCCtx(cws, workspaceSize);
-        if (!cctx) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-    }
-    if (!dctx) {
-        size_t const workspaceSize = ZSTD_DCtxWorkspaceBound();
-        dws = malloc(workspaceSize);
-        if (!dws) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-        dctx = ZSTD_initDCtx(dws, workspaceSize);
-        if (!dctx) {
-            fprintf(stderr, "not enough memory ! \n");
-            crash(1);
-        }
-    }
-
-    {   size_t const result = roundTripTest(rBuff, buffSize, cBuff, buffSize, srcBuff, srcBuffSize);
-        if (ZSTD_isError(result)) {
-            fprintf(stderr, "roundTripTest error : %u \n", ZSTD_getErrorCode(result));
-            crash(1);
-        }
-        if (result != srcBuffSize) {
-            fprintf(stderr, "Incorrect regenerated size : %u != %u\n", (unsigned)result, (unsigned)srcBuffSize);
-            crash(1);
-        }
-        if (checkBuffers(srcBuff, rBuff, srcBuffSize) != srcBuffSize) {
-            fprintf(stderr, "Silent decoding corruption !!!");
-            crash(1);
-        }
-    }
-
-#ifndef SKIP_FREE
-    free(cws); cws = NULL; cctx = NULL;
-    free(dws); dws = NULL; dctx = NULL;
-    free(cBuff); cBuff = NULL;
-    free(rBuff); rBuff = NULL;
-    buffSize = 0;
-#endif
-}
-
-int LLVMFuzzerTestOneInput(const unsigned char *srcBuff, size_t srcBuffSize) {
-  roundTripCheck(srcBuff, srcBuffSize);
-  return 0;
-}
diff --git a/priv/zstd/contrib/linux-kernel/test/UserlandTest.cpp b/priv/zstd/contrib/linux-kernel/test/UserlandTest.cpp
deleted file mode 100644
index 0305838..0000000
--- a/priv/zstd/contrib/linux-kernel/test/UserlandTest.cpp
+++ /dev/null
@@ -1,565 +0,0 @@
-extern "C" {
-#include 
-}
-#include 
-#include 
-#include 
-#include 
-
-using namespace std;
-
-namespace {
-struct WorkspaceDeleter {
-  void *memory;
-
-  template  void operator()(T const *) { free(memory); }
-};
-
-std::unique_ptr
-createCCtx(ZSTD_compressionParameters cParams) {
-  size_t const workspaceSize = ZSTD_CCtxWorkspaceBound(cParams);
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr cctx{
-      ZSTD_initCCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
-  if (!cctx) {
-    throw std::runtime_error{"Bad cctx"};
-  }
-  return cctx;
-}
-
-std::unique_ptr
-createCCtx(int level, unsigned long long estimatedSrcSize = 0,
-           size_t dictSize = 0) {
-  auto const cParams = ZSTD_getCParams(level, estimatedSrcSize, dictSize);
-  return createCCtx(cParams);
-}
-
-std::unique_ptr
-createDCtx() {
-  size_t const workspaceSize = ZSTD_DCtxWorkspaceBound();
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr dctx{
-      ZSTD_initDCtx(workspace, workspaceSize), WorkspaceDeleter{workspace}};
-  if (!dctx) {
-    throw std::runtime_error{"Bad dctx"};
-  }
-  return dctx;
-}
-
-std::unique_ptr
-createCDict(std::string const& dict, ZSTD_parameters params) {
-  size_t const workspaceSize = ZSTD_CDictWorkspaceBound(params.cParams);
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr cdict{
-      ZSTD_initCDict(dict.data(), dict.size(), params, workspace,
-                     workspaceSize),
-      WorkspaceDeleter{workspace}};
-  if (!cdict) {
-    throw std::runtime_error{"Bad cdict"};
-  }
-  return cdict;
-}
-
-std::unique_ptr
-createCDict(std::string const& dict, int level) {
-  auto const params = ZSTD_getParams(level, 0, dict.size());
-  return createCDict(dict, params);
-}
-
-std::unique_ptr
-createDDict(std::string const& dict) {
-  size_t const workspaceSize = ZSTD_DDictWorkspaceBound();
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr ddict{
-      ZSTD_initDDict(dict.data(), dict.size(), workspace, workspaceSize),
-      WorkspaceDeleter{workspace}};
-  if (!ddict) {
-    throw std::runtime_error{"Bad ddict"};
-  }
-  return ddict;
-}
-
-std::unique_ptr
-createCStream(ZSTD_parameters params, unsigned long long pledgedSrcSize = 0) {
-  size_t const workspaceSize = ZSTD_CStreamWorkspaceBound(params.cParams);
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr zcs{
-      ZSTD_initCStream(params, pledgedSrcSize, workspace, workspaceSize)};
-  if (!zcs) {
-    throw std::runtime_error{"bad cstream"};
-  }
-  return zcs;
-}
-
-std::unique_ptr
-createCStream(ZSTD_compressionParameters cParams, ZSTD_CDict const &cdict,
-              unsigned long long pledgedSrcSize = 0) {
-  size_t const workspaceSize = ZSTD_CStreamWorkspaceBound(cParams);
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr zcs{
-      ZSTD_initCStream_usingCDict(&cdict, pledgedSrcSize, workspace,
-                                  workspaceSize)};
-  if (!zcs) {
-    throw std::runtime_error{"bad cstream"};
-  }
-  return zcs;
-}
-
-std::unique_ptr
-createCStream(int level, unsigned long long pledgedSrcSize = 0) {
-  auto const params = ZSTD_getParams(level, pledgedSrcSize, 0);
-  return createCStream(params, pledgedSrcSize);
-}
-
-std::unique_ptr
-createDStream(size_t maxWindowSize = (1ULL << ZSTD_WINDOWLOG_MAX),
-              ZSTD_DDict const *ddict = nullptr) {
-  size_t const workspaceSize = ZSTD_DStreamWorkspaceBound(maxWindowSize);
-  void *workspace = malloc(workspaceSize);
-  std::unique_ptr zds{
-      ddict == nullptr
-          ? ZSTD_initDStream(maxWindowSize, workspace, workspaceSize)
-          : ZSTD_initDStream_usingDDict(maxWindowSize, ddict, workspace,
-                                        workspaceSize)};
-  if (!zds) {
-    throw std::runtime_error{"bad dstream"};
-  }
-  return zds;
-}
-
-std::string compress(ZSTD_CCtx &cctx, std::string const &data,
-                     ZSTD_parameters params, std::string const &dict = "") {
-  std::string compressed;
-  compressed.resize(ZSTD_compressBound(data.size()));
-  size_t const rc =
-      dict.empty()
-          ? ZSTD_compressCCtx(&cctx, &compressed[0], compressed.size(),
-                              data.data(), data.size(), params)
-          : ZSTD_compress_usingDict(&cctx, &compressed[0], compressed.size(),
-                                    data.data(), data.size(), dict.data(),
-                                    dict.size(), params);
-  if (ZSTD_isError(rc)) {
-    throw std::runtime_error{"compression error"};
-  }
-  compressed.resize(rc);
-  return compressed;
-}
-
-std::string compress(ZSTD_CCtx& cctx, std::string const& data, int level, std::string const& dict = "") {
-  auto const params = ZSTD_getParams(level, 0, dict.size());
-  return compress(cctx, data, params, dict);
-}
-
-std::string decompress(ZSTD_DCtx& dctx, std::string const& compressed, size_t decompressedSize, std::string const& dict = "") {
-  std::string decompressed;
-  decompressed.resize(decompressedSize);
-  size_t const rc =
-      dict.empty()
-          ? ZSTD_decompressDCtx(&dctx, &decompressed[0], decompressed.size(),
-                                compressed.data(), compressed.size())
-          : ZSTD_decompress_usingDict(
-                &dctx, &decompressed[0], decompressed.size(), compressed.data(),
-                compressed.size(), dict.data(), dict.size());
-  if (ZSTD_isError(rc)) {
-    throw std::runtime_error{"decompression error"};
-  }
-  decompressed.resize(rc);
-  return decompressed;
-}
-
-std::string compress(ZSTD_CCtx& cctx, std::string const& data, ZSTD_CDict& cdict) {
-  std::string compressed;
-  compressed.resize(ZSTD_compressBound(data.size()));
-  size_t const rc =
-      ZSTD_compress_usingCDict(&cctx, &compressed[0], compressed.size(),
-                               data.data(), data.size(), &cdict);
-  if (ZSTD_isError(rc)) {
-    throw std::runtime_error{"compression error"};
-  }
-  compressed.resize(rc);
-  return compressed;
-}
-
-std::string decompress(ZSTD_DCtx& dctx, std::string const& compressed, size_t decompressedSize, ZSTD_DDict& ddict) {
-  std::string decompressed;
-  decompressed.resize(decompressedSize);
-  size_t const rc =
-      ZSTD_decompress_usingDDict(&dctx, &decompressed[0], decompressed.size(),
-                                 compressed.data(), compressed.size(), &ddict);
-  if (ZSTD_isError(rc)) {
-    throw std::runtime_error{"decompression error"};
-  }
-  decompressed.resize(rc);
-  return decompressed;
-}
-
-std::string compress(ZSTD_CStream& zcs, std::string const& data) {
-  std::string compressed;
-  compressed.resize(ZSTD_compressBound(data.size()));
-  ZSTD_inBuffer in = {data.data(), data.size(), 0};
-  ZSTD_outBuffer out = {&compressed[0], compressed.size(), 0};
-  while (in.pos != in.size) {
-    size_t const rc = ZSTD_compressStream(&zcs, &out, &in);
-    if (ZSTD_isError(rc)) {
-      throw std::runtime_error{"compress stream failed"};
-    }
-  }
-  size_t const rc = ZSTD_endStream(&zcs, &out);
-  if (rc != 0) {
-    throw std::runtime_error{"compress end failed"};
-  }
-  compressed.resize(out.pos);
-  return compressed;
-}
-
-std::string decompress(ZSTD_DStream &zds, std::string const &compressed,
-                       size_t decompressedSize) {
-  std::string decompressed;
-  decompressed.resize(decompressedSize);
-  ZSTD_inBuffer in = {compressed.data(), compressed.size(), 0};
-  ZSTD_outBuffer out = {&decompressed[0], decompressed.size(), 0};
-  while (in.pos != in.size) {
-    size_t const rc = ZSTD_decompressStream(&zds, &out, &in);
-    if (ZSTD_isError(rc)) {
-      throw std::runtime_error{"decompress stream failed"};
-    }
-  }
-  decompressed.resize(out.pos);
-  return decompressed;
-}
-
-std::string makeData(size_t size) {
-  std::string result;
-  result.reserve(size + 20);
-  while (result.size() < size) {
-    result += "Hello world";
-  }
-  return result;
-}
-
-std::string const kData = "Hello world";
-std::string const kPlainDict = makeData(10000);
-std::string const kZstdDict{
-    "\x37\xA4\x30\xEC\x99\x69\x58\x1C\x21\x10\xD8\x4A\x84\x01\xCC\xF3"
-    "\x3C\xCF\x9B\x25\xBB\xC9\x6E\xB2\x9B\xEC\x26\xAD\xCF\xDF\x4E\xCD"
-    "\xF3\x2C\x3A\x21\x84\x10\x42\x08\x21\x01\x33\xF1\x78\x3C\x1E\x8F"
-    "\xC7\xE3\xF1\x78\x3C\xCF\xF3\xBC\xF7\xD4\x42\x41\x41\x41\x41\x41"
-    "\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41\x41"
-    "\x41\x41\x41\x41\xA1\x50\x28\x14\x0A\x85\x42\xA1\x50\x28\x14\x0A"
-    "\x85\xA2\x28\x8A\xA2\x28\x4A\x29\x7D\x74\xE1\xE1\xE1\xE1\xE1\xE1"
-    "\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xE1\xF1\x78\x3C"
-    "\x1E\x8F\xC7\xE3\xF1\x78\x9E\xE7\x79\xEF\x01\x01\x00\x00\x00\x04"
-    "\x00\x00\x00\x08\x00\x00\x00"
-    "0123456789",
-    161};
-}
-
-TEST(Block, CCtx) {
-  auto cctx = createCCtx(1);
-  auto const compressed = compress(*cctx, kData, 1);
-  auto dctx = createDCtx();
-  auto const decompressed = decompress(*dctx, compressed, kData.size());
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Block, NoContentSize) {
-  auto cctx = createCCtx(1);
-  auto const c = compress(*cctx, kData, 1);
-  auto const size = ZSTD_findDecompressedSize(c.data(), c.size());
-  EXPECT_EQ(ZSTD_CONTENTSIZE_UNKNOWN, size);
-}
-
-TEST(Block, ContentSize) {
-  auto cctx = createCCtx(1);
-  auto params = ZSTD_getParams(1, 0, 0);
-  params.fParams.contentSizeFlag = 1;
-  auto const c = compress(*cctx, kData, params);
-  auto const size = ZSTD_findDecompressedSize(c.data(), c.size());
-  EXPECT_EQ(kData.size(), size);
-}
-
-TEST(Block, CCtxLevelIncrease) {
-  std::string c;
-  auto cctx = createCCtx(22);
-  auto dctx = createDCtx();
-  for (int level = 1; level <= 22; ++level) {
-    auto compressed = compress(*cctx, kData, level);
-    auto const decompressed = decompress(*dctx, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-}
-
-TEST(Block, PlainDict) {
-  auto cctx = createCCtx(1);
-  auto const compressed = compress(*cctx, kData, 1, kPlainDict);
-  auto dctx = createDCtx();
-  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
-  auto const decompressed =
-      decompress(*dctx, compressed, kData.size(), kPlainDict);
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Block, ZstdDict) {
-  auto cctx = createCCtx(1);
-  auto const compressed = compress(*cctx, kData, 1, kZstdDict);
-  auto dctx = createDCtx();
-  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
-  auto const decompressed =
-      decompress(*dctx, compressed, kData.size(), kZstdDict);
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Block, PreprocessedPlainDict) {
-  auto cctx = createCCtx(1);
-  auto const cdict = createCDict(kPlainDict, 1);
-  auto const compressed = compress(*cctx, kData, *cdict);
-  auto dctx = createDCtx();
-  auto const ddict = createDDict(kPlainDict);
-  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
-  auto const decompressed =
-      decompress(*dctx, compressed, kData.size(), *ddict);
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Block, PreprocessedZstdDict) {
-  auto cctx = createCCtx(1);
-  auto const cdict = createCDict(kZstdDict, 1);
-  auto const compressed = compress(*cctx, kData, *cdict);
-  auto dctx = createDCtx();
-  auto const ddict = createDDict(kZstdDict);
-  EXPECT_ANY_THROW(decompress(*dctx, compressed, kData.size()));
-  auto const decompressed =
-      decompress(*dctx, compressed, kData.size(), *ddict);
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Block, ReinitializeCCtx) {
-  auto cctx = createCCtx(1);
-  {
-    auto const compressed = compress(*cctx, kData, 1);
-    auto dctx = createDCtx();
-    auto const decompressed = decompress(*dctx, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-  // Create the cctx with the same memory
-  auto d = cctx.get_deleter();
-  auto raw = cctx.release();
-  auto params = ZSTD_getParams(1, 0, 0);
-  cctx.reset(
-      ZSTD_initCCtx(d.memory, ZSTD_CCtxWorkspaceBound(params.cParams)));
-  // Repeat
-  {
-    auto const compressed = compress(*cctx, kData, 1);
-    auto dctx = createDCtx();
-    auto const decompressed = decompress(*dctx, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-}
-
-TEST(Block, ReinitializeDCtx) {
-  auto dctx = createDCtx();
-  {
-    auto cctx = createCCtx(1);
-    auto const compressed = compress(*cctx, kData, 1);
-    auto const decompressed = decompress(*dctx, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-  // Create the cctx with the same memory
-  auto d = dctx.get_deleter();
-  auto raw = dctx.release();
-  dctx.reset(ZSTD_initDCtx(d.memory, ZSTD_DCtxWorkspaceBound()));
-  // Repeat
-  {
-    auto cctx = createCCtx(1);
-    auto const compressed = compress(*cctx, kData, 1);
-    auto dctx = createDCtx();
-    auto const decompressed = decompress(*dctx, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-}
-
-TEST(Stream, Basic) {
-  auto zcs = createCStream(1);
-  auto const compressed = compress(*zcs, kData);
-  auto zds = createDStream();
-  auto const decompressed = decompress(*zds, compressed, kData.size());
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Stream, PlainDict) {
-  auto params = ZSTD_getParams(1, kData.size(), kPlainDict.size());
-  params.cParams.windowLog = 17;
-  auto cdict = createCDict(kPlainDict, params);
-  auto zcs = createCStream(params.cParams, *cdict, kData.size());
-  auto const compressed = compress(*zcs, kData);
-  auto const contentSize =
-      ZSTD_findDecompressedSize(compressed.data(), compressed.size());
-  EXPECT_ANY_THROW(decompress(*createDStream(), compressed, kData.size()));
-  auto ddict = createDDict(kPlainDict);
-  auto zds = createDStream(1 << 17, ddict.get());
-  auto const decompressed = decompress(*zds, compressed, kData.size());
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Stream, ZstdDict) {
-  auto params = ZSTD_getParams(1, 0, 0);
-  params.cParams.windowLog = 17;
-  auto cdict = createCDict(kZstdDict, 1);
-  auto zcs = createCStream(params.cParams, *cdict);
-  auto const compressed = compress(*zcs, kData);
-  EXPECT_ANY_THROW(decompress(*createDStream(), compressed, kData.size()));
-  auto ddict = createDDict(kZstdDict);
-  auto zds = createDStream(1 << 17, ddict.get());
-  auto const decompressed = decompress(*zds, compressed, kData.size());
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Stream, ResetCStream) {
-  auto zcs = createCStream(1);
-  auto zds = createDStream();
-  {
-    auto const compressed = compress(*zcs, kData);
-    auto const decompressed = decompress(*zds, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-  {
-    ZSTD_resetCStream(zcs.get(), 0);
-    auto const compressed = compress(*zcs, kData);
-    auto const decompressed = decompress(*zds, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-}
-
-TEST(Stream, ResetDStream) {
-  auto zcs = createCStream(1);
-  auto zds = createDStream();
-  auto const compressed = compress(*zcs, kData);
-  EXPECT_ANY_THROW(decompress(*zds, kData, kData.size()));
-  EXPECT_ANY_THROW(decompress(*zds, compressed, kData.size()));
-  ZSTD_resetDStream(zds.get());
-  auto const decompressed = decompress(*zds, compressed, kData.size());
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Stream, Flush) {
-  auto zcs = createCStream(1);
-  auto zds = createDStream();
-  std::string compressed;
-  {
-    compressed.resize(ZSTD_compressBound(kData.size()));
-    ZSTD_inBuffer in = {kData.data(), kData.size(), 0};
-    ZSTD_outBuffer out = {&compressed[0], compressed.size(), 0};
-    while (in.pos != in.size) {
-      size_t const rc = ZSTD_compressStream(zcs.get(), &out, &in);
-      if (ZSTD_isError(rc)) {
-        throw std::runtime_error{"compress stream failed"};
-      }
-    }
-    EXPECT_EQ(0, out.pos);
-    size_t const rc = ZSTD_flushStream(zcs.get(), &out);
-    if (rc != 0) {
-      throw std::runtime_error{"compress end failed"};
-    }
-    compressed.resize(out.pos);
-    EXPECT_LT(0, out.pos);
-  }
-  std::string decompressed;
-  {
-    decompressed.resize(kData.size());
-    ZSTD_inBuffer in = {compressed.data(), compressed.size(), 0};
-    ZSTD_outBuffer out = {&decompressed[0], decompressed.size(), 0};
-    while (in.pos != in.size) {
-      size_t const rc = ZSTD_decompressStream(zds.get(), &out, &in);
-      if (ZSTD_isError(rc)) {
-        throw std::runtime_error{"decompress stream failed"};
-      }
-    }
-  }
-  EXPECT_EQ(kData, decompressed);
-}
-
-TEST(Stream, DStreamLevelIncrease) {
-  auto zds = createDStream();
-  for (int level = 1; level <= 22; ++level) {
-    auto zcs = createCStream(level);
-    auto compressed = compress(*zcs, kData);
-    ZSTD_resetDStream(zds.get());
-    auto const decompressed = decompress(*zds, compressed, kData.size());
-    EXPECT_EQ(kData, decompressed);
-  }
-}
-
-#define TEST_SYMBOL(symbol)                                                    \
-  do {                                                                         \
-    extern void *__##symbol;                                                   \
-    EXPECT_NE((void *)0, __##symbol);                                          \
-  } while (0)
-
-TEST(API, Symbols) {
-  TEST_SYMBOL(ZSTD_CCtxWorkspaceBound);
-  TEST_SYMBOL(ZSTD_initCCtx);
-  TEST_SYMBOL(ZSTD_compressCCtx);
-  TEST_SYMBOL(ZSTD_compress_usingDict);
-  TEST_SYMBOL(ZSTD_DCtxWorkspaceBound);
-  TEST_SYMBOL(ZSTD_initDCtx);
-  TEST_SYMBOL(ZSTD_decompressDCtx);
-  TEST_SYMBOL(ZSTD_decompress_usingDict);
-
-  TEST_SYMBOL(ZSTD_CDictWorkspaceBound);
-  TEST_SYMBOL(ZSTD_initCDict);
-  TEST_SYMBOL(ZSTD_compress_usingCDict);
-  TEST_SYMBOL(ZSTD_DDictWorkspaceBound);
-  TEST_SYMBOL(ZSTD_initDDict);
-  TEST_SYMBOL(ZSTD_decompress_usingDDict);
-
-  TEST_SYMBOL(ZSTD_CStreamWorkspaceBound);
-  TEST_SYMBOL(ZSTD_initCStream);
-  TEST_SYMBOL(ZSTD_initCStream_usingCDict);
-  TEST_SYMBOL(ZSTD_resetCStream);
-  TEST_SYMBOL(ZSTD_compressStream);
-  TEST_SYMBOL(ZSTD_flushStream);
-  TEST_SYMBOL(ZSTD_endStream);
-  TEST_SYMBOL(ZSTD_CStreamInSize);
-  TEST_SYMBOL(ZSTD_CStreamOutSize);
-  TEST_SYMBOL(ZSTD_DStreamWorkspaceBound);
-  TEST_SYMBOL(ZSTD_initDStream);
-  TEST_SYMBOL(ZSTD_initDStream_usingDDict);
-  TEST_SYMBOL(ZSTD_resetDStream);
-  TEST_SYMBOL(ZSTD_decompressStream);
-  TEST_SYMBOL(ZSTD_DStreamInSize);
-  TEST_SYMBOL(ZSTD_DStreamOutSize);
-
-  TEST_SYMBOL(ZSTD_findFrameCompressedSize);
-  TEST_SYMBOL(ZSTD_getFrameContentSize);
-  TEST_SYMBOL(ZSTD_findDecompressedSize);
-
-  TEST_SYMBOL(ZSTD_getCParams);
-  TEST_SYMBOL(ZSTD_getParams);
-  TEST_SYMBOL(ZSTD_checkCParams);
-  TEST_SYMBOL(ZSTD_adjustCParams);
-
-  TEST_SYMBOL(ZSTD_isFrame);
-  TEST_SYMBOL(ZSTD_getDictID_fromDict);
-  TEST_SYMBOL(ZSTD_getDictID_fromDDict);
-  TEST_SYMBOL(ZSTD_getDictID_fromFrame);
-
-  TEST_SYMBOL(ZSTD_compressBegin);
-  TEST_SYMBOL(ZSTD_compressBegin_usingDict);
-  TEST_SYMBOL(ZSTD_compressBegin_advanced);
-  TEST_SYMBOL(ZSTD_copyCCtx);
-  TEST_SYMBOL(ZSTD_compressBegin_usingCDict);
-  TEST_SYMBOL(ZSTD_compressContinue);
-  TEST_SYMBOL(ZSTD_compressEnd);
-  TEST_SYMBOL(ZSTD_getFrameParams);
-  TEST_SYMBOL(ZSTD_decompressBegin);
-  TEST_SYMBOL(ZSTD_decompressBegin_usingDict);
-  TEST_SYMBOL(ZSTD_copyDCtx);
-  TEST_SYMBOL(ZSTD_nextSrcSizeToDecompress);
-  TEST_SYMBOL(ZSTD_decompressContinue);
-  TEST_SYMBOL(ZSTD_nextInputType);
-
-  TEST_SYMBOL(ZSTD_getBlockSizeMax);
-  TEST_SYMBOL(ZSTD_compressBlock);
-  TEST_SYMBOL(ZSTD_decompressBlock);
-  TEST_SYMBOL(ZSTD_insertBlock);
-}
diff --git a/priv/zstd/contrib/linux-kernel/test/XXHashUserlandTest.cpp b/priv/zstd/contrib/linux-kernel/test/XXHashUserlandTest.cpp
deleted file mode 100644
index f50401a..0000000
--- a/priv/zstd/contrib/linux-kernel/test/XXHashUserlandTest.cpp
+++ /dev/null
@@ -1,166 +0,0 @@
-extern "C" {
-#include 
-#include 
-}
-#include 
-#include 
-#include 
-#include 
-#include 
-#define XXH_STATIC_LINKING_ONLY
-#include 
-
-using namespace std;
-
-namespace {
-const std::array kTestInputs = {
-  "",
-  "0",
-  "01234",
-  "0123456789abcde",
-  "0123456789abcdef",
-  "0123456789abcdef0",
-  "0123456789abcdef0123",
-  "0123456789abcdef0123456789abcde",
-  "0123456789abcdef0123456789abcdef",
-  "0123456789abcdef0123456789abcdef0",
-  "0123456789abcdef0123456789abcdef0123456789abcdef0123456789abcdef",
-};
-
-bool testXXH32(const void *input, const size_t length, uint32_t seed) {
-  return XXH32(input, length, seed) == xxh32(input, length, seed);
-}
-
-bool testXXH64(const void *input, const size_t length, uint32_t seed) {
-  return XXH64(input, length, seed) == xxh64(input, length, seed);
-}
-
-class XXH32State {
-  struct xxh32_state kernelState;
-  XXH32_state_t state;
-
-public:
-  explicit XXH32State(const uint32_t seed) { reset(seed); }
-  XXH32State(XXH32State const& other) noexcept {
-    xxh32_copy_state(&kernelState, &other.kernelState);
-    XXH32_copyState(&state, &other.state);
-  }
-  XXH32State& operator=(XXH32State const& other) noexcept {
-    xxh32_copy_state(&kernelState, &other.kernelState);
-    XXH32_copyState(&state, &other.state);
-    return *this;
-  }
-
-  void reset(const uint32_t seed) {
-    xxh32_reset(&kernelState, seed);
-    EXPECT_EQ(0, XXH32_reset(&state, seed));
-  }
-
-  void update(const void *input, const size_t length) {
-    EXPECT_EQ(0, xxh32_update(&kernelState, input, length));
-    EXPECT_EQ(0, (int)XXH32_update(&state, input, length));
-  }
-
-  bool testDigest() const {
-    return xxh32_digest(&kernelState) == XXH32_digest(&state);
-  }
-};
-
-class XXH64State {
-  struct xxh64_state kernelState;
-  XXH64_state_t state;
-
-public:
-  explicit XXH64State(const uint64_t seed) { reset(seed); }
-  XXH64State(XXH64State const& other) noexcept {
-    xxh64_copy_state(&kernelState, &other.kernelState);
-    XXH64_copyState(&state, &other.state);
-  }
-  XXH64State& operator=(XXH64State const& other) noexcept {
-    xxh64_copy_state(&kernelState, &other.kernelState);
-    XXH64_copyState(&state, &other.state);
-    return *this;
-  }
-
-  void reset(const uint64_t seed) {
-    xxh64_reset(&kernelState, seed);
-    EXPECT_EQ(0, XXH64_reset(&state, seed));
-  }
-
-  void update(const void *input, const size_t length) {
-    EXPECT_EQ(0, xxh64_update(&kernelState, input, length));
-    EXPECT_EQ(0, (int)XXH64_update(&state, input, length));
-  }
-
-  bool testDigest() const {
-    return xxh64_digest(&kernelState) == XXH64_digest(&state);
-  }
-};
-}
-
-TEST(Simple, Null) {
-  EXPECT_TRUE(testXXH32(NULL, 0, 0));
-  EXPECT_TRUE(testXXH64(NULL, 0, 0));
-}
-
-TEST(Stream, Null) {
-  struct xxh32_state state32;
-  xxh32_reset(&state32, 0);
-  EXPECT_EQ(-EINVAL, xxh32_update(&state32, NULL, 0));
-
-  struct xxh64_state state64;
-  xxh64_reset(&state64, 0);
-  EXPECT_EQ(-EINVAL, xxh64_update(&state64, NULL, 0));
-}
-
-TEST(Simple, TestInputs) {
-  for (uint32_t seed = 0; seed < 100000; seed = (seed + 1) * 3) {
-    for (auto const input : kTestInputs) {
-      EXPECT_TRUE(testXXH32(input.data(), input.size(), seed));
-      EXPECT_TRUE(testXXH64(input.data(), input.size(), (uint64_t)seed));
-    }
-  }
-}
-
-TEST(Stream, TestInputs) {
-  for (uint32_t seed = 0; seed < 100000; seed = (seed + 1) * 3) {
-    for (auto const input : kTestInputs) {
-      XXH32State s32(seed);
-      XXH64State s64(seed);
-      s32.update(input.data(), input.size());
-      s64.update(input.data(), input.size());
-      EXPECT_TRUE(s32.testDigest());
-      EXPECT_TRUE(s64.testDigest());
-    }
-  }
-}
-
-TEST(Stream, MultipleTestInputs) {
-  for (uint32_t seed = 0; seed < 100000; seed = (seed + 1) * 3) {
-    XXH32State s32(seed);
-    XXH64State s64(seed);
-    for (auto const input : kTestInputs) {
-      s32.update(input.data(), input.size());
-      s64.update(input.data(), input.size());
-    }
-    EXPECT_TRUE(s32.testDigest());
-    EXPECT_TRUE(s64.testDigest());
-  }
-}
-
-TEST(Stream, CopyState) {
-  for (uint32_t seed = 0; seed < 100000; seed = (seed + 1) * 3) {
-    XXH32State s32(seed);
-    XXH64State s64(seed);
-    for (auto const input : kTestInputs) {
-      auto t32(s32);
-      t32.update(input.data(), input.size());
-      s32 = t32;
-      auto t64(s64);
-      t64.update(input.data(), input.size());
-      s64 = t64;
-    }
-    EXPECT_TRUE(s32.testDigest());
-    EXPECT_TRUE(s64.testDigest());
-  }
-}
diff --git a/priv/zstd/contrib/linux-kernel/test/include/asm/unaligned.h b/priv/zstd/contrib/linux-kernel/test/include/asm/unaligned.h
deleted file mode 100644
index 4f48281..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/asm/unaligned.h
+++ /dev/null
@@ -1,177 +0,0 @@
-#ifndef ASM_UNALIGNED_H
-#define ASM_UNALIGNED_H
-
-#include 
-#include 
-#include 
-
-#define _LITTLE_ENDIAN 1
-
-static unsigned _isLittleEndian(void)
-{
-    const union { uint32_t u; uint8_t c[4]; } one = { 1 };
-    assert(_LITTLE_ENDIAN == one.c[0]);
-    return _LITTLE_ENDIAN;
-}
-
-static uint16_t _swap16(uint16_t in)
-{
-    return ((in & 0xF) << 8) + ((in & 0xF0) >> 8);
-}
-
-static uint32_t _swap32(uint32_t in)
-{
-    return __builtin_bswap32(in);
-}
-
-static uint64_t _swap64(uint64_t in)
-{
-    return __builtin_bswap64(in);
-}
-
-/* Little endian */
-static uint16_t get_unaligned_le16(const void* memPtr)
-{
-    uint16_t val;
-    memcpy(&val, memPtr, sizeof(val));
-    if (!_isLittleEndian()) _swap16(val);
-    return val;
-}
-
-static uint32_t get_unaligned_le32(const void* memPtr)
-{
-    uint32_t val;
-    memcpy(&val, memPtr, sizeof(val));
-    if (!_isLittleEndian()) _swap32(val);
-    return val;
-}
-
-static uint64_t get_unaligned_le64(const void* memPtr)
-{
-    uint64_t val;
-    memcpy(&val, memPtr, sizeof(val));
-    if (!_isLittleEndian()) _swap64(val);
-    return val;
-}
-
-static void put_unaligned_le16(uint16_t value, void* memPtr)
-{
-    if (!_isLittleEndian()) value = _swap16(value);
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-static void put_unaligned_le32(uint32_t value, void* memPtr)
-{
-    if (!_isLittleEndian()) value = _swap32(value);
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-static void put_unaligned_le64(uint64_t value, void* memPtr)
-{
-    if (!_isLittleEndian()) value = _swap64(value);
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-/* big endian */
-static uint32_t get_unaligned_be32(const void* memPtr)
-{
-    uint32_t val;
-    memcpy(&val, memPtr, sizeof(val));
-    if (_isLittleEndian()) _swap32(val);
-    return val;
-}
-
-static uint64_t get_unaligned_be64(const void* memPtr)
-{
-    uint64_t val;
-    memcpy(&val, memPtr, sizeof(val));
-    if (_isLittleEndian()) _swap64(val);
-    return val;
-}
-
-static void put_unaligned_be32(uint32_t value, void* memPtr)
-{
-    if (_isLittleEndian()) value = _swap32(value);
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-static void put_unaligned_be64(uint64_t value, void* memPtr)
-{
-    if (_isLittleEndian()) value = _swap64(value);
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-/* generic */
-extern void __bad_unaligned_access_size(void);
-
-#define __get_unaligned_le(ptr) ((typeof(*(ptr)))({                            \
-    __builtin_choose_expr(sizeof(*(ptr)) == 1, *(ptr),                         \
-    __builtin_choose_expr(sizeof(*(ptr)) == 2, get_unaligned_le16((ptr)),      \
-    __builtin_choose_expr(sizeof(*(ptr)) == 4, get_unaligned_le32((ptr)),      \
-    __builtin_choose_expr(sizeof(*(ptr)) == 8, get_unaligned_le64((ptr)),      \
-    __bad_unaligned_access_size()))));                                         \
-    }))
-
-#define __get_unaligned_be(ptr) ((typeof(*(ptr)))({                            \
-    __builtin_choose_expr(sizeof(*(ptr)) == 1, *(ptr),                         \
-    __builtin_choose_expr(sizeof(*(ptr)) == 2, get_unaligned_be16((ptr)),      \
-    __builtin_choose_expr(sizeof(*(ptr)) == 4, get_unaligned_be32((ptr)),      \
-    __builtin_choose_expr(sizeof(*(ptr)) == 8, get_unaligned_be64((ptr)),      \
-    __bad_unaligned_access_size()))));                                         \
-    }))
-
-#define __put_unaligned_le(val, ptr)                                           \
-  ({                                                                           \
-    void *__gu_p = (ptr);                                                      \
-    switch (sizeof(*(ptr))) {                                                  \
-    case 1:                                                                    \
-      *(uint8_t *)__gu_p = (uint8_t)(val);                                     \
-      break;                                                                   \
-    case 2:                                                                    \
-      put_unaligned_le16((uint16_t)(val), __gu_p);                             \
-      break;                                                                   \
-    case 4:                                                                    \
-      put_unaligned_le32((uint32_t)(val), __gu_p);                             \
-      break;                                                                   \
-    case 8:                                                                    \
-      put_unaligned_le64((uint64_t)(val), __gu_p);                             \
-      break;                                                                   \
-    default:                                                                   \
-      __bad_unaligned_access_size();                                           \
-      break;                                                                   \
-    }                                                                          \
-    (void)0;                                                                   \
-  })
-
-#define __put_unaligned_be(val, ptr)                                           \
-  ({                                                                           \
-    void *__gu_p = (ptr);                                                      \
-    switch (sizeof(*(ptr))) {                                                  \
-    case 1:                                                                    \
-      *(uint8_t *)__gu_p = (uint8_t)(val);                                     \
-      break;                                                                   \
-    case 2:                                                                    \
-      put_unaligned_be16((uint16_t)(val), __gu_p);                             \
-      break;                                                                   \
-    case 4:                                                                    \
-      put_unaligned_be32((uint32_t)(val), __gu_p);                             \
-      break;                                                                   \
-    case 8:                                                                    \
-      put_unaligned_be64((uint64_t)(val), __gu_p);                             \
-      break;                                                                   \
-    default:                                                                   \
-      __bad_unaligned_access_size();                                           \
-      break;                                                                   \
-    }                                                                          \
-    (void)0;                                                                   \
-  })
-
-#if _LITTLE_ENDIAN
-#  define get_unaligned __get_unaligned_le
-#  define put_unaligned __put_unaligned_le
-#else
-#  define get_unaligned __get_unaligned_be
-#  define put_unaligned __put_unaligned_be
-#endif
-
-#endif // ASM_UNALIGNED_H
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/compiler.h b/priv/zstd/contrib/linux-kernel/test/include/linux/compiler.h
deleted file mode 100644
index 7991b8b..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/compiler.h
+++ /dev/null
@@ -1,12 +0,0 @@
-#ifndef LINUX_COMIPLER_H_
-#define LINUX_COMIPLER_H_
-
-#ifndef __always_inline
-#  define __always_inline inline
-#endif
-
-#ifndef noinline
-#  define noinline __attribute__((__noinline__))
-#endif
-
-#endif // LINUX_COMIPLER_H_
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/errno.h b/priv/zstd/contrib/linux-kernel/test/include/linux/errno.h
deleted file mode 100644
index b9db085..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/errno.h
+++ /dev/null
@@ -1,6 +0,0 @@
-#ifndef LINUX_ERRNO_H_
-#define LINUX_ERRNO_H_
-
-#define EINVAL 22
-
-#endif // LINUX_ERRNO_H_
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/kernel.h b/priv/zstd/contrib/linux-kernel/test/include/linux/kernel.h
deleted file mode 100644
index 3ef2f7f..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/kernel.h
+++ /dev/null
@@ -1,16 +0,0 @@
-#ifndef LINUX_KERNEL_H_
-#define LINUX_KERNEL_H_
-
-#define ALIGN(x, a) ({                                                         \
-    typeof(x) const __xe = (x);                                                \
-    typeof(a) const __ae = (a);                                                \
-    typeof(a) const __m = __ae - 1;                                            \
-    typeof(x) const __r = __xe & __m;                                          \
-    __xe + (__r ? (__ae - __r) : 0);                                           \
-  })
-
-#define PTR_ALIGN(p, a) (typeof(p))ALIGN((unsigned long long)(p), (a))
-
-#define current Something that doesn't compile :)
-
-#endif // LINUX_KERNEL_H_
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/math64.h b/priv/zstd/contrib/linux-kernel/test/include/linux/math64.h
deleted file mode 100644
index 3d0ae72..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/math64.h
+++ /dev/null
@@ -1,11 +0,0 @@
-#ifndef LINUX_MATH64_H
-#define LINUX_MATH64_H
-
-#include 
-
-static uint64_t div_u64(uint64_t n, uint32_t d)
-{
-  return n / d;
-}
-
-#endif
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/module.h b/priv/zstd/contrib/linux-kernel/test/include/linux/module.h
deleted file mode 100644
index ef514c3..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/module.h
+++ /dev/null
@@ -1,10 +0,0 @@
-#ifndef LINUX_MODULE_H_
-#define LINUX_MODULE_H_
-
-#define EXPORT_SYMBOL(symbol)                                                  \
-  void* __##symbol = symbol
-#define MODULE_LICENSE(license) static char const *const LICENSE = license
-#define MODULE_DESCRIPTION(description)                                        \
-  static char const *const DESCRIPTION = description
-
-#endif // LINUX_MODULE_H_
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/string.h b/priv/zstd/contrib/linux-kernel/test/include/linux/string.h
deleted file mode 100644
index 3b2f590..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/string.h
+++ /dev/null
@@ -1 +0,0 @@
-#include 
diff --git a/priv/zstd/contrib/linux-kernel/test/include/linux/types.h b/priv/zstd/contrib/linux-kernel/test/include/linux/types.h
deleted file mode 100644
index c2d4f4b..0000000
--- a/priv/zstd/contrib/linux-kernel/test/include/linux/types.h
+++ /dev/null
@@ -1,2 +0,0 @@
-#include 
-#include 
diff --git a/priv/zstd/contrib/linux-kernel/xxhash_test.c b/priv/zstd/contrib/linux-kernel/xxhash_test.c
deleted file mode 100644
index eb0fb1c..0000000
--- a/priv/zstd/contrib/linux-kernel/xxhash_test.c
+++ /dev/null
@@ -1,185 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/* DO_XXH should be 32 or 64 for xxh32 and xxh64 respectively */
-#define DO_XXH 0
-/* DO_CRC should be 0 or 1 */
-#define DO_CRC 0
-/* Buffer size */
-#define BUFFER_SIZE 4096
-
-#include 
-#include 
-#include 
-#include 
-
-#if DO_XXH
-#include 
-#endif
-
-#if DO_CRC
-#include 
-#endif
-
-/* Device name to pass to register_chrdev(). */
-#define DEVICE_NAME "xxhash_test"
-
-/* Dynamically allocated device major number */
-static int device_major;
-
-/*
- * We reuse the same hash state, and thus can hash only one
- * file at a time.
- */
-static bool device_is_open;
-
-static uint64_t total_length;
-
-
-#if (DO_XXH == 32)
-
-#define xxh_state xxh32_state
-#define xxh_reset xxh32_reset
-#define xxh_update xxh32_update
-#define xxh_digest xxh32_digest
-#define XXH_FORMAT "XXH32 = 0x%x"
-
-#elif (DO_XXH == 64)
-
-#define xxh_state xxh64_state
-#define xxh_reset xxh64_reset
-#define xxh_update xxh64_update
-#define xxh_digest xxh64_digest
-#define XXH_FORMAT "XXH64 = 0x%llx"
-
-#elif DO_XXH
-
-#error "Invalid value of DO_XXH"
-
-#endif
-
-#if DO_XXH
-
-/* XXH state */
-static struct xxh_state state;
-
-#endif /* DO_XXH */
-
-#if DO_CRC
-
-static uint32_t crc;
-
-#endif /* DO_CRC */
-
-/*
- * Input buffer used to put data coming from userspace.
- */
-static uint8_t buffer_in[BUFFER_SIZE];
-
-static int xxhash_test_open(struct inode *i, struct file *f)
-{
-	if (device_is_open)
-		return -EBUSY;
-
-	device_is_open = true;
-
-	total_length = 0;
-#if DO_XXH
-	xxh_reset(&state, 0);
-#endif
-#if DO_CRC
-	crc = 0xFFFFFFFF;
-#endif
-
-	printk(KERN_INFO DEVICE_NAME ": opened\n");
-	return 0;
-}
-
-static int xxhash_test_release(struct inode *i, struct file *f)
-{
-	device_is_open = false;
-
-	printk(KERN_INFO DEVICE_NAME ": total_len = %llu\n", total_length);
-#if DO_XXH
-	printk(KERN_INFO DEVICE_NAME ": " XXH_FORMAT "\n", xxh_digest(&state));
-#endif
-#if DO_CRC
-	printk(KERN_INFO DEVICE_NAME ": CRC32 = 0x%08x\n", ~crc);
-#endif
-	printk(KERN_INFO DEVICE_NAME ": closed\n");
-	return 0;
-}
-
-/*
- * Hash the data given to us from userspace.
- */
-static ssize_t xxhash_test_write(struct file *file, const char __user *buf,
-				 size_t size, loff_t *pos)
-{
-	size_t remaining = size;
-
-	while (remaining > 0) {
-#if DO_XXH
-		int ret;
-#endif
-		size_t const copy_size = min(remaining, sizeof(buffer_in));
-
-		if (copy_from_user(buffer_in, buf, copy_size))
-			return -EFAULT;
-		buf += copy_size;
-		remaining -= copy_size;
-		total_length += copy_size;
-#if DO_XXH
-		if ((ret = xxh_update(&state, buffer_in, copy_size))) {
-			printk(KERN_INFO DEVICE_NAME ": xxh failure.");
-			return ret;
-		}
-#endif
-#if DO_CRC
-		crc = crc32(crc, buffer_in, copy_size);
-#endif
-	}
-	return size;
-}
-/* register the character device. */
-static int __init xxhash_test_init(void)
-{
-	static const struct file_operations fileops = {
-		.owner = THIS_MODULE,
-		.open = &xxhash_test_open,
-		.release = &xxhash_test_release,
-		.write = &xxhash_test_write
-	};
-
-	device_major = register_chrdev(0, DEVICE_NAME, &fileops);
-	if (device_major < 0) {
-		return device_major;
-	}
-
-	printk(KERN_INFO DEVICE_NAME ": module loaded\n");
-	printk(KERN_INFO DEVICE_NAME ": Create a device node with "
-			"'mknod " DEVICE_NAME " c %d 0' and write data "
-			"to it.\n", device_major);
-	return 0;
-}
-
-static void __exit xxhash_test_exit(void)
-{
-	unregister_chrdev(device_major, DEVICE_NAME);
-	printk(KERN_INFO DEVICE_NAME ": module unloaded\n");
-}
-
-module_init(xxhash_test_init);
-module_exit(xxhash_test_exit);
-
-MODULE_DESCRIPTION("XXHash tester");
-MODULE_VERSION("1.0");
-
-
-MODULE_LICENSE("Dual BSD/GPL");
diff --git a/priv/zstd/contrib/linux-kernel/zstd_compress_test.c b/priv/zstd/contrib/linux-kernel/zstd_compress_test.c
deleted file mode 100644
index dc17adf..0000000
--- a/priv/zstd/contrib/linux-kernel/zstd_compress_test.c
+++ /dev/null
@@ -1,279 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/* Compression level or 0 to disable */
-#define DO_ZLIB 9
-/* Compression level or 0 to disable */
-#define DO_ZSTD 0
-/* Buffer size */
-#define BUFFER_SIZE 4096
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#if DO_ZSTD
-#include 
-#endif
-
-#if DO_ZLIB
-#include 
-#endif
-
-/* Device name to pass to register_chrdev(). */
-#define DEVICE_NAME "zstd_compress_test"
-
-/* Dynamically allocated device major number */
-static int device_major;
-
-/*
- * We reuse the same state, and thus can compress only one file at a time.
- */
-static bool device_is_open;
-
-
-static void *workspace = NULL;
-
-/*
- * Input buffer used to put data coming from userspace.
- */
-static uint8_t buffer_in[BUFFER_SIZE];
-static uint8_t buffer_out[BUFFER_SIZE];
-
-static uint64_t uncompressed_len;
-static uint64_t compressed_len;
-
-#if DO_ZSTD
-
-static ZSTD_CStream *state;
-
-static ZSTD_inBuffer input = {
-	.src = buffer_in,
-	.size = sizeof(buffer_in),
-	.pos = sizeof(buffer_in),
-};
-
-static ZSTD_outBuffer output = {
-	.dst = buffer_out,
-	.size = sizeof(buffer_out),
-	.pos = sizeof(buffer_out),
-};
-
-#endif /* DO_ZSTD */
-
-#if DO_ZLIB
-
-static z_stream state = {
-	.next_in = buffer_in,
-	.avail_in = 0,
-	.total_in = 0,
-
-	.next_out = buffer_out,
-	.avail_out = sizeof(buffer_out),
-	.total_out = 0,
-
-	.msg = NULL,
-	.state = NULL,
-	.workspace = NULL,
-};
-
-#endif /* DO_ZLIB */
-
-static int zstd_compress_test_open(struct inode *i, struct file *f)
-{
-	if (device_is_open)
-		return -EBUSY;
-
-	device_is_open = true;
-
-	uncompressed_len = compressed_len = 0;
-
-#if DO_ZSTD
-	if (ZSTD_isError(ZSTD_resetCStream(state, 0)))
-		return -EIO;
-#endif
-
-#if DO_ZLIB
-	if (zlib_deflateReset(&state) != Z_OK)
-		return -EIO;
-#endif
-
-	printk(KERN_INFO DEVICE_NAME ": opened\n");
-	return 0;
-}
-
-static int zstd_compress_test_release(struct inode *i, struct file *f)
-{
-	device_is_open = false;
-
-#if DO_ZSTD
-	do {
-		size_t ret;
-
-		output.pos = 0;
-		ret = ZSTD_endStream(state, &output);
-		if (ZSTD_isError(ret)) {
-			printk(KERN_INFO DEVICE_NAME ": zstd end error %u\n", ZSTD_getErrorCode(ret));
-			return -EIO;
-		}
-		compressed_len += output.pos;
-	} while (output.pos != output.size);
-#endif
-
-#if DO_ZLIB
-	for (;;) {
-		int ret;
-
-		state.next_out = buffer_out;
-		state.avail_out = sizeof(buffer_out);
-		ret = zlib_deflate(&state, Z_FINISH);
-		compressed_len += sizeof(buffer_out) - state.avail_out;
-		if (ret == Z_STREAM_END)
-			break;
-		if (ret != Z_OK) {
-			printk(KERN_INFO DEVICE_NAME ": zlib end error %d: %s\n", ret, state.msg);
-			return -EIO;
-		}
-	}
-#endif
-
-	printk(KERN_INFO DEVICE_NAME ": uncompressed_len = %llu\n", uncompressed_len);
-	printk(KERN_INFO DEVICE_NAME ": compressed_len   = %llu\n", compressed_len);
-	printk(KERN_INFO DEVICE_NAME ": closed\n");
-	return 0;
-}
-
-/*
- * Hash the data given to us from userspace.
- */
-static ssize_t zstd_compress_test_write(struct file *file,
-				 const char __user *buf, size_t size, loff_t *pos)
-{
-	size_t remaining = size;
-
-	while (remaining > 0) {
-		size_t const copy_size = min(remaining, sizeof(buffer_in));
-
-		if (copy_from_user(buffer_in, buf, copy_size))
-			return -EFAULT;
-		buf += copy_size;
-		remaining -= copy_size;
-		uncompressed_len += copy_size;
-
-#if DO_ZSTD
-		input.pos = 0;
-		input.size = copy_size;
-		while (input.pos != input.size) {
-			size_t ret;
-
-			output.pos = 0;
-			ret = ZSTD_compressStream(state, &output, &input);
-			if (ZSTD_isError(ret)) {
-				printk(KERN_INFO DEVICE_NAME ": zstd compress error %u\n", ZSTD_getErrorCode(ret));
-				return -EIO;
-			}
-			compressed_len += output.pos;
-		}
-#endif
-#if DO_ZLIB
-		state.next_in = buffer_in;
-		state.avail_in = copy_size;
-		while (state.avail_in > 0) {
-			int ret;
-
-			state.next_out = buffer_out;
-			state.avail_out = sizeof(buffer_out);
-			ret = zlib_deflate(&state, Z_NO_FLUSH);
-			compressed_len += sizeof(buffer_out) - state.avail_out;
-			if (ret != Z_OK) {
-				printk(KERN_INFO DEVICE_NAME ": zlib end error %d: %s\n", ret, state.msg);
-				return -EIO;
-			}
-		}
-#endif
-	}
-	return size;
-}
-/* register the character device. */
-static int __init zstd_compress_test_init(void)
-{
-	static const struct file_operations fileops = {
-		.owner = THIS_MODULE,
-		.open = &zstd_compress_test_open,
-		.release = &zstd_compress_test_release,
-		.write = &zstd_compress_test_write
-	};
-	size_t workspace_size = 0;
-#if DO_ZSTD
-	ZSTD_parameters params;
-#endif
-
-	device_major = register_chrdev(0, DEVICE_NAME, &fileops);
-	if (device_major < 0) {
-		return device_major;
-	}
-
-#if DO_ZSTD
-	params = ZSTD_getParams(DO_ZSTD, 0, 0);
-	workspace_size = ZSTD_CStreamWorkspaceBound(params.cParams);
-
-	if (!(workspace = vmalloc(workspace_size)))
-		goto fail;
-	if (!(state = ZSTD_initCStream(params, 0, workspace, workspace_size)))
-		goto fail;
-#endif
-
-#if DO_ZLIB
-	workspace_size = zlib_deflate_workspacesize(MAX_WBITS, MAX_MEM_LEVEL);
-
-	if (!(workspace = vmalloc(workspace_size)))
-		goto fail;
-	state.workspace = workspace;
-	if (zlib_deflateInit(&state, DO_ZLIB) != Z_OK)
-		goto fail;
-#endif
-
-	printk(KERN_INFO DEVICE_NAME ": module loaded\n");
-	printk(KERN_INFO DEVICE_NAME ": compression requires %zu bytes of memory\n", workspace_size);
-	printk(KERN_INFO DEVICE_NAME ": Create a device node with "
-			"'mknod " DEVICE_NAME " c %d 0' and write data "
-			"to it.\n", device_major);
-	return 0;
-
-fail:
-	printk(KERN_INFO DEVICE_NAME ": failed to load module\n");
-	if (workspace) {
-		vfree(workspace);
-		workspace = NULL;
-	}
-	return -ENOMEM;
-}
-
-static void __exit zstd_compress_test_exit(void)
-{
-	unregister_chrdev(device_major, DEVICE_NAME);
-#if DO_ZLIB
-	zlib_deflateEnd(&state);
-#endif
-	if (workspace) {
-		vfree(workspace);
-		workspace = NULL;
-	}
-	printk(KERN_INFO DEVICE_NAME ": module unloaded\n");
-}
-
-module_init(zstd_compress_test_init);
-module_exit(zstd_compress_test_exit);
-
-MODULE_DESCRIPTION("Zstd compression tester");
-MODULE_VERSION("1.0");
-
-MODULE_LICENSE("Dual BSD/GPL");
diff --git a/priv/zstd/contrib/linux-kernel/zstd_decompress_test.c b/priv/zstd/contrib/linux-kernel/zstd_decompress_test.c
deleted file mode 100644
index f6efddd..0000000
--- a/priv/zstd/contrib/linux-kernel/zstd_decompress_test.c
+++ /dev/null
@@ -1,250 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/* Compression level or 0 to disable */
-#define DO_ZLIB 1
-/* Compression level or 0 to disable */
-#define DO_ZSTD 0
-/* Buffer size */
-#define BUFFER_SIZE 4096
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#if DO_ZSTD
-#include 
-#endif
-
-#if DO_ZLIB
-#include 
-#endif
-
-/* Device name to pass to register_chrdev(). */
-#define DEVICE_NAME "zstd_decompress_test"
-
-/* Dynamically allocated device major number */
-static int device_major;
-
-/*
- * We reuse the same state, and thus can compress only one file at a time.
- */
-static bool device_is_open;
-
-
-static void *workspace = NULL;
-
-/*
- * Input buffer used to put data coming from userspace.
- */
-static uint8_t buffer_in[BUFFER_SIZE];
-static uint8_t buffer_out[BUFFER_SIZE];
-
-static uint64_t uncompressed_len;
-static uint64_t compressed_len;
-
-#if DO_ZSTD
-
-static ZSTD_DStream *state;
-
-static ZSTD_inBuffer input = {
-	.src = buffer_in,
-	.size = sizeof(buffer_in),
-	.pos = sizeof(buffer_in),
-};
-
-static ZSTD_outBuffer output = {
-	.dst = buffer_out,
-	.size = sizeof(buffer_out),
-	.pos = sizeof(buffer_out),
-};
-
-#endif /* DO_ZSTD */
-
-#if DO_ZLIB
-
-static z_stream state = {
-	.next_in = buffer_in,
-	.avail_in = 0,
-	.total_in = 0,
-
-	.next_out = buffer_out,
-	.avail_out = sizeof(buffer_out),
-	.total_out = 0,
-
-	.msg = NULL,
-	.state = NULL,
-	.workspace = NULL,
-};
-
-#endif /* DO_ZLIB */
-
-static int zstd_decompress_test_open(struct inode *i, struct file *f)
-{
-	if (device_is_open)
-		return -EBUSY;
-
-	device_is_open = true;
-
-	uncompressed_len = compressed_len = 0;
-
-#if DO_ZSTD
-	if (ZSTD_isError(ZSTD_resetDStream(state)))
-		return -EIO;
-#endif
-
-#if DO_ZLIB
-	if (zlib_inflateReset(&state) != Z_OK)
-		return -EIO;
-#endif
-
-	printk(KERN_INFO DEVICE_NAME ": opened\n");
-	return 0;
-}
-
-static int zstd_decompress_test_release(struct inode *i, struct file *f)
-{
-	device_is_open = false;
-
-	printk(KERN_INFO DEVICE_NAME ": uncompressed_len = %llu\n", uncompressed_len);
-	printk(KERN_INFO DEVICE_NAME ": compressed_len   = %llu\n", compressed_len);
-	printk(KERN_INFO DEVICE_NAME ": closed\n");
-	return 0;
-}
-
-/*
- * Hash the data given to us from userspace.
- */
-static ssize_t zstd_decompress_test_write(struct file *file,
-				 const char __user *buf, size_t size, loff_t *pos)
-{
-	size_t remaining = size;
-
-	while (remaining > 0) {
-		size_t const copy_size = min(remaining, sizeof(buffer_in));
-
-		if (copy_from_user(buffer_in, buf, copy_size))
-			return -EFAULT;
-		buf += copy_size;
-		remaining -= copy_size;
-		compressed_len += copy_size;
-
-#if DO_ZSTD
-		input.pos = 0;
-		input.size = copy_size;
-		while (input.pos != input.size) {
-			size_t ret;
-
-			output.pos = 0;
-			ret = ZSTD_decompressStream(state, &output, &input);
-			if (ZSTD_isError(ret)) {
-				printk(KERN_INFO DEVICE_NAME ": zstd decompress error %u\n", ZSTD_getErrorCode(ret));
-				return -EIO;
-			}
-			uncompressed_len += output.pos;
-		}
-#endif
-#if DO_ZLIB
-		state.next_in = buffer_in;
-		state.avail_in = copy_size;
-		while (state.avail_in > 0) {
-			int ret;
-
-			state.next_out = buffer_out;
-			state.avail_out = sizeof(buffer_out);
-			ret = zlib_inflate(&state, Z_NO_FLUSH);
-			uncompressed_len += sizeof(buffer_out) - state.avail_out;
-			if (ret != Z_OK && ret != Z_STREAM_END) {
-				printk(KERN_INFO DEVICE_NAME ": zlib decompress error %d: %s\n", ret, state.msg);
-				return -EIO;
-			}
-		}
-#endif
-	}
-	return size;
-}
-/* register the character device. */
-static int __init zstd_decompress_test_init(void)
-{
-	static const struct file_operations fileops = {
-		.owner = THIS_MODULE,
-		.open = &zstd_decompress_test_open,
-		.release = &zstd_decompress_test_release,
-		.write = &zstd_decompress_test_write
-	};
-	size_t workspace_size = 0;
-#if DO_ZSTD
-	ZSTD_parameters params;
-	size_t max_window_size;
-#endif
-
-	device_major = register_chrdev(0, DEVICE_NAME, &fileops);
-	if (device_major < 0) {
-		return device_major;
-	}
-
-#if DO_ZSTD
-	params = ZSTD_getParams(DO_ZSTD, 0, 0);
-	max_window_size = (size_t)1 << params.cParams.windowLog;
-	workspace_size = ZSTD_DStreamWorkspaceBound(max_window_size);
-
-	if (!(workspace = vmalloc(workspace_size)))
-		goto fail;
-	if (!(state = ZSTD_initDStream(max_window_size, workspace, workspace_size)))
-		goto fail;
-#endif
-
-#if DO_ZLIB
-	workspace_size = zlib_inflate_workspacesize();
-
-	if (!(workspace = vmalloc(workspace_size)))
-		goto fail;
-	state.workspace = workspace;
-	if (zlib_inflateInit(&state) != Z_OK)
-		goto fail;
-#endif
-
-	printk(KERN_INFO DEVICE_NAME ": module loaded\n");
-	printk(KERN_INFO DEVICE_NAME ": decompression requires %zu bytes of memory\n", workspace_size);
-	printk(KERN_INFO DEVICE_NAME ": Create a device node with "
-			"'mknod " DEVICE_NAME " c %d 0' and write data "
-			"to it.\n", device_major);
-	return 0;
-
-fail:
-	printk(KERN_INFO DEVICE_NAME ": failed to load module\n");
-	if (workspace) {
-		vfree(workspace);
-		workspace = NULL;
-	}
-	return -ENOMEM;
-}
-
-static void __exit zstd_decompress_test_exit(void)
-{
-	unregister_chrdev(device_major, DEVICE_NAME);
-#if DO_ZLIB
-	zlib_deflateEnd(&state);
-#endif
-	if (workspace) {
-		vfree(workspace);
-		workspace = NULL;
-	}
-	printk(KERN_INFO DEVICE_NAME ": module unloaded\n");
-}
-
-module_init(zstd_decompress_test_init);
-module_exit(zstd_decompress_test_exit);
-
-MODULE_DESCRIPTION("Zstd decompression tester");
-MODULE_VERSION("1.0");
-
-MODULE_LICENSE("Dual BSD/GPL");
diff --git a/priv/zstd/contrib/long_distance_matching/Makefile b/priv/zstd/contrib/long_distance_matching/Makefile
deleted file mode 100644
index 6ed1fab..0000000
--- a/priv/zstd/contrib/long_distance_matching/Makefile
+++ /dev/null
@@ -1,36 +0,0 @@
-# ################################################################
-# Copyright (c) 2017-present, Facebook, Inc.
-# All rights reserved.
-#
-# This source code is licensed under both the BSD-style license (found in the
-# LICENSE file in the root directory of this source tree) and the GPLv2 (found
-# in the COPYING file in the root directory of this source tree).
-# ################################################################
-
-# This Makefile presumes libzstd is installed, using `sudo make install`
-
-CPPFLAGS+= -I../../lib/common
-CFLAGS  ?= -O3
-DEBUGFLAGS = -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \
-            -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \
-            -Wstrict-prototypes -Wundef -Wpointer-arith -Wformat-security \
-            -Wvla -Wformat=2 -Winit-self -Wfloat-equal -Wwrite-strings \
-            -Wredundant-decls
-CFLAGS  += $(DEBUGFLAGS) $(MOREFLAGS)
-FLAGS    = $(CPPFLAGS) $(CFLAGS)
-
-LDFLAGS += -lzstd
-
-.PHONY: default all clean
-
-default: all
-
-all: ldm
-
-ldm: ldm_common.c ldm.c main.c
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-clean:
-	@rm -f core *.o tmp* result* *.ldm *.ldm.dec \
-	ldm
-	@echo Cleaning completed
diff --git a/priv/zstd/contrib/long_distance_matching/README.md b/priv/zstd/contrib/long_distance_matching/README.md
deleted file mode 100644
index 771a6c3..0000000
--- a/priv/zstd/contrib/long_distance_matching/README.md
+++ /dev/null
@@ -1,102 +0,0 @@
-This is a compression algorithm focused on finding long distance matches.
-
-It is based upon lz4 and uses nearly the same block format (github.com/lz4/lz4/blob/dev/doc/lz4_Block_format.md). The number of bytes to encode the offset is four instead of two in lz4 to reflect the longer distance matching. The block format is described in `ldm.h`.
-
-### Build
-
-Run `make`.
-
-### Compressing a file
-
-`ldm `
-
-Decompression and verification can be enabled by defining `DECOMPRESS_AND_VERIFY` in `main.c`.
-The output file names are as follows:
-- `.ldm` : compressed file
-- `.ldm.dec` : decompressed file
-
-### Parameters
-
-There are various parameters that can be tuned. These parameters can be tuned in `ldm.h` or, alternatively if `ldm_params.h` is included, in `ldm_params.h` (for easier configuration).
-
-The parameters are as follows and must all be defined:
-- `LDM_MEMORY_USAGE` : the memory usage of the underlying hash table in bytes.
-- `HASH_BUCKET_SIZE_LOG` : the log size of each bucket in the hash table (used in collision resolution).
-- `LDM_LAG` : the lag (in bytes) in inserting entries into the hash table.
-- `LDM_WINDOW_SIZE_LOG` : the log maximum window size when searching for matches.
-- `LDM_MIN_MATCH_LENGTH` : the minimum match length.
-- `INSERT_BY_TAG` : insert entries into the hash table as a function of the hash. This increases speed by reducing the number of hash table lookups and match comparisons. Certain hashes will never be inserted.
-- `USE_CHECKSUM`  : store a checksum with the hash table entries for faster comparison. This halves the number of entries the hash table can contain.
-
-The optional parameter `HASH_ONLY_EVERY_LOG` is the log inverse frequency of insertion into the hash table. That is, an entry is inserted approximately every `1 << HASH_ONLY_EVERY_LOG` times. If this parameter is not defined, the value is computed as a function of the window size and memory usage to approximate an even coverage of the window.
-
-
-### Benchmark
-
-Below is a comparison of various compression methods on a tar of four versions of llvm (versions `3.9.0`, `3.9.1`, `4.0.0`, `4.0.1`) with a total size of `727900160` B.
-
-| Method | Size | Ratio |
-|:---|---:|---:|
-|lrzip -p 32 -n -w 1 | `369968714` | `1.97`|
-|ldm | `209391361` | `3.48`|
-|lz4 | `189954338` | `3.83`|
-|lrzip -p 32 -l -w 1 | `163940343` | `4.44`|
-|zstd -1 | `126080293` | `5.77`|
-|lrzip -p 32 -n | `124821009` | `5.83`|
-|lrzip -p 32 -n -w 1 & zstd -1 | `120317909` | `6.05`|
-|zstd -3 -o | `115290952` | `6.31`|
-|lrzip -p 32 -g -L 9 -w 1 | `107168979` | `6.79`|
-|zstd -6 -o | `102772098` | `7.08`|
-|zstd -T16 -9 | `98040470` | `7.42`|
-|lrzip -p 32 -n -w 1 & zstd -T32 -19 | `88050289` | `8.27`|
-|zstd -T32 -19 | `83626098` | `8.70`|
-|lrzip -p 32 -n & zstd -1 | `36335117` | `20.03`|
-|ldm & zstd -6 | `32856232` | `22.15`|
-|lrzip -p 32 -g -L 9 | `32243594` | `22.58`|
-|lrzip -p 32 -n & zstd -6 | `30954572` | `23.52`|
-|lrzip -p 32 -n & zstd -T32 -19 | `26472064` | `27.50`|
-
-The method marked `ldm` was run with the following parameters:
-
-| Parameter | Value |
-|:---|---:|
-| `LDM_MEMORY_USAGE`    |   `23`|
-|`HASH_BUCKET_SIZE_LOG` |    `3`|
-|`LDM_LAG`              |    `0`|
-|`LDM_WINDOW_SIZE_LOG`  |   `28`|
-|`LDM_MIN_MATCH_LENGTH`|   `64`|
-|`INSERT_BY_TAG`        |    `1`|
-|`USE_CHECKSUM`         |    `1`|
-
-The compression speed was `220.5 MB/s`.
-
-### Parameter selection
-
-Below is a brief discussion of the effects of the parameters on the speed and compression ratio.
-
-#### Speed
-
-A large bottleneck in terms of speed is finding the matches and comparing to see if they are greater than the minimum match length. Generally:
-- The fewer matches found (or the lower the percentage of the literals matched), the slower the algorithm will behave.
-- Increasing `HASH_ONLY_EVERY_LOG` results in fewer inserts and, if `INSERT_BY_TAG` is set, fewer lookups in the table. This has a large effect on speed, as well as compression ratio.
-- If `HASH_ONLY_EVERY_LOG` is not set, its value is calculated based on `LDM_WINDOW_SIZE_LOG` and `LDM_MEMORY_USAGE`. Increasing `LDM_WINDOW_SIZE_LOG` has the effect of increasing `HASH_ONLY_EVERY_LOG` and increasing `LDM_MEMORY_USAGE` decreases `HASH_ONLY_EVERY_LOG`.
-- `USE_CHECKSUM` generally improves speed with hash table lookups.
-
-#### Compression ratio
-
-The compression ratio is highly correlated with the coverage of matches. As a long distance matcher, the algorithm was designed to "optimize" for long distance matches outside the zstd compression window. The compression ratio after recompressing the output of the long-distance matcher with zstd was a more important signal in development than the raw compression ratio itself.
-
-Generally, increasing `LDM_MEMORY_USAGE` will improve the compression ratio. However when using the default computed value of `HASH_ONLY_EVERY_LOG`, this increases the frequency of insertion and lookup in the table and thus may result in a decrease in speed. 
-
-Below is a table showing the speed and compression ratio when compressing the llvm tar (as described above) using different settings for `LDM_MEMORY_USAGE`. The other parameters were the same as used in the benchmark above.
-
-| `LDM_MEMORY_USAGE` | Ratio | Speed (MB/s) | Ratio after zstd -6  |
-|---:| ---: | ---: | ---: |
-| `18` | `1.85` | `232.4` | `10.92` |
-| `21` | `2.79` | `233.9` | `15.92` |
-| `23` | `3.48` | `220.5` | `18.29` |
-| `25` | `4.56` | `140.8` | `19.21` |
-
-### Compression statistics
-
-Compression statistics (and the configuration) can be enabled/disabled via `COMPUTE_STATS` and `OUTPUT_CONFIGURATION` in `ldm.h`.
diff --git a/priv/zstd/contrib/long_distance_matching/ldm.c b/priv/zstd/contrib/long_distance_matching/ldm.c
deleted file mode 100644
index 37b188b..0000000
--- a/priv/zstd/contrib/long_distance_matching/ldm.c
+++ /dev/null
@@ -1,856 +0,0 @@
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#include "ldm.h"
-
-#define LDM_HASHTABLESIZE (1 << (LDM_MEMORY_USAGE))
-#define LDM_HASHTABLESIZE_U32 ((LDM_HASHTABLESIZE) >> 2)
-#define LDM_HASHTABLESIZE_U64 ((LDM_HASHTABLESIZE) >> 3)
-
-#if USE_CHECKSUM
-  #define LDM_HASH_ENTRY_SIZE_LOG 3
-#else
-  #define LDM_HASH_ENTRY_SIZE_LOG 2
-#endif
-
-// Entries are inserted into the table HASH_ONLY_EVERY + 1 times "on average".
-#ifndef HASH_ONLY_EVERY_LOG
-  #define HASH_ONLY_EVERY_LOG (LDM_WINDOW_SIZE_LOG-((LDM_MEMORY_USAGE)-(LDM_HASH_ENTRY_SIZE_LOG)))
-#endif
-
-#define HASH_ONLY_EVERY ((1 << (HASH_ONLY_EVERY_LOG)) - 1)
-
-#define HASH_BUCKET_SIZE (1 << (HASH_BUCKET_SIZE_LOG))
-#define NUM_HASH_BUCKETS_LOG ((LDM_MEMORY_USAGE)-(LDM_HASH_ENTRY_SIZE_LOG)-(HASH_BUCKET_SIZE_LOG))
-
-#define HASH_CHAR_OFFSET 10
-
-// Take the first match in the hash bucket only.
-//#define ZSTD_SKIP
-
-static const U64 prime8bytes = 11400714785074694791ULL;
-
-// Type of the small hash used to index into the hash table.
-typedef U32 hash_t;
-
-#if USE_CHECKSUM
-typedef struct LDM_hashEntry {
-  U32 offset;
-  U32 checksum;
-} LDM_hashEntry;
-#else
-typedef struct LDM_hashEntry {
-  U32 offset;
-} LDM_hashEntry;
-#endif
-
-struct LDM_compressStats {
-  U32 windowSizeLog, hashTableSizeLog;
-  U32 numMatches;
-  U64 totalMatchLength;
-  U64 totalLiteralLength;
-  U64 totalOffset;
-
-  U32 matchLengthHistogram[32];
-
-  U32 minOffset, maxOffset;
-  U32 offsetHistogram[32];
-};
-
-typedef struct LDM_hashTable LDM_hashTable;
-
-struct LDM_CCtx {
-  size_t isize;             /* Input size */
-  size_t maxOSize;          /* Maximum output size */
-
-  const BYTE *ibase;        /* Base of input */
-  const BYTE *ip;           /* Current input position */
-  const BYTE *iend;         /* End of input */
-
-  // Maximum input position such that hashing at the position does not exceed
-  // end of input.
-  const BYTE *ihashLimit;
-
-  // Maximum input position such that finding a match of at least the minimum
-  // match length does not exceed end of input.
-  const BYTE *imatchLimit;
-
-  const BYTE *obase;        /* Base of output */
-  BYTE *op;                 /* Output */
-
-  const BYTE *anchor;       /* Anchor to start of current (match) block */
-
-  LDM_compressStats stats;            /* Compression statistics */
-
-  LDM_hashTable *hashTable;
-
-  const BYTE *lastPosHashed;          /* Last position hashed */
-  U64 lastHash;
-
-  const BYTE *nextIp;                 // TODO: this is redundant (ip + step)
-  const BYTE *nextPosHashed;
-  U64 nextHash;
-
-  unsigned step;                      // ip step, should be 1.
-
-  const BYTE *lagIp;
-  U64 lagHash;
-};
-
-struct LDM_hashTable {
-  U32 numBuckets;          // The number of buckets.
-  U32 numEntries;          // numBuckets * HASH_BUCKET_SIZE.
-
-  LDM_hashEntry *entries;
-  BYTE *bucketOffsets;     // A pointer (per bucket) to the next insert position.
-};
-
-static void HASH_destroyTable(LDM_hashTable *table) {
-  free(table->entries);
-  free(table->bucketOffsets);
-  free(table);
-}
-
-/**
- * Create a hash table that can contain size elements.
- * The number of buckets is determined by size >> HASH_BUCKET_SIZE_LOG.
- *
- * Returns NULL if table creation failed.
- */
-static LDM_hashTable *HASH_createTable(U32 size) {
-  LDM_hashTable *table = malloc(sizeof(LDM_hashTable));
-  if (!table) return NULL;
-
-  table->numBuckets = size >> HASH_BUCKET_SIZE_LOG;
-  table->numEntries = size;
-  table->entries = calloc(size, sizeof(LDM_hashEntry));
-  table->bucketOffsets = calloc(size >> HASH_BUCKET_SIZE_LOG, sizeof(BYTE));
-
-  if (!table->entries || !table->bucketOffsets) {
-    HASH_destroyTable(table);
-    return NULL;
-  }
-
-  return table;
-}
-
-static LDM_hashEntry *getBucket(const LDM_hashTable *table, const hash_t hash) {
-  return table->entries + (hash << HASH_BUCKET_SIZE_LOG);
-}
-
-static unsigned ZSTD_NbCommonBytes (size_t val) {
-  if (MEM_isLittleEndian()) {
-    if (MEM_64bits()) {
-#    if defined(_MSC_VER) && defined(_WIN64)
-      unsigned long r = 0;
-      _BitScanForward64( &r, (U64)val );
-      return (unsigned)(r>>3);
-#     elif defined(__GNUC__) && (__GNUC__ >= 3)
-      return (__builtin_ctzll((U64)val) >> 3);
-#     else
-      static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2,
-                                               0, 3, 1, 3, 1, 4, 2, 7,
-                                               0, 2, 3, 6, 1, 5, 3, 5,
-                                               1, 3, 4, 4, 2, 5, 6, 7,
-                                               7, 0, 1, 2, 3, 3, 4, 6,
-                                               2, 6, 5, 5, 3, 4, 5, 6,
-                                               7, 1, 2, 4, 6, 4, 4, 5,
-                                               7, 2, 6, 5, 7, 6, 7, 7 };
-      return DeBruijnBytePos[
-          ((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
-#     endif
-  } else { /* 32 bits */
-#     if defined(_MSC_VER)
-      unsigned long r=0;
-      _BitScanForward( &r, (U32)val );
-      return (unsigned)(r>>3);
-#     elif defined(__GNUC__) && (__GNUC__ >= 3)
-      return (__builtin_ctz((U32)val) >> 3);
-#     else
-      static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0,
-                                               3, 2, 2, 1, 3, 2, 0, 1,
-                                               3, 3, 1, 2, 2, 2, 2, 0,
-                                               3, 1, 2, 0, 1, 0, 1, 1 };
-      return DeBruijnBytePos[
-          ((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
-#     endif
-    }
-  } else {  /* Big Endian CPU */
-    if (MEM_64bits()) {
-#     if defined(_MSC_VER) && defined(_WIN64)
-      unsigned long r = 0;
-      _BitScanReverse64( &r, val );
-      return (unsigned)(r>>3);
-#     elif defined(__GNUC__) && (__GNUC__ >= 3)
-      return (__builtin_clzll(val) >> 3);
-#     else
-      unsigned r;
-      /* calculate this way due to compiler complaining in 32-bits mode */
-      const unsigned n32 = sizeof(size_t)*4;
-      if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
-      if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
-      r += (!val);
-      return r;
-#       endif
-    } else { /* 32 bits */
-#     if defined(_MSC_VER)
-      unsigned long r = 0;
-      _BitScanReverse( &r, (unsigned long)val );
-      return (unsigned)(r>>3);
-#     elif defined(__GNUC__) && (__GNUC__ >= 3)
-      return (__builtin_clz((U32)val) >> 3);
-#     else
-      unsigned r;
-      if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
-      r += (!val);
-      return r;
-#     endif
-    }
-  }
-}
-
-// From lib/compress/zstd_compress.c
-static size_t ZSTD_count(const BYTE *pIn, const BYTE *pMatch,
-                         const BYTE *const pInLimit) {
-    const BYTE * const pStart = pIn;
-    const BYTE * const pInLoopLimit = pInLimit - (sizeof(size_t)-1);
-
-    while (pIn < pInLoopLimit) {
-        size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
-        if (!diff) {
-          pIn += sizeof(size_t);
-          pMatch += sizeof(size_t);
-          continue;
-        }
-        pIn += ZSTD_NbCommonBytes(diff);
-        return (size_t)(pIn - pStart);
-    }
-
-    if (MEM_64bits()) {
-      if ((pIn < (pInLimit - 3)) && (MEM_read32(pMatch) == MEM_read32(pIn))) {
-        pIn += 4;
-        pMatch += 4;
-      }
-    }
-    if ((pIn < (pInLimit - 1)) && (MEM_read16(pMatch) == MEM_read16(pIn))) {
-      pIn += 2;
-      pMatch += 2;
-    }
-    if ((pIn < pInLimit) && (*pMatch == *pIn)) {
-      pIn++;
-    }
-    return (size_t)(pIn - pStart);
-}
-
-/**
- * Count number of bytes that match backwards before pIn and pMatch.
- *
- * We count only bytes where pMatch > pBase and pIn > pAnchor.
- */
-static size_t countBackwardsMatch(const BYTE *pIn, const BYTE *pAnchor,
-                                  const BYTE *pMatch, const BYTE *pBase) {
-  size_t matchLength = 0;
-  while (pIn > pAnchor && pMatch > pBase && pIn[-1] == pMatch[-1]) {
-    pIn--;
-    pMatch--;
-    matchLength++;
-  }
-  return matchLength;
-}
-
-/**
- * Returns a pointer to the entry in the hash table matching the hash and
- * checksum with the "longest match length" as defined below. The forward and
- * backward match lengths are written to *pForwardMatchLength and
- * *pBackwardMatchLength.
- *
- * The match length is defined based on cctx->ip and the entry's offset.
- * The forward match is computed from cctx->ip and entry->offset + cctx->ibase.
- * The backward match is computed backwards from cctx->ip and
- * cctx->ibase only if the forward match is longer than LDM_MIN_MATCH_LENGTH.
- */
-static LDM_hashEntry *HASH_getBestEntry(const LDM_CCtx *cctx,
-                                        const hash_t hash,
-                                        const U32 checksum,
-                                        U64 *pForwardMatchLength,
-                                        U64 *pBackwardMatchLength) {
-  LDM_hashTable *table = cctx->hashTable;
-  LDM_hashEntry *bucket = getBucket(table, hash);
-  LDM_hashEntry *cur;
-  LDM_hashEntry *bestEntry = NULL;
-  U64 bestMatchLength = 0;
-#if !(USE_CHECKSUM)
-  (void)checksum;
-#endif
-  for (cur = bucket; cur < bucket + HASH_BUCKET_SIZE; ++cur) {
-    const BYTE *pMatch = cur->offset + cctx->ibase;
-
-    // Check checksum for faster check.
-#if USE_CHECKSUM
-    if (cur->checksum == checksum &&
-        cctx->ip - pMatch <= LDM_WINDOW_SIZE) {
-#else
-    if (cctx->ip - pMatch <= LDM_WINDOW_SIZE) {
-#endif
-      U64 forwardMatchLength = ZSTD_count(cctx->ip, pMatch, cctx->iend);
-      U64 backwardMatchLength, totalMatchLength;
-
-      // Only take matches where the forward match length is large enough
-      // for speed.
-      if (forwardMatchLength < LDM_MIN_MATCH_LENGTH) {
-        continue;
-      }
-
-      backwardMatchLength =
-          countBackwardsMatch(cctx->ip, cctx->anchor,
-                              cur->offset + cctx->ibase,
-                              cctx->ibase);
-
-      totalMatchLength = forwardMatchLength + backwardMatchLength;
-
-      if (totalMatchLength >= bestMatchLength) {
-        bestMatchLength = totalMatchLength;
-        *pForwardMatchLength = forwardMatchLength;
-        *pBackwardMatchLength = backwardMatchLength;
-
-        bestEntry = cur;
-#ifdef ZSTD_SKIP
-        return cur;
-#endif
-      }
-    }
-  }
-  if (bestEntry != NULL) {
-    return bestEntry;
-  }
-  return NULL;
-}
-
-/**
- * Insert an entry into the hash table. The table uses a "circular buffer",
- * with the oldest entry overwritten.
- */
-static void HASH_insert(LDM_hashTable *table,
-                        const hash_t hash, const LDM_hashEntry entry) {
-  *(getBucket(table, hash) + table->bucketOffsets[hash]) = entry;
-  table->bucketOffsets[hash]++;
-  table->bucketOffsets[hash] &= HASH_BUCKET_SIZE - 1;
-}
-
-static void HASH_outputTableOccupancy(const LDM_hashTable *table) {
-  U32 ctr = 0;
-  LDM_hashEntry *cur = table->entries;
-  LDM_hashEntry *end = table->entries + (table->numBuckets * HASH_BUCKET_SIZE);
-  for (; cur < end; ++cur) {
-    if (cur->offset == 0) {
-      ctr++;
-    }
-  }
-
-  // The number of buckets is repeated as a check for now.
-  printf("Num buckets, bucket size: %d (2^%d), %d\n",
-         table->numBuckets, NUM_HASH_BUCKETS_LOG, HASH_BUCKET_SIZE);
-  printf("Hash table size, empty slots, %% empty: %u, %u, %.3f\n",
-         table->numEntries, ctr,
-         100.0 * (double)(ctr) / table->numEntries);
-}
-
-// TODO: This can be done more efficiently, for example by using builtin
-// functions (but it is not that important as it is only used for computing
-// stats).
-static int intLog2(U64 x) {
-  int ret = 0;
-  while (x >>= 1) {
-    ret++;
-  }
-  return ret;
-}
-
-void LDM_printCompressStats(const LDM_compressStats *stats) {
-  printf("=====================\n");
-  printf("Compression statistics\n");
-  printf("Window size, hash table size (bytes): 2^%u, 2^%u\n",
-          stats->windowSizeLog, stats->hashTableSizeLog);
-  printf("num matches, total match length, %% matched: %u, %llu, %.3f\n",
-          stats->numMatches,
-          stats->totalMatchLength,
-          100.0 * (double)stats->totalMatchLength /
-              (double)(stats->totalMatchLength + stats->totalLiteralLength));
-  printf("avg match length: %.1f\n", ((double)stats->totalMatchLength) /
-                                         (double)stats->numMatches);
-  printf("avg literal length, total literalLength: %.1f, %llu\n",
-         ((double)stats->totalLiteralLength) / (double)stats->numMatches,
-         stats->totalLiteralLength);
-  printf("avg offset length: %.1f\n",
-         ((double)stats->totalOffset) / (double)stats->numMatches);
-  printf("min offset, max offset: %u, %u\n",
-         stats->minOffset, stats->maxOffset);
-
-  printf("\n");
-  printf("offset histogram | match length histogram\n");
-  printf("offset/ML, num matches, %% of matches | num matches, %% of matches\n");
-
-  {
-    int i;
-    int logMaxOffset = intLog2(stats->maxOffset);
-    for (i = 0; i <= logMaxOffset; i++) {
-      printf("2^%*d: %10u    %6.3f%% |2^%*d:  %10u    %6.3f \n",
-             2, i,
-             stats->offsetHistogram[i],
-             100.0 * (double) stats->offsetHistogram[i] /
-                     (double) stats->numMatches,
-             2, i,
-             stats->matchLengthHistogram[i],
-             100.0 * (double) stats->matchLengthHistogram[i] /
-                     (double) stats->numMatches);
-    }
-  }
-  printf("\n");
-  printf("=====================\n");
-}
-
-/**
- * Return the upper (most significant) NUM_HASH_BUCKETS_LOG bits.
- */
-static hash_t getSmallHash(U64 hash) {
-  return hash >> (64 - NUM_HASH_BUCKETS_LOG);
-}
-
-/**
- * Return the 32 bits after the upper NUM_HASH_BUCKETS_LOG bits.
- */
-static U32 getChecksum(U64 hash) {
-  return (hash >> (64 - 32 - NUM_HASH_BUCKETS_LOG)) & 0xFFFFFFFF;
-}
-
-#if INSERT_BY_TAG
-static U32 lowerBitsFromHfHash(U64 hash) {
-  // The number of bits used so far is NUM_HASH_BUCKETS_LOG + 32.
-  // So there are 32 - NUM_HASH_BUCKETS_LOG bits left.
-  // Occasional hashing requires HASH_ONLY_EVERY_LOG bits.
-  // So if 32 - LDMHASHLOG < HASH_ONLY_EVERY_LOG, just return lower bits
-  // allowing for reuse of bits.
-  if (32 - NUM_HASH_BUCKETS_LOG < HASH_ONLY_EVERY_LOG) {
-    return hash & HASH_ONLY_EVERY;
-  } else {
-    // Otherwise shift by
-    // (32 - NUM_HASH_BUCKETS_LOG - HASH_ONLY_EVERY_LOG) bits first.
-    return (hash >> (32 - NUM_HASH_BUCKETS_LOG - HASH_ONLY_EVERY_LOG)) &
-           HASH_ONLY_EVERY;
-  }
-}
-#endif
-
-/**
- * Get a 64-bit hash using the first len bytes from buf.
- *
- * Giving bytes s = s_1, s_2, ... s_k, the hash is defined to be
- * H(s) = s_1*(a^(k-1)) + s_2*(a^(k-2)) + ... + s_k*(a^0)
- *
- * where the constant a is defined to be prime8bytes.
- *
- * The implementation adds an offset to each byte, so
- * H(s) = (s_1 + HASH_CHAR_OFFSET)*(a^(k-1)) + ...
- */
-static U64 getHash(const BYTE *buf, U32 len) {
-  U64 ret = 0;
-  U32 i;
-  for (i = 0; i < len; i++) {
-    ret *= prime8bytes;
-    ret += buf[i] + HASH_CHAR_OFFSET;
-  }
-  return ret;
-
-}
-
-static U64 ipow(U64 base, U64 exp) {
-  U64 ret = 1;
-  while (exp) {
-    if (exp & 1) {
-      ret *= base;
-    }
-    exp >>= 1;
-    base *= base;
-  }
-  return ret;
-}
-
-static U64 updateHash(U64 hash, U32 len,
-                      BYTE toRemove, BYTE toAdd) {
-  // TODO: this relies on compiler optimization.
-  // The exponential can be calculated explicitly as len is constant.
-  hash -= ((toRemove + HASH_CHAR_OFFSET) *
-          ipow(prime8bytes, len - 1));
-  hash *= prime8bytes;
-  hash += toAdd + HASH_CHAR_OFFSET;
-  return hash;
-}
-
-/**
- * Update cctx->nextHash and cctx->nextPosHashed
- * based on cctx->lastHash and cctx->lastPosHashed.
- *
- * This uses a rolling hash and requires that the last position hashed
- * corresponds to cctx->nextIp - step.
- */
-static void setNextHash(LDM_CCtx *cctx) {
-  cctx->nextHash = updateHash(
-      cctx->lastHash, LDM_HASH_LENGTH,
-      cctx->lastPosHashed[0],
-      cctx->lastPosHashed[LDM_HASH_LENGTH]);
-  cctx->nextPosHashed = cctx->nextIp;
-
-#if LDM_LAG
-  if (cctx->ip - cctx->ibase > LDM_LAG) {
-    cctx->lagHash = updateHash(
-      cctx->lagHash, LDM_HASH_LENGTH,
-      cctx->lagIp[0], cctx->lagIp[LDM_HASH_LENGTH]);
-    cctx->lagIp++;
-  }
-#endif
-}
-
-static void putHashOfCurrentPositionFromHash(LDM_CCtx *cctx, U64 hash) {
-  // Hash only every HASH_ONLY_EVERY times, based on cctx->ip.
-  // Note: this works only when cctx->step is 1.
-#if LDM_LAG
-  if (cctx -> lagIp - cctx->ibase > 0) {
-#if INSERT_BY_TAG
-    U32 hashEveryMask = lowerBitsFromHfHash(cctx->lagHash);
-    if (hashEveryMask == HASH_ONLY_EVERY) {
-#else
-    if (((cctx->ip - cctx->ibase) & HASH_ONLY_EVERY) == HASH_ONLY_EVERY) {
-#endif
-      U32 smallHash = getSmallHash(cctx->lagHash);
-
-#   if USE_CHECKSUM
-      U32 checksum = getChecksum(cctx->lagHash);
-      const LDM_hashEntry entry = { cctx->lagIp - cctx->ibase, checksum };
-#   else
-      const LDM_hashEntry entry = { cctx->lagIp - cctx->ibase };
-#   endif
-
-      HASH_insert(cctx->hashTable, smallHash, entry);
-    }
-  } else {
-#endif // LDM_LAG
-#if INSERT_BY_TAG
-    U32 hashEveryMask = lowerBitsFromHfHash(hash);
-    if (hashEveryMask == HASH_ONLY_EVERY) {
-#else
-    if (((cctx->ip - cctx->ibase) & HASH_ONLY_EVERY) == HASH_ONLY_EVERY) {
-#endif
-      U32 smallHash = getSmallHash(hash);
-
-#if USE_CHECKSUM
-      U32 checksum = getChecksum(hash);
-      const LDM_hashEntry entry = { cctx->ip - cctx->ibase, checksum };
-#else
-      const LDM_hashEntry entry = { cctx->ip - cctx->ibase };
-#endif
-      HASH_insert(cctx->hashTable, smallHash, entry);
-    }
-#if LDM_LAG
-  }
-#endif
-
-  cctx->lastPosHashed = cctx->ip;
-  cctx->lastHash = hash;
-}
-
-/**
- * Copy over the cctx->lastHash, and cctx->lastPosHashed
- * fields from the "next" fields.
- *
- * This requires that cctx->ip == cctx->nextPosHashed.
- */
-static void LDM_updateLastHashFromNextHash(LDM_CCtx *cctx) {
-  putHashOfCurrentPositionFromHash(cctx, cctx->nextHash);
-}
-
-/**
- * Insert hash of the current position into the hash table.
- */
-static void LDM_putHashOfCurrentPosition(LDM_CCtx *cctx) {
-  U64 hash = getHash(cctx->ip, LDM_HASH_LENGTH);
-
-  putHashOfCurrentPositionFromHash(cctx, hash);
-}
-
-size_t LDM_initializeCCtx(LDM_CCtx *cctx,
-                          const void *src, size_t srcSize,
-                          void *dst, size_t maxDstSize) {
-  cctx->isize = srcSize;
-  cctx->maxOSize = maxDstSize;
-
-  cctx->ibase = (const BYTE *)src;
-  cctx->ip = cctx->ibase;
-  cctx->iend = cctx->ibase + srcSize;
-
-  cctx->ihashLimit = cctx->iend - LDM_HASH_LENGTH;
-  cctx->imatchLimit = cctx->iend - LDM_MIN_MATCH_LENGTH;
-
-  cctx->obase = (BYTE *)dst;
-  cctx->op = (BYTE *)dst;
-
-  cctx->anchor = cctx->ibase;
-
-  memset(&(cctx->stats), 0, sizeof(cctx->stats));
-#if USE_CHECKSUM
-  cctx->hashTable = HASH_createTable(LDM_HASHTABLESIZE_U64);
-#else
-  cctx->hashTable = HASH_createTable(LDM_HASHTABLESIZE_U32);
-#endif
-
-  if (!cctx->hashTable) return 1;
-
-  cctx->stats.minOffset = UINT_MAX;
-  cctx->stats.windowSizeLog = LDM_WINDOW_SIZE_LOG;
-  cctx->stats.hashTableSizeLog = LDM_MEMORY_USAGE;
-
-  cctx->lastPosHashed = NULL;
-
-  cctx->step = 1;   // Fixed to be 1 for now. Changing may break things.
-  cctx->nextIp = cctx->ip + cctx->step;
-  cctx->nextPosHashed = 0;
-
-  return 0;
-}
-
-void LDM_destroyCCtx(LDM_CCtx *cctx) {
-  HASH_destroyTable(cctx->hashTable);
-}
-
-/**
- * Finds the "best" match.
- *
- * Returns 0 if successful and 1 otherwise (i.e. no match can be found
- * in the remaining input that is long enough).
- *
- * forwardMatchLength contains the forward length of the match.
- */
-static int LDM_findBestMatch(LDM_CCtx *cctx, const BYTE **match,
-                             U64 *forwardMatchLength, U64 *backwardMatchLength) {
-
-  LDM_hashEntry *entry = NULL;
-  cctx->nextIp = cctx->ip + cctx->step;
-
-  while (entry == NULL) {
-    U64 hash;
-    hash_t smallHash;
-    U32 checksum;
-#if INSERT_BY_TAG
-    U32 hashEveryMask;
-#endif
-    setNextHash(cctx);
-
-    hash = cctx->nextHash;
-    smallHash = getSmallHash(hash);
-    checksum = getChecksum(hash);
-#if INSERT_BY_TAG
-    hashEveryMask = lowerBitsFromHfHash(hash);
-#endif
-
-    cctx->ip = cctx->nextIp;
-    cctx->nextIp += cctx->step;
-
-    if (cctx->ip > cctx->imatchLimit) {
-      return 1;
-    }
-#if INSERT_BY_TAG
-    if (hashEveryMask == HASH_ONLY_EVERY) {
-
-      entry = HASH_getBestEntry(cctx, smallHash, checksum,
-                                forwardMatchLength, backwardMatchLength);
-    }
-#else
-    entry = HASH_getBestEntry(cctx, smallHash, checksum,
-                              forwardMatchLength, backwardMatchLength);
-#endif
-
-    if (entry != NULL) {
-      *match = entry->offset + cctx->ibase;
-    }
-
-    putHashOfCurrentPositionFromHash(cctx, hash);
-
-  }
-  setNextHash(cctx);
-  return 0;
-}
-
-void LDM_encodeLiteralLengthAndLiterals(
-    LDM_CCtx *cctx, BYTE *pToken, const U64 literalLength) {
-  /* Encode the literal length. */
-  if (literalLength >= RUN_MASK) {
-    U64 len = (U64)literalLength - RUN_MASK;
-    *pToken = (RUN_MASK << ML_BITS);
-    for (; len >= 255; len -= 255) {
-      *(cctx->op)++ = 255;
-    }
-    *(cctx->op)++ = (BYTE)len;
-  } else {
-    *pToken = (BYTE)(literalLength << ML_BITS);
-  }
-
-  /* Encode the literals. */
-  memcpy(cctx->op, cctx->anchor, literalLength);
-  cctx->op += literalLength;
-}
-
-void LDM_outputBlock(LDM_CCtx *cctx,
-                     const U64 literalLength,
-                     const U32 offset,
-                     const U64 matchLength) {
-  BYTE *pToken = cctx->op++;
-
-  /* Encode the literal length and literals. */
-  LDM_encodeLiteralLengthAndLiterals(cctx, pToken, literalLength);
-
-  /* Encode the offset. */
-  MEM_write32(cctx->op, offset);
-  cctx->op += LDM_OFFSET_SIZE;
-
-  /* Encode the match length. */
-  if (matchLength >= ML_MASK) {
-    U64 matchLengthRemaining = matchLength;
-    *pToken += ML_MASK;
-    matchLengthRemaining -= ML_MASK;
-    MEM_write32(cctx->op, 0xFFFFFFFF);
-    while (matchLengthRemaining >= 4*0xFF) {
-      cctx->op += 4;
-      MEM_write32(cctx->op, 0xffffffff);
-      matchLengthRemaining -= 4*0xFF;
-    }
-    cctx->op += matchLengthRemaining / 255;
-    *(cctx->op)++ = (BYTE)(matchLengthRemaining % 255);
-  } else {
-    *pToken += (BYTE)(matchLength);
-  }
-}
-
-// TODO: maxDstSize is unused. This function may seg fault when writing
-// beyond the size of dst, as it does not check maxDstSize. Writing to
-// a buffer and performing checks is a possible solution.
-//
-// This is based upon lz4.
-size_t LDM_compress(const void *src, size_t srcSize,
-                    void *dst, size_t maxDstSize) {
-  LDM_CCtx cctx;
-  const BYTE *match = NULL;
-  U64 forwardMatchLength = 0;
-  U64 backwardsMatchLength = 0;
-
-  if (LDM_initializeCCtx(&cctx, src, srcSize, dst, maxDstSize)) {
-    // Initialization failed.
-    return 0;
-  }
-
-#ifdef OUTPUT_CONFIGURATION
-  LDM_outputConfiguration();
-#endif
-
-  /* Hash the first position and put it into the hash table. */
-  LDM_putHashOfCurrentPosition(&cctx);
-
-  cctx.lagIp = cctx.ip;
-  cctx.lagHash = cctx.lastHash;
-
-  /**
-   * Find a match.
-   * If no more matches can be found (i.e. the length of the remaining input
-   * is less than the minimum match length), then stop searching for matches
-   * and encode the final literals.
-   */
-  while (!LDM_findBestMatch(&cctx, &match, &forwardMatchLength,
-                           &backwardsMatchLength)) {
-
-#ifdef COMPUTE_STATS
-    cctx.stats.numMatches++;
-#endif
-
-     cctx.ip -= backwardsMatchLength;
-     match -= backwardsMatchLength;
-
-    /**
-     * Write current block (literals, literal length, match offset, match
-     * length) and update pointers and hashes.
-     */
-    {
-      const U64 literalLength = cctx.ip - cctx.anchor;
-      const U32 offset = cctx.ip - match;
-      const U64 matchLength = forwardMatchLength +
-                              backwardsMatchLength -
-                              LDM_MIN_MATCH_LENGTH;
-
-      LDM_outputBlock(&cctx, literalLength, offset, matchLength);
-
-#ifdef COMPUTE_STATS
-      cctx.stats.totalLiteralLength += literalLength;
-      cctx.stats.totalOffset += offset;
-      cctx.stats.totalMatchLength += matchLength + LDM_MIN_MATCH_LENGTH;
-      cctx.stats.minOffset =
-          offset < cctx.stats.minOffset ? offset : cctx.stats.minOffset;
-      cctx.stats.maxOffset =
-          offset > cctx.stats.maxOffset ? offset : cctx.stats.maxOffset;
-      cctx.stats.offsetHistogram[(U32)intLog2(offset)]++;
-      cctx.stats.matchLengthHistogram[
-          (U32)intLog2(matchLength + LDM_MIN_MATCH_LENGTH)]++;
-#endif
-
-      // Move ip to end of block, inserting hashes at each position.
-      cctx.nextIp = cctx.ip + cctx.step;
-      while (cctx.ip < cctx.anchor + LDM_MIN_MATCH_LENGTH +
-                       matchLength + literalLength) {
-        if (cctx.ip > cctx.lastPosHashed) {
-          // TODO: Simplify.
-          LDM_updateLastHashFromNextHash(&cctx);
-          setNextHash(&cctx);
-        }
-        cctx.ip++;
-        cctx.nextIp++;
-      }
-    }
-
-    // Set start of next block to current input pointer.
-    cctx.anchor = cctx.ip;
-    LDM_updateLastHashFromNextHash(&cctx);
-  }
-
-  /* Encode the last literals (no more matches). */
-  {
-    const U64 lastRun = cctx.iend - cctx.anchor;
-    BYTE *pToken = cctx.op++;
-    LDM_encodeLiteralLengthAndLiterals(&cctx, pToken, lastRun);
-  }
-
-#ifdef COMPUTE_STATS
-  LDM_printCompressStats(&cctx.stats);
-  HASH_outputTableOccupancy(cctx.hashTable);
-#endif
-
-  {
-    const size_t ret = cctx.op - cctx.obase;
-    LDM_destroyCCtx(&cctx);
-    return ret;
-  }
-}
-
-void LDM_outputConfiguration(void) {
-  printf("=====================\n");
-  printf("Configuration\n");
-  printf("LDM_WINDOW_SIZE_LOG: %d\n", LDM_WINDOW_SIZE_LOG);
-  printf("LDM_MIN_MATCH_LENGTH, LDM_HASH_LENGTH: %d, %d\n",
-         LDM_MIN_MATCH_LENGTH, LDM_HASH_LENGTH);
-  printf("LDM_MEMORY_USAGE: %d\n", LDM_MEMORY_USAGE);
-  printf("HASH_ONLY_EVERY_LOG: %d\n", HASH_ONLY_EVERY_LOG);
-  printf("HASH_BUCKET_SIZE_LOG: %d\n", HASH_BUCKET_SIZE_LOG);
-  printf("LDM_LAG: %d\n", LDM_LAG);
-  printf("USE_CHECKSUM: %d\n", USE_CHECKSUM);
-  printf("INSERT_BY_TAG: %d\n", INSERT_BY_TAG);
-  printf("HASH_CHAR_OFFSET: %d\n", HASH_CHAR_OFFSET);
-  printf("=====================\n");
-}
diff --git a/priv/zstd/contrib/long_distance_matching/ldm.h b/priv/zstd/contrib/long_distance_matching/ldm.h
deleted file mode 100644
index 4adadbd..0000000
--- a/priv/zstd/contrib/long_distance_matching/ldm.h
+++ /dev/null
@@ -1,197 +0,0 @@
-#ifndef LDM_H
-#define LDM_H
-
-#include "mem.h"    // from /lib/common/mem.h
-
-//#include "ldm_params.h"
-
-// =============================================================================
-// Modify the parameters in ldm_params.h if "ldm_params.h" is included.
-// Otherwise, modify the parameters here.
-// =============================================================================
-
-#ifndef LDM_PARAMS_H
-  // Defines the size of the hash table.
-  // Note that this is not the number of buckets.
-  // Currently this should be less than WINDOW_SIZE_LOG + 4.
-  #define LDM_MEMORY_USAGE 23
-
-  // The number of entries in a hash bucket.
-  #define HASH_BUCKET_SIZE_LOG 3 // The maximum is 4 for now.
-
-  // Defines the lag in inserting elements into the hash table.
-  #define LDM_LAG 0
-
-  // The maximum window size when searching for matches.
-  // The maximum value is 30
-  #define LDM_WINDOW_SIZE_LOG 28
-
-  // The minimum match length.
-  // This should be a multiple of four.
-  #define LDM_MIN_MATCH_LENGTH 64
-
-  // If INSERT_BY_TAG, insert entries into the hash table as a function of the
-  // hash. Certain hashes will not be inserted.
-  //
-  // Otherwise, insert as a function of the position.
-  #define INSERT_BY_TAG 1
-
-  // Store a checksum with the hash table entries for faster comparison.
-  // This halves the number of entries the hash table can contain.
-  #define USE_CHECKSUM 1
-#endif
-
-// Output compression statistics.
-#define COMPUTE_STATS
-
-// Output the configuration.
-#define OUTPUT_CONFIGURATION
-
-// If defined, forces the probability of insertion to be approximately
-// one per (1 << HASH_ONLY_EVERY_LOG). If not defined, the probability will be
-// calculated based on the memory usage and window size for "even" insertion
-// throughout the window.
-
-// #define HASH_ONLY_EVERY_LOG 8
-
-// =============================================================================
-
-// The number of bytes storing the compressed and decompressed size
-// in the header.
-#define LDM_COMPRESSED_SIZE 8
-#define LDM_DECOMPRESSED_SIZE 8
-#define LDM_HEADER_SIZE ((LDM_COMPRESSED_SIZE)+(LDM_DECOMPRESSED_SIZE))
-
-#define ML_BITS 4
-#define ML_MASK ((1U<
-
-#include "ldm.h"
-
-/**
- * This function reads the header at the beginning of src and writes
- * the compressed and decompressed size to compressedSize and
- * decompressedSize.
- *
- * The header consists of 16 bytes: 8 bytes each in little-endian format
- * of the compressed size and the decompressed size.
- */
-void LDM_readHeader(const void *src, U64 *compressedSize,
-                    U64 *decompressedSize) {
-  const BYTE *ip = (const BYTE *)src;
-  *compressedSize = MEM_readLE64(ip);
-  *decompressedSize = MEM_readLE64(ip + 8);
-}
-
-/**
- * Writes the 16-byte header (8-bytes each of the compressedSize and
- * decompressedSize in little-endian format) to memPtr.
- */
-void LDM_writeHeader(void *memPtr, U64 compressedSize,
-                     U64 decompressedSize) {
-  MEM_writeLE64(memPtr, compressedSize);
-  MEM_writeLE64((BYTE *)memPtr + 8, decompressedSize);
-}
-
-struct LDM_DCtx {
-  size_t compressedSize;
-  size_t maxDecompressedSize;
-
-  const BYTE *ibase;   /* Base of input */
-  const BYTE *ip;      /* Current input position */
-  const BYTE *iend;    /* End of source */
-
-  const BYTE *obase;   /* Base of output */
-  BYTE *op;            /* Current output position */
-  const BYTE *oend;    /* End of output */
-};
-
-void LDM_initializeDCtx(LDM_DCtx *dctx,
-                        const void *src, size_t compressedSize,
-                        void *dst, size_t maxDecompressedSize) {
-  dctx->compressedSize = compressedSize;
-  dctx->maxDecompressedSize = maxDecompressedSize;
-
-  dctx->ibase = src;
-  dctx->ip = (const BYTE *)src;
-  dctx->iend = dctx->ip + dctx->compressedSize;
-  dctx->op = dst;
-  dctx->oend = dctx->op + dctx->maxDecompressedSize;
-}
-
-size_t LDM_decompress(const void *src, size_t compressedSize,
-                      void *dst, size_t maxDecompressedSize) {
-
-  LDM_DCtx dctx;
-  LDM_initializeDCtx(&dctx, src, compressedSize, dst, maxDecompressedSize);
-
-  while (dctx.ip < dctx.iend) {
-    BYTE *cpy;
-    const BYTE *match;
-    size_t length, offset;
-
-    /* Get the literal length. */
-    const unsigned token = *(dctx.ip)++;
-    if ((length = (token >> ML_BITS)) == RUN_MASK) {
-      unsigned s;
-      do {
-        s = *(dctx.ip)++;
-        length += s;
-      } while (s == 255);
-    }
-
-    /* Copy the literals. */
-    cpy = dctx.op + length;
-    memcpy(dctx.op, dctx.ip, length);
-    dctx.ip += length;
-    dctx.op = cpy;
-
-    //TODO: dynamic offset size?
-    /* Encode the offset. */
-    offset = MEM_read32(dctx.ip);
-    dctx.ip += LDM_OFFSET_SIZE;
-    match = dctx.op - offset;
-
-    /* Get the match length. */
-    length = token & ML_MASK;
-    if (length == ML_MASK) {
-      unsigned s;
-      do {
-        s = *(dctx.ip)++;
-        length += s;
-      } while (s == 255);
-    }
-    length += LDM_MIN_MATCH_LENGTH;
-
-    /* Copy match. */
-    cpy = dctx.op + length;
-
-    // TODO: this can be made more efficient.
-    while (match < cpy - offset && dctx.op < dctx.oend) {
-      *(dctx.op)++ = *match++;
-    }
-  }
-  return dctx.op - (BYTE *)dst;
-}
diff --git a/priv/zstd/contrib/long_distance_matching/ldm_params.h b/priv/zstd/contrib/long_distance_matching/ldm_params.h
deleted file mode 100644
index a541581..0000000
--- a/priv/zstd/contrib/long_distance_matching/ldm_params.h
+++ /dev/null
@@ -1,12 +0,0 @@
-#ifndef LDM_PARAMS_H
-#define LDM_PARAMS_H
-
-#define LDM_MEMORY_USAGE 23
-#define HASH_BUCKET_SIZE_LOG 3
-#define LDM_LAG 0
-#define LDM_WINDOW_SIZE_LOG 28
-#define LDM_MIN_MATCH_LENGTH 64
-#define INSERT_BY_TAG 1
-#define USE_CHECKSUM 1
-
-#endif  // LDM_PARAMS_H
diff --git a/priv/zstd/contrib/long_distance_matching/main.c b/priv/zstd/contrib/long_distance_matching/main.c
deleted file mode 100644
index 7c7086a..0000000
--- a/priv/zstd/contrib/long_distance_matching/main.c
+++ /dev/null
@@ -1,269 +0,0 @@
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#include 
-#include "ldm.h"
-#include "zstd.h"
-
-// #define DECOMPRESS_AND_VERIFY
-
-/* Compress file given by fname and output to oname.
- * Returns 0 if successful, error code otherwise.
- *
- * This adds a header from LDM_writeHeader to the beginning of the output.
- *
- * This might seg fault if the compressed size is > the decompress
- * size due to the mmapping and output file size allocated to be the input size
- * The compress function should check before writing or buffer writes.
- */
-static int compress(const char *fname, const char *oname) {
-  int fdin, fdout;
-  struct stat statbuf;
-  char *src, *dst;
-  size_t maxCompressedSize, compressedSize;
-
-  struct timeval tv1, tv2;
-  double timeTaken;
-
-
-  /* Open the input file. */
-  if ((fdin = open(fname, O_RDONLY)) < 0) {
-    perror("Error in file opening");
-    return 1;
-  }
-
-  /* Open the output file. */
-  if ((fdout = open(oname, O_RDWR | O_CREAT | O_TRUNC, (mode_t)0600)) < 0) {
-    perror("Can't create output file");
-    return 1;
-  }
-
-  /* Find the size of the input file. */
-  if (fstat (fdin, &statbuf) < 0) {
-    perror("Fstat error");
-    return 1;
-  }
-
-  maxCompressedSize = (statbuf.st_size + LDM_HEADER_SIZE);
-
-  // Handle case where compressed size is > decompressed size.
-  // TODO: The compress function should check before writing or buffer writes.
-  maxCompressedSize += statbuf.st_size / 255;
-
-  ftruncate(fdout, maxCompressedSize);
-
-  /* mmap the input file. */
-  if ((src = mmap(0, statbuf.st_size, PROT_READ,  MAP_SHARED, fdin, 0))
-          == (caddr_t) - 1) {
-      perror("mmap error for input");
-      return 1;
-  }
-
-  /* mmap the output file. */
-  if ((dst = mmap(0, maxCompressedSize, PROT_READ | PROT_WRITE,
-                  MAP_SHARED, fdout, 0)) == (caddr_t) - 1) {
-      perror("mmap error for output");
-      return 1;
-  }
-
-  gettimeofday(&tv1, NULL);
-
-  compressedSize = LDM_HEADER_SIZE +
-      LDM_compress(src, statbuf.st_size,
-                   dst + LDM_HEADER_SIZE, maxCompressedSize);
-
-  gettimeofday(&tv2, NULL);
-
-  // Write the header.
-  LDM_writeHeader(dst, compressedSize, statbuf.st_size);
-
-  // Truncate file to compressedSize.
-  ftruncate(fdout, compressedSize);
-
-  printf("%25s : %10lu -> %10lu - %s \n", fname,
-         (size_t)statbuf.st_size, (size_t)compressedSize, oname);
-  printf("Compression ratio: %.2fx --- %.1f%%\n",
-         (double)statbuf.st_size / (double)compressedSize,
-         (double)compressedSize / (double)(statbuf.st_size) * 100.0);
-
-  timeTaken = (double) (tv2.tv_usec - tv1.tv_usec) / 1000000 +
-              (double) (tv2.tv_sec - tv1.tv_sec),
-
-  printf("Total compress time = %.3f seconds, Average scanning speed: %.3f MB/s\n",
-         timeTaken,
-         ((double)statbuf.st_size / (double) (1 << 20)) / timeTaken);
-
-  // Close files.
-  close(fdin);
-  close(fdout);
-  return 0;
-}
-
-#ifdef DECOMPRESS_AND_VERIFY
-/* Decompress file compressed using LDM_compress.
- * The input file should have the LDM_HEADER followed by payload.
- * Returns 0 if succesful, and an error code otherwise.
- */
-static int decompress(const char *fname, const char *oname) {
-  int fdin, fdout;
-  struct stat statbuf;
-  char *src, *dst;
-  U64 compressedSize, decompressedSize;
-  size_t outSize;
-
-  /* Open the input file. */
-  if ((fdin = open(fname, O_RDONLY)) < 0) {
-    perror("Error in file opening");
-    return 1;
-  }
-
-  /* Open the output file. */
-  if ((fdout = open(oname, O_RDWR | O_CREAT | O_TRUNC, (mode_t)0600)) < 0) {
-    perror("Can't create output file");
-    return 1;
-  }
-
-  /* Find the size of the input file. */
-  if (fstat (fdin, &statbuf) < 0) {
-    perror("Fstat error");
-    return 1;
-  }
-
-  /* mmap the input file. */
-  if ((src = mmap(0, statbuf.st_size, PROT_READ,  MAP_SHARED, fdin, 0))
-          == (caddr_t) - 1) {
-      perror("mmap error for input");
-      return 1;
-  }
-
-  /* Read the header. */
-  LDM_readHeader(src, &compressedSize, &decompressedSize);
-
-  ftruncate(fdout, decompressedSize);
-
-  /* mmap the output file */
-  if ((dst = mmap(0, decompressedSize, PROT_READ | PROT_WRITE,
-                  MAP_SHARED, fdout, 0)) == (caddr_t) - 1) {
-      perror("mmap error for output");
-      return 1;
-  }
-
-  outSize = LDM_decompress(
-      src + LDM_HEADER_SIZE, statbuf.st_size - LDM_HEADER_SIZE,
-      dst, decompressedSize);
-  printf("Ret size out: %zu\n", outSize);
-
-  close(fdin);
-  close(fdout);
-  return 0;
-}
-
-/* Compare two files.
- * Returns 0 iff they are the same.
- */
-static int compare(FILE *fp0, FILE *fp1) {
-  int result = 0;
-  while (result == 0) {
-    char b0[1024];
-    char b1[1024];
-    const size_t r0 = fread(b0, 1, sizeof(b0), fp0);
-    const size_t r1 = fread(b1, 1, sizeof(b1), fp1);
-
-    result = (int)r0 - (int)r1;
-
-    if (0 == r0 || 0 == r1) break;
-
-    if (0 == result) result = memcmp(b0, b1, r0);
-  }
-  return result;
-}
-
-/* Verify the input file is the same as the decompressed file. */
-static int verify(const char *inpFilename, const char *decFilename) {
-  FILE *inpFp, *decFp;
-
-  if ((inpFp = fopen(inpFilename, "rb")) == NULL) {
-    perror("Could not open input file\n");
-    return 1;
-  }
-
-  if ((decFp = fopen(decFilename, "rb")) == NULL) {
-    perror("Could not open decompressed file\n");
-    return 1;
-  }
-
-  printf("verify : %s <-> %s\n", inpFilename, decFilename);
-  {
-    const int cmp = compare(inpFp, decFp);
-    if(0 == cmp) {
-      printf("verify : OK\n");
-    } else {
-      printf("verify : NG\n");
-      return 1;
-    }
-  }
-
-	fclose(decFp);
-	fclose(inpFp);
-  return 0;
-}
-#endif
-
-int main(int argc, const char *argv[]) {
-  const char * const exeName = argv[0];
-  char inpFilename[256] = { 0 };
-  char ldmFilename[256] = { 0 };
-  char decFilename[256] = { 0 };
-
-  if (argc < 2) {
-    printf("Wrong arguments\n");
-    printf("Usage:\n");
-    printf("%s FILE\n", exeName);
-    return 1;
-  }
-
-  snprintf(inpFilename, 256, "%s", argv[1]);
-  snprintf(ldmFilename, 256, "%s.ldm", argv[1]);
-  snprintf(decFilename, 256, "%s.ldm.dec", argv[1]);
-
- 	printf("inp = [%s]\n", inpFilename);
-	printf("ldm = [%s]\n", ldmFilename);
-	printf("dec = [%s]\n", decFilename);
-
-  /* Compress */
-  {
-    if (compress(inpFilename, ldmFilename)) {
-        printf("Compress error\n");
-        return 1;
-    }
-  }
-
-#ifdef DECOMPRESS_AND_VERIFY
-  /* Decompress */
-  {
-    struct timeval tv1, tv2;
-    gettimeofday(&tv1, NULL);
-    if (decompress(ldmFilename, decFilename)) {
-        printf("Decompress error\n");
-        return 1;
-    }
-    gettimeofday(&tv2, NULL);
-    printf("Total decompress time = %f seconds\n",
-          (double) (tv2.tv_usec - tv1.tv_usec) / 1000000 +
-          (double) (tv2.tv_sec - tv1.tv_sec));
-  }
-  /* verify */
-  if (verify(inpFilename, decFilename)) {
-    printf("Verification error\n");
-    return 1;
-  }
-#endif
-  return 0;
-}
diff --git a/priv/zstd/contrib/meson/README b/priv/zstd/contrib/meson/README
deleted file mode 100644
index 0b5331e..0000000
--- a/priv/zstd/contrib/meson/README
+++ /dev/null
@@ -1,3 +0,0 @@
-This Meson project is provided with no guarantee and maintained by Dima Krasner .
-
-It outputs one libzstd, either shared or static, depending on default_library.
diff --git a/priv/zstd/contrib/meson/meson.build b/priv/zstd/contrib/meson/meson.build
deleted file mode 100644
index 5ff370f..0000000
--- a/priv/zstd/contrib/meson/meson.build
+++ /dev/null
@@ -1,116 +0,0 @@
-project('zstd', 'c', license: 'BSD')
-
-libm = meson.get_compiler('c').find_library('m', required: true)
-
-lib_dir = join_paths('..', '..', 'lib')
-common_dir = join_paths(lib_dir, 'common')
-compress_dir = join_paths(lib_dir, 'compress')
-decompress_dir = join_paths(lib_dir, 'decompress')
-dictbuilder_dir = join_paths(lib_dir, 'dictBuilder')
-deprecated_dir = join_paths(lib_dir, 'deprecated')
-
-libzstd_srcs = [
-    join_paths(common_dir, 'entropy_common.c'),
-    join_paths(common_dir, 'fse_decompress.c'),
-    join_paths(common_dir, 'threading.c'),
-    join_paths(common_dir, 'pool.c'),
-    join_paths(common_dir, 'zstd_common.c'),
-    join_paths(common_dir, 'error_private.c'),
-    join_paths(common_dir, 'xxhash.c'),
-    join_paths(compress_dir, 'fse_compress.c'),
-    join_paths(compress_dir, 'huf_compress.c'),
-    join_paths(compress_dir, 'zstd_compress.c'),
-    join_paths(compress_dir, 'zstd_fast.c'),
-    join_paths(compress_dir, 'zstd_double_fast.c'),
-    join_paths(compress_dir, 'zstd_lazy.c'),
-    join_paths(compress_dir, 'zstd_opt.c'),
-    join_paths(compress_dir, 'zstd_ldm.c'),
-    join_paths(compress_dir, 'zstdmt_compress.c'),
-    join_paths(decompress_dir, 'huf_decompress.c'),
-    join_paths(decompress_dir, 'zstd_decompress.c'),
-    join_paths(dictbuilder_dir, 'cover.c'),
-    join_paths(dictbuilder_dir, 'divsufsort.c'),
-    join_paths(dictbuilder_dir, 'zdict.c'),
-    join_paths(deprecated_dir, 'zbuff_common.c'),
-    join_paths(deprecated_dir, 'zbuff_compress.c'),
-    join_paths(deprecated_dir, 'zbuff_decompress.c')
-]
-
-libzstd_includes = [include_directories(common_dir, dictbuilder_dir, compress_dir, lib_dir)]
-
-if get_option('legacy_support')
-    message('Enabling legacy support')
-    libzstd_cflags = ['-DZSTD_LEGACY_SUPPORT=4']
-
-    legacy_dir = join_paths(lib_dir, 'legacy')
-    libzstd_includes += [include_directories(legacy_dir)]
-    libzstd_srcs += [
-        join_paths(legacy_dir, 'zstd_v01.c'),
-        join_paths(legacy_dir, 'zstd_v02.c'),
-        join_paths(legacy_dir, 'zstd_v03.c'),
-        join_paths(legacy_dir, 'zstd_v04.c'),
-        join_paths(legacy_dir, 'zstd_v05.c'),
-        join_paths(legacy_dir, 'zstd_v06.c'),
-        join_paths(legacy_dir, 'zstd_v07.c')
-    ]
-else
-    libzstd_cflags = []
-endif
-
-if get_option('multithread')
-    message('Enabling multi-threading support')
-    add_global_arguments('-DZSTD_MULTITHREAD', language: 'c')
-    libzstd_deps = [dependency('threads')]
-else
-    libzstd_deps = []
-endif
-
-libzstd = library('zstd',
-                  libzstd_srcs,
-                  include_directories: libzstd_includes,
-                  c_args: libzstd_cflags,
-                  dependencies: libzstd_deps,
-                  install: true)
-
-programs_dir = join_paths('..', '..', 'programs')
-
-zstd = executable('zstd',
-                  join_paths(programs_dir, 'bench.c'),
-                  join_paths(programs_dir, 'datagen.c'),
-                  join_paths(programs_dir, 'dibio.c'),
-                  join_paths(programs_dir, 'fileio.c'),
-                  join_paths(programs_dir, 'zstdcli.c'),
-                  include_directories: libzstd_includes,
-                  c_args: ['-DZSTD_NODICT', '-DZSTD_NOBENCH'],
-                  link_with: libzstd,
-                  install: true)
-
-tests_dir = join_paths('..', '..', 'tests')
-datagen_c = join_paths(programs_dir, 'datagen.c')
-test_includes = libzstd_includes + [include_directories(programs_dir)]
-
-fullbench = executable('fullbench',
-                       datagen_c, join_paths(tests_dir, 'fullbench.c'),
-                       include_directories: test_includes,
-                       link_with: libzstd)
-test('fullbench', fullbench)
-
-fuzzer = executable('fuzzer',
-                    datagen_c, join_paths(tests_dir, 'fuzzer.c'),
-                    include_directories: test_includes,
-                    link_with: libzstd)
-test('fuzzer', fuzzer)
-
-if target_machine.system() != 'windows'
-    paramgrill = executable('paramgrill',
-                            datagen_c, join_paths(tests_dir, 'paramgrill.c'),
-                            include_directories: test_includes,
-                            link_with: libzstd,
-                            dependencies: libm)
-    test('paramgrill', paramgrill)
-
-    datagen = executable('datagen',
-                         datagen_c, join_paths(tests_dir, 'datagencli.c'),
-                         include_directories: test_includes,
-                         link_with: libzstd)
-endif
diff --git a/priv/zstd/contrib/meson/meson_options.txt b/priv/zstd/contrib/meson/meson_options.txt
deleted file mode 100644
index 0a12f43..0000000
--- a/priv/zstd/contrib/meson/meson_options.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-option('multithread', type: 'boolean', value: false)
-option('legacy_support', type: 'boolean', value: false)
diff --git a/priv/zstd/contrib/pzstd/.gitignore b/priv/zstd/contrib/pzstd/.gitignore
deleted file mode 100644
index 84e68fb..0000000
--- a/priv/zstd/contrib/pzstd/.gitignore
+++ /dev/null
@@ -1,2 +0,0 @@
-# compilation result
-pzstd
diff --git a/priv/zstd/contrib/pzstd/BUCK b/priv/zstd/contrib/pzstd/BUCK
deleted file mode 100644
index d04eeed..0000000
--- a/priv/zstd/contrib/pzstd/BUCK
+++ /dev/null
@@ -1,72 +0,0 @@
-cxx_library(
-    name='libpzstd',
-    visibility=['PUBLIC'],
-    header_namespace='',
-    exported_headers=[
-        'ErrorHolder.h',
-        'Logging.h',
-        'Pzstd.h',
-    ],
-    headers=[
-        'SkippableFrame.h',
-    ],
-    srcs=[
-        'Pzstd.cpp',
-        'SkippableFrame.cpp',
-    ],
-    deps=[
-        ':options',
-        '//contrib/pzstd/utils:utils',
-        '//lib:mem',
-        '//lib:zstd',
-    ],
-)
-
-cxx_library(
-    name='options',
-    visibility=['PUBLIC'],
-    header_namespace='',
-    exported_headers=['Options.h'],
-    srcs=['Options.cpp'],
-    deps=[
-        '//contrib/pzstd/utils:scope_guard',
-        '//lib:zstd',
-        '//programs:util',
-    ],
-)
-
-cxx_binary(
-    name='pzstd',
-    visibility=['PUBLIC'],
-    srcs=['main.cpp'],
-    deps=[
-        ':libpzstd',
-        ':options',
-    ],
-)
-
-# Must run "make googletest" first
-cxx_library(
-    name='gtest',
-    srcs=glob([
-        'googletest/googletest/src/gtest-all.cc',
-        'googletest/googlemock/src/gmock-all.cc',
-        'googletest/googlemock/src/gmock_main.cc',
-    ]),
-    header_namespace='',
-    exported_headers=subdir_glob([
-        ('googletest/googletest/include', '**/*.h'),
-        ('googletest/googlemock/include', '**/*.h'),
-    ]),
-    headers=subdir_glob([
-        ('googletest/googletest', 'src/*.cc'),
-        ('googletest/googletest', 'src/*.h'),
-        ('googletest/googlemock', 'src/*.cc'),
-        ('googletest/googlemock', 'src/*.h'),
-    ]),
-    platform_linker_flags=[
-        ('android', []),
-        ('', ['-lpthread']),
-    ],
-    visibility=['PUBLIC'],
-)
diff --git a/priv/zstd/contrib/pzstd/ErrorHolder.h b/priv/zstd/contrib/pzstd/ErrorHolder.h
deleted file mode 100644
index 829651c..0000000
--- a/priv/zstd/contrib/pzstd/ErrorHolder.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-// Coordinates graceful shutdown of the pzstd pipeline
-class ErrorHolder {
-  std::atomic error_;
-  std::string message_;
-
- public:
-  ErrorHolder() : error_(false) {}
-
-  bool hasError() noexcept {
-    return error_.load();
-  }
-
-  void setError(std::string message) noexcept {
-    // Given multiple possibly concurrent calls, exactly one will ever succeed.
-    bool expected = false;
-    if (error_.compare_exchange_strong(expected, true)) {
-      message_ = std::move(message);
-    }
-  }
-
-  bool check(bool predicate, std::string message) noexcept {
-    if (!predicate) {
-      setError(std::move(message));
-    }
-    return !hasError();
-  }
-
-  std::string getError() noexcept {
-    error_.store(false);
-    return std::move(message_);
-  }
-
-  ~ErrorHolder() {
-    assert(!hasError());
-  }
-};
-}
diff --git a/priv/zstd/contrib/pzstd/Logging.h b/priv/zstd/contrib/pzstd/Logging.h
deleted file mode 100644
index 16a6393..0000000
--- a/priv/zstd/contrib/pzstd/Logging.h
+++ /dev/null
@@ -1,72 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include 
-#include 
-
-namespace pzstd {
-
-constexpr int ERROR = 1;
-constexpr int INFO = 2;
-constexpr int DEBUG = 3;
-constexpr int VERBOSE = 4;
-
-class Logger {
-  std::mutex mutex_;
-  FILE* out_;
-  const int level_;
-
-  using Clock = std::chrono::system_clock;
-  Clock::time_point lastUpdate_;
-  std::chrono::milliseconds refreshRate_;
-
- public:
-  explicit Logger(int level, FILE* out = stderr)
-      : out_(out), level_(level), lastUpdate_(Clock::now()),
-        refreshRate_(150) {}
-
-
-  bool logsAt(int level) {
-    return level <= level_;
-  }
-
-  template 
-  void operator()(int level, const char *fmt, Args... args) {
-    if (level > level_) {
-      return;
-    }
-    std::lock_guard lock(mutex_);
-    std::fprintf(out_, fmt, args...);
-  }
-
-  template 
-  void update(int level, const char *fmt, Args... args) {
-    if (level > level_) {
-      return;
-    }
-    std::lock_guard lock(mutex_);
-    auto now = Clock::now();
-    if (now - lastUpdate_ > refreshRate_) {
-      lastUpdate_ = now;
-      std::fprintf(out_, "\r");
-      std::fprintf(out_, fmt, args...);
-    }
-  }
-
-  void clear(int level) {
-    if (level > level_) {
-      return;
-    }
-    std::lock_guard lock(mutex_);
-    std::fprintf(out_, "\r%79s\r", "");
-  }
-};
-
-}
diff --git a/priv/zstd/contrib/pzstd/Makefile b/priv/zstd/contrib/pzstd/Makefile
deleted file mode 100644
index 40531e2..0000000
--- a/priv/zstd/contrib/pzstd/Makefile
+++ /dev/null
@@ -1,269 +0,0 @@
-# ################################################################
-# Copyright (c) 2016-present, Facebook, Inc.
-# All rights reserved.
-#
-# This source code is licensed under both the BSD-style license (found in the
-# LICENSE file in the root directory of this source tree) and the GPLv2 (found
-# in the COPYING file in the root directory of this source tree).
-# ################################################################
-
-# Standard variables for installation
-DESTDIR ?=
-PREFIX  ?= /usr/local
-BINDIR  := $(DESTDIR)$(PREFIX)/bin
-
-ZSTDDIR = ../../lib
-PROGDIR = ../../programs
-
-# External program to use to run tests, e.g. qemu or valgrind
-TESTPROG  ?=
-# Flags to pass to the tests
-TESTFLAGS ?=
-
-# We use gcc/clang to generate the header dependencies of files
-DEPFLAGS = -MMD -MP -MF $*.Td
-POSTCOMPILE = mv -f $*.Td $*.d
-
-# CFLAGS, CXXFLAGS, CPPFLAGS, and LDFLAGS are for the users to override
-CFLAGS   ?= -O3 -Wall -Wextra
-CXXFLAGS ?= -O3 -Wall -Wextra -pedantic
-CPPFLAGS ?=
-LDFLAGS  ?=
-
-# Include flags
-PZSTD_INC  = -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(PROGDIR) -I.
-GTEST_INC  = -isystem googletest/googletest/include
-
-PZSTD_CPPFLAGS  = $(PZSTD_INC)
-PZSTD_CCXXFLAGS =
-PZSTD_CFLAGS    = $(PZSTD_CCXXFLAGS)
-PZSTD_CXXFLAGS  = $(PZSTD_CCXXFLAGS) -std=c++11
-PZSTD_LDFLAGS   =
-EXTRA_FLAGS     =
-ALL_CFLAGS      = $(EXTRA_FLAGS) $(CPPFLAGS) $(PZSTD_CPPFLAGS) $(CFLAGS)   $(PZSTD_CFLAGS)
-ALL_CXXFLAGS    = $(EXTRA_FLAGS) $(CPPFLAGS) $(PZSTD_CPPFLAGS) $(CXXFLAGS) $(PZSTD_CXXFLAGS)
-ALL_LDFLAGS     = $(EXTRA_FLAGS) $(LDFLAGS) $(PZSTD_LDFLAGS)
-
-
-# gtest libraries need to go before "-lpthread" because they depend on it.
-GTEST_LIB  = -L googletest/build/googlemock/gtest
-LIBS       =
-
-# Compilation commands
-LD_COMMAND  = $(CXX) $^          $(ALL_LDFLAGS) $(LIBS) -lpthread -o $@
-CC_COMMAND  = $(CC)  $(DEPFLAGS) $(ALL_CFLAGS)   -c $<  -o $@
-CXX_COMMAND = $(CXX) $(DEPFLAGS) $(ALL_CXXFLAGS) -c $<  -o $@
-
-# Get a list of all zstd files so we rebuild the static library when we need to
-ZSTDCOMMON_FILES := $(wildcard $(ZSTDDIR)/common/*.c) \
-                    $(wildcard $(ZSTDDIR)/common/*.h)
-ZSTDCOMP_FILES   := $(wildcard $(ZSTDDIR)/compress/*.c) \
-                    $(wildcard $(ZSTDDIR)/compress/*.h)
-ZSTDDECOMP_FILES := $(wildcard $(ZSTDDIR)/decompress/*.c) \
-                    $(wildcard $(ZSTDDIR)/decompress/*.h)
-ZSTDPROG_FILES   := $(wildcard $(PROGDIR)/*.c) \
-                    $(wildcard $(PROGDIR)/*.h)
-ZSTD_FILES       := $(wildcard $(ZSTDDIR)/*.h) \
-                    $(ZSTDDECOMP_FILES) $(ZSTDCOMMON_FILES) $(ZSTDCOMP_FILES) \
-                    $(ZSTDPROG_FILES)
-
-# List all the pzstd source files so we can determine their dependencies
-PZSTD_SRCS  := $(wildcard *.cpp)
-PZSTD_TESTS := $(wildcard test/*.cpp)
-UTILS_TESTS := $(wildcard utils/test/*.cpp)
-ALL_SRCS    := $(PZSTD_SRCS) $(PZSTD_TESTS) $(UTILS_TESTS)
-
-
-# Define *.exe as extension for Windows systems
-ifneq (,$(filter Windows%,$(OS)))
-EXT =.exe
-else
-EXT =
-endif
-
-# Standard targets
-.PHONY: default
-default: all
-
-.PHONY: test-pzstd
-test-pzstd: TESTFLAGS=--gtest_filter=-*ExtremelyLarge*
-test-pzstd: clean googletest pzstd tests check
-
-.PHONY: test-pzstd32
-test-pzstd32: clean googletest32 all32 check
-
-.PHONY: test-pzstd-tsan
-test-pzstd-tsan: LDFLAGS=-fuse-ld=gold
-test-pzstd-tsan: TESTFLAGS=--gtest_filter=-*ExtremelyLarge*
-test-pzstd-tsan: clean googletest tsan check
-
-.PHONY: test-pzstd-asan
-test-pzstd-asan: LDFLAGS=-fuse-ld=gold
-test-pzstd-asan: TESTFLAGS=--gtest_filter=-*ExtremelyLarge*
-test-pzstd-asan: clean asan check
-
-.PHONY: check
-check:
-	$(TESTPROG) ./utils/test/BufferTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./utils/test/RangeTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./utils/test/ResourcePoolTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./utils/test/ScopeGuardTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./utils/test/ThreadPoolTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./utils/test/WorkQueueTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./test/OptionsTest$(EXT) $(TESTFLAGS)
-	$(TESTPROG) ./test/PzstdTest$(EXT) $(TESTFLAGS)
-
-.PHONY: install
-install: PZSTD_CPPFLAGS += -DNDEBUG
-install: pzstd$(EXT)
-	install -d -m 755 $(BINDIR)/
-	install -m 755 pzstd$(EXT) $(BINDIR)/pzstd$(EXT)
-
-.PHONY: uninstall
-uninstall:
-	$(RM) $(BINDIR)/pzstd$(EXT)
-
-# Targets for many different builds
-.PHONY: all
-all: PZSTD_CPPFLAGS += -DNDEBUG
-all: pzstd$(EXT)
-
-.PHONY: debug
-debug: EXTRA_FLAGS += -g
-debug: pzstd$(EXT) tests roundtrip
-
-.PHONY: tsan
-tsan: PZSTD_CCXXFLAGS += -fsanitize=thread -fPIC
-tsan: PZSTD_LDFLAGS   += -fsanitize=thread
-tsan: debug
-
-.PHONY: asan
-asan: EXTRA_FLAGS += -fsanitize=address
-asan: debug
-
-.PHONY: ubsan
-ubsan: EXTRA_FLAGS += -fsanitize=undefined
-ubsan: debug
-
-.PHONY: all32
-all32: EXTRA_FLAGS += -m32
-all32: all tests roundtrip
-
-.PHONY: debug32
-debug32: EXTRA_FLAGS += -m32
-debug32: debug
-
-.PHONY: asan32
-asan32: EXTRA_FLAGS += -m32
-asan32: asan
-
-.PHONY: tsan32
-tsan32: EXTRA_FLAGS += -m32
-tsan32: tsan
-
-.PHONY: ubsan32
-ubsan32: EXTRA_FLAGS += -m32
-ubsan32: ubsan
-
-# Run long round trip tests
-.PHONY: roundtripcheck
-roundtripcheck: roundtrip check
-	$(TESTPROG) ./test/RoundTripTest$(EXT) $(TESTFLAGS)
-
-# Build the main binary
-pzstd$(EXT): main.o Options.o Pzstd.o SkippableFrame.o $(ZSTDDIR)/libzstd.a
-	$(LD_COMMAND)
-
-# Target that depends on all the tests
-.PHONY: tests
-tests: EXTRA_FLAGS += -Wno-deprecated-declarations
-tests: $(patsubst %,%$(EXT),$(basename $(PZSTD_TESTS) $(UTILS_TESTS)))
-
-# Build the round trip tests
-.PHONY: roundtrip
-roundtrip: EXTRA_FLAGS += -Wno-deprecated-declarations
-roundtrip: test/RoundTripTest$(EXT)
-
-# Use the static library that zstd builds for simplicity and
-# so we get the compiler options correct
-$(ZSTDDIR)/libzstd.a: $(ZSTD_FILES)
-	CFLAGS="$(ALL_CFLAGS)" LDFLAGS="$(ALL_LDFLAGS)" $(MAKE) -C $(ZSTDDIR) libzstd.a
-
-# Rules to build the tests
-test/RoundTripTest$(EXT): test/RoundTripTest.o $(PROGDIR)/datagen.o Options.o \
-                          Pzstd.o SkippableFrame.o $(ZSTDDIR)/libzstd.a
-	$(LD_COMMAND)
-
-test/%Test$(EXT): PZSTD_LDFLAGS += $(GTEST_LIB)
-test/%Test$(EXT): LIBS += -lgtest -lgtest_main
-test/%Test$(EXT): test/%Test.o $(PROGDIR)/datagen.o Options.o Pzstd.o  \
-                  SkippableFrame.o $(ZSTDDIR)/libzstd.a
-	$(LD_COMMAND)
-
-utils/test/%Test$(EXT): PZSTD_LDFLAGS += $(GTEST_LIB)
-utils/test/%Test$(EXT): LIBS += -lgtest -lgtest_main
-utils/test/%Test$(EXT): utils/test/%Test.o
-	$(LD_COMMAND)
-
-
-GTEST_CMAKEFLAGS =
-
-# Install googletest
-.PHONY: googletest
-googletest: PZSTD_CCXXFLAGS += -fPIC
-googletest:
-	@$(RM) -rf googletest
-	@git clone https://github.com/google/googletest
-	@mkdir -p googletest/build
-	@cd googletest/build && cmake $(GTEST_CMAKEFLAGS) -DCMAKE_CXX_FLAGS="$(ALL_CXXFLAGS)" .. && $(MAKE)
-
-.PHONY: googletest32
-googletest32: PZSTD_CCXXFLAGS  += -m32
-googletest32: googletest
-
-.PHONY: googletest-mingw64
-googletest-mingw64: GTEST_CMAKEFLAGS += -G "MSYS Makefiles"
-googletest-mingw64: googletest
-
-.PHONY: clean
-clean:
-	$(RM) -f *.o pzstd$(EXT) *.Td *.d
-	$(RM) -f test/*.o test/*Test$(EXT) test/*.Td test/*.d
-	$(RM) -f utils/test/*.o utils/test/*Test$(EXT) utils/test/*.Td utils/test/*.d
-	$(RM) -f $(PROGDIR)/*.o $(PROGDIR)/*.Td $(PROGDIR)/*.d
-	$(MAKE) -C $(ZSTDDIR) clean
-	@echo Cleaning completed
-
-
-# Cancel implicit rules
-%.o: %.c
-%.o: %.cpp
-
-# Object file rules
-%.o: %.c
-	$(CC_COMMAND)
-	$(POSTCOMPILE)
-
-$(PROGDIR)/%.o: $(PROGDIR)/%.c
-	$(CC_COMMAND)
-	$(POSTCOMPILE)
-
-%.o: %.cpp
-	$(CXX_COMMAND)
-	$(POSTCOMPILE)
-
-test/%.o: PZSTD_CPPFLAGS += $(GTEST_INC)
-test/%.o: test/%.cpp
-	$(CXX_COMMAND)
-	$(POSTCOMPILE)
-
-utils/test/%.o: PZSTD_CPPFLAGS += $(GTEST_INC)
-utils/test/%.o: utils/test/%.cpp
-	$(CXX_COMMAND)
-	$(POSTCOMPILE)
-
-# Dependency file stuff
-.PRECIOUS: %.d test/%.d utils/test/%.d
-
-# Include rules that specify header file dependencies
--include $(patsubst %,%.d,$(basename $(ALL_SRCS)))
diff --git a/priv/zstd/contrib/pzstd/Options.cpp b/priv/zstd/contrib/pzstd/Options.cpp
deleted file mode 100644
index d9b216b..0000000
--- a/priv/zstd/contrib/pzstd/Options.cpp
+++ /dev/null
@@ -1,439 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "Options.h"
-#include "util.h"
-#include "utils/ScopeGuard.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#if defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(_WIN32) ||     \
-    defined(__CYGWIN__)
-#include  /* _isatty */
-#define IS_CONSOLE(stdStream) _isatty(_fileno(stdStream))
-#elif defined(_POSIX_C_SOURCE) || defined(_XOPEN_SOURCE) || defined(_POSIX_SOURCE) || (defined(__APPLE__) && defined(__MACH__)) || \
-      defined(__DragonFly__) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__)  /* https://sourceforge.net/p/predef/wiki/OperatingSystems/ */
-#include  /* isatty */
-#define IS_CONSOLE(stdStream) isatty(fileno(stdStream))
-#else
-#define IS_CONSOLE(stdStream) 0
-#endif
-
-namespace pzstd {
-
-namespace {
-unsigned defaultNumThreads() {
-#ifdef PZSTD_NUM_THREADS
-  return PZSTD_NUM_THREADS;
-#else
-  return std::thread::hardware_concurrency();
-#endif
-}
-
-unsigned parseUnsigned(const char **arg) {
-  unsigned result = 0;
-  while (**arg >= '0' && **arg <= '9') {
-    result *= 10;
-    result += **arg - '0';
-    ++(*arg);
-  }
-  return result;
-}
-
-const char *getArgument(const char *options, const char **argv, int &i,
-                        int argc) {
-  if (options[1] != 0) {
-    return options + 1;
-  }
-  ++i;
-  if (i == argc) {
-    std::fprintf(stderr, "Option -%c requires an argument, but none provided\n",
-                 *options);
-    return nullptr;
-  }
-  return argv[i];
-}
-
-const std::string kZstdExtension = ".zst";
-constexpr char kStdIn[] = "-";
-constexpr char kStdOut[] = "-";
-constexpr unsigned kDefaultCompressionLevel = 3;
-constexpr unsigned kMaxNonUltraCompressionLevel = 19;
-
-#ifdef _WIN32
-const char nullOutput[] = "nul";
-#else
-const char nullOutput[] = "/dev/null";
-#endif
-
-void notSupported(const char *option) {
-  std::fprintf(stderr, "Operation not supported: %s\n", option);
-}
-
-void usage() {
-  std::fprintf(stderr, "Usage:\n");
-  std::fprintf(stderr, "  pzstd [args] [FILE(s)]\n");
-  std::fprintf(stderr, "Parallel ZSTD options:\n");
-  std::fprintf(stderr, "  -p, --processes   #    : number of threads to use for (de)compression (default:%d)\n", defaultNumThreads());
-
-  std::fprintf(stderr, "ZSTD options:\n");
-  std::fprintf(stderr, "  -#                     : # compression level (1-%d, default:%d)\n", kMaxNonUltraCompressionLevel, kDefaultCompressionLevel);
-  std::fprintf(stderr, "  -d, --decompress       : decompression\n");
-  std::fprintf(stderr, "  -o                file : result stored into `file` (only if 1 input file)\n");
-  std::fprintf(stderr, "  -f, --force            : overwrite output without prompting, (de)compress links\n");
-  std::fprintf(stderr, "      --rm               : remove source file(s) after successful (de)compression\n");
-  std::fprintf(stderr, "  -k, --keep             : preserve source file(s) (default)\n");
-  std::fprintf(stderr, "  -h, --help             : display help and exit\n");
-  std::fprintf(stderr, "  -V, --version          : display version number and exit\n");
-  std::fprintf(stderr, "  -v, --verbose          : verbose mode; specify multiple times to increase log level (default:2)\n");
-  std::fprintf(stderr, "  -q, --quiet            : suppress warnings; specify twice to suppress errors too\n");
-  std::fprintf(stderr, "  -c, --stdout           : force write to standard output, even if it is the console\n");
-#ifdef UTIL_HAS_CREATEFILELIST
-  std::fprintf(stderr, "  -r                     : operate recursively on directories\n");
-#endif
-  std::fprintf(stderr, "      --ultra            : enable levels beyond %i, up to %i (requires more memory)\n", kMaxNonUltraCompressionLevel, ZSTD_maxCLevel());
-  std::fprintf(stderr, "  -C, --check            : integrity check (default)\n");
-  std::fprintf(stderr, "      --no-check         : no integrity check\n");
-  std::fprintf(stderr, "  -t, --test             : test compressed file integrity\n");
-  std::fprintf(stderr, "  --                     : all arguments after \"--\" are treated as files\n");
-}
-} // anonymous namespace
-
-Options::Options()
-    : numThreads(defaultNumThreads()), maxWindowLog(23),
-      compressionLevel(kDefaultCompressionLevel), decompress(false),
-      overwrite(false), keepSource(true), writeMode(WriteMode::Auto),
-      checksum(true), verbosity(2) {}
-
-Options::Status Options::parse(int argc, const char **argv) {
-  bool test = false;
-  bool recursive = false;
-  bool ultra = false;
-  bool forceStdout = false;
-  bool followLinks = false;
-  // Local copy of input files, which are pointers into argv.
-  std::vector localInputFiles;
-  for (int i = 1; i < argc; ++i) {
-    const char *arg = argv[i];
-    // Protect against empty arguments
-    if (arg[0] == 0) {
-      continue;
-    }
-    // Everything after "--" is an input file
-    if (!std::strcmp(arg, "--")) {
-      ++i;
-      std::copy(argv + i, argv + argc, std::back_inserter(localInputFiles));
-      break;
-    }
-    // Long arguments that don't have a short option
-    {
-      bool isLongOption = true;
-      if (!std::strcmp(arg, "--rm")) {
-        keepSource = false;
-      } else if (!std::strcmp(arg, "--ultra")) {
-        ultra = true;
-        maxWindowLog = 0;
-      } else if (!std::strcmp(arg, "--no-check")) {
-        checksum = false;
-      } else if (!std::strcmp(arg, "--sparse")) {
-        writeMode = WriteMode::Sparse;
-        notSupported("Sparse mode");
-        return Status::Failure;
-      } else if (!std::strcmp(arg, "--no-sparse")) {
-        writeMode = WriteMode::Regular;
-        notSupported("Sparse mode");
-        return Status::Failure;
-      } else if (!std::strcmp(arg, "--dictID")) {
-        notSupported(arg);
-        return Status::Failure;
-      } else if (!std::strcmp(arg, "--no-dictID")) {
-        notSupported(arg);
-        return Status::Failure;
-      } else {
-        isLongOption = false;
-      }
-      if (isLongOption) {
-        continue;
-      }
-    }
-    // Arguments with a short option simply set their short option.
-    const char *options = nullptr;
-    if (!std::strcmp(arg, "--processes")) {
-      options = "p";
-    } else if (!std::strcmp(arg, "--version")) {
-      options = "V";
-    } else if (!std::strcmp(arg, "--help")) {
-      options = "h";
-    } else if (!std::strcmp(arg, "--decompress")) {
-      options = "d";
-    } else if (!std::strcmp(arg, "--force")) {
-      options = "f";
-    } else if (!std::strcmp(arg, "--stdout")) {
-      options = "c";
-    } else if (!std::strcmp(arg, "--keep")) {
-      options = "k";
-    } else if (!std::strcmp(arg, "--verbose")) {
-      options = "v";
-    } else if (!std::strcmp(arg, "--quiet")) {
-      options = "q";
-    } else if (!std::strcmp(arg, "--check")) {
-      options = "C";
-    } else if (!std::strcmp(arg, "--test")) {
-      options = "t";
-    } else if (arg[0] == '-' && arg[1] != 0) {
-      options = arg + 1;
-    } else {
-      localInputFiles.emplace_back(arg);
-      continue;
-    }
-    assert(options != nullptr);
-
-    bool finished = false;
-    while (!finished && *options != 0) {
-      // Parse the compression level
-      if (*options >= '0' && *options <= '9') {
-        compressionLevel = parseUnsigned(&options);
-        continue;
-      }
-
-      switch (*options) {
-      case 'h':
-      case 'H':
-        usage();
-        return Status::Message;
-      case 'V':
-        std::fprintf(stderr, "PZSTD version: %s.\n", ZSTD_VERSION_STRING);
-        return Status::Message;
-      case 'p': {
-        finished = true;
-        const char *optionArgument = getArgument(options, argv, i, argc);
-        if (optionArgument == nullptr) {
-          return Status::Failure;
-        }
-        if (*optionArgument < '0' || *optionArgument > '9') {
-          std::fprintf(stderr, "Option -p expects a number, but %s provided\n",
-                       optionArgument);
-          return Status::Failure;
-        }
-        numThreads = parseUnsigned(&optionArgument);
-        if (*optionArgument != 0) {
-          std::fprintf(stderr,
-                       "Option -p expects a number, but %u%s provided\n",
-                       numThreads, optionArgument);
-          return Status::Failure;
-        }
-        break;
-      }
-      case 'o': {
-        finished = true;
-        const char *optionArgument = getArgument(options, argv, i, argc);
-        if (optionArgument == nullptr) {
-          return Status::Failure;
-        }
-        outputFile = optionArgument;
-        break;
-      }
-      case 'C':
-        checksum = true;
-        break;
-      case 'k':
-        keepSource = true;
-        break;
-      case 'd':
-        decompress = true;
-        break;
-      case 'f':
-        overwrite = true;
-        forceStdout = true;
-        followLinks = true;
-        break;
-      case 't':
-        test = true;
-        decompress = true;
-        break;
-#ifdef UTIL_HAS_CREATEFILELIST
-      case 'r':
-        recursive = true;
-        break;
-#endif
-      case 'c':
-        outputFile = kStdOut;
-        forceStdout = true;
-        break;
-      case 'v':
-        ++verbosity;
-        break;
-      case 'q':
-        --verbosity;
-        // Ignore them for now
-        break;
-      // Unsupported options from Zstd
-      case 'D':
-      case 's':
-        notSupported("Zstd dictionaries.");
-        return Status::Failure;
-      case 'b':
-      case 'e':
-      case 'i':
-      case 'B':
-        notSupported("Zstd benchmarking options.");
-        return Status::Failure;
-      default:
-        std::fprintf(stderr, "Invalid argument: %s\n", arg);
-        return Status::Failure;
-      }
-      if (!finished) {
-        ++options;
-      }
-    } // while (*options != 0);
-  }   // for (int i = 1; i < argc; ++i);
-
-  // Set options for test mode
-  if (test) {
-    outputFile = nullOutput;
-    keepSource = true;
-  }
-
-  // Input file defaults to standard input if not provided.
-  if (localInputFiles.empty()) {
-    localInputFiles.emplace_back(kStdIn);
-  }
-
-  // Check validity of input files
-  if (localInputFiles.size() > 1) {
-    const auto it = std::find(localInputFiles.begin(), localInputFiles.end(),
-                              std::string{kStdIn});
-    if (it != localInputFiles.end()) {
-      std::fprintf(
-          stderr,
-          "Cannot specify standard input when handling multiple files\n");
-      return Status::Failure;
-    }
-  }
-  if (localInputFiles.size() > 1 || recursive) {
-    if (!outputFile.empty() && outputFile != nullOutput) {
-      std::fprintf(
-          stderr,
-          "Cannot specify an output file when handling multiple inputs\n");
-      return Status::Failure;
-    }
-  }
-
-  g_utilDisplayLevel = verbosity;
-  // Remove local input files that are symbolic links
-  if (!followLinks) {
-      std::remove_if(localInputFiles.begin(), localInputFiles.end(),
-                     [&](const char *path) {
-                        bool isLink = UTIL_isLink(path);
-                        if (isLink && verbosity >= 2) {
-                            std::fprintf(
-                                    stderr,
-                                    "Warning : %s is symbolic link, ignoring\n",
-                                    path);
-                        }
-                        return isLink;
-                    });
-  }
-
-  // Translate input files/directories into files to (de)compress
-  if (recursive) {
-    char *scratchBuffer = nullptr;
-    unsigned numFiles = 0;
-    const char **files =
-        UTIL_createFileList(localInputFiles.data(), localInputFiles.size(),
-                            &scratchBuffer, &numFiles, followLinks);
-    if (files == nullptr) {
-      std::fprintf(stderr, "Error traversing directories\n");
-      return Status::Failure;
-    }
-    auto guard =
-        makeScopeGuard([&] { UTIL_freeFileList(files, scratchBuffer); });
-    if (numFiles == 0) {
-      std::fprintf(stderr, "No files found\n");
-      return Status::Failure;
-    }
-    inputFiles.resize(numFiles);
-    std::copy(files, files + numFiles, inputFiles.begin());
-  } else {
-    inputFiles.resize(localInputFiles.size());
-    std::copy(localInputFiles.begin(), localInputFiles.end(),
-              inputFiles.begin());
-  }
-  localInputFiles.clear();
-  assert(!inputFiles.empty());
-
-  // If reading from standard input, default to standard output
-  if (inputFiles[0] == kStdIn && outputFile.empty()) {
-    assert(inputFiles.size() == 1);
-    outputFile = "-";
-  }
-
-  if (inputFiles[0] == kStdIn && IS_CONSOLE(stdin)) {
-    assert(inputFiles.size() == 1);
-    std::fprintf(stderr, "Cannot read input from interactive console\n");
-    return Status::Failure;
-  }
-  if (outputFile == "-" && IS_CONSOLE(stdout) && !(forceStdout && decompress)) {
-    std::fprintf(stderr, "Will not write to console stdout unless -c or -f is "
-                         "specified and decompressing\n");
-    return Status::Failure;
-  }
-
-  // Check compression level
-  {
-    unsigned maxCLevel =
-        ultra ? ZSTD_maxCLevel() : kMaxNonUltraCompressionLevel;
-    if (compressionLevel > maxCLevel || compressionLevel == 0) {
-      std::fprintf(stderr, "Invalid compression level %u.\n", compressionLevel);
-      return Status::Failure;
-    }
-  }
-
-  // Check that numThreads is set
-  if (numThreads == 0) {
-    std::fprintf(stderr, "Invalid arguments: # of threads not specified "
-                         "and unable to determine hardware concurrency.\n");
-    return Status::Failure;
-  }
-
-  // Modify verbosity
-  // If we are piping input and output, turn off interaction
-  if (inputFiles[0] == kStdIn && outputFile == kStdOut && verbosity == 2) {
-    verbosity = 1;
-  }
-  // If we are in multi-file mode, turn off interaction
-  if (inputFiles.size() > 1 && verbosity == 2) {
-    verbosity = 1;
-  }
-
-  return Status::Success;
-}
-
-std::string Options::getOutputFile(const std::string &inputFile) const {
-  if (!outputFile.empty()) {
-    return outputFile;
-  }
-  // Attempt to add/remove zstd extension from the input file
-  if (decompress) {
-    int stemSize = inputFile.size() - kZstdExtension.size();
-    if (stemSize > 0 && inputFile.substr(stemSize) == kZstdExtension) {
-      return inputFile.substr(0, stemSize);
-    } else {
-      return "";
-    }
-  } else {
-    return inputFile + kZstdExtension;
-  }
-}
-}
diff --git a/priv/zstd/contrib/pzstd/Options.h b/priv/zstd/contrib/pzstd/Options.h
deleted file mode 100644
index f4f2aaa..0000000
--- a/priv/zstd/contrib/pzstd/Options.h
+++ /dev/null
@@ -1,68 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#define ZSTD_STATIC_LINKING_ONLY
-#include "zstd.h"
-#undef ZSTD_STATIC_LINKING_ONLY
-
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-struct Options {
-  enum class WriteMode { Regular, Auto, Sparse };
-
-  unsigned numThreads;
-  unsigned maxWindowLog;
-  unsigned compressionLevel;
-  bool decompress;
-  std::vector inputFiles;
-  std::string outputFile;
-  bool overwrite;
-  bool keepSource;
-  WriteMode writeMode;
-  bool checksum;
-  int verbosity;
-
-  enum class Status {
-    Success, // Successfully parsed options
-    Failure, // Failure to parse options
-    Message  // Options specified to print a message (e.g. "-h")
-  };
-
-  Options();
-  Options(unsigned numThreads, unsigned maxWindowLog, unsigned compressionLevel,
-          bool decompress, std::vector inputFiles,
-          std::string outputFile, bool overwrite, bool keepSource,
-          WriteMode writeMode, bool checksum, int verbosity)
-      : numThreads(numThreads), maxWindowLog(maxWindowLog),
-        compressionLevel(compressionLevel), decompress(decompress),
-        inputFiles(std::move(inputFiles)), outputFile(std::move(outputFile)),
-        overwrite(overwrite), keepSource(keepSource), writeMode(writeMode),
-        checksum(checksum), verbosity(verbosity) {}
-
-  Status parse(int argc, const char **argv);
-
-  ZSTD_parameters determineParameters() const {
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, 0);
-    params.fParams.contentSizeFlag = 0;
-    params.fParams.checksumFlag = checksum;
-    if (maxWindowLog != 0 && params.cParams.windowLog > maxWindowLog) {
-      params.cParams.windowLog = maxWindowLog;
-      params.cParams = ZSTD_adjustCParams(params.cParams, 0, 0);
-    }
-    return params;
-  }
-
-  std::string getOutputFile(const std::string &inputFile) const;
-};
-}
diff --git a/priv/zstd/contrib/pzstd/Pzstd.cpp b/priv/zstd/contrib/pzstd/Pzstd.cpp
deleted file mode 100644
index 1eb4ce1..0000000
--- a/priv/zstd/contrib/pzstd/Pzstd.cpp
+++ /dev/null
@@ -1,618 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "Pzstd.h"
-#include "SkippableFrame.h"
-#include "utils/FileSystem.h"
-#include "utils/Range.h"
-#include "utils/ScopeGuard.h"
-#include "utils/ThreadPool.h"
-#include "utils/WorkQueue.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
-#if defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(_WIN32) || defined(__CYGWIN__)
-#  include     /* _O_BINARY */
-#  include        /* _setmode, _isatty */
-#  define SET_BINARY_MODE(file) { if (_setmode(_fileno(file), _O_BINARY) == -1) perror("Cannot set _O_BINARY"); }
-#else
-#  include    /* isatty */
-#  define SET_BINARY_MODE(file)
-#endif
-
-namespace pzstd {
-
-namespace {
-#ifdef _WIN32
-const std::string nullOutput = "nul";
-#else
-const std::string nullOutput = "/dev/null";
-#endif
-}
-
-using std::size_t;
-
-static std::uintmax_t fileSizeOrZero(const std::string &file) {
-  if (file == "-") {
-    return 0;
-  }
-  std::error_code ec;
-  auto size = file_size(file, ec);
-  if (ec) {
-    size = 0;
-  }
-  return size;
-}
-
-static std::uint64_t handleOneInput(const Options &options,
-                             const std::string &inputFile,
-                             FILE* inputFd,
-                             const std::string &outputFile,
-                             FILE* outputFd,
-                             SharedState& state) {
-  auto inputSize = fileSizeOrZero(inputFile);
-  // WorkQueue outlives ThreadPool so in the case of error we are certain
-  // we don't accidently try to call push() on it after it is destroyed
-  WorkQueue> outs{options.numThreads + 1};
-  std::uint64_t bytesRead;
-  std::uint64_t bytesWritten;
-  {
-    // Initialize the (de)compression thread pool with numThreads
-    ThreadPool executor(options.numThreads);
-    // Run the reader thread on an extra thread
-    ThreadPool readExecutor(1);
-    if (!options.decompress) {
-      // Add a job that reads the input and starts all the compression jobs
-      readExecutor.add(
-          [&state, &outs, &executor, inputFd, inputSize, &options, &bytesRead] {
-            bytesRead = asyncCompressChunks(
-                state,
-                outs,
-                executor,
-                inputFd,
-                inputSize,
-                options.numThreads,
-                options.determineParameters());
-          });
-      // Start writing
-      bytesWritten = writeFile(state, outs, outputFd, options.decompress);
-    } else {
-      // Add a job that reads the input and starts all the decompression jobs
-      readExecutor.add([&state, &outs, &executor, inputFd, &bytesRead] {
-        bytesRead = asyncDecompressFrames(state, outs, executor, inputFd);
-      });
-      // Start writing
-      bytesWritten = writeFile(state, outs, outputFd, options.decompress);
-    }
-  }
-  if (!state.errorHolder.hasError()) {
-    std::string inputFileName = inputFile == "-" ? "stdin" : inputFile;
-    std::string outputFileName = outputFile == "-" ? "stdout" : outputFile;
-    if (!options.decompress) {
-      double ratio = static_cast(bytesWritten) /
-                     static_cast(bytesRead + !bytesRead);
-      state.log(INFO, "%-20s :%6.2f%%   (%6" PRIu64 " => %6" PRIu64
-                   " bytes, %s)\n",
-                   inputFileName.c_str(), ratio * 100, bytesRead, bytesWritten,
-                   outputFileName.c_str());
-    } else {
-      state.log(INFO, "%-20s: %" PRIu64 " bytes \n",
-                   inputFileName.c_str(),bytesWritten);
-    }
-  }
-  return bytesWritten;
-}
-
-static FILE *openInputFile(const std::string &inputFile,
-                           ErrorHolder &errorHolder) {
-  if (inputFile == "-") {
-    SET_BINARY_MODE(stdin);
-    return stdin;
-  }
-  // Check if input file is a directory
-  {
-    std::error_code ec;
-    if (is_directory(inputFile, ec)) {
-      errorHolder.setError("Output file is a directory -- ignored");
-      return nullptr;
-    }
-  }
-  auto inputFd = std::fopen(inputFile.c_str(), "rb");
-  if (!errorHolder.check(inputFd != nullptr, "Failed to open input file")) {
-    return nullptr;
-  }
-  return inputFd;
-}
-
-static FILE *openOutputFile(const Options &options,
-                            const std::string &outputFile,
-                            SharedState& state) {
-  if (outputFile == "-") {
-    SET_BINARY_MODE(stdout);
-    return stdout;
-  }
-  // Check if the output file exists and then open it
-  if (!options.overwrite && outputFile != nullOutput) {
-    auto outputFd = std::fopen(outputFile.c_str(), "rb");
-    if (outputFd != nullptr) {
-      std::fclose(outputFd);
-      if (!state.log.logsAt(INFO)) {
-        state.errorHolder.setError("Output file exists");
-        return nullptr;
-      }
-      state.log(
-          INFO,
-          "pzstd: %s already exists; do you wish to overwrite (y/n) ? ",
-          outputFile.c_str());
-      int c = getchar();
-      if (c != 'y' && c != 'Y') {
-        state.errorHolder.setError("Not overwritten");
-        return nullptr;
-      }
-    }
-  }
-  auto outputFd = std::fopen(outputFile.c_str(), "wb");
-  if (!state.errorHolder.check(
-          outputFd != nullptr, "Failed to open output file")) {
-    return nullptr;
-  }
-  return outputFd;
-}
-
-int pzstdMain(const Options &options) {
-  int returnCode = 0;
-  SharedState state(options);
-  for (const auto& input : options.inputFiles) {
-    // Setup the shared state
-    auto printErrorGuard = makeScopeGuard([&] {
-      if (state.errorHolder.hasError()) {
-        returnCode = 1;
-        state.log(ERROR, "pzstd: %s: %s.\n", input.c_str(),
-                  state.errorHolder.getError().c_str());
-      }
-    });
-    // Open the input file
-    auto inputFd = openInputFile(input, state.errorHolder);
-    if (inputFd == nullptr) {
-      continue;
-    }
-    auto closeInputGuard = makeScopeGuard([&] { std::fclose(inputFd); });
-    // Open the output file
-    auto outputFile = options.getOutputFile(input);
-    if (!state.errorHolder.check(outputFile != "",
-                           "Input file does not have extension .zst")) {
-      continue;
-    }
-    auto outputFd = openOutputFile(options, outputFile, state);
-    if (outputFd == nullptr) {
-      continue;
-    }
-    auto closeOutputGuard = makeScopeGuard([&] { std::fclose(outputFd); });
-    // (de)compress the file
-    handleOneInput(options, input, inputFd, outputFile, outputFd, state);
-    if (state.errorHolder.hasError()) {
-      continue;
-    }
-    // Delete the input file if necessary
-    if (!options.keepSource) {
-      // Be sure that we are done and have written everything before we delete
-      if (!state.errorHolder.check(std::fclose(inputFd) == 0,
-                             "Failed to close input file")) {
-        continue;
-      }
-      closeInputGuard.dismiss();
-      if (!state.errorHolder.check(std::fclose(outputFd) == 0,
-                             "Failed to close output file")) {
-        continue;
-      }
-      closeOutputGuard.dismiss();
-      if (std::remove(input.c_str()) != 0) {
-        state.errorHolder.setError("Failed to remove input file");
-        continue;
-      }
-    }
-  }
-  // Returns 1 if any of the files failed to (de)compress.
-  return returnCode;
-}
-
-/// Construct a `ZSTD_inBuffer` that points to the data in `buffer`.
-static ZSTD_inBuffer makeZstdInBuffer(const Buffer& buffer) {
-  return ZSTD_inBuffer{buffer.data(), buffer.size(), 0};
-}
-
-/**
- * Advance `buffer` and `inBuffer` by the amount of data read, as indicated by
- * `inBuffer.pos`.
- */
-void advance(Buffer& buffer, ZSTD_inBuffer& inBuffer) {
-  auto pos = inBuffer.pos;
-  inBuffer.src = static_cast(inBuffer.src) + pos;
-  inBuffer.size -= pos;
-  inBuffer.pos = 0;
-  return buffer.advance(pos);
-}
-
-/// Construct a `ZSTD_outBuffer` that points to the data in `buffer`.
-static ZSTD_outBuffer makeZstdOutBuffer(Buffer& buffer) {
-  return ZSTD_outBuffer{buffer.data(), buffer.size(), 0};
-}
-
-/**
- * Split `buffer` and advance `outBuffer` by the amount of data written, as
- * indicated by `outBuffer.pos`.
- */
-Buffer split(Buffer& buffer, ZSTD_outBuffer& outBuffer) {
-  auto pos = outBuffer.pos;
-  outBuffer.dst = static_cast(outBuffer.dst) + pos;
-  outBuffer.size -= pos;
-  outBuffer.pos = 0;
-  return buffer.splitAt(pos);
-}
-
-/**
- * Stream chunks of input from `in`, compress it, and stream it out to `out`.
- *
- * @param state        The shared state
- * @param in           Queue that we `pop()` input buffers from
- * @param out          Queue that we `push()` compressed output buffers to
- * @param maxInputSize An upper bound on the size of the input
- */
-static void compress(
-    SharedState& state,
-    std::shared_ptr in,
-    std::shared_ptr out,
-    size_t maxInputSize) {
-  auto& errorHolder = state.errorHolder;
-  auto guard = makeScopeGuard([&] { out->finish(); });
-  // Initialize the CCtx
-  auto ctx = state.cStreamPool->get();
-  if (!errorHolder.check(ctx != nullptr, "Failed to allocate ZSTD_CStream")) {
-    return;
-  }
-  {
-    auto err = ZSTD_resetCStream(ctx.get(), 0);
-    if (!errorHolder.check(!ZSTD_isError(err), ZSTD_getErrorName(err))) {
-      return;
-    }
-  }
-
-  // Allocate space for the result
-  auto outBuffer = Buffer(ZSTD_compressBound(maxInputSize));
-  auto zstdOutBuffer = makeZstdOutBuffer(outBuffer);
-  {
-    Buffer inBuffer;
-    // Read a buffer in from the input queue
-    while (in->pop(inBuffer) && !errorHolder.hasError()) {
-      auto zstdInBuffer = makeZstdInBuffer(inBuffer);
-      // Compress the whole buffer and send it to the output queue
-      while (!inBuffer.empty() && !errorHolder.hasError()) {
-        if (!errorHolder.check(
-                !outBuffer.empty(), "ZSTD_compressBound() was too small")) {
-          return;
-        }
-        // Compress
-        auto err =
-            ZSTD_compressStream(ctx.get(), &zstdOutBuffer, &zstdInBuffer);
-        if (!errorHolder.check(!ZSTD_isError(err), ZSTD_getErrorName(err))) {
-          return;
-        }
-        // Split the compressed data off outBuffer and pass to the output queue
-        out->push(split(outBuffer, zstdOutBuffer));
-        // Forget about the data we already compressed
-        advance(inBuffer, zstdInBuffer);
-      }
-    }
-  }
-  // Write the epilog
-  size_t bytesLeft;
-  do {
-    if (!errorHolder.check(
-            !outBuffer.empty(), "ZSTD_compressBound() was too small")) {
-      return;
-    }
-    bytesLeft = ZSTD_endStream(ctx.get(), &zstdOutBuffer);
-    if (!errorHolder.check(
-            !ZSTD_isError(bytesLeft), ZSTD_getErrorName(bytesLeft))) {
-      return;
-    }
-    out->push(split(outBuffer, zstdOutBuffer));
-  } while (bytesLeft != 0 && !errorHolder.hasError());
-}
-
-/**
- * Calculates how large each independently compressed frame should be.
- *
- * @param size       The size of the source if known, 0 otherwise
- * @param numThreads The number of threads available to run compression jobs on
- * @param params     The zstd parameters to be used for compression
- */
-static size_t calculateStep(
-    std::uintmax_t size,
-    size_t numThreads,
-    const ZSTD_parameters ¶ms) {
-  (void)size;
-  (void)numThreads;
-  return size_t{1} << (params.cParams.windowLog + 2);
-}
-
-namespace {
-enum class FileStatus { Continue, Done, Error };
-/// Determines the status of the file descriptor `fd`.
-FileStatus fileStatus(FILE* fd) {
-  if (std::feof(fd)) {
-    return FileStatus::Done;
-  } else if (std::ferror(fd)) {
-    return FileStatus::Error;
-  }
-  return FileStatus::Continue;
-}
-} // anonymous namespace
-
-/**
- * Reads `size` data in chunks of `chunkSize` and puts it into `queue`.
- * Will read less if an error or EOF occurs.
- * Returns the status of the file after all of the reads have occurred.
- */
-static FileStatus
-readData(BufferWorkQueue& queue, size_t chunkSize, size_t size, FILE* fd,
-         std::uint64_t *totalBytesRead) {
-  Buffer buffer(size);
-  while (!buffer.empty()) {
-    auto bytesRead =
-        std::fread(buffer.data(), 1, std::min(chunkSize, buffer.size()), fd);
-    *totalBytesRead += bytesRead;
-    queue.push(buffer.splitAt(bytesRead));
-    auto status = fileStatus(fd);
-    if (status != FileStatus::Continue) {
-      return status;
-    }
-  }
-  return FileStatus::Continue;
-}
-
-std::uint64_t asyncCompressChunks(
-    SharedState& state,
-    WorkQueue>& chunks,
-    ThreadPool& executor,
-    FILE* fd,
-    std::uintmax_t size,
-    size_t numThreads,
-    ZSTD_parameters params) {
-  auto chunksGuard = makeScopeGuard([&] { chunks.finish(); });
-  std::uint64_t bytesRead = 0;
-
-  // Break the input up into chunks of size `step` and compress each chunk
-  // independently.
-  size_t step = calculateStep(size, numThreads, params);
-  state.log(DEBUG, "Chosen frame size: %zu\n", step);
-  auto status = FileStatus::Continue;
-  while (status == FileStatus::Continue && !state.errorHolder.hasError()) {
-    // Make a new input queue that we will put the chunk's input data into.
-    auto in = std::make_shared();
-    auto inGuard = makeScopeGuard([&] { in->finish(); });
-    // Make a new output queue that compress will put the compressed data into.
-    auto out = std::make_shared();
-    // Start compression in the thread pool
-    executor.add([&state, in, out, step] {
-      return compress(
-          state, std::move(in), std::move(out), step);
-    });
-    // Pass the output queue to the writer thread.
-    chunks.push(std::move(out));
-    state.log(VERBOSE, "%s\n", "Starting a new frame");
-    // Fill the input queue for the compression job we just started
-    status = readData(*in, ZSTD_CStreamInSize(), step, fd, &bytesRead);
-  }
-  state.errorHolder.check(status != FileStatus::Error, "Error reading input");
-  return bytesRead;
-}
-
-/**
- * Decompress a frame, whose data is streamed into `in`, and stream the output
- * to `out`.
- *
- * @param state        The shared state
- * @param in           Queue that we `pop()` input buffers from. It contains
- *                      exactly one compressed frame.
- * @param out          Queue that we `push()` decompressed output buffers to
- */
-static void decompress(
-    SharedState& state,
-    std::shared_ptr in,
-    std::shared_ptr out) {
-  auto& errorHolder = state.errorHolder;
-  auto guard = makeScopeGuard([&] { out->finish(); });
-  // Initialize the DCtx
-  auto ctx = state.dStreamPool->get();
-  if (!errorHolder.check(ctx != nullptr, "Failed to allocate ZSTD_DStream")) {
-    return;
-  }
-  {
-    auto err = ZSTD_resetDStream(ctx.get());
-    if (!errorHolder.check(!ZSTD_isError(err), ZSTD_getErrorName(err))) {
-      return;
-    }
-  }
-
-  const size_t outSize = ZSTD_DStreamOutSize();
-  Buffer inBuffer;
-  size_t returnCode = 0;
-  // Read a buffer in from the input queue
-  while (in->pop(inBuffer) && !errorHolder.hasError()) {
-    auto zstdInBuffer = makeZstdInBuffer(inBuffer);
-    // Decompress the whole buffer and send it to the output queue
-    while (!inBuffer.empty() && !errorHolder.hasError()) {
-      // Allocate a buffer with at least outSize bytes.
-      Buffer outBuffer(outSize);
-      auto zstdOutBuffer = makeZstdOutBuffer(outBuffer);
-      // Decompress
-      returnCode =
-          ZSTD_decompressStream(ctx.get(), &zstdOutBuffer, &zstdInBuffer);
-      if (!errorHolder.check(
-              !ZSTD_isError(returnCode), ZSTD_getErrorName(returnCode))) {
-        return;
-      }
-      // Pass the buffer with the decompressed data to the output queue
-      out->push(split(outBuffer, zstdOutBuffer));
-      // Advance past the input we already read
-      advance(inBuffer, zstdInBuffer);
-      if (returnCode == 0) {
-        // The frame is over, prepare to (maybe) start a new frame
-        ZSTD_initDStream(ctx.get());
-      }
-    }
-  }
-  if (!errorHolder.check(returnCode <= 1, "Incomplete block")) {
-    return;
-  }
-  // We've given ZSTD_decompressStream all of our data, but there may still
-  // be data to read.
-  while (returnCode == 1) {
-    // Allocate a buffer with at least outSize bytes.
-    Buffer outBuffer(outSize);
-    auto zstdOutBuffer = makeZstdOutBuffer(outBuffer);
-    // Pass in no input.
-    ZSTD_inBuffer zstdInBuffer{nullptr, 0, 0};
-    // Decompress
-    returnCode =
-        ZSTD_decompressStream(ctx.get(), &zstdOutBuffer, &zstdInBuffer);
-    if (!errorHolder.check(
-            !ZSTD_isError(returnCode), ZSTD_getErrorName(returnCode))) {
-      return;
-    }
-    // Pass the buffer with the decompressed data to the output queue
-    out->push(split(outBuffer, zstdOutBuffer));
-  }
-}
-
-std::uint64_t asyncDecompressFrames(
-    SharedState& state,
-    WorkQueue>& frames,
-    ThreadPool& executor,
-    FILE* fd) {
-  auto framesGuard = makeScopeGuard([&] { frames.finish(); });
-  std::uint64_t totalBytesRead = 0;
-
-  // Split the source up into its component frames.
-  // If we find our recognized skippable frame we know the next frames size
-  // which means that we can decompress each standard frame in independently.
-  // Otherwise, we will decompress using only one decompression task.
-  const size_t chunkSize = ZSTD_DStreamInSize();
-  auto status = FileStatus::Continue;
-  while (status == FileStatus::Continue && !state.errorHolder.hasError()) {
-    // Make a new input queue that we will put the frames's bytes into.
-    auto in = std::make_shared();
-    auto inGuard = makeScopeGuard([&] { in->finish(); });
-    // Make a output queue that decompress will put the decompressed data into
-    auto out = std::make_shared();
-
-    size_t frameSize;
-    {
-      // Calculate the size of the next frame.
-      // frameSize is 0 if the frame info can't be decoded.
-      Buffer buffer(SkippableFrame::kSize);
-      auto bytesRead = std::fread(buffer.data(), 1, buffer.size(), fd);
-      totalBytesRead += bytesRead;
-      status = fileStatus(fd);
-      if (bytesRead == 0 && status != FileStatus::Continue) {
-        break;
-      }
-      buffer.subtract(buffer.size() - bytesRead);
-      frameSize = SkippableFrame::tryRead(buffer.range());
-      in->push(std::move(buffer));
-    }
-    if (frameSize == 0) {
-      // We hit a non SkippableFrame, so this will be the last job.
-      // Make sure that we don't use too much memory
-      in->setMaxSize(64);
-      out->setMaxSize(64);
-    }
-    // Start decompression in the thread pool
-    executor.add([&state, in, out] {
-      return decompress(state, std::move(in), std::move(out));
-    });
-    // Pass the output queue to the writer thread
-    frames.push(std::move(out));
-    if (frameSize == 0) {
-      // We hit a non SkippableFrame ==> not compressed by pzstd or corrupted
-      // Pass the rest of the source to this decompression task
-      state.log(VERBOSE, "%s\n",
-          "Input not in pzstd format, falling back to serial decompression");
-      while (status == FileStatus::Continue && !state.errorHolder.hasError()) {
-        status = readData(*in, chunkSize, chunkSize, fd, &totalBytesRead);
-      }
-      break;
-    }
-    state.log(VERBOSE, "Decompressing a frame of size %zu", frameSize);
-    // Fill the input queue for the decompression job we just started
-    status = readData(*in, chunkSize, frameSize, fd, &totalBytesRead);
-  }
-  state.errorHolder.check(status != FileStatus::Error, "Error reading input");
-  return totalBytesRead;
-}
-
-/// Write `data` to `fd`, returns true iff success.
-static bool writeData(ByteRange data, FILE* fd) {
-  while (!data.empty()) {
-    data.advance(std::fwrite(data.begin(), 1, data.size(), fd));
-    if (std::ferror(fd)) {
-      return false;
-    }
-  }
-  return true;
-}
-
-std::uint64_t writeFile(
-    SharedState& state,
-    WorkQueue>& outs,
-    FILE* outputFd,
-    bool decompress) {
-  auto& errorHolder = state.errorHolder;
-  auto lineClearGuard = makeScopeGuard([&state] {
-    state.log.clear(INFO);
-  });
-  std::uint64_t bytesWritten = 0;
-  std::shared_ptr out;
-  // Grab the output queue for each decompression job (in order).
-  while (outs.pop(out)) {
-    if (errorHolder.hasError()) {
-      continue;
-    }
-    if (!decompress) {
-      // If we are compressing and want to write skippable frames we can't
-      // start writing before compression is done because we need to know the
-      // compressed size.
-      // Wait for the compressed size to be available and write skippable frame
-      SkippableFrame frame(out->size());
-      if (!writeData(frame.data(), outputFd)) {
-        errorHolder.setError("Failed to write output");
-        return bytesWritten;
-      }
-      bytesWritten += frame.kSize;
-    }
-    // For each chunk of the frame: Pop it from the queue and write it
-    Buffer buffer;
-    while (out->pop(buffer) && !errorHolder.hasError()) {
-      if (!writeData(buffer.range(), outputFd)) {
-        errorHolder.setError("Failed to write output");
-        return bytesWritten;
-      }
-      bytesWritten += buffer.size();
-      state.log.update(INFO, "Written: %u MB   ",
-                static_cast(bytesWritten >> 20));
-    }
-  }
-  return bytesWritten;
-}
-}
diff --git a/priv/zstd/contrib/pzstd/Pzstd.h b/priv/zstd/contrib/pzstd/Pzstd.h
deleted file mode 100644
index 79d1fcc..0000000
--- a/priv/zstd/contrib/pzstd/Pzstd.h
+++ /dev/null
@@ -1,150 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "ErrorHolder.h"
-#include "Logging.h"
-#include "Options.h"
-#include "utils/Buffer.h"
-#include "utils/Range.h"
-#include "utils/ResourcePool.h"
-#include "utils/ThreadPool.h"
-#include "utils/WorkQueue.h"
-#define ZSTD_STATIC_LINKING_ONLY
-#include "zstd.h"
-#undef ZSTD_STATIC_LINKING_ONLY
-
-#include 
-#include 
-#include 
-
-namespace pzstd {
-/**
- * Runs pzstd with `options` and returns the number of bytes written.
- * An error occurred if `errorHandler.hasError()`.
- *
- * @param options      The pzstd options to use for (de)compression
- * @returns            0 upon success and non-zero on failure.
- */
-int pzstdMain(const Options& options);
-
-class SharedState {
- public:
-  SharedState(const Options& options) : log(options.verbosity) {
-    if (!options.decompress) {
-      auto parameters = options.determineParameters();
-      cStreamPool.reset(new ResourcePool{
-          [this, parameters]() -> ZSTD_CStream* {
-            this->log(VERBOSE, "%s\n", "Creating new ZSTD_CStream");
-            auto zcs = ZSTD_createCStream();
-            if (zcs) {
-              auto err = ZSTD_initCStream_advanced(
-                  zcs, nullptr, 0, parameters, 0);
-              if (ZSTD_isError(err)) {
-                ZSTD_freeCStream(zcs);
-                return nullptr;
-              }
-            }
-            return zcs;
-          },
-          [](ZSTD_CStream *zcs) {
-            ZSTD_freeCStream(zcs);
-          }});
-    } else {
-      dStreamPool.reset(new ResourcePool{
-          [this]() -> ZSTD_DStream* {
-            this->log(VERBOSE, "%s\n", "Creating new ZSTD_DStream");
-            auto zds = ZSTD_createDStream();
-            if (zds) {
-              auto err = ZSTD_initDStream(zds);
-              if (ZSTD_isError(err)) {
-                ZSTD_freeDStream(zds);
-                return nullptr;
-              }
-            }
-            return zds;
-          },
-          [](ZSTD_DStream *zds) {
-            ZSTD_freeDStream(zds);
-          }});
-    }
-  }
-
-  ~SharedState() {
-    // The resource pools have references to this, so destroy them first.
-    cStreamPool.reset();
-    dStreamPool.reset();
-  }
-
-  Logger log;
-  ErrorHolder errorHolder;
-  std::unique_ptr> cStreamPool;
-  std::unique_ptr> dStreamPool;
-};
-
-/**
- * Streams input from `fd`, breaks input up into chunks, and compresses each
- * chunk independently.  Output of each chunk gets streamed to a queue, and
- * the output queues get put into `chunks` in order.
- *
- * @param state        The shared state
- * @param chunks       Each compression jobs output queue gets `pushed()` here
- *                      as soon as it is available
- * @param executor     The thread pool to run compression jobs in
- * @param fd           The input file descriptor
- * @param size         The size of the input file if known, 0 otherwise
- * @param numThreads   The number of threads in the thread pool
- * @param parameters   The zstd parameters to use for compression
- * @returns            The number of bytes read from the file
- */
-std::uint64_t asyncCompressChunks(
-    SharedState& state,
-    WorkQueue>& chunks,
-    ThreadPool& executor,
-    FILE* fd,
-    std::uintmax_t size,
-    std::size_t numThreads,
-    ZSTD_parameters parameters);
-
-/**
- * Streams input from `fd`.  If pzstd headers are available it breaks the input
- * up into independent frames.  It sends each frame to an independent
- * decompression job.  Output of each frame gets streamed to a queue, and
- * the output queues get put into `frames` in order.
- *
- * @param state        The shared state
- * @param frames       Each decompression jobs output queue gets `pushed()` here
- *                      as soon as it is available
- * @param executor     The thread pool to run compression jobs in
- * @param fd           The input file descriptor
- * @returns            The number of bytes read from the file
- */
-std::uint64_t asyncDecompressFrames(
-    SharedState& state,
-    WorkQueue>& frames,
-    ThreadPool& executor,
-    FILE* fd);
-
-/**
- * Streams input in from each queue in `outs` in order, and writes the data to
- * `outputFd`.
- *
- * @param state        The shared state
- * @param outs         A queue of output queues, one for each
- *                      (de)compression job.
- * @param outputFd     The file descriptor to write to
- * @param decompress   Are we decompressing?
- * @returns            The number of bytes written
- */
-std::uint64_t writeFile(
-    SharedState& state,
-    WorkQueue>& outs,
-    FILE* outputFd,
-    bool decompress);
-}
diff --git a/priv/zstd/contrib/pzstd/README.md b/priv/zstd/contrib/pzstd/README.md
deleted file mode 100644
index 84d9458..0000000
--- a/priv/zstd/contrib/pzstd/README.md
+++ /dev/null
@@ -1,56 +0,0 @@
-# Parallel Zstandard (PZstandard)
-
-Parallel Zstandard is a Pigz-like tool for Zstandard.
-It provides Zstandard format compatible compression and decompression that is able to utilize multiple cores.
-It breaks the input up into equal sized chunks and compresses each chunk independently into a Zstandard frame.
-It then concatenates the frames together to produce the final compressed output.
-Pzstandard will write a 12 byte header for each frame that is a skippable frame in the Zstandard format, which tells PZstandard the size of the next compressed frame.
-PZstandard supports parallel decompression of files compressed with PZstandard.
-When decompressing files compressed with Zstandard, PZstandard does IO in one thread, and decompression in another.
-
-## Usage
-
-PZstandard supports the same command line interface as Zstandard, but also provides the `-p` option to specify the number of threads.
-Dictionary mode is not currently supported.
-
-Basic usage
-
-    pzstd input-file -o output-file -p num-threads -#          # Compression
-    pzstd -d input-file -o output-file -p num-threads          # Decompression
-
-PZstandard also supports piping and fifo pipes
-
-    cat input-file | pzstd -p num-threads -# -c > /dev/null
-
-For more options
-
-    pzstd --help
-
-PZstandard tries to pick a smart default number of threads if not specified (displayed in `pzstd --help`).
-If this number is not suitable, during compilation you can define `PZSTD_NUM_THREADS` to the number of threads you prefer.
-
-## Benchmarks
-
-As a reference, PZstandard and Pigz were compared on an Intel Core i7 @ 3.1 GHz, each using 4 threads, with the [Silesia compression corpus](http://sun.aei.polsl.pl/~sdeor/index.php?page=silesia).
-
-Compression Speed vs Ratio with 4 Threads | Decompression Speed with 4 Threads
-------------------------------------------|-----------------------------------
-![Compression Speed vs Ratio](images/Cspeed.png "Compression Speed vs Ratio") | ![Decompression Speed](images/Dspeed.png "Decompression Speed")
-
-The test procedure was to run each of the following commands 2 times for each compression level, and take the minimum time.
-
-    time pzstd -# -p 4    -c silesia.tar     > silesia.tar.zst
-    time pzstd -d -p 4    -c silesia.tar.zst > /dev/null
-
-    time pigz  -# -p 4 -k -c silesia.tar     > silesia.tar.gz
-    time pigz  -d -p 4 -k -c silesia.tar.gz  > /dev/null
-
-PZstandard was tested using compression levels 1-19, and Pigz was tested using compression levels 1-9.
-Pigz cannot do parallel decompression, it simply does each of reading, decompression, and writing on separate threads.
-
-## Tests
-
-Tests require that you have [gtest](https://github.com/google/googletest) installed.
-Set `GTEST_INC` and `GTEST_LIB` in `Makefile` to specify the location of the gtest headers and libraries.
-Alternatively, run `make googletest`, which will clone googletest and build it.
-Run `make tests && make check` to run tests.
diff --git a/priv/zstd/contrib/pzstd/SkippableFrame.cpp b/priv/zstd/contrib/pzstd/SkippableFrame.cpp
deleted file mode 100644
index 769866d..0000000
--- a/priv/zstd/contrib/pzstd/SkippableFrame.cpp
+++ /dev/null
@@ -1,30 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "SkippableFrame.h"
-#include "mem.h"
-#include "utils/Range.h"
-
-#include 
-
-using namespace pzstd;
-
-SkippableFrame::SkippableFrame(std::uint32_t size) : frameSize_(size) {
-  MEM_writeLE32(data_.data(), kSkippableFrameMagicNumber);
-  MEM_writeLE32(data_.data() + 4, kFrameContentsSize);
-  MEM_writeLE32(data_.data() + 8, frameSize_);
-}
-
-/* static */ std::size_t SkippableFrame::tryRead(ByteRange bytes) {
-  if (bytes.size() < SkippableFrame::kSize ||
-      MEM_readLE32(bytes.begin()) != kSkippableFrameMagicNumber ||
-      MEM_readLE32(bytes.begin() + 4) != kFrameContentsSize) {
-    return 0;
-  }
-  return MEM_readLE32(bytes.begin() + 8);
-}
diff --git a/priv/zstd/contrib/pzstd/SkippableFrame.h b/priv/zstd/contrib/pzstd/SkippableFrame.h
deleted file mode 100644
index 60deed0..0000000
--- a/priv/zstd/contrib/pzstd/SkippableFrame.h
+++ /dev/null
@@ -1,64 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "utils/Range.h"
-
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-/**
- * We put a skippable frame before each frame.
- * It contains a skippable frame magic number, the size of the skippable frame,
- * and the size of the next frame.
- * Each skippable frame is exactly 12 bytes in little endian format.
- * The first 8 bytes are for compatibility with the ZSTD format.
- * If we have N threads, the output will look like
- *
- * [0x184D2A50|4|size1] [frame1 of size size1]
- * [0x184D2A50|4|size2] [frame2 of size size2]
- * ...
- * [0x184D2A50|4|sizeN] [frameN of size sizeN]
- *
- * Each sizeX is 4 bytes.
- *
- * These skippable frames should allow us to skip through the compressed file
- * and only load at most N pages.
- */
-class SkippableFrame {
- public:
-  static constexpr std::size_t kSize = 12;
-
- private:
-  std::uint32_t frameSize_;
-  std::array data_;
-  static constexpr std::uint32_t kSkippableFrameMagicNumber = 0x184D2A50;
-  // Could be improved if the size fits in less bytes
-  static constexpr std::uint32_t kFrameContentsSize = kSize - 8;
-
- public:
-   // Write the skippable frame to data_ in LE format.
-  explicit SkippableFrame(std::uint32_t size);
-
-  // Read the skippable frame from bytes in LE format.
-  static std::size_t tryRead(ByteRange bytes);
-
-  ByteRange data() const {
-    return {data_.data(), data_.size()};
-  }
-
-  // Size of the next frame.
-  std::size_t frameSize() const {
-    return frameSize_;
-  }
-};
-}
diff --git a/priv/zstd/contrib/pzstd/images/Cspeed.png b/priv/zstd/contrib/pzstd/images/Cspeed.png
deleted file mode 100644
index aca4f663ea2e98b6df7c1344b51af99757549d8a..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 69804
zcmeFZWn5I<_Xi5dAi{&7f~ce-B8}1@VbG~`BOwivLk%!s)7^r^&|T7?G}0XdC?$==
zAbt0M0nhKbFYlZC`M(fh_MCI}Uh&;)eb?IOt-P!l0p2w{3=9kc3GqiyFfg#cU|^gv
z#Ki%hcwiW|g8wjWpNKuc$ZjW}1Am-*F0N*afkAo^{SVV9t{Yq;j3M#pzM>=MBJx}e
zxnb<#kMYsq<~xziGC>l!61X;Aw{Jee!t}iHIw3oouEjZ*Dc?-_hhyn{wmYkQ0EwCw
zp>o}(?ge>j;VD1Ti`3*2;#iTRjb9AzZVesoD5uIon&ZlU-r^<}_LrcET>SqSq;>^kp9W?N|LaQX
zw-}fOH+dEx{O{C>aO1$(>LxF<=zk1~-w>{0I(NSOzZU(84ve|NWWE1uH9@#UY*L<|
zS^h04v>;Z`5wYRx#P#U?*Wmvx@&Er?O#W(i_piAH;b*EBwQyOE8hewn7AwdJa5_Ch
z-3WLk41-nfuZ33^rl&LPHoEUMa`^ot+s{_mmBamWbXDOg85S-zktQbAv)UzoQ$Gx>
z>lckJEQ(ZgV13$7(#X|UTNCF$_&J$XQE^XxKhV`6nZLmZ(SNN+}IOW?j(M!qU+H1^Jxm-}@R?EE=bzWJ4=2TYc6sGAk?}5h_L#fDw1Mif1+6}sorn1ES-c9W81LpfKP2A@P;hSP+&K-8P|7G&Z)247j)9U|2Z9?h
zZPp>ricN%DoEvEf@
zwd4MRj@8aNz3v@Jy!_tY-ob$?6lXNs(+7oDqY{$MWD}_*wi%z-LP!Ur$2Jhgkdcv*
zrCFiFQh~kI&z2MG?uT3MOZrs1s&(V!^oXe4USahA_Y)+=8(7~LX
zdp@a-YZpNbC2XS$H5Dv}aBWFbNEs%rT78MRZB;gR3mOvZc5b4?y#~|#csru5L2GW*
zNs$5*8&73|wEE{uGNvA@AJuE2IfFh|*>O0ObyNkno8_YVQ@VB@-NeqP%{A${Rg#)4
z72W`8EqqKvE+@3VVIKR=MpRrF|I6WLp*^oGo$4`)59ym};x8HFJ+>@LkTYEJJ*c^r
zPfKR%uP}gt2k-+QE-gqlK$|`doK)MfHWr2O>JU0~9oJPeul36EO@3^u{#sNaFDg13
zX#$U8v2CGG`RHBJ81`Xy7qwI%wD*;8+1a>^Jzg}+gn)&4C!1A=&%YnhMQX*m59D7|
zy*JIetVp#qup{1+BDdurMpc<#c~4zl-3&9$T;@{ugI;xii}o1aF8vC+u{`w@naysy
zT9=i|0gC2?y%pzya%pe1##==$pI;FyKNyI5mo#TmCgDlBAB12s;dq55qRv*CpWhvO
z;5-v)RMx|w?=QibBO2ADK!bfYIsswxdPJ`5+>6UZ1L7BDO4ofjAKVO1LZy+@YMn{D
zl@nL7p3>8pH!EJUQlZbzE9(%oQ{lA!Yzu)SMqwYadl12Ei%>CF_pjbxvO;dX%kHV|
zCowlMxr3CDoBQU?>Nj@pdfx&=7T&f&KL@|eT)&a$&TVUk5>cXg^==o1707hg#=Rmj
zn*NJc*H$|p64v`NDPSBfm#;W5!~!m$Sy}rxU77T9{oU_z&K-?^0p?57=UUv40?
zvOA-r{gqEyCz})N*-*aW*t4xJe&x+>KK1dv8SX?lc~(ktd_pnfocEUwHxxS*#ti*z
z=6(-s2A11a?z_*=6L5#hCeL3kwz1Dme0O-SwthIoh_deiEHrdAe|Z}vi&4T
zMNz-1Ia0|gRwa>;G40m;2D{HlD6KcoMaidENNgdqpw9}g+I2~S3=`?j=xB75bC?hpBSBj;yt}VFT
zepf8O=7Oe->-U
zQBe2_gox&jZsfke&keM6x0aEXkx@2R%N-Qc>AHuF#*94++WA@uv`s>St6ms?aPSTI
zx#fNc?MWDSqsiWw7B%ZJ7D%9#3LAV&_x`(|YbUAn{>&keK{Zk&jzqpIm3g}BMkije
zy`9}hZfbd9Ca&AleOeZ~AZS>e=`k*v^cNZ{l+iIS3fLobTRj6sGR3mrF?r-urD|Fj
zE$T)uj#_JFE%%mlak5w8hII9gRqvKp+j@DnoH)yFh%IXspU
zJq5#HfMvJK{aQ9HFXzKLzlM#LClhLO1Xhj@3$5~6rSWQPl4`q2OnM;Rb56Zl+E06EIPS_D8$$9a|F2ba
zdft8F>Xq)Bk;xd(zUgh?r8-H_a9mnQ+s6w_BcO}53kvVsvgSD-w>vsJYDOEq@^mv0
zYt0I_pt1h#6-{LE9hJE4Iqg~P6vA0s{iLx;Z7ruq=m?<645W}*)s$0hzQ6n4q_wx(f>dUI(i4nF)wBZ%<71@bgX`a=ay*%aXOXlrm<%xMeo}eJ
znGg>31&S3%u?=}xsq*RrOzyt>I;xj~J@ulnHitUgxGagIS`PPSg;sFJ0GtVqPx$yL
zQDj%`n2wjT&!2~-M`Kaw>~x2ZvhI#;bMig9&%x}RJ*U?i&gzfDzG0{~SGfYqA*<=J
z^-b+2H7@GF4>NJ$a|(6O4QX>zFSRj@37^mEg74&~(HG#kCPj0Y%Jr<-RbZVT|JlGj
zYIdI{fp|(f?C#v8^e#)!Br&l-IjdKG)9uGLqS4s_opWF?NxZsmHYnpOBUS|I>+Sp<1c^~ZPuT7!iihmArv=hz
zOVZ^)zv%i8&C|)a%aHq~)TDBYaHVF2)+NmazpcH?DrX+Ac)!;?#T+21Grj6e
z-w?jC<8GmB(r9JJxvX-;Q_pyYlW13!b#Be>^W!IsM
z)SiuWvz(e2cuxqEqCh9b4@i0TWa2wDBzMt&Vc;4YybI^pr$Hu(WQPX%GQ1-o`sXs+
zdX;h6%SzO1PYdm}{+nys3y*7QS>-1o`+8e09s4c)f?2TXf|>WS+STigmaWP{v^cF5wvLIHIP-7!B%w@`0uZ&P
z1Y9evC5T!2_$i3{UW;6bKl>biEO*ajh444sS|TmFNS2S;9w9-Z(kAJ8=4+nDMlsf+
zb}cqsIT?et^wbCs`9%sllGGmY)cN`O!AyDqe`dNoEqW5RM+hJ@J-I~cs-SE&UxxMW
z^$wvGL4mDNTcn$^@I$yWtBEh8Z3qyat@G6={R=Qq)@@xz0yrGe^$BK~0+9fW@My|j3{wT4)p8IkN=
ziIg?b9h2+(UvEKFIMhXI*_q!Q)|?^y2$kK-Iox4|CW)F;+o#%YZ(1W@;d9n^e~4b9
zb&30@FRT{DC~rMtQBn$5K|T`haStVqQKlB9ci=;48%>ry;mwmsJW~l!f@#cky$ul`
zVj1;=>hK3uSC>*=qhklB=PKAEpL?<54K_LF3g<(=Jg2nXeBW949Kxswh178%6(wq=
zX(0}MtYrvJ->wBxD?Y^Xr)Y1pI)QB>cgK~dE9|g0i_40Rz8@7`gf>195`+q{qEfmW
zG+k$0eC1~OsFsgVLYv?580BLD%8w2`xr;{mKo2aUs2d^6g(-v70sUmxnC9@`^lv|r
zmr`(Cqcy>f2F*l)=}hW-
z2GcMSvF_k?8b698Wm^{wpWEpT$sG*wU0^7#sGC)Z-z{vT&-OMGQIBC+LFbPZR}i54P|${QE9QZv+cfqc0O%nFJ>dF4*QCw
zv)8`@Pu~%sd?A?V2TW9$2;_~Byn$49EL`G34^p;~JpI@FpJ@8hp5`S&D_F(cqolJS~QXt9tpLlxVV~V2k*j~7DSAYf8UXYcQ<<>`z;__8|
zf*}e;_Tnrr_HxQMOmUfgkAw4>aEk?{yi$m5!9H#PS&@>hm
zP3xERx>HDIMTKic%%t?;E9Yd=6lYF0O{msY19F*}Nw{cQNA
z9gnTRj--ldH5?$y|2^9w?bg267}>cXrhp6Oy5*ktfw|~veRJYWZ3YinV{WT=BM%7$h|60m_+3mB
z5fi4w2vR2RR-QU<=~0{Q_pANXJ*;>eS0`l}H~OE3lt9nm_%f}FM$NH{E8Jz5iR3YG
zW}!&oGM@UTD>TNLv+%^pj=M+E{VIEm^Yr|n^!Opz8iw{po2Fgvsf>kqgTVQPl81+y
zs>^!^8V}(yycj^!EOXpYS`8GVyp!d{q1wH1O@^x1n2Od4bGMPwvG`aaC&XYTONmQ$>_hPaeg(AT^I-j_
zeLpF%)4B?7DLj1W#h>4mVfHPt-?cl0i?-wT9l0`CjLEp6bIj}^K)=2%^)BQp;G1Fw
zGedM3pD#g7IY@fQv>ZU<5{-D49CWud`xS#qkLl)iLK0_-or*TANqPde$OwM673u01baoU^md_TA~d}7qbJtJjo_`r=h?O^*V_7z&_{}Yr%1k24=g6ANgLsHkUL}>&rc6?1EafmdkQ>TIzY_&058i$dI;V
z>R&ZDZr3BzMXhK4^xD&exiIbS-VCa}iL+<=y%msCSxKxBl51+
zTWl0M$TPuKUUar88=2S~&{-*#z8^YRG@%zAZAoR+4dv58G|s&`FIiUlVn@g98a=&k
z(j3A$?jLR^1y+0HJv1?7JytxJU*M!wAI3jui=Wij#BwZ+}u}cw@k^sfS{*TbwP;(wcX)9R#_0c
zOr7%h=}s3#XGM9HlTxSEP-Rh5;hS~9W11e(8Jod^KiJh2;<)lj)-<(Grt)LFAkX(hKCxk_!11)M9*2uhSiY)X7PvH218N*n8
zIa)bPe3^Wy1Ea@2-(AONd$wLCnVhX&Af@ob?zJXz>Jxr^nj52X=5s5DJirK-ueC5D
zqe;KR5^K`3F_F>+xzT~f>1kMAWukTuF`Y~~5|syLZ{pNlv@LOjOgG;_!i*r
z?mnKp0*EwSZ0y2YZNN+IxiJde_MNv{Q~G_?g^gbuQB83GE-K`tFLvbEO9h?eD4{z
zE&@_r$=^z!)9+HYnBSUUAw!qbvNgXT;5@rQY1=24H;dZ&%x}ctZ{_%zY}BK%a%*e>
zM~j4K1EJd@va1AT6<<(!1_JxL-Anu{6_MmA@#{kSJwlQFY2C!akSD!cQFxirqNy;`
z>Y$RDaA=hxm0|K$%5qhDl5Qm8(Jh2sPDb6NzRp6-&f^*dGo@|XBCQonB)vjntsM;x
z@|=RilCn#m1FU&~fX$A8{taw9{O&VPKoYK!HMUfM&yQo$}H`
z_?*j)yqLOy_1O;S!iR~9VRyhx-h5`g+eijWuL?@kS({%LxHZ%K%By9grDIAUMm5De
zY*tHUEOES4uVc38GizK4Yo70z!%EkRs+9(CFX^0hX(8_XZOX0THkzZ5wh5P*_wynR
zU#KX1z)>A;O+^@v?>pETj*nDg`62a6r>#=IP%g0)XZPZFij1!7JD={U4n>tA=tIW%
z1jek#5&<8P9xiJ9z4c`{hsa9#_DJkE*9`T!5fhlIP
zwf?m&WR_Ho%C};xS{tnAU1)t(-^yHzAn14gN3Ir;-JKn=L{$p@T6%78LD*sEB&mnyL{8`o2
zR0M#sf(x6RZ%GpWAK5p3sM)I85^z~-rn6}9x$3aLIWW5_P3$Yo1G)0_a=Tkf-zkg3
zz``VP{Q8n~RCfrtS5`_2U3^yjFz!?dFw(tcD%02hG8tjT_?(;$x1FB2VKt*zLv$u+
zIeQK`vb?HF9uFiE++g7fCEFz#=w8+
z6L(58zM^8Z3X}t*MMLUuAu)t|1akmo9DPS$bdlvfjYka|xRT&fz~_HsMN?6YCj=iS
zMsM%u4`pTLXN}~xUp!!-ati-?4*MHRejqnM4wognyVdD5}Djs>!+auh)|NP6E
z(0}R@1B~>=;!8QAXinY$j5g^2!1}){|4%~yA6kN>*w>hti>EDbxq^>7$#dR})>LI8f3D>l&;8DO4?X&t4fJP$YoNAc#Mea3uNRUTvZ
zX7rYQgc~KY(|}Q>S8Zu9|KolI+RQ~IJ?JB8Xxp4lc?~AEG)?QCr(qrkUJ||kS`Zk7
zcM*ZQ^R@YyOQ$A@o92OdddrV#JyD)=nid^~C0+-mOO9S%x>L~x(G$!pwJ=k_D5V<)
zp#w#65rFLsl2i9jI4j!M-g%VNxHG&=4(1MBYeFZ+Nem#)P@-Qu3h_?HHDK%onw_{^
z7Abmq)8D?%mVvlC{Vpk(d-_518}v=6!A&4H^Z#|df!GAW`mH3*&Trd&^s}_+v>^a3
z&7s~TrhnnceF$IK?xIyrvFgo>S2_Gk60?gx0X6*4UPIsCCslav&3oVAe@*hmllZKR
zjwveSWs>L=Uv7uoOHq~QFphVMnT$8Mfp?Hw!1Q)dz-oH?X+NX2+?0<%
zX>YmGwlmLW^BIN3a&d2#8~BNf@Ph4~dV)r{=F8caXaN8j{`nD!Z*K9u(2B<_jAC)o
z7N6es@=Ep0=#ay=Me9h?7WCFsgA34}?7q3|%ahmP5|`D?R8lM>*+$BDkqG6G%canY
zd(RpMA6W4%J;Z=xfzVr7I95X8l#tQE1&M7=yx~Pjg+BOc^2o=N*>Mk!S%aWGaLwGDh&ie_m-}tpO(y2dCljA
z=*334#ry$1LoVdGAQ9f>Z3G=iR
zmmxO--|T;h^xUq&_w5R%;I_@&Uw10VN+{$h^QA+}`8u#@#uwU21g9@N57~*;9rC9f
zH}to>M$MG4XqFVJ-T?i0q{6r!Pc7c6MkST50$f{WZ>u;tRpX
zuy^b7BbA?M5+fTf0k??{0GlMq6RYmar+vs9O8~a-&@)egvV%z#_7+^0E%axKeOfPq
z-I{Rw-hB+XCur(Xey%0yby_Z8@$EKIBLsw&1@`>I2`^(0%dWW`UhTaYhmv_R;S$}@cq|w5PSmkjfK@V1jU`*0UR@Mc
zRxAwFwp%hBwjbL?Gj2UkT)r_y-!%Xx2>RNzfDe4wVgrr@?DJ2A^n}=W`Fl~$cu8L|
zr-O*UGTg{hc
z(}YgyiQfV9e=sL8jP`}U4>X|8T^A0AwVey&EZQm)3nz}&vTtYNw^)AhkK`l~T5)V>
z#fb`a$q!n>!D=k>68=CB9@ji28&uB;yuawaED-ra^
z#1O6}3+VDIHLE4${_=%T!+KQOy3xoT_6CG1))4v|pGd%kA7N6hr!K_QfrmR34Q&#d
z7qq{BSeu`|rnkERvFCC(4YhLPLT_?UfuUS3rc9|ku{vrZQ}}Fg$uN|1^qBzc!oX8k
z!?#+yGrU|zPYhGFjM1C`5hK|Dl)a8S$bMfcjETRu+2@6db04&Xy~YU}s!M;eJE}1=
zc;ONw-p4);blN4Z12nPojQq4bv1R{_Lo+z72-(|&ni{EW;Bf(FK<}lO5gm&@8?8J%
zsxjgM4p@Hm+Wxj-tn2ZChHka_gDs>aB&GKYXy{aijbe0%c#J-{qe0H2W&*3;YekRn
zq%{G6sKPhC_Uu~|Fg!+M)T_i>L`>_SkNTIG|hfZXReMJ{==Ofav;N%D6$M@u>#MMik&64nP4)6!{2IF@RYI2aT)Cx3Cu
z)~8DyjPx$Z3~`y!HJ*T*vXOp8aD;3(taaWx$4
z)RjbRaOPdU#fH9-tPe$vi$y$YA|`?Mo1(573A#fqB=*YcLHAN;T-eA!?E2p+9B%f}
z&ehLZo>g-A{P|+grIf*BI=SN4+~m2O(NS&XWQcyI9u8?=CK}btqk<_jfY@6D>lGb~
zVLu%en&8`Qp+@8e7V{gqxWxRk7+8ztn4(SS27I99jW%ns``
z{F#;ILh1+IkUod)psUK-Q9BfO6VI+=qra^y4&3G8#Xxiu(O-YL;siesuUmF?jzg9@
zxNl4)*NdPI*bzf(`VkISMZTi(HQ)@mkXJbQG-IR7gT)+M>9GEp-yG>zY
zo%l;4!so5!B>FlJVM~B_(+#0dPUj3h*u{$rxnwF|ALX;%4o
z8&3{Q4o;4@Y7+fW^WEvlr2B%SBPl~7Nu{hSgW!uUtgSG3p+T(V$FXn>(21uHyV2=P!4-lkwj1#!v?u`x-L(&F
z(ZRPsd#Lx^beF}^hDCIR7YK*Os4en@Ou+(p;6WSsFNS>;UI7{Ji?kG9Gum57@rEM=5~+*>`b
zQIg2az-D5ernMwpd(X5b;kWUKv(KGRJ@EBke-XN9u}VuPQ`{;Wt5+`~@<%W*AehAQv%SAj@M!vYs`2F|
z<8Eco!Uc-+c!yiidk+Y19Bhz3f6sKvAIx-b4&U??O$ND@Tar9t>1teVVe#FkI1?mB
z+1CAxASk_e9EV|GZKH|g>K(7)zgse}K{#$^mQ~)0Q2yuP^4&yc^|JV37M;7FTco@b
zN6>K}uy1$Z$!j@ssTWQ%huGpSj|_h^Rj^%|Xv}iOlq<
zQT}(_j(N#=Zm}quYV7HPL!pS7;D0FNzd1_G3xoMNpDi^jk=N8+5;z6jW>m}979+W;
zf^xKvB1XV?5=|)ZW5hlpIq6Z<)sXjNeO6mSKhn{DK~g!D)a)>nrjYqD_4aSs)Pj)s
zvX5Ir*h%#Vyv9OS?mG;;5_ECs_$sWX-1$raUj&+owFp
z+3swpKo>H*w--Zw4+~8VA{|C7P~B3jB4jX7mK$soMBO11a$Bu2H!@1mvaToTA9w#L
zo7IICL&u;$-4eQtK=)68!zy8e$mR7*vOKlfm8fCNks%M^59nBPgAxHdwL1I1KDhN&
zxbCkH#%!)X*8K=su2`3aDh?S5?W%DLBPROyx5ll64!1j&CaDg8#`9cziR$uq>jejK
zCf5p!iiTL-e&AgTWd`m*)SL`G_lTcf(xqx1bLa9Vsa|E`9~vu
zJaQQ2F1J!J4$O!-qfRYh(KGSgl7La04;m(ih(Ce~^dv&JJ(hpqz4Lt9#|uVYu`4oG
z&OIJlp!3eZ++ure+Im+~O3DHhhOI{&!IMB1^|ENzg!`nuCee0w51DZbRebJWGWMqA
zMw?w3n;v^(L9RRTOFA{uRgE0!9;QZLvT#)C&d!c`U%FE9^REx0xvjK^8*M?*cL7(i
z#(c8D_vswza3maKKn%zDI`0cJnwu1{_t{Ii?h4~~UDu?#KEKEj-BJ{IOBHS~K6Eip
zr*hEfZ25U^V{MthO4#GN^p^9G){k80M^>4jSa=~w(CdPx(5+lXM!E&N;tn?Gwg$IA
zbMF~Hr6KfrE0Yh0&B1gd8*@EbNl6C6f?Ob;hYLf#eCoVjc;Vz$wI($&r?u}ej&NJx
zuPCl&&SK0rw0(!HdEnL;HcXseL+JkVq045UipAlZiH
zN{Mw)*L29zLD=L}A2|2i=14{#Kzl8;_muxf-KEL3H7qzAE;i^ZyPkLx`y!-be99Vj
zvt>2P%*#xd4Kv%f)?knYGn+8ms}}ns7fvw!=n`-qR4^TMXp)s%j7&{Q+dNK{t4B7Q
z-___rw(o61xr^8i%cGIGwCmx(ax?ko7i!>V(5KMKH~TeYptTj>6TF|WC_;yNDY(b?
zm!X7Lcpb)^W=j{sL&L*0pwJSF!Q5Knr1Gz?$QD6;9zk|bYWtDFqj(H#5Yl7X-H`da
zi-R3!5pPjo&_btdH}s>fnwG`O{l?_=Z=Qxj0*uMm**?~MtM^9IN0fO_gA-pC8imGz
zE-9@t(Od*>@}J(L8zvDRgS@jb!MTm2T|vVsNsZ{{{DXs)!!Zi`VoPKh=Jt`BVVk~C
z`vAo`m7c*z@i+Kv8C7zu@GEl|vsN7O`A?=;r{(7T$^HGxF6fgb6$Q`Q*0{u|ik=OXRBbYAl-Z^A_4R=|gb=_4huK)@@Hx5|T~Ota
z=3td0!u19qoV&rXbfT~Tc-^R1kv#cd{F72so1Q6#kC3uPnSq_XWy+|oIPg-Zah_po
z*w7imd%9p|uU+(fxm?gE-&VkhnbFOLieclMQ9;>X2R8=w{Y&w;bwH^tFFLWq-Vc3N
z5#4sXFgIsi!pH^%g{qN}@dFg*vLa;AeTvr
zX>D3_LTkl2ymCEur4WI*#U0P-v^IqaEmfo?Cep~$s|R#()GMdu(%A+G=$^^K808$$
z)CXN-ot?ViFru=8!ozr`%Wr2tp!3u+mXz8Pxc@?-Mq@%Kv_IvT+pT#H;V}K8@j^&V
z&21r^o_Yp}X`8B_A`>0PguhFK>npsM4*y`nMetwsZs8h`mqu3OYn=^(i7o
z6YSOynzyeW4PgO_k%>)9MC9ZbL4a&T&UtTJG^r=6*kG3Y)PJ(>|+0EURMu0rg=OaicoCPAhJq^*6yUE+&z@v?r
zNF8%I=<0BG%GVR3A+GWe4WU;>eHW!uok_YeTb+!5YdEHv1l8Df_Ed_a{Br=pjJBm$
zfO+5wA=*8;F6sa*&}Ps1E%W82rFY5fnZUYOcr2e#kBB6LuT|I<-1_}408DHf)|!wn
zqhz)?Cxb^o-hJ>iq|v01Ju1->v4KDlbAc`W6t&w7!40F`ddiAkbxkLb!7HvCXHSX%
z`;mvPnlRrxQ#2Ylu>b{h@V}WqNsSAeVqv#FvAse1|9X$9QjFUCdn?rG=!sxU19++7
z^O-*ZFCM}b;2VyF+DG^OM77uR7o3FB%bf
ziHyreA-F!dHQxLqi|s|bi^*C`GoyRmPY5Cb
z;UMsdbK36cDK9~RCsW=f%;AK{0B-;otulCi_?F!xGwrEIUv9L!m*GFlS5(n>+Dh7Y
zv-K02Mge~C1l=-om*m)ok3IqH3MrP^g2t%uP#7%Mx;~uePChMu#!}`>PKSjkE#>h+
zl9F+k56ApN`Wf-#r5fA^YPd{9k9Be%>Av*l(G65@#%nCYxA5GHM#egE}#$2Hx
zyd2^_9pqH(3=7U0>NOujvK2jxL_9S$xLTXPvDb_~xknv<)~yZI$!*a?_%fiMg@@uw
z$O}Q-X~loO&i@Ldt>_zOe&>YBzH=cm*EB9el_7P?q#&WNsoh%it(M~_gJ{)yl@K0s?IWx5d57Un=8MNq
zcLGkS$+0SB;}_qC6Mlr}!Y~)K%Y_a8|ufgIN`47*%MX@qfhMo
z7VvE%`0|+Bu2%ui;mUin+%ro*;Q7|F&lf!>O_yAanDf(ZunZyH(;R2O1-H=*31ldX
z1Mm0Mz`z4ZzAw&|^s#aduMBVw*7{X_43`FREOhEDj}$RH0rXcW;LnUO
z-LvEn_AO=3G}fUJf*(d%1WodpBXuljv0J{GJ09`1MABgDwTs-QN5*)Z1=qa61$E(%
z&i-4fGT-nKAWvAT*tG%dHKBB+|kJ%VGUP?8bAaXM^lq$?6$r#kjy
z2(7%PeAb6MzYOt6DHDu<_gyJxf2!|(6GUOPzv$zy7j<8#ecXxe|GVwIkk-}EPZ9X)
z!?G~H1XZUjU{h-%H)c7$^&I-uF=E~oCvJ@`JR$6ovu`a`An?Pc0Pr*S6eq>^9vn1B
z-2oNyAxqRT=E|?4Wmn~GLVbKEa0lTl*k!R74BSVC_5Ato=iBqEw?!&l4ex#vJ_L&8
z){SewJUbWNu&3eQ^LMj^dtP|M^EeL_GDd>iLt2HZZ94f}IF{}ThK3Rk(c3nRd~>?A
z=$EoZ;FR*EY#2|YD)m+s(eXA;O>`HS#Px;eQGX*2B3F3q*|O2OFgZ&;T>^{BDgyPX
z(XVS?AbqG;G<2#;PH&@Uo9Oiy%ak^~aN3BOdXRUdVyVf_9RUTL4e$^6wktgje{2k1
zgG;{HS!Qr{sX3f*Fl;|3ODar$_iEpCab2XW(~Rd^E+dm
zv<#P@&6ZMD*E9gEwXIlCERRdf9Ov;;!LdE`dxc!WLQe2K!VOsE(dDD{yK&E#ZAx>B
z8cSjzJq?3TjLN3TV(pt7K&9o^{zn}^21H+Kovirh@gT?~HeOmR5VA0F5Dn%WK~z#y
zZKufGw(X~l{w`gbS)6vM1-731n+nKB*OdyBgqti23Jv{~|9n{1T8
z7=;AjB^{TQd4&Uh6?c7NfCC2>%t-&W{_B?pN4l5%ZuVduxSZd~k#gt_xw9;u-!m(d
z`y+I3{hmQMy6*wlNs|KRfoOY=-v{--7uOOSFU%KISJ-q?$P_=7E4QLS_%IgKw?`RB
z#nOlOWH7q^UAZVIR}Ot2vVHbPba1Q--LA;4gg)Bo|
z?PUfcA|h|q9DgIT6Z(Boa(teqf1wszPPet{ywS}e%-zW_ul{eNKknWk;lGo2>6x#s
zmq7~8LQrTpAAV@y@1SP|a8J`P(#QAz&cYo3yKE?^w+%(fv=vvT^)S0B%Ovy5*lZ_6
zCE+ixSS{tz#d08^+!;RuHBn9hKX!J?Y4&4%XgQC1TKv147PSH<;j81
zhcD8JJIw68hfhcpP;KcY=@`lGT`clvNy|FEHI>>}HmSb4+h{i--+Nm5+=D
z8pr`LZt^tVLP#2E<@e0^K`*bw88?2>)yjWFrF|Tp5Gev%zQ4pf|69CZ3B|t}l^7p6
z30m)pF3itSrB&I
z%-$MG7w8aDewZro2Zw8ju-Ygpi|f_Cxc7{mUqGq7
zHqZUsD&@UczM`gEALTWdmbmjSwDY~d*>Yt3;7sLGar0G?;=XfXymt!jE7bAIq#Hd!{stH#
zSunM)i%|7HO7V$6wACqaS@!RheP~wBPDO*S#6oX>-|P%j%x_NBXhSul
zz#>&~277V_w3KWsGztklxt`*eml#7O
z(BG%5F7e~5wW0SjMcS-jPeZ&3L%#X8jI+N2hf{CTI@bSGB``GxYA(em@2P}JTN{)@
zcxv+;Tnyb)Hj{FNtJgYgMg8d6W^kHgX7yt&nuA31>3PDv=@XjUTYn`rM7ZczK}>9r
zaQ=zbvFPGCTc61ITkr(f!S68Jg5rKMzs=%pZgFM9o{UxnW(l}cS9_bACtDJF7>W)e`mZxG(#sa{{B5pW4!Ttx}AT;qJdr(fs+x^p-GBemsG4TO>N^9@Xi5D*j
zhbQM=b}zJ;HmvVo^0_NT3-ZlaNv^d&kLCp(MPasjvVY_+y@PH>H`Vw|-W6OqG^eZK969%<)Soky>vO3_azFLD
z6yS)4K(ppqf+%`b#Jw_G+TXi6QPWwl;_XiSqjyXkJ>`1*X0`G$sT+GiE7mgFh`08Z
zj7abIbaNb^sA107wbeIwWYR{R;zyig<3W~gE|Qn#ww#(L@tTt4W`-R?4G|2Wcu0jM
zl3UM0F2!={kD2WO9NtblrW%g6#(cDkuH4Qz>aXy(G`0~_qyHEpI}b81im_|@Im|UV
z!fF||11*XQZ!aCLAru&>5f^j{Vj3k(`e}!@iT}~GHqY7(W}-sBp5aJ||C0>H#{+tV
zX(;3oXVus_8+w0Hy=`BP1^-9p9rtBYe5g2!OK2`780w$yHZG6}*Y{CjK
zs!Q4VMpex^t9%Qme^Hbr!y;`{#2B8d$AcLz0V_KyRXvE_>tQpluae4KT0AL{M1vP
z|9&eZZYY?zygj$?FQvi*FTdgO-W*U29kMj4Jy7h9ka_ln}H3$ooc`SkQkD>q*>7uQ|A
zqx>Xh{_df*$m(B8ikc9tZu&l*Jml9+o7~}TF8qs@bn>W@Eao!|{8l!}T6WzAF8eV*
z9bpo^L*DY>KFSX?1zo+y#&o;4jt^f7Oe;Em`1#PS0x;NybWGTP1DC&)Iamv
zHavt^(Lqf$p$X=%j|?Q@JJdoJhXnRf2C(X-l|f3C^st-!lc}cVP3J<|($n6I{8cDu
zl|%Q~sqRad{g&DpG;ic$@ELP=zYNFBc*&pf!bvMJY&>k>%j*#Z{Ekv7xUfPi{J7dXdbX)!6XeEe?uQA$t>Pn)yp-yiZhr@LO
zhui|zc5`X9yx85cYvmIkC6onTx!I_~;Bf?t>pVdp1zFKhrbTLWu)u<~^H7y0|J6+KlpZ|xhw~mYI`@)3l-&<6Rt>tNA+6xPFJG*c!4>gw#?D0<
z5pr!ny5vYn5
zCHjEe2zCsV{xx5C93y>5?HX`|rwLI&SAhIk=WgvJP*$HKhD~of>KOa)N-fTd?hbEO
znD!0j2fP&uRtUO`+BV+Y_)K5_ZA-?nvE)7|m4ku_+llcZ=%2$h_`#Bvg}QC$L~)zY
z&a(VSmFmNw3)B
zi~SV+4Hl#(XCAhGUnJ^@NCF50!2oMa|8_2yUDqDq&*iy;Y|c{S@esE3GZ&>B$fh&l
zs1tPjJ~V#%`niT_)niFfi=W>VIA$g!oR$Y_jQP2_7$DXHcjzxDgM`|MZ*>CN*zDr)
z3eqE<(XnxHpcL`(qw4m^VxVoVetvOVoBDRwQ>7UEP2yQbBZw4n8K)u1`ZKtKqC=~y4`z46zDG(|k$3aw1_Lc|uWv--0l_9b1wK;cMJy`}XsHLkiLY3E{)PjlVHelES^K9x)pnd*ROJ
zE$Nj&Y6%)Tyn=2kML{jvAnqo+KE5##Spg}S0)fP&TlqjwRx6_&BxU0OZ^4c|&j01)
zL}^H?lkH;Wy(=m&iIcYx%U9o*btN~Hj?(;w(rE6D6n*=)Q6?=fFHab6d?;o0@wv>)
zx;iCkm*RS9NNly&z`U%|WBMZ-=Kp`FEXc@@li^0cOp<*X8cC(A9wMly6}r%c-mY26
zq)*Y)oi(O_SfF4Dsd5@z0$0x9s=RWmZ|)yeW4#N`9HQUU8~p$dYQ50
zhy^7-pF$>1KPR$5IIm$J%Ks2r>!hw_Sk0lq=S5OD>if*wd3ssbb__ty4yf1+rzL@`
zjL-YS@B}us14sg(t#|bG=?zN+ik}B`O=erN;+zNCP^N)Ak(FIzUBFxyRl>wbp(LrBHUD?
z_$;K7UjG7Szs58b{W==ZIXVx;ZkkVj@z@?2T6lY`ziQs}V$lE@XJHxd+b8hb04u2C
z`c!lA6VLOnsi$vr5Bx2KMxjV|1f)c&AFKb|M^P!kCz?4r?pzzubMVvce?`7!Zu~H>
zGDF0U8$g^>TI@`0m&&`)mN31*`!Bw}rY!l5k^&2YRDf!pf6=(>*V4Mt{IeA&>rRaH
zcV?VP7;auFqlia=W)b4mAyk)w`^-tOL
zCL}>klXu0A{$R=8ll?4P=iVF}uo)r+I`7Bb)E16CJ)-D_|aB2O|wAV^K
zN!}nLyx@{lb@_jxWumA4B*5T_qo67S>}ih)WcolvXjt-Ac9MeGP6ej9<529;(sr%m
zlUO)s&&29nXbk2Y)X4Wcczq0fdtQ_us{G)7j@L90vpQmMhM=Sj8crt2T0RbSYezZW
z#wNh|ST3vnGOdsux(reI$&xjh4y+Q5Zdxl0U*8X_QSNo>rK6ySUaN$$zUZKku-?0j$mY<3BwERj^8`#7q2J
z17rLi%jscxQ(wIZna1Md6E+ZO%lqU%851}|ph*mNjP+ODTy%)k$uxkt^n}N6{IRNo
z<2>8VR3qL}E%0N8ZvqG~8;Hq+$dic2I2VKmRiW10?=AL&-7Afq#&Dm3vU^nU!k?DX~NS
z5?9Y11q|r+1@AsyKW9H&@SOHZ-ER@c
zki<q{KG(8)~p|bazu6=TRZK)K=!?5TEW&J
ze8{^)QWk?1*OVxEZh_|DW&XQ+s5}L_e&7%lS~9;4O8{RN-qWGIn0uU3Wzz&L8iYq~$Tn6K{m(hL3Cts9wp
zcI`(T?up?{5ywmJyKjYP`VCHgXq;u^mHD^n1E~bCfWGMu!@q)4b7XQRU7usIdTo8S
ze%};IiTk3M*-Fdw468%=Km+!Csz=Sggn48a)ZG~_;eGJKnQ2mO0deB!f)V(xg-{;l
z@c;6zCVN<>FbiVzLYXBq{+u4@e8y~p44|NT7Z9MtIx8Iia6~yKXk9nb<=|9*T
z%qSu3SU0WQw&Zwt^lz<`lhFp8jC4G*+w|bne_~#`udwAhc2r(@Fz(@6AY1zljV>6I
zM_HGzP1aJXg)%4q&y_w1B0?BR0*xc1C@)DL{4m`h?QL(qwD%oji8lJ&((+yx&J2pz
z_qxCPCyVoIQ2!9DUOk-tH_<+Xq=E=+cNrcn94y7vNEMiAm|0nzX5)tQ_CL)@=OEt4BW2F2gWQPGhZLujTY)ll9x&z|!&~1rx?R%|ALX!k
zAD#N*q)&3T+CTe^bLla7>bj^9il0Bct}WoUU-j*@{EPk3Cau8p4@;s;!S)FCeemI0FjByLk=@n71Fgn9Up{2O8kd+pXjNR+m2fJ~f?zRN
z`9)G@ZL6HWw!G|iS$IK5HhzNdN>9EGYBNDj(A3SXE_Ka8^A`aHTroIO#mOmuS4lts
zlbs?>^~e}J<@?k_>jyk0&|_>9kh@?8OMj_8=5N(J87^Mfi_7(#NIy53$!o83EkiL8
zPxxjeJ5on05}lVeG+ZQ$2rND;+j@3hS^Cdbx4e{=o_<+JaV@5=(7X`D+JzI~gZ
z6i`+0{u>SR@#7!<6Fqe$28!mEDX*^|*yaaJq7s;)2R7{^foZRcVfDLXI{Cq{mxvgt
zjWUdePS+ss)U2ihkCAV2)1tyZhg*?0{uE$Z3Po?qx{j-8CCS{Prl#f>66zf)b0`B!
zA`lIpUr-Rgc{%A?S|mUb*2F|n2M-%^grp?zGuel_H+NXwa)y1q%uHnA7CDNEj&Wu4
znN5yCH~t$g`?|WbYcPey5o}hpmThgORirU|@MD
z&dMVPCexZW52wfENjZ_n98WLcvfr9f431d_?d^wqf^&xMDzkVkGx3?3N!0DB+$>M_(^p)j}3u3mYg268Q#)b>`^19(Z
z3rqisFzT95tC7rE>7C?k%Ae;H*t#P$GI`cTU_bTb7S`qHC!QQ1^XByu-_+Y>}3wW&J`zZ-MX*pbhOLJ?n?y;C8#=>Q;e3C`G2R72e
z{I?%uOs5$&FzEgbCmCac(YMO)|FGPiL{t-kVYhGJzL}bNl=KzA%1-dxEkMEvoQ%gv
zQeig93o7R$-ppEB_C&O%=
zL}NIj!BSXRPFy+o&leZQrE{@!*4p+D>J+`-Wkr5kMQp~r`XOiYMiQt6yRiLPh(n~c
zA~(&GXfXf~l8e(^`esGV8R~uhM$9r@J>JbeP!mb@`nk|#@FnDYx
zul!aG!*3S{_E&>>!*_m()?KD!$DsW^612a|FDy)S8OWS!q~y4xP9u-L}8%Da*_-~A4g-^>I?mGLk#ZN;@a@@j*RsG0CtET*0>YPsM#sS*-cs<^fD
zA1ZG`?(wns`hoA5@gjl8uF3JS{Gn|5np%8$b4$FCC=PO7;+4R2jNQOWpWFJ;C3|oR
zR7kP>w68C-K_~ZM={HGn6)pz$_BjB{AVrkFetq@g#fu5zHtG#4cg`{LBR6i2glzx(
zUDp~?xc=b&`bU!8z21NvXHQ=dTSP<6N^!T+v)x)=*@Ij9>C;XkA@xUJz`m{`bfzf!
zd2SObK;ugRPAW--^EfH??<2@KgGXSKKFjjw)91{9Vf}Bx3doa+OUNT+BR3*?8si}^
z=Mfo00=;TTbspwZF(9onkY^G^vac|^t})YWK~abhm-L#*db>>Oz9tdsF7MUS5Su6=-_(L
z%5`&!f{{du%b&QG?<)XLl9a?6u)jUFKJRO3nf~qDx1G7SDuCe#hI_s0P(0XVRm>Lp
zunNhfKWmb%-$2%+i3XJa>$e|%4&?<6?ClZaBTt1W7YJ+IyMqN-+8eL>%
zrh23f{O6n3l@MXAi-9~zIMQrPKhvv^9<`mD;E23i$(P_naIJK`T#%6LjA+0=9ix5n
zy8y9kV6iw_yG3vb%KiB9V=xuZQ<$pi6M&?ii*uqlpDunCJoja?b|+vNk$XHhVPiSf
z261m*7Z2Lb9C&5}DYo*%@G>p7pxpTAgfy2W;FK97K-4niY(O
zow#7wS6MNsW~A3M6Qkf%=8*@p^){1Auz=Z~kNC5mCz%E+Tv9s}Ry2hS->CpBLS09v
z!W`NNU~-PZm3`&81;T5-`LDNhI5EeE!2C+$EyKLg~ss%Q|x$noOg~E>WTj*Vm8J
zmM2Imf;OiuFq$C?%+6wFVR6`4`r6js9^OInc|QKA#S<7-L7n1%dM?3>3Lp*|
zy?1>Dq|68ra5#Jpnp*WTI=akn-Pw=pQ1oi*1C{sW@pn%w@HXs%1xKD_l5r$Npl3oV
zz;+tgEzUj*eDCb6e((4|Q16x^n=vxcIs9Z)x<(dVSI-%Y-tAK|Z|kY!M&7@nHe2o1e=%K#&yZuv1C>KXsQr1J$x*Ij#u&27GP
zP?4yu^RvSE7~`}IJS?F
zb8EW;&0~v(J+XrWj-dl;;!nRKVPJHAc%LtVN_Vd>Irx{3+fzb@fpgy-cQ+0)3`STnh1kEKC
z5=tJgpZs
zr`!4WERc}R&CfeMx|N~2X%UZxXZeFRC(r=H)s%Q0@K#Rn={yL8UcyoSE=Qqy|4}2~
z&Hq}M-7Dqg(CBaPY-8FvP%DpHcjc9u|Mmx~1RWFA5Z4luw?GKDwzd*+jSnfk3#LvY
zL!c{)MLvjtuK0p?X)n9X7oU73C(qkg-d3tka2KTAO6$!l?J-`3XF
zPlrRswLvM6IB46;uHc}Ij*3bH(@J9MW1J|z+8RP}?c?M`=#{?^a!qR!tXFs~M2XAl
zs#r&u+|4N{k28<>WE-}KU<&-3;d+Wh#mC=EHL3OWYEb2gI`PH?3@-~rmZ}imTuCbg
zmt2b#?1u{3={M7gnlo+lCsBol;K7D=ZV$et4_Nztxt%SM>2XFn=C@ltMEdpEN#(#A
z=h`*>i_+4RBjgfIdGmQCY08>c$b4@Ae56Ef+PGSD(I?M8vJ*PGm7fwPDI@g|T_^a1-(Y(L}_C$t|8)9MB@ZKdMoIa2Sm
zP0ZelM#ZHSCf|OetLA;)h9HCa`$`XPVH
<^Cy&%i!i4)Eca=wTuqIGA0*ebIMyM
z6{p`Jwv@cx>x2{Z(_*fUIn~#O%lz^32gYp+3Cw)pQq-w)khc|Hvb&bS4)eQS-F60-
zi%->kk~PoousJ!7w@&pP{dw@g!yPQ^?k%uvLH={k0i6$YZkR^v3P{DwryA#ev0KYr
zmN-_n`sH%_X>{+R=1J(F{r(vE7O397VEqQl7%f#AoWK^g@+;e$-o4!`U0uti?)hQ1
z=Iy4D`{zU4-0yZi(>DDskpH{}B!xQR0A23Gn}&{J3ct-sb_W)0$D~G+geM5+B}E0^
zdR%Pz=NlhgZJ7162Ytd&OZb(Ci`s;&!yu?anYcd#@zCYZ9L^6^IKewW-gyJD)zb~r
zvbx{a*P3Vb%I5^A-io)0GpGMtny&f3O8}zP&`_FPFk-741ZsXYlbh42h2O20=ZPU7
zT9p9k*_T~o0+qg~l7n%CZU_B{;_N=u+oCeCtzMSxxVNGx1~f#O+V$g)|8}R~%l|vS
z1nN?_#$u76O-zEA)e~`v-F@+XED+*6kwy8zsTRENn&Yg{QgjQvBb4|m)+|I34K8jU
zvF!V#88DKdC)J?7pz}9tRpA^at@d7oQejUZ4EeZPV3-5R4khiMnr=WlzL-4cv{Bhk
ztvD3k_H;K6-aw=j^EHY4&-wfbZ-HBtAqOE&Y?R7{b4i`Sew4fo6_UTA&ZFGprE%ta
zRvMWpgN6lJ+8B{&rf;4#>r9l{+h0~Fe%>2&gUIVlU?!$~Dd_2~HU{0RIu#>+OO2F=DSE1Q
z5Aib2*nn%+9%-9|es%Q3J+I2OtKT
z#!6C+IKf*Wn2ThSl)#de{CWz4i#{e7s
zSH(RW{qGr$xIpXob0yCiSpd-F=!ml1Q>Lm10j8&1H2;53#nnuJS{YZp$ji%ngI7+DFa=LlwC#B66bMsasf6|9vnVO$?eD(1
zoSz(Lp2gcTzkKSj*VG4-=9Z#uo8wAGRlj3yD$b=!04r^N(bcir-CDDEbS!ny)z!Ti
zu;mGfBJf|h&_IKH2W9u$Txo~Fi%>~ycv4&Di%rnezstSuBElp2*XQmCRF6DP{d;)3
z`7GcuLdNBqQ`4Z3Nf;3YDeoO4qnt8_e&|G35z29Q3=K~vAAa30#?_EoXE}9C94J?X
z=p#Gr6Y^CC&j!@gkJ?gY&|sG_{}(@-u4mC4$_xU<9uU;i-`1t`g65Y
z3pLpmpj^Oyp;2kk4SP9o#i|8~fMwW~Y$Lm0o;Sf%l<)6KQ+>#3h&p?v)V4Fl`KiI}
z+m@*q3}(KZj+c?@F)-LSFL(eZ$ILouxR9{o%B4zu=YkkqPveW^xh?}8;V%HSWQ%3}
zlZ1kOm;ul#G|YW-XQk8O$G2uBjBthHV7hH;fIgS%^PBGO?$2pN^X@^>hmcMv@ct@a
zXz~VO`MhHSdRiG6`6u^*-;s@8_H11x&EzinUq7ItNej)U1@o~VvPt>@No8wz5;qUe
zkcKFxt?f7mM+s7hw_8S4EDhaMF+y*_}Ug^(|xAGQ*W>Q~zHs85z&w
zD#J>oj|W1&Ir{lVnIqNSIO@HU;$nRJA>sNRceDchIN5(fU_%V+1aE^WDp=|-($%Gw
zSI}lSBW|7SNtBNr_0|yIV>vHR1U4LffFk@_XvRE%P{HG@5>Pk-$TV-6oYV{D9@7}sKS0v1%U{Oftr0PvuBg^w$hfWs|?+e?mb8~Z~V@6zn
zrz-Bfj6+4v#04G$^o@m75Hwxq*Z7v
zP0FMVsU^=LDR71Zz>MM_oA^YRy0?Inq7#UUm-EUA1jBf@dnt|G=H6xx$+q!m##;n^
z2Xjt~y+7b*SKvZ;$t)UV$E0l@Wv>B8y-IU8&10eRgzfJzXb7tR;fk8TfERmq{Pcc77{HC|I`
z@7{Gy?{?Rnx@aGR&8-C-tBl>KRH~~`>t9Hqf+xTXE&~WGjvR1B>*}drkL-B5;hq<3
zOZ3o|0IPZ_LI2Cj*n(HxiGO1*G69PRrpdM@;jFT^=lcuS(QbVsWp#ik#4lfMg(8Bn
zrL#}YICp{kY<&G_iKBbt1Mi
zMuIJnz>w0_)-?-7G7C!lC_WE%`AZSHcPI;HqE+5*fVZ+d
zB}VfM({W(dN}?CN*U@!(K@;K9tAJWH52jb3V7_+#TU^h6YXP)1F(~IjBNK^k0Iv)L
zf5DIuFHk+w<;)?4gZbW6+05$^t|WCFNB4sN8>qFYJF`EGr>T1CrZ4>E8M&LB?VXxp
z-JDfBH@&XZ%)8dqWGf>fdF(xjH))o3sWK6sBVmiGo{EJxiE)dn7s|F5Ycym@F0yB>&d>LIv
ziNWqWYbH}iwI@pJh}3PQv-{4Rg@kNcJkBVEHMr4U)oZ}NSHqBl-H&u8Yn#*h7AWC@
z57W3@qlQZTRIgNT7<%HbE2!mO0tJ|BJjkGH*B%2oC4z|+EsLFoH-W%xo&>?1(({@1}x84j=RS~
za)M#;&))++DJTO2e3Gag-*}|AH1nUNhfy7(O!~R3hr9S+f#ge4{FiS)r8NMY|45l%
zNCS#hW>fL0sf8WYR^=6uVPPc?ZKi6e6SUCc*UYzv`aKtG*X?_61YV6ejN$=
zp2b?f^)|94?90yPFc!bUN(kS&@n)766jNxTGUbxChJj4)IaLc{d_?lYI*>y45W@cRO~(^HQ;Z-
zwo=zMdcWa)VDMXJ#V52sg;)NN;QVtN$WP3otsA)L?-lEx$&xf@tL}UzYt~fBuZ_1r
z!EVF!^fJwNzOe)na5(a4e#BItL@qXKkAu9B=%p?-_d-B{|F#eS287z8Hq3dge@S6
z=Q%`l*(bUnQVN00lYp!&%(%k2%)5HQtmzEHo7VdY>a`r$~AX4I>WrH)CUR^YeRW
zx-)7uu553mm~bFdAXwvd6DXU6_#hKhvlsja+fr{1Iuc$Co}fw;JEz-Ar%fodPxN(m
zk3-wU!{I;T=hD!7TMHG89%*Qde%D
z{M{g|Ck7hhzBjnZ0S2SLf(BvxsT%qER_%dV(8geJ0)mMtUVb{s!xJF#8zzM-(~*-K
zU^H12HGU*;n=lIVfHF5lB@e|Ct0^#j*UF_~(Qu*BmT`s-IJeqYpDqID#(&`4wl)0L
z025>+h)H;RYPiuz<^|vQtxc8LKMIl{L^J@C|Dce{50*)N4?QBTRlHNsj6Da*J$1gs
zZZA|9I!M&7^Bh`l;@Gczq3B$AAU)k;w(~oZ$1Es5)M)49%-dl<4;EqJ;
zPI|oJYS$Ga1$oPTTBRo{g&=yEXI2#kNO3n0gm>cdEMPvSxUn>}Ui_GRK*&@?`?K;_
zUFN@+@(?nR)8c^v;l_sFY3J!38^tnO&kp}`MUtSjmD*djr0&2NuA12cg*ReeF*J#d
z2qzmH9E1wjdZwoNNvwg=>zCaa-NAyK<(+;4Vqs?}8}Zr>^V72vs+MfNOJLb4v^~<(
z%4_|&+F|%lZw)Zc@h3zt)gPv$AFz^C9t&7El@E@4@#1d34IDnC9LXyC+2t@?8wCiW
zxu2^{FTQ?8J+XfpKx{`-jX@YXLr&C_nneiM!kjWNbw25_4f~X|PiHl*Iql!24~TsK
zFa2v*%>qEszF=|*fsP8;Lwsgt7>fvz6hB&v>p;h)rY`2s>rnDIVMhcs@T{2R7E_ba
z3oAyowQZvzf+C7VE3@$mdtfS?@Jaxz*!qUyN89$?G|1lVUa_cH=AH
z;qhP|wp7e1qv*?*FP{{qE!sdTkp=1%774@~XW;Q`)B-F(t^GRFK;WCkJq8Uc2VBRc
zx6giT4Why%%SDAgSE&d6jr|xyU?kDJ1PAl&gxxv0>(SYStVHKxY1SFv0_7TMjHs3h
zJ}lJEYDhRCX8oEL*W6BlY4s|`eD5>;%Z_+4uJo-FZzMoj@u0N%A*NyKu$pIf*^v@O
z!?+jtuAn682Np0*MH`C001BfPDSWDHd$HbSF$!3;NkUbt8yqo2jdzI5ECDK;!m;R$&17ccsxN@h{GOlSIK=v%z
zqeB)UpWX8oGRf}M0hG2WBg2&*1Sy~tM4Ya09^vl^1ewFu-g?e
z_+&Qk%v3Yi#S8Lpbrvzre|HfuHSZeExYWFY2odygnyE^rxdw&ARy!!)Rs@c63*bTy
zy!#CPv7hoyD<@r3DKQb=t32_xTZ6I|aQKeXXbtR)wDT9BZss{;mu=UcaM5?;>(khm
zFVjJ4U<#Mb-y9qoviH6_Ru^DYjmVc?vg2O_v%x{p8VXq;by;vNO^04V0lc3mf)5P&5;Jqlw4qP4+0gO9OA-=Ij@{??O|NTNV6YTGGBL%;=>Z%JwuxK?dBOlv
zT-Q#@NwgVDZ&L1vR(*c*YqBXEo`P1efl$#bO|)f&1o$1zU@Y0FW&`%SNFu1snY!%V
zg;#)#t_>fGj){3K(W%fw|7H}B4@RZF%78?k-fIDHF#`CP=6GX$tw+u-Dn6MyZ;TNQ
zi%C>{hYkDhUm*7`BQyjYgpzn?+ekD_Gb?`ZdbeRglHP?Cxwv9?jZAjG>WNMrPjulGUKV$=d%SwU@vZs<35skISldLFrW{hql-Rx=8LTXmwS+`Jc6SH^X6^vrz))6Chv|&yelkfMhFWN6Opz=~IZL2>
zuPrJrSs9$(MRAVq
zKq=gDDJcuJBan_B<$K8ax|nVwVMab67n)1)TPX5~MbnXKrc^D2!m{i_D|KEo?;Ss7
zr}JnJK&WEW3O_o|*49*h-W~)5N6)Ws;M|XAl+TZz`4^iyL^?ua;@N#|Yy2StJ~*`X
z7Mzq@PfyRN%sv*N41{s4cil>|vogm#@A7A+H5{$l?3$CFQAMsQDDdOYGGMg2@nVBS
zY;he;Tv=)9Js^BYJR;_y8y$^3|D8k0|GhVLzK=G*ES@>nZNkyqNh7hKnuU9|FYPq+
znoS<@NwCP#+!^Qd)@iiEXl1+^#}Zg`b`8s
zW8$5AF457oztg!t11xHp2O1Q`=RrV>7vr=we-{bNXI><-5(wL`9+VtX#}wX_^^Mh(
zqF`JSYlXJ-x|jX$WnHKkL;VA=g6Jd(JfM(S%|IYpCmyYt%+yBd&1|$*9*h=40CiG~
zV1{I)*vek6`EHIkizd^sALfaI>CmwfneyouOo>Tz-Fc^|6&B@O%vyDTeZB0G8O%a1Oa{D_g
z1nd2&8onuZ_^ATwKJ;V)4?_Z9Js9T|u;60wWQhZ?MMB#1L9?VcnNgDS$o5uX!289J
z^#``vpSmlijt~p-*HgxSBk~8~1xU950qC?m!tulE(})e)c+UPGf?*et5-W2B@mKc=
zt$XqnViF9vhc;Ptiqo)ZsaFbc6!xaQhY0Amb4F(AR{*Z)Hzq-OZ}${HD5GjDp6HwW
zw|=&o-vCDG<^W85Kx2K2sBOZAoM5teGWcWjhaD(3y;8Xnrr}+CJ3ZMZe6-qZBa@`c
ze@bQ1?;qd`tg<_~aP8`CpxTO)&8u6EEgWbat0wjdc1u*|UwFkN>hqCDCxx}@jA~;t
zAkH>kNe`pqotwx9`bnaWNc%#91A<_wRhw2_&=p40F57g4}$hG2Lqfl5hMz(
z6}5p-ca;C;$oLn62%#4_2X|p8lyi#ep#C9+
z8BP3ObJBADoptLmKeZ1jN{;Y&@;0~L9$T5GDlQN<?F1Z@RtirH_M16a5#r
z&CMiSLZ%`+XM49@#r|=kj5B^nw1h2jSL^*@(pu2TkjKJUNd^u~crf+L5qP_xyd!zL
z=Cg`)n|`5_Il5}L>+N)v{QoZhqdN_g?t_WmXqe4$vU5=B_`D+B7RW8kkh^;ARZU=0
zj9&Ea3W2m~y5OMS$jG-%%
z9HNyNJ6B!{4-aqq^r;JEn3JwDP`w01L^FhnvA%Zcu{S74;OqhuhI!QR|^BqyfRGEgoz^45BE>~3Yf!gz9p%%wI
z!V#3Gyz`X-Oe)-a4aAG3k9fywA&DMq}yN-+LAYOialJqV!VEhGtXhOiOQ
zre9&EBXV6izjx7mWSTB+GL!q>;3gNq(s%#V*uY8oNCv@O03g;*4IrY&J^?svZOEZ;
zuyvo7hUOQe4^WBJofbgLRv@VZLVv!~g*_(Q$r4Q?e#~pdhf7jaqP0-yAAU73xg(@N
zI=IBUr3SQsuI0M~U~J0=fvB-JnoY8>a_Te?&Tf|P8Xh*GJ0<>MJLNFhWvKjgylohW
z{*lt`co+kLgcY<>WUQSl;-z!BJGl7@ttR@7v;2RpBe-{aa?LcTbrrF{2qOC6iH()i
zeY~!Vd*bfSwDS7f3A%s4{aup=yUFu@BQ($Rae5iMdO+Rl-SF{ALyWLA{%!QPq2MRe
z+&EcGvF>L7ZRPzo(Z4fHkS9;P2UZ>bdQVN_DjdZYe!|I5BUl+tj62^CjDs?=ZA*Wo
zw)iS{Y`fBQDCP`dJ*9IxE?oF}ua-Ict5xf#I`aQREl_c!j%O3+qq+()(C*z=Up)#c
zZh*;7N{*3Z;1(9vzCrD_H7g5-1j#l1Q_MKnON{y;>ApKTJw^4QAQ<*!&n@j3
zG^(i959666m(%*gMTLIK-Vao>ufN)s~w*pP7}__S$~d1bd_;CMKps
zkCp2$nDC)MMK{-Y5ns?fN9eUjRPF9Hu~c)}{xhH#Y_I1HfCNRDj02==U4MUnQI1!1
zKrJ1d_7e!_P_Vvueuu6z`ca_o;IzQaKB;^;?Ybb1FFheoCzmVK6gOS}(gXpa?Wkx;
zE6C8P;+oqIhktbg1+}kFF^`H)meB#T%)`Axffb=8d&O^_#*iryY$IEV
zKL5jLVhqtj0;;+()WQJpZA-e-k{6^XTi;khv+6VzRDp#0J+fhaGRGC9ub
z?k>tp^1`6*ozh#dDhHcZmW3Et3<~J@y6=iyr2}TUOO2G>HaDTa@a9U32u4reajaR)
zwe)3nO73?wYOUL}Qt+4UK8d^*cES#vg#&IVH1VCpBeqC`XDs%w6=eKMItfbW9%^O!
z#)WOZ+2$^~$0oems9{DHtZYPe2YITU09O=P=5iosv;p@WTj&0ObK
zair#{h6HdlAivTgyac8H0CgTU74PZk*_EP|
zNF-V9Hx=jFUFT!^Gz@Y5?vImXW_oGH$q-$xeh+*Z4EwHh#`g&rE&#x&!Ar##^@HcH
zmtYDRV0`rLMGs7AKTg}LhUko;cJm)?ZO*m+YYzN46XD
zay_qXXpeJ-DETWfLynUzFE2}i#+e5;B<~}p*7WjzwbDAfAIOs*ac;hqSjz7P**|)4t0|FBrl1Lo4j;<*#w@5$b
zqg-VowzJ$S(rb99apls4WI>g=R-eF^X0FI@dHb|kGCAwyJX9raZp9_LQg}z}`H^8%Q9ss5k~*0XqCCr65sz2;CWVRs?aeFJMr5VT39M
zyZ|QbJB7Ag1tl_^&#b13q*xK5GXgMSdp|s5A`Cuqu2_t4V=-|>0u_k)TIciZz(9P+
zzMRT9a|M||k==*SDYuOd(6?&G&fLc0i%xM#lr_-AXtB?w>ZECSjGkj$A$^hLxpr@<
zT?U_KU=_aG<3tW>VYxyxHoK*ymP%ecDsWOOeZMkE|F8KGJSVvYTr)Wj8<^j>I{hp5
zQMp5nO;I!k0J~dcwRHk3oTuwpc;?r#{p_r=$f1(2+r|6vrt~&*ZRK)fnPV~H)BKsq
zUbX8hJTK~D!Vb&P?Pv)#Fl!+JaHKLoNH);H>kaZ~oD%~8Rv>D#a)tkskzz6cw9?&8+>Aso0|HDl3GChc$KRrx4L$#U-
zF~C~3BMnPhbIQ8azq{0~2{h%i2}~PbDz3D0kGVU^2YL&GkK5faP|Vjt1Y?{iOOzN8
z0qg_fjUp9_6S+bgy(d_=YdY+?=1Y$1e*1PjRo=vne%^(n9Wx{=(ec8Xjrab%e`i^l
zLt&W4l9NM0cUeKL6Rxtnlf%asJ^U0w(LCOEiv5oK>0h;uhHmO%w-z>VyQtk)hQr(?
zv&p>M3Wf;JZzM*>Z-q2Lu@tK*P~tHQwa0_1V&`5Ib;9n9n(}8LF=+6JkCq#ZC^)Rc0@-p(?+E5b%JlgI@PKJvQE8f&aS|P*3paFcd)TQ*vqM;
zZs@R8+1Kq!42^3ux9tVti@Ai@mv3d}nHK|6GqdP)FuGo%Zx%KG>uPPQ>)T4~XGF!!
zvb_D8S^c2OVdazTrLv6Q%t_YdhL_wLAPMcBc$y9@Zj5eSdX`t@20jU)Y_OTthvsU31aF}kBfb-MsU$_+l67XlN&020_^9n8Y-9?;!=p3e~jhL)c4ERXapuiq^
z`t)f$%*qtkk#JE10(74+a1?-XHkU+dmLA*&OfR2h>(s2L^lYC)nFXxjiJ&KPtn*^@nt-vJ~Obc4s1v
z*$VAqO?(UI*!L@(AHuVOVoQSVi7?Qqaa8`oadx%R%KH+oxx^CDH+G$Nl3UI^tJmr6
z@5lLk(hMwCu>l<;#A6r$R@}-We0ssPR+74lt!6FRm0(a<3I;?aPf+r!Fu1m(Lkd5-
zA2P#9IzkKi6ogxNa>ITP&Hm0+_~lPGn#A)4tz{GRWB8uNcBO)ZaF29hi@&lhG@r9g
z8#viESh_k^F;meHnWaj2kf0j8pj%PRF>U2iP1%+sN`X
zajvl&dC0aZq8R$rBc2QPDb;)t$P62J9oqbkhIi2Ef(5rPk=sQ1h=2Z0kGOA<@oMZKqV{hoFi}!R;Tvm^iHNW23f$SxC`iwAL_z~0>!D`10Y
zt^sq44(EWU9W22>`aX1Qa$n3s?MPEW{N4j*$yh0yM~~qFh31`YifpoW06;E?W!NW&
z0AG`&@C;vU(YCSQYpNawz!*=1zLMH~&WMos`(x}BC$)3P!8C+OgKMF;HGtdhyO=qrLND~;POkGo;q8=E%NSG4bJ
zU8~3Md=2!|6wMh^@}>AC0eh2_ClZtulM4Wq2Y9NM=}sYe?}abP-lK0JpbBwQ=nd^h
ziwxIYB^!81W&g%igDdoH@iy<#|+QXoOF(U9AQwW;+{EZdHOU=nX=J)b=DbT^{0_X!km2E`A301gBs6CD|VfLU$*=t@ObkGGT
z$zlMr#I_&31LsY-pRU*>Seh}DT>XPE&!$%JK&6m|HOH=R4wPOT)WUPl>`phl=5C&s
z6i`7tiA{9;9$csOeI)nrge4W(Sy#zwUHuWaCtp4@e$Z2Pv79su={!^LvGkJr)QPuC
zA9VA^2Mn91>2*y|PQ^^Bng*CDgK91MvA`Zzo+6jU!@tAUL&$qaMUnA9bO?bnElKK}
zbZ`CM@~eTk+nW^lni1h=7fDKqoJJmCc)>F#T=`%LdHWd&4EDRChNfmI3QjZ?+1_g-
z!)}en%X2cuKs?>`yd-NE$HKnyE6Br#0Aw>ry`!UaR^tZsk4vT~RjR9r4c&O{*`fzF
zBSJ~fH9AXdLl3s0W0#>UjVkQfite3qtEcTRt#=6q-p!hi8Q^NouDnHy1^ZtPlntOD
z>%|38(B0+dW9A(oz*ltpo?-L%mh`LT4K+S1tAHpw114ELWDnf9yNyQEv1v9Cw&n{X
zw~}?J4}zE^!-&AV4W)AKMyeyX;3&`la<8|XKlVb^r87WKq-;F9=?#OR%y
zj3IYP40=g`fSXQP;Bu8het2JA(Rkg8oBlh&b>+Sdp=`WXjw`n*pX=+C|0CIic)
z0FB3@PpAcDRdI<9?6P7B8EAsWnk{&@U+llC?!B$0jE#tGsdAWH`r2e;R-{iA-#o-*
zqi|Hf0ztrS!5-?vs!a;UbhGtQK@|I!`i>ND>YEk&Sb12(<8Fc8IucZwl}#8kr^DcK
zl?kQttmK#R2R2iO;Zm^vVXI`}4`=`2m@1C|#Bu^9WSj+cECJ=N&kG~f1hRb?3`T?>
zLYW8pe3`Bb6?L!jcuuXj+_K-S-Cqj5Beh|o
z$lgxQCI!83u6p<)QtQG&k^WcZ3YMlVEVkTJC}s=#tatJ@qUxo8u;OzX4cH437_oK?
z0f8eaF*N*-1=hAYbsrGn*$O#R)j%-ZL+F0W?FC|{j9oR-y}_XG!N>hj8YMUzqnBI_
zdT%asN`Xp&c5yl9V6HnV==A-Y5oFvEa@TG|cijGOpi*vmpuSk%#)8lOHzJ07!z6Qm
zDGeem9F$Q&jV@rz1!3aI5C@@q)d<38gSusAmt-BQ(Z4;mMIx^6ss^>kUEndjQk6Rt
zNhz#_viiZ;^GhOaIzQxf$VrRNjqf-n)_y4lOMkv3&Wu8k`i45IN5V^OlQ*xaX^*2`
zes%h|5MxI32Z2YvVc7r^``!RG0aN!@Zp8?jrSV2$MA+=?Y!yf?{2Vbi{_wYV<5}(%
zBg*|3dyE{UV6i~Efr54M_1RhQ5j;E6g}x@kjYP*`kqo>OHePW>ClyYpEW
z-0-XpJZR?gXS}Pvz3d^Cvhr>V7QFMP%jy=d1>&ZpPg|U@DSt_>r4Ce0?z+L7{JJ;S
zfJtHp)
zZ7Y?dj1xwLMlL=D!ljw8#v&g?l%U(NNi&E~EoiEBDKf79X>tR7CrZ2jhrO%*s;fuJk?M~P=%9ri%z-OonVu4+u^{qMZRWED{064vq7
z3%91BrDYHhKw*#eoP$^0n3CCZPj4+sQisTJvM1y$tJ`b_gFoOR6+{fx3Yu*>tYkq^
zeT7Fj0CmbeoBA^b#y2t@fB{&n+;b)|M|b3A<{OkAvfi+A{><2*R-q;TOX-UV5%K-!
z-XN~sfjTxo0|DUjun?Hr?`3SztoEpE+iHKPyz>1(7Ec}R^f|t|^*Z5KbWn3dD!!Z*
z!<<=Y3ajKrJA715**`LOUlgfco8Naw)RR#0Hf{{S;{4S8CQVz#ir20>BLXmPJ=1JF
zXKvj3AZt)foS0k7X7hN1lJZ8_zq@b_{k{YvYF7uP1Zm2J1AhdebbuxfG>zm%m=+fn
zrWF<{0`qOKCRtdvT7JYiyia^m=&?i>{Q@_hILs0
zVPbtOQ+j?WGKOh#cs#rYrlOXlvmjZ1+AP$&rp0U=@J0Sr^P
zcabRO+Gbyfg7;!DJbir=7P8WHEl#>@&szEQ
zuGz%*5BDP`81ANKI2^W$QO)49Bm)~~dbYbe^Q{nnckx_;Yf#Z}a
zOC456M(Cy-``T1a=6=(>9iD5q&Nrz(&M#PvFqlg7v`qV@>H@s>9%i1ydv$s^Yw&XH
zSHKvh`&eB6Q)S(pn>pw35ZsiFv9?QJ4!l6E(yI>e8_7t#o?dm=eq_7BeL-gNix{Ww
zQ&)vw+FpNnCVSv?2QdFC>878ucioZx7*;cRIoOiF>tn09jEd{2UXJGvLW)509V&%B-1
z>|A3l_yds**ND}-`;8(vWYsD5GAJX9=c|RWo&-op%I)owW2e$XR0+R+j|a40uKZQ2
zXO9Ktz#Z%A=E&B2Ys}VLD}~L20){4DF*Pti)^)euiBW7DVoCbQSTj%X@!0<6zm)es
z=DCvqhQ(h$*Hg)mcOv_m?2hXoDE7ekGNl6$(B5o}Q=~>&^Hwju>;AmvRX7&zi*N#o
z0VBd%!ls(;TF#U+uQ;Hij21k##IQbm#|uG@6C;LqzfEdqcbcgm^OzU~`gca8UiIxw
z3~8bZxXIxmqWHAhv*~g$NA-3xiFT!mEvLr$%T@!=xBBeBBE35^+y7_~T4OQCl+jUv
zdlVmEKPQz~ehv^kKz4($Zl{TUKqGolB1?@+`L^nO(^KIqSf%FT4znB8!FKzudnUZG
zrJdC)Xs2(xO+N)Zo(bjM&X?x6_1``G_aVZ7L}FCwM|R5uO)dQ<3LVQdEh{s!qYSkq
zGKvc30Et@G*z+>bCqA;vzJce>4WE}{=>Jw-(%h@KK&J8e{U!0Et-$_oTjRE5BVV&O
z+;m?VMoDZaX`)Mnoay+19=-niTRu?su9|ySMjFdM4>VF5a<@x#XSl;ZW&lE_?RuE(yk~KtAU(HPI!J_=JWO
z2W8LIs|;`yIfL#%QKZ`m?bX(=uU&|3TjQMi3+HrVib3;HXg
zp7*=-y7aS`A76+Jzrlh}slm!GN_{c;5XuHlX}XTP{W4%*ucenwJhE@<5^E`4Rp#FE
z`{eMWfBEP2f%O;Ah*x_#mUNoKBwZpYov#Fr+8St>7HnWF(q!cy)OLvq#idBQ+tT;L_%n9byDBKAYDgob?_tIGwgt%(3rL+uH&;YMVQlRVWM1S
zvC;~7^W-QlKWTg)5+2{%G;dPH5uL@#&uKt*uzGFRruT&U!2sQ#6~e4hSx&
zepnj^Wy9s*x#hxcHE{{s@4zt7Fh(#m!;X|tZ7j2l2WhYC)g7Ze)@8zYXA%Q=0)D%0
zs30A=dVWOJ#!&6D5pWzv#zkh)njTz|G691h*tpeMnMH*U=poN>4owF>@86kmno^M*
zF0$eC*H?uwtGjznvsbtO+`VBCDo`CA?6_t8y;z7!1lPd`czyr>T!tE-?e%m|GG`ZZ)bht6onxbuzPShW!0}vxfC-)D1BEB+*ePN>!Fp
zuJ{Vk{8YWMQk;gWUehyfuPsuqVuDH&?3Y=F5my;dfrv?+uf3E9p$uV;9XK~4zT7vW
zAU;#G0T^8XOCO^zdH7Ps-wa32#5C_6dwunb9**ZDj>2wpivg@c6A*J`XDL>pdk890
ze#1oXIEi+6-T?ceRn|FrpSeJAiReUJ%)r?7&q+z6CEk_W8~e8bFri!B(Ny1X&8{&R
za1AV{S%4_ymOq0e_72`MxNfj9KthI?IJV}<@es6ivIq@&IsGJsMJ@Gv;VMfhI`Usk
z04&!-ezcO&?7Fu&4E+4s&d$!h1}R;e@GVn}awrnJDw(Vt4T7xjhYb3hfXR^T&Ld0v
zV)^T0QxsWbYq*Q|rg$_HsbyF~S`k|FOwCK;0vj}UVM}h-1Q&mC7CUb|FNN}*?DV>T
zDty52Wjsj*sv}jj9Kt{ce=kwVECM`wfnAf^`#y?)e6e@!j=A!1E(`DN$W#ECz{xQX
zS-gfc{EE
z+Q?9D75Waug)?jtH_*Xa4f5@eB_$`{IdTM@Sc+0o{*V;;+R(?>o@#XD==(nc@x)ad
zP|5qz>GPG;(Nrd2P61N!hAX5Qu=SEHc12f~DdLCfOA+H4Ad)}pt8g!)y{)^wy{yR_
zTdXw!-j^P!*nytqN=jTMv@?s0r?sPHUZ|O
zM8M-o#$*2sA_V|q3L9FfHv{->WH9uVpdM42kGF*nJ*-}PoK(lD->^aB_T370_?tHL
z0xyMm*cvRPX`gx^c6Bqb>C~$9!@Z1yXYCZ#j4Em$-Q@}j?>jG-iN`ueO<%u0XH%46
z(|=;-vU0n5W^dx5X$w_K3~J-vv-X_<8(dQKV^?aGZFiU!UuR*9g8M-_AV
zB9%24C#d}fR9NE^Oxwl+M^Po9Xb$%wbVoN?6ZbHzKJ1I%=PwGTQ`-a#5*15hRFJbU
zr6|1#`0}P~itnw&IngDQCy%a|Ut5zM7n%$a3m>V!Yx)^Zc
z1n*!;g3e6PsnrLXNU0MZ?V!OUA(lzuz~1A8(~nNqoL${U(imSEYG1vE`;EXvyE?H+
zS54F$pRvHmlqWdUaqp@)|JurctC5N0_ZR<4&w#k%62xh>xmo3$5sg5AZv0HJ`l3&W
zmd>NIL7KO|>)%y&$ML&j&Gnm5md(LOj&<4aDVb@iiXvl^kjn55D`QQ*CV7m{5R
z2|p3vbLa^-AlkaU_3=#S?RnEL?{8yKb&RTrM`1SX%#ZFw&m{dK93_B&37#=yJ#uM8iHbz}XP8B$83BR|;s0^YX_
zPypO1O|M@b1d3WgbAmE5&ch|rrNI)<8=@GI+p>s55m#!!&Grh!Pz3fT1#65mC
zc*T9F4F{a2i{J$-j4vrGBSRd3f}o)F;Y8~eXkT3vsc}NH=kiaxmMbU>_=hLlhDLoD
zj89N&l`qEKmCVrvu^QKIr^P8pmunXYQ0K=jJS)!@is}>uEQfosqopgN(_xlxRipP=g`nGu(HVD;o;#H
z9rtVVi)Pjs=Lm2e(&5F`i+kMZMU{5)TOI6%`Vu4N(VHAE`k8}j$_a?s)}}ravA+NG
z21r=`_{6{8GE)XpP~KeQ?}q()EDPq9a<)qOXk1_E2-l&*t1v}YZ57QlV188(j_qV-
zX4C1n#4)h`{jbnJD2ae(-CeIKb5T*z@~MI0FoscsmQr?yp0t*7OmvJxLK71+>1}P8
z`m)LD(N|(1=IT1eB|jT><|Ceh%(^`&O?|AYiHF+_?B?sit1Spp(jK-7DUw$zOTk!I
zwBUGw6T$Kt=Hge$(v$R5jdd-aF4zkBa<}Re8|^USGm@6CEwudl(YzcCjJAO=x3Fzy
zQ>|DJkERdeIYLOw_cQ_B*nkZmE=U01TOgN7S}(gZZ4i@w+kXU=WI8*sk!~A0{@WDq
z3f+IZsP!$nVm_6Ku*guQWFjrq{!5{c(2lqkAv}RT?;95?jAZ1IYlK5;V>62klWUc^
ziFR5hh`E0*HT*U$r7q_z;wBq&*S}lBT|-N?!~r-P3z@yW~Kv*1i0838CZ-b
zt#j#XUq=fx$zrtHL?~=T%!mh6=jbYa+5of*HJ8!kB5%K>)wDnQ&^Iy>q%|Ds!(^Ik
z*@#n{X)lK1m0Gj)rV}Zw;+|q_<5%KpXEyRZEX)D>?EK;pAQt9GDEb6zToqm_R@=U3
z%x4wY9An377{aPltVSsqZw(h#@t}8L^k8f4;&-VlG(nc^#|)DLOZ>$ay8OU*Sm;*F
z6#lh^-VHWGO$3jrqTx6?8u|$~W3;oKy5ojYm?XCLQB~-4bL4f%nty(S*b^xFoXZ=q
zA0RcZiZp813XVxF`*@qIU^JP-U3?BdjT9bW=+~RrDxj0z`OVZ?I-7JuQLW_Hbp{{w
zy$lqn!qn>y!V8&Y1gZ_B=NR8gj#5h9>eYmPR}h8nhx)cwc>D&LFL{-^2`P6G_6c=<
z_3qivxMP9TAFZI6OUGk>Z0B=g@oM3UznS=3>FCm8mf8cXzAVAfkbUIclH)?#6JXbz
zE+;=s{+H=cvf`ql6~Ilh6F%83ut=y(99g977&wj76|tKmE_-95pJ3S+mZZF?=6{e9
zFsGK2nynKp@@cutBOuT3r{zFPw8KJqueZ8Web}{o%}(CjRn#$u9$%wJd-R20&yIT4MWpeQUO)wb46z?2F`I0
zER2Y=D~sFuvEfpSYh3m!uj8PQ1GMbF
zu5ZoqW$&J>oT+=aVE=CP>_103_X+*A+p_#W55RZm0MwO?7eLE?<{Vw|0>?;~?ppl2
zn*~HEqektSw`|79LllIBgnpbvcWlPfx{}^4qS%)E?C);HiI5#{Ry`OM`o&#=?I%WN;#?
zD$Mp`D_c9;kLDE}Z{4?i&2A%U_wQ`V=4jL1_g*vHXZL@W^oaH_;lwx5tYvs)0%AhCXvDDwcGJu8q1%qcqy|?EPvy{Z6xW9(^7ZN(O4Z%fYX=?T?
zCYS80X&sSF$L#ra<&wYbEY+IjY&EBrgMX3N>G
z=NMa{XE@qIge!y~u)*Zn)pqKhZ)^J-#hpN;;*9&VK$DBEC0tAS6OXP$aECD(R{K^3Q06Est(q23B?da|Jv3h{9{&AHl3-x9eXA*1KP-Se
zR%O`khXvI6p571h2UhpRORrdfuOQ>;4!_^+=->RXsscK?k-2zr!B{{?Sp;*bgX7$l
z3YnV`snR4$(CMj>KxZ>n>t=udNw_sM@T~F8g8y1pPx7+TX5Pv00(l
zTPt9h#n1iMou?GkEdobH+0T0JwQ-wvsFmwWZNnxTS4n9g3;1L5pYG(jO?+VAINFd}
zD=@Y{edM!tHC=B^gvD_29PCjzc^Cba&dikfDLnNtW9E*qgS~w+wpEOl
z&5-*q0h;!86WFOwN30<#IK2AXtgrvox}HU9{ur-~m$K?EO(~{Je7y>%>}`<+j9z*o
zogmKqXdpWS8f5cb27IcF{=C<^1IQNRsh75q%4-zOE!tlRJPv${MXas6DP(3@heDPy@$^
zkm5GjOSB)Y+rF1_tE6eRud7QI9MSkybcv11drZd-H|d$IJL$aqqx)_$KH}n#9!p$h
zUzR!ZAt6O@kj`E09T@go9jWGvvpPNUTiRSuxxyfkep`4l->U<)R<-*hsz(c@V}KtL
zs=6%X_I{rH5GCK_OCDKAV-dc~Xs&5JbC^>)a>hCYrN9MEU{SR|Se#mr
z+IBDzcU{7F$r)E%UI-o5qWGeya-V`3`=MTH@9PdX=1LmK@W|w4t#WxC;{Rf+@gm@i
zU1nFjQm0vFJlt|oB=!pf9$i6AVrF$XA?oWW!K+jzN9h@!1rW`dRkm>c7AWh|L31&Q
zi7d!6A$c~DXxJhePl&<8vp}!$@&Jas%XLy}Th>0h8q`>I6rG-6C}|iCQlMY0o3#(K
zO;0)gjW%Mc+GQR-o2`wwg<&QXpR|1`5*xM~Rk*s&aF1y0*q1ArO%x?#W@46OQE+zt
z7-o+_=tQXA%yFIgGdh`NwrTC%xM$fo#|gG!b;wF?fBvn4bUjsrKmN8X1G?99LX&i<
zL2LT==EC9dStiZ2cNku2f}$(Ig;PkRBX+p|&~6(0p{4QV@T=XNc4}wFE~^FpZn@lu
zUGyfVZT6S@f9H}lxHlG6^C{a=n<$BFSapi61CwjzBY*zYko1Ivg#308_y78pG!Af%
z(3y%S9aoU;wC~ao54N6a`v_KIGwSTL&3dC
zS!$z~{RljIpOoECS8dkk({;EDp(;Pj3W0jPpRz~0k*jFe_n1P4dh*-pA5pn%D>}^y
z%a9Ac2p6)m(onp7&$<&CjXKqDiSxQ?7v8|ywx~vAOqGGGy-`S9%Q7U==DtB@SGi{(vLdh*vQGS0#gFHHizXH21i$LMOa
z=X>bDkM@9OpW@@pV+S>zu(KKB7MNOC$y)yhK|Ode(%A7rD}N*pA%DqqWaB*hd?ZS$
zu4J_2#m)QIe=%v#b8vO&)(i``jlmcQ5*(e`PdOkuuI~Hza>AFv#7fLy@}R%()2{ho
zHvu=(+2N`dK)3vW$`Xc|di-wCqh1iFAbRqJ)%Zw6-iaAZxI3CnxFHca5q`91ZSVy6
zuwA491^hac(kZCF=r*M}H%FMzGTUzpExojATG
z|HvbbQ1h@kbYwK2nzYd>vN7h{T3_kcP&6P-e0G#+eBl3$m_JaF)b+p2Sh-SS`Zbq7
zM80WjmA7tS^r1iB*Rj5bdc7Pj+HZb6>tJCLK;X!!sQ%djS5@N2Nm(L`NKM(7lv%SQ
zZ|N8*?H(|#FMM4Z^12FJIjOAzXNe*J_wkt9W93%(j_?WHt
zNPf@xB*0FwsHsxP4uU)T*kM`qyPI;8-i%H-6ohFFs?42PNY9!K;3u*(KFnbCy%!X9
z)lj$X#SCMx8b0DnPw4hug>Z#4o7W`_77E)-7=8C%-fHZU>4Be&VZR^pdBDqEjpd?@
zW#O|6rK|yhfuc(Ug1RQy_8?|#;5yB-4PtWr#K6H`qBy{GHakN@9|zlC?y5>H>x7<-
zqZtw28B>&~O)Y}Nt02>Ia!|Z|b}+1wV6v~%(;3l)WOXQ>eL&R|NJxq
zl-yhBW5dhwOxzcX`%ddm7?yk4sTy8L{$>ogi#lMEFbda8eT6mCq}t0`g!m^oqz@8O
zS7xTqoD0vI5fEQ$khXL@)+NI#=Sz
zhXJp4>b`ncHU!nnuH4>{|7n&fj_zf)q#~5X43H|2eiHUuDKbS`(FlQ
z6xE8)njHp~BEVxat?pceBd)93_691bPsD23^@fhi_ohDT>)WkRJ-Z!wIbg^G4%iO`
z;E!*pR!t2T?sQh?gqp19Uw-r3kY!cDGO&h$h@q+`Si>V&el&me2`QJeq1nV?kq|0T
z>-Jf{O{@=gS}5zW<~6tyfoj!r4|Ut4yJ2;r>vr;n!@q?El(L%O=2brFJ=4kc`^{|$fwOOsR{U;-iuD{kVBju2X~03Jfk@SQJvff6p4XqB
zL1w_XY{6=4erAA^{D@o?nm#WSkX#`}<+Hmry*4Z5WCo=;zb;Ic2Kar4m5o&lWsM&g
zMcL9Tac(HG;b7-f`qNO)q8CL9r0Ejw|f;iUfnB5yj*VmFIq|1XKs2l
z^rAb!%SmL$gbG-z}S;Rr#J*jNUw4IQ(
z03SAeFmi!y;8I_vr;Wz$NdB_YW%$6w9EsM24t2Rfyrf?5@c?GwN~PfcW+oVgLGC;o
zv;){Q*r7fawJ8SjZ$;p(Ep@+YztR-6!??>cs^#CQ+;HEJXpLam;OGS8Jj)P+nc=KG
z&|1_3n9ff71_lP0IzPX`?iD7|3T+Ie&>7~3ogVj%jeU^j-K=jZR*hsgl`nB%z-WPP
zkMMBiP6UVst)&sLucGott2ZnAl5RVA)P{O(Of^SVP7VFM8{+3NrTGtLt!lFYjS0W|
z_c{t`ppc-GF|g*4>pCv(42Z0@EJguE<)Ebw#?&5IH>=SsT)Iq8?zWbZt!1qT|6Jkg
z)T(>(9E7LK0t#myH_}+(IefK=MtDOAR=p=?mSo?LPonm}GPJMO!CRk!&)ZStFd?N2?Sn9t=#w>r)xdt>FpU8~)(w
z2a%TRY9N(1AQQD7cxc*Mo8#kZkSDx?F2)10)d1*~KGfH4!c=*(Iq9
zv98QyfGL)NjMOd$XxnJTP^*&kfS&7Kpg*KwU@#+oU;$z^IO1|-Si5ulI5h%%N}p;d(aA601#E6l?=J~
zhR_rUS4q;w*vkWBiYYfLl8nEB&OyNH$DDK>9*cg!<-F?xPim~|fDBv`(5q@6
zjto|XSAB0_F{&+iLL1~G2oBj-jK6;UOjD9zA0ZEsE3n2B5+U2PL1lcMr*5~0akZ0Z}RIWx4nT(mN
ze0CsyHu3pQ%d?-CO$`r`YUvBT!_P!j?}2__5A3)Jmds|*cx4e0>$04_nvUpZ$X@)o
zsSAI`W{h|mZvh;vp}Ea&Ha8rv*H>m*;Qc3#i(g;;yzW93DbbbL7@<}snYiOw+9NXZ
zn`lK7JxVHCVLUuMJ&!Mv^^LA;mq0>)!+U`0E`RWZ^Lm;w9D%6IiY0wAjAfvnN{v=7Ucd%!O+x3eC!z9=*3dnI7q!cnuvM;ly+M~oR0@mvXcRf1Zv^nc{us}
zwTF~sz*D9hJ6DG3k-}Yoch4*#REjIVK@4&O_Vp8@4`V2VYLX>Ctty6t2{{0qJ_hsJ`lzDphj8%EYtVr%-Uv
z9Sg+8Ab&QX19OMx$I1>!-0eEikxS3W$;U90phVYas;H(uO3!9+D*7e3%VL7Z*5*I7
z#;D(-)!lOh`ktUE_?mcc-#zi4JMhnqBl{HG4c@`Le~#ea-K6{Tb9i6~
zRN`B|2bmaHp(5aG|C`YNcIba5_ao;2-x&gK>3>e)e{TEl>*as<5On|k&nf)RDf}H%
z{lBrC$-Q8)-(Ir?b;mD5Xdj@)NCgtd?0TR7LerAGHTr;qoqcEQdCWOD44{r>1ZNT=
z&l+4p)hajV!`)n1OitN6g57%J)2et=AVpk&!0GowP_n5~xfSTKle83N9IHk@2})>(
z3jw1_PT}|kbPW0Htae0aBR%+S#&3&BfvHQqNF-pAX2pIX{B330k3||tM@Wy@_evGS
zoiYo&vcOY~=Co8Vv9QT{>L~~T>Xj8kzeS*4f7KX8TZUI1_UER8BuX&{Sy{;kQB8>h
z?8B+wQ|;CbzGf()Z`lNZ?4nLhGV0`LNaAc5JCF|87!^u%)im2c))1+s0A#FqDmiIs
zWpmLvdh1pJ`>^CDHQu5`%}IB}yS4SJ`+_>?>;6^GEpX8G-yX%YpzVw3+%K-+8ar>U
zFaEXU%2(wH$s=!@WWwgolynh7({sbrPm2&_n{7@q#Y+d)dZci(krYYhIFyjl0eBq>jv@TS_aat(FWdgGahyHqFHQx?j3S@*
z1$4t3X+EB6>}`necNH2hs2GDo@^jhKEa8zAj36IE>RcmLc27+Kbc&A}@;b0WK{dYJ
z5~RLUez=^e04S<>zW#-8Mq1a8uPTJzk21_oz-I{m4_^BFAHfRQL7Od;_lG=OK`kIuVaH4Hz0oEDSO;ADl@A`aaZ9puRWR1Kj~6
z&?n+0dr^ay>2LxV@1FsNIIZmawi*C{&afcVr;i2H*Qa9heLyyOVB?*Xarb+rg9UyokKhnN^|7tpUK(zI_MxLh@Cv
zF;>fpwPKL2T4m_6b8@BvtKriK)E%ZrehB6qwJ6w0mvO&0>Ik5KWS~xPyK-46R~*m?
z$^a%TF}5r_phC3-tU4#u0My5=18W`U%lerlLa%x7+jk*>P9&C>aNdf>i0hb(6?0F`E4hH!BOYFSgr(Ub+v;#;f
zJbhyMx1+Eu9iN@eB%E6iIaO`$i!@`_EM;vNGX#Qpi{-8N(a^Op04ror_LANJW&_ok
zjlfMagr}xX2+RkPaxpgqg2Tp!7II2t7yMfx6fmdwJ78jWO-=fLd(Z*4Mn?lsxi&H8
zGb{XK+QFbiBP=;VDdfy1Le?1{37%cpXv==F)PJ5m#UYF@*h^XJ&(A@SbHj((-@sOA
z1U}$vVkGJuKf#fIPk`^GtPoE%U>(Z`y_0jyI#s+t89lz5(exM8b%iS~Mo5Qp-QPIY
znFcx*C)yUBu5<%O5&$$9=96F3Ue3L8;q(kN7BKfirQq_`I$%&b9lHF`RcOuLz
zH!=9#{l3%s*bdM%i6DC1enjx?G*O5A(WNVD@YEuAL$0wGLOftVDm-gIDye4)8CTV_
z2lPM$Ajvt20^?5U$|X65bXgSJH7Tm0>;q#B`FC>51@ZSOdL(@r+zeO
za%?p>G{LTq_6O9CgG&hW95KKq+{(;3as*6MredSYwZsnv94NxQYpM97-5ek^vlww4
zwXCr80O}UKKp5mbup_wx*`4yiN@n+|^AwBWoh@BNszAx*5b&eK=2RUn7fyN{rGVa-
z^ig4)S#sZ_X)rMv9KIddly`tU{q7I&87OdOS`^4upl{yZ;dp^f$zIp
z-1pr9p_nw#$~zDza0Q%HJvWU%1YsHo>?Gi%KwFc-%h^{YcpMAhJdYp`0PG+Swik>E
zeD|?8oI726v|ZPf(x(JH;uNpt%MzjYpAO81?VM6Y&~2C>$Cl0pOXOESIEY}{oY>Xc
za8Vfnw9~EFN%P|vpQ;xd_1*|dUCP?^RQtqjX=No1*q`*d(tzfigGL}113374K9+NLLT+
z6qi&ot$|ON0$6kj=>NI;#;aK`i3%LbL7?>jes(qayGk;1jWw+LixJ1$OQ#FOUNWDmU*O<^>)PQu
zE5noGCURHB^82DdM6=J%+X!PO@vR`nXfha6v7h!UtzIZx$!;t~!BZo17a^dV_QQ)O
zcU3vN?$1*2pvR$(7YcM;VJeC{qJOHrkr|bfDgzjg4X&C^~I%IBH`K
zdO`E;md*(lgrR5dT`H`;p1JCG&^oOVNqj9xAe(U_xp8*9ef09He92v3E$HmkG_axp&C_ZU-p5>Z94Pl-^VAlsODq3iJyH4Q
z#I)!6YsAmwwg#erX*dkTXDFz{i}>$6K)-dsRk~RY{GE|d{B$&mn6n^*exAw~Ini)Y
zOQuOvsUg8mlhZ_lj@4XzbPzBf8PSmSR?VXnW=VXu$wjZz!TDWB>r(xsKk+Nq
zHnyhcGA&RSvVz+Zp-k&4)9(IJa>;RVe+ii3?s(PtbS+-SJLu0hU!;Hk46z%F?+IJF
zu^lxDoZ3(dH*1KZPw4c?8DxkrVGg+96in0`1fM=*Lk(plzriL-WpVq8J$x)={J}=#
z?!)|hhTKNu*!86E{8*|Ux<1_(tcvkFqH~F!qj$l5>Z`j9U7glBk}U|FOF64~vRvr>
z>j^KfxJhoE0O7FeElN06Tcg4Q*tgdd&(XrL<|T?4a8aif{C&4`#UxukTzpCao@rM3
z9|DQ5?eVa|?|Jx>*F?|VMZM4*HceQ^n4Wayee4W+s~P&UM>ayjuH_}HL&kqZ!>m|K
zj3Cunhu+u24qB!+gg=#dvl!@)yeC$o4wC@}u~k$?GMHQQ9xD=hY>WC99uw$DVd6`v
zab?a8Gz2SPv>uX(vvt|d>2RU5vB9qR`6W~U4{!0+&pVbfkaz3ZvI|bbUz0(AV066@
z+`Sz{6V>kJ)V^O-x{BNpA~ih;+j;2E8E}A2
zEsT>->_Jp#L?vw93s^q6H9AmS#vLDaVm91pv4@)8^X)%jRuIVDw60!YMZILf6Uxxu
z%a3r#Gzprd9lw?*e;I9qMZCLBiQ%RlrHF4ela>OnAf3k+w?oBxf#x;v!s^EI3X&bg-RX-g5O)t)>O93~w
zyPsAGUE{vP2QJ!Snc}2v7#=Sh+$o1`N5|m$yh$gPOCv@bAcIzzOPonhXDhtlL!hD=
zqz!1scQRBe@A*>*@Hbo>BWA|8R!w{>8#}FsW+T&}fNQ`V8-8CJZZZhuPwu*JM^CnSu++1zN-&q*Aq{W`VXtwRw>FitOwcFggKul!AK_QOO+Li;
zrX6ZHdh?RyI*c@tR{!{_Py8_aBDre%i|$F`Q@0+X?cJ+5HPW8E$9Ut
z*v|Mxeg8y-_XV8EFLys(PrC|#8AoiIeWA@3v6y=6anAhw{Oah*_ZkK~;xxf4aXw#_
zHypF4-7j6T>%&uTMxfJIKN-Eq
zO}HIFAl6N)E?DWUXu046+sE4>e&m={CSzVfKe*KI3i~L1@V2daW<#VciB#uQv__Ju
zD;l`M%Jd--U6adMy`IBecWjh?g<$?pYz+y&oHwd#c^AL_=g%-)0Q$CjL1c+fvU
zpBZ=(l;^5$Ia~Y+{cs0hD=YN+ztuKDxpg1NlT)lb!hWmk1%LPN66SiIvnT)V&F;QTMgyZv8!k8rkbmp1QoaNGu*P
ztNt(SkOJXTh6S1IKSl$pdARN7lSL`q3tyx#SFGmS1JsS6qnh*n1eAp(he(SRp3#wrfGOE7+;gG!JK$10LRk79sSi)Od*rr@i
zAbk-BlIk8%7Ie{VRhKN!q&sn^<~&X^1V8|GKAK9Pt|i$WF2whvbOA(-uyP=llc8-k
zTLJ!bF94?Gn@Q2qz!k!nxvi{WsWdz>_+)IsrrH{uJX4UeWj=@G8lb}`r$)i&Vvl%e
zqYt5wh8jB9kUTjk1u}5y&(!W$32)g0&F1!iOg0(RVeQ23e?sO%{k;FI+Z5Dg6Obei
zR!r6m4s?N2w>t#{#$VK39lr%dsMj8?=Gg<}!Ew~e&=3yY>5%ipmd?)f9F9BPLD~b5
z%Mc!ad>OzI`JQdSPexjk1m~W=+4#`?a0jZ1(B4K2DlT6~D*749f+=Y9
zLRB}68$fP#WT!jOqfovB$K%`Uodp3@S$-_bYUxbC5?~wecx8N0oRbUq3_CiiftarG
zlmCSn!522ZU!JtyzgHXN|
zCH&ggKz4K26liiT0lY=J+h874vPl8W`Mg*orS*tKpB<27^ZJuLDi-hHC^&+uZze&A
zp1&REIAUt*$5i|bh*3#F9^Yke*m$r_Z18b3#s_;h6;#a4BC6yGY
z6h$~MuLRn$Zs~(vhZwY~6?2^`
zz@&<^N`|1S8taV1a$pO|&@BdurPH6TiT!u?ujdAkQt^WTrxcLJ=%p}%OLnqAuW7?$zv74tkh_BtAatwTmkkW^
zw}=|MLs(xW@hR-w@LTJy%QAtA#qwbqctE|FA%lkEACvnP8H^`_zf7EjvgK8wBRNsB
zeu;q4;&EVVqXznWiwXF-Hf|V%RL?$w`^%|yA0R?(*s80=qgG4cB|_~GXvT)`dhkqp
zQ|C_!?yQ3x*CQB6+$Us}$Xq#Dy=mcnUw;TxJND*tXX;z!EIz(5Isx`ERj*FlWlzeZ
z3e@gBuaj74kB*S4sRDVd(I5d@VCg#0guio@f}a-xMwURT;aYM~sedhNQI2R^qXD-z
z0w5Smz%*MsZqmPf5_#?%?rpKBj}_l2j-sGsVkKtKPC5gQcw^YsO|VNQ;Nj-0Ezxa|
zQGMfa@-tzVkgN3^EsXkH@7?e;eJQ&ES9x!^hE>#I`F>(s>{2f5#JrgPm1<>5DG^l0
zmpd^4
zMmJf!8!L!JWA)j}v-Ih-FnXxo6V>fgHM}qHben%b-%)}(Ju*I;
z7W0bxUQe5E8AR*F?y+tc*P62n_=wuQ5*l~s(GX@wN$+kxFnaztOtqso10no^X5=nS
z0qQFbED}Nl7lii?NpMWO&q=mz5Y(of&SUr$(=V&nGc%`|R4sNB3yB((nqcr#58bG{
zMO~_R=Z!>PL9W<$gIA}K){N_K@>UR3-Xubl0Br1hvhV6)5sF{gIvqO#UN^Sd!v?X=
zi9oO+!>I2VOAvR9MzMvO3&4QyHL3ptU}NE`x})*6DNo8?0%wpeTX5%_&keh9B?-2%
z4G47Gds+)La38E3+-Q2rlHKXCSD+?Sv^b70#Jzn39)-oDfXuNn-8+)e6&;&Ubdjx$t`
zoVEzttEnm#L_T2lx+3CR(+X;n5$y>Ce36IZcrSg#ma4a7Hj<$ezOCl-5V=sfnCO?^5Lw4KFX?wqYw+#)*@Nj_kPu6T(8}aodE;*>yb*DH
zDHZR-+F@Y_ozQ=;0ICkqYL9mWL91OUxU=Qcr(zwGBM6<4d~Mdvomyg=NF=!9vbdBn
z!l`5iZ`7@A>8e=-az|6W#IMbqC>FIYiluMyb}rkBm$`y`hm;lhHVbb2wQ#;yB2ZQ9
zUF+3%Wm$>)(mRZ;uMI!)dF?bLZ{j`lWe0fpDu>HobC2_f-s2o)6$?BnZ9*ycGvb5`
z+pyhW^@ERnFTxO_7FH&TN4<9F3r>>l3&PmOSS?5C_W@9sKsw<`r@w5d%7%HXDM<*NH^(7>-*B8U1@sOk6r0os~RBa>^L6#1eH)Yx0`b
z&hBlFj@=E^>BjK4fkibUwA#gfB6wjAS{+r+!LCXH1A+x-Y&XqC~W
zdbW0%%C1vM+U!5lg!l{)iz-pwgkrvU7PuRo5&5@81|5sQvJR?U!l6YH@8e+aUJ~2j2#5+|scIA~VS~2Y
zbG7#wNbT!uh^e52>X-nsOBo?-z#6wK#?7Yx!k1O-@f~FC`XU_Escy
z|K=;+opR-}py&$K&hZkrJ>?}ptGhcHj!)K>}rJ^XhMo$(Tt}{8>^>kHgoi4INv}c{L
zv(`hy!x531ANP3|8r*Lw&viykJep-bQ02eKm!S4D{kQqNLEkW+FWa`_syl?nP`GYP
zeVJ#Z%VX~sf#Y5NL04qB5^8Yi7e*dcdfWb|#DOK=8f;T>Ofj7`iRty+!!;uvfWS^s
z*po4vZjz#zLPK+Y0msAF1lcr<>ZhA-!<#+Svca!`@n)(5bNen2|2(34G12O!?6hP5
z`q_4DZat$iGupGIYzd&|A0(T?&eSr@(hm!X-Ld0*qT}3cQMaDf7b23@V(;Y|H>-M)
z#$r(oc_;7K$-31QF0F=;NU-YIdMcixv`)*HDjw4+MXLM_tIf_9<#^w>ear`zr5Ph_
zeOvcIRW=Yd9a#iP6c%^1A(9Y8D{Sr!k;ZwT-N&I%A)jlvZwhzdfdidkx>)_V@@EL
zGj1llK`}z>sG+1Cx-Aj2V)7+3*@3eW%Zg_s1zPg;+iMFqbReG-0DXtoZDGGMwMsiL
zg|Xc^i*7VNBhh)gLS$l};}
zDCpEWQo=OusW>K?84b|G#+1(IT;#r@k`x!xZtOU+#NhOx?I#^f@okPob{8w_jO`+a
z*huWWhEN9v>b#FQ?i7C*4>|%tMQ?i00RtAg5J|Hh<&8z?)KU^E8!@MUnsnChcarxi
zARz@XB~%P6ZCvQBN&)yc43L%}(~GYadj(Om7CzOM+U1_eXQ2%<={b;UAvFjFCMaB)
zuJEhcGnEvRN;M^x^5o*o6t`s8nPqc(7w2R^btStl$+DK^E9hV)FL-tfsOIV@Y+3~2
z)=+hoO9gGAQaEatY}euxbBRp2CM~Eai~U~hw9^CQU1Pazcq4`6)`j4pxS0EO+!K#J
zw=zl2HvU>OHajSqr4b`1OGhVEn_O{EnokJ2uLTZ-URg`#5vfIN2K_2q|IfmW8Q<8U
z{i}!o_qY%UHxmX@m*in*T8|$d67Np8W9Lo2QomE}ckjuYOd0_nY^O^uq(Ju}l;&tm
zuY;);1}mRb)eKc}nxlKe^$X^60b|n5Kj`lr`b!~~`t#jpTU;;TnBR{&(EGJPmuvlS&_6-%eJ<8`5L;^N
cvzWZHB0(f`
z`-Ykm@f7YrDQ(C0?)+@>88+s3GSbfz)s9jd(o!1Kev*3TlX&^{7WZX;nVPhNvd7j(
zWG+AELIpsw}LeBQDe@IACo)oqp_pKnKJbtoqTt($7DYXO<@xTA^
zj68fX_h+Hm5PIRo-fxIV7|y?c`0J)-A|HbW&vReGe{+zOe2`}F66N1_kRbAwr(yGI
zDP&Bz{`WKC`m@w*UP@jcFA_YAPr-{wtj+xK!oS}Pxoe07{EhfX0l_OZ@Dr1)$!8vI
zBzUX@3H*)p>eripUR;8$4PN9*wiE}|pHC$s`TsBXKRR+8k!ECx|C-gFbMHO2U0g?_
zOtNnJQ8;v{Yih4AjNGdBRTAGWbYCBd>@2ZCUOw@rvb)l?=nue|r>BmK1F=;MDl{;v6WT@ljBX%$a6=>Ke>;5ON`!_qw0&)-lo^6c^Rp%XH7QWqI?>fIW6x{1WM)~_&v!lzm
zHv-e%2Ur>$S!j+*usuS8J(b5U@vLr%HD)ut^Gwlo&I_f=a-E~!qOGQX7R@AdrZn+Z
z_ibNCr5uVhznXS(C#j~`eRHMQvWE}foo6_Hwl0X-Vzzp>imN2Zwdf&>uzdrj_VpE$
zpou(#&(H5PnT$JJx=qG2uBDT2}ij4mkMT?j+J|~x)c!TvuZce*t4^}NvTfD
zY$5#XaEhqw%Ig*7beXX88reEUgO(zruMHFX7xxpB@~OhAzJfo8mrIT_^W0gClb#+6
zVivL7*;-%eHVp280i5z@kA1HYEm$TY#(BoZPUYU(+^>W_8;s#x?WS=g>H)pJ)BSdj
z@e`g9TG@FJZhIYHBPZkKlZ=PhbiiS{da_IUCpRcF$tJt1cQ93-RV{j^dJ0fo6ezat
z_#68yeio)LM-YjM_}M)B&Y0poU?l{O`D42q>{
zXTw5dGA*gEr6pUpq!`9}r2K^r3PT*lgKg(MV(zcr#fEy8zFO(BoL_9!EA>iUZc5jt
za%5pbhX_+J{v+w>g}DHQ*~-;eGfz6|$wa}33GvzLdB5(o#QLiTx3KoLfGn
zsXStx8$z}nI&WpMgPI)3cYW28s$CeV71+H6D`~z0$^ursv_?I~(kYc*6CNTctXFeJ4*Abh`VOvd)4P>a}R7T0sdIlct0
z`}bG!&Wf3|PutbKV3_e#uMY^i=DsuG^nFz#F?=%b&D5BBqSX~D@83|Wc#lYSDo>G6
zeA--^7{ao+t@M~!FZne_a7kN9yWhg(Mfl8jx2Gweaa4}4vNsH?s^}1v_BOsWL880N
z(BXgUQiIARyWQ>8^3Yp8>)RG&mEvo)REe*CRA}lue_o!}l(=r(Nb5S8o~l=EQr*{U
zQ*9NgXXk(T#HE@Ph3E%VqDvvYO5*6+rlpBCtM2#rL)kvGwDHnx@O88d2zx8jA0m4u
zW`^b$uH*HXr&JALk+0IDSfD#=&Lo!Z`S6mL(&x1p$9`M!&H9xt^{6LDm>D}>YQ3(Y
zIWPZkGfS+}JoJSEOi{km!WVW06uplO`(g2&`QYHRp?k4Txxu0<-3=EROle;ksVGls
z;gynSp69>S30U@|D{SN6e&bNbU~;ygN!i(cYmG7zb2GEW_g-t!6>O>MI_--Itzd->
z);8ND4_qygShb8Y`kiVcgKZv$v^NcCwQSlhO*CAFx=+#{3bUp&NHwU(GU>$Gc;&XVc3Ua?^Oi^1Fe
zAazZu+^gl|+7jFiRkQDPKGTM56aq-u+@AHE_0cFQe(O9MWlhRNR>WAY#ob!HiJP6`
z^<0-z<0{m#*jXv5F6$Vl)J6xH&ubFJciO~UOdCjNzHaAmi3MKI<
zGU818o=YfzVPYmF(t1`c)SLIfAfoRS>K;7%Z@HfW;Bs2j@v0LAL%xm$u@)D8Q;k5fo
z>Qut|&DX}>)@X#erW?v|=QE;ph|_bHzxzk)P=?8*x7%`JQuE(o-@a9wmE91Ji1WDi
zMi`U9L?*eb>ZgD`FTrju?9k4~!c>DN{Tz38@+Sk?QZ0>*l@fc2?1p4cynW+^)Y4rA
z_s%q9^u+G~-k`VF#~fSJu5avi*`nUo2kOjY?6RdOmsNSE)xzE7>&IR^X=^u0;i>5`
zDcz}Wr&D0RMlp%GKJKY7aLPQ5JVh33tD?!{!2F3!p4Mx>8<(aUs!*`Z)@hgzknNWac(B3*7rA)LLck?Ukm5?@Bq!ocoM
z3FVyBixa0BAkwckA3xF2
zaDMV;(!D!L&&MCj;RBe-&N_&zrVpu2D)uTEU+YNsAXZTkI*wwS3{EX*5$h#W5xypS
zZemx3xB}}mQA!b%mKbIgM_a)aPo*D{&SNHgSyT4BS68ls%Q$KGfw}FC<)#vR&_GTs
zT?PG^?HMJ{Ul}|%)%V>pOHG_I6c#hFH%LN%YIjQ7<&AqIWW$n9DR5_;ly5CcFWj)`
zs(7xOv$Iq@2Z{0X{7X%zLlnIS(@vUaugGL`ZK&LBO=HQEVI3D6RHrOc+A!!mY#&~=
zyFDxIViXCzgzkF$!v3U}hSed%$z^3IXoS%dugoR-X~I*yXsirHbZ8`aN6W9=_a?w*Yp-e*%(S{G!J<0UI|qvWN|gzuM<
zD*P_jiBDvUwDtJkV%F^oImex*BNe^)PSF{&w#{EVLldKSz}Ip1-Kpp5`sWVIos<`@
zQx(++z%O!YvFM+>HxqW>HW_2{*
z3y7EM%@yg0MJ$ogTJ}(mD!(7INn)v3<9;n&8%>qs+qN85{xa6x*>}-hBG)#Wu4XuL
zNit#pyZm|7_mz{Qfm*fE_S9RnY)7}JZAN*+?)JcLnf1-}Y;+q%m{7kke`V>U%*dD7
znO9XT?JlWkjEcf!?7JCxVVODa3Z3EQ%$A1GGbp^92cGAzp-JZ%Q@TV~T3=4ChYMDb
z*%)cs4c_$9!z+uXVNkW}0IFv-vT2s?Evzr&HHCSJxSNNh;+!|sm1O91_Iuir&*;ij
z^E8U33_VJT-(IaYpD>uZ$Jv<2xi8sBtkn@jGMcrYS$kxS6&ubc}Q~OIuY_7xqX5#R^7lU7JCT@A?TLM6wiSy;I
z_17_V-|04~j@!6!tvVb%IJ@Ya`GGN$(oaVhb2(mW_%3xa&B>y(8%&PtR7dBV#(Ki7<9d{4RTXS48_N{nTyA>C+cYf9q
z{*_L*yXQkxWc)irS=_I1`;+5mb>iqY;#Rqr7`M~-RXFPd6-V1qlDKbMy!Oe;D@G+z
zUy%{0i&SE-nLM8~qdLi#Oe4}!$-4e!Y_Uc18WJUqk$xtm&mq5|)o#2}ik7(KMYSTg
z%Gzvh%#(HwwYW|HOl&a1K)S%cWM5TLQT&z|^#C+W73vX<_Gq4>lk|eg=2_EeOny3g
zbe}SNeR)oH-l{f8<1Mve=CbT}+PwR6nRbeVHuw4$Ma{wVA=T^!it7S>3D}2ZN_`YM
znty#I9j5F#hl4eAkBNNKA)OtxkhzMw*sJJd|o!!WDqJt)|^
zEgUr@wV8rH6Rt@gQLn#-$4eVW_)Y4wE4UcllzqTz*fg=4{yuI*Cs<6CpCW2fTZWxx
z!&1in*hER>WS-9J7C}vp9kviDSQ-4k^CuGzu2uDJ+&kisFwgya+W7BY#2NZLeN65otnZw*;mK)XI|=EYNGAzwz+j9jAimwLV%mVf-m-}X_~wz
zeS_M3c%m{Fg=|$YR;SKjQ)Pc-2M2>}E&5>J<6~<>walwmOoKYQz>B_Fwh9Es5Sn0SE+WPuIfk--^+n-&na~4(>qZa
zP3trqF%28Xo4eiRlPO=LpL*O_#2L}P&SWjvSzX>84Ym?Tqb}IHtrO{IuS&|yPX**R
zJ2jbmF3I`$ENrnTyy5r1n1N;pucvZkiaMH4pU(2g+`Y@BdJ>)VW36Sy$D#UaF!Ggj
zYCNN7LY@;5yK$Od4AUT9wsBwjA&nDUI>jJjAIEx3nRSpc?^Mq_Ug>jWvmUQYyNx>{
zYSGv6Hm2{UKQ-kh9N4}iz$lG<7iN8ESjpa}SA#OSdOpA=`A{?OI3}ZRz7x+&qCsg`
zLDbKy`?^Bsd>dZIFq55vbbI{5M)H>f{QWmu{IdTwqZQSYf=;TJs;Pw6nT4$1dPcVv
zP<>kNi62zB;G~Dwq%6vr^i*FBx=T-knV6%0P5&UNHjKmbzRmqtN&>l3F+W7v+Y@64
zh9axCjE$f{b1!O2VruZamhAF%op|4pco;g8VW3O2^E`9C`F-(RgQiceq$+g4P^kxv
zJU<)H>x!aIds;O}M~)wr^xWMXz|n{KC@s&o)2mP2Ib`nNN^KyEl~H+^b_dOYGgfzh
z-f?;?Oeb@z;o|N_SG8W`5pks(m34;I)5X1~n>Yqn>1!@jH;#G!?zG$ZveWN6i^;r8
zlt9@cD}3Pui-37JGRmRoGxl;$o&}smlV(}NA5zo;SzV_tkJ0x2&fwvf#g4Z+KIN3}
zzdh2jN3twO^X1)q=TNI47K6N7`fi8Rfr&WuorE&aUiG!+}lfOx*@%$G*^q
z9PPI;__1_9RNOvn^KGFyWeR;-ZXwn?6QicGoME$kzs{dsuSbXHOkpKd*vVvfKJ{1r
zQpzKL2cyN*oX({%=cI}fT^saWkG+#o^RFD2p*5&=kmM=Z_`a6=cR5KW>-dZsLP~pq
zk1S`pU$;BV5Uo5^ojIa=#>BMr=Jw-^P8attTx*)EM~hrC@K0EGO+zT1=mvLx
zQF%T@&rxu6Bqj|?czf+?>#ygQ{-$V)e2o1u?sEZWrGh4LnbmcsJ&X3-US8ji){zzt
zdvd1z((_fEV_f;K7bM5U-#ksyK=%-3
zSV{cC13S_5a$m&^d%KLMK|;$-otKA|$OV4inXA*R-Bw5rQcV}Jy3#SiFZ^OB&R)fC
zbGoD)ea!xT;*MiGnba<;Vcm;^Ga3o{nd*AG^^A*X_vvL%MiJQnA2*cH&^{~A1ytH$
z=H{%HlU8!Byj*pG0dyE(`lK4R!@@Ab_4>%it@AesPQe9Iz(+t)E5@xcG=Gv6SIU^-E+`nXu
zXn)K}cMb44CF-Ukms?e{t>Cm}zis5&BDz`{a6!O6ZewaP!ApXBi6Ze0GmGm__6V6?
zWr+-4JNIj*0HhP}sqSRS6dDF$tg6@hCG9=1o+q2(^m2*
zw_85LxV|krs!gwx*`dWfEnK!lA8W21<20#QOL6CSjA^n;Jv9D}VUu>|)15KCtR8Fk
z9Y3U;V#a(m=RdveIlili``vz%(MG&z`*ylXODvCA?`tpp}W7`YE
zc>ey~{_hF5rgt`H9og%vs(ermg_S;?zs6Es`b?Q>&njihvAaVjy8fl=l|nv#zSn!l7SndXY|ZyJBIp{tBR)
z29Z9`&cMrKo+JugPqcVRCTQ-LmwkGs>Ex4Si#GsXA_bu0RU89E$YP5o(<
zibwZunUAw?E~R0Xh6}XME_K<{o936k%
zd4WUYo)W!t#734Zl}amGDyZ~k`>i^Cj;OD~&+(=6oAEqP`PxmSlvVOE%Fxt3=-FCH
zcwhfk>R_9R-PG8NpnYU>{)$-DYZ_tO6^%9nub)WRl8<9K&ylSC{%*uf9{yg!qZW0L
z-uqj!wwJKtl}nk@z|!C37~JQ?V{rKXh_cZi4Zyn(V!Z{2HEB8eM}oM?Awk6YK{ly@
ze2tQLXgNljV~eESb`2jQid@oqPJ(sK{!6|-X)8xOWug7$2r0um_MsY#0W}$I7bTce
z8D4js0ioj*?VS4{gB0K626UU%U3`j@1=7aBMG;jB055`?NHq~!+M2?
z(_DO0=Gg5EJ#PM;wbu#4^C(B8NI9dYlH+W@Rm=6o7Yc8${%F2Bbf_HY;Uqq;29Js4
zNXyoDGQ}9YhEOg-_aZ__FpFs7!pzU2Cg2$jAB{B^0W+?ZEE|!fnX4~o)IiOpI@-IK
zY_uqu{Z?o%IIi)AED~>}#(9`iiEq7+;MVPI|BxeXxv|j1JH6b6E2g;QzDNtU2w@Z7WMuPFQW_F7xGCZ6@W(|cV^{<_|S9Rhugnz~_~
z$fK{+)?s5JRd;u18x`PEbABNoNc)vB@!g&bjcmp!hrt?R*Wdo^md$Ukg%Wwx`j8cy
z{y5DfX!&}12G={%k>B)+yWmS0dvA^RzHCr`URhQ()H!+Yt(ux$(yHmU(4@0xq=O2H
z_wCmLX=sQdoJ*63(@C=qi@{^JHdkkZFA8BM)tZ``3V2Z1+bI*0sfsZ`4%3!$or`WU
z9wpTAh`rz1cxyh4mDK?~NLLYQQ47$>gCkTnPM*++gQezk8$f3myRLBde%>f
zlAcHY{)OW={;Wri7ZTBeRuo~C4bG3M$i(Pw1Zpg<^xEitd~$dibe7<(o5U`bb2(8S
zKY=vY>xbKDe5L#o3dE#4>>)afkAfD{XUnCM%I52slB8b!Fcp|&VvXJ!zp`_!$1M+k
zVQTZG7}G_|^@iX-gK^i1SZ9#ZYz3yVoKi*Lu@Q(BNw0D=vfrd*#01lK%U?c;Rg)Er
zYx>Gc@H7(09mFqu^s83;U9ImlQ1X=4Gz;Ui&g64RXbLd|abR;LIdYW2$J3I!C_{W=suhazb3EK$;$?h
zxwZ3$pY6L@yK;+4)JQ!;?J_3j2Y%}%$u{T@?VyN^KgdOucg~d0inUz|!w#7PLD#2{
zh;W{1pW(xcsBQN0x1B}})zR2RVmE9M(XwyX=S=fZrSO;EB2AgU-ue><4Iad-HDhj&
z{M9kACgp>DRPxs;bf^~h2GH)7SAf=|q}U$0KQrQe@hDWPm(Pua2p)F}lDW`iRORix
zn;(P3eKGxx!@fV?%q9dCbCi_Ic}
z4pUkp4+p&jtbVpDUK^pc=*o#fR;zh?+I{0jw_d!oGwmmv?)SBzR+^}$Di-BdZ8Xx3
zQ!xv-D~fL~z3-wKK|sU5$GYa=8j;u#_IsMeS4n!*uuf}-=y_!oM+UMLmvQ>XkY7rV
zyOJ%8G({>EaxCu64>ftRL|swMQE{{4NVv90e*w^|wE4O+Fivx~7RBSF-e5Vxp=`Y5)dS&@IAfr2>mTVn2
zVI=sa_8IEu$DPO~L6!_8o!wZMXrq0PbS@gHip-9`EIQjMM120dj+ewq@4KXPjK-rN
zga%H10L@Dwdq$|=DQS74t$zQJlct#(*>-1IZ}ZI)uA_^zZe?F(-3GE~rBi0`?&7!9TM|K=m
z09o0Xj!UC(23KBwuL?3}Xtc<>v6IwZB(gD)-8@=z;8%yZ$LQCn9AgitkPdT$H@dP@
zptk2kD}Vy&+v6NaFufWFAMK1?fW)3s+<;dM;$11}veOIeXOoWM^yvU1c@QOL@8@1a^0_MZkQ}#W^
zkv&`MizrWL6sa7cI|g2yp$6bV&+^lOJj16&rawM_3usWMe>v;GKjw(8VVr0Ou*M^A
ztW?~!iFaXB!(mFr&WocxkRmKxSEl^iWkCPM9gc5|Xd1`)hey&AM9n+Ski4U_?_|QJ
zz>^U?)wMZWZ9|W;55?nS!7QeiFj*m@37s=vPC
zL77t?zxa%F_DxRb8jaHRANro#m`a5U)BTmbvCg9m(N}E~MNX9h?hDom#?HTBxKcOT
z9D~Qsj$6NH^wl@MsG1^w*3)(@AnP^ZctAC6Ao6HSQOL1l6tp~{E(6IU4?g|8`J4We
zn094l_us({A@@EI!an;kO;Llelt4y-Mnv2vS%D;3ZY_csYjmyW25YTDe>cvU_EOt)u;-RxUq?oV=Z{3m91*2BF?V_P
zV_>LAz|8jJFt{HmgNWxM=suFm1Xas~j4z+8zv~H)k?6*F(zY%=Tc*V~$OiOLDfAw9
zH`DxOsu-@>z55)?@rfs6XI0pCyfs;_Jxei0IEp7xebD2>LH1IQjn7fM=7tq}AWUNL
zy@b^MIc$j91b8CsTJk*goqqXs%N*prE_(XWy_+{`%ky*4)%~bKoie+TnwJlt(m2kR
zSoZvm4G=-M*Qq$EhSNmT3f7ocT?gn^+Zlj%7R?YHoEr%t(7Z{3SR@LXBx
zB3Vg9BOdUaeDaHnd)~9VSG`|UJS%!w9ts(vN#C~Gvo(K{7b%D6|iV~@B-{s~-P
zSbA%&YvkyeZLUmH(hAJW1>Q~ialbW`Ha;`@MO{GG+N@Z%e&x@~EY;K?SDqO+50UEx
z6FZ13hpx|&j(xUIc@0}z0AdwE;yxcE-t&Ud>cPVB7eUt*OZ<-{X`?(ChA5v^@X}z-
zKF9FppVBA5{d3~pFAfd5H@W)mKiu~{&>Y3faY4zCf{vom;nS9J)2p7&Y~3?$LYCe4
z9*usrb<{)>C~htk%aq0Qvg4r7#+bzt!(r}pFORuj(O1phs6e38J|_(HEhVylwL@UanFf{H9%qVF{DJjm$Eg=rnjhY}cHHq>;EBs0UR~6-`(#cRF23~rmPWEH
zosbO}KO6?!S9>6ea5x={jtpaP@RU4izQ%6e1L0m|*T45Q!&zRer>~#c=hX3B%3fKn
z)Oz%t30eDOVxq*(CmJPt?%`x**U1C90h*MI#rdU+5p`Ah3VX@_>(K^)6L*Rpd}DN7
z{3bNLy*eO-^H<+)rfbMF?hhuS`PyRf=W1fod<8Z&;)?o#a>rcvwO>zpUTY3umR)Cm
z7G=hOzW~brfw({uQtCTlHSyA;sb=4@1gA)bo)lAU^4#@++prChxe>*M(&yE+wMk}}
zW4a9Ie}B$#4dglBVR{Lcc)oIyR9U=O|AIUL;9;90G5&zv#~54*7NpQnldAPmrY;+?
ztj$|xdnlFqjue|3_Z(=9$m*l9B-rk=CC%
z9y6e*kgD?4EKr*uY?rAgxx$3Z{Y@rcq-O)CJ#)0=e}v@=w0(!eOJ`5xA3VokOkq_1Igq4
z8x?DU-?swr6SDgWid^1QmQ>y;LTqD2!q7#syS3O-9xV`K*LWdC8i2`5K{Qx36aYYo
zx~xo@Me4hlwKlyx`UlMrd0!$o(jywEbam7P|6%1)tK3XN-av1OjZKkxNB++ui}EoT
z&7ZIY5eF0EIaz%zWD}bWC@P8-R({HI2mz{X5cGaQIS6;Ue@5!XrJ@wix!MCW4-}!O
zJn)_oFmJyUc=HiBi*x`SQhZg~Pw-_QI6`cRE2J$uv!W(0n|^2O%C7=5pl+F6veiHp
z&SAEHTI#K`oExMFy((z@boBLO(QhHP|J3Jv6*j|tYw-?XK2V_g4;*Hj^nKXH@BQxI
zi5XJtS%egO_i>L<0Vkk5^h_T)AOGH4&1@le;BTQv2$6fkCFr9LWl|GbjU`UQ-);*N
zv~m(`A4&PFPsju=?m#C`|0Z2Nim$WU)3eTpx9}w8-V+|nunm!{b!2Mxf`bladJFey
zVyd8}7#b#87wzMJz77`aMG|OWglzizzyuh?QN8cLk?w(=6(ON%Y4MFvWI^%mf~hng
zLca&)h?AUSQT|2tX8}kQQyA&7u0a!}4bhj#0)Z@q$!35i7c>6-lzBgQNuL2!jDmVr
z&+EGQXWNAE>@>`b+dCs~dStBu9ij#F)IQbSO%>u@=dl=*D-XWDuXJ5yxg2+pV0?|j
z5Qq+opeI(;^*465JMUw-33T)zGZD&VQz#
z9#0BxF7Xq49oa>2-^VDnAs&NoR7=mfa^54z5Ae`^g#KcF^!0K|&J|#S-UE8aCY-S;
z{qAQh(&3{tE$cKXWYKT@j0yz;XD3DpC
z6Kct^9yhp^)%f>>oXw!PG$PNhuP+Na&gga7RI4P*c4lhwGVvMRQDcj<6sy*c-McGw
zh=eJL6P*Umm{!8(XW1iQKDoX7$<0@)6OrRdo{M>u+)XC@+08wMcvDxGx709BxBaIQ$;i`&xPgz_VXg_7D<5B_el?UiXu)m({%AM`spz$(VB}KPvX{pmP=BMl)6F6ThQuf__(#-X)iRSvE}JrA!}C0Wlv36`-0TO
zjDBd)1px&Mg(t^il&4|I8bb^|&(it7QGF1?Rn|D{sPDj*xiz#EJf)gd_Q}8l{H%g*
zQPsi)5IyeUE9|r7RPpU}3rv@Tz}a`RNvs#2vP!jzvq$rm2C3;sF7@2wG&YI~Ik;uw
z(Lf<@D<|vK68-Y!0}=QNFKv#Enz)A_4z6_S+LV>&)oJ_$b`8~a9P=psZoypPAJ~x1djw~wn$!vIe6VXd%1Eej$tlmlWel?%su6aU+t&{*ik-P
zwJ9&;*~&|bRBl)xy+A|`75v3IbAMtYmDRrY{fyoxoksPLyl7UTLif5?fj$U;=s7+3
zbn37I5vwb^2JZWp0srM7k(oRA7%lf?F17)n+3-X9(6Qd}bP^X|%kr4RI;nFn_yaR}
zEZf(aJUkp2T^X6DHX@{RzcR1L!q%K$G;_pm5JHhFaF68-$`?Em>Rl&1FK5QlZ)OE(
zQBw35$>*;dbhWtdjbtB?MyzYCRWugXER0hEdxh&f1%!#dqk-sjVcThX@4A~Coe#x1
z<)_>Td(04Sk_6av@JlhPN9EVlfxTasBAf{F9v@Mk!&&~!99uN$%^wG<3THpPQJ`zC
zA}GhYY_!~S$?oi(4>d0*@4?=N^GFJztllM#eh}g@7N$FwY$m2&pik1
zT2bZ7PYa|M>diL}U{cA4&bhPLO1FH_hZ2!Vt|{N2I=lDE)|8JSV*qN~o^h-$`1eMT
zY)IG|#g^L0vTz4bwemxnwI|nOnG2{?ck8b6u6v|@$TBh(Xs2Ify+BpK)|0OY@BRNb#H8&2hVZd-I}o)Fo?oguv>15zItrrz66sNkWA04Oa2qDZKS!;~q|
zBkv*q^@0bS&xx0Vu&PSZLk-Whz5)dA^YRj)Ivp3=Wt9jKL^LuBtJA$*2+O1k=KrIZ
zJd+j{SA2F!-{&mYrXp$}Mzc3?)W~Qrd5bT%tK!D5AUX}OA-9X_fDH>sIcg53ar4E|
zZvpKJQ1OtO6uSCPnuZjf#`O>lcy^IR)WyDP2C>N`rDWP{S(V_93j_-N6Hm|*Zz29d
z9u@9Gg4wfvKTh-RO@ue3Aw1LsHWxXgAqH0QUFzjY4)Q0d$}Rs##J6(kd&7E{CgU
zY5nk6DTwhnHO0O@~+Lv_9y3e|HCd<)t
zY395Igjm}wwrQ#Qy&AN}v@Jr;gsqnpNB~XB@|W1wwRfGXz|^;3GOyvY3bu?^r#7o|
zbxU~6g$Z;JYNSOtG#D*lG5QwmJVGa8KOQpOSJuYjG)N3xN1U1b8eres9Up;M!fnb%
za7rqS9sV;PkgTACqR->>ngxRQf|n=kV?Yskf+h%Ec?6z^M)x3WcgbfIFxP^n-O%Kp
zqkRlUTmJ*XUyB0uBxurnGE*h_IcBQ+2T$daO4qEY);R41b7hLXmFy+KNCpc3v!;x_
zl0eO24XwuS#h+tz$NlnP*-u#cp$wfdd4jd)LI*0#=ko1
zE3=Euf1;UD1T3_ii^{}y!b?}Cb+E9g4%i!}{|!eg{sWF?-c9g<%4
z&)jv%R|e}iYt0^G|8je0wYr4i%7g9-=fxl=x1IGdv)+9ur;K+*`n8a2n%@FDpK|$E
z$7g97_eIBR0D^;5_kG6kf>N|9b%%dPT1fYFEFt0Us3Y0LT
zJmm5?KufOt2p?t>*u<9hL}ea;J!}@FTOpMR2M0U+Mte-+ij>6GKW#}SO#0?@PQi}T
z_DSH7PDd0N)*o?9$k-^@Jifdo2xyWsbyhqM&7vSDh^`ok3X+hapstC0=TKTKNyM77
zkyuF1My&{{_|rtnK%Ks)RID>ktih`ii*HV}{e^kjenB;*`)kydX;9&V`Yv6FQBS-)
zxXi(k?k5%{whkj<>iU%c#T`cUOt2xoWx^T5-nE<-=l3J7pggQR72m2w`eyp!F{z@w
z$i1;E`TA$)}~m#i)8OLEGI%*Z>|jtMBnQ
z`Z#}dPca6#!%zQryhm;VQzS2%rOOp~M(bE9w|~%i-w+gsATO+c>*IqoLF4C>?lU7Q
z6S5@}D*NSV{B!p`>wrYfP1~dRzxkN?p?aiA_-&n{R^{g0Wh^z6j_1j`_4G)x@ZOtJ
zH@G0ffn@13U;o-JIy0mx+D=4t-U&GipnMh^eRje}9oHa3U!rgKWKRbpX`?O=M9!We`NN4jnD+nfp%o{X_
zu7@Gmt3{Aj{-QD<6^_h&c$0RMw!Orni%0qRC;`h!?Si0(jxH2^<|{7EW?aQY!c!JL
z+}HH@CD5p~K~AM;taBrH%bQ#X;|i`PJ=RrVc7(eFc(7?T(fsLTv4f(8^{2@8UgnMp
z8|XC0xpiK%h#`AktA`o(AfETzweL|dleg3&tLK(&G{4!)CQyxx%ST@6BGZr;u<#EY2t!0!L4sL+swwW6>_(RI403$!K099;!LjbodS|3DNkFZu@E_xEZ~Rf2F77_WV^Uii%)B&@m5`HyTt(m{GB(%Jct
z*Fk^oAEJ(|E`|eQnL*ba_8R(la*~7-eot%%1MYsj`27FnYUCzWraXhXmg~^gquP3^Zz^Zu#No{>e;%8
zMdWx%{wrSejF0PxoFlwnEM@<4Kn<8E5(QIvu0vafkmhAxsOm#s0lvn9gON+OIO{OW
z_3jZRL3Deg^WH3a)!g^CiGF=16sDNT{ZF9O6x7EoN$SuX!}EB<900I9q4oeWL++y}~RNPU9N3r4-5wU(pCdFpGL5maBfAt!&LXLCokP#kAW2|3TyH&7CB|-rz5VJwVrLe`zjLc
zQ3mYu%Cl)i_}M=89oA@?bBr)1f1)iln#3{Y#aY0+=l%=tIxX8G1}O#NLY@2)n}Hb;
zGqOdnhZf55lzjpO8rMmI0|G-7GTREUPy^5t#LgCjsl^5`N-?tk{M)K=n=rWA=!;&`
z_OI3MsA`2v!hCq&JUHj9%E7~T#!KSW!GB5O98f!M(|%gTceRKv=_i$t@=|mZ+NY$(
zx-^oFnZ#f;`o3{U1Rw5?=uukSUi+`8(MA>%vTa&#*H&~>?PYDb&a3tXal~?QIfM7s
zRDmMrR$z+HqMP>iqx^Lr{GAbuOx)oV6{%MTqiQ@ypJvt2mLS0S!UeNpWOg49pYDXV
zLD;$^;$_+=I0oZGd+;_?6b#O>-OmKN>KRRq5Y5~+uwuJQ$s}8fw
zUk~c$AmDNA^bv%BO*0+;d|QTluGX5%f8lujb*mP1_+(dV=LX1EC4UL)=-my?HfBvk
zS%*UilF6iVWd!5Uye)f4mE6g@;-e6~@H?RwY=bf{T|4jaxtKaNZN1#6#s5|>YG9ZB
zGAdViWc1Ws6{rjMY2UoeKho<^ci4)x__V4%Bn38mlATzlb?G>UDiOvEWt_5sZjD@i
z_j*yyfs$PGzL)EgY=Cbui;R02#1WEdjRnUS@HTy0X736Np{>bum4$W*$8iZUh~adM
z2=)fpNx{c%L4&0rWUCSx4)quNL$C1_H)4X!L)>3t8{=m-J90gYr+XJ^tea1kO>z9q
zYlI~IP1y;(7*WP^qU
z4!ha3L6kA*Y)Qyb4S^~JP&qG69WmZBfJ(3#BdcaoFl^lCZeV>5t!qJYxVjegpD!lz
zK7@$y$cE3&xsOyLi%@#1==fL2665I*Q6%2@f8#z
ztA>zM%GvYCnFwZ&-+=P;6Z*H)n56kG(B)1zw-8F~`8Sa0AX$ZT2CmJ5Nn{KUJ>RaV
zId-FNz@gVlxy^|n?Mieb={yc8WT!hm+-uv=Kf%2~AX`Zy_mYYyM9_$g!DEn|NB~78
z2CEUmel?;9Jn`Vd$~GI0>V79u03|}ufp3-&8gn8;1%q0AfYt3gb}BO@b{p_yc2Kfc8#@)49LBJY3w
z2DDzi)z`m1KGlulv+t#v$dk(3dyD5VLOEa^+NF-6245KpvU-N4*?kYBk0a^YlwAaA~jA*
zDj{7Zx$$Vy_cYJzN#BjWD1WiuyY>?jRk_NhAS+yDx@QHX?NhHPZG4G*Vs1L$Fw+~2MA
zXDGZ+B2O2G({qp$UouZiC4BjDCIYv|Dm_HL7wP16t3BL5a2nFSd3^or-l}OhhKw}O
z@ZXME6IiE-yb}*T{(ZW$8`TF2$;1r;IK|clkeMV`R+;_{jDM%t`Y=r|5NesJP$G39
zdrr5?@gi7wR0o$=y_e#yar`AtPk($$<(NIgNTr|j4R$3oL$hHB{=K}YD<(g2jssQz
zo?B`;jUow#0TvMsC(L4l2e4__W%;=1BGT`0;b;wdsXTy%==37
zn8Dl!K%4$bs?z{+R+E(>ctyx^)_~dO$&ICf?Ih=P4iI=K?4*&21Jj`?kb=RwTwEGi
z4;P^Up%YS4e!%f(=St`g8^9RWnkY;J7;w&*cVKHAKs}#n&I3|154hnnYw=r84qXmZ
zpHN19bTP7-elpHWocFHm3JVp065%GiR#BbEiNZjO_Uam>%ap
zJ6iO&=P=6IJjLps?&rA6!2*LEYjpVJ)$f2R2RHESVZ8a534u76=WI6ZjV}4?O_vUgAuiK9K(l>+N-GMUdMQ~xhJ)8^{
zh{`2G1Hq%r^^1^fe@cb~@*9;4kN6Ug}H7gH1yR(;4|xzYr8>E*R_Zd*c6;Xk9p
zp)+_6Yy$hce&=*yPqZJH6>*&5M}5lJ89NtI_zi^mUd+ffARo^}t9!99Ram6NrQ}UT
zy!UB8h6keaUcRz=VqiEWuV`YB`mzq?|>AiiQiss$>p42?G{GR84fDL`9D-x)#_BS<8mMlH>CNw^f=jUw-YCMuJd(Z0zjg)}O4!x^5&zGjFurxC|A@!{fbJNdy2<
z=(Xp%LGoAu!+5!b2S}|m26r)XW#fqf7uysi)bwMV(j>){Wd+fRm`haNFTqpBdtqYE
z>M4bcHOV
z1laBg;{8#7%439rJs=Z_9pLwnByl2J1W!u9(&d)G3`1Um{IC3P&yK=S?IzQ?X#i}^
z;=68|CZL?!J4#m0VDWZ&M|$?ma^5G8k$=AQ68lVTdqB6y+*ni3){nBYBe0IWsLmp-
zZjfI*c<^-%l*0tz!lE#CCi9`D|(z8Zz
zY5p`zjX7QtT)t7wm9BgEpN>fc6fkjs6vk~WdJ$dKN4DAsXO#X~*KB{O#(&#Tdcf5l
zltzg=w+vcs36ONRrIN3mrXlDysF6y&o}Xq;tcq+GD%#
z)+`mvbyMTU$G^93eLhD(Sl+!zk`U;1uscy_B)|u$)D#XeLhf11=fJf<;l%nn4R8!wUu_f(u3KU)hbKFlvB4q)Exsy{p!w5>f
zT`;oo5jk)YT9)j~kBue|5X%vOWNE}92|P>>*otR2u&c8J1I^bL<%LKBvCV08`q}ev
z3fp_22zq^~#7>mSSvZYfxbWwd!E#IA&@DCxwEnyDf=R@11{TCZu=Ysu=%{m5)VWtr
zq(o2UH}Mp}>8-DIhW@c(r(B|L{~XlM0>E+K>}gVOPk_bBar>7^^V=v6CIVS=JC9}|{<{;KKA&)YlK{Xp1fU7MOOdi%K8
zcp&OnQP$62oj*a}op{-B?|f;v8sN(bEx$;9+lZKmCJ-3vDFv2_TB6}ZE0~B@p7`*$FS8FGC`Mb{%2MWD1@
zn^>>!GYA?6z|-q4pm^;GTDz@o?4-zidmy0FiVvx|?&gmgg$Ymf^X@T@`hQCC
zY09L&g5DZ;+kbFZ(!f}!=W!-^3dv2ALCWOEk%wlOTOR4KJl-{kqfdiUN-}c?PS)6m
zpLx*2*~?MVqkA}6?yf<(>>M0hp%JcUe~f_?z`D?PpS+-ZbfrquYIgOx#WKu_rOJwm
zdz6-EVIs!P)+ofDZG`|JZk3qO$G<&^$Pw+`z|)LrIgzx{(?|}Z)rVV2(Jpv-o8Xed+|A-ud2j7=*E)8kdN{fN;p;9{WY)dB-
z>l{O4&oAtS8nCX_=S`vH-?ha%*}(VK8325iL{n-&r%a8CO@zx&;41?560NX3D
zhuwc>_nW6$tQTaf8yDukw;d8AKrZcyG~3UKZ^~X9jdg?FdM9PuRa?szZBgv0V<$pZ
zJQs6&QnCliK?nST6cNY+6FuGaaL?WZIZ-(D0n5TyD2EoJFyHVjm3kEnR>S-8$89A}HT#%g7VGegi!?Bu39;FruOTkcTYY?QQS)?TCxG
zrT`M*$sHJsXlMhNRG!Z+)fA~Dhz(fjs=n#9m~T%QPNcy>^8e+69`^sfTt7N=K{%JC
z_*Axnej)XpOxBeF#PtGhQ44gOtZri{C2yA2(@P;LCeHZrP{X
z5G7Rux?>MWr0~Z}pzbUL7_0^P8b4j7_pqkjur@`GQ1P0y>1Kz*AJ0I0C7?eTECS7H
zD-?oK49#E&rig3E$D}pKs}`)8DPm!h^=>v1lh8>}D$S_X^#KggyQ?bVHGquFVA@=R
zNm>_zY=CVDp@KUo!JVR8=w|^Z3vtUB3@xm7=v*S2
zYZ(yv+ko{i0G$E@D(*I@?0Y4Fb>rc~nh98L0U)ga*^JtR^rZ$0N}BgE06)0ji?5tG
zfV9|epbdR2c`9mlB$4Ge>BD@x&=8E6ceRJX0pbk=MmRzZkjp5NJQOuF1;yo2N04r7
z;o=otPx6aUVNw&L?1Sh=&~tYIQZ*0HEpY2RcCT07x~6dRc#=2TiE3(a!Z|cippYzb
zB+fi#fsSd_rbAI$Rh5w5^URX;Skpy_h7!mQgtIpf`sVfuSGDaBH-pm)VvQ1uHNhPG
z1Hne5Wwb8K_7|BaiI72P=f@U762Iw&q$>UDD)=r!p^X
ze^pI48iE&)mOiIysz;=x0Prqg{wXzXad|b_Ep*aT)s0-CS*Kd+3Pk7t4FWhBSNL+N
zQMR^R?E+avHAVFkQ6vr2HjSXjy03Ul$+aJc<+R#$9f((PU8LXM^Cnq0nRj%4+%N$8
zk2L^>AzEqbsgcKV&TusrA`J_w*<7+zHp!IRx#x1>V)>B{-Ig}3+t*}*-IDd<3B#T|
zz{Ntc=>#Ll8lHW`no}p@MRlACl{$;%_|87V>$=7PO
z2nF!bUd{0BIavYZ+5SBlvjQ(;29mYW4eXN+bWnKA7rTbrFD9k_>T}xQ;I309{!KUC
zXMllKV&MA+t%flRtq3cLv-6AS
zW(qFt;Tn165r=+n=pOdFWUN({d#^L(6gJ$K7SaHDgM&vx25
zpK_dRdZTfAP&XCfqo1L>Bd~Sht}K{Iyb)QO;AC<+lr#rpwIajbd_sNb+HfKjd-&su
zXj=D&gq%2s(5aW{=J+aC;0)@#1S|2zJ4Iv;4GO2dklB!Ml~8eQVL{Os0BTE%-<|p^
z#e$X)vWbrEfR<&y0T^Pi+9`GW;ptCsp0)Wmlf3w6WD4XAb1>vnyJM-Wt*?yxcbaRg
z+xGayBPM@ku{&Grb9<-o5dT9MV*Hw1Ci9dWk>cLt9I@l=QuDyQ#?hg~xkO#FJUsF&
z_wIS*zRi=4Sy}I@TPsDxrfima2JKj0(4cUkIotoeZJv||p(6xp(lZQKr&ZoBJ2{s5
z6H*tfRpe@R_U=jYFB-m*KF#@v<-~-3ym{w9=gI#3!Dh)fAE_wMf0q*;xyms^!pJEG
zGrkHes?@Iw`Pu4Y=}w<$L6#=R%Evy_^+Q{mq&jBC&o&M}$=l98p-pQpSaJVKzU`TW
zkNY&tDs|#h>X7{l?mSA9m?N$J=)+5Kz~w!Vs(vbYfE25~yl5SaKwpPt
zV7QunmjPslI`sw7QzNjeoI%!;hwi81qgo%V?QOUpND6QHbjJOZeDf?ep*P3f1pa#6
zg3jL}F-DiPuaZP6j=Fuo0`pb5EyzDOzW8fyMZ{rYQjEI}t!gl-FDX}q09|+;_dOfG
zj=%|T2dNZR=PF55Bf;;9O$hS${xg1TY_@D~tvcqR-C~Kg9<$l;YUNQqHL=T{_Gmwt
z-bRq2Vit&rOG@L2*LB>h0v}wB`uZ8C>0b3OYq@{$_s2ij9E_S7lfemJ5_|f
pQ%ftJInO=Pm*Hvg*8yQhk811c_TYJD@K0(mmS(m)>89>y{sO6Bn*jg-

diff --git a/priv/zstd/contrib/pzstd/main.cpp b/priv/zstd/contrib/pzstd/main.cpp
deleted file mode 100644
index b93f043..0000000
--- a/priv/zstd/contrib/pzstd/main.cpp
+++ /dev/null
@@ -1,27 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "ErrorHolder.h"
-#include "Options.h"
-#include "Pzstd.h"
-
-using namespace pzstd;
-
-int main(int argc, const char** argv) {
-  Options options;
-  switch (options.parse(argc, argv)) {
-  case Options::Status::Failure:
-    return 1;
-  case Options::Status::Message:
-    return 0;
-  default:
-    break;
-  }
-
-  return pzstdMain(options);
-}
diff --git a/priv/zstd/contrib/pzstd/test/BUCK b/priv/zstd/contrib/pzstd/test/BUCK
deleted file mode 100644
index 6d3fdd3..0000000
--- a/priv/zstd/contrib/pzstd/test/BUCK
+++ /dev/null
@@ -1,37 +0,0 @@
-cxx_test(
-    name='options_test',
-    srcs=['OptionsTest.cpp'],
-    deps=['//contrib/pzstd:options'],
-)
-
-cxx_test(
-    name='pzstd_test',
-    srcs=['PzstdTest.cpp'],
-    deps=[
-        ':round_trip',
-        '//contrib/pzstd:libpzstd',
-        '//contrib/pzstd/utils:scope_guard',
-        '//programs:datagen',
-    ],
-)
-
-cxx_binary(
-    name='round_trip_test',
-    srcs=['RoundTripTest.cpp'],
-    deps=[
-        ':round_trip',
-        '//contrib/pzstd/utils:scope_guard',
-        '//programs:datagen',
-    ]
-)
-
-cxx_library(
-    name='round_trip',
-    header_namespace='test',
-    exported_headers=['RoundTrip.h'],
-    deps=[
-        '//contrib/pzstd:libpzstd',
-        '//contrib/pzstd:options',
-        '//contrib/pzstd/utils:scope_guard',
-    ]
-)
diff --git a/priv/zstd/contrib/pzstd/test/OptionsTest.cpp b/priv/zstd/contrib/pzstd/test/OptionsTest.cpp
deleted file mode 100644
index e601148..0000000
--- a/priv/zstd/contrib/pzstd/test/OptionsTest.cpp
+++ /dev/null
@@ -1,536 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "Options.h"
-
-#include 
-#include 
-
-using namespace pzstd;
-
-namespace pzstd {
-bool operator==(const Options &lhs, const Options &rhs) {
-  return lhs.numThreads == rhs.numThreads &&
-         lhs.maxWindowLog == rhs.maxWindowLog &&
-         lhs.compressionLevel == rhs.compressionLevel &&
-         lhs.decompress == rhs.decompress && lhs.inputFiles == rhs.inputFiles &&
-         lhs.outputFile == rhs.outputFile && lhs.overwrite == rhs.overwrite &&
-         lhs.keepSource == rhs.keepSource && lhs.writeMode == rhs.writeMode &&
-         lhs.checksum == rhs.checksum && lhs.verbosity == rhs.verbosity;
-}
-
-std::ostream &operator<<(std::ostream &out, const Options &opt) {
-  out << "{";
-  {
-    out << "\n\t"
-        << "numThreads: " << opt.numThreads;
-    out << ",\n\t"
-        << "maxWindowLog: " << opt.maxWindowLog;
-    out << ",\n\t"
-        << "compressionLevel: " << opt.compressionLevel;
-    out << ",\n\t"
-        << "decompress: " << opt.decompress;
-    out << ",\n\t"
-        << "inputFiles: {";
-    {
-      bool first = true;
-      for (const auto &file : opt.inputFiles) {
-        if (!first) {
-          out << ",";
-        }
-        first = false;
-        out << "\n\t\t" << file;
-      }
-    }
-    out << "\n\t}";
-    out << ",\n\t"
-        << "outputFile: " << opt.outputFile;
-    out << ",\n\t"
-        << "overwrite: " << opt.overwrite;
-    out << ",\n\t"
-        << "keepSource: " << opt.keepSource;
-    out << ",\n\t"
-        << "writeMode: " << static_cast(opt.writeMode);
-    out << ",\n\t"
-        << "checksum: " << opt.checksum;
-    out << ",\n\t"
-        << "verbosity: " << opt.verbosity;
-  }
-  out << "\n}";
-  return out;
-}
-}
-
-namespace {
-#ifdef _WIN32
-const char nullOutput[] = "nul";
-#else
-const char nullOutput[] = "/dev/null";
-#endif
-
-constexpr auto autoMode = Options::WriteMode::Auto;
-} // anonymous namespace
-
-#define EXPECT_SUCCESS(...) EXPECT_EQ(Options::Status::Success, __VA_ARGS__)
-#define EXPECT_FAILURE(...) EXPECT_EQ(Options::Status::Failure, __VA_ARGS__)
-#define EXPECT_MESSAGE(...) EXPECT_EQ(Options::Status::Message, __VA_ARGS__)
-
-template 
-std::array makeArray(Args... args) {
-  return {{nullptr, args...}};
-}
-
-TEST(Options, ValidInputs) {
-  {
-    Options options;
-    auto args = makeArray("--processes", "5", "-o", "x", "y", "-f");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {5,    23,   3,        false, {"y"}, "x",
-                        true, true, autoMode, true,  2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("-p", "1", "input", "-19");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {1,     23,   19,       false, {"input"}, "",
-                        false, true, autoMode, true,  2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args =
-        makeArray("--ultra", "-22", "-p", "1", "-o", "x", "-d", "x.zst", "-f");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {1,    0,    22,       true, {"x.zst"}, "x",
-                        true, true, autoMode, true, 2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("--processes", "100", "hello.zst", "--decompress",
-                          "--force");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {100,  23,       3,    true, {"hello.zst"}, "", true,
-                        true, autoMode, true, 2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-dp", "1", "-c");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {1,     23,   3,        true, {"x"}, "-",
-                        false, true, autoMode, true, 2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-dp", "1", "--stdout");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {1,     23,   3,        true, {"x"}, "-",
-                        false, true, autoMode, true, 2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("-p", "1", "x", "-5", "-fo", "-", "--ultra", "-d");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {1,    0,    5,        true, {"x"}, "-",
-                        true, true, autoMode, true, 2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("silesia.tar", "-o", "silesia.tar.pzstd", "-p", "2");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {2,
-                        23,
-                        3,
-                        false,
-                        {"silesia.tar"},
-                        "silesia.tar.pzstd",
-                        false,
-                        true,
-                        autoMode,
-                        true,
-                        2};
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-p", "1");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-p", "1");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, GetOutputFile) {
-  {
-    Options options;
-    auto args = makeArray("x");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ("x.zst", options.getOutputFile(options.inputFiles[0]));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "y", "-o", nullOutput);
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(nullOutput, options.getOutputFile(options.inputFiles[0]));
-  }
-  {
-    Options options;
-    auto args = makeArray("x.zst", "-do", nullOutput);
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(nullOutput, options.getOutputFile(options.inputFiles[0]));
-  }
-  {
-    Options options;
-    auto args = makeArray("x.zst", "-d");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ("x", options.getOutputFile(options.inputFiles[0]));
-  }
-  {
-    Options options;
-    auto args = makeArray("xzst", "-d");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ("", options.getOutputFile(options.inputFiles[0]));
-  }
-  {
-    Options options;
-    auto args = makeArray("xzst", "-doxx");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ("xx", options.getOutputFile(options.inputFiles[0]));
-  }
-}
-
-TEST(Options, MultipleFiles) {
-  {
-    Options options;
-    auto args = makeArray("x", "y", "z");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected;
-    expected.inputFiles = {"x", "y", "z"};
-    expected.verbosity = 1;
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "y", "z", "-o", nullOutput);
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected;
-    expected.inputFiles = {"x", "y", "z"};
-    expected.outputFile = nullOutput;
-    expected.verbosity = 1;
-    EXPECT_EQ(expected, options);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "y", "-o-");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "y", "-o", "file");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("-qqvd12qp4", "-f", "x", "--", "--rm", "-c");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    Options expected = {4,  23,   12,   true,     {"x", "--rm", "-c"},
-                        "", true, true, autoMode, true,
-                        0};
-    EXPECT_EQ(expected, options);
-  }
-}
-
-TEST(Options, NumThreads) {
-  {
-    Options options;
-    auto args = makeArray("x", "-dfo", "-");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-p", "0", "-fo", "-");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("-f", "-p", "-o", "-");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, BadCompressionLevel) {
-  {
-    Options options;
-    auto args = makeArray("x", "-20");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--ultra", "-23");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--1"); // negative 1?
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, InvalidOption) {
-  {
-    Options options;
-    auto args = makeArray("x", "-x");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, BadOutputFile) {
-  {
-    Options options;
-    auto args = makeArray("notzst", "-d", "-p", "1");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ("", options.getOutputFile(options.inputFiles.front()));
-  }
-}
-
-TEST(Options, BadOptionsWithArguments) {
-  {
-    Options options;
-    auto args = makeArray("x", "-pf");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-p", "10f");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-p");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-o");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-o");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, KeepSource) {
-  {
-    Options options;
-    auto args = makeArray("x", "--rm", "-k");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.keepSource);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--rm", "--keep");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.keepSource);
-  }
-  {
-    Options options;
-    auto args = makeArray("x");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.keepSource);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--rm");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(false, options.keepSource);
-  }
-}
-
-TEST(Options, Verbosity) {
-  {
-    Options options;
-    auto args = makeArray("x");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(2, options.verbosity);
-  }
-  {
-    Options options;
-    auto args = makeArray("--quiet", "-qq", "x");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(-1, options.verbosity);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "y");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(1, options.verbosity);
-  }
-  {
-    Options options;
-    auto args = makeArray("--", "x", "y");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(1, options.verbosity);
-  }
-  {
-    Options options;
-    auto args = makeArray("-qv", "x", "y");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(1, options.verbosity);
-  }
-  {
-    Options options;
-    auto args = makeArray("-v", "x", "y");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(3, options.verbosity);
-  }
-  {
-    Options options;
-    auto args = makeArray("-v", "x");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(3, options.verbosity);
-  }
-}
-
-TEST(Options, TestMode) {
-  {
-    Options options;
-    auto args = makeArray("x", "-t");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.keepSource);
-    EXPECT_EQ(true, options.decompress);
-    EXPECT_EQ(nullOutput, options.outputFile);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--test", "--rm", "-ohello");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.keepSource);
-    EXPECT_EQ(true, options.decompress);
-    EXPECT_EQ(nullOutput, options.outputFile);
-  }
-}
-
-TEST(Options, Checksum) {
-  {
-    Options options;
-    auto args = makeArray("x.zst", "--no-check", "-Cd");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.checksum);
-  }
-  {
-    Options options;
-    auto args = makeArray("x");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.checksum);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--no-check", "--check");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(true, options.checksum);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "--no-check");
-    EXPECT_SUCCESS(options.parse(args.size(), args.data()));
-    EXPECT_EQ(false, options.checksum);
-  }
-}
-
-TEST(Options, InputFiles) {
-  {
-    Options options;
-    auto args = makeArray("-cd");
-    options.parse(args.size(), args.data());
-    EXPECT_EQ(1, options.inputFiles.size());
-    EXPECT_EQ("-", options.inputFiles[0]);
-    EXPECT_EQ("-", options.outputFile);
-  }
-  {
-    Options options;
-    auto args = makeArray();
-    options.parse(args.size(), args.data());
-    EXPECT_EQ(1, options.inputFiles.size());
-    EXPECT_EQ("-", options.inputFiles[0]);
-    EXPECT_EQ("-", options.outputFile);
-  }
-  {
-    Options options;
-    auto args = makeArray("-d");
-    options.parse(args.size(), args.data());
-    EXPECT_EQ(1, options.inputFiles.size());
-    EXPECT_EQ("-", options.inputFiles[0]);
-    EXPECT_EQ("-", options.outputFile);
-  }
-  {
-    Options options;
-    auto args = makeArray("x", "-");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, InvalidOptions) {
-  {
-    Options options;
-    auto args = makeArray("-ibasdf");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("- ");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("-n15");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("-0", "x");
-    EXPECT_FAILURE(options.parse(args.size(), args.data()));
-  }
-}
-
-TEST(Options, Extras) {
-  {
-    Options options;
-    auto args = makeArray("-h");
-    EXPECT_MESSAGE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("-H");
-    EXPECT_MESSAGE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("-V");
-    EXPECT_MESSAGE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("--help");
-    EXPECT_MESSAGE(options.parse(args.size(), args.data()));
-  }
-  {
-    Options options;
-    auto args = makeArray("--version");
-    EXPECT_MESSAGE(options.parse(args.size(), args.data()));
-  }
-}
diff --git a/priv/zstd/contrib/pzstd/test/PzstdTest.cpp b/priv/zstd/contrib/pzstd/test/PzstdTest.cpp
deleted file mode 100644
index 5c7d663..0000000
--- a/priv/zstd/contrib/pzstd/test/PzstdTest.cpp
+++ /dev/null
@@ -1,149 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "Pzstd.h"
-extern "C" {
-#include "datagen.h"
-}
-#include "test/RoundTrip.h"
-#include "utils/ScopeGuard.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-using namespace std;
-using namespace pzstd;
-
-TEST(Pzstd, SmallSizes) {
-  unsigned seed = std::random_device{}();
-  std::fprintf(stderr, "Pzstd.SmallSizes seed: %u\n", seed);
-  std::mt19937 gen(seed);
-
-  for (unsigned len = 1; len < 256; ++len) {
-    if (len % 16 == 0) {
-      std::fprintf(stderr, "%u / 16\n", len / 16);
-    }
-    std::string inputFile = std::tmpnam(nullptr);
-    auto guard = makeScopeGuard([&] { std::remove(inputFile.c_str()); });
-    {
-      static uint8_t buf[256];
-      RDG_genBuffer(buf, len, 0.5, 0.0, gen());
-      auto fd = std::fopen(inputFile.c_str(), "wb");
-      auto written = std::fwrite(buf, 1, len, fd);
-      std::fclose(fd);
-      ASSERT_EQ(written, len);
-    }
-    for (unsigned numThreads = 1; numThreads <= 2; ++numThreads) {
-      for (unsigned level = 1; level <= 4; level *= 4) {
-        auto errorGuard = makeScopeGuard([&] {
-          std::fprintf(stderr, "# threads: %u\n", numThreads);
-          std::fprintf(stderr, "compression level: %u\n", level);
-        });
-        Options options;
-        options.overwrite = true;
-        options.inputFiles = {inputFile};
-        options.numThreads = numThreads;
-        options.compressionLevel = level;
-        options.verbosity = 1;
-        ASSERT_TRUE(roundTrip(options));
-        errorGuard.dismiss();
-      }
-    }
-  }
-}
-
-TEST(Pzstd, LargeSizes) {
-  unsigned seed = std::random_device{}();
-  std::fprintf(stderr, "Pzstd.LargeSizes seed: %u\n", seed);
-  std::mt19937 gen(seed);
-
-  for (unsigned len = 1 << 20; len <= (1 << 24); len *= 2) {
-    std::string inputFile = std::tmpnam(nullptr);
-    auto guard = makeScopeGuard([&] { std::remove(inputFile.c_str()); });
-    {
-      std::unique_ptr buf(new uint8_t[len]);
-      RDG_genBuffer(buf.get(), len, 0.5, 0.0, gen());
-      auto fd = std::fopen(inputFile.c_str(), "wb");
-      auto written = std::fwrite(buf.get(), 1, len, fd);
-      std::fclose(fd);
-      ASSERT_EQ(written, len);
-    }
-    for (unsigned numThreads = 1; numThreads <= 16; numThreads *= 4) {
-      for (unsigned level = 1; level <= 4; level *= 4) {
-        auto errorGuard = makeScopeGuard([&] {
-          std::fprintf(stderr, "# threads: %u\n", numThreads);
-          std::fprintf(stderr, "compression level: %u\n", level);
-        });
-        Options options;
-        options.overwrite = true;
-        options.inputFiles = {inputFile};
-        options.numThreads = std::min(numThreads, options.numThreads);
-        options.compressionLevel = level;
-        options.verbosity = 1;
-        ASSERT_TRUE(roundTrip(options));
-        errorGuard.dismiss();
-      }
-    }
-  }
-}
-
-TEST(Pzstd, DISABLED_ExtremelyLargeSize) {
-  unsigned seed = std::random_device{}();
-  std::fprintf(stderr, "Pzstd.ExtremelyLargeSize seed: %u\n", seed);
-  std::mt19937 gen(seed);
-
-  std::string inputFile = std::tmpnam(nullptr);
-  auto guard = makeScopeGuard([&] { std::remove(inputFile.c_str()); });
-
-  {
-    // Write 4GB + 64 MB
-    constexpr size_t kLength = 1 << 26;
-    std::unique_ptr buf(new uint8_t[kLength]);
-    auto fd = std::fopen(inputFile.c_str(), "wb");
-    auto closeGuard = makeScopeGuard([&] { std::fclose(fd); });
-    for (size_t i = 0; i < (1 << 6) + 1; ++i) {
-      RDG_genBuffer(buf.get(), kLength, 0.5, 0.0, gen());
-      auto written = std::fwrite(buf.get(), 1, kLength, fd);
-      if (written != kLength) {
-        std::fprintf(stderr, "Failed to write file, skipping test\n");
-        return;
-      }
-    }
-  }
-
-  Options options;
-  options.overwrite = true;
-  options.inputFiles = {inputFile};
-  options.compressionLevel = 1;
-  if (options.numThreads == 0) {
-    options.numThreads = 1;
-  }
-  ASSERT_TRUE(roundTrip(options));
-}
-
-TEST(Pzstd, ExtremelyCompressible) {
-  std::string inputFile = std::tmpnam(nullptr);
-  auto guard = makeScopeGuard([&] { std::remove(inputFile.c_str()); });
-  {
-    std::unique_ptr buf(new uint8_t[10000]);
-    std::memset(buf.get(), 'a', 10000);
-    auto fd = std::fopen(inputFile.c_str(), "wb");
-    auto written = std::fwrite(buf.get(), 1, 10000, fd);
-    std::fclose(fd);
-    ASSERT_EQ(written, 10000);
-  }
-  Options options;
-  options.overwrite = true;
-  options.inputFiles = {inputFile};
-  options.numThreads = 1;
-  options.compressionLevel = 1;
-  ASSERT_TRUE(roundTrip(options));
-}
diff --git a/priv/zstd/contrib/pzstd/test/RoundTrip.h b/priv/zstd/contrib/pzstd/test/RoundTrip.h
deleted file mode 100644
index c6364ec..0000000
--- a/priv/zstd/contrib/pzstd/test/RoundTrip.h
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "Options.h"
-#include "Pzstd.h"
-#include "utils/ScopeGuard.h"
-
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-inline bool check(std::string source, std::string decompressed) {
-  std::unique_ptr sBuf(new std::uint8_t[1024]);
-  std::unique_ptr dBuf(new std::uint8_t[1024]);
-
-  auto sFd = std::fopen(source.c_str(), "rb");
-  auto dFd = std::fopen(decompressed.c_str(), "rb");
-  auto guard = makeScopeGuard([&] {
-    std::fclose(sFd);
-    std::fclose(dFd);
-  });
-
-  size_t sRead, dRead;
-
-  do {
-    sRead = std::fread(sBuf.get(), 1, 1024, sFd);
-    dRead = std::fread(dBuf.get(), 1, 1024, dFd);
-    if (std::ferror(sFd) || std::ferror(dFd)) {
-      return false;
-    }
-    if (sRead != dRead) {
-      return false;
-    }
-
-    for (size_t i = 0; i < sRead; ++i) {
-      if (sBuf.get()[i] != dBuf.get()[i]) {
-        return false;
-      }
-    }
-  } while (sRead == 1024);
-  if (!std::feof(sFd) || !std::feof(dFd)) {
-    return false;
-  }
-  return true;
-}
-
-inline bool roundTrip(Options& options) {
-  if (options.inputFiles.size() != 1) {
-    return false;
-  }
-  std::string source = options.inputFiles.front();
-  std::string compressedFile = std::tmpnam(nullptr);
-  std::string decompressedFile = std::tmpnam(nullptr);
-  auto guard = makeScopeGuard([&] {
-    std::remove(compressedFile.c_str());
-    std::remove(decompressedFile.c_str());
-  });
-
-  {
-    options.outputFile = compressedFile;
-    options.decompress = false;
-    if (pzstdMain(options) != 0) {
-      return false;
-    }
-  }
-  {
-    options.decompress = true;
-    options.inputFiles.front() = compressedFile;
-    options.outputFile = decompressedFile;
-    if (pzstdMain(options) != 0) {
-      return false;
-    }
-  }
-  return check(source, decompressedFile);
-}
-}
diff --git a/priv/zstd/contrib/pzstd/test/RoundTripTest.cpp b/priv/zstd/contrib/pzstd/test/RoundTripTest.cpp
deleted file mode 100644
index 36af067..0000000
--- a/priv/zstd/contrib/pzstd/test/RoundTripTest.cpp
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-extern "C" {
-#include "datagen.h"
-}
-#include "Options.h"
-#include "test/RoundTrip.h"
-#include "utils/ScopeGuard.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-using namespace std;
-using namespace pzstd;
-
-namespace {
-string
-writeData(size_t size, double matchProba, double litProba, unsigned seed) {
-  std::unique_ptr buf(new uint8_t[size]);
-  RDG_genBuffer(buf.get(), size, matchProba, litProba, seed);
-  string file = tmpnam(nullptr);
-  auto fd = std::fopen(file.c_str(), "wb");
-  auto guard = makeScopeGuard([&] { std::fclose(fd); });
-  auto bytesWritten = std::fwrite(buf.get(), 1, size, fd);
-  if (bytesWritten != size) {
-    std::abort();
-  }
-  return file;
-}
-
-template 
-string generateInputFile(Generator& gen) {
-  // Use inputs ranging from 1 Byte to 2^16 Bytes
-  std::uniform_int_distribution size{1, 1 << 16};
-  std::uniform_real_distribution<> prob{0, 1};
-  return writeData(size(gen), prob(gen), prob(gen), gen());
-}
-
-template 
-Options generateOptions(Generator& gen, const string& inputFile) {
-  Options options;
-  options.inputFiles = {inputFile};
-  options.overwrite = true;
-
-  std::uniform_int_distribution numThreads{1, 32};
-  std::uniform_int_distribution compressionLevel{1, 10};
-
-  options.numThreads = numThreads(gen);
-  options.compressionLevel = compressionLevel(gen);
-
-  return options;
-}
-}
-
-int main() {
-  std::mt19937 gen(std::random_device{}());
-
-  auto newlineGuard = makeScopeGuard([] { std::fprintf(stderr, "\n"); });
-  for (unsigned i = 0; i < 10000; ++i) {
-    if (i % 100 == 0) {
-      std::fprintf(stderr, "Progress: %u%%\r", i / 100);
-    }
-    auto inputFile = generateInputFile(gen);
-    auto inputGuard = makeScopeGuard([&] { std::remove(inputFile.c_str()); });
-    for (unsigned i = 0; i < 10; ++i) {
-      auto options = generateOptions(gen, inputFile);
-      if (!roundTrip(options)) {
-        std::fprintf(stderr, "numThreads: %u\n", options.numThreads);
-        std::fprintf(stderr, "level: %u\n", options.compressionLevel);
-        std::fprintf(stderr, "decompress? %u\n", (unsigned)options.decompress);
-        std::fprintf(stderr, "file: %s\n", inputFile.c_str());
-        return 1;
-      }
-    }
-  }
-  return 0;
-}
diff --git a/priv/zstd/contrib/pzstd/utils/BUCK b/priv/zstd/contrib/pzstd/utils/BUCK
deleted file mode 100644
index e757f41..0000000
--- a/priv/zstd/contrib/pzstd/utils/BUCK
+++ /dev/null
@@ -1,75 +0,0 @@
-cxx_library(
-    name='buffer',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['Buffer.h'],
-    deps=[':range'],
-)
-
-cxx_library(
-    name='file_system',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['FileSystem.h'],
-    deps=[':range'],
-)
-
-cxx_library(
-    name='likely',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['Likely.h'],
-)
-
-cxx_library(
-    name='range',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['Range.h'],
-    deps=[':likely'],
-)
-
-cxx_library(
-    name='resource_pool',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['ResourcePool.h'],
-)
-
-cxx_library(
-    name='scope_guard',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['ScopeGuard.h'],
-)
-
-cxx_library(
-    name='thread_pool',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['ThreadPool.h'],
-    deps=[':work_queue'],
-)
-
-cxx_library(
-    name='work_queue',
-    visibility=['PUBLIC'],
-    header_namespace='utils',
-    exported_headers=['WorkQueue.h'],
-    deps=[':buffer'],
-)
-
-cxx_library(
-    name='utils',
-    visibility=['PUBLIC'],
-    deps=[
-        ':buffer',
-        ':file_system',
-        ':likely',
-        ':range',
-        ':resource_pool',
-        ':scope_guard',
-        ':thread_pool',
-        ':work_queue',
-    ],
-)
diff --git a/priv/zstd/contrib/pzstd/utils/Buffer.h b/priv/zstd/contrib/pzstd/utils/Buffer.h
deleted file mode 100644
index f69c3b4..0000000
--- a/priv/zstd/contrib/pzstd/utils/Buffer.h
+++ /dev/null
@@ -1,99 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "utils/Range.h"
-
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-/**
- * A `Buffer` has a pointer to a shared buffer, and a range of the buffer that
- * it owns.
- * The idea is that you can allocate one buffer, and write chunks into it
- * and break off those chunks.
- * The underlying buffer is reference counted, and will be destroyed when all
- * `Buffer`s that reference it are destroyed.
- */
-class Buffer {
-  std::shared_ptr buffer_;
-  MutableByteRange range_;
-
-  static void delete_buffer(unsigned char* buffer) {
-    delete[] buffer;
-  }
-
- public:
-  /// Construct an empty buffer that owns no data.
-  explicit Buffer() {}
-
-  /// Construct a `Buffer` that owns a new underlying buffer of size `size`.
-  explicit Buffer(std::size_t size)
-      : buffer_(new unsigned char[size], delete_buffer),
-        range_(buffer_.get(), buffer_.get() + size) {}
-
-  explicit Buffer(std::shared_ptr buffer, MutableByteRange data)
-      : buffer_(buffer), range_(data) {}
-
-  Buffer(Buffer&&) = default;
-  Buffer& operator=(Buffer&&) & = default;
-
-  /**
-   * Splits the data into two pieces: [begin, begin + n), [begin + n, end).
-   * Their data both points into the same underlying buffer.
-   * Modifies the original `Buffer` to point to only [begin + n, end).
-   *
-   * @param n  The offset to split at.
-   * @returns  A buffer that owns the data [begin, begin + n).
-   */
-  Buffer splitAt(std::size_t n) {
-    auto firstPiece = range_.subpiece(0, n);
-    range_.advance(n);
-    return Buffer(buffer_, firstPiece);
-  }
-
-  /// Modifies the buffer to point to the range [begin + n, end).
-  void advance(std::size_t n) {
-    range_.advance(n);
-  }
-
-  /// Modifies the buffer to point to the range [begin, end - n).
-  void subtract(std::size_t n) {
-    range_.subtract(n);
-  }
-
-  /// Returns a read only `Range` pointing to the `Buffer`s data.
-  ByteRange range() const {
-    return range_;
-  }
-  /// Returns a mutable `Range` pointing to the `Buffer`s data.
-  MutableByteRange range() {
-    return range_;
-  }
-
-  const unsigned char* data() const {
-    return range_.data();
-  }
-
-  unsigned char* data() {
-    return range_.data();
-  }
-
-  std::size_t size() const {
-    return range_.size();
-  }
-
-  bool empty() const {
-    return range_.empty();
-  }
-};
-}
diff --git a/priv/zstd/contrib/pzstd/utils/FileSystem.h b/priv/zstd/contrib/pzstd/utils/FileSystem.h
deleted file mode 100644
index 3cfbe86..0000000
--- a/priv/zstd/contrib/pzstd/utils/FileSystem.h
+++ /dev/null
@@ -1,94 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "utils/Range.h"
-
-#include 
-#include 
-#include 
-#include 
-
-// A small subset of `std::filesystem`.
-// `std::filesystem` should be a drop in replacement.
-// See http://en.cppreference.com/w/cpp/filesystem for documentation.
-
-namespace pzstd {
-
-// using file_status = ... causes gcc to emit a false positive warning
-#if defined(_MSC_VER)
-typedef struct ::_stat64 file_status;
-#else
-typedef struct ::stat file_status;
-#endif
-
-/// http://en.cppreference.com/w/cpp/filesystem/status
-inline file_status status(StringPiece path, std::error_code& ec) noexcept {
-  file_status status;
-#if defined(_MSC_VER)
-  const auto error = ::_stat64(path.data(), &status);
-#else
-  const auto error = ::stat(path.data(), &status);
-#endif
-  if (error) {
-    ec.assign(errno, std::generic_category());
-  } else {
-    ec.clear();
-  }
-  return status;
-}
-
-/// http://en.cppreference.com/w/cpp/filesystem/is_regular_file
-inline bool is_regular_file(file_status status) noexcept {
-#if defined(S_ISREG)
-  return S_ISREG(status.st_mode);
-#elif !defined(S_ISREG) && defined(S_IFMT) && defined(S_IFREG)
-  return (status.st_mode & S_IFMT) == S_IFREG;
-#else
-  static_assert(false, "No POSIX stat() support.");
-#endif
-}
-
-/// http://en.cppreference.com/w/cpp/filesystem/is_regular_file
-inline bool is_regular_file(StringPiece path, std::error_code& ec) noexcept {
-  return is_regular_file(status(path, ec));
-}
-
-/// http://en.cppreference.com/w/cpp/filesystem/is_directory
-inline bool is_directory(file_status status) noexcept {
-#if defined(S_ISDIR)
-  return S_ISDIR(status.st_mode);
-#elif !defined(S_ISDIR) && defined(S_IFMT) && defined(S_IFDIR)
-  return (status.st_mode & S_IFMT) == S_IFDIR;
-#else
-  static_assert(false, "NO POSIX stat() support.");
-#endif
-}
-
-/// http://en.cppreference.com/w/cpp/filesystem/is_directory
-inline bool is_directory(StringPiece path, std::error_code& ec) noexcept {
-  return is_directory(status(path, ec));
-}
-
-/// http://en.cppreference.com/w/cpp/filesystem/file_size
-inline std::uintmax_t file_size(
-    StringPiece path,
-    std::error_code& ec) noexcept {
-  auto stat = status(path, ec);
-  if (ec) {
-    return -1;
-  }
-  if (!is_regular_file(stat)) {
-    ec.assign(ENOTSUP, std::generic_category());
-    return -1;
-  }
-  ec.clear();
-  return stat.st_size;
-}
-}
diff --git a/priv/zstd/contrib/pzstd/utils/Likely.h b/priv/zstd/contrib/pzstd/utils/Likely.h
deleted file mode 100644
index 7cea8da..0000000
--- a/priv/zstd/contrib/pzstd/utils/Likely.h
+++ /dev/null
@@ -1,28 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
- 
-/**
- * Compiler hints to indicate the fast path of an "if" branch: whether
- * the if condition is likely to be true or false.
- *
- * @author Tudor Bosman (tudorb@fb.com)
- */
-
-#pragma once
-
-#undef LIKELY
-#undef UNLIKELY
-
-#if defined(__GNUC__) && __GNUC__ >= 4
-#define LIKELY(x) (__builtin_expect((x), 1))
-#define UNLIKELY(x) (__builtin_expect((x), 0))
-#else
-#define LIKELY(x) (x)
-#define UNLIKELY(x) (x)
-#endif
diff --git a/priv/zstd/contrib/pzstd/utils/Range.h b/priv/zstd/contrib/pzstd/utils/Range.h
deleted file mode 100644
index 7e2559c..0000000
--- a/priv/zstd/contrib/pzstd/utils/Range.h
+++ /dev/null
@@ -1,131 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
- 
-/**
- * A subset of `folly/Range.h`.
- * All code copied verbatiam modulo formatting
- */
-#pragma once
-
-#include "utils/Likely.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-namespace detail {
-/*
- *Use IsCharPointer::type to enable const char* or char*.
- *Use IsCharPointer::const_type to enable only const char*.
-*/
-template 
-struct IsCharPointer {};
-
-template <>
-struct IsCharPointer {
-  typedef int type;
-};
-
-template <>
-struct IsCharPointer {
-  typedef int const_type;
-  typedef int type;
-};
-
-} // namespace detail
-
-template 
-class Range {
-  Iter b_;
-  Iter e_;
-
- public:
-  using size_type = std::size_t;
-  using iterator = Iter;
-  using const_iterator = Iter;
-  using value_type = typename std::remove_reference<
-      typename std::iterator_traits::reference>::type;
-  using reference = typename std::iterator_traits::reference;
-
-  constexpr Range() : b_(), e_() {}
-  constexpr Range(Iter begin, Iter end) : b_(begin), e_(end) {}
-
-  constexpr Range(Iter begin, size_type size) : b_(begin), e_(begin + size) {}
-
-  template ::type = 0>
-  /* implicit */ Range(Iter str) : b_(str), e_(str + std::strlen(str)) {}
-
-  template ::const_type = 0>
-  /* implicit */ Range(const std::string& str)
-      : b_(str.data()), e_(b_ + str.size()) {}
-
-  // Allow implicit conversion from Range to Range if From is
-  // implicitly convertible to To.
-  template <
-      class OtherIter,
-      typename std::enable_if<
-          (!std::is_same::value &&
-           std::is_convertible::value),
-          int>::type = 0>
-  constexpr /* implicit */ Range(const Range& other)
-      : b_(other.begin()), e_(other.end()) {}
-
-  Range(const Range&) = default;
-  Range(Range&&) = default;
-
-  Range& operator=(const Range&) & = default;
-  Range& operator=(Range&&) & = default;
-
-  constexpr size_type size() const {
-    return e_ - b_;
-  }
-  bool empty() const {
-    return b_ == e_;
-  }
-  Iter data() const {
-    return b_;
-  }
-  Iter begin() const {
-    return b_;
-  }
-  Iter end() const {
-    return e_;
-  }
-
-  void advance(size_type n) {
-    if (UNLIKELY(n > size())) {
-      throw std::out_of_range("index out of range");
-    }
-    b_ += n;
-  }
-
-  void subtract(size_type n) {
-    if (UNLIKELY(n > size())) {
-      throw std::out_of_range("index out of range");
-    }
-    e_ -= n;
-  }
-
-  Range subpiece(size_type first, size_type length = std::string::npos) const {
-    if (UNLIKELY(first > size())) {
-      throw std::out_of_range("index out of range");
-    }
-
-    return Range(b_ + first, std::min(length, size() - first));
-  }
-};
-
-using ByteRange = Range;
-using MutableByteRange = Range;
-using StringPiece = Range;
-}
diff --git a/priv/zstd/contrib/pzstd/utils/ResourcePool.h b/priv/zstd/contrib/pzstd/utils/ResourcePool.h
deleted file mode 100644
index a6ff5ff..0000000
--- a/priv/zstd/contrib/pzstd/utils/ResourcePool.h
+++ /dev/null
@@ -1,96 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-/**
- * An unbounded pool of resources.
- * A `ResourcePool` requires a factory function that takes allocates `T*` and
- * a free function that frees a `T*`.
- * Calling `ResourcePool::get()` will give you a new `ResourcePool::UniquePtr`
- * to a `T`, and when it goes out of scope the resource will be returned to the
- * pool.
- * The `ResourcePool` *must* survive longer than any resources it hands out.
- * Remember that `ResourcePool` hands out mutable `T`s, so make sure to clean
- * up the resource before or after every use.
- */
-template 
-class ResourcePool {
- public:
-  class Deleter;
-  using Factory = std::function;
-  using Free = std::function;
-  using UniquePtr = std::unique_ptr;
-
- private:
-  std::mutex mutex_;
-  Factory factory_;
-  Free free_;
-  std::vector resources_;
-  unsigned inUse_;
-
- public:
-  /**
-   * Creates a `ResourcePool`.
-   *
-   * @param factory  The function to use to create new resources.
-   * @param free     The function to use to free resources created by `factory`.
-   */
-  ResourcePool(Factory factory, Free free)
-      : factory_(std::move(factory)), free_(std::move(free)), inUse_(0) {}
-
-  /**
-   * @returns  A unique pointer to a resource.  The resource is null iff
-   *           there are no avaiable resources and `factory()` returns null.
-   */
-  UniquePtr get() {
-    std::lock_guard lock(mutex_);
-    if (!resources_.empty()) {
-      UniquePtr resource{resources_.back(), Deleter{*this}};
-      resources_.pop_back();
-      ++inUse_;
-      return resource;
-    }
-    UniquePtr resource{factory_(), Deleter{*this}};
-    ++inUse_;
-    return resource;
-  }
-
-  ~ResourcePool() noexcept {
-    assert(inUse_ == 0);
-    for (const auto resource : resources_) {
-      free_(resource);
-    }
-  }
-
-  class Deleter {
-    ResourcePool *pool_;
-  public:
-    explicit Deleter(ResourcePool &pool) : pool_(&pool) {}
-
-    void operator() (T *resource) {
-      std::lock_guard lock(pool_->mutex_);
-      // Make sure we don't put null resources into the pool
-      if (resource) {
-        pool_->resources_.push_back(resource);
-      }
-      assert(pool_->inUse_ > 0);
-      --pool_->inUse_;
-    }
-  };
-};
-
-}
diff --git a/priv/zstd/contrib/pzstd/utils/ScopeGuard.h b/priv/zstd/contrib/pzstd/utils/ScopeGuard.h
deleted file mode 100644
index 31768f4..0000000
--- a/priv/zstd/contrib/pzstd/utils/ScopeGuard.h
+++ /dev/null
@@ -1,50 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include 
-
-namespace pzstd {
-
-/**
- * Dismissable scope guard.
- * `Function` must be callable and take no parameters.
- * Unless `dissmiss()` is called, the callable is executed upon destruction of
- * `ScopeGuard`.
- *
- * Example:
- *
- *   auto guard = makeScopeGuard([&] { cleanup(); });
- */
-template 
-class ScopeGuard {
-  Function function;
-  bool dismissed;
-
- public:
-  explicit ScopeGuard(Function&& function)
-      : function(std::move(function)), dismissed(false) {}
-
-  void dismiss() {
-    dismissed = true;
-  }
-
-  ~ScopeGuard() noexcept {
-    if (!dismissed) {
-      function();
-    }
-  }
-};
-
-/// Creates a scope guard from `function`.
-template 
-ScopeGuard makeScopeGuard(Function&& function) {
-  return ScopeGuard(std::forward(function));
-}
-}
diff --git a/priv/zstd/contrib/pzstd/utils/ThreadPool.h b/priv/zstd/contrib/pzstd/utils/ThreadPool.h
deleted file mode 100644
index 8ece8e0..0000000
--- a/priv/zstd/contrib/pzstd/utils/ThreadPool.h
+++ /dev/null
@@ -1,58 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "utils/WorkQueue.h"
-
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-/// A simple thread pool that pulls tasks off its queue in FIFO order.
-class ThreadPool {
-  std::vector threads_;
-
-  WorkQueue> tasks_;
-
- public:
-  /// Constructs a thread pool with `numThreads` threads.
-  explicit ThreadPool(std::size_t numThreads) {
-    threads_.reserve(numThreads);
-    for (std::size_t i = 0; i < numThreads; ++i) {
-      threads_.emplace_back([this] {
-        std::function task;
-        while (tasks_.pop(task)) {
-          task();
-        }
-      });
-    }
-  }
-
-  /// Finishes all tasks currently in the queue.
-  ~ThreadPool() {
-    tasks_.finish();
-    for (auto& thread : threads_) {
-      thread.join();
-    }
-  }
-
-  /**
-   * Adds `task` to the queue of tasks to execute. Since `task` is a
-   * `std::function<>`, it cannot be a move only type. So any lambda passed must
-   * not capture move only types (like `std::unique_ptr`).
-   *
-   * @param task  The task to execute.
-   */
-  void add(std::function task) {
-    tasks_.push(std::move(task));
-  }
-};
-}
diff --git a/priv/zstd/contrib/pzstd/utils/WorkQueue.h b/priv/zstd/contrib/pzstd/utils/WorkQueue.h
deleted file mode 100644
index 1d14d92..0000000
--- a/priv/zstd/contrib/pzstd/utils/WorkQueue.h
+++ /dev/null
@@ -1,181 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include "utils/Buffer.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
-namespace pzstd {
-
-/// Unbounded thread-safe work queue.
-template 
-class WorkQueue {
-  // Protects all member variable access
-  std::mutex mutex_;
-  std::condition_variable readerCv_;
-  std::condition_variable writerCv_;
-  std::condition_variable finishCv_;
-
-  std::queue queue_;
-  bool done_;
-  std::size_t maxSize_;
-
-  // Must have lock to call this function
-  bool full() const {
-    if (maxSize_ == 0) {
-      return false;
-    }
-    return queue_.size() >= maxSize_;
-  }
-
- public:
-  /**
-   * Constructs an empty work queue with an optional max size.
-   * If `maxSize == 0` the queue size is unbounded.
-   *
-   * @param maxSize The maximum allowed size of the work queue.
-   */
-  WorkQueue(std::size_t maxSize = 0) : done_(false), maxSize_(maxSize) {}
-
-  /**
-   * Push an item onto the work queue.  Notify a single thread that work is
-   * available.  If `finish()` has been called, do nothing and return false.
-   * If `push()` returns false, then `item` has not been moved from.
-   *
-   * @param item  Item to push onto the queue.
-   * @returns     True upon success, false if `finish()` has been called.  An
-   *               item was pushed iff `push()` returns true.
-   */
-  bool push(T&& item) {
-    {
-      std::unique_lock lock(mutex_);
-      while (full() && !done_) {
-        writerCv_.wait(lock);
-      }
-      if (done_) {
-        return false;
-      }
-      queue_.push(std::move(item));
-    }
-    readerCv_.notify_one();
-    return true;
-  }
-
-  /**
-   * Attempts to pop an item off the work queue.  It will block until data is
-   * available or `finish()` has been called.
-   *
-   * @param[out] item  If `pop` returns `true`, it contains the popped item.
-   *                    If `pop` returns `false`, it is unmodified.
-   * @returns          True upon success.  False if the queue is empty and
-   *                    `finish()` has been called.
-   */
-  bool pop(T& item) {
-    {
-      std::unique_lock lock(mutex_);
-      while (queue_.empty() && !done_) {
-        readerCv_.wait(lock);
-      }
-      if (queue_.empty()) {
-        assert(done_);
-        return false;
-      }
-      item = std::move(queue_.front());
-      queue_.pop();
-    }
-    writerCv_.notify_one();
-    return true;
-  }
-
-  /**
-   * Sets the maximum queue size.  If `maxSize == 0` then it is unbounded.
-   *
-   * @param maxSize The new maximum queue size.
-   */
-  void setMaxSize(std::size_t maxSize) {
-    {
-      std::lock_guard lock(mutex_);
-      maxSize_ = maxSize;
-    }
-    writerCv_.notify_all();
-  }
-
-  /**
-   * Promise that `push()` won't be called again, so once the queue is empty
-   * there will never any more work.
-   */
-  void finish() {
-    {
-      std::lock_guard lock(mutex_);
-      assert(!done_);
-      done_ = true;
-    }
-    readerCv_.notify_all();
-    writerCv_.notify_all();
-    finishCv_.notify_all();
-  }
-
-  /// Blocks until `finish()` has been called (but the queue may not be empty).
-  void waitUntilFinished() {
-    std::unique_lock lock(mutex_);
-    while (!done_) {
-      finishCv_.wait(lock);
-    }
-  }
-};
-
-/// Work queue for `Buffer`s that knows the total number of bytes in the queue.
-class BufferWorkQueue {
-  WorkQueue queue_;
-  std::atomic size_;
-
- public:
-  BufferWorkQueue(std::size_t maxSize = 0) : queue_(maxSize), size_(0) {}
-
-  void push(Buffer buffer) {
-    size_.fetch_add(buffer.size());
-    queue_.push(std::move(buffer));
-  }
-
-  bool pop(Buffer& buffer) {
-    bool result = queue_.pop(buffer);
-    if (result) {
-      size_.fetch_sub(buffer.size());
-    }
-    return result;
-  }
-
-  void setMaxSize(std::size_t maxSize) {
-    queue_.setMaxSize(maxSize);
-  }
-
-  void finish() {
-    queue_.finish();
-  }
-
-  /**
-   * Blocks until `finish()` has been called.
-   *
-   * @returns The total number of bytes of all the `Buffer`s currently in the
-   *           queue.
-   */
-  std::size_t size() {
-    queue_.waitUntilFinished();
-    return size_.load();
-  }
-};
-}
diff --git a/priv/zstd/contrib/pzstd/utils/test/BUCK b/priv/zstd/contrib/pzstd/utils/test/BUCK
deleted file mode 100644
index a5113ca..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/BUCK
+++ /dev/null
@@ -1,35 +0,0 @@
-cxx_test(
-    name='buffer_test',
-    srcs=['BufferTest.cpp'],
-    deps=['//contrib/pzstd/utils:buffer'],
-)
-
-cxx_test(
-    name='range_test',
-    srcs=['RangeTest.cpp'],
-    deps=['//contrib/pzstd/utils:range'],
-)
-
-cxx_test(
-    name='resource_pool_test',
-    srcs=['ResourcePoolTest.cpp'],
-    deps=['//contrib/pzstd/utils:resource_pool'],
-)
-
-cxx_test(
-    name='scope_guard_test',
-    srcs=['ScopeGuardTest.cpp'],
-    deps=['//contrib/pzstd/utils:scope_guard'],
-)
-
-cxx_test(
-    name='thread_pool_test',
-    srcs=['ThreadPoolTest.cpp'],
-    deps=['//contrib/pzstd/utils:thread_pool'],
-)
-
-cxx_test(
-    name='work_queue_test',
-    srcs=['RangeTest.cpp'],
-    deps=['//contrib/pzstd/utils:work_queue'],
-)
diff --git a/priv/zstd/contrib/pzstd/utils/test/BufferTest.cpp b/priv/zstd/contrib/pzstd/utils/test/BufferTest.cpp
deleted file mode 100644
index fbba74e..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/BufferTest.cpp
+++ /dev/null
@@ -1,89 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "utils/Buffer.h"
-#include "utils/Range.h"
-
-#include 
-#include 
-
-using namespace pzstd;
-
-namespace {
-void deleter(const unsigned char* buf) {
-  delete[] buf;
-}
-}
-
-TEST(Buffer, Constructors) {
-  Buffer empty;
-  EXPECT_TRUE(empty.empty());
-  EXPECT_EQ(0, empty.size());
-
-  Buffer sized(5);
-  EXPECT_FALSE(sized.empty());
-  EXPECT_EQ(5, sized.size());
-
-  Buffer moved(std::move(sized));
-  EXPECT_FALSE(sized.empty());
-  EXPECT_EQ(5, sized.size());
-
-  Buffer assigned;
-  assigned = std::move(moved);
-  EXPECT_FALSE(sized.empty());
-  EXPECT_EQ(5, sized.size());
-}
-
-TEST(Buffer, BufferManagement) {
-  std::shared_ptr buf(new unsigned char[10], deleter);
-  {
-    Buffer acquired(buf, MutableByteRange(buf.get(), buf.get() + 10));
-    EXPECT_EQ(2, buf.use_count());
-    Buffer moved(std::move(acquired));
-    EXPECT_EQ(2, buf.use_count());
-    Buffer assigned;
-    assigned = std::move(moved);
-    EXPECT_EQ(2, buf.use_count());
-
-    Buffer split = assigned.splitAt(5);
-    EXPECT_EQ(3, buf.use_count());
-
-    split.advance(1);
-    assigned.subtract(1);
-    EXPECT_EQ(3, buf.use_count());
-  }
-  EXPECT_EQ(1, buf.use_count());
-}
-
-TEST(Buffer, Modifiers) {
-  Buffer buf(10);
-  {
-    unsigned char i = 0;
-    for (auto& byte : buf.range()) {
-      byte = i++;
-    }
-  }
-
-  auto prefix = buf.splitAt(2);
-
-  ASSERT_EQ(2, prefix.size());
-  EXPECT_EQ(0, *prefix.data());
-
-  ASSERT_EQ(8, buf.size());
-  EXPECT_EQ(2, *buf.data());
-
-  buf.advance(2);
-  EXPECT_EQ(4, *buf.data());
-
-  EXPECT_EQ(9, *(buf.range().end() - 1));
-
-  buf.subtract(2);
-  EXPECT_EQ(7, *(buf.range().end() - 1));
-
-  EXPECT_EQ(4, buf.size());
-}
diff --git a/priv/zstd/contrib/pzstd/utils/test/RangeTest.cpp b/priv/zstd/contrib/pzstd/utils/test/RangeTest.cpp
deleted file mode 100644
index 755b50f..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/RangeTest.cpp
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "utils/Range.h"
-
-#include 
-#include 
-
-using namespace pzstd;
-
-// Range is directly copied from folly.
-// Just some sanity tests to make sure everything seems to work.
-
-TEST(Range, Constructors) {
-  StringPiece empty;
-  EXPECT_TRUE(empty.empty());
-  EXPECT_EQ(0, empty.size());
-
-  std::string str = "hello";
-  {
-    Range piece(str.begin(), str.end());
-    EXPECT_EQ(5, piece.size());
-    EXPECT_EQ('h', *piece.data());
-    EXPECT_EQ('o', *(piece.end() - 1));
-  }
-
-  {
-    StringPiece piece(str.data(), str.size());
-    EXPECT_EQ(5, piece.size());
-    EXPECT_EQ('h', *piece.data());
-    EXPECT_EQ('o', *(piece.end() - 1));
-  }
-
-  {
-    StringPiece piece(str);
-    EXPECT_EQ(5, piece.size());
-    EXPECT_EQ('h', *piece.data());
-    EXPECT_EQ('o', *(piece.end() - 1));
-  }
-
-  {
-    StringPiece piece(str.c_str());
-    EXPECT_EQ(5, piece.size());
-    EXPECT_EQ('h', *piece.data());
-    EXPECT_EQ('o', *(piece.end() - 1));
-  }
-}
-
-TEST(Range, Modifiers) {
-  StringPiece range("hello world");
-  ASSERT_EQ(11, range.size());
-
-  {
-    auto hello = range.subpiece(0, 5);
-    EXPECT_EQ(5, hello.size());
-    EXPECT_EQ('h', *hello.data());
-    EXPECT_EQ('o', *(hello.end() - 1));
-  }
-  {
-    auto hello = range;
-    hello.subtract(6);
-    EXPECT_EQ(5, hello.size());
-    EXPECT_EQ('h', *hello.data());
-    EXPECT_EQ('o', *(hello.end() - 1));
-  }
-  {
-    auto world = range;
-    world.advance(6);
-    EXPECT_EQ(5, world.size());
-    EXPECT_EQ('w', *world.data());
-    EXPECT_EQ('d', *(world.end() - 1));
-  }
-
-  std::string expected = "hello world";
-  EXPECT_EQ(expected, std::string(range.begin(), range.end()));
-  EXPECT_EQ(expected, std::string(range.data(), range.size()));
-}
diff --git a/priv/zstd/contrib/pzstd/utils/test/ResourcePoolTest.cpp b/priv/zstd/contrib/pzstd/utils/test/ResourcePoolTest.cpp
deleted file mode 100644
index 6fe1451..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/ResourcePoolTest.cpp
+++ /dev/null
@@ -1,72 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "utils/ResourcePool.h"
-
-#include 
-#include 
-#include 
-
-using namespace pzstd;
-
-TEST(ResourcePool, FullTest) {
-  unsigned numCreated = 0;
-  unsigned numDeleted = 0;
-  {
-    ResourcePool pool(
-      [&numCreated] { ++numCreated; return new int{5}; },
-      [&numDeleted](int *x) { ++numDeleted; delete x; });
-
-    {
-      auto i = pool.get();
-      EXPECT_EQ(5, *i);
-      *i = 6;
-    }
-    {
-      auto i = pool.get();
-      EXPECT_EQ(6, *i);
-      auto j = pool.get();
-      EXPECT_EQ(5, *j);
-      *j = 7;
-    }
-    {
-      auto i = pool.get();
-      EXPECT_EQ(6, *i);
-      auto j = pool.get();
-      EXPECT_EQ(7, *j);
-    }
-  }
-  EXPECT_EQ(2, numCreated);
-  EXPECT_EQ(numCreated, numDeleted);
-}
-
-TEST(ResourcePool, ThreadSafe) {
-  std::atomic numCreated{0};
-  std::atomic numDeleted{0};
-  {
-    ResourcePool pool(
-      [&numCreated] { ++numCreated; return new int{0}; },
-      [&numDeleted](int *x) { ++numDeleted; delete x; });
-    auto push = [&pool] {
-      for (int i = 0; i < 100; ++i) {
-        auto x = pool.get();
-        ++*x;
-      }
-    };
-    std::thread t1{push};
-    std::thread t2{push};
-    t1.join();
-    t2.join();
-
-    auto x = pool.get();
-    auto y = pool.get();
-    EXPECT_EQ(200, *x + *y);
-  }
-  EXPECT_GE(2, numCreated);
-  EXPECT_EQ(numCreated, numDeleted);
-}
diff --git a/priv/zstd/contrib/pzstd/utils/test/ScopeGuardTest.cpp b/priv/zstd/contrib/pzstd/utils/test/ScopeGuardTest.cpp
deleted file mode 100644
index 7bc624d..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/ScopeGuardTest.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "utils/ScopeGuard.h"
-
-#include 
-
-using namespace pzstd;
-
-TEST(ScopeGuard, Dismiss) {
-  {
-    auto guard = makeScopeGuard([&] { EXPECT_TRUE(false); });
-    guard.dismiss();
-  }
-}
-
-TEST(ScopeGuard, Executes) {
-  bool executed = false;
-  {
-    auto guard = makeScopeGuard([&] { executed = true; });
-  }
-  EXPECT_TRUE(executed);
-}
diff --git a/priv/zstd/contrib/pzstd/utils/test/ThreadPoolTest.cpp b/priv/zstd/contrib/pzstd/utils/test/ThreadPoolTest.cpp
deleted file mode 100644
index 703fd4c..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/ThreadPoolTest.cpp
+++ /dev/null
@@ -1,71 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "utils/ThreadPool.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-
-using namespace pzstd;
-
-TEST(ThreadPool, Ordering) {
-  std::vector results;
-
-  {
-    ThreadPool executor(1);
-    for (int i = 0; i < 10; ++i) {
-      executor.add([ &results, i ] { results.push_back(i); });
-    }
-  }
-
-  for (int i = 0; i < 10; ++i) {
-    EXPECT_EQ(i, results[i]);
-  }
-}
-
-TEST(ThreadPool, AllJobsFinished) {
-  std::atomic numFinished{0};
-  std::atomic start{false};
-  {
-    std::cerr << "Creating executor" << std::endl;
-    ThreadPool executor(5);
-    for (int i = 0; i < 10; ++i) {
-      executor.add([ &numFinished, &start ] {
-        while (!start.load()) {
-          std::this_thread::yield();
-        }
-        ++numFinished;
-      });
-    }
-    std::cerr << "Starting" << std::endl;
-    start.store(true);
-    std::cerr << "Finishing" << std::endl;
-  }
-  EXPECT_EQ(10, numFinished.load());
-}
-
-TEST(ThreadPool, AddJobWhileJoining) {
-  std::atomic done{false};
-  {
-    ThreadPool executor(1);
-    executor.add([&executor, &done] {
-      while (!done.load()) {
-        std::this_thread::yield();
-      }
-      // Sleep for a second to be sure that we are joining
-      std::this_thread::sleep_for(std::chrono::seconds(1));
-      executor.add([] {
-        EXPECT_TRUE(false);
-      });
-    });
-    done.store(true);
-  }
-}
diff --git a/priv/zstd/contrib/pzstd/utils/test/WorkQueueTest.cpp b/priv/zstd/contrib/pzstd/utils/test/WorkQueueTest.cpp
deleted file mode 100644
index 14cf773..0000000
--- a/priv/zstd/contrib/pzstd/utils/test/WorkQueueTest.cpp
+++ /dev/null
@@ -1,282 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#include "utils/Buffer.h"
-#include "utils/WorkQueue.h"
-
-#include 
-#include 
-#include 
-#include 
-#include 
-#include 
-
-using namespace pzstd;
-
-namespace {
-struct Popper {
-  WorkQueue* queue;
-  int* results;
-  std::mutex* mutex;
-
-  void operator()() {
-    int result;
-    while (queue->pop(result)) {
-      std::lock_guard lock(*mutex);
-      results[result] = result;
-    }
-  }
-};
-}
-
-TEST(WorkQueue, SingleThreaded) {
-  WorkQueue queue;
-  int result;
-
-  queue.push(5);
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(5, result);
-
-  queue.push(1);
-  queue.push(2);
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(1, result);
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(2, result);
-
-  queue.push(1);
-  queue.push(2);
-  queue.finish();
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(1, result);
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(2, result);
-  EXPECT_FALSE(queue.pop(result));
-
-  queue.waitUntilFinished();
-}
-
-TEST(WorkQueue, SPSC) {
-  WorkQueue queue;
-  const int max = 100;
-
-  for (int i = 0; i < 10; ++i) {
-    queue.push(int{i});
-  }
-
-  std::thread thread([ &queue, max ] {
-    int result;
-    for (int i = 0;; ++i) {
-      if (!queue.pop(result)) {
-        EXPECT_EQ(i, max);
-        break;
-      }
-      EXPECT_EQ(i, result);
-    }
-  });
-
-  std::this_thread::yield();
-  for (int i = 10; i < max; ++i) {
-    queue.push(int{i});
-  }
-  queue.finish();
-
-  thread.join();
-}
-
-TEST(WorkQueue, SPMC) {
-  WorkQueue queue;
-  std::vector results(50, -1);
-  std::mutex mutex;
-  std::vector threads;
-  for (int i = 0; i < 5; ++i) {
-    threads.emplace_back(Popper{&queue, results.data(), &mutex});
-  }
-
-  for (int i = 0; i < 50; ++i) {
-    queue.push(int{i});
-  }
-  queue.finish();
-
-  for (auto& thread : threads) {
-    thread.join();
-  }
-
-  for (int i = 0; i < 50; ++i) {
-    EXPECT_EQ(i, results[i]);
-  }
-}
-
-TEST(WorkQueue, MPMC) {
-  WorkQueue queue;
-  std::vector results(100, -1);
-  std::mutex mutex;
-  std::vector popperThreads;
-  for (int i = 0; i < 4; ++i) {
-    popperThreads.emplace_back(Popper{&queue, results.data(), &mutex});
-  }
-
-  std::vector pusherThreads;
-  for (int i = 0; i < 2; ++i) {
-    auto min = i * 50;
-    auto max = (i + 1) * 50;
-    pusherThreads.emplace_back(
-        [ &queue, min, max ] {
-          for (int i = min; i < max; ++i) {
-            queue.push(int{i});
-          }
-        });
-  }
-
-  for (auto& thread : pusherThreads) {
-    thread.join();
-  }
-  queue.finish();
-
-  for (auto& thread : popperThreads) {
-    thread.join();
-  }
-
-  for (int i = 0; i < 100; ++i) {
-    EXPECT_EQ(i, results[i]);
-  }
-}
-
-TEST(WorkQueue, BoundedSizeWorks) {
-  WorkQueue queue(1);
-  int result;
-  queue.push(5);
-  queue.pop(result);
-  queue.push(5);
-  queue.pop(result);
-  queue.push(5);
-  queue.finish();
-  queue.pop(result);
-  EXPECT_EQ(5, result);
-}
-
-TEST(WorkQueue, BoundedSizePushAfterFinish) {
-  WorkQueue queue(1);
-  int result;
-  queue.push(5);
-  std::thread pusher([&queue] {
-    queue.push(6);
-  });
-  // Dirtily try and make sure that pusher has run.
-  std::this_thread::sleep_for(std::chrono::seconds(1));
-  queue.finish();
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(5, result);
-  EXPECT_FALSE(queue.pop(result));
-
-  pusher.join();
-}
-
-TEST(WorkQueue, SetMaxSize) {
-  WorkQueue queue(2);
-  int result;
-  queue.push(5);
-  queue.push(6);
-  queue.setMaxSize(1);
-  std::thread pusher([&queue] {
-    queue.push(7);
-  });
-  // Dirtily try and make sure that pusher has run.
-  std::this_thread::sleep_for(std::chrono::seconds(1));
-  queue.finish();
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(5, result);
-  EXPECT_TRUE(queue.pop(result));
-  EXPECT_EQ(6, result);
-  EXPECT_FALSE(queue.pop(result));
-
-  pusher.join();
-}
-
-TEST(WorkQueue, BoundedSizeMPMC) {
-  WorkQueue queue(10);
-  std::vector results(200, -1);
-  std::mutex mutex;
-  std::cerr << "Creating popperThreads" << std::endl;
-  std::vector popperThreads;
-  for (int i = 0; i < 4; ++i) {
-    popperThreads.emplace_back(Popper{&queue, results.data(), &mutex});
-  }
-
-  std::cerr << "Creating pusherThreads" << std::endl;
-  std::vector pusherThreads;
-  for (int i = 0; i < 2; ++i) {
-    auto min = i * 100;
-    auto max = (i + 1) * 100;
-    pusherThreads.emplace_back(
-        [ &queue, min, max ] {
-          for (int i = min; i < max; ++i) {
-            queue.push(int{i});
-          }
-        });
-  }
-
-  std::cerr << "Joining pusherThreads" << std::endl;
-  for (auto& thread : pusherThreads) {
-    thread.join();
-  }
-  std::cerr << "Finishing queue" << std::endl;
-  queue.finish();
-
-  std::cerr << "Joining popperThreads" << std::endl;
-  for (auto& thread : popperThreads) {
-    thread.join();
-  }
-
-  std::cerr << "Inspecting results" << std::endl;
-  for (int i = 0; i < 200; ++i) {
-    EXPECT_EQ(i, results[i]);
-  }
-}
-
-TEST(WorkQueue, FailedPush) {
-  WorkQueue> queue;
-  std::unique_ptr x(new int{5});
-  EXPECT_TRUE(queue.push(std::move(x)));
-  EXPECT_EQ(nullptr, x);
-  queue.finish();
-  x.reset(new int{6});
-  EXPECT_FALSE(queue.push(std::move(x)));
-  EXPECT_NE(nullptr, x);
-  EXPECT_EQ(6, *x);
-}
-
-TEST(BufferWorkQueue, SizeCalculatedCorrectly) {
-  {
-    BufferWorkQueue queue;
-    queue.finish();
-    EXPECT_EQ(0, queue.size());
-  }
-  {
-    BufferWorkQueue queue;
-    queue.push(Buffer(10));
-    queue.finish();
-    EXPECT_EQ(10, queue.size());
-  }
-  {
-    BufferWorkQueue queue;
-    queue.push(Buffer(10));
-    queue.push(Buffer(5));
-    queue.finish();
-    EXPECT_EQ(15, queue.size());
-  }
-  {
-    BufferWorkQueue queue;
-    queue.push(Buffer(10));
-    queue.push(Buffer(5));
-    queue.finish();
-    Buffer buffer;
-    queue.pop(buffer);
-    EXPECT_EQ(5, queue.size());
-  }
-}
diff --git a/priv/zstd/contrib/seekable_format/examples/.gitignore b/priv/zstd/contrib/seekable_format/examples/.gitignore
deleted file mode 100644
index df2f9ab..0000000
--- a/priv/zstd/contrib/seekable_format/examples/.gitignore
+++ /dev/null
@@ -1,4 +0,0 @@
-seekable_compression
-seekable_decompression
-parallel_processing
-parallel_compression
diff --git a/priv/zstd/contrib/seekable_format/examples/Makefile b/priv/zstd/contrib/seekable_format/examples/Makefile
deleted file mode 100644
index 1847aa7..0000000
--- a/priv/zstd/contrib/seekable_format/examples/Makefile
+++ /dev/null
@@ -1,42 +0,0 @@
-# ################################################################
-# Copyright (c) 2017-present, Facebook, Inc.
-# All rights reserved.
-#
-# This source code is licensed under both the BSD-style license (found in the
-# LICENSE file in the root directory of this source tree) and the GPLv2 (found
-# in the COPYING file in the root directory of this source tree).
-# ################################################################
-
-# This Makefile presumes libzstd is built, using `make` in / or /lib/
-
-LDFLAGS += ../../../lib/libzstd.a
-CPPFLAGS += -I../ -I../../../lib -I../../../lib/common
-
-CFLAGS ?= -O3
-CFLAGS += -g
-
-SEEKABLE_OBJS = ../zstdseek_compress.c ../zstdseek_decompress.c
-
-.PHONY: default all clean test
-
-default: all
-
-all: seekable_compression seekable_decompression parallel_processing
-
-seekable_compression : seekable_compression.c $(SEEKABLE_OBJS)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-seekable_decompression : seekable_decompression.c $(SEEKABLE_OBJS)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-parallel_processing : parallel_processing.c $(SEEKABLE_OBJS)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@ -pthread
-
-parallel_compression : parallel_compression.c $(SEEKABLE_OBJS)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@ -pthread
-
-clean:
-	@rm -f core *.o tmp* result* *.zst \
-		seekable_compression seekable_decompression \
-		parallel_processing parallel_compression
-	@echo Cleaning completed
diff --git a/priv/zstd/contrib/seekable_format/examples/parallel_compression.c b/priv/zstd/contrib/seekable_format/examples/parallel_compression.c
deleted file mode 100644
index 69644d2..0000000
--- a/priv/zstd/contrib/seekable_format/examples/parallel_compression.c
+++ /dev/null
@@ -1,215 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-#include     // malloc, free, exit, atoi
-#include      // fprintf, perror, feof, fopen, etc.
-#include     // strlen, memset, strcat
-#define ZSTD_STATIC_LINKING_ONLY
-#include       // presumes zstd library is installed
-#include 
-#if defined(WIN32) || defined(_WIN32)
-#  include 
-#  define SLEEP(x) Sleep(x)
-#else
-#  include 
-#  define SLEEP(x) usleep(x * 1000)
-#endif
-
-#define XXH_NAMESPACE ZSTD_
-#include "xxhash.h"
-
-#include "pool.h"      // use zstd thread pool for demo
-
-#include "zstd_seekable.h"
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc:");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-static void fseek_orDie(FILE* file, long int offset, int origin)
-{
-    if (!fseek(file, offset, origin)) {
-        if (!fflush(file)) return;
-    }
-    /* error */
-    perror("fseek");
-    exit(7);
-}
-
-static long int ftell_orDie(FILE* file)
-{
-    long int off = ftell(file);
-    if (off != -1) return off;
-    /* error */
-    perror("ftell");
-    exit(8);
-}
-
-struct job {
-    const void* src;
-    size_t srcSize;
-    void* dst;
-    size_t dstSize;
-
-    unsigned checksum;
-
-    int compressionLevel;
-    int done;
-};
-
-static void compressFrame(void* opaque)
-{
-    struct job* job = opaque;
-
-    job->checksum = XXH64(job->src, job->srcSize, 0);
-
-    size_t ret = ZSTD_compress(job->dst, job->dstSize, job->src, job->srcSize, job->compressionLevel);
-    if (ZSTD_isError(ret)) {
-        fprintf(stderr, "ZSTD_compress() error : %s \n", ZSTD_getErrorName(ret));
-        exit(20);
-    }
-
-    job->dstSize = ret;
-    job->done = 1;
-}
-
-static void compressFile_orDie(const char* fname, const char* outName, int cLevel, unsigned frameSize, int nbThreads)
-{
-    POOL_ctx* pool = POOL_create(nbThreads, nbThreads);
-    if (pool == NULL) { fprintf(stderr, "POOL_create() error \n"); exit(9); }
-
-    FILE* const fin  = fopen_orDie(fname, "rb");
-    FILE* const fout = fopen_orDie(outName, "wb");
-
-    if (ZSTD_compressBound(frameSize) > 0xFFFFFFFFU) { fprintf(stderr, "Frame size too large \n"); exit(10); }
-    unsigned dstSize = ZSTD_compressBound(frameSize);
-
-
-    fseek_orDie(fin, 0, SEEK_END);
-    long int length = ftell_orDie(fin);
-    fseek_orDie(fin, 0, SEEK_SET);
-
-    size_t numFrames = (length + frameSize - 1) / frameSize;
-
-    struct job* jobs = malloc_orDie(sizeof(struct job) * numFrames);
-
-    size_t i;
-    for(i = 0; i < numFrames; i++) {
-        void* in = malloc_orDie(frameSize);
-        void* out = malloc_orDie(dstSize);
-
-        size_t inSize = fread_orDie(in, frameSize, fin);
-
-        jobs[i].src = in;
-        jobs[i].srcSize = inSize;
-        jobs[i].dst = out;
-        jobs[i].dstSize = dstSize;
-        jobs[i].compressionLevel = cLevel;
-        jobs[i].done = 0;
-        POOL_add(pool, compressFrame, &jobs[i]);
-    }
-
-    ZSTD_frameLog* fl = ZSTD_seekable_createFrameLog(1);
-    if (fl == NULL) { fprintf(stderr, "ZSTD_seekable_createFrameLog() failed \n"); exit(11); }
-    for (i = 0; i < numFrames; i++) {
-        while (!jobs[i].done) SLEEP(5); /* wake up every 5 milliseconds to check */
-        fwrite_orDie(jobs[i].dst, jobs[i].dstSize, fout);
-        free((void*)jobs[i].src);
-        free(jobs[i].dst);
-
-        size_t ret = ZSTD_seekable_logFrame(fl, jobs[i].dstSize, jobs[i].srcSize, jobs[i].checksum);
-        if (ZSTD_isError(ret)) { fprintf(stderr, "ZSTD_seekable_logFrame() error : %s \n", ZSTD_getErrorName(ret)); }
-    }
-
-    {   unsigned char seekTableBuff[1024];
-        ZSTD_outBuffer out = {seekTableBuff, 1024, 0};
-        while (ZSTD_seekable_writeSeekTable(fl, &out) != 0) {
-            fwrite_orDie(seekTableBuff, out.pos, fout);
-            out.pos = 0;
-        }
-        fwrite_orDie(seekTableBuff, out.pos, fout);
-    }
-
-    ZSTD_seekable_freeFrameLog(fl);
-    free(jobs);
-    fclose_orDie(fout);
-    fclose_orDie(fin);
-}
-
-static const char* createOutFilename_orDie(const char* filename)
-{
-    size_t const inL = strlen(filename);
-    size_t const outL = inL + 5;
-    void* outSpace = malloc_orDie(outL);
-    memset(outSpace, 0, outL);
-    strcat(outSpace, filename);
-    strcat(outSpace, ".zst");
-    return (const char*)outSpace;
-}
-
-int main(int argc, const char** argv) {
-    const char* const exeName = argv[0];
-    if (argc!=4) {
-        printf("wrong arguments\n");
-        printf("usage:\n");
-        printf("%s FILE FRAME_SIZE NB_THREADS\n", exeName);
-        return 1;
-    }
-
-    {   const char* const inFileName = argv[1];
-        unsigned const frameSize = (unsigned)atoi(argv[2]);
-        int const nbThreads = atoi(argv[3]);
-
-        const char* const outFileName = createOutFilename_orDie(inFileName);
-        compressFile_orDie(inFileName, outFileName, 5, frameSize, nbThreads);
-    }
-
-    return 0;
-}
diff --git a/priv/zstd/contrib/seekable_format/examples/parallel_processing.c b/priv/zstd/contrib/seekable_format/examples/parallel_processing.c
deleted file mode 100644
index da34776..0000000
--- a/priv/zstd/contrib/seekable_format/examples/parallel_processing.c
+++ /dev/null
@@ -1,194 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/*
- * A simple demo that sums up all the bytes in the file in parallel using
- * seekable decompression and the zstd thread pool
- */
-
-#include     // malloc, exit
-#include      // fprintf, perror, feof
-#include     // strerror
-#include      // errno
-#define ZSTD_STATIC_LINKING_ONLY
-#include       // presumes zstd library is installed
-#include 
-#if defined(WIN32) || defined(_WIN32)
-#  include 
-#  define SLEEP(x) Sleep(x)
-#else
-#  include 
-#  define SLEEP(x) usleep(x * 1000)
-#endif
-
-#include "pool.h"      // use zstd thread pool for demo
-
-#include "zstd_seekable.h"
-
-#define MIN(a, b) ((a) < (b) ? (a) : (b))
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc");
-    exit(1);
-}
-
-static void* realloc_orDie(void* ptr, size_t size)
-{
-    ptr = realloc(ptr, size);
-    if (ptr) return ptr;
-    /* error */
-    perror("realloc");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-static void fseek_orDie(FILE* file, long int offset, int origin) {
-    if (!fseek(file, offset, origin)) {
-        if (!fflush(file)) return;
-    }
-    /* error */
-    perror("fseek");
-    exit(7);
-}
-
-struct sum_job {
-    const char* fname;
-    unsigned long long sum;
-    unsigned frameNb;
-    int done;
-};
-
-static void sumFrame(void* opaque)
-{
-    struct sum_job* job = (struct sum_job*)opaque;
-    job->done = 0;
-
-    FILE* const fin = fopen_orDie(job->fname, "rb");
-
-    ZSTD_seekable* const seekable = ZSTD_seekable_create();
-    if (seekable==NULL) { fprintf(stderr, "ZSTD_seekable_create() error \n"); exit(10); }
-
-    size_t const initResult = ZSTD_seekable_initFile(seekable, fin);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_seekable_init() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-
-    size_t const frameSize = ZSTD_seekable_getFrameDecompressedSize(seekable, job->frameNb);
-    unsigned char* data = malloc_orDie(frameSize);
-
-    size_t result = ZSTD_seekable_decompressFrame(seekable, data, frameSize, job->frameNb);
-    if (ZSTD_isError(result)) { fprintf(stderr, "ZSTD_seekable_decompressFrame() error : %s \n", ZSTD_getErrorName(result)); exit(12); }
-
-    unsigned long long sum = 0;
-    size_t i;
-    for (i = 0; i < frameSize; i++) {
-        sum += data[i];
-    }
-    job->sum = sum;
-    job->done = 1;
-
-    fclose(fin);
-    ZSTD_seekable_free(seekable);
-    free(data);
-}
-
-static void sumFile_orDie(const char* fname, int nbThreads)
-{
-    POOL_ctx* pool = POOL_create(nbThreads, nbThreads);
-    if (pool == NULL) { fprintf(stderr, "POOL_create() error \n"); exit(9); }
-
-    FILE* const fin = fopen_orDie(fname, "rb");
-
-    ZSTD_seekable* const seekable = ZSTD_seekable_create();
-    if (seekable==NULL) { fprintf(stderr, "ZSTD_seekable_create() error \n"); exit(10); }
-
-    size_t const initResult = ZSTD_seekable_initFile(seekable, fin);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_seekable_init() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-
-    size_t const numFrames = ZSTD_seekable_getNumFrames(seekable);
-    struct sum_job* jobs = (struct sum_job*)malloc(numFrames * sizeof(struct sum_job));
-
-    size_t i;
-    for (i = 0; i < numFrames; i++) {
-        jobs[i] = (struct sum_job){ fname, 0, i, 0 };
-        POOL_add(pool, sumFrame, &jobs[i]);
-    }
-
-    unsigned long long total = 0;
-
-    for (i = 0; i < numFrames; i++) {
-        while (!jobs[i].done) SLEEP(5); /* wake up every 5 milliseconds to check */
-        total += jobs[i].sum;
-    }
-
-    printf("Sum: %llu\n", total);
-
-    POOL_free(pool);
-    ZSTD_seekable_free(seekable);
-    fclose(fin);
-    free(jobs);
-}
-
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc!=3) {
-        fprintf(stderr, "wrong arguments\n");
-        fprintf(stderr, "usage:\n");
-        fprintf(stderr, "%s FILE NB_THREADS\n", exeName);
-        return 1;
-    }
-
-    {
-        const char* const inFilename = argv[1];
-        int const nbThreads = atoi(argv[2]);
-        sumFile_orDie(inFilename, nbThreads);
-    }
-
-    return 0;
-}
diff --git a/priv/zstd/contrib/seekable_format/examples/seekable_compression.c b/priv/zstd/contrib/seekable_format/examples/seekable_compression.c
deleted file mode 100644
index 9485bf2..0000000
--- a/priv/zstd/contrib/seekable_format/examples/seekable_compression.c
+++ /dev/null
@@ -1,132 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-#include     // malloc, free, exit, atoi
-#include      // fprintf, perror, feof, fopen, etc.
-#include     // strlen, memset, strcat
-#define ZSTD_STATIC_LINKING_ONLY
-#include       // presumes zstd library is installed
-
-#include "zstd_seekable.h"
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc:");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-static void compressFile_orDie(const char* fname, const char* outName, int cLevel, unsigned frameSize)
-{
-    FILE* const fin  = fopen_orDie(fname, "rb");
-    FILE* const fout = fopen_orDie(outName, "wb");
-    size_t const buffInSize = ZSTD_CStreamInSize();    /* can always read one full block */
-    void*  const buffIn  = malloc_orDie(buffInSize);
-    size_t const buffOutSize = ZSTD_CStreamOutSize();  /* can always flush a full block */
-    void*  const buffOut = malloc_orDie(buffOutSize);
-
-    ZSTD_seekable_CStream* const cstream = ZSTD_seekable_createCStream();
-    if (cstream==NULL) { fprintf(stderr, "ZSTD_seekable_createCStream() error \n"); exit(10); }
-    size_t const initResult = ZSTD_seekable_initCStream(cstream, cLevel, 1, frameSize);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_seekable_initCStream() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-
-    size_t read, toRead = buffInSize;
-    while( (read = fread_orDie(buffIn, toRead, fin)) ) {
-        ZSTD_inBuffer input = { buffIn, read, 0 };
-        while (input.pos < input.size) {
-            ZSTD_outBuffer output = { buffOut, buffOutSize, 0 };
-            toRead = ZSTD_seekable_compressStream(cstream, &output , &input);   /* toRead is guaranteed to be <= ZSTD_CStreamInSize() */
-            if (ZSTD_isError(toRead)) { fprintf(stderr, "ZSTD_seekable_compressStream() error : %s \n", ZSTD_getErrorName(toRead)); exit(12); }
-            if (toRead > buffInSize) toRead = buffInSize;   /* Safely handle case when `buffInSize` is manually changed to a value < ZSTD_CStreamInSize()*/
-            fwrite_orDie(buffOut, output.pos, fout);
-        }
-    }
-
-    while (1) {
-        ZSTD_outBuffer output = { buffOut, buffOutSize, 0 };
-        size_t const remainingToFlush = ZSTD_seekable_endStream(cstream, &output);   /* close stream */
-        if (ZSTD_isError(remainingToFlush)) { fprintf(stderr, "ZSTD_seekable_endStream() error : %s \n", ZSTD_getErrorName(remainingToFlush)); exit(13); }
-        fwrite_orDie(buffOut, output.pos, fout);
-        if (!remainingToFlush) break;
-    }
-
-    ZSTD_seekable_freeCStream(cstream);
-    fclose_orDie(fout);
-    fclose_orDie(fin);
-    free(buffIn);
-    free(buffOut);
-}
-
-static const char* createOutFilename_orDie(const char* filename)
-{
-    size_t const inL = strlen(filename);
-    size_t const outL = inL + 5;
-    void* outSpace = malloc_orDie(outL);
-    memset(outSpace, 0, outL);
-    strcat(outSpace, filename);
-    strcat(outSpace, ".zst");
-    return (const char*)outSpace;
-}
-
-int main(int argc, const char** argv) {
-    const char* const exeName = argv[0];
-    if (argc!=3) {
-        printf("wrong arguments\n");
-        printf("usage:\n");
-        printf("%s FILE FRAME_SIZE\n", exeName);
-        return 1;
-    }
-
-    {   const char* const inFileName = argv[1];
-        unsigned const frameSize = (unsigned)atoi(argv[2]);
-
-        const char* const outFileName = createOutFilename_orDie(inFileName);
-        compressFile_orDie(inFileName, outFileName, 5, frameSize);
-    }
-
-    return 0;
-}
diff --git a/priv/zstd/contrib/seekable_format/examples/seekable_decompression.c b/priv/zstd/contrib/seekable_format/examples/seekable_decompression.c
deleted file mode 100644
index 9cd2329..0000000
--- a/priv/zstd/contrib/seekable_format/examples/seekable_decompression.c
+++ /dev/null
@@ -1,138 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-
-#include     // malloc, exit
-#include      // fprintf, perror, feof
-#include     // strerror
-#include      // errno
-#define ZSTD_STATIC_LINKING_ONLY
-#include       // presumes zstd library is installed
-#include 
-
-#include "zstd_seekable.h"
-
-#define MIN(a, b) ((a) < (b) ? (a) : (b))
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc");
-    exit(1);
-}
-
-static void* realloc_orDie(void* ptr, size_t size)
-{
-    ptr = realloc(ptr, size);
-    if (ptr) return ptr;
-    /* error */
-    perror("realloc");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-static void fseek_orDie(FILE* file, long int offset, int origin) {
-    if (!fseek(file, offset, origin)) {
-        if (!fflush(file)) return;
-    }
-    /* error */
-    perror("fseek");
-    exit(7);
-}
-
-
-static void decompressFile_orDie(const char* fname, unsigned startOffset, unsigned endOffset)
-{
-    FILE* const fin  = fopen_orDie(fname, "rb");
-    FILE* const fout = stdout;
-    size_t const buffOutSize = ZSTD_DStreamOutSize();  /* Guarantee to successfully flush at least one complete compressed block in all circumstances. */
-    void*  const buffOut = malloc_orDie(buffOutSize);
-
-    ZSTD_seekable* const seekable = ZSTD_seekable_create();
-    if (seekable==NULL) { fprintf(stderr, "ZSTD_seekable_create() error \n"); exit(10); }
-
-    size_t const initResult = ZSTD_seekable_initFile(seekable, fin);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_seekable_init() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-
-    while (startOffset < endOffset) {
-        size_t const result = ZSTD_seekable_decompress(seekable, buffOut, MIN(endOffset - startOffset, buffOutSize), startOffset);
-
-        if (ZSTD_isError(result)) {
-            fprintf(stderr, "ZSTD_seekable_decompress() error : %s \n",
-                    ZSTD_getErrorName(result));
-            exit(12);
-        }
-        fwrite_orDie(buffOut, result, fout);
-        startOffset += result;
-    }
-
-    ZSTD_seekable_free(seekable);
-    fclose_orDie(fin);
-    fclose_orDie(fout);
-    free(buffOut);
-}
-
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc!=4) {
-        fprintf(stderr, "wrong arguments\n");
-        fprintf(stderr, "usage:\n");
-        fprintf(stderr, "%s FILE START END\n", exeName);
-        return 1;
-    }
-
-    {
-        const char* const inFilename = argv[1];
-        unsigned const startOffset = (unsigned) atoi(argv[2]);
-        unsigned const endOffset = (unsigned) atoi(argv[3]);
-        decompressFile_orDie(inFilename, startOffset, endOffset);
-    }
-
-    return 0;
-}
diff --git a/priv/zstd/contrib/seekable_format/zstd_seekable.h b/priv/zstd/contrib/seekable_format/zstd_seekable.h
deleted file mode 100644
index 438ac20..0000000
--- a/priv/zstd/contrib/seekable_format/zstd_seekable.h
+++ /dev/null
@@ -1,184 +0,0 @@
-#ifndef SEEKABLE_H
-#define SEEKABLE_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#include 
-
-static const unsigned ZSTD_seekTableFooterSize = 9;
-
-#define ZSTD_SEEKABLE_MAGICNUMBER 0x8F92EAB1
-
-#define ZSTD_SEEKABLE_MAXFRAMES 0x8000000U
-
-/* Limit the maximum size to avoid any potential issues storing the compressed size */
-#define ZSTD_SEEKABLE_MAX_FRAME_DECOMPRESSED_SIZE 0x80000000U
-
-/*-****************************************************************************
-*  Seekable Format
-*
-*  The seekable format splits the compressed data into a series of "frames",
-*  each compressed individually so that decompression of a section in the
-*  middle of an archive only requires zstd to decompress at most a frame's
-*  worth of extra data, instead of the entire archive.
-******************************************************************************/
-
-typedef struct ZSTD_seekable_CStream_s ZSTD_seekable_CStream;
-typedef struct ZSTD_seekable_s ZSTD_seekable;
-
-/*-****************************************************************************
-*  Seekable compression - HowTo
-*  A ZSTD_seekable_CStream object is required to tracking streaming operation.
-*  Use ZSTD_seekable_createCStream() and ZSTD_seekable_freeCStream() to create/
-*  release resources.
-*
-*  Streaming objects are reusable to avoid allocation and deallocation,
-*  to start a new compression operation call ZSTD_seekable_initCStream() on the
-*  compressor.
-*
-*  Data streamed to the seekable compressor will automatically be split into
-*  frames of size `maxFrameSize` (provided in ZSTD_seekable_initCStream()),
-*  or if none is provided, will be cut off whenever ZSTD_seekable_endFrame() is
-*  called or when the default maximum frame size (2GB) is reached.
-*
-*  Use ZSTD_seekable_initCStream() to initialize a ZSTD_seekable_CStream object
-*  for a new compression operation.
-*  `maxFrameSize` indicates the size at which to automatically start a new
-*  seekable frame.  `maxFrameSize == 0` implies the default maximum size.
-*  `checksumFlag` indicates whether or not the seek table should include frame
-*  checksums on the uncompressed data for verification.
-*  @return : a size hint for input to provide for compression, or an error code
-*            checkable with ZSTD_isError()
-*
-*  Use ZSTD_seekable_compressStream() repetitively to consume input stream.
-*  The function will automatically update both `pos` fields.
-*  Note that it may not consume the entire input, in which case `pos < size`,
-*  and it's up to the caller to present again remaining data.
-*  @return : a size hint, preferred nb of bytes to use as input for next
-*            function call or an error code, which can be tested using
-*            ZSTD_isError().
-*            Note 1 : it's just a hint, to help latency a little, any other
-*                     value will work fine.
-*
-*  At any time, call ZSTD_seekable_endFrame() to end the current frame and
-*  start a new one.
-*
-*  ZSTD_seekable_endStream() will end the current frame, and then write the seek
-*  table so that decompressors can efficiently find compressed frames.
-*  ZSTD_seekable_endStream() may return a number > 0 if it was unable to flush
-*  all the necessary data to `output`.  In this case, it should be called again
-*  until all remaining data is flushed out and 0 is returned.
-******************************************************************************/
-
-/*===== Seekable compressor management =====*/
-ZSTDLIB_API ZSTD_seekable_CStream* ZSTD_seekable_createCStream(void);
-ZSTDLIB_API size_t ZSTD_seekable_freeCStream(ZSTD_seekable_CStream* zcs);
-
-/*===== Seekable compression functions =====*/
-ZSTDLIB_API size_t ZSTD_seekable_initCStream(ZSTD_seekable_CStream* zcs, int compressionLevel, int checksumFlag, unsigned maxFrameSize);
-ZSTDLIB_API size_t ZSTD_seekable_compressStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
-ZSTDLIB_API size_t ZSTD_seekable_endFrame(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output);
-ZSTDLIB_API size_t ZSTD_seekable_endStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output);
-
-/*= Raw seek table API
- *  These functions allow for the seek table to be constructed directly.
- *  This table can then be appended to a file of concatenated frames.
- *  This allows the frames to be compressed independently, even in parallel,
- *  and compiled together afterward into a seekable archive.
- *
- *  Use ZSTD_seekable_createFrameLog() to allocate and initialize a tracking
- *  structure.
- *
- *  Call ZSTD_seekable_logFrame() once for each frame in the archive.
- *  checksum is optional, and will not be used if checksumFlag was 0 when the
- *  frame log was created.  If present, it should be the least significant 32
- *  bits of the XXH64 hash of the uncompressed data.
- *
- *  Call ZSTD_seekable_writeSeekTable to serialize the data into a seek table.
- *  If the entire table was written, the return value will be 0.  Otherwise,
- *  it will be equal to the number of bytes left to write. */
-typedef struct ZSTD_frameLog_s ZSTD_frameLog;
-ZSTDLIB_API ZSTD_frameLog* ZSTD_seekable_createFrameLog(int checksumFlag);
-ZSTDLIB_API size_t ZSTD_seekable_freeFrameLog(ZSTD_frameLog* fl);
-ZSTDLIB_API size_t ZSTD_seekable_logFrame(ZSTD_frameLog* fl, unsigned compressedSize, unsigned decompressedSize, unsigned checksum);
-ZSTDLIB_API size_t ZSTD_seekable_writeSeekTable(ZSTD_frameLog* fl, ZSTD_outBuffer* output);
-
-/*-****************************************************************************
-*  Seekable decompression - HowTo
-*  A ZSTD_seekable object is required to tracking the seekTable.
-*
-*  Call ZSTD_seekable_init* to initialize a ZSTD_seekable object with the
-*  the seek table provided in the input.
-*  There are three modes for ZSTD_seekable_init:
-*    - ZSTD_seekable_initBuff() : An in-memory API.  The data contained in
-*      `src` should be the entire seekable file, including the seek table.
-*      `src` should be kept alive and unmodified until the ZSTD_seekable object
-*      is freed or reset.
-*    - ZSTD_seekable_initFile() : A simplified file API using stdio.  fread and
-*      fseek will be used to access the required data for building the seek
-*      table and doing decompression operations.  `src` should not be closed
-*      or modified until the ZSTD_seekable object is freed or reset.
-*    - ZSTD_seekable_initAdvanced() : A general API allowing the client to
-*      provide its own read and seek callbacks.
-*        + ZSTD_seekable_read() : read exactly `n` bytes into `buffer`.
-*                                 Premature EOF should be treated as an error.
-*        + ZSTD_seekable_seek() : seek the read head to `offset` from `origin`,
-*                                 where origin is either SEEK_SET (beginning of
-*                                 file), or SEEK_END (end of file).
-*  Both functions should return a non-negative value in case of success, and a
-*  negative value in case of failure.  If implementing using this API and
-*  stdio, be careful with files larger than 4GB and fseek.  All of these
-*  functions return an error code checkable with ZSTD_isError().
-*
-*  Call ZSTD_seekable_decompress to decompress `dstSize` bytes at decompressed
-*  offset `offset`.  ZSTD_seekable_decompress may have to decompress the entire
-*  prefix of the frame before the desired data if it has not already processed
-*  this section. If ZSTD_seekable_decompress is called multiple times for a
-*  consecutive range of data, it will efficiently retain the decompressor object
-*  and avoid redecompressing frame prefixes.  The return value is the number of
-*  bytes decompressed, or an error code checkable with ZSTD_isError().
-*
-*  The seek table access functions can be used to obtain the data contained
-*  in the seek table.  If frameIndex is larger than the value returned by
-*  ZSTD_seekable_getNumFrames(), they will return error codes checkable with
-*  ZSTD_isError().  Note that since the offset access functions return
-*  unsigned long long instead of size_t, in this case they will instead return
-*  the value ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE.
-******************************************************************************/
-
-/*===== Seekable decompressor management =====*/
-ZSTDLIB_API ZSTD_seekable* ZSTD_seekable_create(void);
-ZSTDLIB_API size_t ZSTD_seekable_free(ZSTD_seekable* zs);
-
-/*===== Seekable decompression functions =====*/
-ZSTDLIB_API size_t ZSTD_seekable_initBuff(ZSTD_seekable* zs, const void* src, size_t srcSize);
-ZSTDLIB_API size_t ZSTD_seekable_initFile(ZSTD_seekable* zs, FILE* src);
-ZSTDLIB_API size_t ZSTD_seekable_decompress(ZSTD_seekable* zs, void* dst, size_t dstSize, unsigned long long offset);
-ZSTDLIB_API size_t ZSTD_seekable_decompressFrame(ZSTD_seekable* zs, void* dst, size_t dstSize, unsigned frameIndex);
-
-#define ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE (0ULL-2)
-/*===== Seek Table access functions =====*/
-ZSTDLIB_API unsigned ZSTD_seekable_getNumFrames(ZSTD_seekable* const zs);
-ZSTDLIB_API unsigned long long ZSTD_seekable_getFrameCompressedOffset(ZSTD_seekable* const zs, unsigned frameIndex);
-ZSTDLIB_API unsigned long long ZSTD_seekable_getFrameDecompressedOffset(ZSTD_seekable* const zs, unsigned frameIndex);
-ZSTDLIB_API size_t ZSTD_seekable_getFrameCompressedSize(ZSTD_seekable* const zs, unsigned frameIndex);
-ZSTDLIB_API size_t ZSTD_seekable_getFrameDecompressedSize(ZSTD_seekable* const zs, unsigned frameIndex);
-ZSTDLIB_API unsigned ZSTD_seekable_offsetToFrameIndex(ZSTD_seekable* const zs, unsigned long long offset);
-
-/*===== Seekable advanced I/O API =====*/
-typedef int(ZSTD_seekable_read)(void* opaque, void* buffer, size_t n);
-typedef int(ZSTD_seekable_seek)(void* opaque, long long offset, int origin);
-typedef struct {
-    void* opaque;
-    ZSTD_seekable_read* read;
-    ZSTD_seekable_seek* seek;
-} ZSTD_seekable_customFile;
-ZSTDLIB_API size_t ZSTD_seekable_initAdvanced(ZSTD_seekable* zs, ZSTD_seekable_customFile src);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif
diff --git a/priv/zstd/contrib/seekable_format/zstd_seekable_compression_format.md b/priv/zstd/contrib/seekable_format/zstd_seekable_compression_format.md
deleted file mode 100644
index bf3080f..0000000
--- a/priv/zstd/contrib/seekable_format/zstd_seekable_compression_format.md
+++ /dev/null
@@ -1,116 +0,0 @@
-# Zstandard Seekable Format
-
-### Notices
-
-Copyright (c) 2017-present Facebook, Inc.
-
-Permission is granted to copy and distribute this document
-for any purpose and without charge,
-including translations into other languages
-and incorporation into compilations,
-provided that the copyright notice and this notice are preserved,
-and that any substantive changes or deletions from the original
-are clearly marked.
-Distribution of this document is unlimited.
-
-### Version
-0.1.0 (11/04/17)
-
-## Introduction
-This document defines a format for compressed data to be stored so that subranges of the data can be efficiently decompressed without requiring the entire document to be decompressed.
-This is done by splitting up the input data into frames,
-each of which are compressed independently,
-and so can be decompressed independently.
-Decompression then takes advantage of a provided 'seek table', which allows the decompressor to immediately jump to the desired data.  This is done in a way that is compatible with the original Zstandard format by placing the seek table in a Zstandard skippable frame.
-
-### Overall conventions
-In this document:
-- square brackets i.e. `[` and `]` are used to indicate optional fields or parameters.
-- the naming convention for identifiers is `Mixed_Case_With_Underscores`
-- All numeric fields are little-endian unless specified otherwise
-
-## Format
-
-The format consists of a number of frames (Zstandard compressed frames and skippable frames), followed by a final skippable frame at the end containing the seek table.
-
-### Seek Table Format
-The structure of the seek table frame is as follows:
-
-|`Skippable_Magic_Number`|`Frame_Size`|`[Seek_Table_Entries]`|`Seek_Table_Footer`|
-|------------------------|------------|----------------------|-------------------|
-| 4 bytes                | 4 bytes    | 8-12 bytes each      | 9 bytes           |
-
-__`Skippable_Magic_Number`__
-
-Value : 0x184D2A5E.
-This is for compatibility with [Zstandard skippable frames].
-Since it is legal for other Zstandard skippable frames to use the same
-magic number, it is not recommended for a decoder to recognize frames
-solely on this.
-
-__`Frame_Size`__
-
-The total size of the skippable frame, not including the `Skippable_Magic_Number` or `Frame_Size`.
-This is for compatibility with [Zstandard skippable frames].
-
-[Zstandard skippable frames]: https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#skippable-frames
-
-#### `Seek_Table_Footer`
-The seek table footer format is as follows:
-
-|`Number_Of_Frames`|`Seek_Table_Descriptor`|`Seekable_Magic_Number`|
-|------------------|-----------------------|-----------------------|
-| 4 bytes          | 1 byte                | 4 bytes               |
-
-__`Seekable_Magic_Number`__
-
-Value : 0x8F92EAB1.
-This value must be the last bytes present in the compressed file so that decoders
-can efficiently find it and determine if there is an actual seek table present.
-
-__`Number_Of_Frames`__
-
-The number of stored frames in the data.
-
-__`Seek_Table_Descriptor`__
-
-A bitfield describing the format of the seek table.
-
-| Bit number | Field name                |
-| ---------- | ----------                |
-| 7          | `Checksum_Flag`           |
-| 6-2        | `Reserved_Bits`           |
-| 1-0        | `Unused_Bits`             |
-
-While only `Checksum_Flag` currently exists, there are 7 other bits in this field that can be used for future changes to the format,
-for example the addition of inline dictionaries.
-
-__`Checksum_Flag`__
-
-If the checksum flag is set, each of the seek table entries contains a 4 byte checksum of the uncompressed data contained in its frame.
-
-`Reserved_Bits` are not currently used but may be used in the future for breaking changes, so a compliant decoder should ensure they are set to 0.  `Unused_Bits` may be used in the future for non-breaking changes, so a compliant decoder should not interpret these bits.
-
-#### __`Seek_Table_Entries`__
-
-`Seek_Table_Entries` consists of `Number_Of_Frames` (one for each frame in the data, not including the seek table frame) entries of the following form, in sequence:
-
-|`Compressed_Size`|`Decompressed_Size`|`[Checksum]`|
-|-----------------|-------------------|------------|
-| 4 bytes         | 4 bytes           | 4 bytes    |
-
-__`Compressed_Size`__
-
-The compressed size of the frame.
-The cumulative sum of the `Compressed_Size` fields of frames `0` to `i` gives the offset in the compressed file of frame `i+1`.
-
-__`Decompressed_Size`__
-
-The size of the decompressed data contained in the frame.  For skippable or otherwise empty frames, this value is 0.
-
-__`Checksum`__
-
-Only present if `Checksum_Flag` is set in the `Seek_Table_Descriptor`.  Value : the least significant 32 bits of the XXH64 digest of the uncompressed data, stored in little-endian format.
-
-## Version Changes
-- 0.1.0: initial version
diff --git a/priv/zstd/contrib/seekable_format/zstdseek_compress.c b/priv/zstd/contrib/seekable_format/zstdseek_compress.c
deleted file mode 100644
index df20749..0000000
--- a/priv/zstd/contrib/seekable_format/zstdseek_compress.c
+++ /dev/null
@@ -1,366 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-#include      /* malloc, free */
-
-#define XXH_STATIC_LINKING_ONLY
-#define XXH_NAMESPACE ZSTD_
-#include "xxhash.h"
-
-#define ZSTD_STATIC_LINKING_ONLY
-#include "zstd.h"
-#include "zstd_errors.h"
-#include "mem.h"
-#include "zstd_seekable.h"
-
-#define CHECK_Z(f) { size_t const ret = (f); if (ret != 0) return ret; }
-
-#undef ERROR
-#define ERROR(name) ((size_t)-ZSTD_error_##name)
-
-#undef MIN
-#undef MAX
-#define MIN(a, b) ((a) < (b) ? (a) : (b))
-#define MAX(a, b) ((a) > (b) ? (a) : (b))
-
-typedef struct {
-    U32 cSize;
-    U32 dSize;
-    U32 checksum;
-} framelogEntry_t;
-
-struct ZSTD_frameLog_s {
-    framelogEntry_t* entries;
-    U32 size;
-    U32 capacity;
-
-    int checksumFlag;
-
-    /* for use when streaming out the seek table */
-    U32 seekTablePos;
-    U32 seekTableIndex;
-} framelog_t;
-
-struct ZSTD_seekable_CStream_s {
-    ZSTD_CStream* cstream;
-    ZSTD_frameLog framelog;
-
-    U32 frameCSize;
-    U32 frameDSize;
-
-    XXH64_state_t xxhState;
-
-    U32 maxFrameSize;
-
-    int writingSeekTable;
-};
-
-size_t ZSTD_seekable_frameLog_allocVec(ZSTD_frameLog* fl)
-{
-    /* allocate some initial space */
-    size_t const FRAMELOG_STARTING_CAPACITY = 16;
-    fl->entries = (framelogEntry_t*)malloc(
-            sizeof(framelogEntry_t) * FRAMELOG_STARTING_CAPACITY);
-    if (fl->entries == NULL) return ERROR(memory_allocation);
-    fl->capacity = FRAMELOG_STARTING_CAPACITY;
-
-    return 0;
-}
-
-size_t ZSTD_seekable_frameLog_freeVec(ZSTD_frameLog* fl)
-{
-    if (fl != NULL) free(fl->entries);
-    return 0;
-}
-
-ZSTD_frameLog* ZSTD_seekable_createFrameLog(int checksumFlag)
-{
-    ZSTD_frameLog* fl = malloc(sizeof(ZSTD_frameLog));
-    if (fl == NULL) return NULL;
-
-    if (ZSTD_isError(ZSTD_seekable_frameLog_allocVec(fl))) {
-        free(fl);
-        return NULL;
-    }
-
-    fl->checksumFlag = checksumFlag;
-    fl->seekTablePos = 0;
-    fl->seekTableIndex = 0;
-    fl->size = 0;
-
-    return fl;
-}
-
-size_t ZSTD_seekable_freeFrameLog(ZSTD_frameLog* fl)
-{
-    ZSTD_seekable_frameLog_freeVec(fl);
-    free(fl);
-    return 0;
-}
-
-ZSTD_seekable_CStream* ZSTD_seekable_createCStream()
-{
-    ZSTD_seekable_CStream* zcs = malloc(sizeof(ZSTD_seekable_CStream));
-
-    if (zcs == NULL) return NULL;
-
-    memset(zcs, 0, sizeof(*zcs));
-
-    zcs->cstream = ZSTD_createCStream();
-    if (zcs->cstream == NULL) goto failed1;
-
-    if (ZSTD_isError(ZSTD_seekable_frameLog_allocVec(&zcs->framelog))) goto failed2;
-
-    return zcs;
-
-failed2:
-    ZSTD_freeCStream(zcs->cstream);
-failed1:
-    free(zcs);
-    return NULL;
-}
-
-size_t ZSTD_seekable_freeCStream(ZSTD_seekable_CStream* zcs)
-{
-    if (zcs == NULL) return 0; /* support free on null */
-    ZSTD_freeCStream(zcs->cstream);
-    ZSTD_seekable_frameLog_freeVec(&zcs->framelog);
-    free(zcs);
-
-    return 0;
-}
-
-size_t ZSTD_seekable_initCStream(ZSTD_seekable_CStream* zcs,
-                                 int compressionLevel,
-                                 int checksumFlag,
-                                 U32 maxFrameSize)
-{
-    zcs->framelog.size = 0;
-    zcs->frameCSize = 0;
-    zcs->frameDSize = 0;
-
-    /* make sure maxFrameSize has a reasonable value */
-    if (maxFrameSize > ZSTD_SEEKABLE_MAX_FRAME_DECOMPRESSED_SIZE) {
-        return ERROR(compressionParameter_unsupported);
-    }
-
-    zcs->maxFrameSize = maxFrameSize
-                                ? maxFrameSize
-                                : ZSTD_SEEKABLE_MAX_FRAME_DECOMPRESSED_SIZE;
-
-    zcs->framelog.checksumFlag = checksumFlag;
-    if (zcs->framelog.checksumFlag) {
-        XXH64_reset(&zcs->xxhState, 0);
-    }
-
-    zcs->framelog.seekTablePos = 0;
-    zcs->framelog.seekTableIndex = 0;
-    zcs->writingSeekTable = 0;
-
-    return ZSTD_initCStream(zcs->cstream, compressionLevel);
-}
-
-size_t ZSTD_seekable_logFrame(ZSTD_frameLog* fl,
-                                     unsigned compressedSize,
-                                     unsigned decompressedSize,
-                                     unsigned checksum)
-{
-    if (fl->size == ZSTD_SEEKABLE_MAXFRAMES)
-        return ERROR(frameIndex_tooLarge);
-
-    /* grow the buffer if required */
-    if (fl->size == fl->capacity) {
-        /* exponential size increase for constant amortized runtime */
-        size_t const newCapacity = fl->capacity * 2;
-        framelogEntry_t* const newEntries = realloc(fl->entries,
-                sizeof(framelogEntry_t) * newCapacity);
-
-        if (newEntries == NULL) return ERROR(memory_allocation);
-
-        fl->entries = newEntries;
-        fl->capacity = newCapacity;
-    }
-
-    fl->entries[fl->size] = (framelogEntry_t){
-            compressedSize, decompressedSize, checksum
-    };
-    fl->size++;
-
-    return 0;
-}
-
-size_t ZSTD_seekable_endFrame(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output)
-{
-    size_t const prevOutPos = output->pos;
-    /* end the frame */
-    size_t ret = ZSTD_endStream(zcs->cstream, output);
-
-    zcs->frameCSize += output->pos - prevOutPos;
-
-    /* need to flush before doing the rest */
-    if (ret) return ret;
-
-    /* frame done */
-
-    /* store the frame data for later */
-    ret = ZSTD_seekable_logFrame(
-            &zcs->framelog, zcs->frameCSize, zcs->frameDSize,
-            zcs->framelog.checksumFlag
-                    ? XXH64_digest(&zcs->xxhState) & 0xFFFFFFFFU
-                    : 0);
-    if (ret) return ret;
-
-    /* reset for the next frame */
-    zcs->frameCSize = 0;
-    zcs->frameDSize = 0;
-
-    ZSTD_resetCStream(zcs->cstream, 0);
-    if (zcs->framelog.checksumFlag)
-        XXH64_reset(&zcs->xxhState, 0);
-
-    return 0;
-}
-
-size_t ZSTD_seekable_compressStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
-{
-    const BYTE* const inBase = (const BYTE*) input->src + input->pos;
-    size_t inLen = input->size - input->pos;
-
-    inLen = MIN(inLen, (size_t)(zcs->maxFrameSize - zcs->frameDSize));
-
-    /* if we haven't finished flushing the last frame, don't start writing a new one */
-    if (inLen > 0) {
-        ZSTD_inBuffer inTmp = { inBase, inLen, 0 };
-        size_t const prevOutPos = output->pos;
-
-        size_t const ret = ZSTD_compressStream(zcs->cstream, output, &inTmp);
-
-        if (zcs->framelog.checksumFlag) {
-            XXH64_update(&zcs->xxhState, inBase, inTmp.pos);
-        }
-
-        zcs->frameCSize += output->pos - prevOutPos;
-        zcs->frameDSize += inTmp.pos;
-
-        input->pos += inTmp.pos;
-
-        if (ZSTD_isError(ret)) return ret;
-    }
-
-    if (zcs->maxFrameSize == zcs->frameDSize) {
-        /* log the frame and start over */
-        size_t const ret = ZSTD_seekable_endFrame(zcs, output);
-        if (ZSTD_isError(ret)) return ret;
-
-        /* get the client ready for the next frame */
-        return (size_t)zcs->maxFrameSize;
-    }
-
-    return (size_t)(zcs->maxFrameSize - zcs->frameDSize);
-}
-
-static inline size_t ZSTD_seekable_seekTableSize(const ZSTD_frameLog* fl)
-{
-    size_t const sizePerFrame = 8 + (fl->checksumFlag?4:0);
-    size_t const seekTableLen = ZSTD_skippableHeaderSize +
-                                sizePerFrame * fl->size +
-                                ZSTD_seekTableFooterSize;
-
-    return seekTableLen;
-}
-
-static inline size_t ZSTD_stwrite32(ZSTD_frameLog* fl,
-                                    ZSTD_outBuffer* output, U32 const value,
-                                    U32 const offset)
-{
-    if (fl->seekTablePos < offset + 4) {
-        BYTE tmp[4]; /* so that we can work with buffers too small to write a whole word to */
-        size_t const lenWrite =
-                MIN(output->size - output->pos, offset + 4 - fl->seekTablePos);
-        MEM_writeLE32(tmp, value);
-        memcpy((BYTE*)output->dst + output->pos,
-               tmp + (fl->seekTablePos - offset), lenWrite);
-        output->pos += lenWrite;
-        fl->seekTablePos += lenWrite;
-
-        if (lenWrite < 4) return ZSTD_seekable_seekTableSize(fl) - fl->seekTablePos;
-    }
-    return 0;
-}
-
-size_t ZSTD_seekable_writeSeekTable(ZSTD_frameLog* fl, ZSTD_outBuffer* output)
-{
-    /* seekTableIndex: the current index in the table and
-     * seekTableSize: the amount of the table written so far
-     *
-     * This function is written this way so that if it has to return early
-     * because of a small buffer, it can keep going where it left off.
-     */
-
-    size_t const sizePerFrame = 8 + (fl->checksumFlag?4:0);
-    size_t const seekTableLen = ZSTD_seekable_seekTableSize(fl);
-
-    CHECK_Z(ZSTD_stwrite32(fl, output, ZSTD_MAGIC_SKIPPABLE_START | 0xE, 0));
-    CHECK_Z(ZSTD_stwrite32(fl, output, seekTableLen - ZSTD_skippableHeaderSize,
-                           4));
-
-    while (fl->seekTableIndex < fl->size) {
-        CHECK_Z(ZSTD_stwrite32(fl, output,
-                               fl->entries[fl->seekTableIndex].cSize,
-                               ZSTD_skippableHeaderSize +
-                                       sizePerFrame * fl->seekTableIndex + 0));
-
-        CHECK_Z(ZSTD_stwrite32(fl, output,
-                               fl->entries[fl->seekTableIndex].dSize,
-                               ZSTD_skippableHeaderSize +
-                                       sizePerFrame * fl->seekTableIndex + 4));
-
-        if (fl->checksumFlag) {
-            CHECK_Z(ZSTD_stwrite32(
-                    fl, output, fl->entries[fl->seekTableIndex].checksum,
-                    ZSTD_skippableHeaderSize +
-                            sizePerFrame * fl->seekTableIndex + 8));
-        }
-
-        fl->seekTableIndex++;
-    }
-
-    CHECK_Z(ZSTD_stwrite32(fl, output, fl->size,
-                           seekTableLen - ZSTD_seekTableFooterSize));
-
-    if (output->size - output->pos < 1) return seekTableLen - fl->seekTablePos;
-    if (fl->seekTablePos < seekTableLen - 4) {
-        BYTE sfd = 0;
-        sfd |= (fl->checksumFlag) << 7;
-
-        ((BYTE*)output->dst)[output->pos] = sfd;
-        output->pos++;
-        fl->seekTablePos++;
-    }
-
-    CHECK_Z(ZSTD_stwrite32(fl, output, ZSTD_SEEKABLE_MAGICNUMBER,
-                           seekTableLen - 4));
-
-    if (fl->seekTablePos != seekTableLen) return ERROR(GENERIC);
-    return 0;
-}
-
-size_t ZSTD_seekable_endStream(ZSTD_seekable_CStream* zcs, ZSTD_outBuffer* output)
-{
-    if (!zcs->writingSeekTable && zcs->frameDSize) {
-        const size_t endFrame = ZSTD_seekable_endFrame(zcs, output);
-        if (ZSTD_isError(endFrame)) return endFrame;
-        /* return an accurate size hint */
-        if (endFrame) return endFrame + ZSTD_seekable_seekTableSize(&zcs->framelog);
-    }
-
-    zcs->writingSeekTable = 1;
-
-    return ZSTD_seekable_writeSeekTable(&zcs->framelog, output);
-}
diff --git a/priv/zstd/contrib/seekable_format/zstdseek_decompress.c b/priv/zstd/contrib/seekable_format/zstdseek_decompress.c
deleted file mode 100644
index d740e16..0000000
--- a/priv/zstd/contrib/seekable_format/zstdseek_decompress.c
+++ /dev/null
@@ -1,462 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/* *********************************************************
-*  Turn on Large Files support (>4GB) for 32-bit Linux/Unix
-***********************************************************/
-#if !defined(__64BIT__) || defined(__MINGW32__)       /* No point defining Large file for 64 bit but MinGW-w64 requires it */
-#  if !defined(_FILE_OFFSET_BITS)
-#    define _FILE_OFFSET_BITS 64                      /* turn off_t into a 64-bit type for ftello, fseeko */
-#  endif
-#  if !defined(_LARGEFILE_SOURCE)                     /* obsolete macro, replaced with _FILE_OFFSET_BITS */
-#    define _LARGEFILE_SOURCE 1                       /* Large File Support extension (LFS) - fseeko, ftello */
-#  endif
-#  if defined(_AIX) || defined(__hpux)
-#    define _LARGE_FILES                              /* Large file support on 32-bits AIX and HP-UX */
-#  endif
-#endif
-
-/* ************************************************************
-* Avoid fseek()'s 2GiB barrier with MSVC, MacOS, *BSD, MinGW
-***************************************************************/
-#if defined(_MSC_VER) && _MSC_VER >= 1400
-#   define LONG_SEEK _fseeki64
-#elif !defined(__64BIT__) && (PLATFORM_POSIX_VERSION >= 200112L) /* No point defining Large file for 64 bit */
-#  define LONG_SEEK fseeko
-#elif defined(__MINGW32__) && !defined(__STRICT_ANSI__) && !defined(__NO_MINGW_LFS) && defined(__MSVCRT__)
-#   define LONG_SEEK fseeko64
-#elif defined(_WIN32) && !defined(__DJGPP__)
-#   include 
-    static int LONG_SEEK(FILE* file, __int64 offset, int origin) {
-        LARGE_INTEGER off;
-        DWORD method;
-        off.QuadPart = offset;
-        if (origin == SEEK_END)
-            method = FILE_END;
-        else if (origin == SEEK_CUR)
-            method = FILE_CURRENT;
-        else
-            method = FILE_BEGIN;
-
-        if (SetFilePointerEx((HANDLE) _get_osfhandle(_fileno(file)), off, NULL, method))
-            return 0;
-        else
-            return -1;
-    }
-#else
-#   define LONG_SEEK fseek
-#endif
-
-#include  /* malloc, free */
-#include   /* FILE* */
-
-#define XXH_STATIC_LINKING_ONLY
-#define XXH_NAMESPACE ZSTD_
-#include "xxhash.h"
-
-#define ZSTD_STATIC_LINKING_ONLY
-#include "zstd.h"
-#include "zstd_errors.h"
-#include "mem.h"
-#include "zstd_seekable.h"
-
-#undef ERROR
-#define ERROR(name) ((size_t)-ZSTD_error_##name)
-
-#define CHECK_IO(f) { int const errcod = (f); if (errcod < 0) return ERROR(seekableIO); }
-
-#undef MIN
-#undef MAX
-#define MIN(a, b) ((a) < (b) ? (a) : (b))
-#define MAX(a, b) ((a) > (b) ? (a) : (b))
-
-/* Special-case callbacks for FILE* and in-memory modes, so that we can treat
- * them the same way as the advanced API */
-static int ZSTD_seekable_read_FILE(void* opaque, void* buffer, size_t n)
-{
-    size_t const result = fread(buffer, 1, n, (FILE*)opaque);
-    if (result != n) {
-        return -1;
-    }
-    return 0;
-}
-
-static int ZSTD_seekable_seek_FILE(void* opaque, S64 offset, int origin)
-{
-    int const ret = LONG_SEEK((FILE*)opaque, offset, origin);
-    if (ret) return ret;
-    return fflush((FILE*)opaque);
-}
-
-typedef struct {
-    const void *ptr;
-    size_t size;
-    size_t pos;
-} buffWrapper_t;
-
-static int ZSTD_seekable_read_buff(void* opaque, void* buffer, size_t n)
-{
-    buffWrapper_t* buff = (buffWrapper_t*) opaque;
-    if (buff->size + n > buff->pos) return -1;
-    memcpy(buffer, (const BYTE*)buff->ptr + buff->pos, n);
-    buff->pos += n;
-    return 0;
-}
-
-static int ZSTD_seekable_seek_buff(void* opaque, S64 offset, int origin)
-{
-    buffWrapper_t* buff = (buffWrapper_t*) opaque;
-    unsigned long long newOffset;
-    switch (origin) {
-    case SEEK_SET:
-        newOffset = offset;
-        break;
-    case SEEK_CUR:
-        newOffset = (unsigned long long)buff->pos + offset;
-        break;
-    case SEEK_END:
-        newOffset = (unsigned long long)buff->size - offset;
-        break;
-    }
-    if (newOffset < 0 || newOffset > buff->size) {
-        return -1;
-    }
-    buff->pos = newOffset;
-    return 0;
-}
-
-typedef struct {
-    U64 cOffset;
-    U64 dOffset;
-    U32 checksum;
-} seekEntry_t;
-
-typedef struct {
-    seekEntry_t* entries;
-    size_t tableLen;
-
-    int checksumFlag;
-} seekTable_t;
-
-#define SEEKABLE_BUFF_SIZE ZSTD_BLOCKSIZE_ABSOLUTEMAX
-
-struct ZSTD_seekable_s {
-    ZSTD_DStream* dstream;
-    seekTable_t seekTable;
-    ZSTD_seekable_customFile src;
-
-    U64 decompressedOffset;
-    U32 curFrame;
-
-    BYTE inBuff[SEEKABLE_BUFF_SIZE]; /* need to do our own input buffering */
-    BYTE outBuff[SEEKABLE_BUFF_SIZE]; /* so we can efficiently decompress the
-                                         starts of chunks before we get to the
-                                         desired section */
-    ZSTD_inBuffer in; /* maintain continuity across ZSTD_seekable_decompress operations */
-    buffWrapper_t buffWrapper; /* for `src.opaque` in in-memory mode */
-
-    XXH64_state_t xxhState;
-};
-
-ZSTD_seekable* ZSTD_seekable_create(void)
-{
-    ZSTD_seekable* zs = malloc(sizeof(ZSTD_seekable));
-
-    if (zs == NULL) return NULL;
-
-    /* also initializes stage to zsds_init */
-    memset(zs, 0, sizeof(*zs));
-
-    zs->dstream = ZSTD_createDStream();
-    if (zs->dstream == NULL) {
-        free(zs);
-        return NULL;
-    }
-
-    return zs;
-}
-
-size_t ZSTD_seekable_free(ZSTD_seekable* zs)
-{
-    if (zs == NULL) return 0; /* support free on null */
-    ZSTD_freeDStream(zs->dstream);
-    free(zs->seekTable.entries);
-    free(zs);
-
-    return 0;
-}
-
-/** ZSTD_seekable_offsetToFrameIndex() :
- *  Performs a binary search to find the last frame with a decompressed offset
- *  <= pos
- *  @return : the frame's index */
-U32 ZSTD_seekable_offsetToFrameIndex(ZSTD_seekable* const zs, U64 pos)
-{
-    U32 lo = 0;
-    U32 hi = zs->seekTable.tableLen;
-
-    if (pos >= zs->seekTable.entries[zs->seekTable.tableLen].dOffset) {
-        return zs->seekTable.tableLen;
-    }
-
-    while (lo + 1 < hi) {
-        U32 const mid = lo + ((hi - lo) >> 1);
-        if (zs->seekTable.entries[mid].dOffset <= pos) {
-            lo = mid;
-        } else {
-            hi = mid;
-        }
-    }
-    return lo;
-}
-
-U32 ZSTD_seekable_getNumFrames(ZSTD_seekable* const zs)
-{
-    return zs->seekTable.tableLen;
-}
-
-U64 ZSTD_seekable_getFrameCompressedOffset(ZSTD_seekable* const zs, U32 frameIndex)
-{
-    if (frameIndex >= zs->seekTable.tableLen) return ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE;
-    return zs->seekTable.entries[frameIndex].cOffset;
-}
-
-U64 ZSTD_seekable_getFrameDecompressedOffset(ZSTD_seekable* const zs, U32 frameIndex)
-{
-    if (frameIndex >= zs->seekTable.tableLen) return ZSTD_SEEKABLE_FRAMEINDEX_TOOLARGE;
-    return zs->seekTable.entries[frameIndex].dOffset;
-}
-
-size_t ZSTD_seekable_getFrameCompressedSize(ZSTD_seekable* const zs, U32 frameIndex)
-{
-    if (frameIndex >= zs->seekTable.tableLen) return ERROR(frameIndex_tooLarge);
-    return zs->seekTable.entries[frameIndex + 1].cOffset -
-           zs->seekTable.entries[frameIndex].cOffset;
-}
-
-size_t ZSTD_seekable_getFrameDecompressedSize(ZSTD_seekable* const zs, U32 frameIndex)
-{
-    if (frameIndex > zs->seekTable.tableLen) return ERROR(frameIndex_tooLarge);
-    return zs->seekTable.entries[frameIndex + 1].dOffset -
-           zs->seekTable.entries[frameIndex].dOffset;
-}
-
-static size_t ZSTD_seekable_loadSeekTable(ZSTD_seekable* zs)
-{
-    int checksumFlag;
-    ZSTD_seekable_customFile src = zs->src;
-    /* read the footer, fixed size */
-    CHECK_IO(src.seek(src.opaque, -(int)ZSTD_seekTableFooterSize, SEEK_END));
-    CHECK_IO(src.read(src.opaque, zs->inBuff, ZSTD_seekTableFooterSize));
-
-    if (MEM_readLE32(zs->inBuff + 5) != ZSTD_SEEKABLE_MAGICNUMBER) {
-        return ERROR(prefix_unknown);
-    }
-
-    {   BYTE const sfd = zs->inBuff[4];
-        checksumFlag = sfd >> 7;
-
-        /* check reserved bits */
-        if ((checksumFlag >> 2) & 0x1f) {
-            return ERROR(corruption_detected);
-        }
-    }
-
-    {   U32 const numFrames = MEM_readLE32(zs->inBuff);
-        U32 const sizePerEntry = 8 + (checksumFlag?4:0);
-        U32 const tableSize = sizePerEntry * numFrames;
-        U32 const frameSize = tableSize + ZSTD_seekTableFooterSize + ZSTD_skippableHeaderSize;
-
-        U32 remaining = frameSize - ZSTD_seekTableFooterSize; /* don't need to re-read footer */
-        {
-            U32 const toRead = MIN(remaining, SEEKABLE_BUFF_SIZE);
-
-            CHECK_IO(src.seek(src.opaque, -(S64)frameSize, SEEK_END));
-            CHECK_IO(src.read(src.opaque, zs->inBuff, toRead));
-
-            remaining -= toRead;
-        }
-
-        if (MEM_readLE32(zs->inBuff) != (ZSTD_MAGIC_SKIPPABLE_START | 0xE)) {
-            return ERROR(prefix_unknown);
-        }
-        if (MEM_readLE32(zs->inBuff+4) + ZSTD_skippableHeaderSize != frameSize) {
-            return ERROR(prefix_unknown);
-        }
-
-        {   /* Allocate an extra entry at the end so that we can do size
-             * computations on the last element without special case */
-            seekEntry_t* entries = (seekEntry_t*)malloc(sizeof(seekEntry_t) * (numFrames + 1));
-            const BYTE* tableBase = zs->inBuff + ZSTD_skippableHeaderSize;
-
-            U32 idx = 0;
-            U32 pos = 8;
-
-
-            U64 cOffset = 0;
-            U64 dOffset = 0;
-
-            if (!entries) {
-                free(entries);
-                return ERROR(memory_allocation);
-            }
-
-            /* compute cumulative positions */
-            for (; idx < numFrames; idx++) {
-                if (pos + sizePerEntry > SEEKABLE_BUFF_SIZE) {
-                    U32 const toRead = MIN(remaining, SEEKABLE_BUFF_SIZE);
-                    U32 const offset = SEEKABLE_BUFF_SIZE - pos;
-                    memmove(zs->inBuff, zs->inBuff + pos, offset); /* move any data we haven't read yet */
-                    CHECK_IO(src.read(src.opaque, zs->inBuff+offset, toRead));
-                    remaining -= toRead;
-                    pos = 0;
-                }
-                entries[idx].cOffset = cOffset;
-                entries[idx].dOffset = dOffset;
-
-                cOffset += MEM_readLE32(zs->inBuff + pos);
-                pos += 4;
-                dOffset += MEM_readLE32(zs->inBuff + pos);
-                pos += 4;
-                if (checksumFlag) {
-                    entries[idx].checksum = MEM_readLE32(zs->inBuff + pos);
-                    pos += 4;
-                }
-            }
-            entries[numFrames].cOffset = cOffset;
-            entries[numFrames].dOffset = dOffset;
-
-            zs->seekTable.entries = entries;
-            zs->seekTable.tableLen = numFrames;
-            zs->seekTable.checksumFlag = checksumFlag;
-            return 0;
-        }
-    }
-}
-
-size_t ZSTD_seekable_initBuff(ZSTD_seekable* zs, const void* src, size_t srcSize)
-{
-    zs->buffWrapper = (buffWrapper_t){src, srcSize, 0};
-    {   ZSTD_seekable_customFile srcFile = {&zs->buffWrapper,
-                                            &ZSTD_seekable_read_buff,
-                                            &ZSTD_seekable_seek_buff};
-        return ZSTD_seekable_initAdvanced(zs, srcFile); }
-}
-
-size_t ZSTD_seekable_initFile(ZSTD_seekable* zs, FILE* src)
-{
-    ZSTD_seekable_customFile srcFile = {src, &ZSTD_seekable_read_FILE,
-                                        &ZSTD_seekable_seek_FILE};
-    return ZSTD_seekable_initAdvanced(zs, srcFile);
-}
-
-size_t ZSTD_seekable_initAdvanced(ZSTD_seekable* zs, ZSTD_seekable_customFile src)
-{
-    zs->src = src;
-
-    {   const size_t seekTableInit = ZSTD_seekable_loadSeekTable(zs);
-        if (ZSTD_isError(seekTableInit)) return seekTableInit; }
-
-    zs->decompressedOffset = (U64)-1;
-    zs->curFrame = (U32)-1;
-
-    {   const size_t dstreamInit = ZSTD_initDStream(zs->dstream);
-        if (ZSTD_isError(dstreamInit)) return dstreamInit; }
-    return 0;
-}
-
-size_t ZSTD_seekable_decompress(ZSTD_seekable* zs, void* dst, size_t len, U64 offset)
-{
-    U32 targetFrame = ZSTD_seekable_offsetToFrameIndex(zs, offset);
-    do {
-        /* check if we can continue from a previous decompress job */
-        if (targetFrame != zs->curFrame || offset != zs->decompressedOffset) {
-            zs->decompressedOffset = zs->seekTable.entries[targetFrame].dOffset;
-            zs->curFrame = targetFrame;
-
-            CHECK_IO(zs->src.seek(zs->src.opaque,
-                                  zs->seekTable.entries[targetFrame].cOffset,
-                                  SEEK_SET));
-            zs->in = (ZSTD_inBuffer){zs->inBuff, 0, 0};
-            XXH64_reset(&zs->xxhState, 0);
-            ZSTD_resetDStream(zs->dstream);
-        }
-
-        while (zs->decompressedOffset < offset + len) {
-            size_t toRead;
-            ZSTD_outBuffer outTmp;
-            size_t prevOutPos;
-            if (zs->decompressedOffset < offset) {
-                /* dummy decompressions until we get to the target offset */
-                outTmp = (ZSTD_outBuffer){zs->outBuff, MIN(SEEKABLE_BUFF_SIZE, offset - zs->decompressedOffset), 0};
-            } else {
-                outTmp = (ZSTD_outBuffer){dst, len, zs->decompressedOffset - offset};
-            }
-
-            prevOutPos = outTmp.pos;
-            toRead = ZSTD_decompressStream(zs->dstream, &outTmp, &zs->in);
-            if (ZSTD_isError(toRead)) {
-                return toRead;
-            }
-
-            if (zs->seekTable.checksumFlag) {
-                XXH64_update(&zs->xxhState, (BYTE*)outTmp.dst + prevOutPos,
-                             outTmp.pos - prevOutPos);
-            }
-            zs->decompressedOffset += outTmp.pos - prevOutPos;
-
-            if (toRead == 0) {
-                /* frame complete */
-
-                /* verify checksum */
-                if (zs->seekTable.checksumFlag &&
-                    (XXH64_digest(&zs->xxhState) & 0xFFFFFFFFU) !=
-                            zs->seekTable.entries[targetFrame].checksum) {
-                    return ERROR(corruption_detected);
-                }
-
-                if (zs->decompressedOffset < offset + len) {
-                    /* go back to the start and force a reset of the stream */
-                    targetFrame = ZSTD_seekable_offsetToFrameIndex(zs, zs->decompressedOffset);
-                }
-                break;
-            }
-
-            /* read in more data if we're done with this buffer */
-            if (zs->in.pos == zs->in.size) {
-                toRead = MIN(toRead, SEEKABLE_BUFF_SIZE);
-                CHECK_IO(zs->src.read(zs->src.opaque, zs->inBuff, toRead));
-                zs->in.size = toRead;
-                zs->in.pos = 0;
-            }
-        }
-    } while (zs->decompressedOffset != offset + len);
-
-    return len;
-}
-
-size_t ZSTD_seekable_decompressFrame(ZSTD_seekable* zs, void* dst, size_t dstSize, U32 frameIndex)
-{
-    if (frameIndex >= zs->seekTable.tableLen) {
-        return ERROR(frameIndex_tooLarge);
-    }
-
-    {
-        size_t const decompressedSize =
-                zs->seekTable.entries[frameIndex + 1].dOffset -
-                zs->seekTable.entries[frameIndex].dOffset;
-        if (dstSize < decompressedSize) {
-            return ERROR(dstSize_tooSmall);
-        }
-        return ZSTD_seekable_decompress(
-                zs, dst, decompressedSize,
-                zs->seekTable.entries[frameIndex].dOffset);
-    }
-}
diff --git a/priv/zstd/doc/README.md b/priv/zstd/doc/README.md
deleted file mode 100644
index 47cfe36..0000000
--- a/priv/zstd/doc/README.md
+++ /dev/null
@@ -1,20 +0,0 @@
-Zstandard Documentation
-=======================
-
-This directory contains material defining the Zstandard format,
-as well as for help using the `zstd` library.
-
-__`zstd_compression_format.md`__ : This document defines the Zstandard compression format.
-Compliant decoders must adhere to this document,
-and compliant encoders must generate data that follows it.
-
-__`educational_decoder`__ : This directory contains an implementation of a Zstandard decoder,
-compliant with the Zstandard compression format.
-It can be used, for example, to better understand the format,
-or as the basis for a separate implementation a Zstandard decoder/encoder.
-
-__`zstd_manual.html`__ : Documentation on the functions found in `zstd.h`.
-See [http://zstd.net/zstd_manual.html](http://zstd.net/zstd_manual.html) for
-the manual released with the latest official `zstd` release.
-
-
diff --git a/priv/zstd/doc/educational_decoder/Makefile b/priv/zstd/doc/educational_decoder/Makefile
deleted file mode 100644
index ace1294..0000000
--- a/priv/zstd/doc/educational_decoder/Makefile
+++ /dev/null
@@ -1,34 +0,0 @@
-HARNESS_FILES=*.c
-
-MULTITHREAD_LDFLAGS = -pthread
-DEBUGFLAGS= -g -DZSTD_DEBUG=1
-CPPFLAGS += -I$(ZSTDDIR) -I$(ZSTDDIR)/common -I$(ZSTDDIR)/compress \
-            -I$(ZSTDDIR)/dictBuilder -I$(ZSTDDIR)/deprecated -I$(PRGDIR)
-CFLAGS   ?= -O3
-CFLAGS   += -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow                 \
-            -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \
-            -Wstrict-prototypes -Wundef -Wformat-security                   \
-            -Wvla -Wformat=2 -Winit-self -Wfloat-equal -Wwrite-strings      \
-            -Wredundant-decls
-CFLAGS   += $(DEBUGFLAGS)
-CFLAGS   += $(MOREFLAGS)
-FLAGS     = $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) $(MULTITHREAD_LDFLAGS)
-
-harness: $(HARNESS_FILES)
-	$(CC) $(FLAGS) $^ -o $@
-
-clean:
-	@$(RM) -f harness
-	@$(RM) -rf harness.dSYM
-
-test: harness
-	@zstd README.md -o tmp.zst
-	@./harness tmp.zst tmp
-	@diff -s tmp README.md
-	@$(RM) -f tmp*
-	@zstd --train harness.c zstd_decompress.c zstd_decompress.h README.md
-	@zstd -D dictionary README.md -o tmp.zst
-	@./harness tmp.zst tmp dictionary
-	@diff -s tmp README.md
-	@$(RM) -f tmp* dictionary
-	@make clean
diff --git a/priv/zstd/doc/educational_decoder/README.md b/priv/zstd/doc/educational_decoder/README.md
deleted file mode 100644
index e3b9bf5..0000000
--- a/priv/zstd/doc/educational_decoder/README.md
+++ /dev/null
@@ -1,29 +0,0 @@
-Educational Decoder
-===================
-
-`zstd_decompress.c` is a self-contained implementation in C99 of a decoder,
-according to the [Zstandard format specification].
-While it does not implement as many features as the reference decoder,
-such as the streaming API or content checksums, it is written to be easy to
-follow and understand, to help understand how the Zstandard format works.
-It's laid out to match the [format specification],
-so it can be used to understand how complex segments could be implemented.
-It also contains implementations of Huffman and FSE table decoding.
-
-[Zstandard format specification]: https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md
-[format specification]: https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md
-
-`harness.c` provides a simple test harness around the decoder:
-
-    harness   [dictionary]
-
-As an additional resource to be used with this decoder,
-see the `decodecorpus` tool in the [tests] directory.
-It generates valid Zstandard frames that can be used to verify
-a Zstandard decoder implementation.
-Note that to use the tool to verify this decoder implementation,
-the --content-size flag should be set,
-as this decoder does not handle streaming decoding,
-and so it must know the decompressed size in advance.
-
-[tests]: https://github.com/facebook/zstd/blob/dev/tests/
diff --git a/priv/zstd/doc/educational_decoder/harness.c b/priv/zstd/doc/educational_decoder/harness.c
deleted file mode 100644
index 47882b1..0000000
--- a/priv/zstd/doc/educational_decoder/harness.c
+++ /dev/null
@@ -1,125 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-#include 
-#include 
-
-#include "zstd_decompress.h"
-
-typedef unsigned char u8;
-
-// If the data doesn't have decompressed size with it, fallback on assuming the
-// compression ratio is at most 16
-#define MAX_COMPRESSION_RATIO (16)
-
-// Protect against allocating too much memory for output
-#define MAX_OUTPUT_SIZE ((size_t)1024 * 1024 * 1024)
-
-u8 *input;
-u8 *output;
-u8 *dict;
-
-size_t read_file(const char *path, u8 **ptr) {
-    FILE *f = fopen(path, "rb");
-    if (!f) {
-        fprintf(stderr, "failed to open file %s\n", path);
-        exit(1);
-    }
-
-    fseek(f, 0L, SEEK_END);
-    size_t size = ftell(f);
-    rewind(f);
-
-    *ptr = malloc(size);
-    if (!ptr) {
-        fprintf(stderr, "failed to allocate memory to hold %s\n", path);
-        exit(1);
-    }
-
-    size_t pos = 0;
-    while (!feof(f)) {
-        size_t read = fread(&(*ptr)[pos], 1, size, f);
-        if (ferror(f)) {
-            fprintf(stderr, "error while reading file %s\n", path);
-            exit(1);
-        }
-        pos += read;
-    }
-
-    fclose(f);
-
-    return pos;
-}
-
-void write_file(const char *path, const u8 *ptr, size_t size) {
-    FILE *f = fopen(path, "wb");
-
-    size_t written = 0;
-    while (written < size) {
-        written += fwrite(&ptr[written], 1, size, f);
-        if (ferror(f)) {
-            fprintf(stderr, "error while writing file %s\n", path);
-            exit(1);
-        }
-    }
-
-    fclose(f);
-}
-
-int main(int argc, char **argv) {
-    if (argc < 3) {
-        fprintf(stderr, "usage: %s   [dictionary]\n",
-                argv[0]);
-
-        return 1;
-    }
-
-    size_t input_size = read_file(argv[1], &input);
-    size_t dict_size = 0;
-    if (argc >= 4) {
-        dict_size = read_file(argv[3], &dict);
-    }
-
-    size_t decompressed_size = ZSTD_get_decompressed_size(input, input_size);
-    if (decompressed_size == (size_t)-1) {
-        decompressed_size = MAX_COMPRESSION_RATIO * input_size;
-        fprintf(stderr, "WARNING: Compressed data does not contain "
-                        "decompressed size, going to assume the compression "
-                        "ratio is at most %d (decompressed size of at most "
-                        "%zu)\n",
-                MAX_COMPRESSION_RATIO, decompressed_size);
-    }
-    if (decompressed_size > MAX_OUTPUT_SIZE) {
-        fprintf(stderr,
-                "Required output size too large for this implementation\n");
-        return 1;
-    }
-    output = malloc(decompressed_size);
-    if (!output) {
-        fprintf(stderr, "failed to allocate memory\n");
-        return 1;
-    }
-
-    dictionary_t* const parsed_dict = create_dictionary();
-    if (dict) {
-        parse_dictionary(parsed_dict, dict, dict_size);
-    }
-    size_t decompressed =
-        ZSTD_decompress_with_dict(output, decompressed_size,
-                                  input, input_size, parsed_dict);
-
-    free_dictionary(parsed_dict);
-
-    write_file(argv[2], output, decompressed);
-
-    free(input);
-    free(output);
-    free(dict);
-    input = output = dict = NULL;
-}
diff --git a/priv/zstd/doc/educational_decoder/zstd_decompress.c b/priv/zstd/doc/educational_decoder/zstd_decompress.c
deleted file mode 100644
index bea0e0c..0000000
--- a/priv/zstd/doc/educational_decoder/zstd_decompress.c
+++ /dev/null
@@ -1,2303 +0,0 @@
-/*
- * Copyright (c) 2017-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/// Zstandard educational decoder implementation
-/// See https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md
-
-#include 
-#include 
-#include 
-#include 
-#include "zstd_decompress.h"
-
-/******* UTILITY MACROS AND TYPES *********************************************/
-// Max block size decompressed size is 128 KB and literal blocks can't be
-// larger than their block
-#define MAX_LITERALS_SIZE ((size_t)128 * 1024)
-
-#define MAX(a, b) ((a) > (b) ? (a) : (b))
-#define MIN(a, b) ((a) < (b) ? (a) : (b))
-
-/// This decoder calls exit(1) when it encounters an error, however a production
-/// library should propagate error codes
-#define ERROR(s)                                                               \
-    do {                                                                       \
-        fprintf(stderr, "Error: %s\n", s);                                     \
-        exit(1);                                                               \
-    } while (0)
-#define INP_SIZE()                                                             \
-    ERROR("Input buffer smaller than it should be or input is "                \
-          "corrupted")
-#define OUT_SIZE() ERROR("Output buffer too small for output")
-#define CORRUPTION() ERROR("Corruption detected while decompressing")
-#define BAD_ALLOC() ERROR("Memory allocation error")
-#define IMPOSSIBLE() ERROR("An impossibility has occurred")
-
-typedef uint8_t u8;
-typedef uint16_t u16;
-typedef uint32_t u32;
-typedef uint64_t u64;
-
-typedef int8_t i8;
-typedef int16_t i16;
-typedef int32_t i32;
-typedef int64_t i64;
-/******* END UTILITY MACROS AND TYPES *****************************************/
-
-/******* IMPLEMENTATION PRIMITIVE PROTOTYPES **********************************/
-/// The implementations for these functions can be found at the bottom of this
-/// file.  They implement low-level functionality needed for the higher level
-/// decompression functions.
-
-/*** IO STREAM OPERATIONS *************/
-
-/// ostream_t/istream_t are used to wrap the pointers/length data passed into
-/// ZSTD_decompress, so that all IO operations are safely bounds checked
-/// They are written/read forward, and reads are treated as little-endian
-/// They should be used opaquely to ensure safety
-typedef struct {
-    u8 *ptr;
-    size_t len;
-} ostream_t;
-
-typedef struct {
-    const u8 *ptr;
-    size_t len;
-
-    // Input often reads a few bits at a time, so maintain an internal offset
-    int bit_offset;
-} istream_t;
-
-/// The following two functions are the only ones that allow the istream to be
-/// non-byte aligned
-
-/// Reads `num` bits from a bitstream, and updates the internal offset
-static inline u64 IO_read_bits(istream_t *const in, const int num_bits);
-/// Backs-up the stream by `num` bits so they can be read again
-static inline void IO_rewind_bits(istream_t *const in, const int num_bits);
-/// If the remaining bits in a byte will be unused, advance to the end of the
-/// byte
-static inline void IO_align_stream(istream_t *const in);
-
-/// Write the given byte into the output stream
-static inline void IO_write_byte(ostream_t *const out, u8 symb);
-
-/// Returns the number of bytes left to be read in this stream.  The stream must
-/// be byte aligned.
-static inline size_t IO_istream_len(const istream_t *const in);
-
-/// Advances the stream by `len` bytes, and returns a pointer to the chunk that
-/// was skipped.  The stream must be byte aligned.
-static inline const u8 *IO_get_read_ptr(istream_t *const in, size_t len);
-/// Advances the stream by `len` bytes, and returns a pointer to the chunk that
-/// was skipped so it can be written to.
-static inline u8 *IO_get_write_ptr(ostream_t *const out, size_t len);
-
-/// Advance the inner state by `len` bytes.  The stream must be byte aligned.
-static inline void IO_advance_input(istream_t *const in, size_t len);
-
-/// Returns an `ostream_t` constructed from the given pointer and length.
-static inline ostream_t IO_make_ostream(u8 *out, size_t len);
-/// Returns an `istream_t` constructed from the given pointer and length.
-static inline istream_t IO_make_istream(const u8 *in, size_t len);
-
-/// Returns an `istream_t` with the same base as `in`, and length `len`.
-/// Then, advance `in` to account for the consumed bytes.
-/// `in` must be byte aligned.
-static inline istream_t IO_make_sub_istream(istream_t *const in, size_t len);
-/*** END IO STREAM OPERATIONS *********/
-
-/*** BITSTREAM OPERATIONS *************/
-/// Read `num` bits (up to 64) from `src + offset`, where `offset` is in bits,
-/// and return them interpreted as a little-endian unsigned integer.
-static inline u64 read_bits_LE(const u8 *src, const int num_bits,
-                               const size_t offset);
-
-/// Read bits from the end of a HUF or FSE bitstream.  `offset` is in bits, so
-/// it updates `offset` to `offset - bits`, and then reads `bits` bits from
-/// `src + offset`.  If the offset becomes negative, the extra bits at the
-/// bottom are filled in with `0` bits instead of reading from before `src`.
-static inline u64 STREAM_read_bits(const u8 *src, const int bits,
-                                   i64 *const offset);
-/*** END BITSTREAM OPERATIONS *********/
-
-/*** BIT COUNTING OPERATIONS **********/
-/// Returns the index of the highest set bit in `num`, or `-1` if `num == 0`
-static inline int highest_set_bit(const u64 num);
-/*** END BIT COUNTING OPERATIONS ******/
-
-/*** HUFFMAN PRIMITIVES ***************/
-// Table decode method uses exponential memory, so we need to limit depth
-#define HUF_MAX_BITS (16)
-
-// Limit the maximum number of symbols to 256 so we can store a symbol in a byte
-#define HUF_MAX_SYMBS (256)
-
-/// Structure containing all tables necessary for efficient Huffman decoding
-typedef struct {
-    u8 *symbols;
-    u8 *num_bits;
-    int max_bits;
-} HUF_dtable;
-
-/// Decode a single symbol and read in enough bits to refresh the state
-static inline u8 HUF_decode_symbol(const HUF_dtable *const dtable,
-                                   u16 *const state, const u8 *const src,
-                                   i64 *const offset);
-/// Read in a full state's worth of bits to initialize it
-static inline void HUF_init_state(const HUF_dtable *const dtable,
-                                  u16 *const state, const u8 *const src,
-                                  i64 *const offset);
-
-/// Decompresses a single Huffman stream, returns the number of bytes decoded.
-/// `src_len` must be the exact length of the Huffman-coded block.
-static size_t HUF_decompress_1stream(const HUF_dtable *const dtable,
-                                     ostream_t *const out, istream_t *const in);
-/// Same as previous but decodes 4 streams, formatted as in the Zstandard
-/// specification.
-/// `src_len` must be the exact length of the Huffman-coded block.
-static size_t HUF_decompress_4stream(const HUF_dtable *const dtable,
-                                     ostream_t *const out, istream_t *const in);
-
-/// Initialize a Huffman decoding table using the table of bit counts provided
-static void HUF_init_dtable(HUF_dtable *const table, const u8 *const bits,
-                            const int num_symbs);
-/// Initialize a Huffman decoding table using the table of weights provided
-/// Weights follow the definition provided in the Zstandard specification
-static void HUF_init_dtable_usingweights(HUF_dtable *const table,
-                                         const u8 *const weights,
-                                         const int num_symbs);
-
-/// Free the malloc'ed parts of a decoding table
-static void HUF_free_dtable(HUF_dtable *const dtable);
-
-/// Deep copy a decoding table, so that it can be used and free'd without
-/// impacting the source table.
-static void HUF_copy_dtable(HUF_dtable *const dst, const HUF_dtable *const src);
-/*** END HUFFMAN PRIMITIVES ***********/
-
-/*** FSE PRIMITIVES *******************/
-/// For more description of FSE see
-/// https://github.com/Cyan4973/FiniteStateEntropy/
-
-// FSE table decoding uses exponential memory, so limit the maximum accuracy
-#define FSE_MAX_ACCURACY_LOG (15)
-// Limit the maximum number of symbols so they can be stored in a single byte
-#define FSE_MAX_SYMBS (256)
-
-/// The tables needed to decode FSE encoded streams
-typedef struct {
-    u8 *symbols;
-    u8 *num_bits;
-    u16 *new_state_base;
-    int accuracy_log;
-} FSE_dtable;
-
-/// Return the symbol for the current state
-static inline u8 FSE_peek_symbol(const FSE_dtable *const dtable,
-                                 const u16 state);
-/// Read the number of bits necessary to update state, update, and shift offset
-/// back to reflect the bits read
-static inline void FSE_update_state(const FSE_dtable *const dtable,
-                                    u16 *const state, const u8 *const src,
-                                    i64 *const offset);
-
-/// Combine peek and update: decode a symbol and update the state
-static inline u8 FSE_decode_symbol(const FSE_dtable *const dtable,
-                                   u16 *const state, const u8 *const src,
-                                   i64 *const offset);
-
-/// Read bits from the stream to initialize the state and shift offset back
-static inline void FSE_init_state(const FSE_dtable *const dtable,
-                                  u16 *const state, const u8 *const src,
-                                  i64 *const offset);
-
-/// Decompress two interleaved bitstreams (e.g. compressed Huffman weights)
-/// using an FSE decoding table.  `src_len` must be the exact length of the
-/// block.
-static size_t FSE_decompress_interleaved2(const FSE_dtable *const dtable,
-                                          ostream_t *const out,
-                                          istream_t *const in);
-
-/// Initialize a decoding table using normalized frequencies.
-static void FSE_init_dtable(FSE_dtable *const dtable,
-                            const i16 *const norm_freqs, const int num_symbs,
-                            const int accuracy_log);
-
-/// Decode an FSE header as defined in the Zstandard format specification and
-/// use the decoded frequencies to initialize a decoding table.
-static void FSE_decode_header(FSE_dtable *const dtable, istream_t *const in,
-                                const int max_accuracy_log);
-
-/// Initialize an FSE table that will always return the same symbol and consume
-/// 0 bits per symbol, to be used for RLE mode in sequence commands
-static void FSE_init_dtable_rle(FSE_dtable *const dtable, const u8 symb);
-
-/// Free the malloc'ed parts of a decoding table
-static void FSE_free_dtable(FSE_dtable *const dtable);
-
-/// Deep copy a decoding table, so that it can be used and free'd without
-/// impacting the source table.
-static void FSE_copy_dtable(FSE_dtable *const dst, const FSE_dtable *const src);
-/*** END FSE PRIMITIVES ***************/
-
-/******* END IMPLEMENTATION PRIMITIVE PROTOTYPES ******************************/
-
-/******* ZSTD HELPER STRUCTS AND PROTOTYPES ***********************************/
-
-/// A small structure that can be reused in various places that need to access
-/// frame header information
-typedef struct {
-    // The size of window that we need to be able to contiguously store for
-    // references
-    size_t window_size;
-    // The total output size of this compressed frame
-    size_t frame_content_size;
-
-    // The dictionary id if this frame uses one
-    u32 dictionary_id;
-
-    // Whether or not the content of this frame has a checksum
-    int content_checksum_flag;
-    // Whether or not the output for this frame is in a single segment
-    int single_segment_flag;
-} frame_header_t;
-
-/// The context needed to decode blocks in a frame
-typedef struct {
-    frame_header_t header;
-
-    // The total amount of data available for backreferences, to determine if an
-    // offset too large to be correct
-    size_t current_total_output;
-
-    const u8 *dict_content;
-    size_t dict_content_len;
-
-    // Entropy encoding tables so they can be repeated by future blocks instead
-    // of retransmitting
-    HUF_dtable literals_dtable;
-    FSE_dtable ll_dtable;
-    FSE_dtable ml_dtable;
-    FSE_dtable of_dtable;
-
-    // The last 3 offsets for the special "repeat offsets".
-    u64 previous_offsets[3];
-} frame_context_t;
-
-/// The decoded contents of a dictionary so that it doesn't have to be repeated
-/// for each frame that uses it
-struct dictionary_s {
-    // Entropy tables
-    HUF_dtable literals_dtable;
-    FSE_dtable ll_dtable;
-    FSE_dtable ml_dtable;
-    FSE_dtable of_dtable;
-
-    // Raw content for backreferences
-    u8 *content;
-    size_t content_size;
-
-    // Offset history to prepopulate the frame's history
-    u64 previous_offsets[3];
-
-    u32 dictionary_id;
-};
-
-/// A tuple containing the parts necessary to decode and execute a ZSTD sequence
-/// command
-typedef struct {
-    u32 literal_length;
-    u32 match_length;
-    u32 offset;
-} sequence_command_t;
-
-/// The decoder works top-down, starting at the high level like Zstd frames, and
-/// working down to lower more technical levels such as blocks, literals, and
-/// sequences.  The high-level functions roughly follow the outline of the
-/// format specification:
-/// https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md
-
-/// Before the implementation of each high-level function declared here, the
-/// prototypes for their helper functions are defined and explained
-
-/// Decode a single Zstd frame, or error if the input is not a valid frame.
-/// Accepts a dict argument, which may be NULL indicating no dictionary.
-/// See
-/// https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md#frame-concatenation
-static void decode_frame(ostream_t *const out, istream_t *const in,
-                         const dictionary_t *const dict);
-
-// Decode data in a compressed block
-static void decompress_block(frame_context_t *const ctx, ostream_t *const out,
-                             istream_t *const in);
-
-// Decode the literals section of a block
-static size_t decode_literals(frame_context_t *const ctx, istream_t *const in,
-                              u8 **const literals);
-
-// Decode the sequences part of a block
-static size_t decode_sequences(frame_context_t *const ctx, istream_t *const in,
-                               sequence_command_t **const sequences);
-
-// Execute the decoded sequences on the literals block
-static void execute_sequences(frame_context_t *const ctx, ostream_t *const out,
-                              const u8 *const literals,
-                              const size_t literals_len,
-                              const sequence_command_t *const sequences,
-                              const size_t num_sequences);
-
-// Copies literals and returns the total literal length that was copied
-static u32 copy_literals(const size_t seq, istream_t *litstream,
-                         ostream_t *const out);
-
-// Given an offset code from a sequence command (either an actual offset value
-// or an index for previous offset), computes the correct offset and udpates
-// the offset history
-static size_t compute_offset(sequence_command_t seq, u64 *const offset_hist);
-
-// Given an offset, match length, and total output, as well as the frame
-// context for the dictionary, determines if the dictionary is used and
-// executes the copy operation
-static void execute_match_copy(frame_context_t *const ctx, size_t offset,
-                              size_t match_length, size_t total_output,
-                              ostream_t *const out);
-
-/******* END ZSTD HELPER STRUCTS AND PROTOTYPES *******************************/
-
-size_t ZSTD_decompress(void *const dst, const size_t dst_len,
-                       const void *const src, const size_t src_len) {
-    dictionary_t* uninit_dict = create_dictionary();
-    size_t const decomp_size = ZSTD_decompress_with_dict(dst, dst_len, src,
-                                                         src_len, uninit_dict);
-    free_dictionary(uninit_dict);
-    return decomp_size;
-}
-
-size_t ZSTD_decompress_with_dict(void *const dst, const size_t dst_len,
-                                 const void *const src, const size_t src_len,
-                                 dictionary_t* parsed_dict) {
-
-    istream_t in = IO_make_istream(src, src_len);
-    ostream_t out = IO_make_ostream(dst, dst_len);
-
-    // "A content compressed by Zstandard is transformed into a Zstandard frame.
-    // Multiple frames can be appended into a single file or stream. A frame is
-    // totally independent, has a defined beginning and end, and a set of
-    // parameters which tells the decoder how to decompress it."
-
-    /* this decoder assumes decompression of a single frame */
-    decode_frame(&out, &in, parsed_dict);
-
-    return out.ptr - (u8 *)dst;
-}
-
-/******* FRAME DECODING ******************************************************/
-
-static void decode_data_frame(ostream_t *const out, istream_t *const in,
-                              const dictionary_t *const dict);
-static void init_frame_context(frame_context_t *const context,
-                               istream_t *const in,
-                               const dictionary_t *const dict);
-static void free_frame_context(frame_context_t *const context);
-static void parse_frame_header(frame_header_t *const header,
-                               istream_t *const in);
-static void frame_context_apply_dict(frame_context_t *const ctx,
-                                     const dictionary_t *const dict);
-
-static void decompress_data(frame_context_t *const ctx, ostream_t *const out,
-                            istream_t *const in);
-
-static void decode_frame(ostream_t *const out, istream_t *const in,
-                         const dictionary_t *const dict) {
-    const u32 magic_number = IO_read_bits(in, 32);
-    // Zstandard frame
-    //
-    // "Magic_Number
-    //
-    // 4 Bytes, little-endian format. Value : 0xFD2FB528"
-    if (magic_number == 0xFD2FB528U) {
-        // ZSTD frame
-        decode_data_frame(out, in, dict);
-
-        return;
-    }
-
-    // not a real frame or a skippable frame
-    ERROR("Tried to decode non-ZSTD frame");
-}
-
-/// Decode a frame that contains compressed data.  Not all frames do as there
-/// are skippable frames.
-/// See
-/// https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md#general-structure-of-zstandard-frame-format
-static void decode_data_frame(ostream_t *const out, istream_t *const in,
-                              const dictionary_t *const dict) {
-    frame_context_t ctx;
-
-    // Initialize the context that needs to be carried from block to block
-    init_frame_context(&ctx, in, dict);
-
-    if (ctx.header.frame_content_size != 0 &&
-        ctx.header.frame_content_size > out->len) {
-        OUT_SIZE();
-    }
-
-    decompress_data(&ctx, out, in);
-
-    free_frame_context(&ctx);
-}
-
-/// Takes the information provided in the header and dictionary, and initializes
-/// the context for this frame
-static void init_frame_context(frame_context_t *const context,
-                               istream_t *const in,
-                               const dictionary_t *const dict) {
-    // Most fields in context are correct when initialized to 0
-    memset(context, 0, sizeof(frame_context_t));
-
-    // Parse data from the frame header
-    parse_frame_header(&context->header, in);
-
-    // Set up the offset history for the repeat offset commands
-    context->previous_offsets[0] = 1;
-    context->previous_offsets[1] = 4;
-    context->previous_offsets[2] = 8;
-
-    // Apply details from the dict if it exists
-    frame_context_apply_dict(context, dict);
-}
-
-static void free_frame_context(frame_context_t *const context) {
-    HUF_free_dtable(&context->literals_dtable);
-
-    FSE_free_dtable(&context->ll_dtable);
-    FSE_free_dtable(&context->ml_dtable);
-    FSE_free_dtable(&context->of_dtable);
-
-    memset(context, 0, sizeof(frame_context_t));
-}
-
-static void parse_frame_header(frame_header_t *const header,
-                               istream_t *const in) {
-    // "The first header's byte is called the Frame_Header_Descriptor. It tells
-    // which other fields are present. Decoding this byte is enough to tell the
-    // size of Frame_Header.
-    //
-    // Bit number   Field name
-    // 7-6  Frame_Content_Size_flag
-    // 5    Single_Segment_flag
-    // 4    Unused_bit
-    // 3    Reserved_bit
-    // 2    Content_Checksum_flag
-    // 1-0  Dictionary_ID_flag"
-    const u8 descriptor = IO_read_bits(in, 8);
-
-    // decode frame header descriptor into flags
-    const u8 frame_content_size_flag = descriptor >> 6;
-    const u8 single_segment_flag = (descriptor >> 5) & 1;
-    const u8 reserved_bit = (descriptor >> 3) & 1;
-    const u8 content_checksum_flag = (descriptor >> 2) & 1;
-    const u8 dictionary_id_flag = descriptor & 3;
-
-    if (reserved_bit != 0) {
-        CORRUPTION();
-    }
-
-    header->single_segment_flag = single_segment_flag;
-    header->content_checksum_flag = content_checksum_flag;
-
-    // decode window size
-    if (!single_segment_flag) {
-        // "Provides guarantees on maximum back-reference distance that will be
-        // used within compressed data. This information is important for
-        // decoders to allocate enough memory.
-        //
-        // Bit numbers  7-3         2-0
-        // Field name   Exponent    Mantissa"
-        u8 window_descriptor = IO_read_bits(in, 8);
-        u8 exponent = window_descriptor >> 3;
-        u8 mantissa = window_descriptor & 7;
-
-        // Use the algorithm from the specification to compute window size
-        // https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md#window_descriptor
-        size_t window_base = (size_t)1 << (10 + exponent);
-        size_t window_add = (window_base / 8) * mantissa;
-        header->window_size = window_base + window_add;
-    }
-
-    // decode dictionary id if it exists
-    if (dictionary_id_flag) {
-        // "This is a variable size field, which contains the ID of the
-        // dictionary required to properly decode the frame. Note that this
-        // field is optional. When it's not present, it's up to the caller to
-        // make sure it uses the correct dictionary. Format is little-endian."
-        const int bytes_array[] = {0, 1, 2, 4};
-        const int bytes = bytes_array[dictionary_id_flag];
-
-        header->dictionary_id = IO_read_bits(in, bytes * 8);
-    } else {
-        header->dictionary_id = 0;
-    }
-
-    // decode frame content size if it exists
-    if (single_segment_flag || frame_content_size_flag) {
-        // "This is the original (uncompressed) size. This information is
-        // optional. The Field_Size is provided according to value of
-        // Frame_Content_Size_flag. The Field_Size can be equal to 0 (not
-        // present), 1, 2, 4 or 8 bytes. Format is little-endian."
-        //
-        // if frame_content_size_flag == 0 but single_segment_flag is set, we
-        // still have a 1 byte field
-        const int bytes_array[] = {1, 2, 4, 8};
-        const int bytes = bytes_array[frame_content_size_flag];
-
-        header->frame_content_size = IO_read_bits(in, bytes * 8);
-        if (bytes == 2) {
-            // "When Field_Size is 2, the offset of 256 is added."
-            header->frame_content_size += 256;
-        }
-    } else {
-        header->frame_content_size = 0;
-    }
-
-    if (single_segment_flag) {
-        // "The Window_Descriptor byte is optional. It is absent when
-        // Single_Segment_flag is set. In this case, the maximum back-reference
-        // distance is the content size itself, which can be any value from 1 to
-        // 2^64-1 bytes (16 EB)."
-        header->window_size = header->frame_content_size;
-    }
-}
-
-/// A dictionary acts as initializing values for the frame context before
-/// decompression, so we implement it by applying it's predetermined
-/// tables and content to the context before beginning decompression
-static void frame_context_apply_dict(frame_context_t *const ctx,
-                                     const dictionary_t *const dict) {
-    // If the content pointer is NULL then it must be an empty dict
-    if (!dict || !dict->content)
-        return;
-
-    // If the requested dictionary_id is non-zero, the correct dictionary must
-    // be present
-    if (ctx->header.dictionary_id != 0 &&
-        ctx->header.dictionary_id != dict->dictionary_id) {
-        ERROR("Wrong dictionary provided");
-    }
-
-    // Copy the dict content to the context for references during sequence
-    // execution
-    ctx->dict_content = dict->content;
-    ctx->dict_content_len = dict->content_size;
-
-    // If it's a formatted dict copy the precomputed tables in so they can
-    // be used in the table repeat modes
-    if (dict->dictionary_id != 0) {
-        // Deep copy the entropy tables so they can be freed independently of
-        // the dictionary struct
-        HUF_copy_dtable(&ctx->literals_dtable, &dict->literals_dtable);
-        FSE_copy_dtable(&ctx->ll_dtable, &dict->ll_dtable);
-        FSE_copy_dtable(&ctx->of_dtable, &dict->of_dtable);
-        FSE_copy_dtable(&ctx->ml_dtable, &dict->ml_dtable);
-
-        // Copy the repeated offsets
-        memcpy(ctx->previous_offsets, dict->previous_offsets,
-               sizeof(ctx->previous_offsets));
-    }
-}
-
-/// Decompress the data from a frame block by block
-static void decompress_data(frame_context_t *const ctx, ostream_t *const out,
-                            istream_t *const in) {
-    // "A frame encapsulates one or multiple blocks. Each block can be
-    // compressed or not, and has a guaranteed maximum content size, which
-    // depends on frame parameters. Unlike frames, each block depends on
-    // previous blocks for proper decoding. However, each block can be
-    // decompressed without waiting for its successor, allowing streaming
-    // operations."
-    int last_block = 0;
-    do {
-        // "Last_Block
-        //
-        // The lowest bit signals if this block is the last one. Frame ends
-        // right after this block.
-        //
-        // Block_Type and Block_Size
-        //
-        // The next 2 bits represent the Block_Type, while the remaining 21 bits
-        // represent the Block_Size. Format is little-endian."
-        last_block = IO_read_bits(in, 1);
-        const int block_type = IO_read_bits(in, 2);
-        const size_t block_len = IO_read_bits(in, 21);
-
-        switch (block_type) {
-        case 0: {
-            // "Raw_Block - this is an uncompressed block. Block_Size is the
-            // number of bytes to read and copy."
-            const u8 *const read_ptr = IO_get_read_ptr(in, block_len);
-            u8 *const write_ptr = IO_get_write_ptr(out, block_len);
-
-            // Copy the raw data into the output
-            memcpy(write_ptr, read_ptr, block_len);
-
-            ctx->current_total_output += block_len;
-            break;
-        }
-        case 1: {
-            // "RLE_Block - this is a single byte, repeated N times. In which
-            // case, Block_Size is the size to regenerate, while the
-            // "compressed" block is just 1 byte (the byte to repeat)."
-            const u8 *const read_ptr = IO_get_read_ptr(in, 1);
-            u8 *const write_ptr = IO_get_write_ptr(out, block_len);
-
-            // Copy `block_len` copies of `read_ptr[0]` to the output
-            memset(write_ptr, read_ptr[0], block_len);
-
-            ctx->current_total_output += block_len;
-            break;
-        }
-        case 2: {
-            // "Compressed_Block - this is a Zstandard compressed block,
-            // detailed in another section of this specification. Block_Size is
-            // the compressed size.
-
-            // Create a sub-stream for the block
-            istream_t block_stream = IO_make_sub_istream(in, block_len);
-            decompress_block(ctx, out, &block_stream);
-            break;
-        }
-        case 3:
-            // "Reserved - this is not a block. This value cannot be used with
-            // current version of this specification."
-            CORRUPTION();
-            break;
-        default:
-            IMPOSSIBLE();
-        }
-    } while (!last_block);
-
-    if (ctx->header.content_checksum_flag) {
-        // This program does not support checking the checksum, so skip over it
-        // if it's present
-        IO_advance_input(in, 4);
-    }
-}
-/******* END FRAME DECODING ***************************************************/
-
-/******* BLOCK DECOMPRESSION **************************************************/
-static void decompress_block(frame_context_t *const ctx, ostream_t *const out,
-                             istream_t *const in) {
-    // "A compressed block consists of 2 sections :
-    //
-    // Literals_Section
-    // Sequences_Section"
-
-
-    // Part 1: decode the literals block
-    u8 *literals = NULL;
-    const size_t literals_size = decode_literals(ctx, in, &literals);
-
-    // Part 2: decode the sequences block
-    sequence_command_t *sequences = NULL;
-    const size_t num_sequences =
-        decode_sequences(ctx, in, &sequences);
-
-    // Part 3: combine literals and sequence commands to generate output
-    execute_sequences(ctx, out, literals, literals_size, sequences,
-                      num_sequences);
-    free(literals);
-    free(sequences);
-}
-/******* END BLOCK DECOMPRESSION **********************************************/
-
-/******* LITERALS DECODING ****************************************************/
-static size_t decode_literals_simple(istream_t *const in, u8 **const literals,
-                                     const int block_type,
-                                     const int size_format);
-static size_t decode_literals_compressed(frame_context_t *const ctx,
-                                         istream_t *const in,
-                                         u8 **const literals,
-                                         const int block_type,
-                                         const int size_format);
-static void decode_huf_table(HUF_dtable *const dtable, istream_t *const in);
-static void fse_decode_hufweights(ostream_t *weights, istream_t *const in,
-                                    int *const num_symbs);
-
-static size_t decode_literals(frame_context_t *const ctx, istream_t *const in,
-                              u8 **const literals) {
-    // "Literals can be stored uncompressed or compressed using Huffman prefix
-    // codes. When compressed, an optional tree description can be present,
-    // followed by 1 or 4 streams."
-    //
-    // "Literals_Section_Header
-    //
-    // Header is in charge of describing how literals are packed. It's a
-    // byte-aligned variable-size bitfield, ranging from 1 to 5 bytes, using
-    // little-endian convention."
-    //
-    // "Literals_Block_Type
-    //
-    // This field uses 2 lowest bits of first byte, describing 4 different block
-    // types"
-    //
-    // size_format takes between 1 and 2 bits
-    int block_type = IO_read_bits(in, 2);
-    int size_format = IO_read_bits(in, 2);
-
-    if (block_type <= 1) {
-        // Raw or RLE literals block
-        return decode_literals_simple(in, literals, block_type,
-                                      size_format);
-    } else {
-        // Huffman compressed literals
-        return decode_literals_compressed(ctx, in, literals, block_type,
-                                          size_format);
-    }
-}
-
-/// Decodes literals blocks in raw or RLE form
-static size_t decode_literals_simple(istream_t *const in, u8 **const literals,
-                                     const int block_type,
-                                     const int size_format) {
-    size_t size;
-    switch (size_format) {
-    // These cases are in the form ?0
-    // In this case, the ? bit is actually part of the size field
-    case 0:
-    case 2:
-        // "Size_Format uses 1 bit. Regenerated_Size uses 5 bits (0-31)."
-        IO_rewind_bits(in, 1);
-        size = IO_read_bits(in, 5);
-        break;
-    case 1:
-        // "Size_Format uses 2 bits. Regenerated_Size uses 12 bits (0-4095)."
-        size = IO_read_bits(in, 12);
-        break;
-    case 3:
-        // "Size_Format uses 2 bits. Regenerated_Size uses 20 bits (0-1048575)."
-        size = IO_read_bits(in, 20);
-        break;
-    default:
-        // Size format is in range 0-3
-        IMPOSSIBLE();
-    }
-
-    if (size > MAX_LITERALS_SIZE) {
-        CORRUPTION();
-    }
-
-    *literals = malloc(size);
-    if (!*literals) {
-        BAD_ALLOC();
-    }
-
-    switch (block_type) {
-    case 0: {
-        // "Raw_Literals_Block - Literals are stored uncompressed."
-        const u8 *const read_ptr = IO_get_read_ptr(in, size);
-        memcpy(*literals, read_ptr, size);
-        break;
-    }
-    case 1: {
-        // "RLE_Literals_Block - Literals consist of a single byte value repeated N times."
-        const u8 *const read_ptr = IO_get_read_ptr(in, 1);
-        memset(*literals, read_ptr[0], size);
-        break;
-    }
-    default:
-        IMPOSSIBLE();
-    }
-
-    return size;
-}
-
-/// Decodes Huffman compressed literals
-static size_t decode_literals_compressed(frame_context_t *const ctx,
-                                         istream_t *const in,
-                                         u8 **const literals,
-                                         const int block_type,
-                                         const int size_format) {
-    size_t regenerated_size, compressed_size;
-    // Only size_format=0 has 1 stream, so default to 4
-    int num_streams = 4;
-    switch (size_format) {
-    case 0:
-        // "A single stream. Both Compressed_Size and Regenerated_Size use 10
-        // bits (0-1023)."
-        num_streams = 1;
-    // Fall through as it has the same size format
-    case 1:
-        // "4 streams. Both Compressed_Size and Regenerated_Size use 10 bits
-        // (0-1023)."
-        regenerated_size = IO_read_bits(in, 10);
-        compressed_size = IO_read_bits(in, 10);
-        break;
-    case 2:
-        // "4 streams. Both Compressed_Size and Regenerated_Size use 14 bits
-        // (0-16383)."
-        regenerated_size = IO_read_bits(in, 14);
-        compressed_size = IO_read_bits(in, 14);
-        break;
-    case 3:
-        // "4 streams. Both Compressed_Size and Regenerated_Size use 18 bits
-        // (0-262143)."
-        regenerated_size = IO_read_bits(in, 18);
-        compressed_size = IO_read_bits(in, 18);
-        break;
-    default:
-        // Impossible
-        IMPOSSIBLE();
-    }
-    if (regenerated_size > MAX_LITERALS_SIZE ||
-        compressed_size >= regenerated_size) {
-        CORRUPTION();
-    }
-
-    *literals = malloc(regenerated_size);
-    if (!*literals) {
-        BAD_ALLOC();
-    }
-
-    ostream_t lit_stream = IO_make_ostream(*literals, regenerated_size);
-    istream_t huf_stream = IO_make_sub_istream(in, compressed_size);
-
-    if (block_type == 2) {
-        // Decode the provided Huffman table
-        // "This section is only present when Literals_Block_Type type is
-        // Compressed_Literals_Block (2)."
-
-        HUF_free_dtable(&ctx->literals_dtable);
-        decode_huf_table(&ctx->literals_dtable, &huf_stream);
-    } else {
-        // If the previous Huffman table is being repeated, ensure it exists
-        if (!ctx->literals_dtable.symbols) {
-            CORRUPTION();
-        }
-    }
-
-    size_t symbols_decoded;
-    if (num_streams == 1) {
-        symbols_decoded = HUF_decompress_1stream(&ctx->literals_dtable, &lit_stream, &huf_stream);
-    } else {
-        symbols_decoded = HUF_decompress_4stream(&ctx->literals_dtable, &lit_stream, &huf_stream);
-    }
-
-    if (symbols_decoded != regenerated_size) {
-        CORRUPTION();
-    }
-
-    return regenerated_size;
-}
-
-// Decode the Huffman table description
-static void decode_huf_table(HUF_dtable *const dtable, istream_t *const in) {
-    // "All literal values from zero (included) to last present one (excluded)
-    // are represented by Weight with values from 0 to Max_Number_of_Bits."
-
-    // "This is a single byte value (0-255), which describes how to decode the list of weights."
-    const u8 header = IO_read_bits(in, 8);
-
-    u8 weights[HUF_MAX_SYMBS];
-    memset(weights, 0, sizeof(weights));
-
-    int num_symbs;
-
-    if (header >= 128) {
-        // "This is a direct representation, where each Weight is written
-        // directly as a 4 bits field (0-15). The full representation occupies
-        // ((Number_of_Symbols+1)/2) bytes, meaning it uses a last full byte
-        // even if Number_of_Symbols is odd. Number_of_Symbols = headerByte -
-        // 127"
-        num_symbs = header - 127;
-        const size_t bytes = (num_symbs + 1) / 2;
-
-        const u8 *const weight_src = IO_get_read_ptr(in, bytes);
-
-        for (int i = 0; i < num_symbs; i++) {
-            // "They are encoded forward, 2
-            // weights to a byte with the first weight taking the top four bits
-            // and the second taking the bottom four (e.g. the following
-            // operations could be used to read the weights: Weight[0] =
-            // (Byte[0] >> 4), Weight[1] = (Byte[0] & 0xf), etc.)."
-            if (i % 2 == 0) {
-                weights[i] = weight_src[i / 2] >> 4;
-            } else {
-                weights[i] = weight_src[i / 2] & 0xf;
-            }
-        }
-    } else {
-        // The weights are FSE encoded, decode them before we can construct the
-        // table
-        istream_t fse_stream = IO_make_sub_istream(in, header);
-        ostream_t weight_stream = IO_make_ostream(weights, HUF_MAX_SYMBS);
-        fse_decode_hufweights(&weight_stream, &fse_stream, &num_symbs);
-    }
-
-    // Construct the table using the decoded weights
-    HUF_init_dtable_usingweights(dtable, weights, num_symbs);
-}
-
-static void fse_decode_hufweights(ostream_t *weights, istream_t *const in,
-                                    int *const num_symbs) {
-    const int MAX_ACCURACY_LOG = 7;
-
-    FSE_dtable dtable;
-
-    // "An FSE bitstream starts by a header, describing probabilities
-    // distribution. It will create a Decoding Table. For a list of Huffman
-    // weights, maximum accuracy is 7 bits."
-    FSE_decode_header(&dtable, in, MAX_ACCURACY_LOG);
-
-    // Decode the weights
-    *num_symbs = FSE_decompress_interleaved2(&dtable, weights, in);
-
-    FSE_free_dtable(&dtable);
-}
-/******* END LITERALS DECODING ************************************************/
-
-/******* SEQUENCE DECODING ****************************************************/
-/// The combination of FSE states needed to decode sequences
-typedef struct {
-    FSE_dtable ll_table;
-    FSE_dtable of_table;
-    FSE_dtable ml_table;
-
-    u16 ll_state;
-    u16 of_state;
-    u16 ml_state;
-} sequence_states_t;
-
-/// Different modes to signal to decode_seq_tables what to do
-typedef enum {
-    seq_literal_length = 0,
-    seq_offset = 1,
-    seq_match_length = 2,
-} seq_part_t;
-
-typedef enum {
-    seq_predefined = 0,
-    seq_rle = 1,
-    seq_fse = 2,
-    seq_repeat = 3,
-} seq_mode_t;
-
-/// The predefined FSE distribution tables for `seq_predefined` mode
-static const i16 SEQ_LITERAL_LENGTH_DEFAULT_DIST[36] = {
-    4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1,  1,  2,  2,
-    2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1, -1, -1, -1, -1};
-static const i16 SEQ_OFFSET_DEFAULT_DIST[29] = {
-    1, 1, 1, 1, 1, 1, 2, 2, 2, 1,  1,  1,  1,  1, 1,
-    1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1};
-static const i16 SEQ_MATCH_LENGTH_DEFAULT_DIST[53] = {
-    1, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1,  1,  1,  1,  1,  1,  1, 1,
-    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,  1,  1,  1,  1,  1,  1, 1,
-    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1};
-
-/// The sequence decoding baseline and number of additional bits to read/add
-/// https://github.com/facebook/zstd/blob/dev/doc/zstd_compression_format.md#the-codes-for-literals-lengths-match-lengths-and-offsets
-static const u32 SEQ_LITERAL_LENGTH_BASELINES[36] = {
-    0,  1,  2,   3,   4,   5,    6,    7,    8,    9,     10,    11,
-    12, 13, 14,  15,  16,  18,   20,   22,   24,   28,    32,    40,
-    48, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65538};
-static const u8 SEQ_LITERAL_LENGTH_EXTRA_BITS[36] = {
-    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  1,  1,
-    1, 1, 2, 2, 3, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
-
-static const u32 SEQ_MATCH_LENGTH_BASELINES[53] = {
-    3,  4,   5,   6,   7,    8,    9,    10,   11,    12,    13,   14, 15, 16,
-    17, 18,  19,  20,  21,   22,   23,   24,   25,    26,    27,   28, 29, 30,
-    31, 32,  33,  34,  35,   37,   39,   41,   43,    47,    51,   59, 67, 83,
-    99, 131, 259, 515, 1027, 2051, 4099, 8195, 16387, 32771, 65539};
-static const u8 SEQ_MATCH_LENGTH_EXTRA_BITS[53] = {
-    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  0, 0,
-    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  1,  1,  1, 1,
-    2, 2, 3, 3, 4, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
-
-/// Offset decoding is simpler so we just need a maximum code value
-static const u8 SEQ_MAX_CODES[3] = {35, -1, 52};
-
-static void decompress_sequences(frame_context_t *const ctx,
-                                 istream_t *const in,
-                                 sequence_command_t *const sequences,
-                                 const size_t num_sequences);
-static sequence_command_t decode_sequence(sequence_states_t *const state,
-                                          const u8 *const src,
-                                          i64 *const offset);
-static void decode_seq_table(FSE_dtable *const table, istream_t *const in,
-                               const seq_part_t type, const seq_mode_t mode);
-
-static size_t decode_sequences(frame_context_t *const ctx, istream_t *in,
-                               sequence_command_t **const sequences) {
-    // "A compressed block is a succession of sequences . A sequence is a
-    // literal copy command, followed by a match copy command. A literal copy
-    // command specifies a length. It is the number of bytes to be copied (or
-    // extracted) from the literal section. A match copy command specifies an
-    // offset and a length. The offset gives the position to copy from, which
-    // can be within a previous block."
-
-    size_t num_sequences;
-
-    // "Number_of_Sequences
-    //
-    // This is a variable size field using between 1 and 3 bytes. Let's call its
-    // first byte byte0."
-    u8 header = IO_read_bits(in, 8);
-    if (header == 0) {
-        // "There are no sequences. The sequence section stops there.
-        // Regenerated content is defined entirely by literals section."
-        *sequences = NULL;
-        return 0;
-    } else if (header < 128) {
-        // "Number_of_Sequences = byte0 . Uses 1 byte."
-        num_sequences = header;
-    } else if (header < 255) {
-        // "Number_of_Sequences = ((byte0-128) << 8) + byte1 . Uses 2 bytes."
-        num_sequences = ((header - 128) << 8) + IO_read_bits(in, 8);
-    } else {
-        // "Number_of_Sequences = byte1 + (byte2<<8) + 0x7F00 . Uses 3 bytes."
-        num_sequences = IO_read_bits(in, 16) + 0x7F00;
-    }
-
-    *sequences = malloc(num_sequences * sizeof(sequence_command_t));
-    if (!*sequences) {
-        BAD_ALLOC();
-    }
-
-    decompress_sequences(ctx, in, *sequences, num_sequences);
-    return num_sequences;
-}
-
-/// Decompress the FSE encoded sequence commands
-static void decompress_sequences(frame_context_t *const ctx, istream_t *in,
-                                 sequence_command_t *const sequences,
-                                 const size_t num_sequences) {
-    // "The Sequences_Section regroup all symbols required to decode commands.
-    // There are 3 symbol types : literals lengths, offsets and match lengths.
-    // They are encoded together, interleaved, in a single bitstream."
-
-    // "Symbol compression modes
-    //
-    // This is a single byte, defining the compression mode of each symbol
-    // type."
-    //
-    // Bit number : Field name
-    // 7-6        : Literals_Lengths_Mode
-    // 5-4        : Offsets_Mode
-    // 3-2        : Match_Lengths_Mode
-    // 1-0        : Reserved
-    u8 compression_modes = IO_read_bits(in, 8);
-
-    if ((compression_modes & 3) != 0) {
-        // Reserved bits set
-        CORRUPTION();
-    }
-
-    // "Following the header, up to 3 distribution tables can be described. When
-    // present, they are in this order :
-    //
-    // Literals lengths
-    // Offsets
-    // Match Lengths"
-    // Update the tables we have stored in the context
-    decode_seq_table(&ctx->ll_dtable, in, seq_literal_length,
-                     (compression_modes >> 6) & 3);
-
-    decode_seq_table(&ctx->of_dtable, in, seq_offset,
-                     (compression_modes >> 4) & 3);
-
-    decode_seq_table(&ctx->ml_dtable, in, seq_match_length,
-                     (compression_modes >> 2) & 3);
-
-
-    sequence_states_t states;
-
-    // Initialize the decoding tables
-    {
-        states.ll_table = ctx->ll_dtable;
-        states.of_table = ctx->of_dtable;
-        states.ml_table = ctx->ml_dtable;
-    }
-
-    const size_t len = IO_istream_len(in);
-    const u8 *const src = IO_get_read_ptr(in, len);
-
-    // "After writing the last bit containing information, the compressor writes
-    // a single 1-bit and then fills the byte with 0-7 0 bits of padding."
-    const int padding = 8 - highest_set_bit(src[len - 1]);
-    // The offset starts at the end because FSE streams are read backwards
-    i64 bit_offset = len * 8 - padding;
-
-    // "The bitstream starts with initial state values, each using the required
-    // number of bits in their respective accuracy, decoded previously from
-    // their normalized distribution.
-    //
-    // It starts by Literals_Length_State, followed by Offset_State, and finally
-    // Match_Length_State."
-    FSE_init_state(&states.ll_table, &states.ll_state, src, &bit_offset);
-    FSE_init_state(&states.of_table, &states.of_state, src, &bit_offset);
-    FSE_init_state(&states.ml_table, &states.ml_state, src, &bit_offset);
-
-    for (size_t i = 0; i < num_sequences; i++) {
-        // Decode sequences one by one
-        sequences[i] = decode_sequence(&states, src, &bit_offset);
-    }
-
-    if (bit_offset != 0) {
-        CORRUPTION();
-    }
-}
-
-// Decode a single sequence and update the state
-static sequence_command_t decode_sequence(sequence_states_t *const states,
-                                          const u8 *const src,
-                                          i64 *const offset) {
-    // "Each symbol is a code in its own context, which specifies Baseline and
-    // Number_of_Bits to add. Codes are FSE compressed, and interleaved with raw
-    // additional bits in the same bitstream."
-
-    // Decode symbols, but don't update states
-    const u8 of_code = FSE_peek_symbol(&states->of_table, states->of_state);
-    const u8 ll_code = FSE_peek_symbol(&states->ll_table, states->ll_state);
-    const u8 ml_code = FSE_peek_symbol(&states->ml_table, states->ml_state);
-
-    // Offset doesn't need a max value as it's not decoded using a table
-    if (ll_code > SEQ_MAX_CODES[seq_literal_length] ||
-        ml_code > SEQ_MAX_CODES[seq_match_length]) {
-        CORRUPTION();
-    }
-
-    // Read the interleaved bits
-    sequence_command_t seq;
-    // "Decoding starts by reading the Number_of_Bits required to decode Offset.
-    // It then does the same for Match_Length, and then for Literals_Length."
-    seq.offset = ((u32)1 << of_code) + STREAM_read_bits(src, of_code, offset);
-
-    seq.match_length =
-        SEQ_MATCH_LENGTH_BASELINES[ml_code] +
-        STREAM_read_bits(src, SEQ_MATCH_LENGTH_EXTRA_BITS[ml_code], offset);
-
-    seq.literal_length =
-        SEQ_LITERAL_LENGTH_BASELINES[ll_code] +
-        STREAM_read_bits(src, SEQ_LITERAL_LENGTH_EXTRA_BITS[ll_code], offset);
-
-    // "If it is not the last sequence in the block, the next operation is to
-    // update states. Using the rules pre-calculated in the decoding tables,
-    // Literals_Length_State is updated, followed by Match_Length_State, and
-    // then Offset_State."
-    // If the stream is complete don't read bits to update state
-    if (*offset != 0) {
-        FSE_update_state(&states->ll_table, &states->ll_state, src, offset);
-        FSE_update_state(&states->ml_table, &states->ml_state, src, offset);
-        FSE_update_state(&states->of_table, &states->of_state, src, offset);
-    }
-
-    return seq;
-}
-
-/// Given a sequence part and table mode, decode the FSE distribution
-/// Errors if the mode is `seq_repeat` without a pre-existing table in `table`
-static void decode_seq_table(FSE_dtable *const table, istream_t *const in,
-                             const seq_part_t type, const seq_mode_t mode) {
-    // Constant arrays indexed by seq_part_t
-    const i16 *const default_distributions[] = {SEQ_LITERAL_LENGTH_DEFAULT_DIST,
-                                                SEQ_OFFSET_DEFAULT_DIST,
-                                                SEQ_MATCH_LENGTH_DEFAULT_DIST};
-    const size_t default_distribution_lengths[] = {36, 29, 53};
-    const size_t default_distribution_accuracies[] = {6, 5, 6};
-
-    const size_t max_accuracies[] = {9, 8, 9};
-
-    if (mode != seq_repeat) {
-        // Free old one before overwriting
-        FSE_free_dtable(table);
-    }
-
-    switch (mode) {
-    case seq_predefined: {
-        // "Predefined_Mode : uses a predefined distribution table."
-        const i16 *distribution = default_distributions[type];
-        const size_t symbs = default_distribution_lengths[type];
-        const size_t accuracy_log = default_distribution_accuracies[type];
-
-        FSE_init_dtable(table, distribution, symbs, accuracy_log);
-        break;
-    }
-    case seq_rle: {
-        // "RLE_Mode : it's a single code, repeated Number_of_Sequences times."
-        const u8 symb = IO_get_read_ptr(in, 1)[0];
-        FSE_init_dtable_rle(table, symb);
-        break;
-    }
-    case seq_fse: {
-        // "FSE_Compressed_Mode : standard FSE compression. A distribution table
-        // will be present "
-        FSE_decode_header(table, in, max_accuracies[type]);
-        break;
-    }
-    case seq_repeat:
-        // "Repeat_Mode : re-use distribution table from previous compressed
-        // block."
-        // Nothing to do here, table will be unchanged
-        if (!table->symbols) {
-            // This mode is invalid if we don't already have a table
-            CORRUPTION();
-        }
-        break;
-    default:
-        // Impossible, as mode is from 0-3
-        IMPOSSIBLE();
-        break;
-    }
-
-}
-/******* END SEQUENCE DECODING ************************************************/
-
-/******* SEQUENCE EXECUTION ***************************************************/
-static void execute_sequences(frame_context_t *const ctx, ostream_t *const out,
-                              const u8 *const literals,
-                              const size_t literals_len,
-                              const sequence_command_t *const sequences,
-                              const size_t num_sequences) {
-    istream_t litstream = IO_make_istream(literals, literals_len);
-
-    u64 *const offset_hist = ctx->previous_offsets;
-    size_t total_output = ctx->current_total_output;
-
-    for (size_t i = 0; i < num_sequences; i++) {
-        const sequence_command_t seq = sequences[i];
-        {
-            const u32 literals_size = copy_literals(seq.literal_length, &litstream, out);
-            total_output += literals_size;
-        }
-
-        size_t const offset = compute_offset(seq, offset_hist);
-
-        size_t const match_length = seq.match_length;
-
-        execute_match_copy(ctx, offset, match_length, total_output, out);
-
-        total_output += match_length;
-    }
-
-    // Copy any leftover literals
-    {
-        size_t len = IO_istream_len(&litstream);
-        copy_literals(len, &litstream, out);
-        total_output += len;
-    }
-
-    ctx->current_total_output = total_output;
-}
-
-static u32 copy_literals(const size_t literal_length, istream_t *litstream,
-                         ostream_t *const out) {
-    // If the sequence asks for more literals than are left, the
-    // sequence must be corrupted
-    if (literal_length > IO_istream_len(litstream)) {
-        CORRUPTION();
-    }
-
-    u8 *const write_ptr = IO_get_write_ptr(out, literal_length);
-    const u8 *const read_ptr =
-         IO_get_read_ptr(litstream, literal_length);
-    // Copy literals to output
-    memcpy(write_ptr, read_ptr, literal_length);
-
-    return literal_length;
-}
-
-static size_t compute_offset(sequence_command_t seq, u64 *const offset_hist) {
-    size_t offset;
-    // Offsets are special, we need to handle the repeat offsets
-    if (seq.offset <= 3) {
-        // "The first 3 values define a repeated offset and we will call
-        // them Repeated_Offset1, Repeated_Offset2, and Repeated_Offset3.
-        // They are sorted in recency order, with Repeated_Offset1 meaning
-        // 'most recent one'".
-
-        // Use 0 indexing for the array
-        u32 idx = seq.offset - 1;
-        if (seq.literal_length == 0) {
-            // "There is an exception though, when current sequence's
-            // literals length is 0. In this case, repeated offsets are
-            // shifted by one, so Repeated_Offset1 becomes Repeated_Offset2,
-            // Repeated_Offset2 becomes Repeated_Offset3, and
-            // Repeated_Offset3 becomes Repeated_Offset1 - 1_byte."
-            idx++;
-        }
-
-        if (idx == 0) {
-            offset = offset_hist[0];
-        } else {
-            // If idx == 3 then literal length was 0 and the offset was 3,
-            // as per the exception listed above
-            offset = idx < 3 ? offset_hist[idx] : offset_hist[0] - 1;
-
-            // If idx == 1 we don't need to modify offset_hist[2], since
-            // we're using the second-most recent code
-            if (idx > 1) {
-                offset_hist[2] = offset_hist[1];
-            }
-            offset_hist[1] = offset_hist[0];
-            offset_hist[0] = offset;
-        }
-    } else {
-        // When it's not a repeat offset:
-        // "if (Offset_Value > 3) offset = Offset_Value - 3;"
-        offset = seq.offset - 3;
-
-        // Shift back history
-        offset_hist[2] = offset_hist[1];
-        offset_hist[1] = offset_hist[0];
-        offset_hist[0] = offset;
-    }
-    return offset;
-}
-
-static void execute_match_copy(frame_context_t *const ctx, size_t offset,
-                              size_t match_length, size_t total_output,
-                              ostream_t *const out) {
-    u8 *write_ptr = IO_get_write_ptr(out, match_length);
-    if (total_output <= ctx->header.window_size) {
-        // In this case offset might go back into the dictionary
-        if (offset > total_output + ctx->dict_content_len) {
-            // The offset goes beyond even the dictionary
-            CORRUPTION();
-        }
-
-        if (offset > total_output) {
-            // "The rest of the dictionary is its content. The content act
-            // as a "past" in front of data to compress or decompress, so it
-            // can be referenced in sequence commands."
-            const size_t dict_copy =
-                MIN(offset - total_output, match_length);
-            const size_t dict_offset =
-                ctx->dict_content_len - (offset - total_output);
-
-            memcpy(write_ptr, ctx->dict_content + dict_offset, dict_copy);
-            write_ptr += dict_copy;
-            match_length -= dict_copy;
-        }
-    } else if (offset > ctx->header.window_size) {
-        CORRUPTION();
-    }
-
-    // We must copy byte by byte because the match length might be larger
-    // than the offset
-    // ex: if the output so far was "abc", a command with offset=3 and
-    // match_length=6 would produce "abcabcabc" as the new output
-    for (size_t j = 0; j < match_length; j++) {
-        *write_ptr = *(write_ptr - offset);
-        write_ptr++;
-    }
-}
-/******* END SEQUENCE EXECUTION ***********************************************/
-
-/******* OUTPUT SIZE COUNTING *************************************************/
-/// Get the decompressed size of an input stream so memory can be allocated in
-/// advance.
-/// This implementation assumes `src` points to a single ZSTD-compressed frame
-size_t ZSTD_get_decompressed_size(const void *src, const size_t src_len) {
-    istream_t in = IO_make_istream(src, src_len);
-
-    // get decompressed size from ZSTD frame header
-    {
-        const u32 magic_number = IO_read_bits(&in, 32);
-
-        if (magic_number == 0xFD2FB528U) {
-            // ZSTD frame
-            frame_header_t header;
-            parse_frame_header(&header, &in);
-
-            if (header.frame_content_size == 0 && !header.single_segment_flag) {
-                // Content size not provided, we can't tell
-                return -1;
-            }
-
-            return header.frame_content_size;
-        } else {
-            // not a real frame or skippable frame
-            ERROR("ZSTD frame magic number did not match");
-        }
-    }
-}
-/******* END OUTPUT SIZE COUNTING *********************************************/
-
-/******* DICTIONARY PARSING ***************************************************/
-#define DICT_SIZE_ERROR() ERROR("Dictionary size cannot be less than 8 bytes")
-#define NULL_SRC() ERROR("Tried to create dictionary with pointer to null src");
-
-dictionary_t* create_dictionary() {
-    dictionary_t* dict = calloc(1, sizeof(dictionary_t));
-    if (!dict) {
-        BAD_ALLOC();
-    }
-    return dict;
-}
-
-static void init_dictionary_content(dictionary_t *const dict,
-                                    istream_t *const in);
-
-void parse_dictionary(dictionary_t *const dict, const void *src,
-                             size_t src_len) {
-    const u8 *byte_src = (const u8 *)src;
-    memset(dict, 0, sizeof(dictionary_t));
-    if (src == NULL) { /* cannot initialize dictionary with null src */
-        NULL_SRC();
-    }
-    if (src_len < 8) {
-        DICT_SIZE_ERROR();
-    }
-
-    istream_t in = IO_make_istream(byte_src, src_len);
-
-    const u32 magic_number = IO_read_bits(&in, 32);
-    if (magic_number != 0xEC30A437) {
-        // raw content dict
-        IO_rewind_bits(&in, 32);
-        init_dictionary_content(dict, &in);
-        return;
-    }
-
-    dict->dictionary_id = IO_read_bits(&in, 32);
-
-    // "Entropy_Tables : following the same format as the tables in compressed
-    // blocks. They are stored in following order : Huffman tables for literals,
-    // FSE table for offsets, FSE table for match lengths, and FSE table for
-    // literals lengths. It's finally followed by 3 offset values, populating
-    // recent offsets (instead of using {1,4,8}), stored in order, 4-bytes
-    // little-endian each, for a total of 12 bytes. Each recent offset must have
-    // a value < dictionary size."
-    decode_huf_table(&dict->literals_dtable, &in);
-    decode_seq_table(&dict->of_dtable, &in, seq_offset, seq_fse);
-    decode_seq_table(&dict->ml_dtable, &in, seq_match_length, seq_fse);
-    decode_seq_table(&dict->ll_dtable, &in, seq_literal_length, seq_fse);
-
-    // Read in the previous offset history
-    dict->previous_offsets[0] = IO_read_bits(&in, 32);
-    dict->previous_offsets[1] = IO_read_bits(&in, 32);
-    dict->previous_offsets[2] = IO_read_bits(&in, 32);
-
-    // Ensure the provided offsets aren't too large
-    // "Each recent offset must have a value < dictionary size."
-    for (int i = 0; i < 3; i++) {
-        if (dict->previous_offsets[i] > src_len) {
-            ERROR("Dictionary corrupted");
-        }
-    }
-
-    // "Content : The rest of the dictionary is its content. The content act as
-    // a "past" in front of data to compress or decompress, so it can be
-    // referenced in sequence commands."
-    init_dictionary_content(dict, &in);
-}
-
-static void init_dictionary_content(dictionary_t *const dict,
-                                    istream_t *const in) {
-    // Copy in the content
-    dict->content_size = IO_istream_len(in);
-    dict->content = malloc(dict->content_size);
-    if (!dict->content) {
-        BAD_ALLOC();
-    }
-
-    const u8 *const content = IO_get_read_ptr(in, dict->content_size);
-
-    memcpy(dict->content, content, dict->content_size);
-}
-
-/// Free an allocated dictionary
-void free_dictionary(dictionary_t *const dict) {
-    HUF_free_dtable(&dict->literals_dtable);
-    FSE_free_dtable(&dict->ll_dtable);
-    FSE_free_dtable(&dict->of_dtable);
-    FSE_free_dtable(&dict->ml_dtable);
-
-    free(dict->content);
-
-    memset(dict, 0, sizeof(dictionary_t));
-
-    free(dict);
-}
-/******* END DICTIONARY PARSING ***********************************************/
-
-/******* IO STREAM OPERATIONS *************************************************/
-#define UNALIGNED() ERROR("Attempting to operate on a non-byte aligned stream")
-/// Reads `num` bits from a bitstream, and updates the internal offset
-static inline u64 IO_read_bits(istream_t *const in, const int num_bits) {
-    if (num_bits > 64 || num_bits <= 0) {
-        ERROR("Attempt to read an invalid number of bits");
-    }
-
-    const size_t bytes = (num_bits + in->bit_offset + 7) / 8;
-    const size_t full_bytes = (num_bits + in->bit_offset) / 8;
-    if (bytes > in->len) {
-        INP_SIZE();
-    }
-
-    const u64 result = read_bits_LE(in->ptr, num_bits, in->bit_offset);
-
-    in->bit_offset = (num_bits + in->bit_offset) % 8;
-    in->ptr += full_bytes;
-    in->len -= full_bytes;
-
-    return result;
-}
-
-/// If a non-zero number of bits have been read from the current byte, advance
-/// the offset to the next byte
-static inline void IO_rewind_bits(istream_t *const in, int num_bits) {
-    if (num_bits < 0) {
-        ERROR("Attempting to rewind stream by a negative number of bits");
-    }
-
-    // move the offset back by `num_bits` bits
-    const int new_offset = in->bit_offset - num_bits;
-    // determine the number of whole bytes we have to rewind, rounding up to an
-    // integer number (e.g. if `new_offset == -5`, `bytes == 1`)
-    const i64 bytes = -(new_offset - 7) / 8;
-
-    in->ptr -= bytes;
-    in->len += bytes;
-    // make sure the resulting `bit_offset` is positive, as mod in C does not
-    // convert numbers from negative to positive (e.g. -22 % 8 == -6)
-    in->bit_offset = ((new_offset % 8) + 8) % 8;
-}
-
-/// If the remaining bits in a byte will be unused, advance to the end of the
-/// byte
-static inline void IO_align_stream(istream_t *const in) {
-    if (in->bit_offset != 0) {
-        if (in->len == 0) {
-            INP_SIZE();
-        }
-        in->ptr++;
-        in->len--;
-        in->bit_offset = 0;
-    }
-}
-
-/// Write the given byte into the output stream
-static inline void IO_write_byte(ostream_t *const out, u8 symb) {
-    if (out->len == 0) {
-        OUT_SIZE();
-    }
-
-    out->ptr[0] = symb;
-    out->ptr++;
-    out->len--;
-}
-
-/// Returns the number of bytes left to be read in this stream.  The stream must
-/// be byte aligned.
-static inline size_t IO_istream_len(const istream_t *const in) {
-    return in->len;
-}
-
-/// Returns a pointer where `len` bytes can be read, and advances the internal
-/// state.  The stream must be byte aligned.
-static inline const u8 *IO_get_read_ptr(istream_t *const in, size_t len) {
-    if (len > in->len) {
-        INP_SIZE();
-    }
-    if (in->bit_offset != 0) {
-        UNALIGNED();
-    }
-    const u8 *const ptr = in->ptr;
-    in->ptr += len;
-    in->len -= len;
-
-    return ptr;
-}
-/// Returns a pointer to write `len` bytes to, and advances the internal state
-static inline u8 *IO_get_write_ptr(ostream_t *const out, size_t len) {
-    if (len > out->len) {
-        OUT_SIZE();
-    }
-    u8 *const ptr = out->ptr;
-    out->ptr += len;
-    out->len -= len;
-
-    return ptr;
-}
-
-/// Advance the inner state by `len` bytes
-static inline void IO_advance_input(istream_t *const in, size_t len) {
-    if (len > in->len) {
-         INP_SIZE();
-    }
-    if (in->bit_offset != 0) {
-        UNALIGNED();
-    }
-
-    in->ptr += len;
-    in->len -= len;
-}
-
-/// Returns an `ostream_t` constructed from the given pointer and length
-static inline ostream_t IO_make_ostream(u8 *out, size_t len) {
-    return (ostream_t) { out, len };
-}
-
-/// Returns an `istream_t` constructed from the given pointer and length
-static inline istream_t IO_make_istream(const u8 *in, size_t len) {
-    return (istream_t) { in, len, 0 };
-}
-
-/// Returns an `istream_t` with the same base as `in`, and length `len`
-/// Then, advance `in` to account for the consumed bytes
-/// `in` must be byte aligned
-static inline istream_t IO_make_sub_istream(istream_t *const in, size_t len) {
-    // Consume `len` bytes of the parent stream
-    const u8 *const ptr = IO_get_read_ptr(in, len);
-
-    // Make a substream using the pointer to those `len` bytes
-    return IO_make_istream(ptr, len);
-}
-/******* END IO STREAM OPERATIONS *********************************************/
-
-/******* BITSTREAM OPERATIONS *************************************************/
-/// Read `num` bits (up to 64) from `src + offset`, where `offset` is in bits
-static inline u64 read_bits_LE(const u8 *src, const int num_bits,
-                               const size_t offset) {
-    if (num_bits > 64) {
-        ERROR("Attempt to read an invalid number of bits");
-    }
-
-    // Skip over bytes that aren't in range
-    src += offset / 8;
-    size_t bit_offset = offset % 8;
-    u64 res = 0;
-
-    int shift = 0;
-    int left = num_bits;
-    while (left > 0) {
-        u64 mask = left >= 8 ? 0xff : (((u64)1 << left) - 1);
-        // Read the next byte, shift it to account for the offset, and then mask
-        // out the top part if we don't need all the bits
-        res += (((u64)*src++ >> bit_offset) & mask) << shift;
-        shift += 8 - bit_offset;
-        left -= 8 - bit_offset;
-        bit_offset = 0;
-    }
-
-    return res;
-}
-
-/// Read bits from the end of a HUF or FSE bitstream.  `offset` is in bits, so
-/// it updates `offset` to `offset - bits`, and then reads `bits` bits from
-/// `src + offset`.  If the offset becomes negative, the extra bits at the
-/// bottom are filled in with `0` bits instead of reading from before `src`.
-static inline u64 STREAM_read_bits(const u8 *const src, const int bits,
-                                   i64 *const offset) {
-    *offset = *offset - bits;
-    size_t actual_off = *offset;
-    size_t actual_bits = bits;
-    // Don't actually read bits from before the start of src, so if `*offset <
-    // 0` fix actual_off and actual_bits to reflect the quantity to read
-    if (*offset < 0) {
-        actual_bits += *offset;
-        actual_off = 0;
-    }
-    u64 res = read_bits_LE(src, actual_bits, actual_off);
-
-    if (*offset < 0) {
-        // Fill in the bottom "overflowed" bits with 0's
-        res = -*offset >= 64 ? 0 : (res << -*offset);
-    }
-    return res;
-}
-/******* END BITSTREAM OPERATIONS *********************************************/
-
-/******* BIT COUNTING OPERATIONS **********************************************/
-/// Returns `x`, where `2^x` is the largest power of 2 less than or equal to
-/// `num`, or `-1` if `num == 0`.
-static inline int highest_set_bit(const u64 num) {
-    for (int i = 63; i >= 0; i--) {
-        if (((u64)1 << i) <= num) {
-            return i;
-        }
-    }
-    return -1;
-}
-/******* END BIT COUNTING OPERATIONS ******************************************/
-
-/******* HUFFMAN PRIMITIVES ***************************************************/
-static inline u8 HUF_decode_symbol(const HUF_dtable *const dtable,
-                                   u16 *const state, const u8 *const src,
-                                   i64 *const offset) {
-    // Look up the symbol and number of bits to read
-    const u8 symb = dtable->symbols[*state];
-    const u8 bits = dtable->num_bits[*state];
-    const u16 rest = STREAM_read_bits(src, bits, offset);
-    // Shift `bits` bits out of the state, keeping the low order bits that
-    // weren't necessary to determine this symbol.  Then add in the new bits
-    // read from the stream.
-    *state = ((*state << bits) + rest) & (((u16)1 << dtable->max_bits) - 1);
-
-    return symb;
-}
-
-static inline void HUF_init_state(const HUF_dtable *const dtable,
-                                  u16 *const state, const u8 *const src,
-                                  i64 *const offset) {
-    // Read in a full `dtable->max_bits` bits to initialize the state
-    const u8 bits = dtable->max_bits;
-    *state = STREAM_read_bits(src, bits, offset);
-}
-
-static size_t HUF_decompress_1stream(const HUF_dtable *const dtable,
-                                     ostream_t *const out,
-                                     istream_t *const in) {
-    const size_t len = IO_istream_len(in);
-    if (len == 0) {
-        INP_SIZE();
-    }
-    const u8 *const src = IO_get_read_ptr(in, len);
-
-    // "Each bitstream must be read backward, that is starting from the end down
-    // to the beginning. Therefore it's necessary to know the size of each
-    // bitstream.
-    //
-    // It's also necessary to know exactly which bit is the latest. This is
-    // detected by a final bit flag : the highest bit of latest byte is a
-    // final-bit-flag. Consequently, a last byte of 0 is not possible. And the
-    // final-bit-flag itself is not part of the useful bitstream. Hence, the
-    // last byte contains between 0 and 7 useful bits."
-    const int padding = 8 - highest_set_bit(src[len - 1]);
-
-    // Offset starts at the end because HUF streams are read backwards
-    i64 bit_offset = len * 8 - padding;
-    u16 state;
-
-    HUF_init_state(dtable, &state, src, &bit_offset);
-
-    size_t symbols_written = 0;
-    while (bit_offset > -dtable->max_bits) {
-        // Iterate over the stream, decoding one symbol at a time
-        IO_write_byte(out, HUF_decode_symbol(dtable, &state, src, &bit_offset));
-        symbols_written++;
-    }
-    // "The process continues up to reading the required number of symbols per
-    // stream. If a bitstream is not entirely and exactly consumed, hence
-    // reaching exactly its beginning position with all bits consumed, the
-    // decoding process is considered faulty."
-
-    // When all symbols have been decoded, the final state value shouldn't have
-    // any data from the stream, so it should have "read" dtable->max_bits from
-    // before the start of `src`
-    // Therefore `offset`, the edge to start reading new bits at, should be
-    // dtable->max_bits before the start of the stream
-    if (bit_offset != -dtable->max_bits) {
-        CORRUPTION();
-    }
-
-    return symbols_written;
-}
-
-static size_t HUF_decompress_4stream(const HUF_dtable *const dtable,
-                                     ostream_t *const out, istream_t *const in) {
-    // "Compressed size is provided explicitly : in the 4-streams variant,
-    // bitstreams are preceded by 3 unsigned little-endian 16-bits values. Each
-    // value represents the compressed size of one stream, in order. The last
-    // stream size is deducted from total compressed size and from previously
-    // decoded stream sizes"
-    const size_t csize1 = IO_read_bits(in, 16);
-    const size_t csize2 = IO_read_bits(in, 16);
-    const size_t csize3 = IO_read_bits(in, 16);
-
-    istream_t in1 = IO_make_sub_istream(in, csize1);
-    istream_t in2 = IO_make_sub_istream(in, csize2);
-    istream_t in3 = IO_make_sub_istream(in, csize3);
-    istream_t in4 = IO_make_sub_istream(in, IO_istream_len(in));
-
-    size_t total_output = 0;
-    // Decode each stream independently for simplicity
-    // If we wanted to we could decode all 4 at the same time for speed,
-    // utilizing more execution units
-    total_output += HUF_decompress_1stream(dtable, out, &in1);
-    total_output += HUF_decompress_1stream(dtable, out, &in2);
-    total_output += HUF_decompress_1stream(dtable, out, &in3);
-    total_output += HUF_decompress_1stream(dtable, out, &in4);
-
-    return total_output;
-}
-
-/// Initializes a Huffman table using canonical Huffman codes
-/// For more explanation on canonical Huffman codes see
-/// http://www.cs.uofs.edu/~mccloske/courses/cmps340/huff_canonical_dec2015.html
-/// Codes within a level are allocated in symbol order (i.e. smaller symbols get
-/// earlier codes)
-static void HUF_init_dtable(HUF_dtable *const table, const u8 *const bits,
-                            const int num_symbs) {
-    memset(table, 0, sizeof(HUF_dtable));
-    if (num_symbs > HUF_MAX_SYMBS) {
-        ERROR("Too many symbols for Huffman");
-    }
-
-    u8 max_bits = 0;
-    u16 rank_count[HUF_MAX_BITS + 1];
-    memset(rank_count, 0, sizeof(rank_count));
-
-    // Count the number of symbols for each number of bits, and determine the
-    // depth of the tree
-    for (int i = 0; i < num_symbs; i++) {
-        if (bits[i] > HUF_MAX_BITS) {
-            ERROR("Huffman table depth too large");
-        }
-        max_bits = MAX(max_bits, bits[i]);
-        rank_count[bits[i]]++;
-    }
-
-    const size_t table_size = 1 << max_bits;
-    table->max_bits = max_bits;
-    table->symbols = malloc(table_size);
-    table->num_bits = malloc(table_size);
-
-    if (!table->symbols || !table->num_bits) {
-        free(table->symbols);
-        free(table->num_bits);
-        BAD_ALLOC();
-    }
-
-    // "Symbols are sorted by Weight. Within same Weight, symbols keep natural
-    // order. Symbols with a Weight of zero are removed. Then, starting from
-    // lowest weight, prefix codes are distributed in order."
-
-    u32 rank_idx[HUF_MAX_BITS + 1];
-    // Initialize the starting codes for each rank (number of bits)
-    rank_idx[max_bits] = 0;
-    for (int i = max_bits; i >= 1; i--) {
-        rank_idx[i - 1] = rank_idx[i] + rank_count[i] * (1 << (max_bits - i));
-        // The entire range takes the same number of bits so we can memset it
-        memset(&table->num_bits[rank_idx[i]], i, rank_idx[i - 1] - rank_idx[i]);
-    }
-
-    if (rank_idx[0] != table_size) {
-        CORRUPTION();
-    }
-
-    // Allocate codes and fill in the table
-    for (int i = 0; i < num_symbs; i++) {
-        if (bits[i] != 0) {
-            // Allocate a code for this symbol and set its range in the table
-            const u16 code = rank_idx[bits[i]];
-            // Since the code doesn't care about the bottom `max_bits - bits[i]`
-            // bits of state, it gets a range that spans all possible values of
-            // the lower bits
-            const u16 len = 1 << (max_bits - bits[i]);
-            memset(&table->symbols[code], i, len);
-            rank_idx[bits[i]] += len;
-        }
-    }
-}
-
-static void HUF_init_dtable_usingweights(HUF_dtable *const table,
-                                         const u8 *const weights,
-                                         const int num_symbs) {
-    // +1 because the last weight is not transmitted in the header
-    if (num_symbs + 1 > HUF_MAX_SYMBS) {
-        ERROR("Too many symbols for Huffman");
-    }
-
-    u8 bits[HUF_MAX_SYMBS];
-
-    u64 weight_sum = 0;
-    for (int i = 0; i < num_symbs; i++) {
-        // Weights are in the same range as bit count
-        if (weights[i] > HUF_MAX_BITS) {
-            CORRUPTION();
-        }
-        weight_sum += weights[i] > 0 ? (u64)1 << (weights[i] - 1) : 0;
-    }
-
-    // Find the first power of 2 larger than the sum
-    const int max_bits = highest_set_bit(weight_sum) + 1;
-    const u64 left_over = ((u64)1 << max_bits) - weight_sum;
-    // If the left over isn't a power of 2, the weights are invalid
-    if (left_over & (left_over - 1)) {
-        CORRUPTION();
-    }
-
-    // left_over is used to find the last weight as it's not transmitted
-    // by inverting 2^(weight - 1) we can determine the value of last_weight
-    const int last_weight = highest_set_bit(left_over) + 1;
-
-    for (int i = 0; i < num_symbs; i++) {
-        // "Number_of_Bits = Number_of_Bits ? Max_Number_of_Bits + 1 - Weight : 0"
-        bits[i] = weights[i] > 0 ? (max_bits + 1 - weights[i]) : 0;
-    }
-    bits[num_symbs] =
-        max_bits + 1 - last_weight; // Last weight is always non-zero
-
-    HUF_init_dtable(table, bits, num_symbs + 1);
-}
-
-static void HUF_free_dtable(HUF_dtable *const dtable) {
-    free(dtable->symbols);
-    free(dtable->num_bits);
-    memset(dtable, 0, sizeof(HUF_dtable));
-}
-
-static void HUF_copy_dtable(HUF_dtable *const dst,
-                            const HUF_dtable *const src) {
-    if (src->max_bits == 0) {
-        memset(dst, 0, sizeof(HUF_dtable));
-        return;
-    }
-
-    const size_t size = (size_t)1 << src->max_bits;
-    dst->max_bits = src->max_bits;
-
-    dst->symbols = malloc(size);
-    dst->num_bits = malloc(size);
-    if (!dst->symbols || !dst->num_bits) {
-        BAD_ALLOC();
-    }
-
-    memcpy(dst->symbols, src->symbols, size);
-    memcpy(dst->num_bits, src->num_bits, size);
-}
-/******* END HUFFMAN PRIMITIVES ***********************************************/
-
-/******* FSE PRIMITIVES *******************************************************/
-/// For more description of FSE see
-/// https://github.com/Cyan4973/FiniteStateEntropy/
-
-/// Allow a symbol to be decoded without updating state
-static inline u8 FSE_peek_symbol(const FSE_dtable *const dtable,
-                                 const u16 state) {
-    return dtable->symbols[state];
-}
-
-/// Consumes bits from the input and uses the current state to determine the
-/// next state
-static inline void FSE_update_state(const FSE_dtable *const dtable,
-                                    u16 *const state, const u8 *const src,
-                                    i64 *const offset) {
-    const u8 bits = dtable->num_bits[*state];
-    const u16 rest = STREAM_read_bits(src, bits, offset);
-    *state = dtable->new_state_base[*state] + rest;
-}
-
-/// Decodes a single FSE symbol and updates the offset
-static inline u8 FSE_decode_symbol(const FSE_dtable *const dtable,
-                                   u16 *const state, const u8 *const src,
-                                   i64 *const offset) {
-    const u8 symb = FSE_peek_symbol(dtable, *state);
-    FSE_update_state(dtable, state, src, offset);
-    return symb;
-}
-
-static inline void FSE_init_state(const FSE_dtable *const dtable,
-                                  u16 *const state, const u8 *const src,
-                                  i64 *const offset) {
-    // Read in a full `accuracy_log` bits to initialize the state
-    const u8 bits = dtable->accuracy_log;
-    *state = STREAM_read_bits(src, bits, offset);
-}
-
-static size_t FSE_decompress_interleaved2(const FSE_dtable *const dtable,
-                                          ostream_t *const out,
-                                          istream_t *const in) {
-    const size_t len = IO_istream_len(in);
-    if (len == 0) {
-        INP_SIZE();
-    }
-    const u8 *const src = IO_get_read_ptr(in, len);
-
-    // "Each bitstream must be read backward, that is starting from the end down
-    // to the beginning. Therefore it's necessary to know the size of each
-    // bitstream.
-    //
-    // It's also necessary to know exactly which bit is the latest. This is
-    // detected by a final bit flag : the highest bit of latest byte is a
-    // final-bit-flag. Consequently, a last byte of 0 is not possible. And the
-    // final-bit-flag itself is not part of the useful bitstream. Hence, the
-    // last byte contains between 0 and 7 useful bits."
-    const int padding = 8 - highest_set_bit(src[len - 1]);
-    i64 offset = len * 8 - padding;
-
-    u16 state1, state2;
-    // "The first state (State1) encodes the even indexed symbols, and the
-    // second (State2) encodes the odd indexes. State1 is initialized first, and
-    // then State2, and they take turns decoding a single symbol and updating
-    // their state."
-    FSE_init_state(dtable, &state1, src, &offset);
-    FSE_init_state(dtable, &state2, src, &offset);
-
-    // Decode until we overflow the stream
-    // Since we decode in reverse order, overflowing the stream is offset going
-    // negative
-    size_t symbols_written = 0;
-    while (1) {
-        // "The number of symbols to decode is determined by tracking bitStream
-        // overflow condition: If updating state after decoding a symbol would
-        // require more bits than remain in the stream, it is assumed the extra
-        // bits are 0. Then, the symbols for each of the final states are
-        // decoded and the process is complete."
-        IO_write_byte(out, FSE_decode_symbol(dtable, &state1, src, &offset));
-        symbols_written++;
-        if (offset < 0) {
-            // There's still a symbol to decode in state2
-            IO_write_byte(out, FSE_peek_symbol(dtable, state2));
-            symbols_written++;
-            break;
-        }
-
-        IO_write_byte(out, FSE_decode_symbol(dtable, &state2, src, &offset));
-        symbols_written++;
-        if (offset < 0) {
-            // There's still a symbol to decode in state1
-            IO_write_byte(out, FSE_peek_symbol(dtable, state1));
-            symbols_written++;
-            break;
-        }
-    }
-
-    return symbols_written;
-}
-
-static void FSE_init_dtable(FSE_dtable *const dtable,
-                            const i16 *const norm_freqs, const int num_symbs,
-                            const int accuracy_log) {
-    if (accuracy_log > FSE_MAX_ACCURACY_LOG) {
-        ERROR("FSE accuracy too large");
-    }
-    if (num_symbs > FSE_MAX_SYMBS) {
-        ERROR("Too many symbols for FSE");
-    }
-
-    dtable->accuracy_log = accuracy_log;
-
-    const size_t size = (size_t)1 << accuracy_log;
-    dtable->symbols = malloc(size * sizeof(u8));
-    dtable->num_bits = malloc(size * sizeof(u8));
-    dtable->new_state_base = malloc(size * sizeof(u16));
-
-    if (!dtable->symbols || !dtable->num_bits || !dtable->new_state_base) {
-        BAD_ALLOC();
-    }
-
-    // Used to determine how many bits need to be read for each state,
-    // and where the destination range should start
-    // Needs to be u16 because max value is 2 * max number of symbols,
-    // which can be larger than a byte can store
-    u16 state_desc[FSE_MAX_SYMBS];
-
-    // "Symbols are scanned in their natural order for "less than 1"
-    // probabilities. Symbols with this probability are being attributed a
-    // single cell, starting from the end of the table. These symbols define a
-    // full state reset, reading Accuracy_Log bits."
-    int high_threshold = size;
-    for (int s = 0; s < num_symbs; s++) {
-        // Scan for low probability symbols to put at the top
-        if (norm_freqs[s] == -1) {
-            dtable->symbols[--high_threshold] = s;
-            state_desc[s] = 1;
-        }
-    }
-
-    // "All remaining symbols are sorted in their natural order. Starting from
-    // symbol 0 and table position 0, each symbol gets attributed as many cells
-    // as its probability. Cell allocation is spreaded, not linear."
-    // Place the rest in the table
-    const u16 step = (size >> 1) + (size >> 3) + 3;
-    const u16 mask = size - 1;
-    u16 pos = 0;
-    for (int s = 0; s < num_symbs; s++) {
-        if (norm_freqs[s] <= 0) {
-            continue;
-        }
-
-        state_desc[s] = norm_freqs[s];
-
-        for (int i = 0; i < norm_freqs[s]; i++) {
-            // Give `norm_freqs[s]` states to symbol s
-            dtable->symbols[pos] = s;
-            // "A position is skipped if already occupied, typically by a "less
-            // than 1" probability symbol."
-            do {
-                pos = (pos + step) & mask;
-            } while (pos >=
-                     high_threshold);
-            // Note: no other collision checking is necessary as `step` is
-            // coprime to `size`, so the cycle will visit each position exactly
-            // once
-        }
-    }
-    if (pos != 0) {
-        CORRUPTION();
-    }
-
-    // Now we can fill baseline and num bits
-    for (size_t i = 0; i < size; i++) {
-        u8 symbol = dtable->symbols[i];
-        u16 next_state_desc = state_desc[symbol]++;
-        // Fills in the table appropriately, next_state_desc increases by symbol
-        // over time, decreasing number of bits
-        dtable->num_bits[i] = (u8)(accuracy_log - highest_set_bit(next_state_desc));
-        // Baseline increases until the bit threshold is passed, at which point
-        // it resets to 0
-        dtable->new_state_base[i] =
-            ((u16)next_state_desc << dtable->num_bits[i]) - size;
-    }
-}
-
-/// Decode an FSE header as defined in the Zstandard format specification and
-/// use the decoded frequencies to initialize a decoding table.
-static void FSE_decode_header(FSE_dtable *const dtable, istream_t *const in,
-                                const int max_accuracy_log) {
-    // "An FSE distribution table describes the probabilities of all symbols
-    // from 0 to the last present one (included) on a normalized scale of 1 <<
-    // Accuracy_Log .
-    //
-    // It's a bitstream which is read forward, in little-endian fashion. It's
-    // not necessary to know its exact size, since it will be discovered and
-    // reported by the decoding process.
-    if (max_accuracy_log > FSE_MAX_ACCURACY_LOG) {
-        ERROR("FSE accuracy too large");
-    }
-
-    // The bitstream starts by reporting on which scale it operates.
-    // Accuracy_Log = low4bits + 5. Note that maximum Accuracy_Log for literal
-    // and match lengths is 9, and for offsets is 8. Higher values are
-    // considered errors."
-    const int accuracy_log = 5 + IO_read_bits(in, 4);
-    if (accuracy_log > max_accuracy_log) {
-        ERROR("FSE accuracy too large");
-    }
-
-    // "Then follows each symbol value, from 0 to last present one. The number
-    // of bits used by each field is variable. It depends on :
-    //
-    // Remaining probabilities + 1 : example : Presuming an Accuracy_Log of 8,
-    // and presuming 100 probabilities points have already been distributed, the
-    // decoder may read any value from 0 to 255 - 100 + 1 == 156 (inclusive).
-    // Therefore, it must read log2sup(156) == 8 bits.
-    //
-    // Value decoded : small values use 1 less bit : example : Presuming values
-    // from 0 to 156 (inclusive) are possible, 255-156 = 99 values are remaining
-    // in an 8-bits field. They are used this way : first 99 values (hence from
-    // 0 to 98) use only 7 bits, values from 99 to 156 use 8 bits. "
-
-    i32 remaining = 1 << accuracy_log;
-    i16 frequencies[FSE_MAX_SYMBS];
-
-    int symb = 0;
-    while (remaining > 0 && symb < FSE_MAX_SYMBS) {
-        // Log of the number of possible values we could read
-        int bits = highest_set_bit(remaining + 1) + 1;
-
-        u16 val = IO_read_bits(in, bits);
-
-        // Try to mask out the lower bits to see if it qualifies for the "small
-        // value" threshold
-        const u16 lower_mask = ((u16)1 << (bits - 1)) - 1;
-        const u16 threshold = ((u16)1 << bits) - 1 - (remaining + 1);
-
-        if ((val & lower_mask) < threshold) {
-            IO_rewind_bits(in, 1);
-            val = val & lower_mask;
-        } else if (val > lower_mask) {
-            val = val - threshold;
-        }
-
-        // "Probability is obtained from Value decoded by following formula :
-        // Proba = value - 1"
-        const i16 proba = (i16)val - 1;
-
-        // "It means value 0 becomes negative probability -1. -1 is a special
-        // probability, which means "less than 1". Its effect on distribution
-        // table is described in next paragraph. For the purpose of calculating
-        // cumulated distribution, it counts as one."
-        remaining -= proba < 0 ? -proba : proba;
-
-        frequencies[symb] = proba;
-        symb++;
-
-        // "When a symbol has a probability of zero, it is followed by a 2-bits
-        // repeat flag. This repeat flag tells how many probabilities of zeroes
-        // follow the current one. It provides a number ranging from 0 to 3. If
-        // it is a 3, another 2-bits repeat flag follows, and so on."
-        if (proba == 0) {
-            // Read the next two bits to see how many more 0s
-            int repeat = IO_read_bits(in, 2);
-
-            while (1) {
-                for (int i = 0; i < repeat && symb < FSE_MAX_SYMBS; i++) {
-                    frequencies[symb++] = 0;
-                }
-                if (repeat == 3) {
-                    repeat = IO_read_bits(in, 2);
-                } else {
-                    break;
-                }
-            }
-        }
-    }
-    IO_align_stream(in);
-
-    // "When last symbol reaches cumulated total of 1 << Accuracy_Log, decoding
-    // is complete. If the last symbol makes cumulated total go above 1 <<
-    // Accuracy_Log, distribution is considered corrupted."
-    if (remaining != 0 || symb >= FSE_MAX_SYMBS) {
-        CORRUPTION();
-    }
-
-    // Initialize the decoding table using the determined weights
-    FSE_init_dtable(dtable, frequencies, symb, accuracy_log);
-}
-
-static void FSE_init_dtable_rle(FSE_dtable *const dtable, const u8 symb) {
-    dtable->symbols = malloc(sizeof(u8));
-    dtable->num_bits = malloc(sizeof(u8));
-    dtable->new_state_base = malloc(sizeof(u16));
-
-    if (!dtable->symbols || !dtable->num_bits || !dtable->new_state_base) {
-        BAD_ALLOC();
-    }
-
-    // This setup will always have a state of 0, always return symbol `symb`,
-    // and never consume any bits
-    dtable->symbols[0] = symb;
-    dtable->num_bits[0] = 0;
-    dtable->new_state_base[0] = 0;
-    dtable->accuracy_log = 0;
-}
-
-static void FSE_free_dtable(FSE_dtable *const dtable) {
-    free(dtable->symbols);
-    free(dtable->num_bits);
-    free(dtable->new_state_base);
-    memset(dtable, 0, sizeof(FSE_dtable));
-}
-
-static void FSE_copy_dtable(FSE_dtable *const dst, const FSE_dtable *const src) {
-    if (src->accuracy_log == 0) {
-        memset(dst, 0, sizeof(FSE_dtable));
-        return;
-    }
-
-    size_t size = (size_t)1 << src->accuracy_log;
-    dst->accuracy_log = src->accuracy_log;
-
-    dst->symbols = malloc(size);
-    dst->num_bits = malloc(size);
-    dst->new_state_base = malloc(size * sizeof(u16));
-    if (!dst->symbols || !dst->num_bits || !dst->new_state_base) {
-        BAD_ALLOC();
-    }
-
-    memcpy(dst->symbols, src->symbols, size);
-    memcpy(dst->num_bits, src->num_bits, size);
-    memcpy(dst->new_state_base, src->new_state_base, size * sizeof(u16));
-}
-/******* END FSE PRIMITIVES ***************************************************/
diff --git a/priv/zstd/doc/educational_decoder/zstd_decompress.h b/priv/zstd/doc/educational_decoder/zstd_decompress.h
deleted file mode 100644
index a01fde3..0000000
--- a/priv/zstd/doc/educational_decoder/zstd_decompress.h
+++ /dev/null
@@ -1,58 +0,0 @@
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-/******* EXPOSED TYPES ********************************************************/
-/*
-* Contains the parsed contents of a dictionary
-* This includes Huffman and FSE tables used for decoding and data on offsets
-*/
-typedef struct dictionary_s dictionary_t;
-/******* END EXPOSED TYPES ****************************************************/
-
-/******* DECOMPRESSION FUNCTIONS **********************************************/
-/// Zstandard decompression functions.
-/// `dst` must point to a space at least as large as the reconstructed output.
-size_t ZSTD_decompress(void *const dst, const size_t dst_len,
-                    const void *const src, const size_t src_len);
-
-/// If `dict != NULL` and `dict_len >= 8`, does the same thing as
-/// `ZSTD_decompress` but uses the provided dict
-size_t ZSTD_decompress_with_dict(void *const dst, const size_t dst_len,
-                              const void *const src, const size_t src_len,
-                              dictionary_t* parsed_dict);
-
-/// Get the decompressed size of an input stream so memory can be allocated in
-/// advance
-/// Returns -1 if the size can't be determined
-/// Assumes decompression of a single frame
-size_t ZSTD_get_decompressed_size(const void *const src, const size_t src_len);
-/******* END DECOMPRESSION FUNCTIONS ******************************************/
-
-/******* DICTIONARY MANAGEMENT ***********************************************/
-/*
- * Return a valid dictionary_t pointer for use with dictionary initialization
- * or decompression
- */
-dictionary_t* create_dictionary();
-
-/*
- * Parse a provided dictionary blob for use in decompression
- * `src` -- must point to memory space representing the dictionary
- * `src_len` -- must provide the dictionary size
- * `dict` -- will contain the parsed contents of the dictionary and
- *        can be used for decompression
- */
-void parse_dictionary(dictionary_t *const dict, const void *src,
-                             size_t src_len);
-
-/*
- * Free internal Huffman tables, FSE tables, and dictionary content
- */
-void free_dictionary(dictionary_t *const dict);
-/******* END DICTIONARY MANAGEMENT *******************************************/
diff --git a/priv/zstd/doc/images/Cspeed4.png b/priv/zstd/doc/images/Cspeed4.png
deleted file mode 100644
index 318204c00e96311529ed76351481db81d8212770..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 71276
zcmeGEWk8f&7dC(*0)hyFC@77RBB0XUU4n$P(v5V-00Ih^V&{#Rg<*t0z1_bqNdI-
zBZ^r{KQk4J-{gN%;+NC)=M(VoHYL~9I-Bfbjcu!Lsb<~ti5Y|KxN_0&jak4@lp%$J
zQ`oKN+5D@X{2%@q{skNAd7>UZb!
z6H)&E<6>|8zlZ-lod0LA|M8Un|8){E%#L?#xBoiA0@~llTU~8&+|IL}==8xUk`aw-
zpREk80b3s)R)#4We`V`k&%&x
za(~*nc6Y>t#jm}!^;0HkVPc|yv9U3i%}!<7q@b(a^f7VccZ=^g!|z_M>UlQb_6gqa
z{8Az0i+rN3oKRDv>2^Fr($)#)te%*CWDrXhf3j+z*ZPG`HkNNpLmGHF#wrX5Wnrl4IJlfJzIi(Y!
zw}>71RMpgAIdgM!Evv&t6l7%lfrRXjM>fS99%B#}Yf4B+WMd2MoU}(ViWW0#$jAhK
z`SL|*pxO|<*?FzJ2}RZE?n1nK&Ej6(w{QFtjtfNWPTT2K+r5%VA=tYL%pNuZ&4q<8
zX{f2O%my-7w&U?e3Z42=rFY{A&NfKS-qpr@tN7r&UabtVn50+MbWCvp%(Uk;WOyp=
zP)(-v_#%_mqOfUZqg?BiQE0$-@eDH8omyz|t^>Fpk&xkiz~Kn6`!YU?Uj|2fuxJR}0p)PB-x!
zXFjtEHKq2!I8MiYe8jm$GGc3*CSz}3y69l(WIAp?n5~jHqahQ+(y>s(ftjiqVMpM$
zJ8WRqMw{afD}hRAYbQ3jIZamDuS0N-7iS4aq!p?5dh9KPEAz~U3x%0H`abgX_Vt;u
z?(4OM53dcZ9U-YItNCT5K@4{W6cvMNX)f=`Qv-0$cT!6X1PUd
zmuA!==Ol&cES(slx7CM@SMC4uC#ECYVGtS2)3WHw{tx#G%%P41pP}%U*7K$kN*}px9A3Q8h6q(qsy8$&lfghvgy@Xwmz7p;-xt_
zIA|blbd-7G*y!{-gsbxPa9%-yT+Lqfy5o>h`st8PP>VF{IMeEhQ`YY^-jfy|dqqV>
zt0P#cbJk;q+T+6GHT&AI;$o(Q{xlxF6{M}|O{Z>BC64LB&O~lD@BUZnO-|b^{2_4y
z?sx6SEPYoPM47lWO3lG$)i8C>Q)G{t*hEHK&dG+JLus~!Uqn|YBMY3&W*nOG1;X<1
z<+HUdImy<@8*iH5N}pZu3Zz>?@+LX#_BEwW&)H<6?nM(RR_xWVAE)3@`A~}M$+0_G
zdoo%(tR#b{>G18DdRaFlxEDcKt@>pB>@<&wm30(BRPB*5(MdL$zO!>Bm`&76WG}y~
zT)n!KbG@o>uy63IL7ZdiA_q~a3>BZ_@A_N9O%(msnDir_E4O&}L1vbzbPt$a#wzXe
zFoeMsXFFPFdTL?ICvJy*@sM{}kokTk3n$kg-qSKOQ0jE_Yq!&__)%xM^)A;nYsg%B
z+)4-QWHB^_?gtb3z&$CAh5ecd!JXLR4`7IpMukm=D-S;33X&*(f^j+%o9U)4_u5Ly
zTntLca)RK^W7yn|99mnE|YG*hkBD_|5~?~KgywMC;I{+v%$j%Py=|Pvf<~C=#yZE;m!OSFU)A3w7
z-J5i2hcT$zT>XLXMab#Kh~A>&eKP^Li#2e9saQq={L|fpJ%GYw$oZC16sp+CxU|L7$2CL
z`%Sv(r@Z`qK99f-v;fm{t4c3#)Sm9-jq+`kFT`!(J1x~XVQ3w+Dpz$5W;5Q)&+g{~vWdhwk6W6Y?$Yy}(;i^bQ
zyw7KR0poHQWE61CHsccGfu{uW%dSXjv83{9mBv#GJSqXil3rYCJDF|^;Cq?tU#+=Z
zp$mBneWV)h>xX#QBZ+cej%E*X_)n%1p?Ndz%dgPZgd2p-kWc#JPy0Iqa`;P6;ygBy??P{Pi3V0T=pb7)Klypy$|CeUz1(d=ii7UW}8C=I*>#k
z^4dZlTHZGMqP>us`{^OH7NX;BJd_?^GPg06
zIG%pXH&}*f4?(qI=~cw56G{PB4Z^#Z8AwLjgLJe1c!=Qqdyw3N?r;T}p0%X<@SC?V
zhcu2$Jgx6)x*&(Fee<%$z}M#Z`Dm--AbTBug#AV&PHKgPeRwsITIte|r_9Cxen&NO
z>T9SY)bgO%aD~o-f|+^1*0pn^q$G(^Db+4$pn%-9{MKve=)pMj!!kPtCK=e8Eyt*Y
zVoc0`A`fEPxAvQ(F$JPKkT`C`oNg_^Y|(Ug_fgR7@RFlwMLbS-ob8~>1pTC&tO&<&
z5Q?j6@rQUj6*~qQHpkP0g-RcK)VaOZ6LowhW70eweh%TAugvNr!@_2=Z|{$vuz9W1
zPI>KTJj|T*j(?qxcDeoUq4URRsmM|*>6
zUO`EF>l4*#YIltzbci^6quNCq#K7CaRKMO^Xy8kY*Du)eh^|=o1|K&PSQIl-u6R@6
zJFPtHfoeMESerD|I6F5!akYCg-i4OEqdlHyFywzX-xH;DombaY?cPZ!+7-47z%3&x9VvlYN6PVaky2cwQfOP6@5w%uX}^SxGl
zm#vFWDFtlL2yb1)z#Cjrzks>4w(9eQ^26H$M~IlirWqo3yVyV7*@SWLtbimS@kU^u
z_KV0tQ?DSL<*qg8>Vz?4@Kzc0><1OkJE}P}UEZ`n2x-+?#mek*R$e&o*+JLl4;{5Gj*R>~4G|?S2oopba(I<0
z74=I_L#=$-Th@t=b<(BC5Nd0%`yPy}4*e|had+~EVdQ(M%Z5tYaZheAN1IuK@J-ybxzJjVX4gb)jN!%#HnPR3Eo0hOX-K1bgQNRFoduqb(3!<#
z_7Ph}?wv=AciJW-p4*P^1%)rnx^=9zap0!+{ZhC|Ye5ld0Mu~S-V+-UhlRs&cXY4y
z1}OKP+yz(>iUWrf2(mh`9%T2~uCd6bF?bsipG&Z`*9zSjgPN>J88~?1X}R>chOsfa
zu1LT><>mN*v3iq!Jtqwz*%!6~HyoVuK!l~Bg7^cNB
zdAQY-7L11+wyxEcG3+}0hnbvXP8cGw!$Bn!k+pC*!xnNJyS%buCaJ!ldaHKjjqkv~
zfL)0WQ<+Turv9~^!!A5J4isHcQC|~0q9+57GV9TdH3&L9-58F)wzo@Fs;F57C9`#r
zhn@{HhaPE@T%6=D4FF6|)ZQ55g_9P13aEzu=~&yfCQNv?FRKZ+9W0GzfG#SF5vX?tSD8#+Ak2rPHipd$#9vxRllwV^L$I6-Ffs(Rsm9e_o&td=fuB4)1M+{(k=_Y#7X)$VDw>2|}_03!S0YRbFk
zjCoNz4@4>^0g~sPpaP5~r#`D@rDzaAm8z&`(2>I}5fVUX)PrVHte8}>Wbvk>3c2*#
zu_m%r4$yt#5ZUi8_9WR^QBp5q7K@cE3<4Z6=Yxcda+G-*lW^lxmxwWpgK=ykq3_6arCQxe@FkN9s|kkD|iIPHD7D83!JN}
zv>>QD&X9F&ov7?w&aTh0%d@Q*GVV^i5herq_2mOPUTf=DS~DyaO-=g4-b7nlE^csD
zV|m)!<>eQ#E4CB1VCP3U3&{)bJD1cej~so~cot%<_Zgn!SK1ukdCVHt7?x7xYKHw#0FnHt$t8#e}b{tK0M+iM}^fJRZz0%x^l8y
zZNis{!@6WIc4jq|8e@JBW|haEymey5TZ0mN*o6zW)a=TePSNx_a>(m+>#RIF?K}|O
z?8>cgnr6JDHH8BCJeO2^@*yL
zXl^>Ujre^xi4#}`ofX4lo3I8E3qyH8sR7UIXKD_$>m#JstlcY^JJ!7>{njhiR(CUQ
zVPhQ0sbw0su@iYI)LP>|J>Zzg;L+LhN1Gr1pv~*L3n0G~=brH5G~@KzTPGS0=w#zv
z58C%yU2E&x8csyOhleNK21`=!=dz*pCp^m*qLXPd;N`;wA09mJn!L%{qC6C+Qx^pV
zg`k^g(oW3#TDR~^?u_&pk>fZ3*R%OIFM94J{wc%xjVu3?NFZSHc^6wF$@5a*%hm%G
ziEIifM2GjWD;A!(;zbhvS4r{1xZ&A6HsYL&!-~tN1y(l%wF`6qA@GY$VmA0&h
z0iko(7fykTh2KCDc{&w<9mUmqGoR$@?a$?JfcY!a(+!g=i?r^e{tif*BD4H>wV=9(
z=-tfD0rl)eS3iHzQ(bO&1J3jX$%36PDDJD*T<-a805a<1riZb8myOt!l`aG-tRR3k
z-PrFhH~2pqs_~5nsn!2`@gFho|C#!-L;L@sb4}exIy^i~hCq}6jF(bd%e(l**2YFm
zTKe<$_V)fbls%~Ch!!-sWq$`k=25qZP9Ahh!*=t3BIk#v2Z|e%96&XU8!
z!&VI#tj!9rz%UxGT&s|jkd&N*3pl#Ey3KvEymWA-;r{*m&B%D_Z}$dp
z!%d*MUmJYy`lAH(rO8I*sFk(?3dUn`ad9hvnMYCVT0kxU6p==CAdK5v*vbC2LJ!Sz
zz1I5xYvoK1umTf&Dk@P-%*-ubcX_CtcULzEgm})5w;;AN5w*v9G*6!v9=UJ$Ykjew
zbX7hDM1V5S=J87Vwux%zxj{9HuW*Xq$!X%`Xs>O)BWCV!C9ibhZn36~g!KUGkJP%B
z-Sz@U_pt~6t^w6sj8Bc6gDlxv%pgF_YMOKak`HPC5Z#+%S_n$8Dq_xpB^D0=t=}LgW(p^t!fqp9cTylB%G|E9&6kZE
z;&~n=sqNW}#~>9NN?0_NVrako3K#rd|KxB-{>>X|bUgZPXG4tV%wqj@FW3)s2}8od
zo>W&?L-h3A+-mv<20qr@#bojK_lIqiAg6}&tqivw1MEFE+562166}bXqsORZuA}+?
zyq}Z@S(W2x?k=ZnC$;Nz08%_za$tFS9zeVAf5~rcYn%J#OI-L(8{nARnu}1-kTQMBRn2hKN{X9Oi3H~^4z=?0)xTnXYptBe0
zqNTkz9M}lnaD9X^u*f;@+C>z)y9UDb{K-zUX-^VElhHCE`mPV_<$VfPR;XRf;BfX`
zVlHYp-UReeHF)PR`mz_w&a?gPZc88$=WIq=Tqrx-9a4>XsiNXb%(8Id>ETtSPB6+G9xHt#qJ__Vqd!Iv6l`vjVyZJS*xdf_7%b}T!62yV_xij_zPStEY
zv5j9{HRUAOn>r~`E5(Ji=1_DyL0(>%3rk4khtAaFf58E&dO}*M*6Ci#lUySDNJdRu
zsWvND;#&#t`cg033=if+(?NC)4YOa>Y^Y?cVq%ew33Rn|(rvT^P#WA%Y#j;cIp&jmLLxNmqM9<+tF~lDe;%G5t(UIstxsC)ftgLh7l(p5G-m-0
z?djG+S80>AohG0lF0y@D8O#au_D1R%E(F3>+pC4ZqN*piuL3k^9oWW+i0Z8cbj8PA
z9<=|C)R4Xf*%D->WTj0GGSEszwBgR9RIO(yaRHLH-a;qXYSML2-2JSMc@_|(=}N~Q
z!{ykfX%Rrna)yY+yJC0x~i*PPEGs
z$nryn^@G;STY(6O(|EwZ%o*d2#z71Ozbe7b+@(O{x7YhBi`7KyNv0D-LvNVe!YaRPxHoR5Ua+iPMRB@(K#%_T#n@
z7<9~a{kWkM5(zt1ur>}PtcT7(jVNGU2)M#}R~~{y*WEKtwW6782ixmmq-tIjkIL=R
zDNo3GL?s4W8
zRixhxvD5sUb?ecNcL$Q>?W>yBn0TIu=W4OA;PfNef4v#jznIK2q7mZ>tfUOR`*E*^
zm)^ex?D4C&XFYa~c4}TLt>$IvZwhu+~t&XLTR4X>CuNL+7qViI<0Kwh7(8@iYjmjFI0@cuPek$Opkdzi<3?u57w$M
z+%o2TCTJ}0IkqV`sl(V<`Cu;y0Wk!Q*N3}&vo7_Yt0(<*K&=&+j@uMtL0
z@TkkvWPkd=7Q8D{EV*kIAshbVhxfxWMsuL_{!#>9q#4h(ccH`oc^g&%
zqQw_h=l0MOR{ikR(5hm;YEAk(z`{}CvM?6K^1n8FE`lhE&pFrBMPdhrWk(HL9VBu=
z4R8UU1sOg77B)!LWc$xl*^gL0XXU)H6PvHawitKrsIc(}*Vq_|w~te?0>an^4PdnR
zE^y^PZG+!)P)&{7K|P~ya^~r5S+LfTZbpEl?5BL%IVx&3qX|3phhUDv4s
z-6&>pS)gOvC-Iln)D1gP@BtUn5ugQ0Izh8K`NzxU7=Et~Ivq5Oe$G8ATaHC6U))B^
z?Ro~^dI2f0I&|3(=YJA}pDHNAo)8#%$!N4a!E1lS5MPtfefb(CB-Fn+)BoNjNA-Io
zPT%ouL(8K=S=yFhH3r%cZ*TAPN<8|9fW;rm0O*K~4DyflNT1(^A5mL%m*U5$q{i^V
z?=}Ze#n%+fQD=%I$mZ}VKWx%q!W+;!ihs`v%Nmip`lRrkbCT)AfUf@cwfsHh=y>|J
zg?TYm2~V#5U)aj1D$x;7&+K*-TBLM*RwIudzZXO$ow`TrXCs$?t-AxZ!DonsuUer8
z3;Sx70O_0Ym>Ym4GKAoCkW%ndN_S&fMF(_Ex%Y7A?*k9MpsM4Y(_Ra)0zU5A=S<)4
z4i7eoOaJnTqYJBdE86Bxvs;u>u)bh(tkmh=Sf8&f5V8Jz88ybk
zu4$J
z18|-@LBRz7o+tSY1MO(OT$;!V5MdApe7EEPVJx!QH$C#Nhn+v_hYh^*p=0nE%Jr1S
zr;B=DRt$Y#Kw_)!X0D|0|2MzGe)4-WP{*pQe$sR}E~3K4JaFMQ4}6s`o&^&&>^0{6
z6XB%KDG{4gooDOu?zY7osmjFWO;%CubK9%Di_U%%yi$ru0Mu8|8{qT;Qqo$guNxjU
zpuCP2i1B#y?C|hFO=!7)W12+hl9$8mn^F_-k*7~^ma_EMS@N@YDMvid;7-^>57-JO
z8@wX=2NRud9o3&tP_onr*-;3xX0OVRsopr}Z#8ETjwh)t;AuKEK^-IgYNRGA87#4l}*7MInNd2{z6
zfXNXM&4E{&KYaFwEV*0)Pyrf>U5;TUqI1J$7`9yr+AhaDfwGWWjKZ?yXqxb85(j$F9BirDC6^U48kHXmRLmJr3S
z5{f4L58IS3u&UW=?KSmIw
zQ`6B#GKY&bonY77vc;-F_-A2zyOZ=e?}Mrdq-_Vr-K!N|mP|kX8(@s1IijXj(;;cI
z>Re7KDXelAxj1!aw{NBBhk>|6AK
z-Dm)iAs^62qdu0s5v1`CG)#P*P@Sb5=a3{5H#|Z*UVV}qBPJ~qOxxKSAq!R{HKO^L
zyK|nQQDZ9*_-8W+tdK7EdbxEFHTL4lN<_p2CuLBTlS1^UY~am|2={5DnK{Nb{}fVA
z3W+tJHX(QsmIQ285r?Pj|EDaTTjRL^DCa0J#(aobexQ5K(pv?Gakla9gSOaEsh}N~
zi%`e`3}(p9j{i>*@J3tBGK$bL%?u$@G$U443I;!eGSEWk$Z+np_Yd8NuM|+z0oPE}
z!~~$<-)6(22PH{sZ00X{p0v_;eKdS2k2BX=gg&byxk=6(Wl7qwvY@TQFV?+*YL_7=Iq>2MZ^hs{~7<>Z{AE?{O&U%zdq%|Dr(wL^!SX&%(B{DT69N5~9QBwjY2Nn(QSYf4=C)BEW04iIMT(u=20xpU2jLMleSaH(@vF
zh!q(-q=uAZzcP?$g)$h?w0pxq=dMaB0J!RtS^oEr{(cnLO%1Yfpl!>OJfg44cFfKS
z5;79OZFuvoiVL_BN=~6oEaw>rRVW-dFp9gLAu_s7@nmsm!
z*}C>Dv0K5Ah2?|6zaY2#&tDkw6v)RJvOX)0)0UT&)hK+7NL{TmZU3zdk$kO#hy&%ok+owsRquMsf^DC
zfNCPptzX91VjL8SvoGmbbUfcBnv(ggZD!(AV_I`s$HU;Z`M?NoBt~lT^W!GXgrl~@
z4a<#dR_EKkU8Obfw06WrVOOctc}z$~KUCdJzy5SFsywks`}O&8YYPI$%@X&-{$jTA
z>db{c^9h^z9v^;9DunU*H!&L|Q?^n?%(qds({fYv=nz~ucp|(vJd7u^KTigKz6gEb
zGqaB1+BD8Fofsxx+j?t~)dWB7uM79Z>`=~P@E_a_^M|Ju5z;!|X;F_x`fKY3czX2W
z$l*NqJ*S-G`gWi3KIfO7{W4IJ=!hp!z=-IDuMv4kna?eiC=aaQDG34IbI=t2S)R@fSRob3e
zT+!8++s(+W;#qvm6I$FmQuKY3lML`Hjm+l`kB6$NP)SPjMXixkEi+tF_gQ
z&ZiUS`}`#ZthAGut@L^V4iMr~6UcQ;lz+O+B`CJ1W5jn*opv``k>hZN?@@dRIW$&_
znuMECIrN@vt~~_aLIV{Heq~@|E4%#lwWRj;2jU3Ps1~Z@W*wy|(^gM1IaPC0#B57u
z5jr^|-O{Xn__@FQQUVrYPQuN4Jtrg4C+G;Es1{1mHlH20-=TTfB{c+!mV-}8`P~Bj
za3~XB!@eHVQ~gM>AB_;%C1fo~$aG0xor^O6mu+6AAwD)ByEJ_3WWOFH)Hu|w;u!m%
zB>%uk1kgVA+kobM$HB4d?KD;~pSyc4+%E_-*Ka#a&RJU{ULa8TBR~Mh8+3rL2QWVx
zQ?X53P(1ImQCcE*mRRi$Cs|W)bAbuZGzfP0G>6xlLz|1-Qg7J;MkW+Lc%KXzenNe=Swsp
z`qfhxkSB>x)}rvH@Rf>!0+a3$pk(NE#c_v*h3S+UWwn%;KwGC9e1*N5;1_^^shl}ryelL*
znY?_Xk-#gHb=Er@sM`5xzb#__NBIFT)@3eyh8C(@(e1YOOS{|!Tcbd>BL9AR-4~kI
zv%ug@NPoXVrR0A?jA4V2JAd+87Q|<*JIorSHFf`U_WTn;>NT#ia{r_=}n4O7oMx
zx>3Ubl8}={-mm%1jjH6aE|ssnp%K3>>B4*Vc0F!g68^1LEyLH65g12)i$Ep;=l*)!
z{%NcC_L>PW&r}xl;lqc*_tW1K0&{N6TX%6&0mC}saPGatLPG;=M#RoG^o*V!Vq1Jo
zfx)r`Si^Kn>}w7S6s8{;e2$LgT-)7(5Ziww7T=j+;Nl1&yA_~v9dtP>3?x{-N6mN;
zYuicA4(Nw$Yycb~%|?{N6Iy;-b|1+H=e;WSZ`VgMpI}ex_CBoh=Oelpcs}r7KXlRh
zb#!pcdCx`b{M$p|
zuY(2&tVopro@59qk>2l4%zdisUE^c1sp==Lh41X+`%8%}*E2%z5ptn}%MW4vCJ_|dDBho9CurHJsPFL9RVJtBVD!i2kGt7dC8(~?s7ok^vD
zbZ_={I2J0%BXIqVf`YC=1?KkqF0QQrvuTH=lnBgWVJ{Jw+jvh8+0xQdE^Oqpnj}9z
z$n|bx4s+Mw;!-oCU%NfU-jcuA%Af$KO!?
zgR9SB&>d{Hv2L0m^Ng>`_N>lQf?WyhsWddT{9w?syK4=&ke6tV{
zgoPRljNBJmFUXXy*Bm9+y1(^IuBzfHp9@!;P4uVVWb+DKTAV0RWi^&;iqLct*YAkd
zqmxCiE;XF|g=)S6Xd|Ov?S*S{pu4C6g>@I&%yqi83;FT@99#B;KBR2P54$@&FbvqL
zBR3$?M8JpXfZJa$lLH~TcZwGsQA#tnAr^nsA5OUXQ#3Di&4KE$KuUZ${fe7b08H|G1S}=e@yi(M-|$Mv
ztF9*64rtGJth!Y4cSaT>^jn!1@LH>SEqmV6sz15-S$-fNp!^iRE)%`gMYJF>4B4?5
zY;nFd>O;s^`Bux;{98L%3cZ<(4XBbp_5Q!SG@36jYWJ|KGDZqPh2g6$Sdf1G86#T9
z0Hp`oM)1+q?*fQzc^E8c`sTdD#Bv7kO2M8~`IEn^9BL7twR2F__Sy@_Q!t8=;nGG~
z^be#EbQuDMc#bT-)CT}Sx`lbsbZV;tm@Acpf%VTA89Xj@X!6etE4fN@>We*1!`CL<
zf?lVkkvIExHGh?T))L{lK|?%xPOAXvmlaURr20#QHPR!`XqYT@YjhnUA{qk-nKPL$*p34H#nvbc$<(S&WV<0pb
zWTTJZZSEEJ0loVVl?_^RHEk~2^*|emJ{LL-D73UmywKsX8(M?L*b#>fcGi$J#VN+p
zM=*4Tq0i6WL1XY$(7*g_OSs^2>u!|Vwa=bLE~c1`rh1z4y)F4==LG&Mw-eSQ3VZcW
zU!Zr)P9nchTb-_M6!szo7g4>q37KgGq+Ph(fDmrk`)iHBYM)<#pC!_Pm==TOpcpj6
zF(*U3h2)_P5{4*Ve#(Fu_aZ{ti@p@=J>Jx0@EZO(8-C^3d}9})f*X!NYUE(hLOVVK
z3A?pt>;9lagavqA(`2O?htNq<1jrXYk{cgQeUPK%hNe
z8>kNGsBT&(;$D0H8=P!d%`uN4x;5IKrMOFIgj3XNBEHC)byMnbL|4a#)19l!&mI;4
zXFbVc`uDGV08!%@t}lP(_8rxOPO}Uznir4>yhX`tWsJws*l
z!~nAuG$OP9RW_TBRw@ke%#*=)m$8j{2hNrnf5-phZ@`lM5J9J>ZtPasZNPOiwl$V%
z9X*Y-{Xn8y=ElZu(a$1TWN>BLLi?mqqoPeyYkB09@}i%b#Ak0m5-~>2unm>=5Wkw0
zoC0?4wUx;7_s+e=r{0(ZeTgw2BH+?Q>(lUcWS)N5;=9P6vJS$x
zBw|)hZgG9t)?oJCuQWxJ`eIJYExCgY;FznS?B{ksKGQMih`I`LxY5yWn4y)=f0W30
zKJ()6DaW*bU`hITEI7BlV)C1h4CASGQ(c>PPz9mbo-wzqs+Fe{LuYW*&n1@kv3lYD
zRLO@GNQ0M%jn5lS3=Z9#h6}ov;eq96a|0F#WAL`g)oN%a;ZdV_l=>l&e#OC`yW#GV
zp*^&_Ae&l4|Gr-H9UQLC=WSsftohmIf!%>Q6rUI
zN6|G+p&xR~g$}LPVmU70F?v&)A4=e1Z=KvEdOOF}FNF9}14RBRug)6Q)vkbUECI>s
z=rHB*O#~s64xdu=TK}P2H&U=Dex+$PwbyrH_gk_r``)jC
ze&=Y~x9x8|a7vbsDyXMUPK{kDN?dofQiW%1XvzLrlUv{S4P63JcLS`xkhFzmExTGSp{#i_2L28Di)J&6yztI>qPRFx>
z3~~L
zOg)=)%&Pg(XALOYzIfV18S7`#Gv{R>-(1gV`ItyYb2e$QI~qPx1+5o-c}$q+Co4Yx**e;T?d_7CxUcGWFugz}}lcCkwdjSt6@+c;^YT
zcRxqc9M<;d!gC1@XxqHuw`Nv@JkbC0PZp3*xOpC#x}$C7qRC942*LL`z0amBhA@eo
z8%aK&cQw>lqvwo^a&u_+i(mXi@(q)USiXnDCd0x%ql-b@k@e%533^k={pwO6V?25G
zZdEKd!u8VsfdO-*kZE@m^&5W@5#N0@L&;`lSp|s?QQ{-Y?5{?Ryd*G|T}n__Uv}Wx
zCO%A4oWaInS>x<|vXk>TN2Ah}Xk`6x%(6v3loN|>#J(u|n-0imCo&T25I5S%0uG%c
zCed}S(kkg&AoCsIpM&px%rLyKgXPNm;m{B%B;-)HjQ&ry2GpkR7i2f-?wVy{yCSO<
z)0T9~z|9r7Yx~$C_N^-Sg+2q=0c3c8s#ZI3Bg679(Nu^2eRfHcT}p1c+1+1bC#ku6
z^gSQ-ZRG-uh7CPMFo<@l({|GD2S^4N;kAc&%PmR}{rK?uPuWE+2g0#goSpPPt1{i*
z-r13?j`B{Oe^aW!8ujsA`~GJRoDx^oc+LuDh5lch>V!jU2L}9hg)jl`GTS7dVDV^?
zim%+x%d1oZVyyRZFGGk_A26WKyqwjOOOFL$M+2HowmqSbP%A;j#BES5R>4}B`RIF=pBg9
z#!|W$7)i=V*JJmMB`p|`Wf3_#h0_+06oMqKmhrzp5dI6ImSA{bepM<9c*i#nj40?G
zj1dA2v2tjKH*Jy}N5v6}>Wh)VfK-B=k4m4JsZ^PFk-9T`ptjP@QlZ+6nmPqbEIBhQ
z%UNtxKWhvO?i{BTP3)Z=b@2446r6kon(LLRJj~InYz}gOk0PX{byWXJ5M=iZpX<=%
zx)xfAJyg~lr-#?3^SbP)Li2=UW@8uh@g0+Te?rfrG&wa6ViN+#ED;P*U{qm9T$?i5
zL$1jP_%}3?KKXmT)tcNs6EUSn_I86<@+$#K4_9J+fzI+GQc0tMV@X;vvdsBo4t80lh^&(g5jTC!`ta>9NTbm`fjth|*^M7Z
zDl7#)%^IYMX@6e~;C-}eD^K#LB$2)cdab&g^#6WO*xPf}qJ9yN@n^BaU5wXK{sI{1
zcqi0xX_MS_F15wm^4P$bwB}sTI5#yg!FKlDKQ--V$)5%3JcHBHM?rRx;zrv8G`HFd
zJ5^z{>f3gX9Qry&n$c1$d7)JbQKp_Eu4#HntaO8a##{<$fx=ta70&r*fDRFNab>+U
z?B{CMQn0J&sM%Edv`$upxXz(8y6CzYp>LeIlbnys9wVcV`CE*uF!JCV12912_>%>n
zt0%ZvUqI&Hqe854g|FuNT%~
zS9Pch@iX1HJm9f&sU=A@?r#yBSs3Vusvqg4P)MlAReX664gF{jPB}bt)~$tQ!pukv
zG%m+-TxPF+p$EX@bpqPi%rSZ$>0a}i
zpjqL{`^r_8=_HwFeP-XAr(5>}$fKBF2lfeXAEl3LfQS@dlH8}mF5>oVo+e!Na-_;qtx6Ne5(vseD!90{)`{yt{^-ym56o^@yW
zEu*f&rW~;Y#=QwaBQAxpPU{F~72k<|n>tzSbElZm*2v9ic7j^@FM0Z3or~}I_A2kl
zdC!|e>C%rIT%*cujKE&6>)*tISfmP|(fm*Se|J5t@b|BREX%LnPYmi@<8dr4RGb*I
zAA`7i86OhSZr
zMFb|%y|S-TgG5hlNcU}8Hq|RFt?f*#z35?bj%B0~#Fg!0$$Lga%Qal>)D>s!9CaOD
zwon!){|&bM0i;y0uTV~P`NoGKe6=!6ulwFrsFRd3xYIo>>J8H^Fxn~86$yV98%}XJ
ztObxMe>a=SnQjSrkU+GI@q!Wxa_~lrfvyUByNN@|Jsyok>1HBXb!OABE7#Bl
z%|nQXjT;^N>7k>vs>w;Cd(WU-GB)KrK>PX=XVHr2muUU;Ro(+i!$W}fV)yobaQOkx
zaS^%o)f->6lWI%@tAIWRbjV-aPWK;0gc}-^YZ|NaESo~3j7|;8iP3L%{xyNZ#|5uW
zeSPzq7uCrR3*J$v9OcIIb
zFSqbWpn^p5rUa1ltjF*4L}g_Gshg#5&S?~cJ8YS+SmD}kmBT(`M8VN!8;(X=ltRwX
zagu+X1$zh-vIf7djLR*EUN-GgOaaG(IuCk>M(CKO$2*tF)<@=?LY9nka)@`hX~FbR
z!Qcz3^uk5?kbulAQYScd@50VN?gaP~#F}xi@8}OTgJocXN#!MXTg`klZtzE&a?GJG
zpZ;8ZyvzM1v7nQ4iZuY0gft6hH*H+!EAv|fpoao=J-&t56}cTlrDyn
zuGor1_>7HHJdyGx_t1^VAr}zXlRlmV4*v-BrG>yuFEE;GLgj;Ym|)J?PqH2^NNJOu
zxz5C>Z7-G*6+EAyVi&KT3a8^lKIsWRdO2C_{da=!;M;~*hBL-l%nJ*liY0tY8SNCx
z39BoM_=jV)oaE9iFV7LhWVLI-W(+Io)OY>yOqpb*cpVrE6I{Nl8IqugDD{|`H07@p
zxsTZ+6#&%Tk}Wpu&mHi^uaH6*
zrZEGLlyH;*BWlkWrB)iFa2Rz(EGv$+Uw<~ETUw|7|B!W+QBk&CR~l555(Ghp77$QE
z8isCAkS>*>ySv1uyCkHM?hcdgZj|os`mP)G5x@733)g~~JI-}tpMCbxe`#DAo>s^6
z2gdmIlIEfOHQw-B_^%Li?-?*0?We-ue!P1Xe74_-VN+crF1xS{iE!W9+FeZMR#5
zlScvMf)*^a7dQ*AYs&LHcCr*THF;CU;~dB7iwrv)ax5(^BO#GYNS`t;E-oZK-XhSm
zM~>4OH3W=1kwt+K2r!2wgit%+=Kd8PKHwWI%!glZO<^PNozMEh%ozo+EAr^7T;zgRY+JEHPjZ&xn;yZ
z;0@+syz_yrzdFISLi+WMs4SgNzgvzPYH;&-gO~suioo?=OCC*(;io1hPthq-6r>*f
zdeJx&$VzFl!Jro?p{S(9B>I=P01c25KX}s{S3ENXgd@!M_I4Xq$Ex&!+>i|+ee)%10i$UYB=C6W*=Rf?{y?Ag^ByGN6QrDCUqSPR10n+|
zgBbsf$)nGEFg5S4{r2tXT*(q9%GUuqGRmRO(R(olxS?X#G(+&jXbpU2w#k9Lx%*P2WiUj}A{
zY%L4!ChX@nD-d=;{GCa?Dk)T@RkzcxnWQIUqPn^<)#m9{9u9d70(&jKCB^6#oH;iMGl26=O7CHcKpHdjM
z_*|0gYUJ~JE9CZx%Ul1jDyUA{i({G)&E^9pJvAB=ZCRO2UcFsflV7nip@}R5`PQK5
zw5*-&Bs(b?EP?x4>~*@o@&A;MwO__v0Ikx&@Szdj?Ydw*e2mkP24_H1s9Sn^3mMZd2i}Vo
ztk?2o=$Bu=84b78t$Q40O|}=4Z@m`m-ML|!}j;a185o@_Lm@<+cHQ^pL(MHn#+Z!T-lC|&c5F7*nFgHUfA;@U`=IPQYKxe
z__`j0@lSaGkx_mz~BO@Qb6(}FSk^iO6+V6WlHmg16
zJQr8$y8{GSEe8a*TG?!t2k)zcnf4VO_wD&dRhBX`zFM|z9J%h1chxC*uFU`<+OqE8
zqS=sUsae6N6o-j^EDNAo-C_Uaf3G+L&BaB*T$m91HscbHzJzktGMCY3iLLSOp}9R)
z4&C=UVHD}%h(<6t!QJ*Eu)?lj*YvyiZ<~4};0@SSst&88^gIiGr<|dLD;n-COl6H?
zMB3BVB0On&fP7~pmu}!0RgUwW@MNV!$V&jP1oeS_&!z>`PU`
zjrJz)CMg@%gwQQbk86erH3Q?WIcox#eCnqB=g(zD87{%2qKn^MkOy3Fq&Esi^9w9|
zQpebpjEp;7k-TDSQ(PYlOKnGUR7Vb$!NKguh2aeGw2z)2?!+6YD&`%zY?#KT&(Wz2
zSwg&0V>n<%wp%L;=1f#^_Bhc0Zq-9o&qu7mkluMabEpw9c?S;b
ze&l0*Ze@9dYI}OQBP#9l@0V6`w@V8TyT#v=W@Q49G?
ztgBbUfYZH>1wJ706~Ix^=5p>11$@gx3U0JMNg`9w|E2GF9;K1W
zP&YR>W%(W1Jge*H
zUL~NVausVNs+}?|gjq
z%9T(V<_b|rFOb1itB%LnUE>!wNSX-k)E0XDhPv%hdkjCBB2t
zm*KbhR(Mbxq|NgER&UYh#P!l7p4mQ(#X`
zE!0S2_RDb2ttUfl5^yZTkB{9T!ml4OoA~iD0B~w7Cj^`qGt;Mm>tg-Xtik-r0u`qm
z28V^@Aw#YP9(y@V^>JhW7qrcT0Ma45JG#wUtCOb&dpCl2}YGC+J78GW$G|1sUp;tIUuBR&ssE3vf>%MSZkC?`1mBtV{v9`Yr7QqRwC6`$tE2c(?-2NwUeRDe-1dWVG(Ky^fxh=Hz#MvQZy
zuWwe#H4Jb<6~Vmj1S(`M-h@P*U4fMbQ*-^8jn$tEN%nj%UkPH&nVeGg(W9m*ovjSy
zkbi>l+kr!mDTg{SnZkZ?XLF_n+H)Y^ljjJ65uh4}T8vdnNn&~inx{&9Hm_C#Hc2GN
z7X#J$PKEGqFH6W(Ex@n6zHH*>(fhVvr1E9U*G~nkNru!|2)=`--T%Re^{>&={p0Ga4(h}4{)@T09ft;f?lS9Zn$cpLuOIg*`qo|ZVK0f?aUB%ast`mT3_P+j-7Q!9JDIcon
zP)w|JlpzPH7tT37^*4}svEPDfIz5#_QP55QsxG7N(zCx;?KOZk|Jdw#kj~zqQT}U8
zoHyG+7(#524O-%LE(|2BGzOoIIf%Ctg!LO8ib;L2@#i?Swwt(vb!|J(`aRiS+rxDF
z2p1QBWrPMf=LZBn`#o|hHwatyywaOez8N+DMgrqHHBVWB{;q51R6D>L9!
z?L4sVN)p2(AE>OF&^Fh
zAIAlXC~q!YyAI7glioW;=!iOx6WJ=m)~Khfh=D#VGF&N~LS~8piih;|bvF-af4wn+
z&KGP;9V5vVW4;yJ+;}rK=^A+Y=z3c`der&yUX;4h2daaVB`Um
z1k+x|d1FQiONaV5D{}AwPpuMu%~QuE;wEm@*sAzTZw-Jce2{vsy+
z3Q9(S$e^AM&dc?KcQgv$A&UlR;mdddXX|77KEg
zyo6jzRywmxGNE6H+m*8R67CYX=L|(NmHA7Baa7sNjJP{1u9A9&mA`@GyH&ebW!qt5
z88s-{VgHJN=U(JH7Q(t{k+BVR4>#sQ
zMj}#kg-W90S7-l*+iyRxu7o(5o;2LS>OA;0>HGUr-6SV_GnF=HV=ZHDr>Cd4fXR)S
zHP16wY^1R~rJ^rizNG3k1aJftfx`4X8m1_Z>pGMW7;z%=kX7Zv5Xurc@Z^9O#pACW
zu0$sIE#L8}e4$EaaB(7vEtNZR<_V|ciPFwbLS&V>k^#Z~%0>h;iNCyrg-UKvrnJUO-28sgPdQ5F*1nN
z=EG=QAW;Fe66Fek8DtsbELMC~Y7w3ZG`g$p!CNzZN}avqb-hk$h=JTMxX^2a{`wM<
zE>UAkOQ>AzgSWZ(>MANKJ|Y9}s(-w?^>t#R?)!ZQU@?Eq7AfxrmtEz<@iS(b+ObH(
z&2}S+V`l0^>vW~5L$N9)e@GhQ&;9JbuMeh@m{#yS3?(2W1aerpxWu@)6hH!vD9y5p
z`WfBDkh+GyzcI+IeyE*h#;^4-dBa`lGxeNS=KE%T-KnUlfK@CCR%6NRDdy7Oc>Vdc
zPd=}Q7XE;hH>|F^W(z|_>37u&MSo6B=?@nh+iXrtK`9`09Ag2r1Pg|F}2Us3tdHIO>epAj!Do
zT}m_uN)KB>4!`u?uVmIr^sd~Atu%Y
z?d-{`JFVn9UjKqeL_~*ijWmc^yHe8Z?ouu%6>p?TIP+dp*O;^+0?
zGpGO@%_e2+va?7dc+jK(_C$e63(>$lotoin+|0J<`+Bclyn0nC+)|E)JkAJ8MArl|
zCLq+oLNsV|M_1=)GmMm1>1S`KM;vb>*;MFslKfNoqk}&NdH!5-sPb)Qq@8#AR985G
z@?ygBV1dYO&tvPMYUiSAuzriy*uxL3+X-4hB43DL;29>oH;0@AUW>p`Gy(YZ%d2PyKQdkwyT{XDR7*77
z*tCB+;|@Ab@sP;R?>f-aGbJa(22alt4>}h*r^_!=RAXPc_a)w}Xw$%8{fKhLyPGyA
zrTN#T4d>MZ&2_mskd!R+N|6y~&P<%HOkfK0Gy%MO4{bj(??~mGQ9yDx5zFY*I0vP|
zz%ZbvVvOfiBMTj^OhVYT|NlPB855O?N*;H3k>M#ui?VWaSD4>w9K&6I25eL3c-@Ex
zIK$HVS2fOsMr~Li#|g*gWpC8=c)%l+TgBCW=7vz|HS{|NZW-EY^
z71fvxu@<1wm}8)zpv-{%0|bJCrva91pzov#3{^WbADRO=ssLaDnv{Mdr$J{RjK3v!1
za2vF>NT?H=3;+}oVJ|o|~*-y^VWq0MS8FHQJBhH$Hy9Nw-+a;gb<(u)TP1=RNRbh=8X`qvO9ds%EKKKpDK;$@?9|D8tOoD$fV
z=fr60`d|K;SO767?+W<(9m`86Al-FAvy+o_l(EsuA9a;`SJjvKr^oik$$52P?jOl2
zEZhNZuTv69^BIYwd`D@2$Ukk^^N0kO0}qQsZt!nH^N(X_y9)}dXrT&H;F<-!d-orf
z@%9B(TIl}Mvp)B%#VAPqZ_F^R2Q!0X-g4Q_?`p^i-IcM*rgD!ii@!~y^WSv}gc}=Y
znvGY3d`^G~Xb)y}t$TT0s(|vBjt=Q3V1~h41LTYS(qDibuG@QWrOs@28`2@Z)bja$
zmVV7-f0ml$D*Q&41aE1{Z2J!p1PW&kG(pkP^nv`lQ3!qgzM(vz9}f^1$vAtiHy0lv
zQY3PW-R#1Qg#KA3<9ERRp}GX(Sf*rA#8y9xITnNMivKB
z4uwh&8K4~NKfCxw@_7)4+MqWa8+wwGP&!)6Y&CE9fv;pa<2|>gNqV^r+;7xfpH97s
zQMLahim_C7xRN$SzM(%j2sl%%^Stl(o9nbdy#`c3sU!lzcvs7l$F|=Fz&cf+Fe)8?
zMCs)vaoLP7h{f}adQ4!mYl39bDe{I__3lrup7Etu-~I?n{r;@UTgV$58+bP*_rG$+
zKd3P?Mk+KYE50`XoLe65K0+oUI>0>EV~paf?x~)Esw+;nDUYzoU$+J_$iy!Y68MK9Tc6O3nK0Q6{uJb%2IT`}L-41Rtj(;CuBLcJ!
zpXq=1u(hpN=1~uSk)~i1#djRajCbSv8KwL365R2^HD*xUvmECes`IQH67)PhCTTF|
zC1lc=W|cJNZ3hEWZ`Sk7YC&gYvIrRs1oFu1-P01UVbdAo!8T_laWq^(;f!v(zCsNb
zKG6y%3Pc}JDDf<3R%B99YWs&}tB3Mq?w0~5HsNu)eH$s^Mq?vmFkM7i)5bDh)u&#W
zpVI*wQa|Sm^)o*Fmt~y4goye#xKviaEDi8LJs=yT1$1(%B_<`sgInDN^FQ7`glQqprQLUqwU7c<~?P
zT5qOv%Dg--Vy^tj!B!5x
zEM(n6|5~>kD%8<}jv7Eec+eR6|6d?0kOOEOGr!%
z18ALv1P4DdCA$V3Wa=fQA_)9|R}tJ1&}H^K;nIFU&XB)n>C}OF(AN7H>)N#8JqLn+
zJ~2`LH&$qsW8dA~-C9syUaqlZ1>Q3Q+Wr6+1Qi-Np4<7ptHk@~L8{n(!4tX@FJXu(
z*I_%%zn0}4apNW{;*Hrzsayn$u8!W}4%m#UKUApSoukPK2AqwDURl|r4trmsq8#}o
zk^)pW9s;lGsS~f}A{r1!U$9pFqdNdfS&t0=xxhfbgE88MyH5^aKw1hZTn73Qf2bXp1C
z?(U>4{N+FcT$Ap9;Xo>?fRdj&$*y1{a3
zOd^pV^V|U!;q`=tDMzioKtF&^M`L2{kChLu+ZPWWDxV}g{Tcp??L-V=rD|yaw5swm
zlK?rOJ~V+d3QfXX0g9RM`;u>0abRcni?X&QuV(3l1NG*=@wZbJnTO#XBV$W;V8&3=
z$+6v2>OEn4NQ_1U_CMXiQWpjYCXWuc
z7pQ=qLZQ>fGko^tzN|>Q#oo+*-bz=CmpgkW&Rerh8&eHpD1lI^0k&+mfORf3F|0|&9smOHYpk%a
zh?eI!8m6mG!Uf&?X0c2ApC6CyWa1H$PCm^^<-YI)i&?xuIox=Bu(e`J?XWhkZDVWO
zmhlOAnSSCoc6+1zuDgx3?nemV*9=6HE-zL?x5z3w>gUZsvh$-pw->;LM$xeAAL5zN6%I>rjWu;#5>?I$xKX!*+*Lmi~!FG>An{r9q
zb^h(3tE61{SdKp)qq>RIFCholZm7-E08_tA+L9CG>7h%D_D$I}{pxyT7yr#(ZJN&)
zb81lXf;H7p$=f#n73iQy1NPJm5a7rKFDi?wG>02HTJS`n3)`zc-nXq5K%wJrk$Y0!hAbuU$b
zzC*C~;9>3E;UMO3sp00>m)Ap&@>cFf?!7fB{SKbe1L=ecoC)Ft=iavNN3|?%pXb?#
zejNQ|3#?S)OeNO(PdB
zDn{LAN$g4E2rbS5=)o6R&Hm*fNQKC}ti{o>-QUlTeW*N37e4U1H_2O&X|xk#ik&%PNpX=gefSxI0is1=~7ALHn_G{n-`=npW#bEcX^0BJDbGIXWz0^(hP?g|7rRRo}`L!eyQr7PKe
zD_Y4TY)}(D;dV
z$yMq!e{0LGw@;VgMmbD4LK5L$j+PFaWJC6QvmGrVCxN@}=G}U{wb@(9&K;s29zI*>
zOF84c#3N$`6Xe`Drjxw#H^dEBLCCAAIJ!wl1n4?;y|@ppY9_AX0!y0HR|R(m^$gza
z0OE?_Zk6jQkk+8Aj7X8++1=V=6RN|$^&qN#8tmcK-(5f(%bDxV5O>1_jiV8Zsp>PW75Nc3@w-79n`L
z5jcDM3gO**dtI)h)(vDfZ5#uGYdp}H0BvO%uhK7Dq#!*zzsCBErYL$z+_u)IoBJaQk
zYL2ERPT~C>(hh4!O_Tr-&G0pGY=B>*#mw|>fCT!pH8Xn}A#<(+x!n?H5)gVW_JXfg
zC?1S7EEKYxygymgo)Ve3q|fyjc(%cs2k7_%09xYNGdD|>$aXVL(1?R--UW5B@AUsbJslPe=%D61fYRZt
zE6e;I@~211cHFk5y&h|iYN+(vr`z#JzQWD_%}Sg;c+omS!Z_9WGr6(ZOG=B6ZJ7>p
zhpIU48Q;PtAtp8sxIsX$uLawLa34b&QvUak!mS?P-%Ys7p2xvkG!sm$O~XtHWUi-J
zblo;y-qkE^m2Gp>+A5}Z=XP9ukBWvCttyh&6J@)DfkN_d;8D$?dq1^|xia9bg!Ao*
z)k~lW485m0({hwRtn(6uPDAI8SUcsMvP
z$ggl7Kz=13pPbxsV(!W<9=y$_y`E{wG+UhRf;E!FUii$YrmIVDqonrK<4~rB!}y&W
zZC5=Pd+ED^Yvq_+CZN8d-QyheqP2>-+hr_6QMMeHpj~-QfIvngC^#`HgEAMhZ`>Mn
z-(sSQn-TAgnY>)?ORvDoNI@G)4depY4VWeo^zIsFl2ybg_^gN;BQI;<(sk8?~%^5<7YnbY++NF8;W
z^6ySpAP;>aJ;3G;;6t&Z8pp-nrnnJKQ!?b>w&td9IP3gKj<0@BIH^lG>#xu^F=QNK
zb%VC~W@j;T_x)zq*Yii?J!uUWJjs5%mpn%u*bCU2<+5h~Zi)PK9it3y@v-2*h~QF8
z&?;fhl9YGjD|FusWyhXPjhjO{mLcZ3%=if<6ij#TVMHNZ@!+
z0xr1?P-ju0C|bf03P^_UtuU
zqkE_l!l|SA+xu8MTlwEJRKF`t4XH`63_T1if>HylnN~8e+y_F1IY&sSrKO}cn(zK#
zEJc(!;S^>DO8TS>%QwJNwADbrZa|uN6}Yr-h&6+=4WUK
zB#(s15D+kh|F!oJ#0JheqkHNtU?ngSx7~b@Y=XcT>I06!=(srZfQm!0q7>6a%f64w
z^4^kiCdK+KgcU$_Y$ct8Mr|z2b_F~Cfn81u$VOvn&|h66TXf3kE5#BmCE?%{PCUV4
zN8IsHdsD|}>#C5~9?^dq597ZunRm(i5Vb#7+w?i7`_XPV#P?$NEi``|9iNp<1t{m1s;2)!EQS#z^Rvm5@gFJ6Lnx;B%8K6eub9nN{K-oIul2y+jJwYYt7;<9ur0U
z&Xn|Y8KC~foxSvS(NPGWti&FI#Hzta1MNds&{Ea22HJBY>8524N5GGja_xyEl3}G7
zDxaW!thHDm@3qFw#!yedzleju>x)opPY+F{WM#w74)e}fKc)KL;^g7T2NV?A#?bI^
z8emX%JhKbr7Pn%l4^3p%3ugT8>bQ32D6Q2ND*0yPI`1y4JI{oxBEG)CwE+riLnBFV
z)$O(yfd-$cxEL)R-AG_x=?5fUretydLe;l#-UNY)uDTtbVvx`epN1M=oMU#OAQ2A+
z^zn%Kd84C}VH2tc4^&=VCuin)rz-JkQBp4M!Rg4vX}_PJ*@}a@wf;ZN#NVlf7b8-f
zK^E1N$*mQm*aunOw{;mpUwxI{dlBSPm2F>aArs~a)}PYWI}B($a%=1Oc<~7DG?06;
zBb9;L@ofNlcGf&eq6P^GU$5*UkA@0Lu!bEX#lz4pC50|*f8Pn}zhO0=t~%C*O5Ao9
zWsfa2=&_OQs4~H
zE{_r*tr6ZSP`RRGp|8RlF>|VL{C&sth+<(pNB+;q&^d;f$b`ynRphc`0)Sv8|B)rT
zaUd_J0J>d62BxchMvoa+J7>yf$A^{d7I(zrK2x(dc2wJG?kyBVs3m2kq=@RcEYPsw
zS%XoUl3g{4ti{H!0ArIjFi7Ly@LSEht=0cRL<3NzjqBnK`un{M-Nn*vmo%U)JVbF3
zIZEF+d>!@P$e?{*%u3E+31&y_}YZC
zg>rO{e-i0*$Ie=&1vpe&sA>6TBdKeea`;pX>w?}VgkdYmrMH{DTArMIq7L>k*)4Q`
z%kIe#lF=SeO4nL)d8@&W3GBw;;CQPe6)-$#oBRxVJyuEvWSf!Vp0q_(wDSib^OF6((G*HIk~a}^3zbq+Db|%@G8OqHjsE6Bso8;%
zZNzjuqwS)Ya7wt>_je)&(?iIi@~_+OokWnlTXUm3-_G$jc($=53S~Cjc9j)4*;Z07
zvxoyb@!sUpWxO?JXDp<>BPDI3^*M6ZGRIQukp!oSGZ-$4HnJFfryeQdn_^!W)
ze)!PDjGl>!V@~zDc%^O4aC@Iu_O6tKvq{}>(%@<9Gf{-*JTP}Yt;q(xImEYqw#}7V
zK6*~Uj~OOb5Ra1l15)EntZUhaK4m4Zf2x+e`G=hVPn&C-9+Vuqi6L8wZbfsbAM30)Xc*A$8vYLzcVnPk*7z9qU(S{Hp
zn>LeIy(yi;-`V=Tl8_v*6-)rVLA?rF0%zR?Nqf(F>XX~SaEwFEij{X54_)nplPgzt
zBfH#_5TEOBE`)Y}S~`-2s5=(`{aJ$FO{;!qsdI*|-_GM5avbhAnB(Yz(o4p)k4xgR+W6;)0NxybX6gpUqR~Nl5
zJQgb~Jp64!c%zbp5a7ZkK1CL#B$*X6N97ZT`vhucPbLSrjk?{@HMt_-uym6$Qd23f
zVcS0=qqBDpY3o(t)xw
z4H(2o7+3_*dCz;RpE6K0r{s3scqm(aFcv$qcRJkK170XgP`6rgDJCBR4qn3u)s
z^-w`~R5oHM&tWbmdtfdbl|A>JL3Mw9GCGVG-_1_!tH8xJ7d-J3vP>j%IG8RyXVKs0
zA2ycW1&KQ}6n8!{OL$kUbJEln8Mzh$%m?DRPR!Z76&a0NA&UNLgO*eW1M7;U|MhS%
z|DfL;q=t1hpS6)IY|8MR{z@+CLHA{NJpCPeF2#~)5+XCS+sSh4k5K-OTK%#n@7Wt%
zPV0$ApJPBvtiOCch(ZJbSUOP0Tgt(q^y~NU{TW}bq2gqKcBZ=iCqiTQ>DN
z+ShFF;#LdJ5Fh4E+uF^X0srnTCU!nv`*agv!_PEKy_B~%Cl5*TX>|!qJ`$G#&A!sH
z>WlUPj$^TxmwdxD?3|Mc9VkBJ@|Zw^BKDwjkv;M{8IxTdE+H&%;1NUGWOq%NM@J1M
z%+u*4QLSkpC2{aDRpagDD>&GEi}Ow6O=KU*X8zLy`*qUcGFY-P>{3v**OMj}Iz5d@
z9|2v97Em_Jb;p2(is^cQ{^1=1OvW@OAH&<=M(4tyJsO2MXA8d}8jLYpfylrJW8e4c
z8ZN!+HNW7e{FK!76V8jJD|{E`b$f
zE2qTB{0#pEu7c70oD$2kiFs1*EX++D&K|7@KM
zsVzzlAbhj9`6?fh0f-}mg_wkuZSTN`{&j8Or*%GWpnuHmepqajw!BCKgViJ2b88bo
zt85amQ@V$I6foJP5)(6I1@;A$RLuCPXi{U4M;K@^7lN);*;xAPR?)p^1Vnv~U5JN#
z(QziOpuT(eZW=5l4gySCDY0)aJ?AQn+5y?{J*!Do#%E?!HyzNo>+nRoWONN8q0sJ^
zZ&%53t7@&@r@weA%ZqqAMZ#>Q!N{iVQzW?g&^XAzGSXD5WqgIazfAw$u`(
zPZyWmPSINkzR6JLCm#gNu5A^!CJ7PFq3n7wVIjkk!s&h#X#UR~*0Z5{?Ek=ETRH5K
zAiv@1xo3OHNqor|4LP0$Ji4NIjGPThBstNo%{e;6)(7NtmGrOZnn;bJ71@p{Jqk_i
zolbEatctq-O=SLlGix~OTU(*v%sdYo-zYaqeGN58*D*x5_!Qs+s9hYeiT!4cl)=(#
zDSfStotG*WHc{Cs@7E{L_s8!|8{u9=eW8{*7&vX>U8|;oCU^jUfa4hXJwR*!%Kj;*%e*A%`YwKv&e(!-4@N{)YV{6lZza9Z_T1Bui7#gDQuCO(H>*p7?
z*r2&N@^SC-<;$!rj%&#%iL7jFVs)z4*4PQk>R_iaH#avPIXTOxPoGxDOO+RK->NtMaepH9qjs#uP4mWPo
zQgjNU+A~vb_u2f7u9YD+qGI)Xg~i3ad@Sx38lded3v&hoJ)3|?qxF%TGd$*isIBxA
z=%}|ehciNQ1vVZ0d%dn0*ip=yrRO<(6KFu}Bqt}&fC;s*N6F%SuBV@TF!VQmeuEGx
z*D+iw@kZd4s2LcVYx9^mf%&Bh?CoAgI+6OyJAr7dnlKn1$zsbh1oV7CvT%3^an(O<
zVsP+}@b|%XSbAQE<$S}oYuB$kHe)36_ftQpjp3+r!BOOAhYj_Ak~Dvvlai9s2zr~e
zV4A96#iYyeq!uD@7>Fi+C)l2m=eC)CldV=DY)4=LUIGo6vKn_;VsZvh7Y*2;U2Reo
zfGz;~Y{XELn;3hz#?`S)RAx9}K*v>XweIY6Sl+zv1e8DFv9Zpv@JCV=ch!QKZ(UcR
zNqOsw8Ft1-qkL#@K#)?#uQ2@YP9FBha35|6!Z|zcIHP_l$HAv6B&m5r;j;MR_B80k
z48`>ST$72o8;pfd8|AuaB<=_Twf1zL=Sh~RsOX>qJtJc%*fy>V2HaH)VTuwWi+0P<
zXcBY9G@k7#C~EWp5^tbUdGg%6S_oF?PkyOvPs^JPZBBn2G;Q8LGP9fxviPw%Y2P1%
z_w=~G;2-i76czQ5w3Aux-w%c%N({ABak^DXQlAI&*dG8OrD*JX_0pSOP_MNbC#?9$
z=MBIMX-P={Tg$vmopDzt}1mC4VXJq+k
z*d_S~gZbFA)j&8SW{TmB7JQjNFjUuPxxMgZYNph>pIpErCjQk0K`VK+bw#XpA6;2imD
z1XCzY5louX;GC4HS^_eVhfN7K*+NDt0JHi6xI6);Iz8Iu6rku*YHCqh0CfawGKBH#
zdyN<36#@CDIW&>%HdX%KSMKONj~D`i$k+#HYG-TF?)L9wZ{D1`Z=OQ&w}L+ZDTnHw
z%eE0BJc>Nk(swA!tC78socN6d>qQ5d<7ubK|W0|g=
zYM+vVzFItAm787;u!f^;g9hJ4BWXE!D3Cr$psjiO1-%HsKMFBb^OEvp2brc?*GSki
z##;oz7LKHz&-M&uwM+BTZM(TcpZQaPPY$CK;^h;DsA4lLaDs_%Bi=Dx-q&e!8Q*HO@T~OZ6g&>lKgs&7FIaeS&!?ZCZm8D&6{H
zZXAI^7q{)II{@}7vXutf@9TXZ^a;|i1WW~5oXnnR^QF5y@p(HOI0pa(jw-pi6NOF*
zhWGBqj8#_nq7!hqmZGa?1$NrmvtS3E?oR~*~bNliB?j*g)fFCS1G)z}3OUOJ{^Ez&5&FyB(+@zz*>6g4X
zW_fOU_mROAOJr+nE6>POj(SmE&G8woJ4b16nLOf|mSZ%(t+(ilJ}ujVf;~Gvh4j{?
z;Q(l_^wg@j<;e55V2=-T-iIX)lb@8DFhvwk9*!eA!GpIghjK#)0KRPm(gLy*hdWEE
zYpKOdJco~b3IRx#r=G0n6B2VQK9Jq(RY|*IyaZsuoPrX=&erjHP@ngOsmk+&`$<~!qMf>Qsu$DEOm7KI;{_N3
z?A(a9$xa3h`1eLt<~|dSYvW9S7Pq?vT&F>4mEFR#2~~H!-i$}I#%$|!GbXIpWxT>yD5d6uM-aAB)M(6Uwmq9%e_n_&<0w!s{shfKNceGlA^
zR?0R7&$a|d
zz-ypcq=fQ1Kx{y`*DIE(K*oIyiXLL=LV|#$Gt26-3PPjl(Lum~!{}{6k7{Tg)H6Lj
zZF$H3%uX;Pl%J5KUcQrx)cEoWk+hRjIWbly)lK_^oOzx=5(FPe^Q*xQtJ1Mq?V}_l
z#kkA4$#=36T)*8=jar+RAa_U9hL(nMz@5RpbKZfQ@|MwzpJa3YG`MP%AmFa?^RUgK
z4LqwDQ)d_6*qkp~8B)l7bu5m2Wh3!eRkc@MqaQSx?(OB}ku;11!*|wXco#{ujVX|7
z*_cpA$2^R?`A_Vb;h6n9Wu@%PN-9!vzp|Lv>FU
zRg;!bc+dktm441fwObn>6ZqIxlckuIie`7{0LGzDoGT8^Vso>p2<>^nROgDp!j4^7
zQZ0!lG^BnIFhTE_r#wt8rqVcyc^`y?8y+kQ
zILesME$*-%mB}~khQU(w62MTVN&c7xn&Onm*s7+;Vx{||i!;K|Np?zwgW7-I#kC|H
zEYM<$djJTRr3{e7#T8I1A295{sE0WIdqouXW3_i~{J)B?S`kJ=BX*5kK+ANb=l`)*
z0X`+Sj^)jWA?gcOHs~(I<4}UmOuwo>G<660>_7hqP~Jl{;)HHE9c<1hy8pvh4Hf+=
zAvsTr>`%DvcZ2cPn47$4q6d<8#twOwf?AVFGs|NKvY_5SmD$qN&cs`izaM=5(~8^^
zz!;}Mj^!1Dl+J>s!Ie!`q$cu
zVjdGeAsu2=1VnCVmc=+N_m4t?q=Ji0@jr7&I7Y5Wa*~@sub~+X9wFLdIBeD@h1ghG
zLEcSWP_d8}D?0EN%xAz)z(WPpj8{Zg+$tC)B0M6E*FKeq=*`4undl-0b%MdT+rMVP
zjQJ01)ubN*z*2TuFAmCE09|9jj>pAoT8vp(-py&Mu97!j`oF-6dta}hHweV7(qU!tW#lP4eE#M-MZKSYHgn$1QJ+m6`Bg(2dK2k52|>8oTmKy1Xk#0j!fdSy
zMSKmUf}
z0=O&IxUnE1R53*qG*sKgK0(~_tSILPW*Y_#d$#ce#iXQxtku3W2PAu}cJmJpe)_U3
zW;X}{7z<4KH*tO#!>V3iu;$LJFwVv^a{uD#=uRZ{=GjVsG_J>Qu}$yqn8lHkaXIAa
z9i*jf^AA2r@?t<-Suau^yT&^Jb?jjBAFpwh0ZlEyl&w-ukp6GzX(fMcP4lgB?S0}x
zMqWG+}({hwvjzl0u3U*C1jGA!|7
zYG`Y>E)hgxpcn)l5={b-hlK?N;k*qDbj%V6$641$+WUM|dslR#MtBk-|Msq$wJZa3
zajC@n1X*JE`!UAbxBY+Vj?{~wjbe}2ly7?+lr?#VB-Z0_>uMls-nC^FXMc5J306EY
zGmnh8p_#X(sG{lBrDCe(-Y_1?)!DEg7vK
z9iikTyzDPsJ9~Miyu6Nug&CKdL=-u!zg5P%evfCF$Dj7FSNXO{Tw`VTBM_<*hKn_D
z2J~;uV-=ROAmkDX@^Y;ak2Oh&h-q}T{po0F4$;yNtH1RDIN@$fGhqO0z_4?1TJJyQ7febYVM%EUeG+;S6%G-OFX5cVpG9>R6OA=_Py)I-I2Z6Ix{hMZ>%?7bK~lgSG__TaqyU|{0n$X
zz)4fG+{~UwBO!9bBYpC)FDfx7?*;Nrq=LHZ%JJ^-Z$K!pX(X@lO`FYY*92y7{<5pt
z`>^IGvHEIsF!nU7(q}^mQPM1@1G=tfR}AaweyY%OlWFY;Yz5WVlp3u$vVdyFvIT0^OVCZlD?+0ttm-d@J>%=wBH
zIdD(a+`EFkuPwgG`ToL8D#HG4gzbqc_7kR~tGf|vRr!;Bx0#()PR3s~H|HI4yw}u-
z=CCVc)yu1J0wxizX)n!a_Z?)5b>B|!YX!SU(~4151b&0($vMzbgtrMQuvi@|v4Bv;
zhk}Ah_}6{S6`;0B;94yX@Z6&6TnNS`w^i?M9`F6tY4~~&sr&}t2#zVrvkB%^dL3sz
zwayJy>9~8!^v;8w>^E}rn;ewZam<+F>8lMN6?~3cYPabxbsoIqviJI>+4b&(m!8*d
zy6>vFzYRSyS|^f^Z8;2uYiMEjgKK;gERafBvoz>zRfRmUXyt;c&T)+dnU7_5^wVzy
z>@GBL@KC!Ga|Mw?l)42``R3xXaGmdr6T$GK!VJXCUm@D~+rci}+Jt8KD7lJ+4WF38
zXE`-xbCk{PJZj6#%=Zua3|S+mcXQ4ZmY+u1!P0OH^QGM1eEjrdpsLnN#oeRS83&e~
zJ^d5ks6XRa72B+@tv617L}jC6NB0|iFrEtf&_Yzes(FpHzkqaA&)s{MxAa)e&!Lwqamw1s5qS`fq&~?Xa_q_kg>RJkH(Z_;x@HC%W(F^
zin4H`#LDYd&=GlBpYvV83%gV=0k#XQViQrM>4;cm^iRpLWBN5N`RY|O3mIzUN5xfT
zz1<(oyD9Htg%Upw6uyi8vW6I)jGa?D@iT{)Uv-hMtW`gG;}M#NRo{z$vxW7+pj*{p
ztM{X^jaxW32N96oX$6QX!ut4?wcgC*J{ejzgcq$+Q8ZEt^^)#^uCCiAi-8QXe!44+
z&$GuXK3>Bh;pY%G63|_A?KTtkT&2R(tW@qzB^hTM?=ug5_|=AiS11}`{d~J}Xr1pa;z7=)}w9{R7!pt{&%_>dwEzj!8bZj$Oe>xlcD0AzgE7Sl@sA!o+j)ACD@tHP@Dk}zUS>OeXqxB1
zx0UVFzl)(_vjn1u!omwAY8B@?cQng(HG7c!p7iG6zlAUk2T^S;xuh|JgKtO;ZCH8VWy!)Netdao4m=4Eo
zr90_8)a(cat1Ty>3V8|hGWFf%ZNLvcA_26)=&iCJ^>&AW
zLf&yX2<{96kOxqcD)`M0&(LPc`8FOqDL|PBhN}6;CdVDW
ziIxCo_WkON5uzat7sDJBY}|$Qj*MTNDX@+irDYVAPv4T{8L&~=@jHj8Q?$wGw5g7%
zTo+~yT1uvoOBcJ0?|4`lT^~I^!AQlSul=<8!Zo`CKPZ3x{2AA_YRqNo0|n`${57eD
zcc>5AqJjY=l5OR;{Fh&5z-d57g@MLs#j%`ut2+Qv0)WT$omAC{N6#J3m0E|X5@?$`
z-chtoP-Ri3S2<`V46N>bpA&BE@3`)yF=m-4pK@gqs}>m*<2y&MR6$slhK%yV$cp!*
zB>M@w{4~xygipyrm*xAd6?k}DsRP9_Nd@-v8RTt)#`WVxT|O>Tjy%3Y$za~(ZgHHB
zZ>yG;>$vHhA^Kjk9{?E3V*RjGgLl$c>iMB4iUL`8pr?`!bWs9VqszfmK?6;O9%@OC
zib-{N!AO~5fqf6pZ8*Rol>r3#UJD}GsS);&^yvwB-@xU5PL#DL3%a>>HiF%neLRe$
zt?15y*#cotpH^sL;j(^uhHlr!_K;0iQjsei*H>CWftYVPCqc6lB@h2DL4Uixmv!EZ
zbm6P%-XKl2$pSsJt;#!f;rZVmHjW!zurV4JuE0FNCeGC(YwIq(+2o;TcEDF6;Pk6FftTo?02<|
zfiNR8-SoN!8|>@e8W1a35MEnxB-HXWD(3Z|tQ=N>;jEfZJdV>ZW3YySfk{{w88z~q
zP|KS&&x7aMEuAAEyYs%UQE{-(cc%n=KXv8e}G>~uIFlHewe9roS4C~zM1jr=fxWN$-
zdJJl;g0}zmM-?x1?xRy!QDO%EYLNPCBoLwu6q0yf4pO?b^
z@9gdEgJNQgMztqIMMa-3U%!5xV>NHxU8hkUR3I9SSIRx}#nH|?1eWF>P8DL|wnWP(O_iDYg7!JJ
ztAV?r3!Vb#Rx1Pg0rrx@3z}phFFl-`O>lvq41Pa>8DRntcthz(p9icGz`GPc|K_yu
z>AKF&6i6<|Ms0u^{7A|HkZ6r@KKsc3UaYI9lmrBEp(ys7XsBwlHB;51nJjTxicY&W+FTEk8jA84O-i(3#ngEA5YiI15%A1X^VMfgk?!#K;g
zv=IrCNbVYBb-4VpNA)z_TIs69K<_Cn1g;}1E31R;>+Ky3@M@rH%UI?AH7&h+AjyV*fUXvxdriAB(&oh
zx;$4{S$rz*HS07JJIPsM-)Cl6mdDJB}4{-`#r_9Q1^ALRbT;pauY+nJVY
z^e2@*HTudYMrOJymM;kcmu5kzagCBc#c>PG(6{lly|OeZ%drpwp@Hm*D9HqsG86Kj
zX}twSMMY21zX=HRsmd>dKvkk4dq)&=>*5?}GAQqz9|0W{!O9BjNpRwLM2nf_DxLim
zD}Zx)0E=*{_i%1(^G*FBSH)JHO3^BQnZIZdcQf8f{P4NyvLWW?v%)lNspYP>A)Tfc
z9v0d+(v?szMZNGuz`?p!z#-*U(KDXCz$>n&htkydf7Rb@+=atiRCE>>YD}fqs8zjo
z3-=*9xtQ75_;=$P$zAEtT)HU}E`@n$Cd!hpU6G69m~Ac4p17ncs;kN|tC`BK3q@K8
zSM#G@G@^4pO~}sf!`UsDvmsEY=TXkf9?P_L&MK33_lc64OQa*2N$mR(6g8v)5C3!d
znKcFXg-q{?Lo^aLu&QK%0*+?)zH40b!!auJf^8mHM4m}k-cwpvX8(%NS`#dzJUcOl
z0Dfsh4hqaERUhxC9@$E|DieQJl{76pxECJ7n1pYOuc}+)O7fIU*Z93bHARC>Ft-{#
za~}Rch+(YDKgBtd7*P8kfD`Vtg!g9Ybet`Xw1VU3RUcSLNR8ms1IsC;=loP%2yo(JnkwjpxvhFv7#=-RB=;*9
zeYaOJa)Xnofj}T
zOz{8%pkjrqkaxgTgNmXPmkFy>ydrm%?t}UG?AkJDG<|e*DZ}8V13@hsg{Y=i)-R6T
zWh5Idbu}9_tI)PeTqU_!^mbAy#Tfd@^+QFL6+4ZN89Y{n{wvA3XX$7Cm_8siuo8(v
zN=#E4sr*^{QfS?61i~OP`4UKu1U3CL65xjxeVv`7+Pveo^*y9xYF#7p=11i4xpOEi
zkPN}GIyPA5C^X-1l(DGoYJTeOe^TWi_R*Q5d494^S+fQJ1xcua8pB^=4SdT@9t{ls
zMpLbw_uDMVrXN19dUxxu@Eok}s*zIp@oHjF#>1kj|VHcF{pfLe!Q`ID@EhlHHa%p5PdZkZB!Dc*YbFNwHR-`!M+
z!*K(TZU{CxAMe{Q-mDTWj2tJ8=5oo4&$p~*+^(I(wq=!^m=;tjcJj(TwRa0Cuhgtc
zo53kbQAqPnu?@eo*T85Ty&Evdjca%vL}V(x3(kSKp;HGPfKPV`8Sc?6KCJA>Cb-q~
zIsVo#bFDc{Q-Acyu)6L!Fh;#A9NyVxTDwNeXYF9^PAx-)o|83SA#`Sz3B?61T!reBzNb%Dhf?QmIC}suE-VnR_3VlDT)L
zBTL>wi7GJ}L*|X4
z#>=JfXiFe)%ztw0t?&VP$0+3k+xe)TrG}w>)iJT9K?$Vbp66naO>>A?SjgCpz~rqU
z&hhfvibIBYvgsgo$~+}M*<-iIwpnK;((u2Q_xyk&2>{!K&;WN@B$wjdZ!7?!gy7yb
z4NE7BsP2;oqG>uMoLl+l1wK-h^*;cM!VS-R?cs?N?pwgFLu$q}A3&qH=eKY_
zU_vclg^63PW0_5ay_B6gCR0G^lIVh~14`iVD~4Jminqv2QD|;6`T%~A@sYo{KyS87
z(9UWA6?G|osPXkJR3Sc9pE1_zisY0>Y~og2M17b5Q5R`uRySH$5A$?m4LP{0SZ_?}
zTKs{b{%Cbt@bkcP)At`ygJcLM@Y4AxGk4>9;fcGt86+j4Q>U4rn10{=@A2u3&p
zw(i*|o~@LI;VYc$N~^*~F*9TkTpXG{e8qvFnkKB4QX|Js10=Lom-M?ffs8XlB+3g;
z#-ZG^!Mve21k!|Qn90y)N_CmuH)Ql~D`VGM)vhDfps
z(m=mu6`-XiCfV(fPf%}PqBt?tS=o|Iv=@e!nF(2Ib8b-l^B-*hp-yv^Jc>21ttqH2
z3Gs}?lQNXgJ>a(L$Y*90qs1dpE>DOR1Qvn3GEt|L>ayvhwW7Q#y@k1`mSWpzn0&P8
z%voCWS1Ff_2wmGFV*3#^R5vaU!(&}J$A%u+8}ZMJ;Kt`}9M>J>%9V8HJ3
z;ONo0O8eu?n32Ognj@b#%(t}A2JtvY5WO$-FF6*@xI=y0SC1EsVQQTd1B3@f3F`<4
zeXbttw%pDZpDXDXPHS$0+ZX=gkn`Ww_#O|2dR9%$VC(X-;8^?FyOpLk)?HCE-y^#-
zGTLO}8k{>y8dN~SA=#lAjhwpcBie(T>!={}%IhZA5zAt~endmVBm7*{FTef!i|s>8
z0IPiE2k~tF)YRRBqqI@&aX;MWWG8Y*9VpQvjj7BeDPDb0TI}KTg#2{a9F4tr?eR;m
zkn+U7Qs%b>gtX|;egDI9@&dMhcKVA5g0pW}RWqaU{zE1A`|ARCOu`NF
zil93$kXfI560Nm0Mxix$8ox?KKA2AX<@=xLs|%vco-gsGI>-j-oZI)sh^!A8Fu&&8;pI)Z4Z-CD%JM{ghr9B=6L|?$LIH
zv|i^X%qY=A)KAL)Ep{$0s%#=y29buFY0sT&*`KF6)eO>E)cIM@C^$bDSw27RKj;#8
zn}BUa?Rd-Rv0V48G}eidj`K+-FvV)sYJQdrRHUz)&Suk*tQ!AyJ&J~k#_ajuv1mv1
z7j{tgHp^p}y$FB&USvKfI?*(l*h2fg5^or~APvldzQQ>V$eY*SGY8uZiVdHi-n$4Q
zD16GhRCIJq-t3RX2^3J8ybmXSIGl+V+iYKg3k0|$Z-KbVLSyZds4;epJJxo1H-m-e
z&Bu}%On6&;gf9qvnlC3k1X5i{LiM21nf+twJ27$La5r5a(60D#>e5NLIcx4L_n>C{S(7HU|bG?
z^7O5O-w}picPn8FNOk!*?WVXzA&HO3eE3c517wdWiRAHdy7_PhQ#f8VO)%Z~gWUI*
z>5C))#Ag#y)yIkcX4;2gJgyN$91Pp-ba*IRr=n4!%kP>el$4;={jC0?ZDX^i{!;@Z
z>T*fY<1gRdJ3D9me#@^L1A*CpSu{CN8sHmL3~-G-@HPVJ8o$0py>GYlsbZrCx3Ri
zQ2oTQD!c88LHJCn8-?)tUdFFuPKtc5LZ{($KU+|1|5Q9xIRz1z`p~sPoZ`#_SrJQ0}nvU==sELaXUWPceIvqwg(}o_|
zn}9Hcyg%Rc8n%n{NZVq!Twzg;!nH(jF1M{X&-~?}gT-*<;;%6!Bh#pGr~n%xTS}L)vwlZtJr?u|27Mt!3V=WFA`1!0&
zHeGllo=k2vk=P8*pDb-kDoY4xt~&ZMEdO!|%JvH`UtdBgXLzgjT<#;0x~(_N*Jm|Q
zY)0o-C)l5w)FpgqXjoukKEDcE2qLP}KO~N(u$$?d9*2tNjq*LaSLv!jumu%LLa
z&^#95;7e1OOwqHL$@wXWd5kay0h7j2u+Z{$Byn0lcQZ5H%z_yexAw1+sb6nRgfd|F
zC%0CwZ_Q-rV+W~785v0D$yakaDT!t*JCH#EfhNObjRv$PQjuuw#JU^@Aqgu3wh&VH>mDlMI&!
ziz6;lPZZu4UIfa1Z>ls1tTWs+-Tt`3hwi}{Ag3o1AA&{#bSF{!QZLTKo2C>`K~jzf
zaSO#_b~&_nCFyX#TK(0lh=|r}FE6WjBx$hpL=KuQRPr|Jfms}T^27FzCbd5Jdj}r9
zFAFI3jU+3jVJsy9i-4Rx^r#d6L7}<<`eIM2tCn2A$e-8q3j7@qL1XYSF^V&!X-Z4e
zZ3?TgPwgwny#}+rZA=xb(sv_CSqcg@B)ozbRp`u@G?Nd%bN4~(j4BHfq@n&@Ea2Xt
zdEWdHJ*{5MH<&%t>9XUUJszlOT5BzZ&X#1HS=}m`JGwCR`*@27tl`o7
z>`*=D0bls{ND#gP67k)q92z>xKrCI;@L3iAkrcdfpl5kXa(}%C6@Kz;Cqu2B&iF_)
zXNLWMY#l9_Sn;|)<+$P5I3*-3L>->4TVapn)c*5|uV0@QzB+MT&D?vUonF&+*@$=z
zTYzS?>A17^d3@_&$=!zXy-gN{LQJU1FJ13l|IK((R9+%A!(>%?H$}W?ty{)=>0cm3
zXmtcUfRIM3_3aH?3-zy^G!4&pO=D+R8hiFj%rGI-Xq-i=jrWem(ic2-@)#!kOQyUe
ztT#0$atPL;=OGNPn=lMt^C>NPN|E;AgSmL9IFwgO6oU*zmt*^nYRkE+*N0pGdIOTj
zduR;Rk|=|?A+9b3t#rfsvL3yX1qb74VENhcs8^cZ~EZRt+eKmZxp
z*SRUymeU$q3Fr+etqs2_
zbRa%~!kuWT@X&$TX~ec!bhN2#QrEeBEn$S!(5tpjMywxc#Kly~`OV=Ot_DZpQuvp@
z2|$%W&#cf=#RnoP-Nh}w)QR@G{|XCYMyRYpW$~)U$=gIINbv7{x&jXeROe049E)2c
zuF0^tpD(g-+vpf5vLo+P->$0EWX(`WvY@M1g68=MOEG_i#|G6Q)}g>~Dp$ZU_CG5R
z^-hcLFPqtX^sy}Q7@NQG%s|A)Kk&LLdT+5ogseE(R3Z30Ob_|E+Bgz8GR8MBupZDm
zSE^zvBPKKbH8K}4vK{X%3kKbJjOORLkBMxx=AzNRRjqw?{t_h$>}%?I_!!8g2K6z(
zyDc&7o(}mK6xCDzD<=2HRX;|EKqYJ1r>V4P^SCSe+ScP7Y;
z4HElS2!$35+C6PYVs77V63{&6eELdb;<3XsESO9G^Zwf>kW49(EXBQIYyVyK~7C$h4
zDMYk%6FAhL;_=*S5IXkz+XP2=WuWJk0gz=a0!WjJucH8NT`cB_bg9X>!PY>!H2*W7
z`$V7?V*d#Xz|~U+2&fR`-puT*Fd+Afao!t-FtI=Qa!sVR=yUrALvC(Ah_f>w?U>RI
zk;Uh6Pqdrql{r{^Ra)dNX9$O+0N-=SxTY$&Ml$buW~x6qbyHYaqKM@WYhB709tRc!
z7~E9NJ|Xtxs&Vuxn}fDfhL@ia^arvd4=A(j0O=uv$=H+N`GQ7#sGA<5BGlTNY3@nj
zy$Y2FvB|2a01TPlLe0io=yo87TLQ55#CF<nhtejjP)VmBWV=;|2(_%NHCJr#Q||
zYd1z`?yt`riUwwhvOpm?PaU|}h;KOPJ>l+ikvrYa7W1KbM=js}g-&oIL}oIbP>pjv
zwHFp<U^9_QYu>goYBClR0K554y#i0X`7`G7o%5-f4B56*M+tgiP
zk-D=&N2ia6;k|+rtzufK)x-L28D1FAEuQ&473~4r>DdWAYNYS&-~bb~!mL1k{e(nQCR@&y$`tI$#-agV9#RyK95%p$=US
zx3iJ)uMEatHwm>Y2OEa!mhMn*78HAA!<$F|mHhHyKuiSH)vAfLLzJJJ^a&IFU4%1l
zxz^F!MgK)tLlSobl~|Firg2RAJpzEEX{9J2mfboCK*L6|TW2a3y)YduZSQ}fo5V&3
zT##ymgl-O`432DL0OGny9pBu>1GL0lc(KD?<8{f9JvT=@4%irDPA-bL4-#3^`7b8ry3
zn6n2(Ot3fknj~btFiyLaDbh*4o=@Q<+N(m@s4h3mSB<;UDQeHRvX9x-tU<-GI26F{
zxCd&&W*kqQ+k6F%w*0B(5Mx7>r==zF0uDd?D6kudC>KXPBrj!QkNPuF2fvjGq
ziTRhHLLgHT@F)Xf6S>n+*42){w6rr~#HWpk0lv$mOVe
z_2UBY+!b3b)K43|`|6V<_>vfPK{4T=4?)I(!C)>e`B`A-cX_1Y+aRyw4%^51QLTd%7)0DX;
zLpUBriWCKRJ31&KRo#R(RB0J{thr=tgT~Oo%ss=5#YsL6oQq#xU^qvfQ!Kz@9Wycb
z-7a&7CZR}95(wvOs5qpchRQmUxnEd6+nk`ar5G@Xcf)30!(CmWVdp5dX;%m6tTp0T
zVE_pbe785%cX*8{zEK$DLEH>55-Q^OPx%yVmpkQkS`tg%YmJ_&TFMq33im9}j4-&i
z^A5+$>6Ma^H8k;)C<_%GHhwELvvVkfJe)hU`3BQi46{WPDftUSS7tsSH(Q*%l@zYR
ztRb$PkiGR=&v-Jy#VYE2_COAbi=$f|DG3IEH7&WXAe5Z7@lkbGfNCR-wH&VQ&}=jc
zXr7=Vn~_puL-L&NP2x${GiSElzUL_#buN46KrMv>oTW$r8QIX#;MozD^GOm_%z)Kw
zJhd6DdBeq;gH*g3$}KI7@^3C}0kn?WoED~Ip(KYS7Di%CKg$&>T0WFNIy3BSaJU&Hiv`^7dxx0LcKOzB&hCkpzY7FNXjrG
z(j8^>tkKG9T{&mjv}QMK(IV&i68Gu=m&J?_qq(njAt0l$-{}^d{fea#0<{~7h=?Ss
z*Em>wL1neGx@sHM$xaV~5K>U5Rcpm{z-HY^pwl$q9LFov`DG{XF`31D0C`WvQ`%0o
zY-q)$siYKT346KEylGTe8!?4|TMt=2yE4(20*OcjZh(^0`!poniU9|&cQZBGq_D^a
zV3}GiPJnVtfT9}lJ+Y?O@FT!ohcqX8ao?5H(f}G-wswV)0wYkT@*Q|NG>xiNnn$IRFv%Zhbc{FgF5eVBSp@
zYq`vi#o312OkB6v*$C{R8)k;CSZY%$cJ!*6i&7lA`&N6VDIo3mC5I{m>-RZ@5yIR6
zjN-wnsq2I9-MApS2Hr==5VTHb%@1sqH>6Usst@Cx*m!Hz58Rx;f`s(!2$7^v)g0G<
zBcTF-_5qB<8C;~ZXzZ#OpWN}NaENYKAi6$qhBqxr?
zRLV%{6qjA1*97owQEIp3om71|&Gb>aVVX+9`}+77FCtchyv>QD72(L*?`#}MN{p0p
zCb*|GyiG!N2Yr`go9VBw&=TW)?-vyg;8C+I1QG7%m^oae11m%9!?2!KowYiAoKY<@P`ZIi@S
z8iL9K1d8h`b3~!&J1NDwr&?!R+RaeWjvB$cQ>`Y_-uDIZ3_|(2k>NM
zWLsZtO`CN^Cj;&dx<*aCLRW=rs+#qA{yy9l-r}-%21?6-Pt~k>?y^ax!qi<##ms%L
zSLkdLb4bR9yi29F*?yLG>8@U=!URq*_*vuvh(O9y28su64W!*}o@mP{t#1~uYA)f&
z4-c7Pa(r+(z5=HA1h~(O0v|Y`(S{&rj~5OxqLae2Umbnx~`Fq62c>3?^~4F+7{Yl+_;Lu2(ohO!tc@tmaC
zRq~_EhT}6<2mNoS@89mh{425rOCSc~kvg%l0D2AqX@xESDY>&%ofiJE{@@(ghgP!r
zV~MG$pAq@ee@N`}g-s8*Quk8c)88FR(QaT4RcpS@BAam!3bt*KC4Kg4Cb8C52&~dO
z+piBnqvoHR32TBp?Ftn>H%NYbN6H>~qLJ#vB4K4DBn~OM_V0qTAp^SC)2^sq&J)83
zGr=^U^{=Kv&U5`^H`75UVn}3jG1`c_Z{a$!mz&O`EwPXOi~
zkmvkF9w-6vN+*XZx2@qG*0##iUecPH;}Hyx>`>LgKLz%$ID;IBNfuJcvOxkssvUlU
zSBTc{8tFWp^LU6DMT)+)3>Nn4l3#3yVpf!B>z`2d(26JW0*S*kroH3|v=y0@GFlIO
z*A=Y~%XM?U5|76Vtl!|AC-r}Q>U_mNp?RWyds=?p00c8ba6%-?xvTexf%PnX25U|^
z+U{}~7epOfph>bl#)7{0h9UvIS5cGiuySdl?Iv){3WSZEW;LNq`lYx@C}=1vEF@*S
z#H04_uY^#7e-^_5*oq)|I27d~ggD7rc0SK6RG2|ey25irD(Yqcy
zn2?SA=T`_7!I^g_Yqy3@A0blqXr%zi_KFWy4?UhUXco@clSAekx%YQaPu3lb%K$bX
z1bsvf374}_1)SLqZtJ5t-KOu>agLc7&;{=|t7@Zpj1-L@#ge
z86Hdg;FYm2a}60KJ+n)nTtk$bt!F`{Qr?)i`9J*YzgGnwE#axw6+K7~BY8xNH
z^?m(Mu;q%I6qK>JVe7^K?G@aO8LXKW$1`UcKr!2nt<1VeHNW>$?zQeT=z+Zut-ptt
z3B~{Whb;i{DRhKDephafV8kRhI3$8t0o6hAm8P9xo`oIVrDFpGdfAn_oI~+%aL|(K
zAsI~+@YO1Bx~WBYAB}@RAZy`&5*IMS5Fh~F^^7ObfM;Iwg92C1gBKIMHfy(N9Ys5z
zzx$PE1^@WZH9#|fqNuBWQqTg`yVX~ll2=q}nKH7Ki0)}$J?;D?t@W3{0EJZGEAsJN
z3Q*S${N14n((8pE|o@2ip5M!Sr-2yw7&(BtZ*w
z3zy%`zn(&pEd!rhs=cZTX*IKl0im&!MObwP^Y~rc?81_UFE1kIe|`$~5Q?tPR`Cx*
zo5$)VSr;Jpb&~)g)bo$oOW`Uubj`fg=E+i5qz6`Ij7>{sOdFOv^C@!?2U(^zPfQQ=;
z@2wyataikT?cU&_RZ+ekE4|A5w;25V92_>g304u%+a*nGMtbzxsdNXmsuYC$!q_Q)
zr4ujB!~-gqHLG|Y0`6a;%!>g9dQo-W(hNrjWzj{)!%*o(SjxYy>G{$AtO369bCTZx
zOz93)zV$qnKeEBQc+0YeuU`fAj5Ge^7y?TMO9l(&v%?{F0%R5qqL-+b_P00F=zUfu
zy&5CT>)2t|AGpQ^%p}@l^4B}?@SDGH`iGDvsKiDU*OkI6ETz!zfY>h}mX9eUED;Q95x$?p
z*taMBe+H~xuka{{5R{v6-}p<^NWp=#jZr@>1>FZUuxNn@L{|f6?t>ry*b_H1-~nJu
z*m@TdzlJp+MZB0vp%?1ixz$tr@_MDFU|Vbo@t?;Z906_QhVT;i)$_lVqYjW^1pSdq
zyO}jex|hpfz*hwj^zL92v%Y!t*Acw<5mdB+61;;o8P>}~`nAe@P$8}77?RiT7}BM2
zz(^tSFjFNuerY2QAUVcqt69fY
zLc*^a1Rx6m4LJa;3{FlaWjk6a(grLxcON)bi-&^1g?b1cxNR53*>kV{o|8vj{XhZ%9(qelMRiVnDW9$QgApyG
zamnAYrLz;um~t3I`!hfgf4IbCoE;+78FM*W?I|e8Pw_bl0Ux*vICMmbVDQURRACp(79tB
zbpZs;$bmq>D7VL=rq`DqsKf)h~mnuv!}%&a*t*_;S0@a$drJAix10mC4~ck#$wcYEvLd<1&!gCE~{Jqy$FEgEEdV|
z6rwf(Y$tnFx8j|)KIro*jTGSM^{ow7R8-*4_nVAG;V|jF00U)=JOEX4e0)H*2#sC4
z@waS&*&!_$^#h!}5D*w|?pM%I)A?wPxq5tjjJ`+k#H_x}ZX7@mGgA86UW>(3snP+>
zYh#*&U?0WN3IP(bPF1fHJ_S@+pD9O}{mnC5p7OjA`OljU3qgV4cF4sd2p1O@p%mf4
zQdXW(V0rlykjE^mfiN8*JR}I=6`Y6&4%=L0CUv_XZ}CTSLIDSWsIqbtgvSl6*fyhK
zoa4UwnT778c9!;Krg&?0Q0xg>7J#LF#+C4QG9Jm}Z9QnU6hkxbjN{tcYNdA!QKAU!
zmiJ;d=zBD3E!GHxhd<{?kF@Tv$!KX#vFYT5W_(FdM8rdgLj!^u*!qk@F9fi7`mz)x
zA>>ehlkXDSO7pWIN1LfZr~{I4WXe8;6IU|pJVX9aGQYO%v+xU$$b)*OTg6$&Nv~eJ
zx$&^lX3!6yDKWK{`k`mQi5n9w0>q*DWn8HHFcV#|&ZUNpjg~m8BZ3jKSN=TyXrb^B
z?D2CzXY4_k{7O&sS(>nltV3BQ&8lMBfe1&KF%Wv3aO7FYam)(;=Ep7s5#bb~RZ!H_
z)T@fwFcsq3Tv;?Ygk$uCr^&ABGru4}{y1v{@FS~-WpyVx{$j?E*$l#F#OSbzPCcR#6D+3M4Q@rKP3qm4*r4!2=N^BPAuJ)4Yp4TxFXFG19hi
z4&0*XOb87hY`SZ9$Sn=9ok2r#pq#zIv?6TMbjMK$WScrQ?dUg~(XBaJk75d8J4Isg
zd0Vx&RSxWZZ^2DSCQfrJ*w7x-$_yvQfXM4HhUfnNYp*#-CPR9SB4)0*S0ea2zTJ0^
zRl|Yoz(EaHHJjBDva_F!Jjo#ck8fXUG)#PU(CIn@aSwfJ2eh1vfXnt6(4&L_LP5tF
zZL(v8m&
zN%iJ4f6l{3Uyzk=g>b1hetgl1uPyVzVHR=NUt0~d1$g)j`aPrvfNEfM6|mBVK=8#f
z&!2+;yFl3Mx^;BGFbt68{Uhr4A^u(y>p`}BcJl1B>=?A$+r)ue-D>Kx
z{lI^nNP?$xB{(0g8-CVVLMe2xGXY|)8_3fzt({-mv+Q6KG^yE@r$)(>epqiC{IGg4
zR93q-PxdZp8pw{_Kt|v~vj_B6!a_m;09MxSUNwNN#$P@}6t5d{1r%{mg+WnXF{TMb
zUpZ_GW$!^8qWKH}%?dd=RWH!HCvRYyIk?7hD`aj0q0|Dw+7-6a1)Gdl0(p}N$t|Y)
z!Z%#qpi%$;L_$VK*I{D6s+N_bQq}?h|7PBx&;@|qiIfinjC~O9vk)MyZ}Z1bTIYwj
zqEY~hwZ(ePzDSmQj@Ir{|J*T1Lt(Bzp2)vbytaPS0O1INzhLyNM~Ewa`3Trw0utUm{6@b6`|iyl`a99Psy#8IOXI|ESq#CbeGVBy=H
zER60L`E~=di|55cO%0Hg;wX(h2EEnxmJkegI{|(6$q1K5T}+N*!RK272Hsa!!ysf%
z&r-9VWLoJR?4AM2Ddo28eUTS#X_R||gaG+aitdWbdKdUTG$~!If&`m%o@y5p-2++FLe+2Atx%L
zA_qU!^NyBhDtgRMCAbf?82zICcrx7^mh-Q$vuGI^m9&lDOSL7o
z^3LJ?1`8^E)HQQD@v+m(PlE&C)bv_woWUR?GV;Yt$)Ng!ChaHWHxZ8QJP-*&Znepg=Q(iw${$QqD
z>+v0*%@1Er@1#p1{xp#xs!ivLSf`eDT+Vm`Peh3}WV(Wp?&WtoqsR+j+7<1IeI2Y~k$2HPALr*Qzr_07|MvZM|ckKJj;a$&;
zCK(SrbMC64-~_~hk`Fzs6TnFCD0>P3f*w!z8(^`mN~Gn)SheM*ibp%lXp&hV#MDYI
z+$@ENRqbrseQ}WurhuK7(!Y5Oz*u!_rx%_Ku}g>L$qvj%=4lRLaY3Lbtf9_;O|Tsp
z8yf{cx=^148w&yYaKKP9mP#d9GO0TSBW3Kz~1%
z#-o2qLD{VoVp{&=T~{_|N~R1PD#OysFhG_bM5fgQOHB>{nVD&IOE^j;-leQ7v18`=
zjX(9`gaZfmaBShovowV4Y1wN($s8_DD={U!B;|NizVf}8$)d&NqX3(FIsvFk3C{7
z#9<83Q5u)(OU2xChG*1i3wY{{8TrAO-DYJ0EQLLlm81-~!1M;S^Vws*Wk�AV3#Z1jkk+b7@9&vAz6U`fxg$Oa#k_$dfheiN8WX+?+(2&g7`4P~qN4HHWv|jNy+*tVO
zIv?klyYQrey(8XlQ#S?1)0sVO?~4!TOwf}&sRYoxbre+V^7N>vs0zyp&;Yg&>xbMU
zweFEE=aj@ZxB!nwjtK3po6t#NZU)d_bN%tIOm-P+m5hL#!aV>3kn?t0H$T92^BMzF
zqQ?8KQZ=wd@6J9EL~h)i>|P&l{tf$6#ytgOWH&O=un4+=k(@K2Bk4-SMl!`I;=AU*
z8pI}Imwb&T-#6B|dM4oUIv5DW&_2N3=6`rzhvB>{hd#8{opinP{d<)ibg$emEylu2P2nV995~BLlQoWI_Wkui*Zd{e
z7fJPp@;?rzY98s=dec=3L4}eo*}-}*f|1E+d^en|EnH9RbFH>sfAz*{g=lA$OBNfL
z*Xzz|7w3|5ri6ab=L3R1#)%|3bi54>*T7zwn}k5p_-08}GPep2Y1ap@+QTJk>M9V>
zjeJ~T#Xp#ZH7l*mc(W4_KXOd@(qRwK=9`oQ;pA;l<7iaVjYwQ4-
zqYg2%u~OFmwfE)kY~}s?rFhy=GoI?Io37dtI<~fH5k`xW*rO6#OA$oJzAvFO(>_|N
zgxZZ#Yv_>JVyRC1*!Kw1(nZyhq7^Bn_`HtkOwBX>2fo+!^;51(I63c=bKbA}e%-J8
zejdT+Y5x*OV&(q(uF-L%I;wdufKQ&55qRXj19ts9jN$qij+O5E8w+|hB4JA72|kmX
z!K+3`Lh6AtGh`{Cr@M>LXD+svBnb&Kmhhl)uyD*{W!bb=_aK?x=2qU+IS2OdIuDzc
z_@k8*U{9X-YcS|GX8>vMx&akkGMg?$`+cnbossFJ0&Q?VjUM#TqidfSruGBJ<&CON
zgL$|5H78M()EJg3>7g;PYCJI3rTJ<#RaHI(@!VJ6F3|*;F7nx^w^K+2}%aph~?{T4eK<&X*eWoZD)|Ajcy8fp==#pJN{_
zE}Qv|L%Bcb8^%2-o+`+BVQ2!tU!UgJGS24-;yBjo1(sBr#X#q_~ek^y&!(C`H1xtl%O+^2l^j&
z@|ucM@9{Sgtdb^m6kt&78bm{T%JUV(g<)da-nb)k%%
z_KuD%2I@om|@+H{1%>yg-xcxoXoXbm(?Mf^_T=>>Y3?4A^aR@4VPf
z71z5rcc1RIJ0m0g4PaT*A%_`BgzJlG6i{zxvmzyjH~#$S^PI;B|y9n?U-DLord*
zs>&+{(Aj{{VH$a=7y_K$ECAc1SZ_ENoQ>kH5D}@PeBCGGqM8qc8_}Z$mq<7e=KcBA
zfGOcxGCt~{<7!tpHv_DU_Jzz}>iI@LLIK&-m7G~Rh}Rb95jWyHwcDcd)wkngMozi3
zR02qzGX_rD!vo(o)!M4>k5r<3fRNUtfs*XEPs>bf&MsQy7?2UW?mX-Fz)8G}4${VbO}f&lhtBv;#XWkY87;f85^*2NV0beR(E!&)
z@XStW0yg^JrVr=RyByF{?h
z`l~Qfu&43tNSujQw22-0W4?ytbQWrtH?!=zR}xNr$&0rVFY;-l7TWCK7l{c*3cg+I
zjfPh{L6i$yJ9mbt!v-X=sS;4Io~kdb_SrJ-wF8_?eH*@?SijS|9I!gv`w=PNB{rak
zZz>|w3MD?1gdW0lx1PMR#&+_p4-k^o2yDJ9A&0d6$7!jkv>%woX+9j1gFa@@q9L(*
zybLgtj_cd^mCp;gsnEK(pZpPu!?wr!YXbNRBi)!g@qyq!h_H=h4m}1^#k%c2Y3;Ey
zB!*4QQ#fW7U`6i%#ebs9gl_Xw^^i|~JxQ#
z+QlHwLWw@9C_WzS7Cbdu+37fRMm+Bg+6_sQobGy3RXuu+nZRAK2}no0BL3VpOtT-p
zf1Z**b3Ems!i
zfqd(}RTV8uKwfNO+8Wy<3QW($_AO`=jgeH1qN<7GJ!bd_70FG#
zzkSCrvxkNdwU=IXb~MHF^~t)Aw+3l=;)5DKo0zG1%;jNA(iW}tH$xYC((S>M7a1Kw
zrisRG_P}UDbRvmh5YTmQyRN(YZ>K{cVnwq8CFFeH&cnIy5>~Ra3f$h>cKpP7RaBTI
zfJ)ULfyM$AiC=?=(1Qt<9ydtA1kS}9ILlPd$5;cRjEZZ&VOqe%G3J$DMdJC|4Sus!
zB`}q0_%=Gwny@UeUgYj#UaUMxk0>+F%LXx-2Ysd%4&h+baGmx2G39sTYI(P)1~%JK
zghLQLU&egQRmtgyRK8a!QZwi{&GuX?5X+TC22bJ-jjleLH(bOJvq{Gbyb~91ghKvd
zkF%cRLH5)mJSf2xX#Y~S&GCO0>%(M(->$N1c-)h5S43FvX%S7PCN}Md232}Ei9;he
zX0tO`5Y=(E#O1^k?4fj+l-MIBwxzd&+Pr#`$CloW>qIb_|%h6NGy0L0j(?
zxvO=j`?=|uwnDI(#xaFld_BcXsR{IRX(IFV!`VLn>Wj~p3}Q@`F24V~P!TnfM99fIjgaWO(PiTA&PI4CR+NY==_-W1s#thbIadlP)WqC}MwJm0%
z`1c)7QqNT3S<@t>%_t}j^jN5__}78KXva164yAbuQ2ke&J>-xYhY}{F)R^6*TW(mu
zw+G`#Tm>E;9BnGon9QgrqiIUHIaUvq?~bK;F-4RZS5kdv)P9+|3JtlY`&P8USf3WY
zTDh6qo_)p*VqON4DJ2s{Rt*fj;;8+(v;lf=ib!jr9Cu{WSG}0wYQ;R@5FjU(PvTxc
z6>r_aD0;b+-&eJ=yof#NOWv4I!IOW=7q~EoDU>iT_%t#Ay-8s$JznP&d*m?py7HmCZa{!M*-fKS7+Z_17tQMysHx?2w}Gmj
zao**ne?M&MPy29g?Qr`;1E>;1!edqye;G5vg>nOUsiwZIUb4E_Y~h>F)?3!L8x5%y
z^xFAD5WzWnCX3l
zB3VUgKD~%k;~c5IhiJlV<6gs{U*3#5I4b$YxLW*fNfYZHiA&
zx?V`pap_K~^c+pf@USQ)FQU^$L>bH#r1U|TrR98>7okuuO+SrakfHi6Woq
z)Etomw6FxA9{i<^I`_H$;`Kn|^4X)MzYgZJr<4}y7>nqWdr8SdLm
znh@hK!9NeWm`94sEO}J=-YH#2p}yZX(AHV|FAhdC;v-09z~4(urN>)12C}nIhX!LM
z%yWEjJO&V-TQnN1y$m?P9La*7VCGzjnjL4xQ2L#Fs7MXZg3CE>Ohl={qtYQZR@b@E
zuEvHDv>-dSBNpF1Y8X+2PGWZL#$*@^d3~4w
zcI0j%g|Vw7ikyRbM(^c7pF%%UUTn;1&VG_z<@f%w|AzrbY=MT@rtuyA0o7$HrT=v+
zj0>+!)gm7GcK4}H`eT*?N%SNtGIrZt!u{ok@->H3$9kVj<3ZT{dq{y}{`VDed8=+a`^>vg$s~MCRE*;e!3qf)=tcF5NZI
zTEqO-#i+&8+j&$eo!|@IczuQ0W|`vaB7rBb4#}cLvT>Zt!Xwo?RPo9g`KTY2k2*0P
z%r?F#%M{SuBW*%NIhT8p505L2KUR`_%MQya+tMpHfR?RS?z6PR{W{pn-`SP;LeHgb
zY}UUE&Go*p>tqkfqG=6+#rQ*k*CKIw6$fDqg}k2CK+dK9eO#(@bad|asK`jg!2s=>
zJ1z-&R!x>YbyK7Xd4IU%^0O;!nX(;Fvv$e)bPw|z&XC@f&?l>~bN
z7l;43`9u#d{v-<}O`1QzKD$s2l|%n9Ya&lQASJL{
zsydB`QYP(9JzVS9k>&yX{eP6dk1d;!J$m#+?5m1>S5asDt-VC1pj~oT?)6Ztti|Y;
zA!B$jG>cz%_ogZYKP+@3Qr(T)|Ii3v&Ix;kQ=w-nQNjE6ZAChfDC#Wwy;yf#ypqm6
zjos6pV;?|bl})aLx&#~f1OnGst&+4pR($Z#D2tomtvX#oDz_%L-KXffv}(+q=~Kj*dPLK&s8I4
zor?!So4gT9jPm4oCK8qCt=l6^>@eckUqBE0k?ekOmNHDw?iPIU;YQ2F9Vgwu8@db&
zVgthop3|N;Tz~j@SM>{6+#+T>y_pg9_cPzzIb@&Y^luA`%#>9dybNREJF&6nLYwtQ
zuv<(B7@dysX`h1Kk~%ZJjIu%=p@CQ|88+LS-Irwh-{$G1371g+D;rq)>#yKod>2m^
z9&2f0s*O}ujmmelH**iA$D4!}zNSY>&a*fAd1dYpJ4&p7-A%Yh7?ne9$XiTFB8>iK
ztz407HN>D^A!)eFq}MJ4Skt-H@n>!)Ru2}}uO)FtHm3B?6;>bY2V(bgDQ;Vp#^y&ij4WSm(N0!C^{T`tX{^=a1W=;m;Il`QxwS4rEA-&O007
zoAbI_N$9@4$|$3zkK9yj7hlTL>E18yW!cMXKT~`l=jFvU%*XDHC(dUb
zJhJMgvIZG^#t4A9*gImp+P>9_wp;TF{-SX}MJGx9D$#CGDkWWyKC
zvG!G%4czfduMYe}3jN0?5rPCZ1##u5|J7uF#^-;yDV{@==6@mfFR%VIv;;NRKhJBO
z;2%B;k*#0*9SAVMJ)sf9Iwi99T)rIU6NnGTw{K7UD!&G*MOYF_uKT919(cn%%t&<0
z%PD-7+Y0*|%Khij-|2zE*v8WSpJI>IN^i~R&sR?SMFI$o>na-mX5;#00l=l``X;Sg
z|Nlb&KXIX7(IOCi1#0H2YF@bdrui6GUEL;gYQTBiS1im{@573X6_;<@EUV|V-btwL
Sv^=p6ess^_w2Cxs!~YMALH64K

diff --git a/priv/zstd/doc/images/DCspeed5.png b/priv/zstd/doc/images/DCspeed5.png
deleted file mode 100644
index 900b0242f6d285cc15b774606dc38dc746344223..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 69278
zcmdqKcRbba|37|IQiK*>c9D^pk-ehG2-&jAE_-E1m`pI4_d8R
zvMzY|pY<&jYk4z$Yug8wdJyvm4^6F^O!cfUu`^v`;x=Y;k%mBapNQYQpxwTb^&TLCX@gK6=bF!&RhW*#kabAJg2l?lX;O
z(PSdlI?L%%bmCQ|+sFSHJbP+Bb-P_VIW2eU>4{U6mlfPFz5FEva98*o_^(gLrM9W%
z4z3FfHQQmtkMkO6l&3z_D38h=-yI_c(*-}t?*<`ZV9f)vP_(@V9l?1P+^k@QC9(d;
z_kV@)A018
z@(@T2F&+2b6SuGa986+~5Qq?`g5};5NIsQ`x{nkZ#LYArzW?NrH)T
zL@UA?mcV=oF*6gGQr9X^bKa|_Ms!J_ATO^f4j#w`A?&L6=oTLj}UC!o+bztTJ!Kfp3ua<}2G8~6YQtv4TEr&lP7UUlCP0?XQal(`-{{ak9$b5UYI2(t2fd*LR)#f5X}6i{8ew3o0{!-lRdC9BNo(Q5AyMzvrq
z#rY?naP+mm;!bIAZ1=cw-mArExcypj-Q>(n0`J=;j3um_OV-Pm7#SJMs0QA2
za$oE!JL7QHp=PUH^5OIG^;r@|>-qZ#?6vCwTOv3JNnMJw4pe~@yA4eStZf4xG78r$
z1=?xH1RYNaVhzL)2sMB5URJl}-K9F`Ahe`?>ciD#^bi}Xpb9uV
zE7e;)d+mI2LU~?qsZ;!1AX_v@goOE!g+Y%qlD=l+jg{
z-EbP(;@X-Gu>zZQLVvJ*=G1_8cAeiWFqw`7R6Jr$MGpCUeOeW
z7PA41OA`n`59hN4?EQ%OlQ&|!8)d`-62~s<6Fc+_msMsxExc^qXDxp6OWhPJ2dxsF
zg<2r<^08CR;YuuqgN4wG?iV?h-(N0M&E|?#${g;FemZC&w-d}xIeo0rQ6bJB#@iO0
zL-J9z2#w*pPsmQr#Wc8-6)8h?qwc8>XL40{q?;NWhHp7&YU*CRyzBfR0tfO@d4Kna
ziu{iY-Pl`zy4q8sC)&?FJ&S$gUB94-MLw})>>&t!?9p;kUGC|)|3O^_B#6E$e#EL6yh-Z+*z$YR#@Hy)x*%PvYIBZNMOKJ^CN$=wL
z6b*M4@*ai}N;Q>|=W?
ztf7NpmTOYalk6#eu@FlJwxF?BR!tdkXg3K%(3-07GaQyN$@iI~ge8*6d~sQfUqY6o
zTl=b->)gNiRHiLPS341Y>3%tswKXxu=rO1KPVJ<@DSpbi<5$)?8)^}>i3}6-&RYG{$9(3f1AL0?e)7~A&pbDK+@ccK8(w(RAyG&okLE7d&ZQy(Yz
zK>Dy_2v~sGiDtN~#VHJ2{@>e?H3E*4JVg+;bcY@b5q92f5aaBC)+-uLav@#(Y>c2=4JELyv58OvsY9{**#RbiT
z5Q#a~=8OH`5URjZDw$&hFk0GqxX+QA84sRX!mBgm@KU93fItTQ_8bJ?GkR`F;Ax}{
z^lot1v!`*yud)%!F1eD&(P8@ESabL>ie17bWjsd}x%VumG0Bd1_VyC?N11v$6t)px
zbbOFU$ow3h^<|(>nyPkk%z~c4Da1-fJJz3#Q3X%!EwkTUZN*d3pB^@$kB>6gy}wL|
z6LDH{l4%LwYU>ttPQ>S0nzrdAjKCC`^eL<)fj#qh1dl`$iIl>gL=#tNG58sr^@_}6U6*iG=?ZS_7>yGs
zg~Y?pxP&y=<9|w9)8MeMQ#?Ip*30eqDt!Gs;kwobZFjBCk>2JLXCB9&B(JN%BfC0K
zzwr6IYEvv{2#rWm)}ju_SSF$N*AjQ%kB;{%SA94+%$}}e!sjd#wwPHVLQ?ytbdZpc
zQ2d=-4g|7<^s$4i+qb!+gR2dWy%h;?Uu(P}R}y|{tT}|%@as$0;0Oi`IDwp=1a(0F
zN@&fME3O_}-4VM%r|Wn97i-p=>(J8D;EQwNj{e7*wWnxYwwK>}cvA&dP>nDyl@4rW
zX|jylwBa=Jie$G1v^LPUdJ}FvqsZa&_AS5?cxImxJDWaC8EE$i=>56z29@_baDMLP
z%MK8Tz>ocQ2m7sn286lxYSX>io?u89_?1MjVNth&MzfGbNl)!>qU%eEE4Qzlk2Qc(
z)7w$&XM0j5UZnr;J$sWLQGin{_M#+}d=6aj_D;=HgGJ79x5_N@uu1g!1@+1$9xEBS
zVII73#^5nwttoA~0oK50nl#M;!vqQc4Tfr7i&nWe%C9}I@>ENaD9>Z6?M)G&7s<
z@Q}J8l4jSC*bjB!6Sw8Oe)GNf)h^ROL9=_f!p(KK(pi;GLMq%cwMFAG1Vde2`aBm)
z93^Mr@|ss-v)s7xn@O6l&z&5#wDF>|Q=Q_$thEtXpLF
zZRDGYiEY-lgkH}t&S;P=%DqUaiaZkzd4CqUdaLD-iWClE{APZKOp}7!^$tm}Ja2gOE-=EY#o-O{Hq({MXWaE+W2;^w;No7_SrliESp2@XUMGJDt|
zZX&&c$G|$t@dd8@AGF`%QQ}A(@wiazrA%e~2@S5e9zOE8TfWo{R@01DfoEe0M7?ub
z)3tGpWZ!_0Z0XWdvZQzKsMhKc4?tihiu;MUr6!i*;UKouy1!Or3;h{q`-h@k=<@_1
z(0EFJ+2OG&)6=NH^XSpfG#}7X!t$3xtqH7*2~0?)o}Y2Ra<4?(YSXUl*4hbPRwoH=
z;pmrJklMjwdhwXA+;L||s94zXsxzs?szpMT=1pcV5%k;^lU%V@Y|UGR2!!2n%A(`)
zDoYY;c;giVvCNbe*O$s&AZ|tb;r6JpuI>qpS~P~UAp3FSnWVL@B2=l=>d{6A>5-7e
zzA0O%qDiYi24R5g{f-coGVj*2TR=(>>HQ_tMi|6hx{lT@OT`SCj(>z>?a~^EwhkAG&?dfe|6(1-JC65
zw@0A2c+`~$-@A7YpYdK5ar^5?UfX)i7lMbfIxgl&Y1}hs>V*4^zvg)vF{mVT
zjTb9^g%uap5W?JmZ;v_n?%lgvN)sa)*HTAss7fv=T=
zh0u_X>qlj)=sjLv)SHD(4t@5-U4lP3j`5O|N~~}GxWM*udtRs%^?FZ9TLyX6sYB_f
z`q(fuwObYWFa2w>utHAs2<~NHx%o3yM2FrM0Ur+{De}Y|
zefcF&=_GlqQo28{`LG+qMDaGeRTu`RSavIRRIC`A=X>&0o#T}r?pmh
z^l1AwZH&K3bw1TWw{SM+Zngi%I$58P-$=bQ}(vE@R7C+&RqTW+JQpdJ2|O|z-WAd
zJ_EjpE?F3}m7fgf^EkAN234aHI3WgEug|6@ONookmT%79zZ;|l#hb~M2r(S*@6=@#
zXLd7N;(o8FY`M&{uCDALB!8+6w#0Fx3^ORA_7FBP3=vQb+6mJ03=5DF`PMn|*>j!k
zYbf`zCJ8Ent$8l_-36>`zQMbymbOhFD4tdttzY6*df&~qSjZ_;pMR-}^w1VfG2&y?
zX1kl*lVuHK7mHYsazUz*)H+S(c>&v%5l`~*(dLV~>(T6Db~-!8rA~=Ffny)N6T|{i
zAh{pb-*d}j;rEkiV}MhN{P~G{tX%M>=RRR!p)b(>rD&;%_sc}R#S=XrSu8R)q}~eT
zy{2dTI&Mf9VtaqQUlE^=k8#Z~&oGK**2>owPQFbo
zpNmVjHD7eeYKlHOMWWF@9lem#=<@6#0n6f2Qc|WUNZ@NzD7<9JgyWEK-G7vR%NyTf
zPJgDqxSga<|54VRaE>sYFNTgT=2pfUHxdc3x=db?b)}DCu+xP3x7@XSiu)x#Dc*h~
zgkzX;MrD$g`+R>?%lAo`)1fo&W~j#+_TDJPWy;+A&!IWaP)R6jJ#M-DK_
zOPYs%_r4-s&?jgrWZ`^;MCRorB@|D?zVMus140TPt!%-bhhDR5UW8XQn=XTK+?j3KD9BK;8@Oe*qg|?Qs9T
z5dM9E={|wtY3K@*udAKY09)F3Xao9Cb&9`{kr6EM)lNp7zvPwkuV25;d86~F=zQAV
zAQ1f9d&!l`HFapLQ;29L|6+gB?$$?dCg0t;56wGsf+~w|GZ5hZ<+KbAjUu_$weEzAQZk&c8{ArO^Idl*g3y%YsZjM^YXTV4K8h8gaPR_5#7
zW!OZ~D-o)sJA8E9OkdYN4@f9mUe2RpDHNHAqtxVqq1QP$-qxqbN%)lV4ThR_Y|s|3TES@;
zkwe(saX~*p>oLO)Fi+XbKrnKBf_$qU2DrQe!p(l>^%DR6sd)YZ!>IFf=tUv>HC@FG<=|LjIx;(Q-O19rWJn~DscCF!0*r0E7U4gn`Z*9CUfqvUE7_Z6?pIQ
ztV^lz(PeYQ0dhwsCdx8MkPj(cD{p3gSx&sQu=0Fp{uGHafmK(2f6{rK#$OQltcyt^``$kdcGr^VrhPA_g5@xm
zf+a_+|I#b}gcpblR4iV2nZY*L9I(PAZh*c_5Q^wA+@}$
zAONSa?Tch7`?IoJCMp#RC5k6;eb|sH^nXj}qwQTyXzZnblg<3SDrHMr5bgehP#{~1
zwE>DA|2PY=Fe&}}_b+YGb6BViQjKQHol
zS@AzBiL9A`#y{^&GQHM6?~EG{RF@TqFY5nccnoZeTEZiRP3jdEMby{XE#+Za7pUk{
zm41ECxc@ThFM@~uX1G$YSlZ=v)Jj~}7YSTtJWM;{f~+pE0VGtr38s5h5
z0KxH}&hOr8Xr(~r;|%oy9Z?aai}>XlAaVW@?-c&FHyLJ)TLM0wD@vK=ER^v`>;B8C
zL-K2B(jFE4ZKJ0D%T*z-{cK9FTpM~<4jHBVicZ{!BhJ|&En&Wd2?wu_9fvAFt;jsRzlH0uUx}cmPk1|(88AyLLT
z(g>fcO_wAWqwrB>-V2_81(~uLKkCY|AmB1r-=Zsi9#K%hq1qI1`-&ZLTYo=8Zm#Yv
zY1Xj7UXrjcr!(kK13MzUMu!!PEA^o^38)IHSQ$iuEEtdwETMD)nUyO2Fk;ovs6>>8+}DXquPz;fGLMnDfKi$T#r
zh|bBuvH0yK#RF3|`OiTrisw*bBKEhTE8k$Z*;%HgQT2rGi3cndxm`a~FYXe*+gH{&
z;`5)H2L3UMd#KGE?Dh#3jTqFGj)9e?0!{`ALAV5y-)(a-B^RphuV0D!{Y@uUP1Sq;
zm``38i-&Xn&dyNxJ73CtAH*rtO;lbW_h+z<5fu~jOgA(0`eS9$Il0Ud?p;qpcp0=8h4spwY
zX1PK1-b7N1C4Lm&n$Vp$ld)Ppxosovy`b$EDx=B#KtLAc(W}okih`C-qsl4!nQXMIM
zQUEB$gaR}pu)8GREb`Qf7LJcBxfslAw}%03iZMt68h#@GoQH%DZ;`vM_vo6dlDR9v
z29x+(t4UEWMZA$eQ$3@LYB0p7hDv51pCyjrTgMoeoK@exm%v2`i@>F)qvNjovA=JCq)
z_88*4$$R8t=~dRzdr8NyWW#aI_sg)B`*?HnaCGp=FD*mZh$21NNh6P0^AGH9aLb
zpL>(Mka9hN*O^51cH@70$?q?>^5S@ApFcOcV__GOQ*cBrg#a7Dk+!RoB}?i|o|C<8
zvKO0
zR`VSW%gH~U>P^UtYCoDJ;Z67MPzRLtfRoAab+X{$G{8mVvKo|*jQuhw^u3l8J&=yf
z5(7iw9GlOft*HVK;yO8NQztQ&vjWKF>u*{8&2uObaNUo@2$Tko;@R
zFVtV;^f&GObK(O16@QC6|A4U0UPw`()BIap{>QHmm;FCvV|_q?05M{y0ujldD)kFB
z`f0$?xELP)Ez18>+7TC5{~ey-cll>gyGc6na5Wv7Cj0~xf7w)sf!$xj(Lc83BX(3|
zI?+F(BP%sDX>AobGo(kJs-NK3uly*P-uIsoqZsM3e+L<4am)Xj5BxEU7yWg0x9NiX
z(b12zeSb*glJKC`KPRUzUOxYKtRp{Z;@=UP*FWkbvVi6DXE1+NTj|lp@@ANa%pKG6
zkdp(UvpkpRN$#^G!VVZ-A;#CQUM2JYRd2?^!^->~?yh^$U1QPzg4Bbb%vA-X?;Hy^iSLHwBkrWPU(uH?5f6}RW=AZCO@!rz}NsJ5^0h;7d
zkX0^2dm**j9HxzVEKBhSQ*V(AJ`tP10lB$hb8%&!IC{b266!av^IEem?Ra09E+?lO
zUc{g)roDO~QAP(W3M7I9u|HDZ=zLX2DN@^=$p;@f^08}a7nwiv)MnX^KakzypH#LC
zB{3A_p?)X@4A_VPIEu4>F^p@j9HOqNOV200HJ*IoJV0tzW$L9_uMT7GvDj3
zA?x#SSCKan1ToI
z3IvqXskts;50vN6X$kkW6y+yfEm9@LdxfB)691hvUIuyQ)guM_R!7>joKqq5nP??F
zhg5XGHl36R<-9%&F$x%F*=A{sDjmi-43*m`GV
zH!Hm{a9gm$EIkH7W6+S;I;0*PTLn-C{_|v|jE62o6-|A*r9dxtEiq(<`a{>iK;I%A
zcFARV)Az&|*oXIuK7>DtKIf0rvFo)FvpgR=!y5?hX56j})yxUCrVi&XwZT%hwEmoO
ze2k&y1l3;cDf1B^NS}Js8{y-F6J}y)XlxwV8*x4@^|=QO9~t2>xdf58`hrSfz!=43
z_$8BIDQZ1?{GrHaUG>J&JERRyP%0I4zTE3IBC$kGXT+G|?)d?=(qT#AzUkvBk5RAs
z>a@f>vU(9w<)0U|Dg3Sx|B?PG
zST!PY$?v4^gv(y2{T%6?tdsyYvR8tLZ+}|7FHbxCn3k(${im61v#r7hIy#iwDRoOv
zl`XK9wH5I|uJq)y{v*mnF({+`h|OtPvqkC~U#e34VVSR|bG3sau68%p8%
zHxuWSI9zK><>}>u
z^qk=YKGqIty(>qs3Kdq6tc~G$@|RRt*WE5CS6W!4!q@uL5fV*xS#aT9n0x3hnw+-c
zE!3J*B#S}KNgB@nYUh4<*DVXaOPMjUQof9Q2q_L;0rS~qBO?(|v9!erRI`(6d5$c&
z4AX5az1f8)2%i2z9^^Ev<}xShdK>wAy>=@qjF*I!Va0pdVhVh+kI+^Zlduebxsd5Rar+GUzmlp8SNPDPR!L|&JQj$4SHZWNOD*V`Mf4}aCCtCtWZ}R
zI~I83@mo*>rdb$@>Q7uS+4=m&jDYWAW)+>Pn`-NifC#)V-poCb)oPcPdtDq0yh2a%
zyS1;0>(kAm@U(K?d8mLYnng!@`{uaMU?lH2qDeYxhJU$skTLwzyS}o|VOoW7Wg$1#
zI_UsP`Qe0?q32r@G~3tj&Cj*iD?^XLZ@TUk?uz~c%zSKQz4*mp(_V!
zym)L&gG>Fjt)a90SEl(svFKGA6{Q(?c!wWY77qXJXF<$qZi`<=^to|)
zIe#z;Yjbss(*k-ujfr#vwpQ#ixHejOJQiEngJZZhos!>-w&xSF)NFo!`@w%(eQ$Q?
z*vIb8bHw(IU-LPi<|d<*(V$0vPFo0O{(5l!SMA#U)FR}ZlsWr{@NfPVo*xBFsJp)CZ
z*_Uae^S%<9gDR6Z)6S={r#0;7m=R_{Bw5%jM)o@RTUz7^RjG@pwN)Z*{bt)i^%V^S
z?Cb7!_)K2BHz;Nk*Kgd-0OEvyHtc5Q-?D;={@gc4B-`sNFVZ&%#Rtt
zMlaoS2g50TetrscR9H5EOaEt;wqqi+7oq0(w#Zj9Ydvc_lDw|0!pVixAc*T`=I}dZ
zojae2F(2=hs6X=Vl|Eyb{uV=})UvS6@i#m7S4~wAZW$5`-od@df0K#RJw$WGV-<+3
z7O5zZijLL4g{&*r$2(dx+G_Ki3{tI1vsgsRd{sB(;f8jPV
zqE%L%XJMvV+ShsS1ng8Z)NO_m;F6sJao!E$x#x0&zUlHfL1uix)Isb(C{-2g
z@z)KJ0UJ_5>#W{jo46?eQ1fW*;6sQp3w-8p*u>PGMuhz49dgctczdKD7hNw8N+OiT4i#6J#VktsSRnvcg(NZv24CDxCx^~?*i_~~s
z7VeBErk|R>q|bfm{nTv;>oT0b@CRxH^vB2H1<{t|oWN_babmjSSkLGLA1cp`Uizyx
zKP=PHPcr+a^=VI^p)LbdOZKCrxyGnq-f%%^)L(Mlj>u3khfMxL+xgghaUyG23zS9m
zZhr^O^gCap^(JfE(nkDI>BhIHH8F@MaFJ_&s{`9y9$$l7k7g{{ewbG@WH2KpA&&Nc
zy(nc{7%pHs1&iTFzp>1?FR
zl5KzOz}E^m(h|~sdKP+47PS_(n$V7T^5m1?5bS8ka6pF)Q5-xyJpSF{$-=BxS`H#T
zY`GKqWfi#_-;&Uovx($ZLt77xT3fa8H^Y!moEy>XK^z@XevM~+?Bm*IQjHhD9c)7aCWf2-#;f&mruGe5assb)ShiTV0cbz^C`oaDcuomRb)?T@KZ
zEhm?7O1$~Rq{lxiBezWYdw&uuFS!~EX%Z@wX*xgmHvwmaQVHPB4u+IWNGWl-2lYot
z@;H^N>Nnh{2U#_e2=psAjTv+*`5Ts%Q5CVeH0%z0qR8)SGUNEDwm9e;!NVNuD
z=Cv5wr5LT05(v&nXb_cBt%li5!h61%Sk|_OEd&twxU5ZG7m(^9vd6#PJLt=NO0b2z8-!-t?B94!maG(*E@)r
zSN%z6lHsX|s9Na<8UVij%{nTPE)85zo^vj4ST=30u-O@Uyc~XuEx5c@kVAlK^{UMH
zusrf;nSRrv2oKJf3SHP^bp5XRUk9jNy}QJbGfaD7zdgQe58TFMq@
z`^)r^PRK>DqiO*_4-cuG6${dC-eQ4CqMoNmmx3g&{1xRmr8i%@kIk_M;;0!PLuV^w9>
zczW|vnwKqPjJesI7%8WX8%SKleZ16`YyaVP7hj}n0^6ME+vl`4jWEs-;PcUI
zcBb14zd$3FG8RT{MX!3q(XOi{~bT9F?ps2yMZpkUxH>d+SSM
z|9@fq<^-!2h2NR|RQrTkoDUV(f<6b4fCT=iaK9>|sVUvK!Vt&D(a_|zAebNsayAKO
zVbq*EhCs*1P1snr51Eo60M{b4RG+gRxy56lIxu-jO+llLqNK+W@r1o`!HGPDR^(!o
zj^*tNK^NZ>FtqI}QikG4lF7&dLXK|(PC0-S&q
zRyAUW!8_PUKI|`KmiBli9N86j#Avo<-Bv@Aay0|Fanl1A@_B67b@dl(;K7^4zNPuo
z(dE#t?=LeY2JfJ1AkFoQZCzb8MgYXpO^uDs&i12G^-@#>GTp<^4$*8!o!byIjo*El
z!aZPQDxFJXAB)n{J~WnAzywUSw{i6|T^Vz)!?sJIs4^Ih0c2RvtPm#kwvUvQv@Dgy
z(=0?q@wy^STA~pQ*OiBKs)B?hR=}smpFlGNg7e1q)T8651m98HHZQ5~#UH?Va5UB#
zdY7%1lleWd6z4X1_hKZX99OR(c*}(o^?12+0X)#y)Rd#}g4c;5Y9|$vZgT(&Tn>Pq
zIdg`#*#CHRSh&Qy1hgE?p#EbcmK6EVQE9ykT!@~vj;ul#M;1>iwGwJpRaIq2w)kxT
zTsMQ1YhIF7O^2)^{03^2+=NB831CJ<0k=m`s}z790T?8ES`nibi3dHe_DcIB{mK%@
z$dWqAJU%}fl{p)AN=JIABp*fq4yNgDtr;t)UU`j^Gp7iuNF%!Y`;D6f$BqvzIu_of
zxT_t+5O}9Kh$ODq82wLsQq_%&SkqN?}!qz@y;6{VE4+|oGr5&MJfKEFb#9;U@73o
z@kmH}&^9-M7C|3xF#zifNMYB~Oc5B32@hctTdi>nwMH~I4?QS$pwCXFIKTuSRc*^4
z9nw@^sl5KdLz&uMAZHIocr7?8Fbj}+Jq|j+bvjfc_k6Y^e1$Jys8n^Af!lWhntE50
z1%gD6gK08P${=u0XJB$zd)=h4W?s_BImDgf6i>=!qaPG7+bE(bh#&+xip{y2vV7Om
zs}=#_bCF@Up~eb-@~Uv??E+73f4RMsb8S_j3t&gL?Dr|IfLcPZp>$iSIJn{^nP2Xkn&dWHsBj#z0*W5SWQ)#&cY0Jn{DfjpT>Eq+M=o>PJ9K0i0kF^8>Or&
zd95Z(oH|~LXTSW&gT1w=YKLZo#n6dC|4i(hbE0Xy%#a#IlCqL4VBVE{NA6hy#t!p
zPAaGSQpV0jfjshQdy$f39got5wA
z*aisZv>Ms%?;R6*kgAX^%u})_dmn-;dp_FQaPPA^kh{hKuM>`{>Nm;-H?CL?hYJdV%CuGI5AOub(*K
zYlxNq(AuN$0aVw2g3zo{*s~f?*+2mJtGU8L5MkwrflMO+1^||qi)W?3D4MuERP2HE
z8fp3CH?r~CEl{<77@&Y-P5XeTI)jY54gP_?n4;+A*nB7wB*RUg@cu@^nA`lxFJC{HD;OndNScm6O($H@h2aQ|5aGH+~e)M2!V!WJjEIoqFaZ7X3KV>A|B@ei-8~eX<=^Ra=1bU5^O@{FJu{l$yOao;34e3r9Qn9@Sp7H&)7~7t
zJ9q9>9s|>ClcMl@qsM%Z<;;up)F5_ma8`#IL8m!QTzJBHS&T4Q_z#i?NMK)nn2no3
z>R?`gf&EOCJ=bnQTXp`}K_e1iZBz?d@{v0-HyzGuRkGVYk!MM4ams=T-Vh2>8>Tq!In${f6Zb)`}>Nx
zs}>**Va`=5KFfCO1p>4<{vr+xLw0|tt9LT8TNWuLE9LcEcrc?Hb%UnR@4A$K2~A{E
z6FB(Mn?*I<{;&WJLE)xk$3{a`xeIB4C}}y1VRNs@4n%KfSCo>H5{t|rvO#Galq9X0
zx(?KI6K2H=U9XT|wr$4TB)@FX!LQGbs%tSWTLSxF6__IB=g*%(%J3!kyw}Ygbn;P<
zhWu(FoeIy}6yAu!(@=+gTQ7TF(bUDMuX|`LGN%te@Woa|OQHixAWj^_E~n8EyOr7B)c4z@vfxm6&Vs1IDoGSLw_hx+5@VPMn81Y16y)s
zBcZ)Fj4CU7Od#{2{LoEmdiqCKH$rWmpq|(3iBmt2>XBTO_BH>>0Ml$xQH+CwbMcJO8)J=
z$joCeGApIYtWUg~a!U&1GOD$t+Ur5bL(&xqS`CoB;`NMK2TYPUqrX6*?X`}|XQEZ)
zSHvEjYrlc2mhbNaG=m+$b3pjqR0otP0biW_UicXha4dXGCF^CU%YT8mRJ9CxdVgUT
zDxp7HUXZOt>efN(tYPo~6%RvEB}cRa2mF!W#US+$sFMA744`gfNV*cR4o2V-q-kz=
z0Arck0p3RbZJs%=wB}i#4cD996p0>(_L+`LHGhxLc23a}m_Kmynj=Jqx`9Kbt`CgrKezc7INHfgpG%5Cflf1A}e
zfUMwV+-Zv;_LTO4zEn+W@)az|W>)!-;j%hK4=DN-Jd`@l18=5L-i2)A2q)&%(yW1_EC;qwpIRM=^qk1Xw`3S78%IDF+!i
zpX>JvVcVQhUs)!kIb{VDT5co^pG1;vR@BJFCZ9fXyQoEVAAn&+BjJr_$ayfuaH*#nm&Z0>o8u0B&_AYP{OBdY{0>
z`Zg2(@jJ6t0aVxo3A}c`N1pN|Gm!*tTe=-^H)#O$igR=vaoO#m
zSSgu_gMRR;-!i#ci7?0y`QE3BaoA{jg$kfrQgb;ZA+DGXE4SNzvTlSJ^z>|&o=?+7
z8-F>|sE#ydL`s%lim|xnzky|eTLl;VEZE66$WIL(IDr1z;s!arNlGpkL8m3GcOaXa
zFhNDC8P!a2U9FIauXv!QrdDj5wgPTA01^E?^8J1Qu%!688Fw>Hktzh_uGb->69i_?_vIKXpdaLpcV
zj(JCWVivWiY>4h!KNg)GFO!wh+VdQ*9UG?+trNTELltF<(GOc*6XjciCcmxI+_4u<
zimX+MboKPm=Gw0*5-MqGp531ez{!fDPuO<1pjnqGFU=}z(e|eD%9MSYd0Rskc2qK#FKSCdOGwQzUm(`llyILbLVdfC{>&&!7`Cy
z778}7z#xb)Gd5;__X=-s=E@5@ABA1BEmvyXJ*)iy*9+8~L5;!(fEwoN*!0CfWi1d&
zZ;koMcNU-${oYDYQM5|47py@SHXbnKa<2;}{U*8!gC$x|~)u(5J#a{Wg5KqzX8GM%4s_DM4
z>^DkGYo$CRTHPL@!>9_7^a(@!>~x_K^xywMy{)
zI>)Xt)0z&i)=sm_l3=O3pzpy8UQX9E&cW=el7j#VVu!r6`6MwXS)pU0vX+tk`nTr<
zGH;<6S{vFE^t>Y1)y*UNvNgy!1>DV&YxfKr58jgbM8UhXUAm5}P6r0H-48M{vwq5F
z&obmLy5ivua(F*A#n`1Oxlyr%;rcB}t6L-~Qt2MFbwI@T{`_U>W$WeC$>;0sAMufQ
zog5&jA%U`|E^_#rcZoiYy)7m!30YTFJ4jshLdxWBmXaxTIO!unyM~mO4bD$rQt((^VDoz=5{p_cTbx{YFeqEGck*oL#&cGN
zuvYY1&p2q>qoXZL=3i|Ew*w{mQmT7Gg&~DHdHl?69-c0@vcQclVpsxZr_6-vx76Y(
z_B3W*LE}e5RRkys?7rs|EI=^D?yigaey(6SNHW&eo}Dtn=>(Ap|2o$Yl|*+*X)!6i
z9S$Jc8ZmVX_02fx8Dv_3sB-KzvTpdmT8``!?>P1f@m`{lq}??}TRc>-6(Z_+p_Kj{Yf!)cSs3rhXR~-;6SpLM=Eyc81z+q?#9+G@HVCd|lI%~ib-%OZnFF{k
z(Fch|3nDxOKY5?tmVUF#R%BoB^&qzYR7W%Hzn-3z`^fD+KV9
zpnTLZ{Ua%=PV|SlybfxwJ@*v}uxrmNpAa@eq4%DfLVVjPGTI%KZ_eUh2$0>8$o>F&eh1eEH{gQ
zp?bzLU&?h-rFF2Wsmxeb76?(!$%Um|Oxj%kcoT_bi>F=BIg)3apPb)o6NdQ0nc%X`
zKcU`+3(5!sI=^QWlNcN(7q%9pyepskv@~n%M
zaN*KMewm6vh!%8Akcbg~t6HFlO0e8M!d^=bZ+~*kT$Vo?T(ni83%*V}=QPi3_hWBI
zGrfh*4cLW)+Q+A$2!=JueN_rEBwe+YSU0>5IsmjM?mtHhyZ4?}0P{CX>6qVbS@&
zdC86cT^*=0S({2SNs8JmGID*ae{c5MYFpa5Rf}G!@tR&XBnddI>r-tlRd;&H;zYCA
zYmFdY_%f~xAK=;bO)=U!ce=-~M3NQzR&4c{O*})*+gUhSSx3izV_A-ljw0uBZixf`
ztny}IR|eLn-u!GTcU(9r@_7M#H>mdD9b2>EQP5={n~O%HnseKo;06Zra{J%{hX2_3
zuNUyIuXRO<#RKAUN=FZrnR#X?gkkNng_YQRTiOWg?6a&{m+Z;nG+(osso6@G>C>nw
z!V5+LRYiP~y~h2!RNXy2MaI23O-<6Ond%}!?@b%B;F!VIuavW84M6JxxJ_cu4X0-T
zC!ATXPlUdi;|Vfwc=0fwFUXq6H**BUDT5sa&$VATghb1j{^*QDq6;7%M&g_E
zpqFUx<}sTc0-A?TA|09UUACoK35v3Qy*azq42Rcnwjc^MN;9s-~|-w
z>cSzMJ11)~=s9<0ajm8}m|#q=2mB}2#=|{o#X<_P1>UE6*5sCAd?zOcklW3OJOFp>
zU$OQJw>!(p^aF}2n)E?lNSQOt`~w1-rs}C(h^eN(aGV_5q)Cv$RDPA&M{`gy-HVOl
z1$V%g#AaL^as*eYo_w+v%)(*dZR~fCl+3I|)Bc!m&EI;+zPi;8Dr@epy!2_)Q$Ky~
ziVfP2i?j~3zETBARFCR*BJZI>iUS1vjA{i^_*>8R({6nY_^JhZZT$t?ZHxIaEKceA
zfpPiLP^XONlAb#~g(La0#Wk@0?92IU0!mK*F$aq``+SwlrpQb>Zj+%{TNmpmrcC%j!}$xcahtfp>z+i=z!Oc7vb}3#-;*SyB>TrxQJ}!4RgojNDOgR*nHkwPlqS
zqqO=_K}DCNNF@=iRjZSspJVpYR`W5|=>M@dp7gDjyQx}lC
zvkG!|o}K;pjK}&p!T@ypwMuFnkcY?L_hfQek?Go>3l_OnERq5`MjYP3-J19f|FOrT
zn)w?`*OoS(PrF9ZOs}uZ_4Bv*f;R?`Oqc_}%uXjA&}P8bii%w9?eFM`Zt8*b7Pvbe
zN5s1^84cK{xTMlK_i=zr1C${f
zk@m%ER+{Z(BH0gXx)+zpV*!n`8Trpm&p{u-nS06??XxkeF08SRXA<`|2!qdy%Xn
z_^kPD@xwoSE3S71ffBx~LQT0FZEj|KLA(6}*Sa)Q&oao1Zkj({lCOjm6n_orr`pKs2|56P!P7-)?mh-vq7cOwNsn(PdtKm7|FOg8XN%?cYPRx*1wN8{8dtJv`ERPOA7i
z?7z|7Vlvd^jG2h6AWqxNB*Tkc&Aj}nuZ
z2j9Wz>LeP$opI&k<^7bB=T(C_w0V*Q2yxBvFTrh#YB~sE$^nJ^Ye8E9%6a8uoyO>T
z8#T(rMb|FDA9o;s!Ki*F3+t(#2ployu6A0ZZk@p`jKE(@)%7;#j|=lxOA*1^v%zYg
zUS0OKcXv}se?fD7@rvt{3EX|2J#J^!LO~+*LBF!}x64YE)P<3|Sn~uMNxm#}zE*AL
zG(~5rx-lDu7O~h)U=AL0FZ3?f=6AzDylJEE{B4ats2N!MNw8HiVwY_Q
z{I*Y;8#DTDCDwgQZbchp8L?f+nAeQNHV$g8PxchjnM&{sy~wR%cp2!v+Y8WOBcl(G
zlX~knpZ{L-VEr4;>Ca+QHBBXzwKCQFx&(*ig+=EoF|s9d|D@7~cU2Af8K|beIwoJ~
zQi$F_^-c6Hm&QU_(6@$edr|QFo)kx5oim}RPI{Wn@%Z`5ibCN~ug5!TX=JHD<{ktT
zzaJ*gO>ty-U08`?v0E6u6=`T_7!CF@mTeX8`uNpiH+~+swQ6dSN+z)2cq9XjMWh&$
zkT@D(U~D`wI{NZ*aiP0Dt@>qBACBiY=y@^};2Wy+E2x{C77V7R)GJ%q&uMmqCROZX
zWWi{cu{kZ3CB<}hpq%2@b<|_ot*R`m_Z{UFP6KAk^TsSk3fRR#s%GrxxCZn0L0Fd873i}<
z&twV3Fo}wMa?(PEsjvRj50l|Anq)KS2RKZ^$6M%de$!Xw2ZI^GKZy2{Qe^;Oa(>E)
ztMK-=eEs?je{(3D)hb;q{z<`h@&wiN3OWsU`%T9A;AZ=;#Zo#~qu>aIqqQ5~07)#V
znkC9f^G57%+8F4$emFQTv9-caf09SfyFOEU`x_3;PRJNE@DPBFpbw8O@8j&joGf}3
z=&tf8GjN`Ha|QD)elB0^#vt`O6d%A8#x7XDnMeYi8}>9#F-0T~S5qfU<~C;}n_yjy
z0>W~}tot=M%@BGxMs($C@R%RU5zUg9%!vzbC8H
zJ$W)Ma(Mt-K@s=(Trs+)_gMtHDxrI!vl3PGcWUoGKes-c8_XP$<8vNYsJ6=v?A#7G
zoXxu24;;=cr&nPl``+W5te)kEvT`oVpFOEiVuc0`NAq34P+yF&KL4CkbC@F1ewZbU
z*Rv#aR+EsonC8076IRlbG?a>=7m*CEh!EGrYZkA$6mzBxOk_5e6#m+`WbV59Cntx_
zgH=KLguw-PSGzUb06qQv9P$B*_09f;-sG2YV`zW&b?9;{bd%IV(E~mebJ-WH#u^i?
zSF1*%A~Z@;bB0>#6pO#EvYF%kpZA(Nj~R?|^!ar!Dvffxv8ay}MpF3wtm{Ch0pe=SDt}U_*SimTyzju1HDc59u
zC&!KP5_K`%m=qDqHeW2YvQoDRN??gTG4IACEY;A7Hcx+R=i>auMWx>Ljcaa>Gv(S=
z{Nd+dpU?SPUmxTq$Pgx=J;tz+ReaPaw&E*os28Z#%?~k)mkEs=DitmkqWtb
zTqnB1MN^05%6ttm`!*ozAc2{-WoTN^NVHX~)MfPd_u#M2AMjgHs}9z+TFZUEJVG7y
zG~x4S*H~m$@)R&54@9HTr9PqXM2i9~gs5fO;m9>8Rx9-jR8##NTPi8|8Cd<7rDd2*=LK
zzoy$F3m-jav
z*dqK%2UZB{&FmLqCKtcy7tXC!#hqUxnIEbUO+d-=M0eIQ(kTs`g7Nu<<@N2;FGxZ<
z+FLA=;)-LKlYJV6_Ot1_IpSl5P=`Wn)lQR+x_niTnMEZJxG?bgy=%7-L9H(VKc}=&
z_7^&8z=)}dY3CUL{v4mJZJKEPoh^HBMW`>s?f4s2Y^R!^&JsN0846kLEf~3sef$4p
z75W$P_#k@NLjMw5*Y@?RZNBNa5YO~hcO~U4tr9ywST8-lZUt9Y$N8oJmNeR;-y{%u
z%lRqg+bP=l5S{8Dx2Fb0
z#;#qu8>tBt2z(8PA>^|dPnF?DJ%r9f`5of=a?W(CPiR>Fjkjf{GGXQ;kk7^64ap=}
z1_cxp8<^`;|!M}#)!nv)E8kHVQ0e7yNni`0)8Gaa~FoLW`
zbEZM-9#JDq{zN(!Ow$XAm))d6-mUJJ7hE!EQ$!E3
z;tU?F=3ZuV(rAz9Uh))=Fj3aU1uJ867WI454Ik#7j&WmPU>MuOWuyA|pl^;&DaA6!1MfT}&WRT@ix_Ua
zWEB*w{Ts!!F}P@IS{-?szg4vO^%U-*CY}``Dr{byR^`zP5}ABU4e0bQTYR)6{)mV%
zRHUFa+5`lC42ssG^QCFI9z2+;-D|nfpIo&X$+L3$`a5Cnk7t&O%}3+Hcf1RH4YA;Q
z^1IugLsXsT`FD4bHdP_D%F^Yz2zS+RW-A91*DnpvQR`!bI}11j!3O~YOe9fQO^`vR
zmpcAF>aSABiF9b(YCS*WtTC4&5N2$bV7W7=bYv|`f>yxDvYk3|{W6M;o`S=L^
zbFO(X2g&^XRr5in*(Va;mhw)uf{Tqy`@+s@+t$#@gZ<=PTuh9oiUtJ|D$pv4!lS%h
zvB$m{8~|^Cv^V%A{u7e7nKoYE+1c6L{4r>gVW3bh@?Q$T_|dqG#?lm%l4ZDdFC{N$
zyOUE`J?b{668lS~JZ5pINUcIyoSWkj2wvKD25qOJ>>&BOP_N}rTPLieO+(zl_Pn$Z
zVM^$6Mtyv)!MFG#bcxhCesg>nj+w|##g{i#d-?y)xBu|4p^~cLHgw7lK{LMJUZ)J9
z-q
zv+pZdaKC&2!x0yE0zV^||4;2*CT8XJ%;nOdn2f$0=;rpcV&}(CKHDpoKj%
z-LXk?fNgU>oRv|)`DyIvkm~Efo=(yMvL)~7Ee03gM`yF?y9owtTp$a|C^Vg^k(KmY
z>N|@m4X*z>bTD<$wy4V>wfE*koe$fUGSCNY=Rs^w8NtL$TUE?IU*8I*eg+#Fzc)b&
zr^jy6aV$o`+@_>t3-11l@J^Y#O%)8u1pY8OmM?u{*Vb?#P)L!gLHEXh5?dE%v76DC
z#&-5RSqBdPrQK8k-~l|gIKeGo_UX!j#u+p2ozr3)ZN0&&SPArtFmuE%h%xLl?uJ)N
z;6rI0B(mjK7A17TC^2RM|2P#o`Erjhy~@k$c#)hBP(|@)(nkT$3V;{a{4@+txyH&f
zBk0Gur=};ui(G~CaAj9g2YUqio<;jLQB1AIfthW7C2=&RI{-eiX@ICxJoqev;n%@%cDt$
z0iFW2^9@N`^c>U#JmCV&UAZrSVCUAmuy&Kh&UWHisL8#$$fVPneKpQICB!zs_X4BN
zkb~Y`cX@5$h!~?XpkAX>iW@zv2U2+xP8|yB3hOxz?Ihh$wX{@5#))bsgnT7!D+Po
zmTj?1+?s5}9XY(4I_Mmp9yOz+PzOBvPL55AgW=FSw|?oVCh>JAi(tADTa)K&lI7uc
zRvJGUmw}h;cBfl(D0@Cl_asBMVIK_|$O2hxO2-df;LZ
zZ6!~e@};BGa;1twXqnLdyr`sCt^ar{iNrO_zhdTgS533;eJ#_9dRP3(HY-#PKFCSJ
zxF*+r=3kMU@*?&E)vvc}jct(rFy+C=4_0FMs@PIjJ!KWuKM`$?kQoBd*|0VaYsVV~
z7O0l5i5V{1O!K3m6S9+nv_>7w9Tuzovklnh7rXidPt*capoAl_E_vYcyj
z!fNp&t$vP4m3c?w2$`WfG+ogwcFy*wzVh9Sax{f;KRym@Z!uSv_X}CQWr+G{o4
zSmDCm_~{B$?jaAf*6Pnr@#WNUQkQo9FLf4-uwH1A=rYN_$cB9wA&df7t^Bsz
zO6M4vVojc78BA?B9(BadraoxoB7bH%l5Kv?#)XeZl%1g_EV45B+@f~s;GQ(MBN=9=
zm;mbBPGi|#-0zJQNt|%xrRTHU$w}@+5nc|6#K#y~{?zoKDeAFXs9M&^u9+5D-730rtyS=9`2k(AXC*ew&upe^AX5O~P#9Pb
zqE}Rk4Yo0AAMHhk2XAuL5sV*{(`>fN9$Nb<3R}CZpk;EGP5@dcs{^~0)jxuJw-w7$
zL%m)o`U?2M-QEsh*=Zb!rIXSk*8jT2l4CzRfbD&2c=6Ht~c)lX*beYtt^PM$1*$&I%0K8>q2>9tSE>Gl*2T79~f
zd%dUR$?4}IA-!@x83ty!W+7peNZLB_#DID~x;lkB>?ymnk+CsPjSA$fp9A~f+(5SW
zjajA|U5z~4x7P4{UP9CHA4D@b9H4_*KUnBqP{?Y5h0k8fqYz}Q=h2O(GX?ZkJZ~2X_eC8Fd>J|Cib>MXLzb3QY)a(g}JR|pzu#nJejP#y_)!fldkJH
z)ZqBVISYw0RatTB&J%(L?51T5LG@pu!aNH5udM>4oTw@LpK=R}6e^}F
zr5D240iOi%ylh|_htG{hCPS`FUphco(iYxOnyjn2O?$M-(AmKXn7!xapAB%5>BI*0
zlBHQ>mbB4=nea~O(3p!!9v!&WkTj)axf&da-+y;Ef${9}A-WjIXH&!~;CDT9C*JV5
zl*S;Tv1~xP*4iSv{Gk%s&6Vq)DnXjg!@R|7&)rUU)w~K_dQRZTr1Q^-bd~1c_i}Pf
z$^j~@n*rcV4hYVI#JhH?8>xf$buLf6&sp#FO)A<}sJ0#j!=8mg)SpX1!9AIw-AC?%
zxC%rT5BcK|+Ornz!@J+QNv;lqm6z36kwlzN%mwd`%B~*G%bVbo3#0E+Z6Cg+^g@=s
zK+n$CGj!Hgw47y`m?PNPUrh~2N)9B)i`BVt9%5@4o!+aW`X%j;n02xk+3rkPEzqc#X;9X!>!+O^=en=CKkB%Zt$fEi&f12*67l*{cmg^<27^XQ15kiW7
zQ_S5JKJa<9Rg8rTsQpE-UGvB4flEmZWgk#qUq=}&lpz2OK9)eqw)&PIf8o>c#vevA
zUx#f+)#M#T;{w^T-yBt|tdv#xCAfF3a75hJmap&-{<65+nT|#<9MO?;T53$`5qDT*
zqtDcxI49a8n*Qe0YMQ^3zrT~Rt!44;rjmKoyK`c7?II8}2
z@}6IQNf}gnf9G^NrYB-8XPn9;<>{idAK~_shc6Dw1`xvCioKZM%A_|9emZns1VrcK
zKpvi?hG01wHX$BYLVeu|m&81aN8Yt}(tiFWF>VgCb(|;c*N|7`*_^u&j=Uh}Yk@*c
z;GywuXKPzU6Ws3^_%Lw!rBLe3=#|ltQ$+{2XhSbsmDG#UP~)y9F1(slws&f_m72-NvsAq<<#)~U`scPOqdl-%=_
z@b6F%60q>gK->#=9KUJjNA}=%06=S$d&dQmYfP5PqcfKWgJkDS^DUvz)Eg2a?bo(P
zmB%VGEHwI-w{)$^d(ZMv_hE|xR{4{lPk~SC>H{ThHF`>)^*YqnGSAp<4L1xQUk(a)
zebi{&@1W<}`V3+!QU`TPHHp_o>w8?DX}bKb7N-fkEl{f%c3Pj{HN4UiwND9~H8o}4
zmGexA%(n0!vnY+6;ngu68!m~FB#%8QuPAin1mtOX{C18OfE^q-i!%#NZ}O)o&JZ4v
z`SZolS(&Kdr+YI)L!&i67{2RI8_4UcFNugJ8w~ToQ<%#7>qQDb(ma@^8+|T)4)xZV
z2ys3NwiZ?g1?)MyslmpoQ;L1{8q2m?2q1mOq=28OY<=`S49q{mb|@
zvwpAr;%lF&+}rLG_k)B$(B#ctgzo*tO5guJ?IsO+E-C_9L!<+dQQi)ca2GvJMmgV(
zt4bQg>Q{zdsWUML-azRFY?&`FH`T+?ILOOaP8#6Z&7G&0N@yKl^xIF2#pn93bx^q(
zaG?H4{d#^^Fr)l&NTGCH-t9KU9mYklsquFGoxU_GESle!mV&45zOjV3&`nyzOj1UUM$zkwSy9G_(aodh&~VU2u!g_qYYU8yqYo!l~T>IF^vW3
z`?3F&vRAvkpCdwy?;YT7-RO>MZ;};vfdJ`lm!+OkDtFv(NmyyW86+gvUHqeOo%+!H
zop~x#wvs@e%c^hH*aQLOnpd;Nbn|pyNb}UcS$W|y09*j>(sF7Pnsjilp8hn-zajXV
zkgt=MWz&^ynr>r4Qd>obWVm!E_NVnY2YWba?u&}ahsHVWm6Jn}Hn+d*7ovxrgUb5?
z<>X+ixBkZzFg{E>aD_JgJhj0-&rK
zRNp+NH$#w&XUM!KM9Azv_IuQa{(`2GbhQMRV?*M1S4fVTZ^tS9w1;tn_c!Q2S8}uE
ztKTtES|GV%>?}RmlB2p8Kid{=(+Z@~vK~oz;tlQ-0zGzI{W?@62%sbJ)h9
zfD>Qc<)!iYpCh!I1F{a}it4Y0W&*fNfg=>+=r{9^b==IWtjrM2AUf;5o4PcPzvo}@
zc0Q$MKpkBWu1{6`rT-ZV^IIe0?q{I@jLg6Pe)4c%gWGB6(+YA$ba}$YkH@7?|u=>J29inni>TGjcl}qpdtQ2`u>aQ;xs*u+_tLO9G
zYx3nUA6zoHz*|{P!^8eJ*SuaJet$n581Xy{5j~f6cnWu)o#78L+JKHiwC^mx4}X7U
z{j>7zce@RT`CcPK!_U2}kCbL7p;d0@aG})y6*-a)%E~k1+jtgJ^DxV4SYt|i
z#RHTt)qNiC;d$Ks`!>+PPPlq0_yss`Lwu&;*C!qz+%Sk&
z;nzYh1_5Y-SOk3E7rt&B<%VDBmuz^*ns+z+N)CA~nI#LYuyn2S-)ds6nUJQ;ODs~}
z3tyyKw2+XPnGuG$2C9?IjL^~$aaGYemM+G`!SqnjC
zkB*`_BC7VU$!8L$X#rOoscVkSd&;V*nbm*i)5G@Ukmc109;g7t%$Bcu=KU*SNbVru
zuhCl`+)YN?TJ(teeAIj}*vvcgB=fHu(@NIR?N-yp+gFPbk1V$zF$+W^_a;Yj;vGzNk
zdgp?@IE=4+gTz@PD3fC9?Low?gXEP|LB-LtHV0)GY~StTBDZ45-?4WajBr_5AmD2w
zE$1h%Irx?C&iPYH=;w{8(^UUs%~EK+Eo
zEBn^W39a3hIFC!e>?a4CPo-XoD?zjg6Va1C*4nP1td#wxuVyUtPheVccl;4*qtL>o
z{WFZBS!&Z;75Pqql{(tm+Q87kr~%5F{t)TRRb(JqX&1?~2UUp8PlwxU%uoohwAYJ^
z;`|xfv#j2{@sCVd?O_C(^jfa3I^mQYWsI$>9AXn)-$S&|By#FKU`lAlOosWTB=!|;{dtx
zt&}&~#a2@ese?Cs3fcen_+9-tDot4yLrdk>s%XL}oH-^r9Qt|
zuHo1&&NqH}X{;gj5kNv_xx{@3HIHZ+}J1)De7N7{4
zhQP(}hWQOGNvKb-Z32bgaBn#t7sVQ
z%U(oQ)VsSa<%PBr+)I{8#f6e_-HP88>^qwT-(N9oLe>#@D`@^%te4dhP~8yqx~t$@
z5_N`@KafxO%z%87r`=E$X(y}3*Jg35G#~_Uf>;SRUYBm50?R29qBLx{$kNS0iuOSI95{DdwDO
z@k0dh=NQgNJmL3hL1y^HS8#Dc6!H}vuc=ZZ=5JZ9ASZ0PA>BB$6>9`@dtTXsC8F?<
z;b)up0>5_hc{UoMEmxVgl=~dpsrR;5^j!rXxXHIpyCgfbFmd=}@Hp{@M0V8sS6A8c
zbhtZ!B@cJy-rlL9-FI#ge^^Wbol}tt8maOHOC>RajAA={FS}aNy5MejIo<#LQ&M1W
z!*{cCc8ip&&eGP{cr=PxAgQIm`0Xp$hG7gl95|rIj7S)Cnz);}hHIju;pDQQd#=_K
zC~R|EvH83Wm)-HGLFuUh`{y!wDfuCmJ6O)n)?otXt+T{*Cd^L9Qw@ys0KSCf;{30g
zq~y_nm!ZH<>G(j79BFqqT?qS%UQO68KC^RC;6b3kb5El+xG;5#aLe`pA1X`S7dquz
z3@zo(lg&p{2chcx-{0|02q^&zcVHZ6@G`LJ7ytq9-dQ3g`&nxg*5Si1(2ePgTIVWnpX%{?2o;Y
zUuX`4`|Y3d7J5Dq$h|$(uv6F9AI=$OH12VYzH7#0vNA97
z>(FaN=geI~SuKo4<$<-3ZFQWgwvz5;c7+4;RUdy*LZ>a^rQ=>GUB-s&T&j20Xp0xA
z?Xf-VV98KAA@q{ury&?nA>6Y+RD{?IB3#jNu~N(ID))*s6R`nIyeif)Oo=7ehUVBN|=#Zz=|$>_GsszrZ)Go+=NLXH*8O&)M5HD8PA_
zXpVfYP6%9em?TjMFDm+=kI$r}Y+q|96J;1N-ZMDb@RsK_SZxOyTmK3Jbu?)$Pq(+3u4(a^B
zYDYHM7Ofu92SWcRVlPXEDM%xaYec6-lK;gGFpIOvzPukcBQap)jNv@|tv`9~g{gC%
zV72a971|unJygi5Rq=FZtDW@??ZeF8xywfD!h#{VYtqbBWgWb4H%RF>Rqg#6tbeYM
zQ4sF}FGZM1+2PyIvqj`BjdDh0^`VX|qBgGUAjtzmPqXR%OK~1#Pg{ibP6UtlWw*d?
z<+n
z`E8SAVV70sME-~XGMeA|r#+@Lj!*922W_&q;Xw&+Qq)7Yp6!SJs8p7(SO>e#aeLcz
zBd~+no_Q&Qg^1k9Mrsw9?!#4YthM_Z*wSC=8PQvztrvhtt5(6Hl=C{jIFLFZ>F992
zocOT#trPJW-6{u#k3Oe&wsGjInb_9>Go7nOg%_74=Y2!NK~m#FK+NEM3R?5?27xq&
zfwXxcJn$+QH;hndQZw(-ZaE6@9ZT2(4|GF
z=!B)8A`?w3ynhtrlG*0M>FX2*T?PhKw
zE5`AY7qAhMHXC|eAXc=HUwHqbF9XU&FW*O+O(^xE&wX7w@!c^LFtgnKZ~kd2)kSuV
zM&-|5jjO)5e3NEGZh*e#SObpf_ui#qM@usHn%4iFFqmu1)ADyslS;ArZ>DlLc6~4cipAnw+OR}j4Ssu}1_Kjj&HYn8tjOyOT`laDmk0}FM;@FB7QiZ4=EeRx_DtllT
zf*6hbh7HXVl=efyzz~ra*o`buBrHglXJuygXABNp1%Wf4G|@N(B;Vk&^C>RiEj1jf
zOpZA{3zqIqwz}&1V)C(EOG|`E!p*Ugulk{0?$X+jQu}&~2F?6Y1{#F2V#Qe_4Ty-@
z`_I(lx%2z>nUWqI>s~Kn`b@LZQb{X>^5LL>v9(>VPo)WE4*JRr%jT{kYf!>%;EC&1aCs`Hp3t;Huhn$)NVIhM}+WV^t8EJ
znj^eY&EBa5PLxh6kol$8QUq5x7cD8NRjP+RYQi{tKY_O)3_*Ve;rS(#1VQlkT9)ku
zQ`}H@oDN-Z_m|Bo^j4X)UuI4Y{CG$)U4vc1urhF5cqJ|p7)lZ5k6g@aNS*_q#H;6C
zKEz;e+@PH5&|S?FL^7;a2^w;4YO>%8h{=`uAqce=fzV`PPj>=r>rf4X
z=-+P7Ag;&TuW!mC2{un-T|tSTKY=UFUwQMBy5#MZvgNAp-HKmZ+u9#LL{&e?e9+-~V`s2T1}nB4_-b-icM4AqsG}
z_w>R*x!uHpUVvH*Sf`B8FpjFNg&A|_Di*50IE{eEf@m%?s(MG
z#E^tjddWN3`8FQ$OCPD=s(ZLSL8(Y!n+$uPtI%0jX#XQ&1EA*u9e_?#f;^KIT4!+U
z=u;DC!Z%-ymp_zYm+a1#_w^pFF6#+aFFNC$YU>-yNjcF5WUJQQ)P}x`T=+0L2#l8Q
zVs?j(FL-Swh&lO29qqdeNdfBEa0v-u!hRO>GxLd>cut-A=G5?r<}`4&g089lKffvG
zY@s&u-PX2gEv_vvcIm`gdxaQSb*hB>;0#>(s#ZMUyw@QihovkIlIf6btufgBS3WeC&Z!v=Sk&vN`fzfikrma+0OaBGj=dJ(QMxF6&~&>*m*LTw~2bEPp)
z4|4lmA!Mh7PMGPQj(!!wP`r9t2`#{_r1QVO&M^{xt9zbh>qY>mML2SWRcxFhH?)%S
ztnn;)rmX)IWd+zIRN9m6VtjoV3BlO)5FlK@btf|STHHX)dWdEGPp&)8T+>9B)qnrF
zGy+hPwJo4gOU-^(HVEbkM5;4NIF@Eph6widFg3
z+5KdS9mYc~>_Bqi+bZI2R(2qG3%RUtM1+G8Mu=$5I#J8Qbbr`4G!~UPiFDU<^yA`n
z)t#{nL9y`_Smh*uH#}){FUvfoYufd*-x)?^Prs$kd;E9RU_S(ziLLX2<$3a`u#Kyl
z9+RA~9)A#BcSiNjg4(`qCAnZ`v(%&$G@VIS;@)&-F{jBc7&nx
z>K{cbs|+m7ZO3cM0YQ+h$uFsAbup=mINVZ>|5(p~cW<8mwL%*Wy$Ja;dc&)Wpq##r
zvIAma`q4Laqp7S
zgtmh06T74_KE3cQB={Kp!!rcpWGA0rXB$*$r2kPlnGD4qxd_pMcI$fhPQ)?`%(LIU
zyG0|t&n)!n@rz5`e2`U-#Q%l93F0tk0P|587cl*=N(SvORNUiTGxSTAu)F2;ww+`f
zI3uoC|Bdb?o%lc+;IWN_^OzMC$@8Z?F_tp^eOsU>^Y#&u-!mH^9cx0Q=WcBg5}-B_
zI0*3vdYR9*-Q-(XdS++O0w^vfr4gj;`A{p4Q$w)G%y$fD*17y*FYN;@kN%G>^r79(
z=7W|AQF3CJSVv_
zl=91?w~ob+Bp043oR_JTceK^58YHzq;Q+Z2sLW@KKT!
z(Wth9cUepJ@z^BG^riOIzo_=C397u7QlDQZQbNCa_xG++AZU(WwonfC85x=)By7Bz(eVye{6k4UEi`zpH7O37W7
ze;{M%=J1_xreKmKi&JN40j;FW~4uX;h+_f(y
z>BLkCg=B*3G)aq(W48Jsl>1Gv%!z9RSF!0my+n$_zuK>eUg29CpQH$D-ld}l&U~T=
z712rIzTw82WOlde;o)I4DFL)f2AomD#&EXIB4;uzpVa7Z6c+U@SU#uRumndEo8Hs&
zJwE63wQrCzlYrRPh`!JlOFQQ#{UT*>
znbv95RP!16XK}haW9+o|i3^eAG(nnDR%~SuxC9M=oK`#dF^ftwbUTbhq^teDgD+?y
z^W_Ql59S6Mqo%#)Wfw8UvlYqf3PTdGSD*uJHLv!qr8_@R0|GfW1DV{|LVu*WzdwW6
z?Ig|fOt)$a#(pJw)o)z_W_^XaFdH^+A!aPtcnAV>d|5~CLe|1!@uh|<#x*C~>-!GH
z3TW&l@?ivHUa<*@tk0BzVH0>}H0`6%$)bTNAAxwl%%3PaE1YMb3(nI(+Bm`ePUxe_c!e)lOnHSe`+
zq9S_iY!%zu^vFlfqck%^(dO>0TS(jh85ko#IL0`w)H~G`OfSw1@(#OHWU`Yw`M(g8
z?9g=ZC(O=sekIG-Tx+{rXS-(h=ylKkYogt~QZ&P_2W9{&5-j?E0h{Cja#7tuIb0+q
z$M%3{bLtoqgmX;3umh7GkVO_x;wU$6l`+se3Xl?o4sGtHym4G`2E&eBY6%(I@ND;e
zRRMnP+M~%+WAa`s`tC&z+yZa!UdSwG{zw)POvgB2t&_?#?EXIFvYeL^v{wlY~xW*+sg6GP8lGd&QECGc(bx1~s-5h6L}
zE5|gR-zgH}ZO-}3M{LrjM%@Stag{*KP`x&l<3NB(#GO0Y>LMT9&A^M1yf=Yn+$v?Vn?@%AkG!h$?y`fq!m8;?TH`?qh|g^Ae5Z)wM3
zMsQm4){GDquk9+}ba9;l8xhD0_JwnS*HCMf=!brKYg>}zIw^oZwJk7B9K8Qf3BM=K
zu3B>58ME#L-fMENuZipp&j}>&5hchgs*=9K$szDidI?Fq`&T)`rY_n&9r_m@)^_*T
zB2<;u%^4s0xiVCpVavG=4G2@{+mN0mWyNYQE`>P#R@bFm-aissacGr
zz01NYYdlsm5pmA0v1DRNOt1F%&_Q4F^pfRjA@9MHRDBwQ5+nB?sz4XRz5N1dMOZW<
z_B6ua@Y&0M%Fd!4T)UtK)5CeFYWKB10x8Ej(K~GG@nHqT7f^PaH7U9{ZRaZ7OgM)t
zzianQGj%tc(A2by<+G5D^EvBI51DQ61*^^Qoti?l6_z;=V~4IxAS^P>^Pg!i4ZZJUw!i6RXoWBBJWP&9Ajd{19)F%hnt=SEBRghi
z(K6Z~Zbc^<CRR8;5RSLmtVNCo^cZ=zd)ViyH$!>@?tFq9(!Q_82uYEg
zubx8V8dyFKKgwHlLant-qq|zt13~$V`Y6H_^@lNizGu{`?OH#wC2uBIecnVs#>E-3
z;`Gux!1F84Kc=hWqGzHNaPw)2es^2vSuW;+1-+_>+^M1uyfRY?kW`h
zqj#wCq<)$c{oD7_emQ^sA$H<3d(EraK6)Jm{5Q`V9dfe3kzk6+>uOP*T79z{1J2TD
z&-{VkkS?sXJ55F?7COLj{%g=&5{Z(nWbpcSneBA4`1rZGwPyPT-Optm41SRpxyxJ@
z8(?X@HaAoq7Yy4Jx?xXh-Ewx~peuUq#%Jj%PW){e_n1p8v?9`e6@NYMYBL#1%55xJ
z60vadP#S{E`%Pog+7I>9E`nY%2Ox^ATUXE;Qcv{N&5L_LX}uc4gJW<1k`ufBC;gHvh7G-$;gS1@Mb<
zc|9XNW6Tg}wL-b4-ub$KyE*2lVX4HRLA}nqYsnrTj}Ctzx~~5C4=J`1PVM-|;0kh+6$@};$^`1Jse6hxrLi9x6Dg(B$
zynlB;8Y6PEwg5}g|I7`ktp!nEzJad)Y24^nBpzT~+3#c#pKX?TnK8n?t`fRgI~$Vy
z^HDvYr3F?V;1scS9U+J^IOt!0JUd)1Za>*Uknejputbmq1|{XrBFtUqQ9yOIFCl4z
zwK$W;iTEJ6G)8|-=|{AY-SL9@+MVAWU^^QFwHL5*%={>sOjlM=;do6Be*w4Il2qpf
zH}V#XQlS4CQ4n(m)o6s}7U50~VsGw+qo|9
zGL8pwT*hQSUH9)5z+IdoLq%0pmp?uxMnaL7w_cAsTu!Uy;>Xec+$0xCiJ|AlWsHoT
z;B7&g7>nFc-Ep^cO$O}kcKw_L%WiVnK6e3La_V@5bUfM87jBpC`hrQGj^t$3vvyjo
zhkiOe?gfE(D)BQ=TIhdEVdS*6ww}>~RvyQ@H%7BC-q>qd<2+`os>)Eu6J}^?%KlE8hLx9_
z`(Od<@4<{zj37fImLqxj_6DZh2>S+Pf;vt6T13Z|^YGyMaut=M*RohFru>gWkM@;a
zKmD2a4xj~uR0g14m=Q(haKAYPKUDRsQfJSeJzADTxxWZPc_u=qsT|HJgJ2_bLMg`r
zXmK0)u*B0pWUp5EkPLMHix%EX%6+WejS09v@@kHl9(l220LZD3zF`kVsn_OMVVwrX
zGYXQ{4|xcmU|Jc}=D-=e*raXV+GXQI$3pat-MZOsYY9gzk=D40S=;KVyk$6z5WXJ>
zWv?d;jt?yQdq8N1RazQ7DYS$7&9%nRv9V~ouIng)x5gv#zG><5&qEr%yF+bno{!vt
z8~Nm%qTit}Jw~(2Xv+uEe#oU|FL6a(o<>5Xl^dwX`|p!#0i)E(^RHxugKtoM>4XSZ
z06KJx2^S7FV3Nsy`sffxYHB(p?Pn(GP~HNi`8SXLiZ`IL*m>rDV(&g0tF1CXo@3y3
z(6M9s{N_M}o57%fnVp{c?5LkI=g$w68z7zJRiH=VD^8{!OdY{?ax0y__uVTDH@2t5
zU3ZCdbb^4gFv$GgGFIA*t9}FdVYf~c^|mcdmMd(s8nS40vBE^l`X5dki-V|sy$51c
zen|p~cvcEH9}rm#X?_|oPM5rc^JWaEn63HZQ}dufxj=!
z&AWEe6+d%;5pBXC?W>EaT{lm7OMyF=)$|ns1FmyID~oH>q1+sK`9tHgH+s1pX|(hI
zM~(IUYqxv?W;0dt>en)yVu_RGy*ATRK`F@dcBH80g0K!!2q>5tC3DOvDJtU@?{0;_
z{BSAh%}evn2{$;&4*~<8)i}?d+t#RJoWue_pFGe>Y>lgh8~j
zD6bAgD_dNjMi|%}2NeVNPz8|tfzN~=H0XTCs~`)pT=<*l3WZB6T-9ze0>M$dty`Gi
zc0JVZ4TRIi@?{z7jw&`~4JyUK81TG_#bK|0k8NQdQnG#y)ZuW%I|!i22!
z(D@&v=q%()vX>F432&zQVXu6Y5x}Sn_I2mBw{o-3V$%h#(2Z0h=0tDEX{Wzp794B#
zWk{4e>Dg;K-8G|;>R|{M@U0%GE}bp
zZc5P@z&&Dk;0+izUV@Nf=c1FcUyHM#8>^6TJ=_jiuLwI0Vltd-Lj6X~?+Zwhk4FL$hdm2I<(uMq8=yDq+NTJ6TA
ztE__y7H~bm+3cWO9Bt|Og9+o`(y_OPNlo|daZ5FVtX;A6&kI1#R;GQtZS%bRDJ#+1
zarvsGd9QK;m{G)-f)Pb2_&yZ0_J9@nlVbaO7-;f>(I2!ISAMMo*`tIV6$Lm-r6j2o
zMpLq$)WhF1)XhdGGL)4m)kWmhuMCYX`P(urH;pjlX?3lCHE;dmI{463T%&l*^O_Pt
zVJ4u5ap5*g;Cz*Xgy_FNJp7&0_6Q08n}bV1U-(>*{Y2py?pbkzIKLRn#4DI*;l|wg
zmK)Y{fVag7#(+n4TgzXXGJC|>q8VwanD>fZ#lNJ`Y06K>d*mDT5~E58?dvhU_v&s?
z;a3dW?v+J!QMwj7VxslirZ@D(jw~c*^--9jYL;{O`dpH5L&z-Ih*2GV7}|jUoLv?*
zb@6mg`0ZK0}1atLzgHPcm1$t298DCpalzC=x^?v@545)M>@YT
z^JWZ(DC8W9FtJn)S|uo+>&$vS@O6x}4L`Lk>dJSD|{N%~Cj#`thN;^m4!HSdd?w%h)-{r<)y1{Ce
zr9)U{cz<5MV2+FGw0@M)aztXjK=bv|;?vDsp&>94G$UOJFm~BR^X6%Vvpj5`dEn7m
zG{WDPp|^C5q0bQwquwW$KIb2mA`TDfJs1t|Ri`;s>^RxDe922w>hc^zW@At2W95sn
z{$p|IK*wKxSc0`|E+nEOvL!*JHv}z~B||n&C_C_;1F~hnYF@+}b?;#-Fk$gb5FeBJ
z0GzR&p6)mE|Cp1LW2^S;dJMJ5rCOh8@eQu>R87}f3HaPbF6_)^cb$k8a
zRtM9QCXunz}8rH-}nzR%fJ3V^wXVoj_K>k~Qb2Tx^Ij)ZQ(rVhR
zv4oal7s_m+N(`%GcgJh~ZEwi3-R6^WXYL8G
zO2+B1V|nM?laP>1#cDl{!74uX;l`{^K#u>fwJ(o{di(!Z
z-BJma8%Zcxig1y!#V9HJk}bQ6v6Hc7FtkW2WX5FQ_gz^BL#1Lu_I*$p%UF{^4C8l3
zeeSLA)#vy7J$}Fb>QS8c>zwmip0DTYba&6Y
zOK0W?wCWxkU1rs|(}B??oNJZkost|P1Lu(4qpbx)*olywv}*H{-K5L0o(GNTieOPZ
zs%p(oFCEsqggS?c{-RRBZlk0q3^E7Mbk(oXn@#jcMJb(0F@S5;qR@HZ0^vT5i!N6h
zgYGJ4=-@r!Z)edlOd=BgjvET5Wpx8wJXxJsDnFEc96{!VIOw`$+g_ekVsrYZK_l3Qw1^p1zTXT+2at7;rl
z?NGV#`qU6Cl5vM;Dz_mfz`2%JP$nUpsH1jMP{#Rl7s@~0&J=H>@OVn0$OL@3fH)&1
ze3iOdD^HvLhE)@nX;~6iz#>~)f_DZbrfI2%>LO))4BY|>^{I9RWs$1G|$5^wyC
z+>Pg4Igj)l>`bBF8k(?aR}VnyLoH0!HE(%_k#u>*l(*U9qouTl(q(zyP?it_+{BKV+8+dazcHMHRf=ypHeg#Bew(vDjufQ`-kB51j?|1A^XEbPy
zrXLwzYIAjU8hm43M-pP5sl2}O%C_~apMztP(HG5IOHWAVzY!yQEZ~}CsG635piE@P
z6EzoWYhLrGWhMnFi`-`22ocMqF(GVoEHJ?Y7hW7q;cEKB+03}TNy5Gms6YALLPc#E
zGD$L-_G=E5_^qd}Zd}o+Wk=D(N?hfJ2+)g!ji9?}KNy+ZTnBxPfKODsP
zX>3X)`H*uA#2F61+N5A8(DvftBlR*l_!L%JeVk$BT=><%9x%
zLYFA_`RYnLh5?d-eOmX)@f>X!zr_#&cqj?Ucnzr`chWK&1V^D>FfB9keArJP@#fD6
zUcUe7tE>*La~+=m&p&Kw(dw&iAXd{+AM(RxH}MUZm0*ahPN%kWuY$|wxaML>31r~H
ziYi9|vzYCKmJ`7%LnG!??;GF~xcl7dnS1>eI=8kj{QP1GSeSl9Q%`WT=RulvUcK>v
z7ZuHeN{@JR|4LQMX^x$1O}+mtf)0N55?_>8tHgYj!rZ5*^-ZV-v%)~N5k)!%wz9dT
z)RN#4Q%cGWlNtO(8CpJ0ti&Pjkx=Mn<39+5vlB
zu}={$67L@bDu7Z+Tw-E*%>Eyf%_jP#qTCbLD_9D{tEX44IC~_sDy&+Ac@8w-DAifc
zr8-ioyFeSg2X|Jd_WTBAq}H!hbHyx{E0R=rrLMwpWLbLxTJE@JXy3f{aQp4v5SNh9
zYyaCRfKoir(xr|&{pzm$X`mpHc4aMKXK;CD1vJN>kRt3Y>a}8!sm{*`?u}UVH$$#{
zs%nLj2RWiP4cydoMPLQLncEa8*kB_OpCbI-;em(ywDsYizdYBbe(J#uG?i>iWP??c(+tCl$ZZ}hx6tBgE}#4t$)W1uvA%%LfD|UCBQH{6z1xj{6_2bY@J>u
zbNVBKm)+>+YHof)Yde)PB%thd!
z|E!Du0ysmQhm|4y^haPlWx$Bg-Xmr0s1DU#J*LfX-v+T+
z1biD9tRud!%m3lp2Y_wL3h*-j0n8npGtfygxYW#9EmC#
zbO)epb2`cuxk$6$q1u~PBfPQRbNNgw&R`)X!$$h-d?IEfmJTj{Av=PgQz@>M*%H1U
zzGCY@mb~jD|HdhG`_H!JfriJNoHKDbfH0+jBbu+cZUoQL5`A(W@rIKnDzUJ}J;1;A
zqE>w0>WgK!i4Rl7Pd23=StsS_H^-nG-XS;AJlMTE<)h|g*6B^nZf4wo7;SF?llYgv
zs!XvEcF~_O=fS?R6yd(fG!oEfn0sfn-`LwQ7+`|#%f5&43VKmuVAGJ44s)p4ijUDd
z^O8@gBeMiJEakH0iEGJC(VA@AhZD69=DhcH5KDo7Y;I>E@k4+uA;{m%0Wnp^?9_cB
zZkP%@mg_LIXV924US&C^Dn!Q9qe9LxS8E08xzUWjSzfuXDug|7`_R+KxV5z%xdqT>$T>@ii}d1*o2t1>tK)L(xhR3
zZ6yo;M(o~GUi`u3zYK2fMzPMk*Q7CGQrBw8nO(s}%~*Ep984-rv3UqK?ev*Nd*R}cR1t^W%5T?TpG$7EeSJi0EkfIsC{b}EJ??U!Dqj%9!P
zAJJIqS_wUq9k&$r`p|mwlTZ;QUW$hEO{CwN_4qj^Z}~MG%>Sxnnsf7)?Sqnz`l(Z=
z3Ll^ulyVGR{QS&d0{r|Q<(Rgn-H)H8jdL4nrhSJ$G~K_&S3#sVa_xhB+^mwRuDm^2
z3;M5cD>D+1s`Eh2$8K`@`5LW#tn7}fTg%!A9VuQEyZ7g|YH*R|0H~KRGf$5h=1Gc+
zr$z;Fv1Wk|vDD$N)$aj}n1Q0q)e%k=Avv4BNq6i9m(Kg`uS5+ltOZZxRuI>7owFJ&
zWUl8iH3k=Ls!}R9;-nH5$np$8j*Od$04py{^i%_>P?b9-D?m4?{thvvB
z3qv3h)6KZJxqIFCPNk)#?SAZ(nZAc}3vq!LR8G^vT%eH5!Ul!O#z9&NMCvcEKO396
z9%R){Qn=ll0G461<1wVl349(K4bmZFiSpMNx87lD1|3tFyIFJb_Q65N7f~DsaYV?B
zREIu!^5@wXF@=(!e~I8=&LD(;8sr#mJm)4$`*3j9hd#tE`1)J6(r`KOZCkdQ1iup~
zfBw+bcU=tNlYG4m&IB);v^p6PZM^}F%Iy_78wcKjNl7`0BP^F>ulaP}Rfcqyz5708
z8p!;y-e0=pOkSFodyO!c&#bmqB*-PzGY)2Q`HsD@3J+(o9UteHD(qErfwd+%cLnRL
z#K3+4PWS~F-{^)m!DDHl)s9_&EwNuR)A0dsmyyJ&?Kc6@=`L59s_9#i8;)`Wm;e69
z>!ldNtHa~r4R2=8OPf~6hoouGw<*kh>GQW`V*{V8;#<1mHTR}v1*tbEg}rrSJfUo5
zQz`*NO8}&R&nP(d?1W`Y&GwGML4#81(bUsAk8`wBoVxe|LKXvLxY$oA@P9vU7#Ap~h}
zl_-S#$UJE(bwUVBp9szLCsg#z$8CHg^pkM@FRwP~q2ZGm12(xkQHURi;TxX+~da1^vCOlEN-bx0@Ssr;(AYXG%$zOu=b
zyeZ_=tr$dhVEqlk-|6LQ(ObAP}UFcSf#dFS{8HV*{wo#vGbm*R?;B7e)sf@VrsZ
zT@|vtOLjm_m%P`5HP{6@!{^u6@`~!5go1>MjY`nlYv)05Zu&n~04`mmAKvIo=>9aq
zlvLWjI8`k0i75ij0MWnmW9V>~I_b`aA-{PkK!A)rz2SAZFR%YQsQwr2^Yap031Yd|
zKR;b|qw!lMveLUo(6@pcL1JwLw(rJA)eVGI1EWd(hSku7Ik%LYH&1bN!a<3@w#iXX
zfct6wgQH((6B7}$yJknlZ9Q-8sTF8XQX;;2iAIp;D4@9xOgNN-#0
zd-zJy@Rs0KXoLssQ>UZrCdv>VoMlGr={!mQ<0(L2X1NKK*C_~`YP&i9)Ug4T}9@Ua!1f?;1tA|@dr!E(d}i9b#ifW
zK_CWT*~AYZdE7FR%SLd9$F|=gz9|>
zOH&&r%EIFiUv_Zh4lAM%w9PYwyK3O9l-Ty48b>{3k5)nbD}Qb~C?O${08qhC@;*nI
zUOP{L&da5PhdBY{rOvCKO;o@IEbSuuFiwl3S1%Jx}hasazZTt?L2e>
zX0;uyJS*(;bHbSuf+6S?`6v4mP{175umWygZf*z)+SO$vXxS}zZjk3xc|Kx8!z3cX
zH?d94rSqEsB$7q3*=2h}PaXy-ZDwYs6AW;N|FQUEM)($FP1^>L9yzD#SL$8#%uTjs
z206q^R)(Stt!H|n9cpvlaut0#T6AL77q;KZV?xqsCDUI*cZH`P*YXuKe*XL#Wa6n9Ld44QfSp$7O|Rc*Us=~iutDcf%btgl`{IHH
zo9RD@ZamH-wLwIeCtI#PE9LQJ+PnY)qLlyJ2LtwqW|2eNdc0)h`+rzD0GJ#M`Bv^(
zM#|;g>r9dl0ga&IoK-7{NMuC(r1sYKZEC%?I$Kkbw_x-rO&UDsEqNIwvM0W1qHp=YDK+YlO0r>9K+*PjnB!-=9UaB*e@9tXGdo0(-KraM}HD+N&C=^+&ozvM&nLyue0*x_3Pc|zK1-uQ_xD;^XJb;%B^eSd3s-kcqoC_w^0_n
zW{jX3LHkg}d~}aOVHZ#gg&EaS`Ab?^NUqbp!RcIOfDc;3n_Hrl%dg6{JnEO&-q{_9
zMP4(YmaW?S07>@^@qmnuh&U9dS_v1fQ~6POIhP7lWUk>ma0-y~>$u#MjnGc*JPDUw
zT2#d5q7hv=;hn0iM@r$0kFdwz9MIT~fT*$}Rj0IeKwC=-8dHpJiie#Pa5
zz6hv#WgNo9%jMN;hS%6A@fqL*bZ2Td9kE;xc=i@i?s*!G71
zGVtu;Kj}lP5k3^$ro+gnsiD!g9we^b05)-mpG`bT8RKSz_cYOeWC&l5D}OdOc-``(
z6uBq>xnRJNpCIgQD_c3kEA;WAV|jkF$E_HWK-wnWa5o)YVxP!~w%vnvharC)xJcDt
ziZX-aZK0HY+eDvtU)a?I=QSh6YaOu4oDv09D~-^$dS
z|K@7ByMMd}2iKrunk4z-u6~f2v{_*__f;
z`wq5wOYDo2nJ)>U8o?clzI~PwS&bj2cn8;h`Rd7LYuHAbY^^mb&OBQ+10CSO-s;7$
zVU-dCr^RvkOg|bFuyGg?1E3Y-J(mR4TgzwC
z;$G$rli#Fw9vMcii-A^a1%TbwHtqq&N+a_LI_KMC;-!)s%fE^K{`$B0>1RvU%bkQ%tw@+FTppxfZQ8%}bXb&4fN|s2iyrKyOJHt>yxUzX(>)f>!26
zja9|$8nKSxQl#m+iNO!n=aO7yGnp_v6YwPR>QdsH{HS
zYbQDRB7*rS((TF7O~3K5$TJG)dk|y)LLynK*J42#yAD=wdS+MN!12-Lp%l?Zhk+g}
zk2ahCgkw@vllbW1eE~k-Lgbph
zT7lrtywPy+?A>{$(|J?!A=p!{fVBORSnXt|n5#9_l(ooR6p)?4N$7TjE{?WuW>FNh
z&hd?l|HjE8hT`!jNtO91%J52UR>>4fT_oZacvrwwq{y^lZamJlM>LW0!MnD^eL{O(43X4B_5H~OQB%-!Z5VqML?%5b(j
zVwtp{uLjC{Y1xuzC#X&FE-l>(gV@DDG({$_O3KLOjH($K#?*s+$FoQQLvW`ksL56`
zP%68~U5?y+xnsau7v|;@0mSNapVj`{E@dFF#52@@Cr=T>`mrp)YW+Yx)MZV&{b6*|
zmF*qwBU&X`TYFH$Hc9hOefV@wLCNZ$v*You>m!!k142U$XL^&d_9LN|9m;FnuHt#l
zv1U@Z*fu`1*1!|UTa>*eJO|Nf*=-Xfbylw
z@qi{n;i3-tkP-$4ij*se$e@bWKN+YW+w~aqFE30Pn(AEMxQY0U@(6N5ku~6@zX`J}
z&rkG5Bfj&vCXs55J@d5`ml#is8Em;~x)3e7bW}EFYw3~e6t?LJjj@XeT?9PKQDr(4
z#WKRV<~YCnGWW65xz#Wktak-?ZxEm20>WpmHlO#~SwOF8b%KPr#Gon9L;Eu^<=#L8
zXO-(?Mni=ZUG0bPPXm6x_(;Iz0u>dB^?-ockLo4J9e&W+QU#zn!U@|SOWXb
z*3)n@zvnu|Wxba4h#T
znaK_$VoBM=XY+v3wc}f%s*4V^ebkTji17o(?GIw|JlhAf-H!mT`V3-Rh^k&4kF!~R
z(InDotecB+^!;X9#pWnSYS1dP6N(N4&H-@`@tPhtqtK8m5HRVHouKg}*O}783xi_c
zSp27yD*2GNtE(Gv5C=XfXi0wOYlNfqpeHN;w{T&$$diR{tE%7-LtBGjO(zoBzKR(-5V}5%;{IRvUS)(89n{at4s`h_FPPphfA{0b4vQanymaB$c_8>si2&{0n2$ZFX1Cs2qgx9|ai
zXh6%%g|IZfdP@-bxCA-3MQ~0Ttk1m_$q)$sZb&1
zb1m_2PG#wcu71WYCQXfbh-P-~$`gSH4S?YDl)AIBSr@)m;BL~4Hy}bl*+I3={DY?#
z+_JFOQSLvgZNRtkDMz9gN``?LLW(U2wuva{LO)vO{U9PjUDC?~HCtJoBYd;QRpHf$
zSzE6;pVzEswTEsP-rpV_HbJDMq$Im3Mu&YoyhdEbH;fqnvmj-;#4hxv*XRFHGH;Sm
z&@w0$5Zfx5F@+D=D%~^G?HC4^+dyYm$}_qJVV>LXPw{#Aczg=DH2ObK-{BhGASG2k
z0uPxai
zvNT@}ROQjp2B)?+C~XJNpR<|}wL;rP35kJ**^wI3%;(flCX*woO=}+1QNS@-m~#tE
z9V}tqeo8u58Goq|=;D`V?)6%9gSs3j+UPLqN0df_q*im($Y7u$jQ`6N9pRZ33A}#ON=-^=(**l3aFG@tSzRMKXBa@(jTxrUYsvAY_qSl0j>|-~I$p93;5;R|MbHLC1M}G=%!l|g~mYF-d5Dy8a%$pq#
zre67W+#mrGQhsfw)j8CGEHj?GeOB1j4f>@9Va}k4u!mMeFnm^ZWIwC$m5u+o(&Lkz
za)3yEzG%adOFys5;4w8?*#9K}&tsZ%Y~zWH;`S3LBfc+-h=|ZA;4cxklbB$B+<6SN
zUbs&AeNR)qUd8*bSkARWygq{J;LPsJl0W8hM{d4NZH^q`P@VOnMqoBwk2?!}Hn$Wr
zZQA^5d&iw!p~08MZNtgUU9o!q$&;`!R=~@n9B%Umvj~I_FTcSUIa8t2=Qnx-Hbyr6
z2H7Me%@7W1AoG)~i!P$~UDX9QZGv!t_=2yVci{H6YZ`*+b0E>IeU-ECH5fq<9ztLX
zOzzaaJ$`mut-6nB(uX5Hn$~)wyZ5v9Yp?^@n-eVH?ffCq(ld@qncbugLN`VX318*`
z&Gzl1!};%1eYL=538p$^i*!{g`y^$5XNkE?oYM?u0%{S41&Sj#m{_-UdlzwKfJsYI
z?rzPa&9tz4R)Z;2T6%7?dUo@gTYVi37PSC^mjz?S3_QD{5LQo84r2OE(kb@HwD4cUVk7Wm&iiP$4+Sc8$m1*8D++~PJQ_-k9*xOAuDfgJ&Rn5i2o~LG?38Sx^^_@J!z;ITa5FGX_W`rH(Q6izBfBgYI6&$vAP#;@9-S#{rvn+H+VXm;Bv^<-BPV|
zS#=Ch`vNEO2mF55zykMxYaz+^HA1~B>mQE
z6hpy)#5|O*>p1!@KGE$`2(60-dllwYSBN2y^#+}@VSaq(9kI`knBX^-Gpe1k!+$TY
z&P{!|_-Zb3MrJpBOS^@}5(JU}HAO2l(FPJOr+h4-^~`)q1!+%dyTX)q^PS(s4Vq*i
zd&&L2Pw%NMaiyrZq=d4R*ab`}t!vSNZ)LIsT9HEiKOLkO*Vz#6_`|lL7AV#@*(y^C
zt*ao@b;7-IQmI*X`viS!mHw8c7spa<0dxj9M5kCX?tAl8WR<*F_ld28??z%y}V`quGK%oVNy?_|z|0OeY*}PlK@$U90
zLh>@700=UWTrkR3OqhBqV&h!zRQiCNxxVa6=mJNj%fL7A9m
z#`qzscHZznb#J0hGUt|ZR*?bncHr}#!S3V8%@`99{sQWqKm|Y};+Aq=$UX=2-##`a
zzXK*^qQ&RE847)#b$Ig0cL6!s1Fi{S(ZNguI>N$G`yJjlf*X=d9hG)n1-)YbWdpn1
z`5J-^+WEeV^;{YX#k%1P;g7Sl2knG~CG78zLpW&+TPTx?r$5Fm3?Jh+JZ^359z@@$NyEenG=PblklQD$3d#wX6
zUM+ByByR6QwoDShS%)p(?K#>)X#i#<_x0J9t(X|$QTr~-N(%&g9Sv_I%oh3?yD=yRt=K>pnI*t_rZov%krKK!4^
zBuq-f`Ie!4DGLow+3&y@1tXXPSO0dd?Gwk1Ya|IdM6_QZb~
z#vX}8A`pnhB+*uVE6=!W;z7DC9ed>eb*}nH8r*H#s@mBDTD}1>2imOnn|dnNyvc|D
zW@@bj0->ub((L1DnV7E_f^Zx)OF=h~ZEFvY&@fm5aoB%+1)}dNFQ7SkFHiC}nSZQI
zVjF-Z;^1y0*P=B-(sFIKHq%FjEeG^A>d!wsJ!vK~+quX9xm}3UuforiJZIK^r^2fBcu+9bX%?h&`z87MO}!
zN|dK606~9iMStnc0fJWfDqh}gRE^=lft_0`=MqgrU-kvztHRRlA(?1r}Pn^nXf#|0)n4y}!D;nv;`5-fA}5wU!KSjRl7S@;>qN
z^FP>ciY=va|Hg%LBH>|SQ#`ZZN)g`=Nmzh$I2Gj^9jxarp^NFr`!RVE^hbOv51l$dil3&i;VfveLSaw-{IfZ
zsOFMg&0H837WO`NZZQiE+H^>-+yIZAf>Lh+#SQcU$e1El1P$T*ak$~%&5CO`Kp!jR
z-e|lEXl0l`?SF#lqwb=hjPL+hNvGNpjduQ$nAX(ySN}uD>xe3>-^zUAjz0SWLq|s!
z8**cJh8=qrII0niyw(js&1nP*BCLLYio)-zwWVxPqd|;HTE4FYup>Jv~z4ea5f`3VC<`PT8n>=h2
zN=*uygH3IC!4ze8KW>XFAK{5gJVp+M11VmL8*@YzpG-bx0~jsCml#4%K-D+mg7;a0
zzjQ)#h-5QH^JO>0!+2oQ`>-zKFQtsHFjop)yFXmB`f`KTc8A|zE(pdsDC;;1N(cH@
zU`-~N^D=`>@NTz`J7ln9Kw;dO+0>DuYiKN?_dKLI_C;9p)Yx6+$rd?ng$U4>jLx^p
z+X;q9DS?PwR|+(;00q=zCivOa7VyIM@SuIHd}-6?9ZPLnCkw1kU*RbAymK
z4DH{upOv}o_s%UYn?)(3KJoXx
zIm{Ck0IO2~N@;m66w_KLQ;YJ?qVH`a5{cj_(Bx$Hhp;D4ZrhKo(YVB8y0jgO4f|!p
zr@#Rj=GjPqDqU|J6&&-Joz<&$RA~9YUDB}s94qEHO?v&Nfy(=gCr=a@I$B%5fgP^j
z7k7ph?i?I)U2WlXf1Un$lJ^4-Ff!5(gt)nzADemQMz;pwkm=eio&Bo!HJ?Gu0$?!W
zv_Wb
zllRRAb%@>7?%b8mGd>vSbJx>Cno}QioQ0rM<0?wlT_tk%4P7!gHLM?1kK?o%et5UN
z(lVkc<$BcW$;>sCdEq~6yhu^kx;NQXpyPKFV(#LC$c1xIJ~9qT_d}(BWYMnbKVngvvN7VLT3{yL%dK09U5zg!Q^J+9IEch
z_a5u;SPd2)ol|b^$`_AA?zYh_$<5=lBQ2zk$Csa^zrm2>GAYVXVVp>jnfWq6
z8jNf?cVSI4^IKHrC6PYUg9!Fp`Jw842X~?Zs-Ldh(V7pXOU@=%WmMZFP!YWqR{clR
z=bw&|kQVo-Dn0%#Q6|V7j{z}f!f;kCD?H^yWLt07#%@gQSt7gy*)FmwPHMst9T-!g
zSm(_>B2?2ns>f(#uh1sjJZfIK1+#jmd*yW8zOdT*Kh_;!lY{VkNM$eWVcn&upg)`_
zUR}~LNpJ2JoZH-EV7r=t6XC8?*fsZ-k<@$o{FX`WRT&S}{bERGrK%4fdOx2rCcGM~
zH%c9DgL<1!t-Btx#S3JW@4pz*tW};LPi={fDX9A#rJ6_|>h7{~GLm!e2Hu$>RV*TS
zdnt}*lP&E@<2!qa>k+~doWc?uhldo#gjGg@h?b@Y3*T)#nz^$j(b+0D7&6Y|(X)Vi
zxe`OOs;>9VsdQ5gbL=X}$6vjrUwmIYp1QZ<6yAj4qdQ)vpr)VA1!j(II$eX;X%1(`
zE%n|UXXf?!qUtf~)gW0}I5U~LhSu4g@q{Y;$wIG!eKH7!i+wAK7U}MlO|RqgNGpqB
zASGGs=CsixZhr1I`fFnsM+a95KT5d#<6FkSn!9T~>Cm`2^V3#e@9vM=7g-azWBsow
zNK6rNfGXZCb@~d#$y7&u&8}1KwsZYB>BvxP&YSa5%Qa7j?>ztR1b4JoFsv*V&hJ97
z)5!vPBdBMhhwWL`F3)&1iXU59sVmn?m=bjMIv2J_yQn|8E}!V;_5L)k5p|xPT|dEM
z8X<^`Aznmq^CVRn^M=)4e*FNBBA;B}C<@p=pmEVcf!)njC)9V*80G7)v>%fx8e<_s
zZ8`kpOL<2*?@hW{jX~$DNI?cmHM9b6C4li7CB5D{$S0wkWb<0}1>3Bo6Mu?a
zPnBa~6bCt$wMGNQw_&1w%im^KGW((^`iY%aoU8cIpU(Ud0lOK>7h&ye`Xjze@V^Ef
zVu>9q>=B!IMs1b=<>hzIxX{eO^ubF8QANqMmfg!Zsm(6~4_cmjpEPcO4MZGyzOfp{}R?`HxWH160mF
z`#Q}%aZ3%CYhT-`_qYWRo5sksw`)&j7nBU)PPK
z9s53Wl~Bo8`gjXo@`k`>$(d8D6*=n;51(#DcDgsAwD=-WI7;m?fW)Q>O@`TD9a#@Hu73kH&<(=>5W7!#j4*>Q7GX4Nc$wsScT8)igz7)66+3oxVS|Pg2Q5>9{n#@`n8jbl5WhS!O
z9Z9|z$NtG6qeF9<)|}WN@>OGACzzcID=GG(Ar}{ymMEs${V~ytfNPQ!zxGAinf#jG
zUMc4S_CyK7*hB3kc}KdD3KX8anN0*D&?TE}VY^9#K{c&7{@FTlp##j!)#d7JSV6US
zo|2rsc?`2y4@umN%LNxrSdfL-qJc}*3l7y0^Kq|BuSO#o<`}+~j!vJ;mdd-g`wSt!
znxXbS)2=H&?}=iOxaKo(!6bk<=e)ngLG(z5Lc-9w%N+?(jRfDdcgirE2y6nmUW6h&
z$doxRR(BD>yVxfletZ)8>tYz_;O$@WvVA3_dN7O=8-iKjCp)b%1w`4Qu&4d!ac6LB
zDST-Ta?!QM*tRo4jpyk?o?_1=xBfa&3`7sG*A#xvW+^?bEag=&23Sx_{CuKWKd<9^YPdy@vdhG!cS~O4qo?pW%pH$C%slk)A>@3K7D8BC
z#QLZP)C%WsoHd(lrZwWUHg`#uHg$GyshtPFjYM?ugU_#(Ibhb+Sm76troko=DpeRE
zqk$)`q%60ksqSj8*%!Mvz*VaFdy&Bt%gyiJy(8~%9jP_HBHmMAnk7UmO67g=WHR-<
z57(olTm2ox%lln+&>h^fk$b
z~)rcv%;ku~hYDU#TCfxNn$OhFEei&q_w2tDBx=8{`>cUC*B>cI*|w$|jlb
z4lLf<;uDwj;fmmJG~F9V%JS@s2A%bdLk(e^;IX0haFIvNM(Oqx2{Ezff~!oD#+u6)
zt^J&w^1B`I51-if^qM|psH!DY5`si9gAo^e^sDr#-3#QKPvg3)Z&~*YMdgKd7)AJc
zT(QDCzfZO>oSQ;0kc#v>B^ld
zT!HyTQ9(UkgJ>^}ITh}@5BvR*M6Xi2&ftkT9;HMc>>1+=a~HY8(~P>z@Fh3AiLsLM
zw>7!bMKG8lv{{Wl?Qe3ZD?;jHVv`*Q{Hf0TpVlOCQ63rDttn=WP6Bg+uWj74W7G1m
z4QH;~815N+aRA1ZQu_w7i*9ek-_ejsu}0iL-6GTAPyQjq2fp9o219f_gnq#%k@(`X9kv;M8s!2~#U7@{SToxqtrlY|8z2+EJQ$
z==w1y{wrLlWxb1Yjc>c;;4Nv5=R*g2NH)*oGX@Tnw}|kXz#?E>O(dZy^&CbMm|S~*
zsmHY|b3&Xl?x)z{3@^H1baW@Ta)9r#@1c>KIuBsI%%NlH^oyF0SkFP+YeV7Q5taeI
zUr8$F7mRw2HR7QU$j%O96|yVFA0pC^q2tuNeRwwL&LLqzWGm`w`=L0}%OmbWMulB3
zUN{#5Jtnbas7tgYpPfSH$nDX=X862-!*pdM6lOe@%UhMkRiD~gyin;Qt3M6sgX@X&
zIF5&Bv3$+$sMtrhH~ix*FwL1osohT;-M>yx?_WDghG$lF
z|Fl+phoaen}q6r_~FDCJN3T1ICW|~|jt)1~VF2kvrR%KGo=a@Y^WS&lp
znEZ6V>YO&S*fh+3?a+R#&2TN+;h0uRwyIT)FlH}}F|&=dtP4&f
z4xpyrr=jwu@0fr1_U#+c?jhlH?m$EJn1R#s*-=CH*ko@=1a%k>jH9mPX-A5*9H*b~
zC@H0+5s5yHXW#Rpu4J@i9;iY}ES@j*KWxqG-}E)!d!UfG+a$q{D#fW*7+0rBr>OE1
zcu9rC`;7!-zJqrpS?dpc#+C>XEEO~M6Ro{e*AURXlTOTlXWL{py&ouU^^s7vp8
zJ9Y_-vEFAKOAKB|C%X~qRcz-k89p6+&aO32M|bES)Vky0z;mKsCc-K*Y-XSga2A)Q
zQFuHagWqRRb_g9X_Tq`%J^rsp!kaTG$r_rO(@nyY551%cKXzg|HAA0LIvSFd6Pw?c
z5p-SQ7vv<_Epdo41qhZCdkV+k)BGaLS0#o%-_1i4oBD?~bU@<>-&g0z4&TTL9hXbC
zW3VA`MUI(z<80IZi}OZF1}Rc<5J;v`R66P{C&jQvUr62mFd5nDoshC)$xEL<;w;Me
zlf|DAK3w8PZl*zxPcgUR6vGa@KeALPA$8i?(6E@DPVwQ^N(X+ho>%dTaoV%@PvGkN
zIMr*t3NU`0akR*pr*)rIQ3x$+gAORu?@+!WEz|e`cKC$}uy@FNjOf5aeEx94dfae#
z8^*k!sKGCwp#t4gF!5%2c5rM*Q{_{N=ctJ8xR@~bmEK9W#!HJ
zLtAial3TdIi62me-Pg0!C@<8wLs-2?mt9q3-ZRr3L5R{s{k>lndm)HL=5ecZ?yN)OtLg66iR!P6a1@
z5yq3(-3H2zoJB1(uiQ?bKeYGAFKI%HSiIju1GyJ|d{H7@WJ|2M2v8}Z
kkNMaC_Sd5~#zZ%vFoveu=-i&l647a4m#-~a#s

diff --git a/priv/zstd/doc/images/Dspeed4.png b/priv/zstd/doc/images/Dspeed4.png
deleted file mode 100644
index b7baef1ff3f7adc356d69bbabf2290bb38a1c994..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 24692
zcmeHwcT^PXx1}N~%9S8d1VK@dEGjt~00jXN$w|pMNDkdCCM2Us4vmtts34Q0Z)Vo4HEU+xd$asQ?-IJYs=oT_oPGA*=Unf{3Nq);(w#ka?AW=7
z5AHuXc8ov+{J|2P0zY{|-unvt=eYe7nY+ibTIg}$A7^YIXxJY+MsptebKC^k0S=Ko
z_VE6lr!L3mht5RP8^uVB2%MH-y882_B$FiJtGGDA@6QD9PpIFowh+31oRs>GXpgTH
z;T_3|#bbno+Jo2N5h26bx*)gFDkl$`uKmTlS?+@tRym
zhDKfoF;97$RmtXy@2^gZ#oDMethwAd`Frh-6L3+|4*J*+Iri${d^oZmD2n3^OMiZp
z>sTDE5{X{_>~%?2Vyiu{BgT0+LN!DE!>PY$gPg#pS4T+^f>vL@pJHfGh!N(~fvt7p
zQj=pF)&m(t_!*oB?aZRA3UMkWB&YGe9~u$aG^=MfUA<)V1au<)hx((mibm%urPE=M9x_0i8
zs9+3i9b?uKEmV-(9GcEBa_;DHAy2Au817E+ARY#aZ5CILrah-FEDgligv)dY`%j;WG+ZSaP$r3bL)mr
zZ2yC^%sP$!DqDzM?=uL@Xh7`F>Zxh2)eLy?3iG}AS;rYSaT-mZQ9SR`cIUKFyc&Mb
zZoDS3Jzgf6wnF%4(7oIe&E`*yfqF5$5w}dTT1Eq|{a&TBS8qK3@dlpRZ0>J(j_!7f
zT8RIL)LKS_Xc<>Has-!*Y#FvL#2DkV`e(y=4Lb5##iL->h1&DaY>u9%6`6YGhm7H#
zjhc%#O|dryov|>BvjFbh!YAkLnAPDCx5-+3D+conNRf6Lxgu{JnUOIiUwM
zBd>hP_2-Ax7399?e14}wftJ5rtj7-z&XeuM=ja7*pcO5fLoGzTT900sJ<93cAgcJs
zQ!&oEbbRJd`SBH%pYM5*G>dcVmKVdFt*~F8SLJRrht4{j7dg7j-Ro^OmuE|+V&(L9
zXVg07cq%?|jR$!pmSHDj74$!IN4iu>oGVviaBcTU
zGhtN0V>ZR3@A7R&e^^#zq^NN|p!=K-2Me;xJ4|sH54SX#^i1pv?yBmk-hA?mQ=g7F
z%&CY^E33?YGvFu;vwMmfIwGHGIu__gCu0V}z|)YTqCX18(*=^KM;;4~^Yjl6qvG|{
zmq98W0m@bfQCu>v4+PDeZJGJQkoyq?$!qh1-7LRv&4-K0kg5#Pb$Gh}{ewejHYWv8
z5yQK`oRc>xEL8?|-EfJwOSlPo~Ysw{mP$3cJN>L4NCa$Qsjy`?xaIs<^+?x*r{j*u$@W2=qwk+;Dm-
zCs~)KiZF-bR6h$Dv$XwGOEVlq)b_%lHJlUmBRdMK
zya^U4A3bLlvQ
z(035{M!k+sMTr;?oucx=_a&PkVf^z2y}CFMAmx#}b0*69b}B_+rNFxso>jRubK9^k
zs6SBxU$5A6S5>fjz8!qHY`sFDn}RGitv6ZoK6naAC-qy}S`m9I+>J>479q1<9p~mB
z%`~V@G^M@YOc4khw?X(o$=X@WeNt9P-Di(+>Nmqo#RmwpGr(5cG27Rjm+M)bi3~tY
zw{n`zsQP}6@e*QZX*DF<d&^-K$2lqkwR|>)-EG!kJ3g&CR!X(kCEVBNEUPo%gr-m~y2m0P`Kdy0
z=p_}a8CvLzn4;L)Q{(eRPne4*26$`fgHdam&jDik5tD8PV)XRGk$D@0yAQH&tZ-Cf
zr%J+bL2sk9H<7`q@3K4c^kLcI-+>_U1Tqh$i9;u9bi(U*rWOOU{_^fq)Rcs7nIz8pWxaFZt+Hn!PS(8zR*xx{y
zWY1<6>GIF0BDBk}Sf>Fiwn?XM8(u{Y>*v2fRw0Tn{Bcx0`a;zT$=gUrGmVZNARCAN^
z;yzSTV@?LU)StNviF7yy3bF9*{x=)N)`LF2TH)kp4SYXjeX*iodGuh3a`c?QU=V!C
zSI>}QDL!B+f1FB9`@`~A^?bK<#aVz{do+Y8z|G6DErJ&%kt4hOX1aS5!skQM7S|-J
z&WrkMxZ?4E^k%G2iL~BUM_BH|g*BrnS7a;RJjqg*1!Y8wH2BpE0z`~|3VJI1StZ!%
z=z$;Bc2SFqRiq1xw-bX@`hJ;fpxmAJkSZxc3-3LzxH8ZgKsa_twMoi0G)DwPZ=9?|oivHSP^pY?P
z9vLt0E>WSK53Juy&&zBOnz1o^mzvoRl10I`+AK&GZJFN?JGF?eNj~&4k=-nJEWIDn
zBV-jk(^P(asyk`$t`za>)v^nCr`@$)lTkL(#}upzO{fOzkRb$E@4aY+44=Jf3PnS#
zlseAZ*L!p6s)1#%uDg{R*h0A*Yoi=a)qLYSOTj$%={#>>i$I>7E8blDP71$)rU=ei
zy|-IfI#oOwX^|^r&1=G$MKi09&a5Kx!ms!DR`Mfe3%(Gc
zz5S5gpS9?ORZ_%e6;5J*MIsL^X^`qg`=Nn`$6rzv6>j<_j_7=jjzhZ?M)6I!de*Zr
z9jAvmo2GAyWEf%jRpwK6EymKp%UbUwwlS^da#9YC={I_seU7Q2&~=)7CYH-<`D29!
zgY5qEARN|Bx=zH~rMm~HQ*aPi?l=^nUr^Y%Hfoh_HB_EGLtCHr*u?xScyg*LOpF(1
zW{N#{n~N&utuT!I0p!WF5#Hnp;k1mzZ=`J-igworc;*2t#MjR8>AmLo(TJZyB4=c5
z#&Bh%u<3g^3gqT})xtftauU|m?XL@!+s5%$_^cGIU9RFjWUmNM=Vl~A0sz?jZdENK
zz1lD7uHSqZTqEWhx#1Jo>^b@cms*kBXP8Yw;~mdwBKPE2w;6V^7>pFv9J}YYmtkrn
z%{3QcJRq-Dy9C;oyRp9zOxEd;&vq
zKe#%8o+NWlzRA$v2<$(s6|Yf|<;wQk{TDd+6iu0%`9TSr&S6`3K_K%N8$FiA(?Ss@
z7nL=an@M)#WA|C9sY8TFbeo7s;~bOt`NMx}US={ZxZ5stgvQT-7xu*az~75<%u^M7
zI`gpu$#3lUQt~w@sE>^?|6W4LI4baI4$7F#$5Jn^_(xt-T!N{V>y#sO(aL)=tYH7t7itSfjZ=x*w%DB4iv+W0M{`kn+`u>
zGZ+BaH7lDhloOfzdJjtOPu}FSDJOLWSU8sSdsqB@cX{8;-)2B%Mhtulhau{2m|?L0
zI_5N1?M;!_o?bp!Y&YI9-5#&(r;F~Hd4YESLenE(+Q{1CUlzCu>Qw0zZiL
zE)sBb_zSGD8?{Tu)D>CEC*M%_-p++4adb~HYd~xSd!EbEm_mpTtm@sl#`U6q{dRFu
z4XDoRiN@raIGd|xq#qCujwK2-d4C7GKmypMT>gI3cuL|xg(&_^fRy_;zMUXVD6yYP
zdKk=N)NJKg0>ACRb`&^SJ@2r_x{QSxETkyK3&Sv-0mVZ!jkl`Ve*s#?xzJdZQ&8Au
zxZEfd(*lt9Nsm|kp;mQ962my%3kL62s-V#C@~1QwM3
z&*aI9w@68|&NOEjUL+lG2lb4~n)Cz*OGZ!ihD-ixw0#TinPa;YjS-Uch+tUQz#{f3
zJ?GwCw0;1P4P)+FuKrCu&Ig+NUC+}S9aF+d|K3@Yv^NZD{N@%$R(mP_`tWPa=3))9
z8)pr+&9AHp5paV~HAaGNS*N{NVIL}l(oW)lT6fLFY?LF?VJmK}c{tS4u|(X|NBL-@
zsIs?BQDD{FjPwpzTkxpZIhhPqitYLQev*%+_!
zms{|d66pjAP$avFQdCrv3RflsKsv4$pS+xjd9gM%J-@y6p>R01>bD3A
zG|fGRnN028TKVuBpJ#ctOl`m#r))^JSKNf#0#(C
zqce!qdCd#Z)LIGltzrVO8D*p_U=Yj;b$c{SVpO8qD!-q)m;m^7=QP)*S|6*;#Zin!
z-bC&X_>q>|f3$L}{?Z45nACLi`xp)wH*zTefL19
zW#`CxR6g-g!%l5Sa)pI$$R5FS9#3)P=CIy5JBB0d`vGv9SJvK@9-_Svpu)3vhR_{K
zPLvP9d7jv$5dYqBk1qgT=B7^S?+W3iiyv7
zid)7_4NWks=&lkvM7SQPcw($X%jqQQ>`E+~vq7>V9O`AQ3$HK}y555Q#%3S<99^PSxC
zxH=2)a%&_+113Nw9*Cqf13H(YmUW2{9lxb|CLoSlnx)I${dM8V0F6zJ--TdUEacUJ
z;L4);o)6xD{~({XaUb6&DNu#~cylIG>^Z5)>`KrYkgiQsiZ{o6^ODapKSKw#GBdVOUeSvT$1F<%etkGI5XsoJW2JV$vsif~KR5OPasbV52ZiQve~+YZxh`Om(;
zasW>*c>%G%&1QYt8n{j{FU~cFa?Mr;NvMRQYI4stf0}jpqB}ReP(9$wF8l_py*!a<
z&;1KhKG#REpRcUTt~k!D2x;(Yh!qlPkbl+p9e9J-a7KjbH)p8#UoJey-^awITQ2CX
zx6d(YfadquT%0SwywG@#I$Cq9^V2IqeEQYzGtBVOY2`6^t8X4p+3!9bJg*IGV*u&+
zzx|)%Ik)a~-4H%tT(F*PtKKpDt}en+SZqb>X#vn2LxVhUsS&FKCT)#9WY+flKOS@2
zlzlG5*g_)iY7};d1-D*HOS+n{b?92W!ds^>Pq
zR^?*ch9P+i%R${!MZ~kN`u-W4I5VJ9gTKKGuQ;^?eG+;Maoq$k@uiAxDkt%y9diL7
zxtpsWg%6p$MBvYm?KNV5^!r`@bO#{0dpxO!^3Y>pa5e{>q#wUmMDowU1b-Hc=+7o$
z`j2=qJblhI0cJ-&ik}P0Jwt^Vm={B_)nVY>G!6bX!mrb7bcRg*^~nRr97syn{4d;M
zfxNsC)q(KU_|;jxec_5OL)e$_|&C|Kn8{n5GaG+9`
z57UFYLSAC09!6kVgRE@kGiR0deYs1obE$ugyN6ebmrew!n-B7^GORnVJ%=!g->sH9
z0@Lx0?FAHK>jzC`5Xj_hn<2o1#S!?2QDnX!iA&}1X>18#)|ID8fB;gZJc2@Jzrmbni@L60m
zx$ZB3ELMTHO*k{JMHmNVHC&JawsyY!HL18DusOobrrSPaGFu@QjYGis*WfDf`}7hh
zC%@jesf8TXb3+!oE0L?fp(p0PAG=Y`%J8D@GG;qvTnoF^v(GXA_L%1vVj>Nxh0ANq
zk8gTP`BEoRD2nn%1$U{h0aV8g9D+9HgE6p5UI8Tvq^a64ZhwK0@v8Z9N0Lg)fopD@2
zHq6RNjz?V2_WQ|-vl_`UPMTg8^e!Ww7{?Xzj433dvT8#IR%fG}Rk7Y*kWIs_t?te^
zUr5gM_>yPVes8Minwl~J;aQf&F<+jf@Xeua>Xl5@Li7VgzfA|ecF}d28x2K}D>O=i
z>hsk}Hpc?Us?KKJjcx@#&D{ENrC&?6jM+mUFN%A(IGNsBNh~ducHaIH0NgH2f&d);
z@-e|m9rGV}1zFm1@j45DTDgqbMelP@7#(E4y%}kjk
z<3xcG!*xqm{>&$7CTl#JtGL+FWn;+MWDUN*jm37EDyaEuBX-w1ArFw)XPV$~gS#%4
zOZP__CKb^;Y3f(56iNUKJjP__xk8A_GyH@5Qw2w`a=f@j
zLCtbA{FnKMF4_{`_9U=IS4El+=vnYenItA#ipp@d1{LuJG}18mm)2zV_JKkrCnUC&
z281R>fUtCtDde6{i0?msKS81IduAr5&a{cu2Pt|#!~BH7n`z*FeVAivD#}2Mc*R<%
zzH0Bq;55DNfPb$t$l`a60j%|?Pb=>fTNb&*njBa4Ji1R!Z$TZi%dp@g!{6`}Rem?4
zOWc04Nl*uX(AT+qMavR_6xqB_LTq$m464ovG@%rL|8XI2z(0q1uSpT^o0mNq)XfbM
z<6Kl<-`tZEit#(0Jh*3_F5dx?Cu?b3U^I=5HLDMsMzA1%N%PASZH(Emc!!qyTK>5y@|*
zSqgls9dUPFceKke#)Q}amOps=(2hhlZQ`l+&TDJ)2dL2Hu={%(ox|=6F@+%5D5yp8
z8c3IdyxgfI!w>=qUbi8>qs6)M7E~SMCZlW=4&d4&aG^Ti{q0H$KxfSTk&d?jwxD#^Q(gy+ES|%}o6ad4PC5)ipam++X#-OU
zzfcc)&)}ajr2rBp0}9oN2le9X_y;{IYC0kM
zy4?^V1(>l*&>8nw+%A^
z-Z^MW@K>EU=l5_i=TZ-=_>#A!Qb!+SypElg9UwEzIuahbw%>M~>7qPt0Ytf$b=ZJ%>rDyY?$$%7%uz1W}qk0MQ&}
z*)X-oo*uBgEM)~owbJwt8C!BS)f-#&3v1YJ6nGQ<+5U7dt~JbdI#9a!)Deea3ZhfH
z+kMz?UI{=mB8`w~Y5zm_s}G1yRGBheUcW$=T0{G7w3_%O91=@!SYU4H=E_W59;{;YDj*HntRsdc6qOW8=
z@?O9FHc}~QwkyO;q~ktcaL|-VOwCzWNe9Yz;hB_pkPw4se3Kww6Vwto1mB*=0kozF
zC>(33-CKAv+@Rx|XZFwUz^5Wu@(-6Q&>Pl3ah(i$eZ}Wd`+H`9vT2r1$tszQT#Z@q
zV6_4!AdF(ZfOP5qK#)>$YKyyrn~o1`Q3q~_f9L1`c4Ej(1W`VnZJ+O1$ZHo`YJiUR
z^bWwIs1j@ZcbZg)zX7Ai;&%tYnu{`|H!rMC$D|{`~#d
zEoQ*oKDAi>rzF*1>5>O1p=3}h^AW276S{#pgd10vs{j+|?wU|_kQ2Yn0I+4cc5b#6
z>NnpCgzfExcq_o*scPJdz|d^SI2QV>5^A4@I(5!nxOo*DQV{^SLHC$Lb&7;_$@6#m
zWNK>#iowV3zF4R+77IFe&F1=Y4j7*KSt2EW(9hVk!KGb%gJS^lfvJtlBUp#KQ_}98
zS)t0P>dO{FBg%UGa}p_Bms0Re>HqnHgef{gTNHvQ)=IAq9$GD{Dzq
z{O_)3m
zJ3&h#zB!T)G#^KE>o+OI*NPo*9VFQ1NIs5jQMc7;NSXQEsY(mQ}WIo?v^es&iF?TVO)^YgHx(~S5j62V~27Ggv%x+BxYuACg3*Abt{ttIQOUJ(($30_DDwLYG#uBqBse8Il#_0ByrmAlc^u}(5
z{vzHi3?jf^$%USKR8KAAy8vWtp>gAy!zIX>exM6!a<%bLV6}A2rjFiXO2}H|Mw-g_
z8>Ky#1wzrMp`?z(%V`I#SYI}RwhpaciIhNP!dS5%^>O`weXt|hW=B}%r{R^@jRd{@
ztzL$8nx!hx7}CKUDEbj<>84yzGl~+h(JciXdmYh2_8mUJ7U?z((0Gu}IH(Tgmxd2U
zuAs?jwWHGj8yR~N;*Thg8-hU!Vl>vu-bY>Q8e~mX-O?AWK0$hWGU)iI7|?{84sghQ
zJhBt;_fI(v)bWy5823ErJS~9vQgg}D=r|~CL9Bczk6!G&9#EP)E_=~`gqmD#+s5th
zr@osw=xo0_g76*yv|KlpAW+6TAeM}CdJdQY%$mY^G4H#8-7)maRi`3!4)0dMkkde7
zW??@&2VMMA-d7u-mhL5i9HgB#@Rg{1P`4&SoSa$F5MYWym-<${BK#v{kLzyu9TVq)
z5ZQ0C&|r1`{eU@WZrAoouYKPMI(LNU()Y<~tBLxd@Q5nw+$K^wAg^}G{aOHt>wur2z;~BSM4#)$(6RJJOs0V>*AzDEgmyi#_xJfNEUFD$d
zAN2dHIcZscdwCoOxF*M~u4M5LmPg@jxKhY~YNZz~Q3$4PB9WWRruYE@*|4;kvjr>Ev@B6vG8QQ7{?>vk@;7*rK}&wNHAkgP9KVYtC!klQP9yScSGJW-yyboBY=$_~s~7
z%~HlcKX6HyqCf-5p7`U}-DG_bU$fS$hm3g+c{zVBZ`v+?KkY1RLHIR%Wwo@of;;NL
zrHS!+)b;J0Kp5x6QD{(%@?fOzhwO0EOGV>OfWiC}NFuf9oeP!gEZEw$*&?-y85NB-
zA65c`;jZJS>4QM;Yw9W>D=%~ObW*(JHQR&8RI8ir^tVBUzKZ67=j`1qP%0(Tw6owX
zEWYLn#pQ5A8z>%nt`mm`A6zRnQFX#1XQk3%XQlogc;^C1}#6Z~!{hIxj}z83gH-tjVW_EX#c7+VWQ
z?ij9rdd_*8{4z(DJ+Sd6(}sv_&*kN5Mev>xA09aHCRBjB-hEf6;v|8c1<&MTGnoekOR*@+R
z)V%tVgYNVf7;;c9?7FARLZDLV&nO}89wnhc%Q$1BS2LL1H%6WEGDK+;%(3z;JWE?|
z&VlmH&XR0W^SME(MHo>ssxNlnkq}XbGP5Py8@)-lWHjj@m=P5s>
z>|!`r!dYXq{+Ars$O*;=QC5W-^KHQK8>{NqJp|MttmVyJH6T_}-r)|lexJ-TUe>2S
z++8-jmNf?xHKRq2s~TnyGBO+UdU5Jq(g!4GV*~zRwAMTo=qc7ksOd?0dJK1g-o;>s
z2t)ws($i;tlhum5$f5eipSAZfJFq=4h$o%rqUZHVHK_<9d%H#+=|;$YAL1`z(AiC$
zULdpRtCRvbc8_~apMBcDZdrkg1lIOhEA;tu;E^j9dfX$d5q&20-iMWHByyq$Jr0(@-4#NEg?7-9j=}-C}@hnl6A9ae-Z~BLLC-0AW|4`q$+|#Rx
zp_b#Xj!xU+vKFX0Pp-58bTWk7*UCqG;;)RF7<{$f@VcpDL(3m==qi>@hp_T!*@;h0
z>p>7{7)9ey5PC-2eMU>uiJNss!V^q)GN!RF`?}wxlX{YXSHfI{KvnyNQLO`&?v;ew
zr$UN##eFEJX44+cWn=Y~+8{U1U+PNY(w)n1W!#0uS@1>XUl5AD%Lne9jL4S*Z__6e
zZy(WIYyd&AvAq4wavdi~2fS8hWY{5~0>e{)Zzn07@~}6a2pk?%V6H2BgwP^^gchm)
zjsv@=8+|2I$mS}n7((
z_hnxLo9;hg4iUhl|NBFX{v3P|tp6X4jQUTu+KD6@fSPy!Kr?&c*Q2=-775=*ZWg)$
zU&H~(ga-Dg?t*Nc1oq8HER&kx3Cuy{UY62ON3Q$qkz?Pf<
zYX4*a$3#H4R`M&IgolTf(}k0=G`Ya9Seg&qB}vd2J-{(InE?g(0c*7FT`2!T8rFqv
z$(TdA?(Er5?1o@I9XN(V9*C+JD;l;9K##ZC>U2AsbcyBfFFxjZh3J#HLJ#C_iLe5L
zonq#IL$z~x;O#AwmN^H8-^1J_5odsIQ_umX-I&gwaTnA|z1st|a!>ws;bwwzo<5TG
zoJbC(aqZr{O5O0%lm|S7>$7NH63}`6jgI?qT2KMdzB0-{T``A
zsE%>~Uf)FE8IsT{9R1?UEql?X+|F(MBDSyO?fQ}a)6euc&3j=qZ+~w)IUL~#H1h(Nv+}!FTHvgyP3{`26^fAI^7G%1YgHIXo|q|=TBfq{WPY@l9iPj
zIO*J(c4>b)mHl@2qbqw(C@a94e&YrE-?Q8PL*`e;9V1xs>X_YEcRQZ;6vqw`cS8Wh
zngL~Qcen+b{RKS%Xhhg9eBPLw7BM;3iQIF5_Tnvc$mOrnM4#Ny8+>29Zh!nHOQ;}@
z|G5h0-5Fs?=x$$!OlbaKjO0A<44HwsIvVv#PT2w9pjsH}UUL}nJe>so@xoD|do>3d
zPu7XrX+$Le|GHsqHP#dwwABfO+m@u(cE*#CCV2qVfjxb#c0&8LBpXPJPaJ|}&rfqM
zf{6(U5Uj^Y6hn%r+s;yLC-7Fqwn*&nK<#)Yh}*Cc$=BU66K*KhyL03+^dF#-WEg2k
z72qen3w%H^V>XTOIRi#H$bG#9RVNupU+P@d&l*1G)eXR@_>$83@_h)HrTrd&ISg8v
zW()4v?G94-;%f(Jk3fUgAU9XRLb(Ra699V=28Xsg>4+~Ztv3LzWNA1JN<~{pf6j|9
z1Twxu-DR)auBXsIw@e1*jsmQgrA^AX+(u&f38>CWLhWy(6rouWsw|UN4@Rqj
ziG~(#W8SPCbsv~JLBSsmnd2yna`d&zUF?J>J}GxVeR$9mFmR0mM)u+Q4)f3iM5rot
z+MWf!l+&^*Q1LmIgP)9Y7F^#P4^)JvA8a+-z=NR?d7L-k)Atw~veXd%g6qH?W&j1N
zNI^UOgAz9;IigUy0`xKNF*nDGiHIzef$At9bRHPhX3v$G4un;%Caz{VS8&XOGihK{
z_`KKme>tNXAL(xQ_a>S49t>7UUs4-(28CSO+l-oyLoQPEcn}a7?c9vQ^#P5eJ2z-3UIH8xgS84xbWQ9stzzl
zAsn(=B}1;mZEjLcXsT8z2mpB>K0@|GKo4-~*rBO#U?!Th>aQQfJdX}cFhUQZF-lLG
zlze8JKr;n2RgLYgZd1MYnSMKMOQ@;O4easUXXHhK@gxu#l7|RKK)U)t*W^kRcFuMV
zvLIY3uYNE8=;l5sH9y2i%zy=i#)lD;kh{$k#rD$`4Ss=>lQ2ty4%v7OQ$Kr$4V`>0
z0>vhYh9VVS{P0F)SocPz4a@@g)H0Sven2|&jst@(v!JehGav4w9QQ-0h1cn#AgQkF
z_rWsOyzAItxjZ9?LgD1B9sCN64@Esit}$R1$Rdj1Zs`7bqNk6a0dHH2Ce?G+yFHNA
z&X$r{3_p(!r)N}ry}KNSYLd>o@>uGa&zT|K9FaoW%z9SsT4hJxv#R^MfWv?CCWnZW
zx0DLG!X?dLxrydU0+fbv*_HR``D{h_a`3_YKi|aktWtJj3*NL48#^s-=_+VGhNW7$
zbP4VAbY#~)=;%z$20W35X;Yw8Ql?Uvi#n6_E_xPNAEFpzPu7IM)HqfVHmcoMTin68
zmL#YxLFAs__2CzdTpDq6=6i!sU9i>;oEgz4$Dl!Wije(JL~zP+rat3Bm~lfjf_ZcU
z8Zk!PX1D9oH@YO`^)HZY6#Bq*wE5O`ftV*_C
zhG1Fz$g{SrmVee4yrkMTxX)U+W7aTN)rivn#3?;7Q)JvvM^RsOUHY@WVH$k)SJ~E!
zCAf+NZ$9HyS7+LXK9XgFXxRzzPn_ClB27PO*hU%Fze>bXEP`*m<55I8a`uGd
zs{J4dFj}@LeS4rPLy9DNdY6e2=JO$_Z@Cr3RA=D=p4jll#_G(PaIfxe>Z$kbsaqqI
z6Z+h$Z%S(7x?BPToyVz}MRKI-X00K2<+`H*Ep8^dIiGLx!@-zAYcy=~7P3B;S`=(c
zWf#W{9Rmin-m9eFU9VedaIR-&S5BG3$%#-G!#@U*@`&ZW}3T-Lmqxp99#6O*(YUNk{a9D{$qR9B1jT
z%w3?%9>TKNRfH?k6ww>RYB^s{Z$H=tKS>2SHF6WGObz1wfq}SKXBq_>wa&jM{~Z44
zl428D`5m6R=%j%!>$+;;1hXcd>ub68Uf>#-q?4<|o1F%a0uG;bJ5c(jVk
zjctmwGfR53hpmT(H0udp^!A$tbjkGfXIInXy%Y&$uaOm5>tAJ&4%RQ2cS#VBCGqg%e|MwxhcwVmg8K}f*!w+_a(S<%%u9NG
za_8sNd-BZUOj`Q{{kvPB5ntqyv7SzK_{b$ihMMZtVyVq|#@*{>A-zL&^6+M`A(_?4
zgT{KE30BwX4et4T$o*B>c)|ppS;_C+Uf}Zn^485Q=E+tmMrcgyJa9z0^5ym(-i)Xq
zd85F6lnj~w!yWRuag+!!VKM-LAmEZX`E`HE3?(WHZV*KVoR>@-^}jcOo|^K)ES2H#
z&DurCZJc|I%HC}m9=gv&>+hHC2I27`##efr|6qD#&I(-|3!(dY26
zOC@%C;;iX*h&Sn`T5tUN^pCdyXLOE}hpsrH`Rpz>8{AvG
zB>DMeR344>Qi4%*cG<%6>_m3v4R7W6+_6^ktB}J7CfW3E%fOmnNMX;7WBSc;|
zfILdw_9lUh+P-Pcv?8Y}9W%Sm$v2x|hIOU{zqL_~;?6x?6#9Xt_;FF|x6lA?9ANDb
z2cr+TBI&Svr+fq}(=ED?0>jR|J;e+cNXWS_A|KEFDhtsm5?~>JYVh~2%Rk%_Is`6&$p=(Sfoh4
ziQZAn&+uc~8=YhC`#CYr*x|vI<)OE0p|;;9O*_jTG;utAZ*vFc9E>X~m4<8Y_3LOE
zP;w!*Zt@^eP8&lFSpye?i9U0P=;?;J_@BYy6IQnX(YMgT$%Bn)O#5W!LH0SK@aNQq
zESP)rRiP)ct+D@b;@oQ4%MTfFR_8llKq3oSya`nEm`?=zaFnU4tlvtPRWz5OI@wg8
zrk`yN4cY`nMH|1TheGJUTdP?Dn!{;BY0xa966b=WSwv9)Tk*U7XaDUDK^yHon)sDg
z-QR^BxIH(X8@51GS9U`bGynZVx|6ysYKWcv4^MM)giS0w;G2qu`{K>$tHr4YT
z=75V2FMkt(-?VA>_P0NqG4z+fBZoE}{rb!A(l*a?7GBj6u87!1f?q+&3Jh6(&TRW1
z|2%r*_>pU0_kMSwCieD6HkjT5nJ+g$NkT}
zT#uW5wS5%@3X(d}(CcKp)bdz-DCu{fzwF;wjI~&#Pb^cK##%02sebpV@5PBs+QIY<
zqa<=~XZuFEKLd1GX&bX7d
zaIOIj#-g{ZUmXb#DI)&odO~HfvPG&IXFq)R!2dPy|H+6jLi5UjS+xK`{e-J}?%vYt
zM7o$6v(PYG@kzdI6nF9uXmd&kj49d0sh|?QuI{MGt4N*Ry
zO=sR`(%T{t2Ex9d(1x#K+H`~SUY7|vn)!ZiCSoI%tFBPoGuLR_o%bum>AyedydnCz
z{-^cXmh`ocMCLDPkM*?mT#ZbN=xJn{Y$RB}==Oo!8K;mJ&W{S(Su-9Dc%$?5Xc#qz
zj)}~dh}t&32;m+dX84a==eHSIS1;5y?iN28{^&O!ESO8y^se$@Idk+4%1)hLMjh5|
z`M_y)i}Xvxm(J~$q_5xk+*a?usOI4CZx8?NU%&fYUNk$$Sml>y?6K5zYVH-$=THZ^pA6`0~qrE
znc)9S@c+9PxG|HGQJKhem32#R;Rb2P{Oxgf1$zoqA63iTn3P;aC`@|Y`bMOFt<5;D
zr2OvOYHqqp_|C~we0&bOc8L0t`E);3XyBUGH=d>Kr0ifm|Ax9~FzFGI2r5NvwYFLP
zJNBxlmjco9a8&JpoXTRc)93oR3oc8C#A8#}&G_r%2694Ca
za`p7m)f&d~(Lb3Q{=5C_cc0_*Z6y+7`?(IcTU^obyO8Hx8!=0xEIr5cOm0SZWCm*v
z?kuzTzV+Rko%j|x+>MU(-`}X^R#rAQU2r!KI9c#|9Chyo-O0N4LPza>rXIPR);`nu
z^X*@P23zhw-@jzvZWg@9*)MaW6h~Hl-d9>|nv6up{C6xfoj+b0RBk-k
zqYt?Fkg{sgbA6+46HyxYfqe)h{3Hy`Hnb+wx8!
zh!FK|C<3>#=ys*=herd+ZJ$XxtpI42cjYpqI7pY`*kbe27BD
zluL90Tbj1VrM2$otbXK~lxZHkD~Hi|^wRgN+HAJ+-Ry}>W~(Ntzq7g}daGAq*h%`f
z!TB%K)7l5$gBH$QbY0x6ogYna_}`|7uS&*gRZ=jlZDV#~NWr?I*j#}8XJ6ciLv29#
z#nN;Tsig70ZHHmDPy+qocyya`w%B;a5*eHqiC?QT&x!l!*Y1noSXfIi#?<}G&xkwjg%w+@t}`(ALE@J(MHyfXG~hIN!J=^J@myh4W?82a2(`UTdro*oeU@QZWyS<@X$
zJ*uvir6WYE&CJ&yFv|bqjqR1(YcEpo+K81X?Kzsb_=#i=w_FULsJa#Ap=fm4fArCv
znG^dOW@@_a!|I#-(s4&LGyn6xX)kIULZcrq^=Ek&!V-k;p3aD=@HWlWYsI;rpR($$
z62{v!u~*(aJVKGDH(mOBwkJ+VHc9S8Qm8j&sU8guWL5iqPNY#W^b6)9lCT}G&N=UK1{%}hzeIZd6rBfZZs7D0&JwW;?_zdhQF2b6>h7;oMJ{=tr$n#%|HM_4uiUc|T_?Y3&^JPAtYz8mjZzyZsMZD5W!UNO-%(PP-g{ncAM
z&q#IJj>cSbblU&Hj>*05UFa_g+n8hPsOFN+dhkMOUphOL{>QDq*RZ9_7u%J`*MvH^
zF!#)1<#)-jD~mcQR6R#cYyamzYR$KF%HO{mFKAj{oSZFDbkxnw9r6gY3b~lawDbLM
zCq}MHQlkZLi~{BJI^|bb?aS<>g>M({s)41%jxe0lZF6Y;&Pr4!t1$DCmD5$0E?reZ+osp}Jf7NrdvJZYVQ{#Y8^LIRcVrF8E6!HHj80DbKY4fv
zH9)-dnI&TSzE4p>W-WZSDy%4)c%yT`m;G+35UNe1*nzChNe9ZrNix28rn*F5qPJC@wv{#^)
zmr+b?4}WHMv;86MST3u6u{dmtV0AdXxsM?O7fnN941!VI-fX|Rid>&*{#A_hm
zwlpeua-fa6awB)yMiNn}^io_t;4~|Dw@QTgQjm6x-GOK?>`1R&c!DMM>%vdZnSb%%
zOVzzB9wTKb)FVa2*9B__@p(B&Xc+$Q-KCxL`lz7$X`;KivTo6n_
zOvvIn5@h#=+&rrU0jlw*!+%_qG&ZEaruhj!m)KHL)Y#gv5<}SD}ey_^v%qHggJP3AC8t{%|j3
zT{CNC!ZwTs*!XS1xc_y#P#0KNQeEvPiLzrSXh_HMxGENP;gVN!bBTzO&^44Jb@N`c
z=y6?ralBz>+pFOY+=?YcRLLt&KPRv0Lk8!nX9t?51_urV&+#=4r$Y>_;`xH*7v}xCgW?h#eviR
zeqM2QLinBu|l;m#G{$z+uSn;
z=G(4R#*eFS3Z$pjgj;&zZ-1wDI5HmuM+MX2?K9i4andMMqIP%ZXc(Q-K6CEO*7~LZ
zP#k7k=9*#a%*SAG<#D?7(+f0-dj~<4R;n|R6_KM%>pnBHm+rC=~%vLRn
z$v%UEwrD1oLcKcbjwZ&d$kNs7w&-6a
zyVGJ4n&Z%f#4lTM6BP-!6>IY)GWx&{Bw71uJ?lvLkd^a(%gT;^2iKx8o7@z1f~8N@
zk@6>{jNa<=)a7}XLU6~k$r@xXtB!Y~QY>B_%+BBcpS4(|HIvIySM<7;Ya0We2u@1<
z4^_-2L*2r;n6y)e`5)7wWjD^B;gtK0I_>lcqZ8tQ81jA|KH2Z)gI-15c-=5-ga2f>1Sj`DrYhdKv8ZipGmhIk
zW-8Wq5yF+hK)S?0U|ad=W-uqUap1|GLz`PMbOA3D3FpiQADy20!&DA{kypo^@8sXGe<0N^PLYQ$0(wbF=xx
zy>4uXYcG!PH22oLv5&49Mt+=@^_B)CgJ8a1AX2!CkC=M+$1%O-r+o2@OF;ny6F)F)
zC)Ou)&wOXm41wVKmvIjZmvcg8qw1xrce1?t*bOON5xn6ZL#^#Ai7y<)43%|u&YzfO
zr}ac>YdGqDTMS8Hq|oz+HwWr+>`Z@pEC%w
zx{r_MCG(Ff^z(|GNb|;c1O%5)(DeCZxKBFUzCU`{s&Y5)tnI6RBz9j6P-*}4&SsWS
z`4Osg!mi6qcX*oWK-KlENw7FfNeLgOp56^)rAeB^PkA%se{SC1Sn#qmfjn~y#cO2EU9!G-uNQnl1atEMOX6UprDQS47lJi@;0x)@CVNVtVg%&KPuQ
z;os#_XnT_|B^CRs3@(nvlIKb=kN_bGu6Q|NL${TM!ZVeB8MOw$gogN!JJv_SzcSQ;MKf?FQ;lSu=@
z^~CxP)coB33d}1u)&%;z%kNuVW)A
zxHQ|C_2Ix&s;te#yh7I_Hu6vD`bWiF;{f2ySJrNgG_D_RGc8>`vGyL=^oE-F#E?YM
zFf!NXWa5V;N!yB-l55C9&ZAc6F;|lG7824u4sFX~kP=PiI4Of*kHtKn&mTm_sLPBS
zvjDsrh+ZJ8*D>_@*^SkZi|cE~oe!MJ;FS4!h5*&2XkK-)D;E9s8mNR0jvV^3d-hG;
zG$=*5{JO#IUaNfJ{lwbcp)3f!)DPxbMVT2ow-1CSt8Q5P2&2OAUVJ5FZeiT?#3KEI
z{*tDKw5t0=R3U9L^sV~mRZEtxkGo6Oq>CesttmUXt!r17pNqKO92%3n+S$U~*I!*I
zIsTxiZT07I9xo{g=>cFJyOd5eqDrbfU%0Vnb@*ei+Gq(avMD>3&Rx=sXPWx+l>urW
zlVK6QF@|Uhh+TEIMtZL6J^my}nUI&NOuCogXDp)McWusS%!j
zFtDlE;1{_50kas+UzYJxlZf%>%Q1dyd)v&P|M68i{HJs;R30puvxesoji)&pw3_3o
zC;nh7GD+nH^x>SqB$Q6Q#u_1vxK7z
z++e4CNMCiQ5_Bimu7gImwl%=mZzRSRif-{kr;|MTj&!1)RGff>t@kf3@SJNn3(m%l
z@kUQ-+rzcwr~5v#Y80%kZBRtceR@4lP*5yBA{`11q|?E^s_l(o{L!cL`(!(m(Hy(C
z3Fe@hF`&*q--e$qM~Rz&K$*_K;JZfbV&#=`05Us=(HOE0z#1sr!Tgr>;S
zP;f{vg?Krot2%Na*As-v+24#SpMws*spBzee#HUC&x@Y0Z>OuhpFR{XD@a>nVoa+F
zrKyOD(~WOPl`$J9E84<)1N2}7$GD1I69jrK`WGQy8njd?9lo^c!fe~XY?O`fMy#e<
z7H_7GY@Ff6h_NwLlOCAG75Z!PdA-qoewb6JV?@KQgk0L`k(3aMj3#AIf-nm#o>;M!
zbegWNg)YBTGniuVURpR`FtUW*hnL^Bx;}2A+mPmWl^hB8ekK)m9|**RlozgVcjK2D
zZkB}V-ak^iySKV;Gp`h0K>D^EK7nz@?gUpaew-8Tm4{?FVCBz--psziQ@Z;{5f1ig
zSM=47onk2JcGMHSOKqy@FDs>ZIf^>^;^Q?#HC;lUJM0{3qDig&O&>mVE22J}Z=r5D
z4|CS(tNY9sd;&I_$9pL%w<~RHyEmR13`4Vxt`r`jQ>F87TeLEbj^&uwcPt>fURSb=
zjpEKqBckDivutYCPGq8ZpTvJ#?nj!+UHEd*wl1rq;mAceiPwR~X-6(7wLx`w&EUgC
z%zjO*OWxRI(*9k`>}}2F_m;nron3PJnykWrq6bh}=c5TyqGm?pQ3=kPTL>l7_F&rW
zhqm*Ex$NE#ka-{!D@j-z3NFlN7Q@Ime+v2Hgd<|*aEor8fp|iivzH8$myo8c@uH%(
zFg?3XrrWpiW;yBgda1-{6au4VIIqvnb*CF-ltkT{dB6j)J+f`#QVTUrkA95VwSlDw
zl;h;d4dc(i9=rO~FrmLqH}plpQPHNSbV)i;ca4ffAJa`Mlcq>zb=3T5%>CacV#RIM
zJ-0E=%CoIDV>yh%H3yy`pA1Kci)m4y6pi8j9?`EZ*UeM&)YgJ<&tki{0Y6$;Vf75%S`Osmz^DJ*Xc^Z6gsk(l6q@r$b6x690yqD>C0?hYwh=lQm0^SWf$I?3l)X3bC3x+p(XJ(6vO^JX1{8j;vOoilZ^l9)~1a&_QfJNpw9C
zW=6@aY20W~3(~YF1SK$kl%wzR2SFB~_2KwHq_|5aDAQR
z3290ib8}6qQeLioyw)$)wNQTmB3kG?3~yPBG7dMcyR@Cv_4|vHS4-4M<85;!QwO_e
zR8&YEE2eAgB}Vahs6>0oJ%rz8t=2lPbwH>D{XiDg!*+~>%N5BNd@cvqpHjx)rsr=r
z*>PI?XS2tH1S4<+tKxQeZb7IZEsab^IXHVVu>?PPE|{iXpgT;@*os&$t%AmA6Sf8P1lndw&kU_QQW}>Q
zTvra0(UOhxs(ZGK8qsH-B1&IbH!je$ec&Dvtu`vv8%l|oW2`_tBqi!oL%2G`x=RZa
zu~DPh(~*(c_F!X8Vv152Rt3*m73<2FX|J_$E6-M0s&Z}8Sw*yu2
zp*5R%Par?o7E}X&_^M$AzGAL$sJf^+!~%M{nY6N!su>AlLj*;>4VVVcHp5^|4e{Wq
zKu;^WhJE}&ZNBvPqvd0^T^DW_u>@Z0v9o~n8;IB&#I66TiinZ}<3JHfoRjOnCP{iKWfz>*GO8Z<+cEo!BAtxPel
zGzYpTCeq*92H}^DD5#yS?FvkWdo{!7LeUECeesBVMZRR~CMmT+aT;ECDaTIvym$1*
zgU^+>{FRp>DQU}H6EAp?L+2f7_@U3MyvbTfy%;606-8(~mdaxw!ogu7RH$XVw;%GF-fiRT@fGW6!tlb6Ki1-?457|Z$7PFy3Qpl@<_0*OalX_!X
zrF`0YUO&yKz5*EJc2SY!;C?DKcF4=dApG>5)-
zaE-5TOpd@TY$ACaegBrB#pVZrkQ*jZ2?P!oiHCTOTr
zy>;b8U{2p|ACWR5HLa$>TUFP#9x*^ZH@_&Pzfk?IH!v4Bj@HlAvVUH!ry2r<2(jTV
zLOuQ564AE1XoJ6t8dhnUf9H(G2inHI!R%1E7PZO)9UA2LJh(Mu&AftC?4$j^ipC|l(&M>ga5_Z^lQv+_Ov9j`{N2-1e
zO7EX9TOa(~Ot4#1I}}Zm;mlxYY{GJ>gF1)|M{85K#baIF#a4pdX~KJDiplL*{tI4c
zc4Jjo63qcyMumWY(Fd;vL8(#CYu_jnd{Gci#Bq2
zbTN6FMgKQ$mB8#9u=hKdhE~K)^<|(Jg9&N-rf2S=>cgeX`2G>{>`1FC6Crp5arM6G
z?nQbkXzp54!0@C#RuTD#+P%t^)Yrh&19<+`9p5}EdCw{#KrLVRP%s=h6n}=o7x*=>
zb1?7)AI4}IQG1(?@eZLC6Y)^3ZAHpYeF&*~%+?;(ZH?s>6*(A
zX`EaZB};6}(nqAm$JypfnJMC3E#XwwtDu!;`mF#(r5Xd*c&*8qizczkncZ(F6f0tO
zC#$OpckDY2!jr=CQZ7TY&To~m&k-KCn!3Q;nR)s6G5)s7r0(wfPSLeJBl)FflE@0Q
zSMtG3N$kbni=+Pt0O`FUBEiz@Hq{Z$i*(RR4_~b6tLR?o=Pto83B@iU!I!#@9qW<1
zn^EeAoCx*v?+YSxXHUq^pFviH2erllBnr9}v!^OX`@?A>dbJp@9T}HxK_2TF2W_xC~&7gDNar}aKxp^CUi?;Z6kMkMpW`6c^wqPC?YSbtV#QN
zql=`PvTCH$>KCFKv!siH`_+r-Xn3jJs5z`o%YNKlS-AcJ;7|`fx+mDfvPq0obrlq(
zpk=3$DgwH+M_c2BE3}U2Bth+{I|vOYk|tg(-49p&70GM>*M-sXxq+zhd(y25ePHcc
zA0yiM$BAkryqH`&8bov8tllWXgRfi{N6h6e7>O@h@_t0C}>iltZ3Neq$t?{_IemZsL>wiRX?x5T(qdLBYo$g=rIiD{6Mo;rW1tE
z0QMw1EqG6|V?xGFMrUwM;u(g&YH)N!F?QxMQ&l`T-zi+&@a
zH;Rj+HKz2LyXkS1%tle2BzDubgkK0}vkJ1Uv3<5fvk^gD
zcGtvSQMhLS=uzv*BF$ihy$F8?*-zoS3Gm<5%U*V7R-&Sjj$n~nA^4%C8+Jw(DPO24
zUf-Tk6pe0n$w!I5AU3aj)pFN)fCQgY*P?>DAJ@m*Rg0(p=IeWkyKdYAp
z{}^p^nURgqp)gqrwd^yYY1K?6EA)5m+0O8o5H8^?tatkHn
z&hgA|g|biL_NBx{?Cum;9%P*2Hm|FLSH2muiDnQlgP>6;PY#xv5NDWwAE?FS=Ca6+
zfUje4;Hsi4Iqpf)P&#=sKOt+c8xv_MrWs)7z5g^7^9hS;eR3fB?E;|)DApp#Y-ictIO?9pK@~HA8>{6e*|E&tYsau
zr^?g6+Y*{|Cg03u_p9ojG=aD+A4q4W$`4mKwU(ENO|iC>1sE$FXnOEmEh@($Xx*t<
zjcQK)S8AZPx#eNtLzFRb=y)j8fq3I?V`I3yd!qag0qXmhB*VHCDRE9`M(hhA
zK4w2&u;{-cv#cwymMwM{{{mr0?9K=(ZwBAH5Ml1ZY`uA_n*XGUh{t4=0bRBIa0m43
zY|}
zWmz3E&-3$bfN3VG!)ME;2_r?Qo;1RQ>Ll8+-mfWqV0Muq&;M)w0z9QB4f7Pd%bZtCOsGMp2%R`;3eYKT=#!|6V7Ofhait5l
zB)k!rHk5XKCgbku+_Cbrp}T5jhpb8gF2*U?k&{!m
z*Si$*^rRvUCf?`v~cvTUb8
zq&uRn{^hLm<>e$tSxLx3MQKiq#d;06O!s>Dst!UUWfnEi3ZAP6T|6PmHu+G+R0SI%
ziRjyDPmn$Lk*HGPv90&^-EuH5QG}M+H0<_BtUofAJ~QhZljqwE0m!%hPqL1N3fwpFZ!V9lhPFJ8VM
zCOG8vsnPb87uv{h3rjkNco`9-{I{DVZE$oXO&;YSeFhfFwmty#FDP}L+RewfP5oRQ
z#T2=qNT=5CS-J|slO%pj;cS+on?qST2oUZp-;|y{$Fr4BS^=F>oyBG4k{#LfSMFk6
z*8%Q~DKIJDpy$ER%)m=>4CZuY7}_cs5Fu^NAe^#48|7eL(@FXOw31ck<{IW@&Kwa%
zBRa8E0(47GQ8b)W5LhpctjnHmh(xZ_8mRQi8hZElgoxfzWIyYMe^k9;C1GYNH2*Xw
zT9bg|5Y4
zC#AcHeguRJ?-I}RP7<6Y?fv-)oU2F1e?#g8brOUb#BMDj=VN3_6ZV?9(
zl~J74FYHeijFoVwN?!FAH4(H<1H326KqBB?Eu8=qb`L*0loi{>KE1rn&G-ppPtRaZ
zeAYrqDmCjh4?hw_(IPMI5Je=svi2{q!B-IlahLXvw+@wZx)yHRfylxGRVe68F>Sac
z>r{v;;TYUk8f=UJ3O+!9b}`%CjllSxz<^-hOm5@Z4>W|)jN3V6K&XJ*LhvGN%uSw$
zr*w%6va;vi!tn7_PWt-RYQeLIh{(DrxqG1LOk2nBp=(_4?bRoGyz5b9m30A-&}!?W
zlT%h_a^wKRo#TZPoYKr(p1GqwzYn54cJT+(HZMq5_2nZRRzCdKA`Yki=6S2B!B=3T
zU9~IdQA(a>o^%sc!IgJwXyf`R!+inxhcSEK$JgqNm>=@9<}gGBAL#^9>?}g45467Rvxy&|quSD?hH$>tR|7!VP
zhF_UshtHg;>$9y${+Q*hMuiHk)v!TppB}erRc(j*6mwuLTo9y@ukc@yq$BAm#2)||
z%ZOQPetgQ(Hn)ZsoD!WgAOs;|`ESuk21>
zK>+AE(re^auPT94-0H!USm6rbD@CvY{8cFSr-(53YVEEfi~wfO9*lU!7~%~)DJ~C%
z!&N!9qEh&*ucVyVBM-ER*3@M9Kb?%#9z=D_9;*mQMz66A^Fzr=pDL^CE)9}O(|>y5
zvi!QBlwLgpz{LfGh1*b=@f00MsQ|sC)6*WQ_m!qJmBT;1Uk;W!w8FDyv+kzm!LU;a
zHO`E^yG{M`hsS~P(8D|?8K+Ur+>n(Vfhe?pAWKs~1md#1;#9J#mcXAm?>Gj&p{Tp%
zR@mT>-rZLbgI>L$+8$)lRDKh4=}%eZsJTS4VHp)U0S&BB=^{ov?fGL2`4imq$+gB82hpN^(S
zH#{G3x;>qKISpssczt)T@mojG>a&?B-dHmcT4aEA)?)aW5Y@dB1w32-4IMK5Ix3n2
zpvAK4faQH0%q5Ba@as*w<9523IB`C%b)!|+U&o_QF8x}$xI-D-EL~w$JMkOBIqQk=
z*ppjNxKvdQ7yBj44>V?qDYDh_EIw*ywG_G}9Ljkx_z6}EawZ6FjpfvlEU`0PJ2BVG
zYcui>#@a-uK#D4>X(0XGD+%=HU=isGZW?CY1Y~r{keQy|G+}5#LkhX>8X(b$w|{2*
zBu{5WE3ye_2GTHGUDhaLYN;`p8^LF9q9qN`Kkm|4D66tW&gA
zVZ5^IK*$+B)7MTGT2Kb_odJrj23Sy!QN9LmwynIp3&ig4*bhmA#%Xe9Mh+j-_J!Be
zB768pkLC7Z3Ju%bFejMMaP70SuC^n{B#i+t6|wGIQdl%yYegKWT3o*_uyOKwV8>t;
z!IEL|WV$0Yl`<6Xj3IcoRGqGscWD3_=a1eeqt!En51@lxHx@uQLl1LGBLSM?GM1Ro
zg*)I@?+Y$CjMBswzb0QCl6OUnMx*DEfp5Z`VZD-6~uS!Rs_Laj-X1lfsQ8S0FtLY21XBL3U2}
zQm1+F_M8g|)?~}~tiwV%DI85d_%Vu8UTzf#(`RjyrL=>QG-3l9KXZpS95BQikw;-^
zp>+71j4@RSYu2iRT`2IN*?3yA_IX-1>lDvP)Wu(VQa?BJ8i=qZ+Gkqsx50UIADjgZ
z5TO)TJ8Re|?1c8=-@+H|Q^u{ZhMD+dYcu9K89QG0cTSUsN=s*+cVuH=rGfA|+{1hb
z2sZ^_ZC@b0=%p~M;U>m;>Tjd;)n(nXcJnl&mwIUuz+nZPK>%I$#%c#x$9oejf}KFF
z82UJ+v9L5JiN)kChDj75LvqoyS!>erSXgUUlM`MECG_?A5_+|_{LmVHPgJM++q_~2
zY>7R|2`Ysio(KB$qulXF-R#-Anud^&`D?T1$4g&_wvs3A?{;zS9%emELL>`wmwV-Xa5rtvscC&X)?;^_>|5p$lsvFFrL_FV!xR9{-zC2Ud)n>rT^YvFGG#wdouQ3?y7fE^144U&*!_li
zS2(Pnn~d^#Y}M3&O4LN*>nf%flqG}GlI>t&Co8kGHL+plPF-3;PGD=f|4rt&gmFjb
z2khcwhbRGZ_!s6@$g*zXDv;-9Ew!f@DAbO=-q_Theq6aZ)X#t(^+gO3-%Y+OGkfY1ZA${Dj0
zhs}aq2!P%z1e)z|5E`?#banFs(ASxBI~{nFeJ?TyoA#qQ!xsb6gt#NQeGTQu0$yhH
zv1m5z+A`h?x89MsG*VPh3>p`_9#GbnpB6_P)YJ}cSLeiiKQVk5ma@|Y8O&*d1B~!>
z2av3TUBxuqe$Wc_Aw)2mSiibR)87gKD=pHfMC8+Dr_TTpc=^q&Y5+E#s@PiyZco3%
z7#j>lvSQ+Tgewz0&=?btI)9D&WUpf9V05~4b~LqT3j)I>zp$+YDycwrS3JzH^kWq1
zkE2`PiVax(8h$r#kJC_x7yE>=Yrf0|v*a+*gJWbCwBBc?tL96H$#C{T;3srNr5RE0
zAglZrEe0+67hm11PW-{^=G<&q7!nRpZoUBdrBDaQy?Go=3usOWU<0ySt3w@=H@CY8
zXG+2VgcW9fFwmun28+SH6s7&}LK{TKcU!ZNe1ZDMGKMve5=BfCR$!2%XQ0$V{ar4N
z&0mJm@`vykmg2nJfoh;AmqT0FHdjPs~<-XV!uu$Sv<2MZ5t<`7M
zc~1z29CtS?G>n#_OkUnr^ty1w9p1pfB8iSB{QA+8|2X^kdqrSIXUBYtK&#BU8(YfMNs!r#I
z4^>-wx~9^{^(B9Lr!29qFg3JF@>}&Cv2DP2tWpyIVFr+nGjzTwvdEyMfdI&EM0dW_
zt&js$$N$(11~$yg9ms|glCA?)bh3L0H)WTC;QDtiTtB<@0dNi>ClLNHCU*hQ4OHsx
zxzfh!R&5Z>4ubYA!ETc)`jjRX$J+V>O*_!-R5Ryb_pgnAygr@pOqr}cAC)vwZ!t*P
z_M;B<>*U>2me9iWklYtFA`xn)w;wzQXEk%w(JQ|NrmuE=@Y%!7|LA`m(6a7{IAQK~
zq&#imLLvg+3W6VS?fvU2BPB0-oyJ+OztV-Xgb?Fn(1KXc-E<=ESoA(8mO08JIS$el
ziR+k0lX+p6a4c^{gkTHO6M{D6#c6~~Jz(TuS
zvnmjL^TiEDW1BCO9U4rFYz>#!h4OrxfnfhN;V^bJ$JR_FwPZG@5e>1p1@~URW=ML^
zAdU+{{SOBXm8EiJE@4T*iEvEr+XQIDx<3F?NX=@*@ShLU7Qev9y-je0ng|!#qzfk+
zt9@$Ev?%g{CUm(YfrBl;gtg}1!*6`wLu~5vsrEFt@;r^koTK{*)^;S((dxOqjXiwm
z+BVxms2lHP7Egn`UT#jPIUh{ZPFhh{g?Ao$XT!Hpzg|}Hyp&6E-@`sGcG#aR2sdK9
z*sHcN92Spsa`DsFens-}l`U@5a)OF^8G+Jqc>^24^K%NQ3dW!HrTBFM`yFz)W
znaH6Th;?X~0+L}H)ro;Ic&|D`19RrUG!27DFwB1$ZQl#a@?zbJo+`YiayD|W4i4|8-{BJL%&*ZUbcX7$E?=kjZ&XB!jr7EHJdP|
zje{CBD0px?y~Cai5`5VTao1mN7>Vef1kAVRD8s_B9_eX8zLx)J!cv$~kpK-N1JDkO
zc6q)4e$qWav6=D_=FhNd#OxZbLZM$sqP5PuBRME8kuW7qGXiC;)RxCI?FbnyldB9=@9^cP7KY#jJ
zH@GTfF?)<;-9MK0{*P!H3J$2UwMV13TJf{P#~e6?#0Gh_Rq@5zXV;y+azG9gnHP8o
zo~(7{3N+A86I4QkgMDpW1L5Jb8E0|2k!9TsruG0RPEC9aL-uGp7}Wt&;YA@xu`q+2aIf8vh1^55?QNJi2LJ%dA2
zFY*@K?l&l(F$AUH_Hyuje}q0(*59aH*$l=OW+ViMg1inX56LgEY3vi_hKOLnyrSey
zksU70j=jwXVjIRGdoEXUGf}13Q^U}bZ?0_|jZ>=G@r5u-(N$+e0=
zKM=6RyHz0p{D?C%5*9KQm7X#;JIYJvg(dQt5S)TY;vI_)_SzjoxSY0^+ntGtAuo_>
z0*to#{PX){pSaPMcX?r>N@r5m-X#7m&L0D}b`9VUM<7wS8I?v6cMN~$g(BC14{c5I2uZ9(TCRs;2AX?unz<~6hvD-h(F9sXsb=slWv8UI
z#$|5^Ltj%~-Zmrv4{@jXy>9UvT@%lO#=?`3INAMU97sxEbzw7nD75!T(=Y%5?tTRn
zXBn8*ZkCYi^Nan2X<4ihS6MD{_9lj$$?@F>&9aVq<>p!x$t|At0LTm*V#Dj*>G5w~
z9RN=9_5Em}8HwG&W5C-9*LX+CahGSZ6hnj2YsF02kMv@qtN_d-+;*?e^m0pyXmkqz
zYLxhkNvdrz9)!MQ(e<2Hovb{c5SU)rG4U)E>j*mrYq($SisUqN(JFKa`r
zghBu)+Pt_&Y1_K|M*Qu3I3VABl|4NtOULl6nQQ$ECmQy_no;@S8sNN~)1i}^-s{gY
zWt;ZL#Nw8uI}hjYr6mg!f+;tlh-Usho2GQ=97_s$QHlGP)PW$aUcKcC($T^0g_vU~
zeswi-CZohZESTfRN#}rv=JMx;=7#PzR#nGGbNrTw-p%s9Q6i9E<}7Y|U>hI@Jw2IJ
zP8&AvVqTL4S*Ad6-3Oez-`qdXEZ?JCN>W9w{4(V7i3`7H<^tgpW8VIQm9!Cm1^@|}>_(ZzrDb>`UhjjOcR&|a8HR-!YZ2GqlF3*muX1ExD`)C+rP
zlpj1vzyY!wZh2t^$#E0K#gu%SF7GrCpLO1G{x=1{_PhMOpbtA~E0&M=7GG&w(E=w1
zE^isb656hnDP|M(t<;4{a$aKyGC9pQU-jBu@EfT07E}-^?IHTo3Raf_&pB=X<6M^T
zlh`Ta{7S0v{BdVpv}{yj7l4*uhU@-mei&Z^4drmU
z6c^KUQ)}94Iv5M6+xi-SvUH3fpr!uRQVAeK{@G*2p2Fpb(Wik#QUoh(;bVX=g#rhZ
zQXtiDCIQU6e&njI0^YPChrd~O-%T$D!S4&XHISHfCRYV*d^@Yg_JHhXE7Vln>flW`QFGi}x
zzMancOXP47o2Z&BQ3M)lw~Zn+Zywe1w)t0Ox`})N``{CSBaD0PCulEKwELjenLlcp
zbsmsuAR~U6aUq548(_4VuK2Jw++i!A=-=^G@JXrnm;a=JY~sDJ?oF)`K1cw-IOdcl
zpCz1zm*y~fX!3!;0QTU3hE`I#e2*zRVeY)8u?iJk?^HhQfOs_=YT*nT|76M*pu^_k#&)YhY+u`CmFe0Jl#oBkh~
z-ZZSKbNwDZtybD2LR*dk%3zNb+M@*|A_OwjV+*z-skMqA1nZC>vqZ=YRjL$4sB&b?
zP>Y%(lNgaHg9w611~EWnN`yc{5+GzI2?_7EzxV%%54pIq^X$FvXWeV9dp%HtPR%-!
z;mZQ0P(Vd|YHh||Iuhux-~U>sN`JrqM9k^lYKY#D+`6zM00mR+EQAdY0NuRe1|cp&
zK0*js0Uu4^B_x{uR?E`wwpFwaZ&T0x^+~^U7iNPU7}TWgz}KFL*2JN$*Xl(l+g!r}
zv&b~y#YzO$scze{5**{Q7k#A(Q3$E
z40$l{9euS|IMP)+E<3Tb`oKLZDRrr+8UmJEt9)3Ep$}Uxu?lBzEP?QnirJ#N%{xLz
zORWzkbgH>w($yY4D|=aGjO%)*v48pLp!`(M?+~)fV5KBmw>{+e4zWe|)NP0P16u3w
z$7sML5ZQcg_toZhGSlz4a2?H~BhXlzaD&k9fhXX1;q?1v?)sfE#Pa!$sI9z
z=ORz^Ve;ud{JuS`Kvi}_O(|;UK3Pu-cMtT2@gxDPOpVS9
zpy)*Ab^!PM1aHpzD^6VBdNryZhWD(G5KkN^m3U+>kZgYs-q&u(2L|sy_;v5IM|Vy<
zkDdATWJrn@|8;iyRWb9$pyw&ptV&6R0D@OaqF3n%L1iws+nnjtowh&cc0RdRhxt#a
z%_{;PkM_fEthZyF7`?_-Msmz_!h|{A{v|q1(9?Da1Ixdy-q&u%%_#)q9|8(Q-GE1)
zL@|t;BMCnfhL11Y-V>5;{pHfBqXVaB2!+Qp6RG4+o1F%$R}FEYf{v`k^NDOo)*03w
zNC-~Wn_9f@tB|5?Xm%gN@ZVa%E>qtoNIR|eEGQZj#X`f%!^V3Xl;YDvXAhI-cKX}I
zC#Lo!*}P?9YpZpAtL$u>XoX4i#1VC8gN|2Bq?!&w+_n!2|5K|lDk
zwHFxq6GynZH201Sdf@v6FJ5=L=X5Dp^k0Lzu%1GD{m`mE9^xr)taFQP2t*>G4EtA@QVX)pa0;Y
zW^Sx34+pLS_jjL9E7vp2!$`K5+TEim2>o!~CuL_`(Ju!(TlD;q`~FYd_sFA-qsHvx
zI$e2ti;qhS3Zaib$^hI)2zJf|96sa19@U#x0x=;x{}2KQQTPEUHO@=+8ZXVado-3$
zVxyZ;^2KwBRFHb?Q{M~E4TfW79%0~S%6m;y)=l@X?VM(!n7y;|ARMTvy>qM>ki0^g
z&_5;#kL3uOS;LG-NDC!Bk1p
zpw}<32&dJAAYKCf&6n2J@3_Vd8vytVsF*YZ&?eCjM&i^sfS&Bw(;M@$~7q|8s6fja=B$$XH03hDX#W{
z$m2|74)U+($p2DAtH=7)|8Q$Y4^n)XG}A#&Lh2572%Es(O1vqK&n~V9HqH$NHJm=C
z1<((VW=c4rZ#U>*(aw|A=F$!btF<=;GIO?>u=b<=SgPDK3@WQGZ-2v^0KLnC*gGiy
zZt_~apKW+68S)`ay(4i{@6159TVIBnopF0eGhj24F4Yf-Ejf}e5E-Vw$PLFhcqGFE
zNtJ+JRHT-~GTQDRrze~~O!XlR%PNtHgwuzimgKydxL7F%xK+QKe`4oPU%q!PPX#T9
z7&n9ZZ7(}|-_|ulQnTx65b$XC{Ow%a)8cFUh8RJz2I7ep1JdI}pW#zxAU>rVN}7A%
zi6`EL;RQD<6m1*mVM5A<(Z$5pxBY@lDDh+BKCOxgQ(x+f*FhN`UP!s}d3Q=6UhtXu
zgZq)YiRaj=#=21H>%skJiiIHb?kFDVK0`9P?ZqZsbC#<%Slq+6rQSVUe4`gzl6LV!=Sn?GXG`eFU#
z!kw5B{lGM!N>^_U8z$cqY)#Yk6$M%-Qr&Ce4YKkkV%ejY(jKurBB#
z39TR``~G;Fs!>+Q=iw_p%Ju{{1bBbKW(F!`BrxtwN?%I7
z5Ip*1ub}Lt9)KK|3tR5=7_x%>;HaEG2p7;p{T`X#6x^@(uAX3)T3!%KW>INVm=pEr
zPtaHQAiZ%TzfDg+*wLR-f*d@t@M$KUa=QgO4Y+%@#2(0?0PQje3Va>DPFMx#YliG)
z6AyqK{%r#POf^7+;*xGGU%N@nEJ=}wvKMY3oEs;L+4sr5l!x#>hJjW>DTu?n&lpou4<9yt4nv&`M-Qz-%1y^gD{7n3pSMLd
zj`hcx`s?eo<$lJK+T*2^ljsS3r6gREMp}2no9Tc8p9)W5aTv*m#8Q;!&
z%9MY!a2wKkTjsS~yo)Or96a2&-0GQOuWTluYncERN|RnYXWu^$jj~C8*|zLsaI6b`
za^JlW7=u#mM7gHwb}@8w)1q5Ww2lk3!(Rd8<7uuz#uPx0{#d->)AadM_+d9tQ^5jr
zZsge!dSwf`j{R5Wg+~FUKFoF#yc|u(2sLBN$x-4j`axpPIQX|3;~%2p#Z9!99ER0OCnMESxz?4ABgYJvAUZEE$i0(4wzCQ7B$}&|4rOIX$fmBY<7d&@-qr
z0FSi;MZb2^y{&?@I{n^(TkmIoFjMqNYyn`drV#ed9D@%YO=_J59Nu@zbC!qwlV~~6
ztvJAsX0IFp4=^fn*g1;d%C0NtX68N_d>%^)FK_Q4k6f39fa~1reKtV=tIvQ4)#^zb
z2Rvow)OGkZPq7WI!GwV%3&mruf-ebRChaX?tPaUR%CktvAjGFFO>J=2^cvg)h+jd)
zQ25OAy5X4?0Od@8`ZR(EY=9G?o@?v9Va)ms|8p%Zb^8AO01Ggg*VJa--4<$`^~(U}
zec5*HsY?6oeBHozK6{R*s(O{F&iQ+tyvphkX*(xbapIHpmObpwukurbjXsG)d&ViX
zA}Li)XsY(mgHCZSuYaE_vl4+}5O9CK|#mUJM!N|DT_=5{braFEW5BQ@rYwrR!v8=mAj
zMp>T%ld~{Q{@<$E(V93(&p_35)^Pgq^QVG$K
zF8p9o-Wb~158FZCsxF%Qv6mTI*^$$-;3Pi;%L(Zd94aBdW&~&(ad+Rt+#mOJP2f;?
zyUOiBXG#4(sr7UN!P7
zpi1JAVCCFz1ANEn+ch06lZT9^^J~`0r!91@`3kK0(`b7(sQF%R!#!VR_kwHe;E4tT
zv7QkSxx2|p^ptWlXAeL)p-QU@1}h5QF?c_JH-1gMo%qw_^o;S}fUE-GY}5tQ6&d7o
zDlk{#REFJse`(Bcs=AUhBR}cWSg!bVFxGh6&+aq8{5D_{!es{^mrXW!U$09A
za7`!rQfdP{mQJ!wxVs)F)&m#!=4-oUgi`;P2Usr5-zr_6jit5QwWqT{P4U@4#>oU%
z!Tt}el3YqnLN0#xE_MdPVNLtqq`tm5TzvnXJ#m}AOWRC}HV)Whqa?#6$zZtfHWP9{
zKzS~B*c?wXeG^z7c421r&4=|k+WE~>tUHH+x$b5-N?4Yaklo^}TCIjTmg>w60L
z(T<&j5W&lYg*U5X9b5Br_B|B_H39>p9nS{nZF^wg{+Zc{9!v6wKO&mu6VvMHjue0d
z;H)3>cRz6o-)$kznj%&oKk$W}DhavwbGmbRxZ34$WK3FO0<Pfmzuec|R36!q+h@d0LCLgwexW++in%d&U7X+ruc2>!XHXLE6QMQ3e#kS~hd1GGP?d2F*K5I$QwJdp
zmwSt~{k;9Ul%@Cn&d?El6PV-KGxCUYCGHTNTwLF5uhV}D@b8BMn+2O=5#)`71XHJ<
zyg0t^RERmP2nhMzx9v!MLW?2!R#b*`YguZ_i>MY*Lm3*NH2pU2`~KgX
zc*avFIPyONU;eg(|n^Ltwo;@kzn}%6BsA6{}u~?
zGWxUc@@|X}?W4~JQu*q;eu$C|pAx^^Mp~ZXB@A3p&FmdHE72Oa{Y4Z&&iLP0a>F|y
z{Gp#X6-Ib-XeHU&SGQA|kOECN@y&U#gM*GHk^U|R
zJ3f(vSAqEAE@;;Y)Fv=oRhbui?3s+bp4GjwTrneX9eWZ|F`nRl
zPkqkvTEBioB#bItd8?Y#ABF-$5oHJH=5Dhfi%R$D?7&2+F?1;Ezsz~*KNVBC#9VWG
zMMZ&}fiQjHd)NhbYwfsDUIFRXU!_I#nl&%<*CJi5-U#R_4=c?Pf|4Xu0>@hW#`egc
z0nU-`p^fRk9sEwCud>xdn2jzukdmoxd1n5p>a$Powl>9H-%Z*=%+LtE%s-eHaJB{(
z%Bd?R1NJ*Dr+MElPLpOzN-aAwaRn3jrZfDFYEpqdb$SN
zGGqO_Y{-F1`%RXOiX*>In;X)ffT9!DXwT-(+^-Ie=!_B8gh%yF_Kl8oQ)o3j3NeSg
zfEF%=iwKCvq^uN={1kLQ9FyNgkT)n|2tRP3?elH$pwFsKZBy>g*%00ATbR~B9W|3v6d|D<3Qu=g_XVzg#^l*v3=1A
z+RLy>Zbx)sS&vVl2`)alC7KT-DyDR96BXl7Z5S(#Z8JIDF9dzQeUdW%r-4-dG&$gw
z_2!O^i{F*j09{Jm!~|(C!vaPKBZ#a2WMEsP0+8WpjmBlnzRVyz;RmSV!6K`r706y83ZzA}nL*NEnVRJ>SacFg;Mpuew&yw)}+f<>D`X;cn-zC7!)p
zoTc;pc+=}m<+U=IO_A?V1WL(fxn{g3E*Ldl24pKB9mL|mK
z;!Nz|t}WciT%v9O
zE!Wcamg_gGCIl9M9c&Y~_4=|^7MG7kr;pCQ``k1I#Z3*8&-qKG1=#01*Opw1zwY%}
z__R^~_75-U{9_bqZwN$ZrkU!MsD+2V-$OuaaZ}OrT{Sgpr|Vth1&20N5RKT^*nJLx
zHDHEJSVrDspoV=KpYeZ_JD0Je7*K{AW-4RmpQjA!0q=i+^CK*A(%XAN$#
z5^wjs99~-b^HxcY1LtT?va1Gt9YFHIJX*I)bFFJr{+IEZYIL@>Nb7q6gCy2k$Osmr
zYFC>&7K1z4!^f}OZfngqId%ZlP~%v{NQ3re5QRlv-RZ3IpyOKiSm4=YF-e4$Xu|=
zE?A2&v4+i|80&59b1fnPADf_v&y--(?L&$R9>^lO8S%pDJijAKO~xXbE0f>ReC|%8
zd?n{Mna}(|JRq&d$|jFUed62aOKF0E2Hmu^M7uAl$4RlU6dQ4CAkJ~A<9ji^en0=7
z=_V!))_MJI?BIHTvBku%7CPHRq6Oy%3>qwo!(4g$A1Ogasp3BBhhv4?zpU<<{?WGF
z4)@OGq!NOnBtAf1#r#czzFcdaOu7?k5Bhr7$cpkcXDoP3Dh)~s8+
zL(FZwSK>nn$%jXAwoj4pkW4FX;f@m~JpWu1d@&iJhDT0G2kbWDP|YA4rHSao7@~v$
zsT-hV=^j1)N6~RoJ3c(3boqtQMtw)N!KYciuW$I$4ME@QoO)6IN2KlJ1VI&uS}^eXXl
z-+X~E1o+x~>y(+BCu)Y5#m#|v-*F$z)tdA2s!T(d!HY%0ZiZCL5{Xt_6BRTLF<-dM
z>6wkisx6A^KKvh=y_}bY1o4)rCExCZ2kHbp_W`rwvw)EFO(g7lWxs^nNvG
zOaao4VO=hdRkhzS3?_6vBM+_)J}hSOoX0D|qt*^A3MajilfrVAli`Vem2N)ObXY6z
zK?XwQW%+{#l{f}}5&O#biZOm`T?;nH(xR;^RzDrygZWhl88ADOHHW=@fMJt3AB;%x
zHDppd#E&N1)`>1Poe2+LJUrE7yM8t@RVk||T=_%P(Nr2d@B}+j2-;DJ2ySnR#d~6A
z|FCBX-j=z__vW87!6zniK4rJrufrV2lOB;PmiblbV#UAyu8g&|poiYV%MHZ>K{&^R>R$lv-6Yzo-9^FRGV)Ia7uPw-*5`iV
z#;q1FfOkPQ`H6DSC~vwbq{%*wl6vMqQZTOzljhD-yZKb;nI&bkP(@Abn)oD!>tpiC
z+1ols0DI6jU@gnp(9n*m?&ncuq3eXH`N8dIJ<4}3Dd2xCZA9&}+#HMT#n0SU{po*aoV>9%Gd;xj!(cch%DQ4afCLEtO>0F
z#&4H0a}|8rWJ*5Kw~?=$s^99w*O2x~yDaiqrTo_lSO0>VF#W(X#UfKEEbFO|2%&4_
zA@;L(Wl3|XnaxBRr{&7Hqc*UiUZIfCEg6o(XUi3m9L?PGkX*l<7-?#364gehGPzR#
z_((r{;=)iaE8(HU9M2cGdeq&pNzJy(RRb5yJ3T3+nwCk!4)Q}Y;`hZ7<
zrLOyk**#d5*;*y;5y(iwWWKUzIu_5N_4wP)%qAfhu;$f0=6r(5DI8^wC*lkd6c}b%d0{_E&bGh@
z5FZ~5^uVZx6(bQ8U7Y8Now2Lmznp|ejinuz7;AHL859f
zs&_E69N%4M+?}J~t$o-j3YZ{>m)=mS%d6U(rl8|7{RkdKzz`~_iAf`E=9Mq!$lS@J
zQ|A7|iQLz<;E1V`(Q`2g@Jms&V-Q+87u_Bm)2R3;6ZRG5z@b35CQH*C?K$ru*Zh`{
zubRle+>*R?)4%rqFCVM)hAV1Bn6g&)Cekzkfiif76m!*vE)iy;43a)d8q(kC0amv1
zN(~YdAM2!1YI)RYN{8=S+$5hW71B6o9_fj#!Ue%as2+n>bUl%Mv8D^6TkU8$+T0~h
z*^+LwpTDsX`S}l%c_N2(@bAr?>l3wj%|abnvwXLvVtY}O
za+3{o3*#N9|C3}xqf#D~o-$T+-hmEXJqZytP8*#hft-vi6`llyg!}qV(FdO+{0yEK!Y=M
z;8WdsWY(N3uwygq7}rMpWJM|`lbYV#CYH-xDcn1I_?-i*z4KOf-xUyjJ&CG!Dg_=}8lkkxTzT5P1R?upcsRl^H
z`O#cbN41yg*UL3uYp{7lEHXcd-zHAKVEw~6fHu%tP6#Pv4DF^+Ec*-F_QVtCdbk!u
z&}Z?{FZ!S2vI)xDc)%&Y;=7+{MRp}X$OvpHuyHTOE#B!dk?$h;83LYMZjZ&D4;Ukb
zM}@|^E^c~K=wdMhvEn)4>eYYxY7Gk`#l*=#XuifmvG&t{F^eP0eVoo?HbO}d%iGH;
z0e}u2AhM=yoyk#KB?3BW(SKbR??G3#*eYo&5%NnX!97rkHxxR#;Ln9SfRO
zf}|u?eVO;-p&MNvUiXEj&Lv*BzQ;WU_|vsIKu4T{0fTXpp~#SYf+jx2cQVC=UpyxB
z{no;%VZUO_dCOFdr}p)aT-!QOVerY6U+(OpGFr2!M+)KLs9xsFZ_Lw0uKvDh95ukO
zV`fM8+ZdtaLq%)zk7?dZ<-B1(_bLB)MGYc-sexad(Z_okow+igJh>5_C;X@8l@TOe
zHAL1-25@yv?X{#;1(^Pee~?sZusdF9CC8wdD||HJdYCKr%xUgM&rg#DUz3lKxdP?v&iGp
z)dw_vxEeVSB4tCMe=V)@dUtf`cQV6QL7B~CkAQ!Fyky~gD_JdKmu?AQm_;!V`cu;T
z_#{@X#9tG`N`c{54Y;*x#1zRoH4TFQcJkbx+PkCu+a#0$4JriavZAloebvjzl<2Zl
zrxXck*}>TW3eG<#bzF39@FpZPsz_y}bpL~{a8Uax*1ON>EK$hPhm0iG#qXO15W>R{
z<80YY*GTMf&raTdgdn~4^({JRL18(_!B#S7fa%>f_y
z2L=KupGzZhLjd+sSzk?63X*shcrZLAMZh-wetPB4(BjyDO2pp3_JP<7!#rhGcIj#1
z!M>*9rT=x7M*r?4h`1k$Ns*t;6)Vr7rZ`QqlT_LPO@er6!ne^@RVp|Wv#J6I+IbgY
zV;#+4CO>p=(sXt3e8z2VCkM8Mn@#4Ad8Z$1i*@wsKjQhn()<}tYtrX6N*E(VG>n@!
z6L6hwG4P-F*O!#2!xPX`S7LqBmP}6an-8}y6o<#B&~^_O_UJo4M%d1GdyN5`-Wawh
z)g=FwvEMv%6QOY{X-=);{dj*nKKsy~F3R!!ObA-{K&V1A$x%b3K+#-p%;wsLuQdV$A_vvHm
z=oCp)k5a)}w#!C-z7tTbrcW^rd6r*Lm^&?y+i;ibx`@M`#BI37aT92hWLCG*}%mQh3S76?i
zX&O}HczRaJ?vXtsya7t7Z3bdB4P}{4%R9xbU^n~{pQ^uwkb1+w
zC~f4RlB2HgTpP0~ysGg_B1p_W3F%pzd;_YR76N^|oXDs^*sCymD^Rh7R%%(Q9SM^N
z80G;|b(NKN{d&?q4^AtsP;tFnf6$?VcQ*9@RWcNJVHf{TQ++9_-;F$1gxbJcN?b$&4?EuE
z7_dSJYaIt*=0x(^^3sPjhwN1%kYXyhEeDX6Yz~m9vs3ZwU=-390WWRR%qclbx6*lWuKelx
z&KS7U)xj|>#$jkQNXA;B{2X$}ivl<*Lo!&olFXDB(OlVRtT#8Vu6AI4Ti3pRTC!AU
zU=y0y)44g1qVVIYE>siCA~HwABvrx^inr8;c2vJxmA8v-%T1@*wN`He7tq@`$&}&t
zNjGSM@cFr2}M`V!NRK)OV<5wD8sFt%YC^yrnBV@yKKfQwTM}Or@i=Q6?Q>j}N)-9|+3)t$DxmIAJEh_*
z<@xb2_sgwt<&A@*8(fEy;8LC?vtPd7uMcpIPN$hm3pK`%;}&o{;KLas+Hl`Fvpg$ga%Qi(@O{Q5E8zSudL5;tP(yLnA1(5+;b8zfwEM>x9Z7*PtMb*XnF%X((s2I}LT*T&89Zk%GI}
zxmTH3g|aFo8AZS(yG=y2qOC$f++6G=2pi5;xV^F4v>A;-l!P_gM^axJwZz0#S+t&QcFqh6Rb(6c1uOa!E#O8oko#W8g6Rk7zR2h7Hgl3xR;zGN3
zXjD!70jI@Mf!jjFj7)f^E^v0Rw5kX3zqXnHI&A|`Le*ikA~VaZgK9i86#^^iefTi2
z3a`6di0F1xWNOK1<@ogNjZY-4ylc!YszS&Kx;@MydkM5v)V8R^{OJ`8HWyC%!INc-fo-g$(hpgewPt{ZHtgpl}5I~
zVT#{s#uxZONkS)Ww=z9_w0_m#Wu)_c`LI@LDFAV98o+o2y$&7u#3Jv^K&1H79Ohu#
ziXVE3ZPSm95T8vsqRu*hbn%P#?kuZTMsRUZs7FSQAKWIW+$Kotgwd3>joH&H=L#07
zW(}TI@l;*9*}cv}+rt#~Z$naf4@!U*tA9{edw`=C5BW(CSszWK`xXRyu|J`YyHL!x?&(d`;h`UE?%c2WWVU;(KwL9se?Y?=
zr)6ndV{f#<+3^D2=x{eh@K?bQK3vqwN-#%RR(LVFw@dq{4@+~bRsA1O1sA>9SUn;G
zwF1Deui@`$P6ug<&35;WgW#iv+@
z&z@9t=fE5zX_8Z7?UN)Q_gQSksTlp=U?>p^%u7|A&y$Pj3ex+)T2Zx<^?Di~%aTIz
zRfa?c-7(fLyZA&sPd(}+lO2=I#cLLJ5M_A1Q{;zRGamX}WptlCs$Xxc^UriI_0cgj
z)h>!W((n89(~EP{icPw^G!_(64=HVM_y9zcAOekiEbmdyJ)8TL(VYk*DFD$Xi2+-)
zRfI};yq-E^@QUCfU&vTXhG7I4*d@z)od9fiToIYO3N^e2AlAR%X|XZ~{iC{I;Kc{j
zCjQ3Ua(98VW7*ZYteepDtSkA9SgV=~j`HSDk2qPXPmVyNpce$!Xs(jH$!|EESV##;
zy{lxccHW0gJSO{t!k*S&h_cS+T6oik(_J$Dv}nU2N;C(Y6V%^;)@Lt|t>)M)deZwE
z04(RTPj-80yn3T1Mutja6bq%&lFefMEjkk9|5B?iVDaze0r&yEu)XwKLc8wj^`(t^
z0f*TYpUcqTz;Dd1g&Gp3PC-UkuQ8lU2W(cai~*hM%0v#|Sl{Z*2Zob`}h
zM~oqc!!;u?Jf}=dJ{IV`7ZqSF>3sk;!0-$|x`bF>EhKJPs@g%17E(du?qAto
z`bzqX@oh_r1W$nCH9PhFQTy43-X7n8R@y$Boap46)|g71oc5`1d)aZ_Q>zo9q$KHe
zSKYaNzMEn=nuBVR3buG27Q%1JN^JAbiBW^-9OLk=lEQs9+Ta;1Oa5d_qO0Z4xfe5*
zCY90uMyQW}f{QRfm_PG3%ww>kB#lcW*$_Y>rGs%~U0sht#NvR$hzu#~4=;@iF%qJ2
z2)j>&-{`u;KJisOVqbzevF6703TXo_9&uPbzWWOietZ^33~08^s*~!v2&5&0x#K=zRShV$|gq4OTLLn@@Gi&OfcM-fe3EwZ__n}*%n^+cq8ajJTis`CB5KT6vfLDj^HCslBzLfVt+(U4
z57K*~BY1y~npw_u##@FwCwY6DC3Eu+$;`aj08m+nKCU4*1igWRH~%rXp=bJMMUVF!
zaWsyOcFP_XXqtf7@k1t_t{N<37b{{_~zF0I@8U`8X+=
zu5d84m|-4lPgV1GW^RD7x6Zt-`Ks$RZan`Zj^p>an(?{f1Kw2
zAXzv2i#fx)0t4nPgWaZI2hVG6gZ~eZv*1U%mN=Fsd{#G$XxH?2eTcvHyvmK&T|+!4
zm1gQ9xPUEX;l&UmPw#XU9EtM4l=$q!?n%ot{5U4>eKu5}x{X~bi9)(m!)@S#%+s3C
zTChVtliFMz`X=F#$
z;!?U#SKb&I#NUX
zGaTD9IolH#59wb;U_F0;Cx1KjRcw`fa)+118w7a=bszxLxdYCAs9!u1Dj*1Ggj^nT
z=04iwJ76dV@34Hfb`;gzaJO0{slqfxgD%2nz3vz^-7>tWgbuIkA
z*x#a>_Ox~xkRZTKF#h?!1X0^x)ZdS5fIl;#kiNE_!+i3rvb#z)R}~>A0l_;5p$fCt
z_^g2(^-dUsKGVLcskP)mP|L5ipwJx7DHa&I4g1N`Dz1-+9**cho9*McS@3H@AMo7%
zLI0W?x-w!@NRu8KXBnde;p0@nZ-wQA+jKyAq;>_1S1C6oiRatFioX?k+2svePh}Ca
z0>oQ0u8@X;dmM(x+mTSCAqE0?V)LkqOz%+rN)agv6b~e#`ua#g(9DnFsW53Xd9No_
zL-BL}EA_WVM}
z3g8Vmw-wE4jZz8azGD{%dHJ-jxq)>?$;9?1ZU{79JXM%^coPw+8lfqbFo)n`rc-pr
zG5-P$Y4x45aqV}>osZBS(AH@!R=BPfOLa(!xS*8PNh*GN-;mr2ue5eG`!Fa*gl07f9FBDQxBAcS|rmI~C-VnY!~Y6S=Yb%W6V
zcc5XZF~c=g*snZ%7|3(bA;E*%x}P=W(Eoyc%v3UowI7Qd8JOW;0q`(%ul$S&?w(R6KnNa9*!v|{)t&k}%#7^H${)~&9VULbU1jjHrUW+HwaTAKy8S*0
zBo!{g|B!30x5f}!K|lqA`n~WTjj0>~kAQ;R5;`lGc+B5u>yjlv0aatal8g!S;mQe-
z@jt#m!U7jdK%o_hGlL8$6>tnUDcjb%UJy=*_ox*A*w~|g>?`KvTN(MC3*{YqxwXFa
zwrSYKd#jpbFQg~eh+Bq})_UINrfC+#FO6+`z51Z9yUMoIrO62V0V2&`v%6EI2pJCm
z{(2V4QX$sq?17Vq>^ijiCEGfKrDH8tr`#HF`!QHTNwj!Z$x>Hm|Bx9WZ+57fIjds8
zC@}|j$l$M+O3kMA)2wV2*p{2utj)j)DK*jriLKOO0}fTr
zdj9{i0JdP`_?4P9>6%^2wIurYxbd_u>$|vnjRl#6*=JIRTk-T~BW@8d++8KlHoL=<
z#JRuP7WV9VW6a1Pc1kQ7o#XfQU7T&JR^FK$_m(kY2~J3buU!e=>izO?k`?#oVD(s-
zo_dH152#>Elh*!9Kyk9&?ZzvMjbT`FHe1Fk*ZG6Ctq+-EzFOS3C|2x(rNZ7zy4GOh4aqRvc
zcf3vi?#UvIErX{=tg9c)Fb>d7E<0fTX&DTa;>S*{j6OQ*YMJyWyU9$t
zHfTM;+8HYxt8&}aybsPsw6A18n|qO1E%t@*`PQZU%gWCHp_F+F`z39@j?rvXUeF4r
zkAIPgf~3SNlBebDti|u3WW#dq^4UmrJqbbw%h6Zu{G4e?^cj`$1o_M!E?9kh#mTJ0@
z6sRT&2Zm=wza>@?_1zlN8)e!
zv*!mMV=L$+v&8;(7BoQ{wIq`ZqtsQ2j^=K|pTnTxL0oJ?s{PxUkO~I&Ess(ihhwfN
zNWhUKn2NMBDG^5%Z@xqn#)^$-jV6J3RNsiI4%JUzfbbh1D{E*5y&>`BN&JPNJbc2(
zVtuu25u)J@cCT=9BufB+mStGa!Y;qq#_yVhdEHfRtDR$G|Ky9-0{-NaY_XQn2zV-V
zZ4uu6`1ir~pnt7=VYq9NZp#6=_d6^leG2dU-J`?x*zwiTXF2rM9sRp2qlNK&7GM>7;SAco`k&
z?9wWV=d<>qDL`MwY(oQF-QM&6aM@apoN|x9U^eiA;S$~pC-HB9n2_B*3|2;L3#g(f
z*}wa)4iSU@9WnV8JK~j}Kb%~K$OQB+gWZ7oZzqXFo(}{6<{G0Z*~ooam_G}-l`dq7
zZvrPeltLPz*-{Y(C>c+?*43D4uP?W+yl#u^*Q@Y7irT`eFU#JUC+9?1Y8>Ddct;(c
zNy9`BJp;3pmhs$CS)KRyZ;QHt%-B$651Mq!(pPHLGYtR*IODZ2cn~-^${U
zsr0Iqvlc>R`^e2ZIcqmba$chR%>`GqgT^)1rlod8v@#SlK$-yHt>iP!iI3Z=Ke^%G
zN)uDOeUpeYC#l|232udVvCWj@4M!+sfKvG#b6c2G??lD#8|fh1E}IFh__Cg|Q6x`X
zuDav$@(SHEAqd%F05iFdGV@XL9cZheo3x+`$5@6%p?a-$y^`8LbZ!=_nVtWS64LDeKa1W(a!Zk|(
zm85dxHV8L4kfD9%44g{Ts50exHwRXS$D60K&t8VS@@^KWA)x!H7~%gWenubn=}Kn0
zNDuZYohFpZv#c)xG=ang
zEL1tdrO&ROR8>n8w!$h8&~vOE@C16|7Py|g#w#j~g#uBhLBD#81e8gB@d2zuWy)$e
zNvy;I)(*#5D57BKNB!9nm={gxLoGif&nj3Ay91;82
z0E1Te`EEj2aP)QOhP#hB{>xc?Gl%ZuETfuIZ17tZAIS|3yD;{S2`P;U18O}pQDGly
zmgL6=6>{mxsgV7v4I+gBX8#s9f`U0H%PHnP8-?f%vs`C_VU=fmu5(kggWykr+nIn07G%RPX{`(E;8&KVUJb
zt+Yo4H6jK`sKMH?M3T9b?78lZi71KO9c
zi4zLs=8Sd;5Z@fNcj@L=4L)l8{p31Omt_#1Jq;Y(54GIsFN^bkob5y8KpL=t6Oui)i|Ni6
zpYJ{1{s=Y_>Q92w`X8$6)LjYWv3C+HE87DnelR-Bz@l~eVWIp%Nnw(_z|;fy@EDHh
z%K(nLqPD9foA*vSpJEw9(Y^V_36rAP>U&m{#8lsd>tkRSWo7k!pg*l
zx%>2)+elEHwLiOlxO@Ob7*t6W(@s>l%4hbT!gfn{TJGN>QI7;K3Cuy{6R900%I
z0Ulq-)IaE)Oady^7Nr+HgKvB+SK{UWB$R)c{d5Ipgb~{N*CTN-tuyiJYf9e@`8Q)E
z)zCKM+(OGBHMXx2;Dc|rdJl76k0y^KEEw)f(7Sll0)8&DiFqSrUuhs&JCSrVyUuSY
zH5t(?5(t*osC%3ABohXjK-Lv!D!!r=rXOUP|E9Y%A))gZ*`^=XKji
z%_ZJYwCe;lXB*f4f}z7b8o$3`DukIG0R6dWdX4!S&cUbRR5kM9S6_X9%|l3{wpXzM>ZK7J>cGut-b4Hy&`
z-*v1f>nW;P8utGHuYu}DS8GeY;0`S`cV
zlRH)fij>S19SV-;TZ#JKFCCJN{ASI>DFJWulSCY}B`VbIhF?7h15EbQE*Q!Q&-5+Y
z#yP#9Wj|2ZsC_o}FoZBg;q(Ij_OMfO*L#VnYgyugbaCub7GS9PMDRo_kbhATn-1V&E+Z#Svmw0vQPIrM<gHz!kI!QId)p=5A5{e-NywL(SD?M?1={qJ7pt%u`(Qs^m
zMY{L+%h7EnXrVfBbXd|NWe#^zVPC_J8za2udpXh6*R6|LhPkdJ^2Q~B?cE3It2djl
z0~3n{#GY%n&Wv%tx1+uxiTWj%{8OWM`HaG5>B1{@RMt8n4_Gr)nsA>rn?TGBId5xSYdaN3>z1l1&n
ztiAs_ytIr2RK?hfu{8a1FUW;(`B&b$Xw{z|(9J<{=}^bPIQz35Wl8-rUspFtlOL&y
z6U_4?&KKYHoWSil{&568bJI-KK~yDiV!SPIXBgsjE(qYVU%4=fc3MOcTZ$*4Q{$cC
ztkpg&BF|nC>tin=Z2#V9pY{{_Bx{?Jkbi
zM3^2izusO;;hDpA_{k8UT4?ZiLGkY4eUE(#gUUBIJmV(28$mw2Ky=phsiWP~>a&i$
zPEp56-eA`MntQ$$Lj*VQh#>tB?}o}PCP)d85An^82uG3aQx*O#pnv^po>#d8hR92x
zJoN`5%!?-NEmLJaC5~1!;B7A}L&&yIP9DB-&XxY+df{>?ZgXyN>B(HMq5tK4uX6mr
zY}-35x@XG1I{XrfkMDheAMg#bEMfsxC~~}6djoJKvlbdfe~WJMvt@L>e|7b=pb>*p
zL3F>8ckuPIi%ps%3IWv-U|udT^A+C&&XCimkDsR+TwflRp0QA?Z82$S->fG_W3rF=C{_ND8LrkxC}6dr
zBh~~^C>U$$fpe6DTNxGr4r@%a(-Rm3pm7zgTzafaX|JTh-p7YtAbGTiW}HDl-Fioe
zW-?Uk$8_rw2RjU6Qqeh{`n&Y~8FDZL+EfPklUr||o9^-YK|(tQ9p;{lA|zty5F)@x
z**U}pX<<+RHcr;K*nBtS<&>-qiwG%kV-(eb2+&dNBK8bG1k5Goc5f@p{svAWsgUO5rR4&1hj`24Qys^cw
z>&y{tNwIdv5s`e7ii#e7Rot*5Oy8S1ZPG4qwwe#auNV2KdMe~l?{!1Ii?d$oxo48YIrg9Tb>b5bAP385+gz5fnP=|CF$2yPrm&pCWO!gFH=G1T@)b
z)jXXlbe5@_ch)yaE#HOc9mHlW7^J90RMdlg9fn*Gd;`U^#1<)l`{O^jzJPM1SRF<_
zVsVO++J6|lPpC7Yx0t^GEIg*izw2~F;t~rWI#17aQ-Fos{rQ?lx(l<&Bo?^-;8V>h
z9A#bj4?bcR(CKzP+Y^@?)9tOM|bRGmcxHO
zB8gPb(D#mWF{du37KK5XYcBjLor65{PAQB=F
z&7_TCh(|DJ2aA@Ebew>a%V76uf0*mHW%0viM(1wITHd^S^UgB4y*gLM5KTeRiethc
zMA9;j^ByWiIDQdGY7WKyp_!95(|IYD9qGwWv8as;b)vMN0T9k)an3~G4
zzLf;~Ky$NawMz*WKN-H_F3t6v@-?F)@a^yFab!{fBhxzOI1AO|wP^~&AjBe~|Ko@g
zm<25bI?S&HencA}+W~_Xmz9@xx3o=xKB0R9ri1wm%aZqv3kO@j_?Nu+VeI4^RYL&I>0*d)m5-k(#1tJ^G`awG7qnsOmoN$yU_-NZt&M=9
zBkEMro9YuJOE1T>z5GhnQ*0ooh!W6YzIABb2vHLA8Z5=LP_#O#
zBvyXFhE+1eGpgt$uY(cot^?i)soqqX1|BzlQ01iiPDae<~NLl;W$}1Y}`rwgsQ;w_!4ou9?1K`b+hZ4VFRp
zBmXF0xv1nt0M-0^X7u8wneRaoREmVnaEWf33)Qxk@&Z8?@7FXSkUlsR@qb3<#FzEC
zR}KUqT;1yO0zwPapVQ}As`EVED&4P07KEvjCDr;dbfEzFv4vb7zmu*_`VfLGpQ=Js
zBf+@so5a^kYeAA0&$A==6$~wOA=!8%gGi|??xm?JmH;O4(Y;GoUi3GojeP8NgI~`o
zuZK}qs3hyq9MMFuxc0xil$LeX^)@6qBHRA(>2TlvDB$MP?#^_CDBEB6jIwG)$bbw5;hS4T`?G
zY~;cfw`@6e(GZFQ0xEBA6X1NkGO!}EXU@0GWBP2JwomvD_AYUF!(udd-A(o9AT|tP
zqX|3M7$4$cpgH`t@Vl^re)G}pxoJG~P{lSUb|dCCzvvuStxbOJH)z@?X`|7DX|&Zo
zx+6SDi+vak90&IR(wSOWZCwnJa538lyit?A%~~h{nVPaDVfI1wR;NhdG`Z{__;YBN
z%N+C~H6NZ%A|FBDge?P{fLqW|(F|Y!cfLS)pyuHx-EYN#wLh!G*vu7i=_{toD
z@b2Y`fx*1Fg_Bv^spF0xOoH-t5=O3`g^D6@dZmY<+-AgO^*JZNw9ZWeqI&pBy~v1X
z0G6#UD3ORIL31RcuUC3==|~yae24A;Lfpldtvltmf3NdL9(jry2@3G2^YEZI>r;yj
zvzn5id$mIwNXajSlGr$PbAjBMG9o6N_Xf(M{fOe5*PxoI*>#ob8M!1-Ct##2Sa$)3
z4`xJ(*BJ!%nQEkK_n+#^+<88~dnUF8RVUgJ2AYTBf^8`kL{ON`#F|DpnCtw^
z-8mmSL}vb)m(`i6{J$l~%*+Z)?~
z-P~PeD&04}(v-=_*k1i1%#wWQe_)8bC7~K`3o0q`kp1iy-23iic4OJKEb;x2?+b@q
zQ^Fuz?kGUYRIJMMZZ(-c8&ek#YOx7_U4g;cjNS?Am(@A6uen^+^Zw#vLR(dPKp5Yb
z7H}0MRxOUrx9-L^(cB{xJS-c`#0UxETc!F6hK;54i-4IE#bqR1v#w<66vVItP_F#=6=a1;e
zBH78|`fE@K4s>x8$0F=<=8YP|HLAVS%?@!t1R<|B8%9oDg!W=5ahR7Hp_{^TN3@>q
zSrTGCG~yjf*hoKEaPTm9D2!W_p^P_=u1zi0J--ah*dO-dm22{^{$u|?Gec2f8oDNtv3$y$kWAB*o9>F
zKTQqV?KI1lXjLvq}XJ2=8xh@wz<|*6Q>M>O*C~eK{YW@8f@`u@$9P>TYW8p
zU1G6j`HcKeiroo1AR-&L)7QMh9_`!#>nQD1Sb_TS(_eFKK&{_rBQ8bjrjN^d7lr>)
z4?AC6UUllSaQyymDr^HaoQCP>o`+maevNc<-ATE`y%dmeo~EMM=R034mckTqR&g0k
zN!v9LDiRsa55#FkmEWX4)%OxNDvDVQae)fsoSW|)$k&xMtJ{~(%FEozR-k_4R_T*4
zn@vYhiR2*zoRR$V14F54jU&Z_ivntKCx#9N8WpGv-obyr#w-G0=Z^~`4AIwRo*Tyv
zFGZu7_T64*t2LAQ_s0#`02FreDWVzCD5?(%RHRm5K?)EyJ3*7$VtAHcX=6>Hw3!e*
z&W1NsO|@+HY{|JFnyx#yGQj0sVMzcwf)Js=t1JaTA;6*p`!R_@^aZ4--*b$
z_r{$?dEBPsuZqNdYcvaQ#7zO0YB#U&2bZ%(Ys
zXRcPcCW&;5wk4s$E-cbHHGH1k#$U1-p=vQ*>ORLK7>xaZ#8~(ktOkpj=mn
z)H%}?T+U1YTid;Kc|$Bp`F{-DuuM;QK}9(b`b6EUxuRKyfal`T
z-=mi{r7;xxF5{)vK$F8SJ^W-SBoa!nl~C^Pp&R#k1+(UBEwnx~nXZcTIb%4k?GJZl
z)n)WjY2O4Lxnll7ff8B{I^CS_-FSB0k_85LE>e~TCf)g?0ARoeJ~y(k(Oz2yaI(-{
zjbm-b7K01lX)NL|YWU6tHPD!2CjBWl{j%E*BAb;Tmsxk*P{xZ)1r*VDUQ4fXa7hLL
zgjS@y_|HH|aLSbxf%_%w)ImWpFU62DokJ-Ahlr)Z*FpOa(8W)lU%E@`9}QN}ayHf&8ISQCGa+3gul(}lwKk{ZR
zBiyp|!Z7y5^o!o(aVMWy?w#qMC>&k>wyhf$vEQF4nqkkpqZb?BOi|~%M}Z=?GrW&ow1&X$5
z%YpWHPOZ|Oc2RhGzpW2&&ZqSgJI+)Y4xKD
z*r7E(WpdhAWL()G^_rgxW>)TWPB7S@#L}9VCNy_J+gP5U2(%35Y6!ATOK!KsH2CzC
zn#{YnWZ=|L*vVs0L`A
zw5PSbsL5L1RSaq7*#~ghcq%!2M3u;Gap4D4cxd^;lOOo+NRVu9)jfx+lTi`
zy>n)Ug9~h^m#>1-i(3aDQN+|!DO-zK7UA3O+z)bueg6Cwcfl{o=;UPOU?wQUCaN~+
zB?fAw{_kkLI7wCX2W>Y`Qw1qXshmn2pD^ym2A)$Hd$Ffdl7%hj6|n@Mf5-49ykjs<
zPmyM~hiGV}CGvXPr$hnpl?LoU;?wI1(}dTD2+Q!JBfeZ>AHXP8z#b)bDy
zUPHM>MOcT^l^4GQVZ3!))ra5e?LuqV>aPu5w!~u5w08As@I1mG-}a!#8hU!p?%Ud
z9cSMwNAzHRt%ko
z4Y|+%>jbpJV%1SUNf{4p>6{wv3JRpPhlkF>W@(j5{%dnk00@H`?|cADH%F_DeoI{Z
zg0X-G(wM{oX>zue;ryAD+`I&yP;Y3_HS?ooA85Dj;e4{r_@5v!fLO6*T=#N)L$dro
z6iosO6=A0It6nSW3E2&6-01kJ@p1m;>F`kdY~i2P$Lvwhb^Cd1HVKI-yX$Q`WFOq2
zCk(&ujQPn8-)Wen9Hw;)8+IgEr9$SodVG|ks`D!gg_e~7I95!fF?ODm*Pv~g9O3x(
z04RN~dY`N?glrIu
zInUM}luxEx59l7ouCW>-GJo*K8+hY-4pmH`G{_%_>C^B?!7Qrm`PXo9#*2Iki2ogO-y9-fe9~DG*1Dfivp9I*|
zjVvK=?X*k43~-~mW>h)^?u8)+b7cVfwM+1iXd!S;_j}%o}D?AoU>;5RN_7dkffFB}^NkU7I~(c6Fv0
z?r(@p2Xf(MXP$o4vkK~fP<63_;l50MN}_&jc*S#;tBH0>pDEo62=^g$`QSWAtROrC
z3dRARFZmyy@3Z;FK7#owLt~&)cIrX3T>xx-1{PL6&|%O#`
zqz^Hg-)zVkLC7O{s9o4%;8Z1qnr5DwUrA8XjOnRpd05I~594w9hR3^h>3$hak78T^({TDY=L)u2dUX
zbCA4%Hx1))x@JdM)H!mGxmD@9i6&C~0MZ43j4FicO)0gy)crTfh@0Dda_a<;RDQ8M
zc-y~%7_@tTUTMooxXce6UY$)!mPj7N0+MK$p3^!p^=#2JFCfnM43S^K6kRPtzC}a;
zVW$$vj6R4ZSfOuYXW6N`M4^6}A6;%o=;y;q8p_S=1?>e2-4#`Z(qv(iD1{y9dveRQIuf`@gkJC)Q{>goS)Qk3K`uPK2tb-P>gm1
z#78UcNspQyHjDhaxtT
z(Bga0p;yIp+sN;)eKM$##NIfNc>0%HtQ**(sES&N^RgGXfRrV_y$Z3
z4|t3E@9A8KB6UggJW14}$d+mw4Ss$DR5e-)4lom3#yHpxc0aMDzCJi^cRL
zhwkGM5Ju2zPELa&%X}qr@i|V
zmc`%5y*oWR+*{jnH=Tvl4|%Y#XmxW0Ahs5#2f$D$Ox+zeXm$#yTRS6p$8}KQncF3@
zq(I%PQ~J>rPfB%OkYO%CEd^>ple2w7Z}i*d=P4!)wpbuA=3Y+GFRgro$wU~l!}AhXV2&%#!<#!yALONzh`u`C{ip
zRWkhY+bCLbkVftlHR&g2f>7FyZheQ$W)Y+>iI7p^Ta4m&-U)b8no(PPnSotnbr#fR
z=m+c4`$3HKnP7`H(l#Oj3L$eQqUG2IgASr_<_aHG1XgGz4i4FN7bsD9>Iu~Hc3S>h
z2vc~(_B}IUl2b$7@o9Cu4rv8V?%mWb0uVGUgji>ikB8ZC!FfmqI}
zQ#BVT%rExF;0sBco^6Of_!HeEbj2cQ)+nt@N
z_v?kP>vjLeS!%k&i_|MkRR#&jm_t%T@XB?T8GU!{%@Ih^q-p`f9}~z_H-%u_)kpaH^Q^x<4?)~=a=ihyK`|Ewr_CDM@{4hb~fBiP{%gn;P
ztFPbQ|7-c$1AqMc;+?}keEscs&p`VhD|a^j*s!mutM9KR%aXpzVLvHOuQuw45q)P=
zbv$Fie1UnxNmi4L#>~bHuk9#1?fhwXjynDYYGG?dgA
zNU9*k?ZBU3Lrr##hK=7z;xB#~#x-8sL`LSfH2CsBDrbDlM2Gr`t0>{JhUXa#6Fkvf
zz?Q(p?Z)K^Axl$FoIkWne1cA{qVU#5Mvo_ORrj6i3fYD^mT$U6?{P3l(*D)EoIi~_
z_9LPAR{aa+5q7`lAxBqFfH@T7X617jLKC0PF|RP
z9|IyEr@-k?!nB5dc8-e3(A!JgWqZzYYrKfpguBnD?k*Y@Xddl^^tm&O=(~W%hjjk&
zt>XL*nW$Aw!u8$PHdGaqaP-QJPuh@Y)4?c>sm?Vi-gGz!g)j1>ams=zgSDB4EmKDDI)P3Bq{3(S~^^Sbmkd>gUXp;0Va=`ZZt;tm;5
z;lf7fE|g{yi`xsUPN)I(h2#w#83qOqL(Oqo`)84F_h+T0ET|gpxAls66VTeCIHKtm
z-C`(gAwwPxsq(8~znz3@7AE>9hW!G;C)PBHKhe+B$DOdf5!;JVklf~^6OLC^{oeP~
za7G1oTupTod@p=d;z;X#ocMqwx8+p@U0>Q~;z8KD<%@$chiW!HoL9ra+(O@I_Oi?7
zAJbP>iFpAwOFA6ib)ib{aieYT7x_LDZtMjm>-8)nJIhetus$uKs$(E&dapy8Uwut-
z0E$eFN`WJdafQA?`(X(M!@13Y5Y^WQmWT_fNl9EZ^0n!x44XAAV6+qZ)@$FS^B;06
z7$vg*kOtSmQ+Bi$~h5r1hlbczpkvwe@%QE{>($GnCcn!W>u5@UNr+vFOg=Xozx1g}U5H5l%Hb@Qa@P*vu5nZ8aK|Kji=*iL
z?8sWN0mGJx;afl7ay_si?cgUaPpDU~)Q>6S_#S-g+vdiT79cW_4
zXrt=Ftm|4l@byU%Ne1Fq6zlkCWq%B%$)Rj<*|GV^x!$!SM+lu1u@Premx;=EqKxa!
z%QHSEL9e&>+w@&)&)&#Q5EE~DOq;&yo6fU)MO1$V>CbDQb?cBof}STY0n6pk=0Da3
zb{DoZe}wMeR}U(JKZxrEPh{=WJcRTW$#Ro{mHWEVH$C5eItt(913p3nfB4O|yDc(_
zUNR=Fwuj?#>?YYJIDNh>$gycd8HhF}Lrq}r2CwGXjy7b{e}erXJ`m
zT47}TbmSfufB08SW!lOe&jYvHYxQ_9-pwg2fWK%|aqY15?g#
zL2)xbMn$^Hn-=bKVj@On&iG)>-;ROS%%YtaZ#}(Mu^_41Pq`}Ui{S=lrcUIUuAqFB
z(z~?*UKD8k?7k{sgg0`oe{ZTk;%2-@ALobWAbep_t#0C8SbY}mdP+4$r({O2P@iqO
z17`=;OTy41I>%D&6jhtoEJ<|);9cFPFD<+xk@^J9mMWXRoKr^o$_l0jVr$R{ufF$v
zQdv$vu!Ob@q`dC^B57q)O-|mjb7*sCegKL`tZSjfo7r%BljA3(d-b)E_XxXo
zdfyq_(MVB~biz-@3AP<#;ml{#>-*jeiih@UY7zMIVyOPuO0980f@c#y)_H}G2y
zbJ!4H%1O$2^kWCUk}sFN471G==zq||B2JK;R#YCYo)p16ldvU8R`wBpY=-Sthd?Tm
z=~@Qqm=kClC$PDIU>-@~hn@rF$qdVro>`}kxK-c+hY}U8N*h@%i*(2>Y
z_?&&wq_5hVW|*#ZX#w>Q(J1so`}gN*p61<9WJWdf$Mg}%A6b2?YYA?t*Qx1e9j%VJ
z)M~Hhh45{({-JXFf3B1|E0O#SI>1+L_p+_qo<1Tzip=kQQYmhnEIZ)EopqW1kpj=>
zCcDC6=Hay?2B+soCiA#GMJg9_^5N&$b5da!?Nm6QoGqLPPS6^sh7x%RDh8hcdvTIa38^
zgFWx+eV#d*Vec*ObD%NA8?PN&^{;8!|JC1ChC+nYk66|?Mt>uifNXz=dJR@L1+4vZ
zY{$Jzp{}W4FbbgkFWRL&LnrUF36nA!Sh)Fnd7_O$EYUqrPqc&*L9XA#FY_i&Y(^oj
z0`Z)E*Lm!a_AWGqAxb#Erl|&GUjN56f4drTIgK<%u;qODqtpiWTTyyE*1mY`{zFNi>
z1rOW(U##IC
zc(~U)3g;M$vq!>@u8W7>lVR}Ln(
z-mLpc6qo6C2eJNZ_&LGK>&ztM5kGjQ;IU#rE{#4g@+68yyx})=;BV0$|F@Eyhdgk!
z94ZMH9hD7~lr_cS<6Pi6rFVgkhL8N1u1Lf7s{Nb!S4+Friuu4=ew+
z_C{aVSH(;bc|ptOG?nupCL);E8rv0%V1EB4togd*4+fd#n;EU#mmGx1xS{c;@Jy*_5dx
z2Y_+#jb2S|1f-}3PUTiC<1^=_%%;z%>})L%9J?yF1gL3NUR-&a|HJRI!QsC#JnA-1
z2eI4Z0C+WxfFh;u@`ll`;`vt^7Nc!7Izu$Fx{Q|(oB&xLlkOT8i~kB@q#Xpn9yZl#
zY@MpGO#DD0DAcS{+`vIn7Ql7k%8TP>l+%pCieg%^y2*dXrMU$YXz^p
z=%y2O2N`Okr4=`54M1+Uly*Pcl==LYdxeuuF
z%hkR|V`wGF*P0`!mCOcuSxi#ISu#39+IO4(w=8<)HWGfrnF@xbmw=D;Fa}5Rbe*0l
ziB){GI+lKwPs|5Kbt|dm;d|pZG}SL;xf{EEETgg0uUt&);Q94qhS-p?>U07gIEyIP
z%6<(~LmqXC%aTHsh^79%L-_=R&udAZ_Dz_jcpS3S@Mie&&%MgSStXBe6-AQ&Mvmmv
z{|H`P4blKm-%3HAO(IKccKU)L>!`D
zEr_9#Gz*i>=~(b|RY1K0Qe`6ZTOH3}U;DjRAL}9*f$ld+ucE6-HAYd7uiv!0lCo+8
zH^Dj+hEzt!fq}L9)fannd*7%69~Am!A3K@&oBmo$$`M>@NTS;y~`09U0pMDEe9*T&^{YaM>hgrZK^1peSn0v?#1@3lUC(T3-(#8
z*Q)dSJ^=6OPyLA`$5|FZ*<&gGBwqv1oSlDI0}3_|ZPtkDaxIn>73qR+%iQv%e^m9q
z>5JJUx@X^4WP7}HRpWgvHWg8wd+gjvhdDoK_VlnhAi56Lgq-jCM8NY{5TwVCEB;@=#{|S3lr*l*}9C>
zWSz>GaDDdJA+-n+3>W@uG^YP*OM^cB){p<*u<>Qf#L(5D)Hl+B^0+3({d9qIBFp4I
z)Pg&i`l>J9-3U9Uu`aoLcewMGg(MFHk=
z4t5OfHA@Fm0Dm%qB&3Ms59L5Ki2`D~)Na3psr*x;K0r;Oa=h$2M%frX`{cpyBbhs&Z)6uinZTUt_7r$BxWn6YC*UY3?D`byH>7TzBwECMbFDCl
ze_3meI%F(Ohml#Hyg_t~`VTg-mJbEetbt+1a_(d_2!Bgg4?B+j*n#a4
zR}PU>$yG52_dWlAy#SUOKq+Cpae8Z1rn;wri>T^{q6*Mh`zw`o21#;m*?#TJ%lp?#
zw&6}c#T(?mBnP+rv
z6m8&IgeJGooh^Nn<)8>6E1Sj(7U(ib7L
zUm)7M?D2PPzcFFF+8evki&vGNk&-=vZ`o^DG*dNgAQ0ch|6GJM-Q@3FL5<_IFIYSC
z*;7?8aToh;9AfAGwzq841)|d)FGJ-iNI>dT74brRGz?CP=qs$9FvgI#^w6kETGzG%
z=T6pZKch5TyP4FS`4#OI_lC|c^!GJhYdVs}t*z)tdf)Aj80<*6jPVC7>w){@>2loA
zidiWvg3J9W%Hopjh)W!=#|e`bs!d@nQpMUthg7g{2ku3xp&`i!9i_1uSwT}W9O@|rn37o~x%2RgM#ahw?IS-+>i>X&D3)klrws>$}
z<=LJFR5!a>u35bfaiQjbpc>N2Ktq``tNm-H6L>#Q(h`ZYG4fpIwqe0YBzCMb-lG~A
z`0+|4@tf8_jn^cUaQ=tW8uu}2znx&g7RQLIYaqSs6Nnf;K^8yIwGg_MQ+DMCMFEM)=RP%MWcfRqD
z_L*DgiEs>@Y~-@!OWfleFXQ@Ws4g!^yZXdMi?e4T$KUkg?ZBD_D_u8Xqxtn0qT5<9S#Wb!t&6w3JV_CNJ`sRkl^;AU
zR4RYMue+p$Zy+X21JMmeMQgFZFiB=
z$se1bM)T*_(S00MJ52RM>R7^_xo6Jx`_Fdf(O#?|IUS)F^GB`#&oRB5QBgCL^=h+G
z;G6AV-`;nmrEVH|L*2_hK6L(H0V|(Y(7nR2;4z(Dqzjcji41UgSmaS1UmC0_?0{>b
zO>=Ltk=d13p4S@sYp?s|ip?>XqgOnOGInY%1ks$htBEGRbk37*Vr8#+@u4loqOi%$
zG^okEB%gBV$V++8M|ceb%Q>1vT`=*3)y6RDMqaGIsKh?2CG`WrZx(97Wask&5r?)e
zS~9RsImcS#X_St5%$LJk52vjD2>BZFTLGN1bAJFbfA%}sAq?qc==9af`n1hYK1$TS
zP6!>FIz9V10PU@jMDlA;ebWICYZz8*O7ua>B@BA_}%NH%~YB4a%8{eK<+iqT>o2wA
z1R8e7T1Xtxow1aZV?OHq3r@6&V)#R*yQMT=A;9Srar(rI`-rt-kzxoqV)q(GcBap$
z;jWiIQBKy3RWk#oGkK2@{oTwh&*eGwOI8tltE=?uE}1mWQl3-)O}*in|MUJ}`=i0d
z>PziRo}t8E@06;u_G7^{s0nFdyhl881IgNV(O4cCf`urJ8t_7SWF&w1)nEf@tjPc$
zqwL5jNDa4_p>Ff5fO0LBBJRU&OpF-SzbMXO4HMR%=#}N+0Aq!CT+A_=ehfNkH$7nx
zD`6Xk^d4V)T>7=Nsxt6KKjI)SPQtDrzVGS0(7rIy{?H4|l=wuP72_BBJcxave`FwQg^onfI7x`oQ9Qxo>!)8mPre
zeXvYyS#f3Ww*S6UlNVz$J%<_B~8L-KnC$&vIIj^zXi+txGHZHk?7-?i(4{6}t4#c;?a24|-KNt&6^~7ed
zfKeM^&`K)*5bQn7dCQG^NMRwplSRC+?Hl35zvm)6nG*Ge?*jVEqpJ3^ejee?f#8{@
zgxPgmPVlZM^-cQH7wsQkN&6pO;P}o+w#V5GlwsmG0f340Zwl_b5A{zzq^I)FAewg$
z*NAZzn3vDE5BNO|zJMhsG$RZ?XK+iup^@@twL)BH8>_UJ4tl6QWO
zIPQ1qZ
zQ6f457tsnqn7df~+Psv$^_Tjo-@Am3rRX5r;86;a(@69e&S%S8I?M(z#
zu&#JZjeoTm3WJ`LoEIwxW7-7Wk-pJ;PJ&M$@58Vsq9FP6jh@}tP*4sI39Q~Y0Cmja
zXaE1ZMpS7j{gbFE=ad&ZOQ`lrj!ECFPCz+QM|^|9>NsZfi1c0_5dDN-dIn)`UM=WY
zd2Lfc2^8mvx$EqY_A)jNF}5`qiwA*>qpU_x{Mh!X2|#v#ge1#-a%DlzzFNY#Vo-HxqThF~6$iL&e
z(<~HlIO`u31=j#)-M?!Mf<<1=s4`BmqCas6_*Td1FUs8~Arm7OQIIe=oaCc@;bSxakt3-+SzPNJ&52_)H!76ha?+
zH}t=cY;ev!+=4m(-%a^WTu8MxFx@9b$ztT3T_>~dLjEC7fe!$^U|e3M{TKKM13bz7PWJz?_3m*=
zpKbj3^Q@KITDsPnrKT&l+-7M$Mv4lonYqoBnkAm;(G`XzDUk{SHMh*vthqGLmCF+%
zkrEy_)Kb(`$OJrtCp>_HCqO~q_i<~__xJj~zW?+`>dlAybKlo}-S5M7+3?LuDgb2f
z{$Afq-WSL?v@jR;CeQ8sadykJssG&855}x$OZMiRPXFh7*dgdZ2Q!)l|4aY|fPJ$Y
zgZaBshb1OPi(+0M*~29@YU_MzL%-6-0L(?aJzy&Ls4Z2L4_#+Z>)W!QvXpE7zTf
zkF4aEyJahU=+Zu87=pp`iPFAl)WA$1l<)JuwLfU6yf0;bV*l72Y6RM9Z$NW68rLnw
z2zmaSNM=uGIF%_FVVRgiU60-!q)l`A&Xnh*a>dLiMwBHwMp9RWn3O9J$pyed44AXianiCj=4?tMe0QHn}6zm%I0TE^qurCu(p`
zKu?VeXPM^m%`$7IvzMRLTQddpLu^KZ4R=+m+bX0+e`GRVO0Xrx0CnuhS9P6aMMZ#V
z!lW*9823{QktPsD#u=4S*X&%OEjb5UtmCHWFs5;-r=cHC9xu^9)pC|sN==L8wH0L|
zCqcYx-Pz7S??tYXP4wB>ToP*0T=PEbdmsiI=uOxp%90w{#I5f2%sye7%uY~C5?$M-
z4}dhksW>Z?5aaI5<34pq6)j%1`7aY=q9J*g<=sB09BbP7AHB=sbc+p%j699{c#VO=
zou$CJ)6Dh3<-Dzg6qz#5m8%7!^@^G49<8}ShBVz%!3@6S(LxnBoU|SdJas2oU!fvx
zUe52OnO-@28q#5_2OUUfTE_h@s%78KE0Y8YF$wkZ@5g;ksF;a(8742TyG2=ik5xM8
z8*$1&jX|m<$*!vKC{+tDDMjG=OuB|R^pT@$QRm(%@hfY)ZB8mL9q5_q7$Gmw;|98m)*5+w=3*G>B@O5lW?IfR
zm%d>V4Tz%1WZ51q@@vz8X~9j&U%H~>(F~)rFe8)PIg22ULMmv+Gb&Gm&^bjuXKIC~
z=vGRNTJl8Ej+7+?G?8CAsJb}(0(#wT?ENm!HobQVb8_Sjvroq=D<@6W!BJKS?{G=-
zg7W2V(J532p}i!zy#m<{e4`_CCw-1Q`#w2VSJkl{&>xrwSm+vsFWpK!2;H2SP>Mwf
z3O`v*bZsFUd`TK3^H0*0QV_8^|0LU3TnfhMixZKydAT_L&q(zX=&CVsWMUdvTsx4F
z5$kb74p4QYFPv;D%l->jUGU)X+bI+_L(offi((v|AJRs#bGp9tOH<{RUySl&ii%1V=Z1sB!Aj5$oS*M`*Rgo88%7t5Z=NU5Mwa
zV($?{XMTn+L~?Q6Zgt**to)Pqjd6SgQydWrTU##mFjz{L69dTWT5|7*CC^M{x3U@p
zK;Gw6#J<^PQx?XHxt@<)7tV5Z%Vh0}1$k=Bd6O4I+Ss$PfI9-N5hiAoceJ%*RBA&7
z>)blqRAAT2pNHNoq-mZEDsF`(kMX%b=l^`e#8n5V*A7`eEEhpy(t9Pb>^co4)I-`VD}AUzZ52DbA?56cFafx(2ffs(|ST93yGS&fp0n
z>ab*kLoMf5sey{b>JnAPZ=a)-oM5BSq+!Bgx-mo?fCkrh69Xal
z(Fp9MybXJ4wyliGA(haPtv)n
z=pgIujN^vV#`Qk(mk&B9U+
zs9*fvqg0TdCeX>-wmg}PMV@CAB&XMH84Of5O7|6de`5Qvuq+M>
zrn5X^=PBm5no?ST)tc-NC9w_W^NVFZne(Xmu-BRLq4-6CTV#9
znK63l$~$>V%h-Kw2?_&Z8UarI#s%E
zV68VbBOfn3F&g2d^%a;w3T(x-X4o*wu#jzfGmC7}yOtmmwa)7iFzq4|yg2UBwxU?&zUamy$&`q%BG#h=N|4JkRig?1X2EQoTSR_A(}+oOH|35b
z$Kq>=w`K^gma-QTAR+{3U&zY
z;bOUtm#!w4J}+E)mqqDk#c!7o%>LkgtjcN53yG~IwT{RUiSLgjf@D)ESAct2#%HnP
zkbFyPO4;X@1OL65`?xfm5B0G=gSlv@p7JpypohF`2brPkvC!3$X7Uao#F%#Hmo|@O
zOj0#Qt$x5^0l$%p&KSnS8}0=KoQ5l(mKK3=;O#)GmFh1@cYR=Z!5Y7A8W5qRZg%_Q
zVRv~DJgp71_owU>L2m0ON|*_&RL<(!90~KI%t$haEU&
z@b30t?9MAIm%5#ch|Fqi()=15kv$mOpPw`YU~WLo&(-zKo4{_V*UtHuedjNjEGR3?
zXp)HcqwJDObeRrtSgfn^K-4sjFPuyH`&P^>dd`9`Bv~f6bwTrhYe`HwpHn=x4o+SF
zk&2&o9|BK_1`*vg5MAP-BPZu>*u0lpwmXz~q_i=m2PzASNB!96APwO?@PH&N@Ps#$
z!(H>F4I4MZzi48^nBf;rVn8%{S$WsH?P+#X>^cC#W*E2rwp=3oxy#JD_azbJ1YE`P
z&mTL2b4@t%a>C;lmHXb+vej-M_i4U?0yOk#TDc<#?gqI3jeI}c6F?kRYK23Dt#SDF
zo@+I7>WJmiqa(uB%bL@}P@d?Ky>nUs)ddIk0^VuXCl&3(`*(>z&*=Er&pLIPs*H?0
zx#Di3K$uyzd+3c}#t}m;;h}+*`4{*w^DZ8hRPjI!eJ5LKcSR?9*%+GBywelQ(>z9K
zhx-lJp#0+~i&N|ZKy|v6=i~P9)amHrl-7{G=^I_8KjZT!Zlb^l~1c
zv^HiUEZ~7QjefJVp|kmT7EV=~u9jF0?J#_O^@dthGP)qnCOy7q76Lr)Z|3%>j-KJ8
z2|}3z!r8?yYxOyFfBH5@*45Zea?cv8B*W5Wp19gxS-mCF
znGOOcL^B*~t*-nZFyk_2^#S{;>2$P80?|=-Qc^K-;aocCjxPr?SyfdQSL?fH27N#~
zv-P;EPpd5RQrwO^1r};QD>e28Ne(cV!`|Qt@k*YnQZhMnw5zO-17u?xc+utAcUhh+
z7|XjoB1?9Qs=yRCSjEaR32kRkfCO)JQcZEIKtwBmj3y+TbJn&pt?%Cb9|{ExxOMSS
zM6^4uMR-2K_NQ)L4>UVzT|7vktJBi;xQ!_$zLN((E3q5iE4xB-k8LgUjL}UOiPN1$
z`EJuQRd91d=2-9o1-H66Fur@_4&6Irm1-T9xco@H^H2JDnwe%bE2K0@SV71yDOUZx
z7Ty5&>TC%Jk0=5yR7P^>iFM&U{Twz~_D%Bk+h1>7fhd&iCzIw>1H?B5uN8
zW-OGU(pxATM_Xl8EU02QP=Cp=@o*Tyj)f9@zCK#UpjA|td)YLCUZdnQfyFpFsD7yh
z9+8GTR9EFaeeGU=`C%R=?!ccrmY)cB3qq5lpL8}x#bzPYI}w7n*v926@4(rxAUt^C
zjlnl!o&`fu!7jSlgQzU+1(k?U8z;6SzBuh}{p?8L9ZG4_63-E46KQ(|-CD+(Ka&Ne
zHvv+xzm|Je0?=A6Pe~K^Gi|qZH43RF+d^8xC72{tIyE(PNL9KO%1bX%~MSkR;hkXI`x5vPUQ?5vouEha*s^hkl
z=diFQARAliU^_4q7B7+%rE6WN0N9E*?268)G8y&F?F3Z2GEhkY_^LhAgf`C)`H$@`
zWb8?m5MilDF6bHyVrI~~6i_isDnJzM~&w>MqN
z%(nZN`<=&HXd{7c)(8u3nMoRi({9#wMp8S^Fel!I508Hl|Z-H?s;U2Ne?taPUiyPfJMsaCM~;mRxz>|w)`$|JG{5U
zqBNbY0d%e^lC~KRxZ$NKx+a>wY1;f3&zl7A)31kvYi4;Wb&9YkAxpNnH?THWt1#iLdFl;ox!q?6kz|
zULL;yP@na(G5MzkzlF*knkAL)VOR=G<)7)^P7C@UQX6mBh?MU+-YDHRxpEC25%*`e
zXSC)zraNhAbxtibDC&H%?&lk=Ixh`x0JQV*?+6U*+-B$I2G80Nn0QfL>k_wTn=2J;
zSH!aNa#Bx?Z-)~#fa3QUMbcjs2@L*W!8ffp!(}%`fv{U@+p#Z@Zt{}zc7_L5@yd9B
zhnYW!k`NEqD!+Wz_E(gbGyq(ZKpI9iYHJrG;J5SnpyT#^yKWbK@iC>?B^ft~-ILro
zaltP7qvFBco{II&Wj!}Q&ju!YURH&yjRoWFp0?4jB(-=YV?o@~XsJ7ys--iHv!`h0
zKT+2KRhn!2$X1sU;9bn^SbbCUoC-7Pu$*{2(mSv}`nI$72&{EY(ov}c#pEW;A?yA>@#d;NA>
zqpY)vE?E?huGF|IG#~XeO?IgdOaB64k*poTh9a+mNUF<>AbxyFON?ZbZ;J5b6GFft
z8tA<(?pN*PNCr`OhI0N_U1+R@79KHw3(#<05&$ew`KK3uyxp*==RTqWab?p~UVR?A
z7lVX6@_1rH*B4u%(enhnW+dL331uu{BTL(PRdqJ+zw}3oiqsp2`igZ2mFUF
zPRWK&7Waon->BYOqWJL=dL$!-&Hp_xEYck2VYf;csY9wqvY#Muc-3Z_X75#gX2-mD
z7h1CVP}h(*{MYL(f&H6o99~)mKA>rLpzGCJ;Px^kGTDIdQqM5sEKq06P;rKvz&Kfp
z{(pnX{1EY+3rJM$<;cO
zHb-0F<`_kbk9PyInyT(|rVc=-{CsHa-Jnua0*|@A-fRMs5@Yb+OoXj3v(ytJ46L3f
ze$~CJds3Nhja)$}jdK(p@vmE|l(je~Edmm&)DF?n%a?*9lG(D%3g3h6HR3QrenVO>
zRQY}!Po83`Xts|hYYGYXn9{i_K&^F+O1VHx$eV&o`2ZLp3OK7?b7tO>eG@H^iA%Y1
zIX4?=up8BE>d{QAS8Oyt>;OH?9Xr?r=4Q!#+cp7G{PE^bn6yOz+)q7V8^83(+aa{V
zj*g2?a?c%1*R~2NjH}y63
zSL8;DTkEDo0>5Nb25LUy5H4nr8#-R)z@)k3CdKl!zu+sj?V{il&q0R;UGX*
z*nR3XFf+(D&bS^jJH?u+vm@!N>nf5Q+<`V&pi>fC9}tjj;&}60eF61-Nz)l}gB++&
z1F5PLdi^BeI&sh1eE#gN&3D+>!4V){AjPcahOJEaqE2{Arrd1i>}%Eo4HbkNKP=ZL
zo(Jpm%Cgz7tTROYVdlr$qWz18*`uO79c>X!n+?UVmYAFgH|hIcvbHOa@9lv68@ruD
zZ?s98U4}TMqZ>ANl?
zIj;amXD_yAT<(Q;dw`3Ev-98ELD*;cLkEmRJU^8hU#}3S^9`5VdwWvyjyFyUoYur|L&<<
zuMF8+R7$ujSs>0G42n+4;D&1L&7RIptea^D99dQan%@c=-uzyu+6Kdc9DnKUgUs#_
z_187pv=F&7(Ffyho}vs+b}j0jZ_ijd+b0a}MM3GrA{b~g4=oop
z_$C|pABzIhT>Ailo>-!0MwVLL4b2Nxi2HK})6p$Ta>CS(`S)quf}MT%iHaD7D=CCa
zjQj+7)%c1#ep^$a8O;7(F^`)>AP%dC00MEf4HmN82eC!vQ6ahGe+HPi;cq*D0fhv<*OVuy7H3+E3+*%9!;OOMzc
zlot*ti^fNcd*Z>s9`?bLCq$XqwBo6Ke$=(EuW~@I`%50B=;glAdwxmm$jJkWwAQ50?*)1~CgX%%
zMHDTacng|8Tn&?EzzK(kj5?=tN`AdNi&<(6fYS8a_
z-t)6ucw{%_S0mz^X!phIcL@x?<#|_J<)Nu{4(t)6qD6EVy2Q+jC%j6Z57|R+
zyg3a}Z}#+k+g<2jcL*TmwvZ;t=Ro>Lu~cYM$?RS4*ljCcN$-1fCTlzVSp9-e0ds+8
zZ?K`u0SN=CH4bTgh)8M-4XwyC8v{ImH1n0C_R?LqMUjBb59wzrNsco(TuFHLeh~3xxoh)EeUiBM07*G9y&RqovaEg%f>~0iUUoeW%~oTkVzz*
ztKSsDzmlCW>B#qJuQmbJSYwzLQnek~LIXMy5F+B$ha)e@ZmBZGxZA3H?0L)InrIjS@1t)RX?FQoOd<4Q|?Q)ftCo$EmL6c#Qu%Z+x7Cf#wRlyt-
zTfw=Fkk@}wgQh(xB#2JbE|t?H4d2-jXj7Cky(x0kZH6PFHyDQLyM-aJVh4QOPBz(DS7Zr#i#Cvtl
zNyeX#&XnCB-i)e~S0YezTPod3@JoIaL#C+N0V_w>bhA>lkIfHYRBrqDM4fFvWdo*=
zc1~7Oz)N{FB*u`SObgGZ6HYnO_)U$Kd=Ic+WHAnVs#qOM!hJSap(}Re*cz3cVC9g_
z3Zy+>;XvcF2uHR=Fjqy-D#8ifYv^0(SH!9)t@%@DTd?LQWr^r-y#kSpenlOx@+`Q{
z1Vs~m>)m=d&Og#TrQ&vzt%jt@Km{@49GTdp6#BhPpde#F#pisH32KHwnfJ_++O0Qs04mv`<|0sot|LT!2LW5wWzp7#ye(Wakz%;1wvmiZ;HMm%
zMhg1U9lf-94_6Dlbia>P&0Uftv)2jwJw1hNG)q5$-=3b$ub_u95KDY+(9
zlhf<0nnTMZneNg&)qgpro!Q#oq=ToN4PruhUX=Dn*y2j1Bdk$ZZGZJ%>F{0Tp4ENE
zykhdCvvj#oKUad9BNUR>&N#EbSR7nND)o{x^a~_|39(oawvx73sVOBITfAnSDf6Vx34*
zkCd{)4X#1Wf9eowH^(-8!E^(jCc8cEhq_k5sbcI8#RPOkhHSVqY&<5G5|)WT_dxF1
z&(NQhzU+`4yW(V+6y+ke)~=pG*86$^C9H21+gGFwH^t1)-&)ReD)wW@Cyyob1Nn7d
zFrBKmcXk3Ik9q$C*%eUqq}V4ZSJx4?15p3g%(^l6%Xf^0%!Dj4b?S88>=(XW`>u10E
zWbESSX1R42z=!2Eg_h~lzwMw3Y)A=H`wI9DsK&muxiMTT!+7;3A&!F-2*SfJ$d1+P
zI$sD_;jzYs_Uj2r;WFWmIeCR7xoCUYDU2a<1>Ie8S={MQ#*U-s!}tRlZfkZ>X(bmF
z6$G;ADp)pDZO5o7WXhvy>}*@M7AlCHLI<%JJiQMlTSEJm
zw(|D%XLSIW8@A3jG
zIC-GD&h3i5oM*Pg7hbKEx!qU1Km23AL(_IOx+XOtrqi0~JKfotFTGV~%Fs08Bw{wl
z;c{m-5|l?;M|BrV+81U+A|iEAXN*RP`KpAvM(6q8xAA-Am>;fe%x=fhNHxdrQ-sKVG|nfdvq
z<{;kAw2Hznd@FJb=%AC4G%zR#V$oHHfc&RhosM?eYh+6}4hv6VMrQ?CU$P!HT`Ukh
zf2=pVr0!N<7j@-4DnCwU^W-a?Io1lq^64U@4Djt=ynUf|ryFPz`vAJe|IZfDfVa8i
zzLiThr4e!rh)x$bFe3m2kHx*i&Yl_YtZ-pS5ZwTP($leE_DYn%U#uBq-1>4;~
zOs95Ecmf{BFXj7XHK{d6lF!DGMT#4jua>il8aV+!Zkmpi-4d$@J0*3sac?DLabTb$
zZoS0Wu@e?zOyhR$DwpXwa2ILhsXKX
zVoujW-ILj3AGxOLS!6QgAAD~X0RJ;Pa*$2r@{;@n-TuDtgTp<0f*~#x4$ne_V%MY#
zNBSmL0F~rNy3eNa3lCdfLMy*{J($@MA$rcp{tNV%Rjxf}-jIYJ^P79h>@O&IODx=X
z7%l!cW)2c~5Co*2lhDf&*ySmnwuMrVkfo*^3^J1rH;|%ZAEgjZI+B-7uw4Z)_1~Ly
zfV-^LsGY`{c?7@T$^(1~6PqA9T+aWk%#<-_de})C`3pU~@{Yv%k=86(wOvuusyMWR^tLX;3#ceSM%wo)wG
zr5esNRL43`199h{3Aysl@E!o~g!!ZhBhU`nzNMjbQsd5X?m3(}dq`^VuO%X|uYh=O
z^ZA=UzD<5Ye<=#M;<{8vBjNfki%__au(yeeLz@7rWs%i}c;s(+>%UbNXo(#!5I)lE
zBeb~6aB@aL7dO}dSJ|x=YO?@+-xmQ{~OyZp0p^TU=RL}0DQYGb9~3x^+7ksb3CUelM^SN|u3`$qM#%A%g_
z{fZfs1t^jjJ3Y7{a8E(>e@_+0GE5y~`NM!_$hW)GS}-AW6ay}+wJjsd6-_Hz4mXb!^S>B@>>LjWCm
zGV>c-{;rF)ak|%Qm6q!Mj1;l(+JSm3wE-QZ=ARCWkfy2M4(aXzXmJ0Hh*aIGyZSzY
zli;g$u!`M>9aU3iQxxLb3kndF{NlT7NA_u+76aU=9r$Dbj2(Vi)ZTelu|sr|kB$iF
z{-Wj?WTF0QRa@;_?d=n~WGoQ-vU?XkYnemzEgx9Qd+pwF$qs;2XekP4*fdB
z9vUiYDD9Yqm_X;!(su>998WI%#98#(kPll%@kyvF*m>N+^SO|q&{$tX1y`q9y{&R5
z>Xrco$7&mlgJw4}$KFpdVoN=V%H>jNX*zQ(+t3qcT&V!WP1o&KulM@GbUn)vEBmzF
zr%Zn9EN=NTZ9YR~RH}}Ilk$_u3ZLQoDd?^+`}08X`p#?DhhBB@3M!~vz&K}jC949X
zd;!Mq4=^!|j@;quzNrmXqu=2W{F>)Wf_ITsLTpsyJ)@dqD(WEJ7lE*7rGAhj2aKHF
zIR(~%(V`QaL7Vj+x!cU$sgG49uWQD`+*!)zv@L?4_0P?qmvw$*#WdV*ebmgZ-Jp90
zyN-~o@q0ay$>+%XC7RM-P-Y7yTGsT+-RzXfl`QFM7V1s&=JC*BeOv!=$+>;&2kFMJ
zCwk8}uDzmN${2y%&agYP&@%R_{R0<&o64(?QYSmC!??fj??>tzq~pTh!urhq>`?3l
zsxbT&Dw!qES%K}cnX!mKNt0H$?
zSDNNKL>ATu0yq$EmZpW;#X7r`y+aJBaB0s)wKJUPkqeDMihdO8-4n_@;0v0EUO6ac1$Y9mTXAaOzG^%@P>
z^yz^2?3gI)%d0mFj$rD_y5&36sgB&HbS4_1FJ%k6N@i;O1pvYE_P|tbS8aP8USG~^
zw2Eaua9wDcY?t|f#MQ;aHFpznTn(*!5vY&=>a7QApJaI!^$&i1qgUEsZ=i!?O?)
zz$+c`pL#J6-bbESpD#^M5-NP{&G>Fn**m%8uk)Bp;<3Y`4$RwhlmUbhUsZmX>Rwf>
z#gtp=a#v5~jtYb=d}3;Wx;tapYvC$HySaDY;y*P<__hi18bzX0GEiH@#@*m+lajaG
zx#1|^h)Xot`>b||tEyge=u@`yNF5jl`iwQ4sQ}gX-7lb58s7uBLdQ+kvjt#=?&gRW
zpnn{V08l*P-x#|pyB&?x3ihNUE4ZSWEDps2}#uJP?>cg%HIS@)<%u|6W$^PJ7$Vqqg6gr
zT0YtfD3|sBg1Z2Uw&h?S3BpC_0GemPRySZmpSjU!o5B<5q5a_5dNf2bVuKnj~*!`
zPNE{oAYBGpL`9?DI(+~K8dG8?KZd6&X_AcMG`L~1ib2CQ>Rwe5K9KkI0(8w_YI$V?0B3%&%7vSoQq#dHHXiKY;L
zcz)VuP4gL#`}WkS1w?D+9upPAFpZYCLY8cx$%S>@{U7m16TBj=`zG{4rxDSVNK
zE>;&N=Iq-a9e<>LaXXF1K0kL{^fLgr*sH=B3%uU4PXYPe-z>2HU8mybJ%)YGZ^~TO
z07FutHqT?-*ToR5`-{FdPRKndZNXPc-N%xK?S=u-*pHjOOk4Q!>PJ>VIE${A6qY+f
zrrravf|%+CIc86(ev3>&XA%b9im%Fm()wRoP3+Z_TmXWxN98oMy>sqD6>Io|o`^T0
zJLY>>i^Gl}Fl$3}bm4TcZSh7m3VYi{aR$1Te>V^w7jcn_Th&#R0Qd*(|0IOV#s%|P
zh&@vtxCh4oGFTl7sHc_gmC}jf#V5z2
zP_+$W(F=%=g3yC-9*+DwISK}%TPq7z4RlE#-}A*I(5GWUX29^7to2)U`yc)HQwkkC
z6DbUFJXg8=%RjXMR5d%(j2n*IYrAr~FTE@HjofY<*;85P6r|lpCoT@w6+t>5QpCaY
z$5>u!|L*@qCLrq;60(zMLNm9%NmkvfPJdP4(iw~M3sDi|h?z3)7Kol30n
z=NC0)+f=IFAL@Uzk>^Nm09q*{5cuN8l197Kn*N%qOWh3xenrcoYgi5lABsf+5MBy^
zApD_P6P&e)^7d&x64HvFeTZ$654j6eJ*c3=x5nJZoRcEN1S?p#p$7#5Q|1dVkW9$1@iNmwV}E$pcY#6;RMl3
zP$ClD?GU*RND{I1O<7gDJu_`0?Er1Ey1l9nPMBc^!3ntX!JXpXq{kz}e-DX&hwYk)
zVH0LjeTmWF!!1*1r-i-25$u(yhjnR{#-oc1gQ06-;~B_9zT1K}HM>OR0!V@8%qHLB
z@YzVZ6Q&^MU3ZpD&sRGB<622jcJ9vE(R_U42FxWT?qTuaTpAkwdw
z;SoRyu|q3^Kh_OCiHsFlWuQBVqbs47YJaL%6Hm84@=bVkH`G)57y9xId^A@djRsr=
zT~D@HVG#wLR83hek%dyH$J8+L;&GR|tpf>wdYQNL2ye206)6`_wr5rC$g|f1G9Z$A
zSD@l&)L0_uMqo5MsVZpXtq$!F{JFjiPv%07964)^|r}_5_;_u#1!-F(|ezms&b~{Bk7Fx=#ta}AJ^pBd4
zS$s{~c2H|!m23NYwO!>T1odSnYLqrW4Ylwr*W0hz?%XCI-i`$OUHqs=$dOxXe)WykasJHnf1P6{jl_jyaHL?0?lWQ`R
zFV^4lOfxK80rIGe!H0R5KM~xx#JPnadQ}ckLJ2QAQj=E7?ot9ckj&zN67fG?)m$Kp
zXk+Ms9-Lx*C#0U{I^?&fzljyD5Z`X-U;;l`2I!+5+c@#buOIW)&)tcP3$Et^#eU{4
z0>yrauaIxb!qik0V653VUGFV}1QtMjQ40Wy@
zX=}Fz7`VcIIw)*^5K`D31UPBp8WxLu`~!Z$?sw_rpldQLs?!ke;x7&sR1q$#`u@H(
zhQqFx>7$n>nZrm4;)Hm@sT^r5bokRBR@50e^`I!GoAq6m(dz)ZcAB)g?9|J{`58yv
z8R~Be9tn&xP$aUsS!2hd7*i9J1(y8ZS@a^mQ5|`7`l;F4q(jB@dy3KmWlup-r8H$9
z^stwB6u`CW9t5`>>-zfRp@r|Tm|KGNPpWFMqb_|TyxO5iK^-8F%;nVz=&u_^<9yJBvmV!z|k?SO;
zRoP*fVI=lg1rxQ2f6x;DH>IP+3BQOaz~O2!{J1$w7fWX;rc$u+po{`SO+Y{k0jQ5C
zJgfZI(m-$)E7A+7XhRs#TSfMIWP|=31eB%_4yOA`vu`uTYxU-E%%G7woVv(NGd;EjXx81z<$#)MwiMqG%yX(Ild-3D34^IF7=!ebk9zDD3Pt3PJ{i`G7(afE)
z$)bnGR`K)mNt#!5h
z$jcUgK85qldI+=hx#v$eRVeqgV~_Ln5VRnDWw9vFrLINx>=1e>!9PJQyctG%H&Hof
z@7$QMqS%`G+y*n@@tqgp^W&NOU6yb4*wedqAXHs7>1SYRfgnH5#(16PHZA7DW%$%?
zPYSN&-t?Nl#(!ytLoNoxvVq)(+@yEOzIYb3M|qA@u{ATw@?yy*#lFe?ahZ_^ZNoWi
z$Fy+v;AF6$txN9u&Zoo9o=-N$bl{s$Hr{++y`Iw;kItlyHKwEB@#v+>LdxB=zW)T2
z;FIy-snxlo9NN|owsIqgiw>q9`>wz0AL>fOO!~tp4#l;8{oO
z>6?~-}Q%vz=$qb3!>4)?+<(5*SBqU9fbN5bQ}TP?YNy?o=I_EJ-(;%-=P
zpkVpLl4A)NkJ(v~W>^%f`F8^26$1|Rpo=u&PsqNzUJbzLJHO^td>McEe*f38(jogs
zr>}RWzqscd5LaVq-zJ=WQCIFn4^QdBo9^1JA0GSlH?{epzEo?^@8Wbd
zjMalRn%o?sD_>1Hle0{HoEvOzg~K;a;V(z46aM}#4yL!C^Z}Ob4i&(}YBn}iUF}eD
zeh-@tB|JNXkLlP+fr2%?ouIyqi5_g{pzfW(t-q;{e20v-da23>5tlyh+qJcV%M}l0NW!ty}XuKqj@S4+z{Ls4W6deB%O3
zB$*m;R1c&EbCNRrwgGJLASaRIvAnYTWoJ=8gE3|7T5Pj}l|Ztgx*7X`7Totou-{#}
zude(*iq1oKIFfY>$H{swI9mmSBG`W$zq
zN8bG`DyelUGW<9DBe%?FCo>L`HlA(ck4G!Gn*yiNK{?YH!P+PXljt*bd2)8Feq6E!)P4VSK<1R#cq-ia
z-NW_Q87(nU#lb^2DCeCej5(i-;}F~B;7|qTzh#y2edEub+*o<#th(
zGj*3D`=)JD1fgxAF7=w~#qF58N85ireU#c^*@oSLx~%xu$2qj~pQwhva1t*E4j26@
z3AZS>6=W3z^Qs(p!uqIsuvtKq=4!4aGU=fHr{UhuDp66;>o(IBs?
z>T}ku=@Hr-n@)(}ey9@bXf~8BV?~}Yh5Pa#SxE`=_BYZTm^`5@DHGjIx#0!g-508f
zX+2w&ms3&_>Retz%v_8SitabrpejLa6t~)v`yqHSAO*NWp_g3>hA(u5I?^~?D}c+
z7CJbRO=ncQRXF)(fe0?XnY&yO&EFy#JlI58WgCK+k+W;P(W>tzbV7)NMI|LH76f@bg-)sIHK}Mcq5DUys)w>HKvt*u0S$6MyWzHt0ZEg}-@sm)gADD_SAy
zj5ml|JE-Z6ap?5?)b!K~>Dy6u?o(B?x>(w)?rNihfkX);i!#X>vO5ea~NCb$CrgW&{65tCe*i2o61&UPalJEJHcLrqg>|
z)%=eta>Er-{JYr#aQY6FsL1UxJfN0>{>?Xw)oP{{EAD#e@#|-DlC|#y7T)Q*v9rvn
zLfoZZxCz4HlZCR7UW82?^>K;2KQW3Yep(uz@Ui_7)$9(p^3qT*cQ?W*L3o^KsA5Sr
z07ouXJG4zwpS~mvzlv3X@%mAbgE&LcglE~3eh|UuPf>!h>k|Is7U0jDdu*cxVJC#U
zfTFif|iHRRtd-Fcw&loQeY6k@*gY4{4&N)guyHzHgyRvh03e==jQK%sjdc
z%T4#WAlwPOA9atRYPQ@}crGXNQr<2XH%qj+Wlh5T!_x7W9UhB9E9%3}`zg1p^6Sp)
z8=>`qc=UiJJCvoHtlXY6JvVps02cvRCk~gC0o67VqE`;ql`uYi<_~GCXie%h%1YWr
zfw8TG+{kA5cVoA?oqoCezJ`SZjtD3Kp#f06j>97lRu+6^sw%y;kmGN%CN
zWplt~qFUfJF*w9wB=S$Wwk0|ra;iTPe<;cMxZ+#c01e$z>>bh7fSw%3nkOf8XwkI~
z<#lA|<6(X0><(*c=|#dJ2hh^Ocod^TS7SX9nEgyXc5ODx_w00BAQ`vhHYFQGq;1jE#;9p7W-j8n!_6Z_8>6=crt?IWSX5qS5iys&sc&T^MIzJ0i{
zlOv}-hDVMQvarP~?M9w1)Ir;D)1{$S8eFOl`tU{-@?5hDd$8GYe(ol4Qa|}mJS54v
z)(UtjD{%v_nZPVv#K
z_>AefAZK)pi()pbE^^{4NI11GwnwX#vR|ssnebMZwR;5qwIJ60W!V=FYVjhPH~P95
zriW~r#`7JU3tY*9g|y-Ku0&`>L~lJs+I9U5Gq(Xr@-3ycbeFrDGWnmYw%T>byZ
zI{UDs&;IXUTUU8)nXX)EX1J~%T=OY1QW9`mn_inw+f4BRv81#lMPVeM=$b1tpDLG+
z2x~6QP>75a1I^TTmOcU&2#&3(
z|DCyVGrm9`)zRQ5>fFM3^Xw%5lmI?<$Sn*A?p}4it!}!1A!AfTjPA_pRU75E)<(`y
zO;55N@Wz}@f1gk`*W<5a80#6BF0SRn3;5M!Z8RDcya
zfWZv}mnX39%M%KM0<5d)c2&it9CXirlsx~TaO>=F2`|D1SyO_sCYx-Wq(t1CD8`%k
zU@dgx$sbY-k+F-=O2FY`?nD_AzEJi`8f&2FKvBh`$s!bmgzEf2EL=FNv+;N1gh5A1
z2@BsdODXY3Vv;D7w%awzy}O-o6VAodzWxvf?PyoIGD5SrLNaLlc-x;_;GYYA6;M|G
zY>baJ1zOTQlZp5STd)HeZ!|#^@$S%p#t#4Pp(dF(R{$M#rN)}Rw@lRKkA)Q$SMZ?}
z-op2SNIlQ3Y1CYdAnV5Ts*6NK6F-EhRI9_a4nF)RN8u3t!pR`22n5=Zkwb#^#@G|Ys{>;DQqN;h()>+ma3vaH?EA!MXcuoLwYGQI3Po5l``A?9Wnhx)H<4Eez+i};E)q|eRN
zX;d~3KE+7q$u$q__5WapkB8zIS+n(!urBUM{e36;Lte&8Q_|1Mhb8Yrk$3&Id@Xs`En%S)&P2ut&wUoMPUZA%wy;
zgB0f9*^!E0j$m`*eZ1~E*$#!X1BK$xzriR&`)-dQBI9U>A(hz#nUfxPFGZ;
zUC4b;gdMY;-=$YHnI1G8XY0FBpcYe?@rR-+v?~llPUvuUia%VFJ!s9K3Ddx(T(0(wcD9goTnI=k3T@#j2Q;FECk4`SjEV-F<}oMm#*IDH@Wrem4{MH*QutVJq7er
z8!g3x@!81=d(28_r}Au%W@)oL6t`q3%P71L%KpH5clV3R3G${`vaH#k|t=l|xP#k|t6f
z2@anNiKmH&a>t&op0s!STuPlLWG}V=PExs&4)+WL(6jj2VDg$iCi5NL<_rGjx5g@=
zQgV-Kn`cv7@=V%r+R^}HZ2(d-0*u7!(gx0vy70OkeVGJPU0ZLldO(_E8z3bpX3?S3qe9kPN~&eK!hNwgo^O8j7>
zJJl&~=D)UW{+r_315_@KoNVNE&pNlxIiCily{V@A09`GlB+*}NjG}Q{+&^n4I-Ybg
zPGc7Tb`T6rLVnGj?z>TYz%wXFWC~z3+ZWZe+|A;4?X9m+Fczu9h&P1|AX&S9igWz+qi`m-044VRnpvp>GCdmZobl_OF$A1F_hve;Gd7kPs^N{bVGCG8
zP^P)JP%Qc`3e@^KbE(}CL?+3*zN;Y5HJ$w{diGaahyNC3U*DWYjv3S1jHD%F%!ZKz
z6f;k16(7u>a4mi43`>73&GwZ3U-=-aY#*y0hUH1S=z}r(>SKg`efsG)!3oOnX
z{AV_t{PHyD@%YAI>)PP#L~tgBG_u99N%_6}`WPqbGCY%1H!!T6_j8?(5|!5*V}Ax6
zM5rIuqVUkANH+I&@_QC*ds6NUWs+?xE!!(0#C3NtQ=>;NcFDXw4Z`DL>|(lZp%Z*P
z8_4tRnH_p0e7QfMuJeGjxxHgH7HT4IzgXmn
zf$>xQGoKC-Y%b$p)g3!pV6olea~1G~rHM8}!$}Y`+hM2y|t<5M1$Ti!3xmij2H`QZNZNm_SB2|WKN#kWPS5b
z!F9#`8NzV+%jF%vBfp?|@tY21H$Ht-IKy8P;s!ihm%CG=QKHeF{k9g$V#?-5CbaZ=
z|99quf6PyhO&6Pfm@VEho?b`@gnfzv#uIdK_{Bq_v7||OSoCId7k-_K%oy*{2!U=e
z0xw!|CljI^FMpPOvGR1+;MK;~wW;jQiK=$~_7NTGW9+P7iOok|n>=c3N4HL27dlH5
zyO(t@7w1HUd|&@D-T)?m%m+@tM=+-b0~(cG%%3p
zz$_jFuT=Y@JB~NT>r$i7&i!&Y_x8Tt=T~D%I5&CumhPf>_Nx>GNpzQ;BC6<
z9VRZN+H|c^yu{bdm9(xdeV;9r^tT6wY5S=C`gw870FW~h)xCC*22$&<*3g@IXzJ7@
zEBBR$``Rj>Jq&hBk!6Jzg&4|_bnNdXyp(8nV3d*ukO2kea&H@VKfu~IL$S5m>bF~^
z;QYK^8$uP`!F*PpAN|ABSJVO!s5;~B)EZ)?k2?k=lI{7PI(%Klvr{RA72x^Sw`Uz>
zu_+n;9X*-r^K6Bar?Dk+Ss_STUIoee2BbzYJ&G!%ffy4{SegOZyv14V%B7{Pio+atGAX9IxfGQ-PdZ^r~b}^
zoPPVNbQj;CLOA_A`NFnkcJ}XV#LqAU1wMDX&_Ov@-1rw?QY+^BKPl>i*AeH2+9Q4R
z5zg4d7_{wkrw$Tc0gro+^-YS%x9zEz-)^LWafV)Q0P7vHmNvzl8h!P}roE#xI$zACRe*^}u_5+p(9VucN$~N_ha4~
zr%tv|O?@>8V$-H|GumbO&-Mnou`W7sJo(B;SMJC`VL{X9>TeJ0!W!+}liew=b4Akj
zNZQTr0b2xebW5rd)Z6dV68&i|kExP!Wy#BmnwW}~ZuT(iC%p=5!LUGm$Lq9R#
zs&n#uzhteOG1g3v>uv5s&NP2PC!2cgf^@YhHXcEN`9=DGV@aLdxZt_4XnMxlf!60o
zW_}&n>wN}itsk#%&RzKBO%;=P3|bE~A#`w=&qKrPpUOkUYs(7vLoLWd9u?{
zc5chi1()sB~Nn11!=_I3gwws=BaO#k2NB&Sz>{!H1uB`*f(5J)|57ON{h(s
zn;@|C;qDnuFPod}cqx?8gq*$J!R%^zTSs-QapJWMa~};RQ_{}U4ZovZ(L2x{rY57{
zR8zTqjROQ)E&9&D_xiJ5zx+2P?gQ$M=!$Vb@>G@`w7RFTJj89@shac(
z%N?11FS3pNu`OtxDYQa4aQ3cW!RtchYWGbiE+_eY5L!0xZgWd#eQDm|HeAmYBHLwe-%_j?eGS6S~Ini^^lO)fp?R=-7_Y=Sku@uEEXbPUGk#3nzHF(o4|*kpRiP;C93v3(7@XdF>}*I%O;8{
zD0&il#}E)A><|8;bz`N~XMKm{eyZ{()i+`s(59{3gKo$()VnInRfV50W`A?aFB!eHR%zGh~m{Y_r-5);atSOG7o0SxR0ME;2#%*(+My(iByq?{GK)>
zn?JcjAE>PA4J?)k@{6!bWQlB`brTD~;y
z*$VZWJhdKutx~9#Qh9IgvQDh09Jci>h#{;wSTl%*#N!#z=XISO&z=fzsD7HS7p%cD
z-)kKNrDR~K?j}%kazm%kghdJWwO;@Z2Pl6^NL;s9TFv$5=E<*UZ#56Tb4hzTdNipA
z{8S9QEV80NADm9uvd@@~J!k5S6q&y7g8ZnTa26v-*on3&nfg2&vy=ugpYiX4JU#X^
z>!2QPiEvtWLKt$|3G{i|)z+T%^~F|eSVl&h58*{r`1|Fd-+Ufx7(c40=@|_dT+`=u
zz|S|H``G+C<`U$Re)ThOM%MU;?b$0McGQtrN`ese&k$?B{orlc`;L_0&ZqpUVGvcr
ziqUpV%T{qzH0}MHrhmY7KNi~i^k*7!V_@ssx5<}>uH`=3II+WVebI}5Uz4ur;hZDM
z+pp0wzo?#8txc!48ay10po8LX-4`O%jB!=W7b70~mC9G;D8(&^=@;UxWDDDOLd85n
zq_jNlcDz3awZz@$SlF#a3hI|h&us=J^YMVF24uZGt_U=PK$1VTdz>I36fsJ%b)bxn
zt|-W(W|79*1Dey>-5k#J>~|pe;%x}q&?{w?*0JLFf3<=SM|^Fri>J{NF}9~$pP=d*
zG~ronx)(Voq`gi-aw%>OH?Qd$kRmcH$0k@-r+&9DHlQ-&nw45XT;9Qu?q2G?+guF4
z0fnaQ(jGeRxQt(Zd(`RQNoVJpyp|L1?Qs)DdAbS+;rmeIzsPbehhP0^(J(n-IKv<+
z_o!oRNA3nj*PH_WTY<#?G*gc9F0U(UIH^3M(E}TAC(+ug1(rlP>)BH`HY#n1?gN>h5EeUY6P8$VNH1qM-SkqJAjvHR!BJfefM^M^Bqn!=z
zT!gf#Bk>$OFxR;ni7gP%k>2?v>xGf{4wEk0!kjl%Vuur8^xG{rKJ~?N+#bn~r+z8b
zj)44zS}s21?U}7DZ8k$;P*S}P>q>yYTe}U5lwY3p1Ul$gK0FJ+gBwEkXiY%5lXNwt
z+S)V}c44SbGEmdE3{s;N!*8-K3Dz14Qmx-@L}FEUPb){qR{JjBoEU39nbN=t!qtzD
z>^>;QcM~u_>vFh#xuG*DPZ#b!JGxl9Fo(55gWZqmt(T)=-*j%q<-$ZupZf9662*(i
zwUJI@G}mubSk@jIg8{4suq-R<>YO4bCyX$wkqqX})E`KbEki5HdFXnwKLdjKSu}tY
zK=>(haW~{pJr(
z|FrMzr;HsVkz0@!1+w&O(=Eu>eemO1B`A!6c9#P?wJXFwA4oc<6%D@0RgKwTAQptM
zd_epeAUyONE7M1~`zF!Wo{zoitvQ0xo9p(f^Ht}1#38+!`=aLZ-anPp6vj}la=nc(
zjCb#lRp@1V83}fN0o_U5vyR
za0G9>2SFC9sR@)KCpa%6c?=N0s8@fq?7aT*XR(^txv;zK!47!abM;zJ1MPmx_=xE_
z!9OS(Bkv0ncn!S@&I_-%hZTE~O`Sl2q}>|YHU4$g_}LJG^DqjCja@P0=L_}_5af&jRJ;AN5GRhtO|W!v`pC~l_&AEcvJZm3k9
z^_+D5_|gfzZpzw89cEQcCq?-uIwy78wm*v-x6gf6Y~1R5KzQgvlFdHTiO`v23+2@A
zD8zCfb~-&lRNum?xsR-AEJ3ZP1Z_K|c9sM>7ZAMk6SXx*6tTfxdy8<7U$MzLLN#Z#
z97#iTf}ghXP6?Kt0zJ*F;ez}kzsVutm@fDuN?|*M022}9nXx*3xUhb}
ze~1fYK_ZT^lt*qF@Hh6$U(~5NVeHTg>u|!8Fqdk!M;niqMBQE$X6!2VM;UYW4xTPV
zhu~Pg1?6>)XC^Jp7lvL%`^`miN|jvG!fxOulN^(iM$9O{rn~mrnG_NVMChp3ziWII
zf{O->*tEK_8L@XRsJY#Z`VOvCK_}q(2Ca}d=rJtu3;HRUlsW%o*h}@
zWvFS+3L+DXENZBqsNIPLAR5>I{O57tF3GpGDF-?w>u?yviBz9v}B0@1nt3{iBz-8Q0suc>N+<2jq_<#@yD&bLx6EbEedhg)&)|Tg=zxp%$X2;0h
zXAc%4Jb`vxb~u+{TqXh7s@^`SOMFpO!8ygD9oQ!BH%fY=8X2$@SSiUkN4pSR2?YP-
z9+p6;dWa>HD;DmStWHK@h~|e_6}(`mI5<$`nzY^j|NZywAoDPt19WApn{W=ILyWPq
znQw>F)&V+DTDm;W>VTXXYW6~OQ>-NvQKzT!44eN-3d1N|t}l{=@1s+oOL=3pDbeP)
z4cBs23ft0uVrhX90p+<{{6SbWf27nbqomVXgFfwqPXiYnoui=9Np^_{{?_qgp}9a
zKcdzIbkuf|zAxhTou@gBqFqzeiJ(?m@0+YKwTneGHfTGWLg`m51L>a_ZNS7-(V8s2
zp4D6Kfwe-|HuzDvlmwPD*)^TL5}zp`piXzxtH%x%8|t0K3wR?FnbkoIkDqXs?rBa*
zc?w$K^lDuWvJ0kXb(ixHJp3+yv^ARsVrMgcG8(~SOUDYtm={v&YQymFAmIEAUbkz6?2)w9fs8XoTifzpXn$Q;+WCu>7)Q{Oo*9lSKJ})jH`LZK=2cxW|UBM}0c(Kkd|b4Ld}O`Z}ZRP{!IUW>9dnKj1ALigIn~_^xZYw$qE3Q`56-*4#(v
zYrdsUOV9-|)ags6dqMQ#At3;W7#I5VYKv+F)s&o}YXCHA6}EHdpr}g9-2_w-Y0s)7
zL)ggE^lFex+RG4zvYdKcn$g#Aq?MAUST3uIh&lV|`Ga7pJfW)YLSESXm%ye*r#c6*
z&~%3sZeJ8cZ~C<)E;@jYc8K9cFjM^9vm?u?9meDbx1EXs0EuMoYmEK5lpFfAxh8nD
z-p&#$1Ns%Jny24N%7;)Tr4D=wp9q<|v*o&M*~t%R)WnoI@-mVO8*HEXbV@RE7DwMc
zyPvvY0A;}xpRuGZITvUSE1R$r9mLum-8~fw9htUKHd7SEw7!1Z;okn!Nj*Q5a9^<<
zcoUVbVT6?U3bg`vJK~$ke+y@0j~=Ztx73^o2`?)|ZY7
zBB^6<#pd6o%YZJA1}0pnHU0mJkRvHvI6C2Yv5#LN>#YNvMy~{xT}oL)WO7Mn(D8?(_={NESn
zx{PpIv-lQ@L)&u1t#MqBJoc~s2{xVPQz!(<{YtVlcmmJDKBV@k$8Oy7^etI?DSHz8
z=v8o?sRz2Z=DL?F8Q3m!{);mU2d=J`={o{?=6~V%Z0Kh9hLq@aSTsaqA|_28O$yd)
z_9E%43!O6^+(PllDVfUSN{{)&s=u$_y__XXD;JJ=KhlOA^s9#u1Wi~`i2sm%)2U;Y
zpvH$gvoL`IxX?KpI71xcie{hWb!aZM2qji7-p4X6bW+-@)#a@c#y}oZi4qL0F7K{l
z!}yWOmh@AC)!hKl1G)9qBEX6xAB||QxgMS&ik;2rHq2^9xp{z&dh^b1B;#w0MYZxP
zIMB9rz%L*MOMI$lkys40d@8r(^kqkmPOF=`UsGrRw!i@ipsUS&(W2S>^haci)w1hl
zKK`QRc_#%U4TA5}^zA{q2m}vLLQNL!50TDN7%!(gr}6`Z+EXr>=-!P4`WTr%+)}#r
zrtE>@2qZXv4fPAe5QfI$-$*!Y9w@1v7nIQHVZrp`p3n_smy`XYzyzwUvIxS_0URS_
zrAzfPdiC)Z3&EBUX=`n{{sFDaqnO=TZGl@`{q*~I?%;X|
z2W1^OD|{&!h)Nt!=nHAr+>}IxA{RS9xSEv{e|d+CTJs6A0hw_8x_eDRN&3K58;k{z
z#9kf>2o%+^@m*0|7ziMAoUdDGkN5&$;+$qg&?$~WT33e#xEW~&GYcBC&6D?A@Lje0
z6x^~wTYBlKW5%Ah#H(NZ@p2pY-q$GvJ|z~2=Hwy6xiZdW!7LX*fg?qVD6yQWj3kMJdT4*eAG3l_7*}?((>@Bf((04=}TbK96wOck@6H
z&A}f)4#T=+)aW1ZMU9C8!^ONK2~cNsmRClh|4by_Dx6hh?+NBjQCo#p8t6wDc=yd(;dmFAsXNR?8k*5KVvCQzHuO@`CL39!8TOEN2068Sh-+TZy7p
z4!6ISa$ZT+MHC>Wqf-)wo;U5)%b2xZ#I92SAB#EtrE3oGqTYW-Kzt(X!_rE*3sq;e
zEYmJFg3R@$8||O%Aw~oTpkfLK5%NlB>mfVb(CFAu-s`iJ_)tc9So#mqRv;gQ+P|l$|~O&GQgSY7IYp`ua)~5ZfLR~
zJs~c*VI({Cvqg7xdtPYYLj%kopmk$qAyRGa>dh(%R0D(&IAepKZfYRXZ|;F)cVkRK
zTb*9kY2(S53w8EPQBQ97P1=E@!B)8GW1&>j8TV`yH5LdBZXVLL?Yy0oleHzV1$7&8c4BgBEgI;}nui@s5BeKP
z8`hO7zoELg7g;Ayu*&=xE2G`Rr3e@BQ7s)idmDd_buB1GCrKK;Vktz31>;3RH_FFv
zhTzTv?o@67*0AQ3Ux1IFy9GN)+HAAvC9Kl}ep6YM-aNSwizd!hubwH4^bji`x4jw7
zp0gTz{nWLvE(9sSAt|!E_OP7){QMU6r(jF}I&qeMw6C+n$=4?-;qkP~vU&2b6VVl&
zFfOWBRy;ykpcH@Nx>+zD)ERJA9eMD7La;ZIkQ!UD)>2O)Lo947sv3jMy?2zDcX|U;
z5zm0G0NkE&;g7gzhT!!LecQ-i^m60F>=;*L-$NzZ945WVZHgtXqX{cxm%#!-H?sz@
zxHKi3<89LcdH%Zl?EcB^0Uz%T%YL%wALBb(9Qfo8T2+ucgOYF~+P|;}XvAeY&QM2{
z3sKerq5kdhV04e4-gWuxxXCtz9poM}6F@Z6(HX{CreN#^I4DL<&j1pc1LE}8Gs+^~
ziWV`-yVp)JYqWF#Nqxyla;4()qO-~VI9Elv9jBTOTV|aGfdZKNPZUnb%LTZJT}

zPDH4yb+wzK@-2Ys9S~0j(x|&?u5%xSj=fxowk=Kkt+RWpY->0(ouE@bzhN9*dh&`>
zU4Y6*7a+9Au5=dLV=`YE89OrGH}(srPq@H*r32OJY(lJ0-j_C;7vzRZcQM^OO~T{>
zaU^RvG8hM6`!lBUlXvl^xasx%ed?0JMAOgvBc$RWw^EwW>U&%!UuqlcLWrvglxYsf
ze+)ExHPd#)(Utum4Zi+x+>RC^Hx}B8uj>q~Pr+9|iry&4@BjS;dPk5|Rta#te}4Q*
zff9)Q4PlnmP$Wp%JU{lo;X&k#OR~1J>|q-xqqu=~!E0?In0@)phQ`TfZwr7*PQz_g)FJkv{=;?Rd^R)g=-A)yVqx8P_?KU}g|ghCuXb~c4ka~(4F7o{
zpI$~tfv&H`T<%bRK9sv2lf@
z^&W8T(z!3Lhe%)cWRCgtv7i7Mb3zhJD
z?qxe*%WyYC82X(xP8>2tJ5ig6nS-Asq&cKqz5V$IGruO#XlRs0x&9q2{swY*^lFaB
zaJY{}Rz(;gfmJW69Xx4TdN_R-w|4&8m9f<3^}}Kma5wfH%wW)ty4Fa{O!G01u7Xoi$?8aDm
zK2Z6V8%!15J&0roZa61Vi&6{tF!ZBx;LUZktLf(BujY>Ts74~+dCk_v2e>Yqf`gpH
z)TfFLhNU&0xSPApKm8i*$s##@@3Sy)Iw*b==n5JzQF}?Z0Ee&E-CjJ=_vn>VuzsS=
z*^@|6zpWZ4Xk#Y6N7}Q}$DG;Xhw4Nx#TVPYyX@-q>9N+i&krY|6dxBt9_>jCVQY9t
zU~m?x!@1x>+WX32u(}Tk)7l}a&K88E{LWxY3DsCy+IzETyVLwo7L>C#PpZrnC%CTs
z#D<1TXtIZ|Py3_u$LfIEP;vawuDEx;u9k_B-3`DYPTj=>fyV9YfeuB8JE_xM^)*0#
zSx(DB`laJJ00A@BE=HI*Du7s(&H`Lz{1QO3&ZyFXIl4)_S$gtSJH&8&CLqcN?{H67
zZTH)hz}8f|05<8Ry76-1Vw1XHA0VLxTQ&-&60_qG^JVRuypw7%V`fn#-T8pJs&;go
zrp}~U14L(oIKq}cvNd}X*~6@Df~B(n2^8lwUnYeOO~!fdnXp`P(kDkVtq&P=orkRD=r7P^z?u0QUJ7XViW>Y*?HhsC_i{%Z!UV_
zPt_(FG|Ox?GxZm!fKG>+aV}K71KOde%mA;@oODaP0n9$kNQx?vQ&n&(p=o$++9`1@
z{mTAe%9|pQy?K+4ZTDGM`&cnnHBMr&ev^@1YMO(FV=Ffsu2|5q4u#bIgCJxNP3ty5l!Xw5E*Zl1%c5=Y)^B
z%E#X8yK|EtIsS`qoAN4zetdmAtzvK}Zf%QyegvQT;-gzO+Zc{8U~27O*95PhCk?MC
zJ<(^DJ}E7Fr3ZLij(ggo^~S8V`lA~>>$Lv%>&__E$Lfyh9RQ!Xv#_vm2M9YQaL@y_
zE8=ZY%KP-9H$YR+WrOCzzMvjj_~!OncuNWZg3=8KAFQEOHlAe+1{hPdnRg>*zFgt3
z%>T1#xf_Sr1Q#EVEyc{wEz#5t+Hjxi!D(-MhT4-^C{Dfond7DvL`!e>{WD!GwBIZJ&^+oAqlz0c$D
z`#+~UjM5LcipyRQ5F8$Yo3pcFTsR_6pEhV|MW?&ITUTUEDXvGo(}k(=URT$EH~ozOJggFtEqAD2kB6hdB1ub?3-p
zOpih}l`fSpdC*f6syu7ninP+5x0c
z?(FXG8b8@50W9JRcsJ~eBnOm*GDuvEHWx@l=Ruy&Z=*vL{}Eh^@~MUU453ls65y^?
zhTqz81$ItWX!7jIf1wJtsy!2fKIB6Tf*C4KC?wy_lBs>AxZ&xU!|puuT$?M7EHPfo
zb&LyY?m|jkR#JW)nfffFVoZo(1CVi0fPgEJnAuW`xmEc_mgDN#Ny*l6
z6EH`U0S5mZNt&kgh@HvYSP>(CLwo(i;LJOZW8P!haYLvR{q3)a!Ar;J$geI!K>HT$
zyE5dwTZSupa8mM{`#!C9v!pXE4Sj-aNQRmc
z?pS0;;e~zPSYR-%UTryf<&SpZ{_B7~KYa2^wLtdl1At}Yxz>j#g`2*g>V%G4lo$O&
zG#E<@?@3e6gE;3iwuroLFQ5D{M*r^T)#;CX`Y%m`o!sMMlgVjg!0Sc1bj3mc_2Oo2
z#z^A+v5)h&=H+0tZr-lxSVQJ!)kmsq>h@3`*`Yskqxf2+2{+M@#8whMrs|>h
z-KYq^wi^1uTJ`dP`PmUS0QHnHuQ&3?T-EV6RugwhFQKnZi|3X+s^iC}qdS1ih#uH+
zjk+|rl^N=zIO-b{OMvnaSl)G1e1bgw+Na;`>Ge(z!C1fe%1lS-2hu9M6gPS>58!tc
zxw1$_Z|>6X3H<%P8dMZW=HUEaKjT)K5%&ds`q=4&vPYHpt=qpRZE+C%n^BM52+t(|L-B68qw>5c|G~I$@!Tlsa>81z
zQyjcB6M)yeQ%%R%O6`X@$8!TE=|v!`IEI<_b*n;q2I1Fqi?DNG9EvZKpyJY>L
z^fT
zl}33YTg@`D%^s(p-Mnb4tdxAL<$nueHj6*(NrTeX#2*=JZRuR?N2Qd)inp&$x0jPT
zgi)!N(!XlAUbgWZ=OqJCDt6UjVsq!AAlN6#6~9xkl{%xv8tv2#?Z2?_Af%5=eid4NzlGci_!tgzRWbHw$H1u-#a|3mpO
z#p~qjtV?$lFFIytC$fyI;d#x=CtFy|5~rZd!XJkq<+z6HfhZ+w#C<_qii38m!g@Bt
z27~*nmjoxmu*eV_7HR9LlIoJ1Omgj|lfBBfNt8
zoOg-l<#o?6gEs8>P-N|x={SN@o)u&W${PrKP|4uc)1bLqst74XzEo@h35xR+Oa!J1
zIy@j1^h+UyF>^N-pNSVnrjDT@vnL&glkf=J0Cd}IaR4Ibb)Q;w=v8(vY#UHRq`nT+
z4^h-PQFQq0*pVTMXgGV8x0PXSkbG$C-ST0NXVXvdnJcs0^UAkhXB86(=^0-gP;`23
z(Vv=X7}lNvIU2r#`7H(9bVtk*$FfMqH|AyBxyhVD2I%t5?S+)`QsCqdf?)`JkA}vf
zg}eUsO@X~IsT1zSd~ZDE3DCMQB*WBCfuel7uWcQ1?HsF2XcQOFZ5rO
zwbyiqF6$vZdS1SZZLgbumI|9C1ChevQQ=#4ApAPdu`V|wqrjK$G=t7eZmI3qdaaTF
zushnRSpchv6sLY7y&dnfGN8Uz#Ktz#)kd!xybtr&cC}<4Qh)8jnlKMO!>cy0Vy@s(
zOn%+isRk?hsrb&uxOGFN&#xWj?6aa*_ny7|R}=RSP#hce|MbTZ?-pZHotQfZZ?z2_
z1M^D}QNMI@-HPe`gFwY;aFS@@4Gl-ncv#FojNWvfDbiZa0tLZ9Ai0H{HYxP_S_(GO
z&I1`C;;kxil)npBE*l-QFLD}xTc@^RlCj$yE=z4o@1{e%vKRO0zp7$#O5yPE6<`Hs
zeP2*YeSD;vjWTrn*Kg-&ro|G)W8>yEhEwJ5ej4&ih=x~}-S%URbUs$J@RA-8Qb7b0
zHL(|Ymqs-?QDP^jlu^L`;$M{R%U=p)O|hmA8rcqMhtSwAzz0AVg4>bbAghqHG2i`m
zf%?CNAdO(l>OJO0voJXAzLEBm)VoZ(TtJjNxJY9}Io`pEa@x19fAkZZZ
z1aO;u@TttJqAzlM_72vC-jJtnYu_y?g^tvEH2To`KFL+d3P$cd+Y=WpSpGleISpF~
z8SDDxgAfr#ik$ufXkWZp_IN@VDXI;%c2Ak>yXE-X1pvelwOPI-`D`J4LhUl1?Ri0{
zI#QgX%K<~`?Gk&g7KKku1*EB>is9OXNa~);n-(iUbnja}3gR{3@=OFoL?Yp_0nr86
zA2y||&dw(J<7~szO`8yO%-OlK$EQC^gpJ84e*ii(#V*9-sVB6lSy+GH*OI>0H+Y(l
zf5`;!I4ml@;IFZy|6cv|=GBey$}N(4i*UNfaTbMO#1pE4`6@dCKz=dMrMklir=Bv%
zQ?^H)QwyL%9JT$3cbL}T1=V#&e+dYtmlF^~XuUD2*IPjZYNVCn)?$+7mFdX~f$4@#
zSt?mKa8|_I3U8L_RkbshguOK&*nD0{!++&B
zKmZ$GT|E;7xIwu}JeUI#V#f9W
z19$n(hv1HJ^UdBT^5>eJHO6Ewz#fAGA35ZEIjMd;$2%)yZgymj77EqqWJko2b2m5|
z1z+ylhHu<-9csApoWWRIU*#^CL;z+df6mL{Bm*`JWB(&D4MIl%KQe0}#xmsPBD5fvSX=F5Kr#`8gL7JOv)%HUO!G@_O?h8VTiMO2t4~eb>lr>_
zMj*`>_bwa&poo>pHc=b*?q|Jm0vjAOvvt~Ak*Pn9Qj)t6%*k1S7n+&UbFIio--e1d
z);c{cxSpy1Pu`Fh+{-?IFT#Lza|>J`E2=~rP0*w1)3}})Rp)_e17+z?ws-RA*m8PT
zQxIU4Oec%DNjnM+{g_c82l`_PP#-0Aq$WfX$pcjhFB_EQ%p=rYXVyaYN}DlQ8jt@U7`3|S_q
zllqjnoZc)x449sr)yQW>oeh3W++3g9xj?Rr2u9Hxg#AE$2EUHx|o9wV?L>-w_d1A{tz4fnjYx`two#}~fz$hg21nIr^f
zow8ZJ5FXpJ1+bO?^rL`EFiF14Q-lq5FGwv$a02;t`?N0LbQ4hc;ELYP6yq3skO9_<
zeSa=C8OeDerDAu#!iZb48fnK-f~>R
z8@g??*Orb#N=!i40Nni{Hl2cBZrMayqKvbAnk5X}Q8HN-UFB_+UzUX!a!JS6(?$t@}A=<;w>Me0p(?qMgrHC8LLt>1!WK$
z;qbHxS>SMjc@D<;Ld*R-RqWM38Ys2b)-F5)e9E%Vy#H0CqIruQsyI@}y=1tIR{d50
zE2%O{W1)$Aq;hR92S!O7Ao!o{!w=FRY(;Sb^K2D%aQ4HV&bGh|1wzAAIBmlTAO?RM
z2932^mUb%Chp6ka+)&Atbi$V7gAwu@yw!_`1*@;ou?PLOqn=a@?Ri_eDY!=<%CwI|5C{c44d75_d^MtwasNu(Bz7XSaT@#r&TQQ{PefDUnR}i=lneL3S2o
zKbc%feS$ZeTjJx1p`07#SB|pMF~mHJ9_-KvRjVYz+WF9I}n&^76PrEx4QAn(*-?k{7l3{PA}OsOx>
z|4c%sBAILegP0;B^AD*l`jZh?J!%M0XCz|#J7s;)JN@T)vIm-a9p1;|dtWY*ngOOx3Hh$q$9lVjG5cn)m
zro4k$H%Yaq!}Cj3g<0-PN1o2xBO!ud_0E@7QWF+w34Q}4U?$DWiLHlMaLSg6z7V7n
zFp?HpT~hHQTm>oMeo)>UUAcMMURn>A)!&MdN9_-=jTj)Nb$y>p+`Oy4IoIGubKmbt$dRgXD8yzbCRwY+MzDOj6v|>D
zikUr!+oPc#SG4JD+e9V&d(p+w$_>Sl|I@t_v<9MV7aCnr*zZn?)By&4Z^J2Sn<
zv9O9uRPW*+G13_Iy<@K%qSaafJZAX7r0F}r6~%t+HVE$?MP_p>&O5sXn^$_JfgSt7
zPhN8%E9^>Em>9HyATU;;NT|&3?a~J3p)q0ExuBc(fQTn7lagM;#Q1f@Ae3eX-vN)BbB5s@hZf3saCd6|ez7p|I;Md=EYFpDw+_PN
z;GX;&!#YY{1;FZ-7GTY;
5pNgHLG2GX04f@dE_fzhrfD)Cb*raeoCa+P
z_P-*sm|-)wlK|Z0@i;D!S6_r(&|$gq(TbXA
zdL;YADw(FP0z5QiGGeO{n-2V)Y_(fZ#rlVG7xQqGtn`*|>(%Qy+)8*JWYD7f2ivRH
z)ENVRaHZLRN^&?Gt)TuG9yDi@v9y|QVi7!|zyVkFe50*rr9wUAIMyjKaii3Z?^0gZ
zcv07Zaxb2z!_)0%QI)TxdqfCG7$Aa+w0x!D&#?{Kz)3jtTqw{Go$ET=yoxW_lI6Gq
zm`X+NaCS7fX9oP*+Ka7m%A8pxz_ebnyrnCX=VSl_P^O}T@)OyQ(|Nmb;^I2qNb0^_
z8TFHd8xmCHyZrJ|bfU6ssXDD2%cib~WxUyk%$p}rzXOf31|{iowSGXUQYOKAC6fll*MIpFKy_86a4S5|4(_Dv&*I3DH+#5ZS=`AJh$z=%3A@f
h(PMGq5^}3($B9ps?bW3FzXHdxKc{}G_*3TP{{UpXM-Tu2

diff --git a/priv/zstd/doc/images/dict-cs.png b/priv/zstd/doc/images/dict-cs.png
deleted file mode 100644
index 55e5ef518fed8b9c598a79ec614c8064be8edd7c..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 93837
zcmeFZiCdG`x;EbZS!K5<*}K%D$Y8fsdN!4zjDZZ>Z7WuRw56JgkT~o^m;^$AK*n8Z
zp~z&*vCN4YB_fdM0c1!>ihz_#h%rErDTY8o7!n`}nUn9et>^pw55IG*i;F8HYrQLL
zJ*_Ad){_``;9l=*z?)RPriKPjX%}A@y7q*{dpJg7y6Mu%Yk2i!hIR_
z&o@|O9xC9)TUjU1;of+|?VVRYf5On816}^{#%G@#`zrrWYqn#LE`OH&K{94h<{o|!
zGkZe+Z(pVC=HwSavEAQ~=KaZ9_*5Lg`I)%!ec5QR<-lLgeDT*aoE3HV-d6hyzEwiC
zNgTGNYP4NQ9|Io<|DzcT4jB1Vn140BOCVOIzx=&D{Kla{f9o*O9sdEz56$|cZ7l7v
z8mJC~z@qfWhd*im=5;IG)8IBblpXs&{Z|i!``55F>Tuz%vEQ0sXcj8K?J4-~>n`lf
zm)r|H9!C!OVmv&AY~&
z6|0=cvDc&i??iUlmsTg)V8^R{x@cWRJIqWp#k7RzpD``X;2&S8_}at?r6I@GGT(Ew
zn;Qc4?J$ebJW8F=Kpd5D?MJItlhkpvf$!*|MriDoI=e}eIZ3w@J+ETy@AGZy%~|h_
znJ&Ke{XzJq(1CX7(U}Yin=Q5N#Ld*Zoyz-q^UAHTe%t0zcs@hvtn#yLLa8_TXYA%=
z^W~pv>FbVYwm+%K5MAkHw7ZSmKySjiZ;fdk#wZgxP$`t6?`sWG{%PY2Dq5&BKgO7?
zd++wya`jQ21-CwFQ5yL3-m)R8!#jq5Wt+plK+%LPXL5LA+aD%!q3ath)v0}ERQB5N
z=BEL(;&$>b!~QUusVjit<<*0&FMj^LoquJkU6c4x%#Pn1=an^Q1Qo;o=#ifW*qwIL
zTw(hEJmu<(D~gTRJu+X7IUg?#r0;3?t*yN>caFfr{@QfgUX6KvHB#}~Qs)5EP3o#0
zc-@2B30QkU8hM!XhqFDH0Vci{iZj0M(e-M~%r;HU>#vsgYT|QAF4WiVIr+*R+Vq~<
z*Iz9InE3xL#vl9qzl-tzSIfxfUa*@b{Q2N4O!)t}{fnPdcW7;!`Tf?dr~YBkgjx{(
ze*zugdn76Z6(D{Y^Crf&_}a}eJG7o6Q?XmL8@J@;Ir(cZd+~F|jsohUSW`Cae4_t!
z(xtkEydD3~D~0WU(v(B6{IAnrZeINidpIL*SoxoqzjONCjqN?5FAY?lD>o`#zIjzu
zefru+$T!h(rSR8bccZfNn-(dxlj5U0twgt8;uXZ-DJtat(S2-}Juvi{e(47EEKeSs?)b4A!gWiv?7py%s&ZIoyJtf6L1^Oq=^0XD^v
zVq*MtSexIUa}4sZd?DGR!TR#`0!f9ttTf9}P%Mj{#5?pQ17XeYAN}W6!+ZE368geQ
z=AJRh>yLUT?VxZHlNFIXsw3s9^+B39DqueT%Hv#ZmUifN$||;{KlOj6OX2S^mWMvX
zJ(LpNd!$>-S;5?`m&IWX?}>ZbFKxHr!>!}u=BFUq9|yA)c3{Ke9CXIxU7=Jn
z7TKhM***Xsk@$UJd3Nvn8CzR7@(8z~%GbxXVea43OW{l|kQ?^u8#iZo^Ekr!SQL!=cDq8~V3%EGzT4TZUVgeQW3Osq)>$!TrsQ6j%gl
z0rwi;P-gb%GFka{KfG5t2sIxz(b7}V<-aecB;>Kvz|J92sHF1-TC@B=Sj`ANuu=bZ
z?hPkP*R%$Q6Fm!KBOinaO5xlK!KX$4czmXxy{W88m#;IJ!*dcCsXC$A34Ejp003azc-rlm9t~Tnk@Vs85%Lte@maQ-J-%b
zkMSS+rZ-A+eu>17y7J^Sp;orj^`YX;$cA#pKra0Z-0iKrJ~F50k8t^0&*?dh55@i@
zDN{C$C@kz~Nfg((#&nMjkd5d(aOv)VqKUwdLZDgY%_GP__I}ZGfxDppcSEH<+A}IW
z&cCsprH?#NE3m`s>YgWHAzlSpR*$
z=vQ`7{B0-3AeQC2Zc~M6pf7t_e?tpH1-$>at(1$Gn3rewu87@Ewt`TVbSPR{`1=}B
zH3v30DzFtb#?39UjV%;bF-2+LSyMTtl}fj=Z~kLn`oZWnIrt+zEN-SCC#lFyJ|G$x
zk5HRDqwr(D?>u~Z7mMPs?%Kt8iphR4e5Mj(>D}7?i0lQp*;wgc)2`1Rzt?shl?lF*
z-=6&Cz~KzUrGhNNZTKIC=KY^LD4Hz@N6MebylAn;E*!L{B0K1fY^B`sBm5J`gVF<*
ze|n}p8sPmaZG%v|x4ip@SZIxxpg8jN02g=AO*V!AS9($Nf0Txe-?;_1ZsNbhS!%0GP6J7tG9?7lX!!P2sGh~lVQ#a!{E
z3<>HWQ+)9VakAY6EX0Yq=!WBkJbVImSZW^JI#)HY{El)Xr}aISd{Oy3^s%;u
zKI0>Mjw>(mapd9gjZ6APn9Qp9Zq@n|$#FX+<1RBU$jKXCaY6`k9Qt_I?Zt(Cz4M)k
z=_ln5tIz>?uA?Z>fu?h^jg-xQz-#XVVJYRL?6n01uwb7F#foDYww6nKS1
z8q5ti)$S@jtX_f}AwS`V6+8I2h?e
z`RJ|B(1C*X2t+_J$o{LtmeC`h+gP6onynR*wY&I@TB}m%u-Y6w4tu79#k0j4yGWMe
z?e(XbpKhI*P2hILIZ&B4o=t5sXu{-vvsAqFo>w1#m_2S9{Z{7fzpuP^YBT-PF~4#9
zxl*J}>aa`2eP`v^Ya
z*=Lot?Cxd3=~m=|hgaPTEvuI*tV8AZO}8)fQvMh`{eu4dH-({xGoz34KeZ7*0ojs9
znBLyeZL8+{s_&TVT+3lazxGXKih6+BAANDl>+dMlsCWb;+k
zk%bFIza)-bC|H4YKiTg?U8<2zdtxZku!LC2k6lL!T-KqH(m&P}FnW;9@{LAXGZ_3J
zS7zQQT6IUH;jw8$F?Z0Z9l^%tIe}y2swmy(iQ&N@O#9!)3-raL+&z-%#OSmW
zIo$_&meswiko*Qn_f~P3@9%r&NI0;e;ZwcMh8^DT&V0VLEq-~HJg)m%b}9%njN$bN
z4paWqo;rEWvH>JMz0tcO{3gpIXuXS&g$t0DbH3_R?DukXHHME};hMWF;kc^aJig`e
zDu^40U;LY@d{!lZSQmd(wo)*4Oil@Z)m476TYZB>vzMPbilW^N?`)~*!V-QIR?)O1
zqyN4k%7+OLOfRCn%AMqAs=}Vjle{QPXsjrfn$y7{$_kc9{aG$3*u&2DyscM9I(&PV
z)uPu}SESSq)3Y4)f9P-3leQ*5>5A~BWRGA8z2}9haKiL<*O7<35ENzi3_BXl&f2VRbjn#syqE${ku#BH9A8&v}9S3vw(n+GG
z;_#ma1&0l_+VYphT9o-Ye1Hb;YY#g*>X|$}gI~?Ri-q@2-un%x0*|vF)$;`v;*``M
zfAI0;HRr0Gz%WYn$avFWx_Z}aWw0w8oD&JYS`%%Ed
zc=ufHfq%VxTaRcX=32+B>h?Omd|INN3u^efGJnH2wvUMSKv)I2t;*j3lYZA(hy6p_
z`P6sCtyYs=6swC}5me2xhrZH;z-+YI*w$2T1F|xmY$8YvFkyhwE?;;2)2ESp~{rdLjpH@}5qgRK5
z%S#G$YFHxES;8y`Ec3&{z)APy6Gt?DVOj%wuSD-k-(&qE^nsaktx)}UASOAESR+4c
z6E0e$p!I8UVt4^ghRMhMd
z*A#vzmoI$69+Pw_~UHx&9Zvtd!R|g3B_j$?=lWOySy5rE@Gg+}o@M
z%PYgCF-ebZgADO?yj;$1gBEsn<;O7duXyTmp02=wJk_z2n+;W**nKc4?r>9EY*u?}LY
zDNO3P@ki}H+^4iYK0vbkVCLU^cp@5`sNt7(R8@st)1UI9e%=P|T%IVvLaC|a$uqtg
zf@|WS51US_D^dl`pR(t*$sD@z%s9ef9R032H&H|5i=X+S1Fju&`z*c2Ij1i--y^}q
z=!@WrI_N&R-U&H^l6rdI?S7T3pVNX*9$9k8tCMzPDoVOs=NcyMTPWS-1M+dXk64fS
zD%YfwgX}n9n+hqZ)M{2Z>|}idx~*sVM|_N@H@^l&?NpfRU73pRYA)vG)wr;pZIuQ!
z5?N7w!W%q@SpPeydcb)OTrk|x%{!p^bs(yWL}LQUgzox=-#F<~Pp|XpcZgVa(P~0#
z=9XI2LrIhlweYNS?KVhc86QEk*hM)p={#<(IMaoOWJLuu6e7kLlVHy~1x3)++U;>i
z{(%}Q1xdBr42KcV!RV~*HD+vi5k0II6G-h4d;3#Yvo>`lNwmh$2yOl%H0&X7?sP-^
zaEEF?FHP}svD_MbEMav};Y6PHZ7KyZqb}!+F;M}5fx^-|Ny(o#Vum(14hw5djeS&u
zb+RbaJ25!5zrr+A9qt`(zYuE_HZ)hSX69vYHi$#80ZeEK`AcRB0%vXU>QYGg`9J2(
z)>UxOS|7V*>SwEV6|Sw&2HSZB|2>vcC@b{TBK(i?pe^AMB;rOh_|o_M$CG&;2zaJa
zB-#ZP|2;IauAmno(PhN8f&{5e?pL^;Ex=*-{l)Hr-dB;osA6XJ1msEpJvqxWik?t;
zPF?~eFi2*n=Wr0FrVXuw1XcXxwerG#rmTL7JU)t;$8IfS`&A%`zJk$cR=gt?z7TMt
z0+_@{8E(?VRSi3TveCtIW6#>Qlw{tf7Yw(ZA8MO$ax3$pS1`oRmGT(%vm=^t)3^{)
zH_@{qhQ^17v*pG{Gy_a_KIK;RpU9xu;o|7>fr
zgy9xdRR!T9x+hBt!MYM`Q0zPtljl)RnR8}OdL;y}fA$eb4cTmS(cBLucAmIm9%$(|
zz9a6%Jo9lU4a>5d949E2X%myFxs3_-)V_(E#$nV_vAC03WSmoGI?9Mj8)kk}_e-Jm
zQm3k#89TseLfWGv)!aUT=8}0Fmqfu(Ni7_)?oO<04&q_FMSPr|H1=O$+Jv-)||R7KY={^KlU6rJY)0`RxU^5nB_inz2Zm#UK!^CL(MRJZR@
z!65A^n{6_xZnTJtHN26OcQj+Zb&X*Vs+4cqetutQ`4xbIWPKccdMriYJVr4;%LDT4
z!Dba#uBt-BC_Tjp?(>8RU2Pq}H_^jG8u6p}PKRB~EN-uce3(JSwRkm)Tb%TAdgtOg
z!`X0SKsaOas|XD-++6iw`XjDqWRJj!iiSnOi_^H;AGn&p+&Df*GA>Av8iCaBgY>vz
zXwDW_bWir9PX@{Z>bVv_+!kY9%YkDdC1N)>-DiDiK}?)K^tNlu<}Ocn)80pqm^{R(VA2$rz;!EmYO2Jxr|FIV(SAvot4Q$Bfj3{kpDa$CJSk9(Z!
zhZ3CL(@6>3%=YQCyesk5{K{?#tUPIfvg>y3fU_01uP_g
z=x%0(l8Z4!elPpAlCvfLS+^Q)!dN#^rit}n(;2F^&;^9P91NxBZEbEeA4U&_ZOtGJ
zd!pF90c6e`M-KMsB>n7n3JusK`0~1U^9$nbFt1>WRto4!Jj3aEW)*64mlv
zIwCbE|9cQCRtxb>49`6&DOjMrco=VZemT2c*~(vdnyxifMFJT2_WzMDR;4|2TReYp
zHDC2(%K$6a6Lg-f`6Qm}5z6*X9jr!o=b?f-!QekF!{i>
zx_m1YbfmiEjqNww_DI|zENGQDj9YlxuSk|W05*phWJ6EjZw+^%)DSLVM1if%EF!2JQ`R6l;g+>l3ZUt&v;e9qgoC
zyXiIR$`!o7p-4?9;AD-8p#b;5-58X_Rhb|F_HA{h0Y*5C&)T?#PPrWxwEQeI_DZUD
z`8(z}#+TRP5N(>{QV)J@`=s?$X<==@+^bxqFB{Lgj+(EjvtPFZM9jDUiuQQeFSER?
zPZPAVQw1vV>;%b78<^p-w4_}oeFc6AejA`G0Dadt__;}c2Vde4;!7`{-L+AK85
zvMG9W!28N)S>)X=3V8>}@OED1GN*Ey^oG0spdYjj0Yez#&SO(uQ-X#+s+)k0UseCT
zi1Zh@g>4n}#w}o!r-*07T_IXZ%k<*n=9c_wcydO7$CXRovyqfO{qF7l`oo}w`C9rp
z{&&(jNa?I?Q}Hy;aWqya@vfeoov=Orbf#0$`yRzB9;XZRzK?MDWlCci80io1InAB+
zWU1Njk(RuIRZBJX9{k<`i~??Ve)5;{#GBaAvjf_drN@7Pe?i|M$X>RJLg-U6hO?ro
zs;&msz0k|MCip_ULs}ERMLLT$ykwkiBMQGpK(B^Rh1eB&o4-n@#~XQ>-9Tldf`RuZ
zG3L8pID+hF*hbvA`h_hrsNT(xm|tjovYkVsXE|KxVwmaINcChSFkuVMW{AqIX|8B_^G%u7UXT34g(-x3Vx8&!}YE!<%HF-s)0CF;+Oe3H7am@d^Dofe&x_-R)mw
zls}0|tW<#I*jRx@_aiNzNa6!?B#R3?L_Y9UAc*YEphf~QB6cp2sU6G@;x8cR
z+dgz3G7>Y)?hy1X;Cy)7-(T!#1E8hr?n+mtLpN5t{#hIGNG5elNW0-JX@9Iw98V7F
zx}57}NcA%8F1YPFFdB^X_)2-J-$~oAQD>R1rr^Trxu?OsY~f(IaCJ&mwj1z0oE*wsCY!?c36$cOdfG`-n`+|s1|RI
ziMd|re%fBg=zzYp0%^uuRRR!IXlhZ`YO4$?VkrL_5$}n(Vo0C!tKdTcLX{L0+xWyY
ze@R@$4e=Dl8~#FlPb@w+1cmo53Wf%J)P!NHBJmb2crMB#IH-4jG2@HO%X_Zg
zBlSnOdnCO~UFOzcH#c_`#APB@hx)gV&?$8a)u`G_RO@`6jSeU_(8vvyX?O5I9yoj`
zHl`K1wLucJbUL{;QmllR%p)dU@l)AeO;RWv+I7O8(kU5j?8IE7{zTmtyU`=tE=AyJ
zU^~XhsWzs1?HRSHEa$RBg6>=~!r8RcpKr|TTVTlcR1f&Otkh45h~^3Q189(%r>;SH
zauCmkxy!nL>w?WY~Q@{Or?pW7LkO5@?#p_8
z^UQ>5eux(}%-+6&7~T|;^lNP@BW9G^In0R=PLLlL&{(At3%B+#E8;ZsCCK;$`LA?B
z+URa3US4ipl&I~{)6tQd516>`Hc}sG4zO@M;mydQAZ77tPe=Eh^$cAX--zzJ5S&|<7Q{S(sLr0kFe@O7Vk<%liSo@$00w;gVr1d4Q04|m|L
z1SzK{xytf^=J)|Wtl=%6%tT|u$VlNOJ4Y_@A{pdoR=Jn;CCIv#Iv6`S8TktxsE
zE?}qX;=~2RI#(uuU-7);Wh+p|dRVP^?88K;zcut9gHB5la`l+JtbJ_sB|`wz^oof}
z(rk}$?$y%GH;U{pc6TwVG#e9^dN?+h3RP-fTKs$+_cK_^=cRBxxRTi^%dT@>B_plI
zv&HN5O^~GW9(ignbNd`=GVM$zOFogFyRSU_L&|?T@Tq6-Fp6(I#n#y_6o}c>2Lv{{n(}P
zD!W*`9`t9ooVOZa#>M8gj&)TyZQBQ*XI(=`$OB8qXF4l_N~N>shBaAcRUXM89oked
zyv9M*U_pJUyg1R#Ngw0k&$sTSLUaoUHf=57K++@{Z8I*4E2(=eCV8#RCu|jGZ`D|H
z)f`>>TXsT@BMZRBMXn)Fd^GuIs82SXaJP8x`kf5J
zgnDPvSt0)F-YHVwO#-(>72#6MEEIdgm<8?X8zFtvmw{%B4@!3BKQ>0-4
za~1@jGYVE98hVY|S`vwX@5^oLUzOm1cU8vUFnl>5x4Aacn@oxycGhP`Hyjt+iT~*k
zh_5wLw;Gw1fT*Kypm~5*%D@e_NutWPH~FQl&Sk!Fsa3-%zk&v|9ZlfCJMtU#I|uNP
z+%3;-Pln2rn1#WJxb->D?IWFH%CSupZ4KxMKR`u(_BJ#GJ&$1
zXHRZm8~G8^(MGs_d>rZ~b+Lf)cECG3;GH+#3+qD*^g)qem;1Hf6w4SRPHyiaXed4=
zT-n9Lyu@aiH?OmQletieN!Mdxf%?&3qK?kKVxk5=FZ`{FJ9=(&EnJIBsXGYr1DD6k
z%c=~bpalOv!-;q=g!H)A7*kKkJ4$Oj(&@n?<~dNK
z>|Fsbpi+RaYg)73@OH~Ft4q#{gCZ$InQZgAHK$p5yi()gHi`wIX4}t&;Y?N9d+XgS
z%>t&+T$@~Ix_8Ww+^7tthnaM39VGfOEi&kFPoe2S+9mu|ZnHsEE5JwZh;t3gOV2Qv
zHsF7oDcLOZ`gkgavD!fSj_}-PSS6lJ^eh@1NOdI+%h*(tLH}f
z6=6mA*$~qTjf|dFEUY#hA;n76qijAy^@3Do>C}#Gba}b$goSIw9*K|~bMXC7tHlKd
z4w6n?g({!=5tA9Dhb!H-cZ^>p0~&FVsZ(sM}{8W7_*veS>1m
zD?j-WWSNHa@Lv33*tf_G5Yse;>r+#_H*2*ycdUJ3T=xurgB=bfD*oOSB=mrM#s4SD
z@D?ixCXd5=0WuW4C4gF&lZh4ae-ZjBor`cA-2AEd+3~!}
z@kRAP(6zbK!V&HBW~YHRm&$nMI+9w%0dMBUXkM_D%*o#I#p`I^7CvUSkK+$d{Cu{T
z`hkP=6NK4Lq(t5--1foj_$ur%Xe8PZLiQ4eAj9T
zwHlOF{ak;e7}&vH`E*q`9X;PS4ktQvggk2QG_C&YdHnaGPIw{DZcC*%R}Ju5x-<8B
zUda!n`SciTWBZ^0m5%HEX`h7DExklZs!8!%GkG%AK%qnxsSVyywQ`SzFfTNKxxpMP=T0E$+4~vn~8yY)cVHA?AkD=48l9COO;22y$|Z
z8EzA~0fnkh-ab}7ZvI>M?sueDGtuEDos8)MnsK|L3?{r8S&_Hm6GcaHrW!m^CITg=
zadp`H&Nrf#D5(J%S1c+K6cXOVEwdKtH%igau%k&po>zRs?nzZ_3`|&Ahx7Ot`*?~t
zj7fxQqo_-C+mFf)rhJ@W|2rrQDnmin=Y~`hhQBxgBvrGxSGaha(fF`OhFjhU+lu60
zV^%bMp~>QecT!xi0bYi>KsqnSc%i~vmN_(3ZHj{f$v
zcaGb9Lt+L0v08+MK!Y9}Mzt(@4nVFj3yLanO=w%B23y{A$9;X_H%NNJwI|mxB=3fdMKj_Xa1(XGFN1mbYGfh7h9g3r1p|&0~scTaYC5@sicWygKc}5UA^4gs?u$Y
zchK`L`59i_9IXOL5l;4=DJxX)R+x?#6!HOO8LQ7#c}~AQJBK(rdnytPy>;RM6!HaTwq
z@Q1~}heA4EeAI(jX>snzTtYxGlWKtQtphtrR}}9MU96+Xc??c>txK++0MuH%IU!WG
zR!!sZI#%Ll!0QcjJ+O{Od@F486z)ttc`b8Gm>pzC*^olz3m78>F-(}Ma*v*q4l9gD
zd_dP`D&?Ti>Ka%l#&9huSGSm19*+ykD7QrW(G-iixu6Jd>q2Aw-j+7C)>W;fwIzj
zn6^%)eC^vOlnA%3sMcNe!#f9*g-<=ecUB|6m8Z<~O@EazBBv^?eI}$(nlQZmJYl%mV2^t`9GiSm=c#qV
zefiV}Fz}R&1&tZ(+qvx{!R;-6+S4mZd}t3vcUrzbFr@RPN`dlCPSB+C9J;r}Eaz12
zI}s%3ReQ;j(4E`GawOfD-~X4`e|^2#o%{~`0F98-ah>{|Ech(J(d-UwxSBt=B|ZZUSfttd5xx^yk`eF
zaz^oyPWUzIe7mM5Ug_!h$)EuTg}U7bM9Ek+z|w!1(HK6(w5$ld*BCr`?>u&OC{Z&N
zoxli(4)&AGW1cOY!=6W&%Ej~k^C@r~)iCb7psx$6SKj(!;JAL+ImzYX2Mwlcl7`S4
z5X>vY{$zRl;)=jW6TgMQgrF;LMnv;BU;;y{LjTs5_(U;1q|SE@9EZs;HV3)VJ)Ah+
zo)tXPc1R{K!XG7kvK>X|+B({tqr{MmOS(A&#w<>wNmD7pz{@Zy924xDXh@+N$M6&=
zr?T57)BXH(;$}qfjs=EeMdVAt8unBt9Q}~iJLegX4`JGpg1fGr_fZ$fU^pt&_;DOO
z#PIV|ANRwiBGiFRF7dlEBx7$)l*H3^bxuhI&Cd5zQKs`c*
zr)lK85=+>8#*Z`SECpHF6zdqA_?!uG7W3wAR)mTq=B~45wI{Q=El`krcFWMnJW??QY*Sx-n^UMqACO&hLvV
zKwBdhjTNdRP3+^+hIpLF)a~Xu?pqL?lYfuxu`=L~o|xcWRSdV_afDDnEj85PDi;)I
zn3*u}m4$8jMQNJ(MLV{X|`8
z7!X_chFL~tDhrXe@us}3X3Pm#vp(v|lE@8^$wbp$<8&T%D|s2>2Ajg)cBbYoUr1A0
z#{vB`?;md$1%*@_Cm0C74_xwSsBm(Xp|}bAgewdnD^td{2!J4y+W=x_5+~vhc$OCs
zR*oG~R#W%RF>P}*b^OsLufosUJi}<
zd`}*L9Z3~JvtWX$8P}@5)a=ih(|3i|@iC4PWBk6l@3Xo$@NjY+uaskF+#J*mlrVu7xv?O%uHJ
zsL9llZ?8Rq#;U$4o(oG*-~ma@lN)@cPMb5!tI(?>U-o87Ocqx6%^m>Di|{P^bkH3Q
zCq&Zc?O$`GBpqB?ssxRZh7-@n}ySCW6I5&YW1<$1SVbJ(t?NgJ!
z-l~hL4$76GdZ;FsMi^GCygo{<;*=thVrkwi8q+<7fMdeQ%
zoG$3EJupc!gdMs^Cw$&29L!HPGWz>f=aL0q5qjmcgPw~AQ6+CXg2lQ&U!ZnNz
z!3@p$!g+do|13jwB~enR@e)M?fEWvDsX-t8aNbl;x6{PEdxacvC-bryL+Q=OofY0K
zo{sI3GaWZ<0+dRogXTf50GBnWM4*HQdfJ*yuals0>4LxK9w6i)$+rW_6r>-Dx
zdU;g-gJE`?y})zhQ`!*gH;xY<80sZ6VHk5CMxk{NMjMU0!5{!)huE>iZ30J=E
zT23A)*#x4sFlR;Fz9qiDIcgG#-i*VarTJ1xzHk(kEC{5#NF&IFRcMo{x7v=hH&+kj
z^RrQ#dfdOBaDDvt9qkLB!Wj!&zJ`+*v$h{Qp}|NBelkkUk|FVD@fdgV1*4Fr-p`(g
z#-XQ|BVuWQs{RAjiIL0CPO?T?J6UogD;Ch;GBJ0O9#LfZNghX`A`B8_Pogg9u<-!V&{9$c(I_K8l8;Z_=2e?Gbh&<@@EdYJQ)a+
zkEc98lsmuZLfryXleSSt!BPjpqX8cZuZbw%&)qsGEURMcWQ~n(aN9_IX~o%D{b&LA
z!n=Qamvb_EPw)GlmF{F~_x{yA`cv~*<(zZoSz?x`!{;F+94Z1zvNuk!UxZDwI>SgX
zabfA%qswB_aI-SnQEuJ7OM_r@Vu!mg5bLOiX(;eoEg*bI`o(k*7O|;W4|B86Yn2rW
zzq4Qj!xDxO3i{r`v(EK{zbL*Uwf5RoMkU(mEgwnHESSVh$k?6{kiv#mK}Kr
zsUh~XM4l)<-Eb(=-+si%sttrv7BZR&L>$bsDEe=7KftWHy`y}&SQpTB1iKQ)S(x@$
zoc5!IE15LV{6`6w&Chc^1j6vSD9A%4CTYd=lC7q@CrS;!dNr*o{N5gphcq0TNc4GBuY1r{5#)vdo>Mh-E(KdI
zsu#~=9-1+tkA&~SS;QU&Av=LVxV$pvcUF4QGTW(KxT>{_Vy-B1gaCecFZhu9Sa@|T
ztVhj6t`4zpn_74Zw)&YZPEvd}wz!(Tu~(qed)TwUBjl#apIDY}tGZa0Jh=N5r58{p
z#R8HX1l_uK&-&XYsLvi0?|84TqxG<|FgUxrzLY7ab4kUKj#zkseZ+@CtuHq|6=nl<*YGutF=OQL~U7w@UoBia9wyo}HCb#VLWA?qbr-u^AH|
zyA$RQ`loAN-5C5{9DtedsE+Vlt3!#Fp3SyPcpUF2oJv(ikR-(_QDpCj?wQYS{eXUd
zor{1}l|Isoa%fY15gDG8ZCc&poJcr}ef_@xd<$ZQoFI5kcHJ3P6CO}=S$C7}vMsHO
zMAL+^s#Jgb2X+=AUQ09*X~vb{Q?>;XLMB_@dSV!`>1?IVWe1?Lm
zTMUnY-Q(2-+UD?2HrW;SmTBSQsAGkD!x7YX)-Hqq*LUVV628GWKU6D)c>0BF_Ql%v
zI=F|ZTx$y@RsE)^DyoqGs)+O>b*KK{s`p*4St=CwI+VD~
zcExFXE4+;YSs&=}M&vW)S-~rs3kG%m*k?z*+lK|!{meF1n0l-ZLbelI_M
z{CCdEv&1Ccf}Zi6KzIjxPPA#9hc{pYk
zqhP190A#j2`tN4>K*{?VE00@Zj?#+4zApsIJG*=&1>88F%m(aM!?v{6Vz@R872l0@
zuD7&Vx1YCv>@CIL>KAo}2EtCxxI;WExnDHAXmh3mAVmuZjf49ecr%SXRBc%GKG4L{
zgU+@uKuLK*L)n9naI(JtX~ANWHg`S{nxKkXMI-?gwX#sGOUCvYe#sN0^gsWLVs(hN
zg7#pl#)x10Er~%QGcO+i^S=b)tU(QiYdkPTTZQ?lAg)yD{JbM`CCN*A%~=|y$?}D=
za@!h726cEu-_-@hdA66Idjv|qLEaF=P*ZcP+2OYATw@txu56GLkWk?<|H5L(R7qwM
z!j)0gbrFlq;eid&h7Tg9&orLL%oPj8P;7vG;>D)#mGGd0jUEeyNq_`rBA)&=6dP=M
zd39l%-EBmJxeuUFcrHEJj9Rb7O54*SVea^IDKM*B^tYe5ivL`lPh;tS-Y|{MZ?QJ-
zc2TSXeR{8gHk9-zV`4a+Q1^sY(4@Ok4h}C^ts}k%Uu~b3FPd3uk$XbYlGr>pw^OMe
zu?&DXaKGgaq~@UaSEpH(?g^&eB(?VoYHnDFP$c{b)5Ul)`Ta~~J%w94@=AJS$ejPz
z9Fe(n3FVbe
z)^bduXZqP2_MlmA=9Xgg?K)}QpzHvV7jJRxLZL~|WSKEI^D{*H70EO+EPW1sn@?{x
zTvx`<7l$TjiYxe=weaa}asAyQO+(U|ftWHlufQ=TuLW1|Eeki}v!mdERNjMn2!7`V
zbyrYaCQp%cW$bpj#CBf%(C#XDiSU$6zY3;%u(g=-;JekURSAOD3&W6OFxmxJ>Z`J3
z+E6ZeZ#|>Qi5D2s6W&vUq|p{`MpV}J`(~U;%N$n77IKr0k|b3IPmbE9e}9w&6UH
Uxv2+ZUpzK;O_~&|c)*8x^lNvR9*J@QWeXgr>So0Vp!LTsk#CGwIQC>Q^
z!yDk{tFK)TPpEKrMa}Qaq))E2uqH_hV~j?vsZdw7O4?fwO>0NzbhHqMDwQ`@ZNJ)x
zC#>M`d(yqV1E(07sT`Wv+w)55!iyb3f6z6&UBTolJN_?IZyJ`?xwe15`)L!~nn?G~
zPR!uYK51fG8%=`75!h+kxVxj$9hF2Ztf=H&GZYe>0;YZ$q7OoHuP>`@P)Q=IfhNrlxl-h+3rWYV)?FYFgNGGi~!jLfkQ40P>fj46hjfHac3sM!#Slg_oOC7t5
zYxuaLku>oR!4PNCY@Ni^VJl^{s{$q{CT`mKs>As=6I!M~EzbytSwKL(;ErpFl;NR~N8U
z1-rW8S;n^wu%4M$r2v5JdE=j_uD?fB?KqR`Y2G$_lMXd&x@lyeqUEF9N3KLyBQwzTw>tYvMj+49mZM(lwA
zgi0(z#}mgz`(xHwG%Ir+BPa3t{qkaXol3q#w(+Aj6ytbx5{&sp*}n+HJlu*Kx97aB
zJ}vFAm)2Ec#!LDAVp6jkwe#894GkjNbIx1FO=_tIN%j}4d!d!xY;UTqLuG%ej;Qpj9N_bRpQXM%I
zUs(s5PZA$X>8K;gr?mzvzf>3xNO{#r`RM4&rSJxKQ`a#V{0=RB5-14tB(Tuw1)kX2
zV>6JvyQ^`-QqqZk9*o^A?K|4?p4;rFv4Xy#a=;wMN&o#iZz!IVF@FYP|2Ym+W~~*e
zeFV1X$XFo*e&?{Ur*~$URg>r#xO3glDT1c|j^s7XK@!`4E_g$or6(3nnb$v}LlyRq
z0Mo|LY4kx6A4v!JLrZ3v3>IFzHvpmTjVG=z7#<{Op8xE~YaGdpPnP>_G!6s{?L%?M
z+fc>$0px;TZ;8#2aA^kP7e@8}F}|E2&!?Jo&m1?UpZO#^aLlgGQOKtJzt4FZn}6xC-1VKUeo!DVV*e+cMR+T0vo>gj{TAF!apzDccHs>`|3-2BDq_*)x!6o
z%kMACZ+3=kIAFi;uIZXqeO-YYU}F4G!NRde(NvBvt-&!;jevn@K`ilXej1j8sJhnWIMI?7>6mF?H5pBOHLS3aEVJb
z{6A~Gp2QV~;R+)CtBA|kL`+LZ>8oYI*9TG!53n@$ts86U$Ci+E&RYyAHc)fEz0C>MZWS+!TZyqIEWi@
zBbi%NJ4Q}xj5q<@3VmLp7v1Vg11ascBLKpq&cS03#@oI)isucX%ACGm>+QOTm-rIF
zH@J+B1wku-O1)h^8}D2ZA@{HxAq|t^GY`Ppb#F3E8&M{sv($rHS)(DcQ4kh4OR#(p
zuB&P{oD>5y0nuh8>yij5szeITIg{*ab9es&vB|D-eSu%3xpFS;?G61@=z8@m%tklY
z?_?mA7I7@srTT;Gt_O#@^bB5)_(|-6Xb8h0bfBA+6k~Oo^9>&TUe&HsWaa@D-Rn;;
z+y0?)#p<)b4`Z3Y3Sc&0N~uS#bWKHa9)!bEN(;XA@`isq=e(uViD{~V6uQx$Gp{Ju
z!~P9n?`lGOdBEKmFnp}pc!IGVIiS$&-}+aDdmCWyNFGQtKHbo5tdv4%6Pl8#%}Pe<
z&L_Z##icyVRZ9FJe{CjmB}$Q+u$Zgt#n_F-n|iK1_OIf)e%&N@X>o(2tG&KLgC
zj`TFYT$(o|M>^U9_R}YgC!X{(Nxj{M1%_=HN%H~2S@_k$jRzP(v2)D5;lREx=UXr}oe7W&&PoRcJLl
z_Ebf=u`9d7%O@<*TM*-1I8$|B!5>YNeOgHr!kaO6pdl5Eigd32(D^rXb70e7Z^c3Y
zpHfRH_d@pgMJ*F>VtNzh+3Kq60Z{tV+61U1kem-NK4~}NITSIwlYau%Q(JN=sF|`k
zsofTr4fAQZf3PCNSs|2-KfohI0pf}<8A?{tL-Z;m{KL#oVyZB&m@nf`hR};LK
z+{IO}gmvOFE^smdOmABBFONARUw92iB*<7ep4-Ccej3H0HM%)jbTB}StAdNuCg6%(#?7%-W
z)bFVrq%Mu`pJ-@vH0qwIHJo|NI6|mLkT**c<%zD0nQo;IAp25-6DAsB^B$i$VZ92(
z_>64Vq&K73@fl^dtpAJVxO?y98d{z-YVSc=bqFkbY$U~!GC|hX!b0r}(xgZXBz3J_
zR)*z<6=k(Re53kL)dw)Zr@XhKOx-uTJHcFf=DBR?xyWpwLIbI4KkmINx4$ago42UJ
z{{N-|#25Kj9gbq*tXkxTM(y6v7C{7U
zPDmkg{bpnl5OhRbz7bJHW7wNgN5guC(2=_Fpx&Eewxa~ZE{_wt&eo4sg@hmT4lK*U
zp3g4nDSK9o4Us_N;75|*FoG|IqgD$!|4aG6%s|cX!w$*ZvjKe&={b
zl4owA7qyX4Q#pa2nyIW0@h`}t0to#3V}CTlE8R^c^nHG6l2Pa@ZBjpp62-v6c7(W6
z&OG&5N$d$rVf3}aW;9hm$3M!kyEnqwBiSJL|8rjFL0jti0Yr!u^vsK96|D=(DG__PY
zV5YPb`6Aa3f?>C6(JDbx-}v9eMYK{ANwVLZ>SzrTbh2ma;Ipp3Dbv=(F@c-Y_%44~%+YYsFOgAt{fDsN^~P#B
zxiXN}z$jBS=Mpa^?$zDGyliJEnTICdfk)t)^+4wuQ*w-xN~N$=KG@Nht2h2M3e0U|
zvC5pco2Lg=iM9s
z1N+NgqCR|yf0_Ts-{1Z3PeXsc`_WJN7v4Ro-+P%i^+|4fL>?uNcZ#9&5#Y`ddN-J8
zodfekcCi~rOlkkFxVd;IutqrSXQ#_`S5_(jxb0KVDsh->w#|Xh^jmty6UtXR1`?t4R_a5X|3w+
z^Qf8!(;fV89nKC*$BpBJ3eAnlIxblCN}V%dd5|oj-ejs%3LxMzpMBuN!$ytm%}QxF
zqm53J$@0~{wV!>JbJ-@aZJVjaYG2z9DF@KZ&T$l-OE7hu!L7IHFZe9<2BC##gapC-
zjke&L8jpSvrgN6q{a04pN
zquuFZ?lfGtx72vr{fU&(DXb%2_;PUN()*9=i>nNWj0@36ywaAT)it*(uAiareS4+t;=C%<0#sV=XU--O9Fib0kw`IP7T^d!ql5Nw&%t2(OarYi=bj91n^4&xnhs0j#p6`@eD&RG64=;RN2AbSYcdj-R-gABrE|Dq
z#9uaeB|i%lAXubia51PdZDe|MAatMF`3~4^;LV_AyXi|j5DVg9R(BR1musHRY~HY3
ziKB>%QTW@9DAm(l4ijgsW~K4P!4$_h!BD!cQ53GfY${(aP1HtmA&u1o&8wfvID&+A
zhDy-+qqTp%eVLPxL{cGSh`HI$8Usc*`(&1-y0)JE9F<~2jC`>_sMo<~@chn}ikEk4mrxB6mO2jb>O{(Kf)r~vLM;`4
z@l(i|!=;4kEPjX?P2}}k&D&5Hme;!s;Tw;@
zwiXzB=}sQp97-G1D09n1zQFGgRha_i;bEm1P2D7$Yx%*bcv@!@Obs9;uka%$~thXHmpNzZ;V2^tma&23dpoJ8D19%-er
zW#$yqaGpKU&}A@9)x|9=CIDsj#QMJ?cc!6FM_(~
zNBXo8#Gsy1<(U!6j8j#5xB?kX?LSZl?yl1BhO+dFlo32vc8y*K1*`f_c0n^d0|>Dj
zW!ES&VU*!=YR4idnu7bxhfxu*o9dSMq+;j^hM%32D}oV>s@2Q30EO?7j5wFYk|%&ro+Yrwsui
ziPf3#jb`yanrbe%E?(rpsOeveoVI=?5zVB6eSUzjQR_5sCeHSs0;7pC;aXVnkhA!C
zEUF^o&i44u$vK?AFA^wil9z=H(OuHozr8j-7olUy7BS14=gJ1IqUChIsbcxv`@o@q
z$U6n3nSwXcB*g4N35s0JJ48`duImf>Dtye<+6YB?3Qt1F>f}~?E!;Kuc=Ac8*p)>a
zEzD3`gxXMH4ddz+&23__-u1_SCQp|)G*s!Yxz8`C`PMi28`%Z={Hle_YOxKXt7u+J
zd5NZ77aJ6r3FVqQ&OsB2
zWwLX$Ju3+kRfL#L`=wW9o;~p0Y#=O{?i))8l!F(QAQ&i+%0vH`rcad~=({;{ITg{b
zIWUpVP(KQex=9bXsdb4@Y57m%X%jL&%`6@fQ<4M
zx^#*^L+k8i8*{w5OG)5FHmvRopmdEBIYiFMJb+XE2FCGQTr*HpuFl0Ar}ZpcD6;3L
zu+rZyTwN`RmO|FYnsDkn-XPEuBw_XPR80I
z(~U)R>|(YMvZ&*km&;YB#iwRQE&tOF+{%TJzlV%&Gj3clkGV}4nOSAP^&Elvdx`8y
z{2p9}>IA*ZQEE@m_2|uc#u-wQ;ZpoY-R=-OSA5Jee`H$N9*DO!CDQhMhg>wiz}kM1
zoQmAyi_1sPM_q5n&0RK4x8CFNE~hPf5hC$@t4-of-on+DTJvw+QOnTvE6gD?>6lre
z-Yh*2txNbeRlZk81{0j20VzMVY4<&&RHr%LqWrhc@?>ZF*kg9~42}-^Hqv
z`Jk^Eo3qRddeK94Qmkg-dz?oTB}1Vp%EKl1Cp*V=
z-$=39Ls9jjaG3_)5SGCHAxuE8<#BAx=vqRDY+}t4H9HceKIT`pR)+|IOcetU*F;3u
zeUT5NGbCGvcz;89o_;7CS{%E9*@!qJB{4Hmm3UwsMozGfE0_=tvPt-Kb1sV>6EIa=
zF?H?r#@~14fDfY!@jcV;SSuQWf*a_k?}H
zTPqQlJ>fygS>W-FxBORZ^p$uYwrZ|aics~77iQ^Q>PIIon^aFtioz>!>7q?TC%|iM
zX_=<{dp9NlIxMF!y+VCWhfI4xZRf2tN78%tt%oGZ(DS&Nt}Tn*sUWxwZO9%NuBsv=
z7^vNn1*J_ZZO_2$Hb48gg;`+yebP;-+!@|6J#wNq9=^45wLHlYQJv@;J($vNN*8?r
ztrgpMp|%_!AlefLQV7%vUajfD>W@1fPNBwk
z>4GAFtj!C6a`Q-&M0RL`t9|eXD>hPHz%cu%7Qxj}6kR)Y57X3z{#s&Yc5suN;+xrZ4)JVjd=!pPLJ#jq
z7NMfB*yMwpV_o84CMT)Y+hT!eo$rW$0KE*w_1xt9$ZPlEpQ*3+|EbDVfOXlhkIfwf
zgRMW-5D)6*I3O1k7AXIhGBby0mQ0$Uy;0R{r2SB(0CL`K#{V?QLxR#U)2U~cKGjotH7&bIRq9^`!wF%azVW^1Ar@a`o#h%
za>968iz|XAB9hKX!?+W!Ow;Y4DOA4#r?S3MtQB3i-Qu$r)W=09G
zv4U=&o&~d2WGR=q=<{>>9}5#F*Ln;q_LZ8QgN|{Bh@j78L9Fe0=ngX|x;h~Ho9vVW
z;hn2V3{KKoRxfChwDJd|^1f%Kr|DhqRLI=CrmwkkNcA;{+)07M2WDZ7stNDH8DDDp
z;d8^VK}p2KQQUZ6&&qi*yIX7NX+&M&=jIU3Rg8R-E`)qmg)>B;b88w$=U{dF=VuHw
zV<@Pzw#Lq6HXa=?M~F@)!@BVTx>b<|k^|KBZ2$MEW#{kE3%Hp>w%LIfPZ{XYAx
zDgnhdtS}PCq?S5cGA+AkSw<483vdCA$J=_}%aL=M!Tsqe<-i7brupjxs-Jb{q(Q{d4jwM^!g&h}m
zJOTfQbzL{K16rK+bI8o3;(MbYWt7aW?<`$k!q!eVI)3N%O?Kx6rf$D(aB1p0v$X)&
zf>$4|k>w<8PA-tO5wFPu3}jvLMjbyR^27mT&kA{F}|w1ol{xm*HAVi}Oof0ipIrXPaTyScWei}*%VK2N3BIp68Oun%R6P{TX4{
zDKI9$9xj%hE5pL#3345(xT2Y}nP~AY$WM=V24ljeP}L&;{od9U;hX+qC@1VBsz0KM
zR1NOM)P>B4WSw
zu_lM-0zR7zQ^#t{nbZV2Z%1TM6!FM#a6=oij5ylUFiEgdrqOqIBBGY>g*ca6;-$4S
zDXPkh)X3?N#g3O@5TKeqwS&p879(ooLp`7WIBCYbG(I{3UVGHv4Y1{;QS(}ptK;62?u7p&a2qP2)CV%T;O?hb?E4barId5-lw#HV4p@^kk@T2w#MXq2u6Q-Xv;|jV=TIq%|DKApUwF;
z?W5M3I``LO@fgxa-V)5*S8OBcBC&(^JqRHguLis)OSi(iz@0P!`%7*HAlLz}G?2!B
zoB67O%~)GN&D21BNaqBX8_I+YlmR!52E`nr*D-8oFfv({dl^?PMHX)jJreo5F-p-XM1)1+79Q!c|s_{{*HKLZ@D7nxa&zJLR6FN3xp=9PSGGM
zc>K^XQtBSq)b3}`Z#sBND@%RNu1LcDl9?+Uw{2c|+1}8wt-5bSJKKJ4WMo+>8hVwZb3aEI0y2)9-uW4hIH-YuUqfziQ>Sbc-x{ygwf-Pt3wT3!a|D
z%wzG3B*u`ZfD7ns*xQD=JdmyPAAS@
znphLkYm2#!P#OD#A-zvnR57^yxPC@9L6`@h0>r$a4qXG1uURzeXgorfg~YR~;IUE~
zGal1juHtVv->JSB4cRN{Ki?Yd%!0CUdwh2u7O(MZKVzj`MAU09T0@s7l5IB*Q<6*f
zzXDqJR5A6cGnvK@s(p4JV=kC6PPx7W1_Z~#zVQ)+ZJ5$cG867`YhCPO%P)&JKDyiP~B}$WwohLGxXEc^M+I`;0TXXW-dIhxDJQ+LnJN%3ALtw@ukmeF+pOv5eZd}
zi&;Touj?xyAT=r~JJ#2uci6lJNOkqFBU#nYr#sg4f4DnhoACG-I)c6jH{)pu(_L$R
zB%B_hdx^|4bnULpqgZ+NNEN(NeoJ5AJn1E0=u+>r-4S;(1+Vp9iQno{tE(3&c1u%d
zA#Mt+q!17y*wOoa9>vt7K>wz72NK)5Pw=(*137uxbkv94P_c)b&E1X6%kBV%hk{2o
z;0+A*-%-_ZfGza6zaMw-a-8#D?tb(x(H>urKqzcfW^%NoG)#QmpPD^_URUE_ZDgB_
zmK9osD2M&q?Cu;u_AdY$UOkMcwCn!_kdPKGgIk=u8dl|PMYNH(`}rcXmsi6y)$c!n
z53dnj>*eVR6>v@}ecPgR?1B1*ZRVG}^8W6m4KLSojB(PgLO=)*a4OJ8Wvw0k^1m>T
z4Ea6&OvK|w!LK{VN|Wl9*xm$F5IT!GX+CT4wwJDC#Kve7f~GHo+GCHqBe2pgq;rKjkR2iqqZ3^SX?p{l+Xkz5M_8mEdO`o@DH>xSum
zg>r0qTI*uw=Etp$zAF>@3&a+)yzloR%}7(kn_}nn20eR#vd{2zv089b7SUZv4=iqJ
ztRV6+dIu%MP=V$xg{JO>OMqT4Q@a%Aum3&L$)eA_>g-4S$DRS`@eOCP>XpRK#H5!6
zn$w3IIc9bc%W7Y{Em=_7I7QamkJ*0c!t=oak5vZTSb;`>jJ;3est5gf?z56$*WZNv
zxm_GX*O;z06@MHYMR6E$QzT|}LA;$C2NV~#+=EL>o474+E_DR+Wb6F8)Ef1*q16*l
zlIX=7P-R?(cLL>Qa=hLCTnW+(+O+Si6Oe#8I3+8S{PNl+)Si2vmC
z%bj@h58^7g>SKlr1!~63WkumF54y}lig>WK<;-R?WSuL{0?{K((K5(kdg}JUStvUm
zpWW!N^r+~Gwq#pQfZ5oTVjO!I`O2>ftQFixBd6#Lm>;BLpj~}ditD0@;Xo9*rYmZEn6!nZXnf{QsnXW@qxCG6!I0wr~h;2L18
zMUFp(8>8ITM(%9e+WWL!=t=0QiloKMH~vN8YDfg9er9^yKhR^)Pd-OEMvt(O=#18E
z?ZghRpfjL;bTe<8St>I4`Yz;xXsp)pQfPRt>>Xd&PV^_sw;7M6g^Rpx(j%u1(`kNC
z^hoKm_7cSsfLpEr!
z=w-~xbX<1>QRob|QPEhT3uTSN(HVxH%1f3$hJNaM+au|w=l|O|Ph1^)?gs^*g##tW
z)*B`GY01+TKCeH2NPW#68$*ND9z-ptZpqM;Ctp-ijWN0D2;_F4)E9pV+DVTG1}Bqk
zk@tr*?Qb@hj-yI!cyP_rc!wb82)HeBv~VF-s+5BnhOXdQ*SgM7R+zV&o0dcuJYBFx
z5~3m~K<{ltGj}5a)pDcBX>sOR=uNoDV#DY1xydx5{4?a`ERl&HWhN)4#|r8u8!9Hv
z`F&ofE0ifp4HW#k9Te)KB1}1Pn@uLAv
z7@BfqiRYwwoxU5KylB
ztRJk?VrAq>lW7+Js_D@*+dBvU7|(d-{w{;|Ff7i!24CrX-np7ymSggMUcoZJfn>Be
z1Co`n0V!e~fyxh!{K1{XLJ}FOOyZx4B?zN6TG}CT)-cGEkXBfV+mM2
zNy+P-u({<(TN&;lwaVqxOE7H82+h)bjbhh4bV~xWFtP~`Xjmw?6g+1BU6`qRmAn<;
zen>ofDm#E{X&yCFd51iqEa7$0-LT?7IVSBm;{%XJBls;CLF~9!InrbOJtU-9s4cs2
z{x1(RmVcZmO@Ki53i}vH8h5^-9r2aek5U7DoL81Ue|NFE{!n!}{7Ci8`?e{tT9AUx
zs7g)s{Vpobk1;s1tj=+LwMhzr?G^MfY91DgY)Mg
zj#vm%)vb2VTSQf5M4B}1CVi}Y7-_ez%Y4)1{XRWmw~dhtPo1Ikz@L%?m4nrZqHN(F
z-!$AjYE{!-n)=%Bz^j3BBn*zn7~h?!u0gIq6u?;!tH$@t@BAalC&l~s3OHvzyn5zX
zRPUFzx2@$hJ~=TlHSmDen&fri>yw-7fM*K##mqrgMaiRh-WgC^0}X%N)VC!3{8Y_d
zc%TSuHjb_9mTBsbF}5Xd)zc1{1pOc2A~KwZ;!I)qJ)t%&!$$5|8J?{Rmq%qqNwF<+
z*BVNChbX&K&Nm|?$v&%-?7y*lqu!R5D}G23^?0#J$2D>NLnFRB17+)!YI>c_D*^X|
zU_dmx)@n0EFHeMR{qdhUz=@Iy>L2Rt8QC^rTzotJLesvSfkOn=08gT
zJh~rzlZ64EEkHSVAWsHMR(H`hGjR5$NEKfcY6c%f2rWQV$YMLx4QZ)6xB2_iUN=m}
z_9D5ZDbZuN?_2|7=w#UX8@#G^ceHFr1`*f47@emQyl0wUs47qGX*THx0+H$JI5C0>
zWpD7gz%ojE-g-bZJ5`LwT%#20%i)3wkm^Ttmj}X=aLEzhimwl6|8h4jidXE-Wb0ox
z(SiAH=i!{aE4OC8E`4z{5zETQr;MzMe+aY0wYy~K8`)OXkBpOLvDPfXD3}$S$^D4y;Y+Derhx-hk*|1dPwad$qzn`R
z&W`A3G@x(0W3Q$yua}k!d?}vDX5+g?b}U`&utX`YoiH2KKgNd$F-Fo~l>hdv;MCU4
zeBliK^SB22%KzHaV7S@nH%!{K@J(*z{=s_a9#7f&bh-gZ*LmT|?8qoo0fC|-JZkxZ
zFl+J~%p6XyDDuv;mQ;vFfU>gw5rZMr;IT4b88WB8rANroXWbkfNgbWNVZ}#zR9^}#
zrgPIi1dX^_j&o$Ler8`G+xfuXLAj@wg?DZiyGX5l9R_@5Z
z+&qI)_bkk{BPwhkz|^K0K<)xi$!$sL3@qD@f#aQVT9H6P%U_pCl9y@yezUU4E*gfj
z&uHabDQ|LB3A(kH&HACp
ziNl$T?QEbfHQOezzi2X{6{5{n#HFJ?D|Rcn(aMvmSsJ>Yic^_Pp$
zscpf@J&jkpD(N5-E8Y0jh=!}J?sDk^yr_>9a|}$f$%wgz%oQ3)FT|JOz|<#Af2<><
zW)gjFb~hZ=xb~-351hp$TaCh=?$zx|1w;F>uS@W&h$@9Ww(T3UsaK$QAz#VQP75-h
zji|1^4K*LX9VuvD)@UI{z}tO`yoc{D2d|E<*K4n?&xng1zodE7CixjLG3DzE1%0a+
z#c%)nMsV7TnpkyLY@Th)hySQA&T!`Hzc*ClEzS5M+5@n;Wwj|$pBMxya};b$Vgr03
zQ?@a2QXJ)OiglZ#1)ZhCMduPej<(j9R
z`VVH?pR|Xf>TSnDyaaiW98hID0vaW?En}w7%s$aj#y(`I9J_-S*7j2~Q8t3SG0H
z;PP*FE?#Y0pP0*U65D`v6G)dLUf6r!^3t0pmFh7KXl!J{asz_arkZ1Q^;bR0CQCYQ
z(gK%&n7SDH6j;Y=l{{6=NH(5UXEJSX66tHll98sbrT$WXpve@NFIi8OwFw@
zXW-^F-}mQ)x&xv3e%OX9p5RX7)J|ZS<9*Wy=0v`}&Cdx6423r&@R3j1W|TM(psx?#
ztjnw;pHZ|2TuA*kT{tPec)Uf3mI6@W;_Fdk%Medavpy2uJ?41DoqMD{BbTWrj>^Vk
z)#u4x3&&2;Dysr#779kay
z8+CV;Qma1EIb=(g?T!K;B%l-pB|nb5F9*X{v>0=E)fttH`1OgJL!W&5d&M3%3^}g7
z4ZvMWtK-evDK{%XpsSXAVJ+142q^mqf+hj5T2<}ojTY&=AjxXux2Hiy6E^%6Y)`wM
zsOu4Si+`Raw*wlEl%^xol8BD&s*tyx-xmRhi8)fWyE(1pT!R^3J*%uIb#Ive0gi)>
zdf3#ktv{k4z7yn`@%sS%QII=;Zw9GNid9HN9j%fbNa%gp-cDG~9<8&6*zPzecYBgi
zip-KCd9k|R<_{Lbe+3yLs5DEMiJ`Y}=MxPZAIpRSY%pR#P*=8?QeZ?Ho82eE{=Y1M
zbm^*f=Tq)qL^02_rQL9yNGhYJ`PczSq>hHV)FzjH9V-VOqf#_y250cSn@ch>HT{C`
zjWMyRkEa|fi3Ox-$4W&~gkT5Ll+>xRl|0qYB&(Km@G5t!w{fVo*P&70M9{2l>Bvyb
z6nDI*S=kW3^&yL|-j7mmZo(wCPTiK%wSB{Gd)m)!MLcO$@iUVb`$?ms3<*^`lVi{5
z7%$x`d>;{|4c)uN=`DZ%?*IJd*l{EZjN
z4=xAw2D5F5)A*jz@sYX(+n*AZq4ab6AS;EgHwtt@Y_;Z%K
zP~B%7y*htJx0}iUr=SlP3sa$3Q4TSSVfcG&`lN<|9)JYXN$n`dcBXy1m9`aG0qk4W
z+S!Bv_%edWE5k+H#2dom8c;S%W4ynES0(fTpXhzdv7ls-Qgdk8T9Vq(DU$>nUJ1v-
zYq}tfNysC>Hem_85m2=zaq{VfSYS%uWg}@*NDnF$;nm^$nc0cQV?$*LezW!~`O73t
zf;bzoE>vC>qXi>=FalMx5oRip16Okn;T?=B5`9tx3+OB>5j=F8Xwd-M^*&>#L}}~7
zry>yER33iX5^Go{ml@o)zrStAWIy*^_=`r&4=v;VW$7y*lL+`gxC%0lfW5y1m=KhP
z1K7gc@XDf8v%lqLJV?E{uHw8j4qY30A6~w0J$=To8=i$JUiaD@AAS2dTpKMh;WsYe
z*M&s_5rdes*|BOZacmz9d7H39DoV4_AfqIb(;}kDJqQLvbQa+#REF{7(r%Z7FB6q|
z(2n}=vE}{hiJH0jU+w|@-gYQj)Ba5T*iUE&=F@JJ`faH7t_FprCw;6O4oRN{Acp;J
ziz^^{O~lLHp1CUB01OQ^3%+whtrW#46B|_Hg{u$k{7x#c4sL9ZY@#&|u0v2SMybu@
zvLocnH4%rZv!^k3fCM
z7|ld_G;^&PZ>GX0M>fw9W1uve)VxZ{J#Vq(-$M#GKGneG!I5&mH|{KLh^(MB>nDDT
z+&EGPMXhcuOpJ~z){c@B1L~rK@Xt6=ifxSRrVaDfgF}~se`@>E^F~A4SH4G*ZH==M
zY!*b6RR(kn^mUu}@(|hjgYub$`Na@_A5!BrwRUE1@Ju+%yX3lo%<5#?Of9r9cJm{B
zv}Clf&16*Zqa9V(yF==tvBi-9ohf=ava$%jG3x*xpoDj5)FPKNNWONtH$?Oa->cO=
zP4|TQ5SG1UakdRwFCk?lW`#ORv!IVcB0URV{O;MAW3fImoQX=pTwNLpqw;hQ6O1_%
z5*f@62=%o|+T6!>2*E%z^#SQD4NwR7R7-P@=5FA(I1~%5bzgHE*ai>;D#AxzMQ%S;G?CH;w^9dpEN$-66k1kGPReeSC6W(8?>
zV{+*Z%P~$Hc%W`K{1uMCdiV?*pXQHfeTp&$?QVmIwtaNjmLfi&c{64SoeJaT>i`fp
zP~x+eCAZA>yBl?kZJKB3Hko}~r`C3=T3Co^Zg4^dbF=fAx(nnn&)$U~V#9Ne1Vd%&
zVG1gfsMW81K0hlr)A}QN6$dz%;FVH$BB){C`2Ab=ECuyja}S?`M2``g>k|9)F^XK1K@9S9Kf
z316t5n4JK4()9(u({$iTezX;*xMC^lxMxVv#ZcqbOQkal(#5@H#_Q!R)3#{ZZUh4G
z0(7ht0?)fed&8u&jzseaTqJ<>2i*b}>w7;?`)@K0;drI5i|1i*Zm?j)I{C(G1&HW^
zIpCmP`_|?h$?-GHQla0h%65(RcXKrq;T+Os0+7oMVwu`8O^2Y6uK7SHUJTm={)S6t
zfb^{Cw_X(q0l+ODL{#=V13h}J)mxHj+vlFN#tDRFuJuG1Ms(?oBKOv0DrTxH>={I`
z=H$4BR!wVspt*iDmVIZD4eFg=zZkfPWD+b7uvp_!3{BXY$9t6>neI0tuOkW8ATLLZ
z)~DmfRpU!q1WJRNIp_wjtU*iMFy}Gc$$U_sa8`mzb|fOpM6=w5c-d}5yjnSH9_}F-
zleX4j#icw4a6YEop!w_T70@E*rZq^URt2iK6lzJdVtT8Uc=ie0|0C8>M>zo?iczI6konI;Sn2lrcdk$BmRvu<=M
z8O?=)82RT_+PSBgk5YiVn-yVGD{!D6CV#m9&bPQ7ea4jXUtqarjLJo~c@EKF^Qqi=y^`IlUu`EU)WG|jb0VM3USG%a
zewNDu_fEy}B0T;NVQ(7O)S3Sc-!rySM}@XjQMR<>R63)AHXv(~T1RPzC2grt*0{6;
zK?xWlgpg#EDsF%+Rb)$4Du^sm1B4}u>>`8+frK?71QJ3>Ldd?~$N&92_vd-{yzxao
z@Zp$q&UJmS-*;oF;I{2Wxda7YVC$gEH%KT8uTN;cNe;6Aw_r-BDJr#-ZKd`;;Il>*
zjIJ27Bs(@)m+~wNu!Irel(m;^K_Lbx>SvruPBN^PbjWl45nJa;GBvGzhR7Od6JY4d
z`pi50h0{_F(dqbwNX67=-hJm?7##%?o%%1U&7GymFO`$Ff1!AzMMLVO+m|;Dp0mr^
zaYoj$YWhr1mZGBCdu;Ef_H>C2fU<&_7Hk}l?2&G|$E;V=>Qx`&;kXM-WTpCFi$d!-
zE6<)iEFFeJ^3MiK@Bwd~cwICO9j!CwxGYr*lvy?O_R&h_yD_sSUZ1pm*
z-LZ2oMhAtHcK=y5m4FtZdjq_y+<*qd#pU+R11L^KTW}d)CBw}g*Jw1uESXw~cr6vy
z6v$}AArYRq3<@Gt3ym`lsi2f?y<_SwuPy*?s>#JuPQWRWRbe!;xmXy)Lpe6LJI=fc
zR!a^_G@_Y8t+t`iKM9J>h*3q-skD6wCDw*HqVP@SF}N_d8fWY!J3gA(v3hPT1W%sY
zTpeD10^O}^58#Hyf_n{4U?B5@*A}1ZqyU^fg*AW^CN95qG<~^mM6Pg#p~K2JkqP|N
znQgR9Ybr(OV?KJh?ags|2xW-^i(sNpIO+5{1{%w=6?;|mtd(>QC=YZS*J7{tStLj
zH_n-~+rLz0{qe|0v)^pL?1e)7JXKUh-Cs_SPk$S@T@`VoMc)%z7!iGFU!X-WMV&0|
z3Fc-RzNF%tFRF(trpSKug6A0(V^8j@k^#L7QfNvG?uapLj+q}?7DKoJ_@z-AA&P0E
zUUBpUdo88~5c9e?i@LGXk0o^+JD
z`$BY$>eDtZ2Du`hTVi+ox>+zYgVO;OL4D%Xn)onDFR%u+4xcWJb@!cyV&2X?qxnt+
z=WgRu)vnlCp=R<}{9eNjasq(6D>+TPUbgE(bb=u{9K}j5R=<8VmIIMu+VN|PVQjT7
zsVj8tGfF4$K)wUufbm9g70#~GJX=&1n7Kt{JCHUm6VKZM9A=^s1hfc^s7yRmXhENW
z=n!pjOpSo<(wMf}&O&vcV}5}J1h@6otLzJJ5SCoKqOabeA5!9X!5l&>Ki6@|LGc#Y
znuYl{9Ac1pQ4~Q`(Le%&!SS1z2ppoUe+#gUVirJ0I4SlsBsJtD&P0xIH!fs;=
ztssJS<2Gzl>cTRMVT3%s%5=ZBk`Fm?2jf`iuL*mOzVilqe1)h(+LB$2T(9T*v2AjadSHNv<~&NT}Cr{MJn@
z{hj#ZeT~4)!Tg7Ah@dW%a?BRuVv#e#?&Me$QOV|Ik&mMpXg%cI6IV!q|1oJL7iwz&
z+uDQ%gO@;aNO-9r6RItDlxyfzQB+ESS&6f3ED*7V9v8xfMqj2S-&C0aU?Sj>U+}E)
zrN?$wg*tcOB6u^;02RcY=T1d(X3>c%JUy?Cl)GtOT@&BU2lQ9freQ*hwrlN04z1Y|
z>3AZba|E{AlhrhVZRAIcc@oM}eOOeA5`?3eOyn~hl5wM=pD$aL7BX=~fhQXy>nH2YwH>qP1mr>8(
znNH6Vcm4}H>iR+5k&TdXmdRt*2<1HaYF8Z48Ob(h4jo@6&
zJO%fSCkN^#&l?Ag=vlDE?mM}$NAMcS3A^-MC+SMT#^$5f_$fHW#t2N^-sdK?!TKq^
zChdab4_mnXjU(ImrrUuzg2*?NGOH1e3UYA42Frpj;>_D3ECoEil4;=()?#uU(SS`w
z3M}Np<77T_^)^TNt=$PIZc`$FA0Kf1r@~tFzgR{$!t%xeha3ULg;-K4h;B=Gk&0mv
z7HphC=uSyXf0uqf1fFA5&X7U&1`XsBaJ`{Xv8}ycx1kgf=y|3^L8s%-Kd4SXfXTI?
zo-ALF=!F!lJ9)3@{IE`RG5Qc$P$HT1@BH*o+k$Aa=6kMj^aB`#aV~vR9kwz}-h0`f
z_AD;xW$^f_L@*Pt9^P5Sb0^5J#q@t=lnBVe%W=WO*%eLER3}UoLDFE?-3k
zg8IPxB;yRc1;asw;g=riya5(K7barYUqh$Ke(4Pmw#|P&Z@n_(&MTjL_KVDSzC8Dc
z;NBp$Tv{=WPDIydCAJ;(dZP^!@OnQ7Mvi7lUg;pRK#tQ*o8pa?toy)Z;hl7?-n1*c
zNSy;^BsZY*3X{o`^-?zW-eH)(4c6nB2zzx8tJz#_-63o
z?#U0!Q!Z{T-Kzltc9W#C4oH|I?&q(w4osSxEStj=Z5CEn6qj2^Wpe;9P?2#6BTu(1
zfF{_B+bPb^*!)~VV@X`*wQ#la;sH2oHw_@w+^Bg~Lj$#X>>R%f8x%Zk%96ZYF>TO|
zHw*L=Y8Q6*&`uPvB5ffxo(6GdcJsU3FYm`_lIL!2?{bMIZ06A8FLQO09GJWUz*Kvj
zky(u>mMG{3XUBYcNfa5$NM3W6-YGaRR!V#0-<|f^YMHLP-x7#
z#F4BA;?iX+pSl21F5eU}4lpI5Lr!yUz5?mk9HwtBaM5F99*~?bnGD~xLxuw>%1%)#
zD02YWzPEXVYj)=Iz}=S8*9XauQY1edXbGS$#T>8RTa$SHQctyUD*S9=ZNOOac-GEs;nnGLf^uOcsf*%-ESR!B{V0bEGe
ze_MR{q2s$hSo#UP`e$T{iv`L!_k?Dcovof)myCAj5TR)V^Uo{lEVGXvvAEQ!C3Spp
zjXH6)JT-?z3#RUWH+nt=W$K@a=I`xgv*}*%{=CLxBQnZfnQ|G58*XWp$V9($w!8gE
zNu_j*c1j-1rDzgD9j`j}#GKl21h?z3N;{xMQ0RdcENZ!!j4L*QEYj6+vw`h>@I8&Cvs4uW
zhQ#A^96C0E!<5*$)Hi|UHD;4n`~BGq_N;f4OK;82y!*fF!rsXy+QI)w7M?)TEjm{mymb^q
z({3IMMJ_NWHzA2z`QBKKPW`Mfhgx!$G5$Tc)Fm2~K|PAxY$S{^{wNlZ7}m*`j?YX}
zc+|YYV;Y#vmEZNV73}sYPl>LHCdE
zQs6tW#5=iz6V@H)OSpu??hT?EZzh5bo6Qj5{$v67=hd3WMm2WuYKKwX&?g<>;TA)n3PO?P3e7b=NQS;
zpqi|R*TA+eh>y%j=|krX!b=oo;3DT&q<@DQT!H#8Eh9yEx4=vaHj$>{b!}jP>Gl;oL&gTEQ+9ufZnC|-Q!6Uw$8XDB=GP5
z+${^hS$vPz-2>&?#391WOd!0lqN390DPY7m&QSpe{cjMAi)H(?DcGmd(tX=2Cc=+=
z$8%YF#BcSN>jk)2Q&w0no}$ebyo`3CjsA5bHOEbaI*L+>Sv~5e$8(k^^iQ%
z0wErw6vQ+D+UcXj3n}!rLDzm@MK4*XR}xS#He@1~?WSG36Z#c_1h5v{0pmvg@n7f4
zy8H&amqJ+26t!%@`UZC9FL6o!!RSJI1Ckkx*(eU`EUG1~+7IWaD0jvsrH;(FE=Sqs
zO{4~ANk@b}R8M0r84GJrDYlbR#k;ZLMpLsr^2A66Nmg8Jx2me!ZU;qI?USGsk+#Nq+d6N6p{aC+36wf(-$2s8nNcdAU|;Smso_
z{ryXEY#(+BsOOR**h|It0jZ=9#=G*a&hSObl6o(-X
ztM$?IZ|0H;QZ`>MjQl%7v9V-Y?a^R>71c-sANc2V-*HFSJD7ZW}+q7!yqyet0rDYHCO@U9BYZSD)3!FTp>8|07&2{3p
zBm#RR4-Eoko~oi6k~B@v$&QAqZMC^I1W9cXZq)|Pz#Ju>o}DjW+uo4;>
zoaq3%a{HMDD6iYNTBVTO*K!i0q@FS?)N!N_3OGyg*{yh8o)5)?yZo4>D4ORR`a!$;E(8HE@LjNHQ#z?`!j7_U+J;$qx
zT=9-LF4&?8j)%a4DgbADJAA>?`=tK;DQ+NAKIfKsPrC5+Uh{whclge>7T@PXZ9Hti
zXvzOSeO^5(u+<;6jI!>dS%W`IdwN!t^MZ)^6lj7Jundwag^EhXN+=
z8}qLU_Sxu*RpM=K3>W7K?b|!c>>E7frfdZp=Xr>_3W>XTpQ#oIdq%HZys%R^Z~ajH
zYevc;PA!K{5Aiuy4$SjX+q|RgzZ1=)*?yWh!1VRIq5!$UW-pA_q4bLQ6`Vb0ZE8JY
z{z*4RuuwUI)M5J?A4Q6_>Z3w?Jk4*WNFt>tI<5h9zA3)u5HyAJlQipY9iTbBoJXj|
zji;t!>Ua5olDyDyGXURsq$TotN~7-U3X)eed`Q=lm0}(LCG`+)TPSC4{vDckm!{(+xC$4^sN^OoMT>wknqJUwUbG>a>`?*>I$&{$vqXDjs%WT1
z?asWTTr7cN$_(KXfR2c~E`UA%T6M25Y*R7tKDzGmS-wj7cRs!YxQ>qu*J-@MO3vGR
zfD`Lwis*;q1xceq(zfc>MhyMD_+%w=h;Q_gUy|jDUjM=%x1E|x*@4@ZGjjUwG;bMCy|vA
ziUBc6hAlM4YjjFdL*2;8v3zs2(Y=(tosfUNIMJm4Q&MI9yqKlYq~Iz|+_JqvdnhyP
zCrT(O0&8Fb3;zS)^=&c{m>XO-INFx<2Iq^7BaNcSO_4d(T>$T-t>)>td`;;iHxz(p
zunpSlZ$qA@9IAhx{mnvo8WXQ>rL+NT*m+h#Ug+tLhq
zv)76gf%_^=sTwhtM)vkCa+&aZWF?_8Bq{A}4C{T=Z53{ix{|>J)6Dvv#;p>KD?uJ#
zJP2fr`>xLP>E_e&-o2}dF#wcbv5Zy$zBq?w14#;51(J+*+pC>X+)3KY`Pn$(ROI
z90!*L=JTztKwy}RQbBzqYGI>H?Rgqe8`SP00M-_(0sQB64TlU3fgcXbfC8xp28@GICz
zvQ*g!1LDfmTf0lf#2SNV5_0nYOP22eshY}0fOFXg*FTA_c}Q@cdGilx$5-YSS=Lyu
z6V9=G9*lB}^lgK7+&fP~Fb$}w&6iYifuuG3B5*KS{vRDA;!88>3P597TThS00xtEg
z=)nq1LHXEd(k7gtd8Z{$w^w=va;h92t4OAtK=?sk2n;X1=GT9z5;g+%q?bK{84U9O
zd|J~2Oosk?J?Ad(7{)*RBxpG!^OV6;*B^W!KPAtSU99o_QXRBuZjO{Ub|FuaZRxb`
zc94%B5}8NJQkGT)X)cS9z))!J0BH2LxW4)0_=8Hp=p&I&OKLPH1;rsD;ka}HN*{%5
zV_un}b}gA>EMWH%H~u%|c)TMR5De@D9D3<#-pViNdFUbiCeZZp>d*6^0WOK_@2h>E
zz@F%ZprwFel6DiCmG4J*eE{i9&|f<6$Ca>!+$i#Eu|20C-+c^H8&L03UFR*kmm#gy4>+R&0z$!Rs2W^EM0)iSRxnQ)g
zS~6*i&jOMK!g7F&j~c-12sq&L^8;_Q0z5eaXF=ZNh9;OuUsovfJMW-gfjxfYNQwG_
zlfzrZHN>M!ReNVL#+|7W=Pnz=ubL?rM4^<{+{5?dy}>O`OH07u9ZyW
z*8zxSM0^!nF;l>SD>{(o2yDf>*SZ0l4wL1x@IbGt855RrY1IXd^O>|%|J_rRM#SOzuqBq;KvbC=`aUDYPh)ZN_2
z3whKHmx1PB(Zax}z9lICQcYlyug8v}a#>hO+-{(eHy*neUl5I)9A9FK03S|s22FV{_#!nC1T>&uD+HAGce!0DQz0r;C-;6eI~&SW)YP`vk&@csM{WSIwLvs+=UV4_(H$NCzHY)4aJr
zddSSEKDeIL0d1A|PF-%NNR8gTSa!E;@-vK-`CQXzUy>67`gTJfeR?a7lO2)w3B9f-s(Fq%TdUi|?>pYcmbwHq{`C1Y>rDL>GttkWmefj8^kDz$5!MZ4ESm}5^1>8Z^@*iHcL
zCPW*dH3O8O*-tep5y}lN#%o(+0ml1??>L78kR0jeko&r4@ViRH^xSr@;nRD1=ShPb1#}`
z(BoDx%#!E*d#U4crtnn^@P%xpkr*55w!ly%h`e`ApTl@lR0hYhWfe7TFmNRxtj#$b
z;QGm=Qz*5|(=W;;)Zw7!5?^$+&&9t*b{UkJfp2%VJzQ8RJ^RJ(9iQAdd)2A3J?*dm
zu5}vB`wDV+{OLCJtNsUh7sCAivvfuDYD@8vBmeT*zf=F`$5z)zuQNaR?&&9wK3N4l
zf8Om_qzgI;sxHY-2F+;hSR0cfr19`R99(gBvD{ruP?|=i3mJH!Ad$Y70c%iCH1v$F
zJ%C#8)KWtRqb@j_+F0V%W$R(Od*q=bJBgR#f;=*`ZF_^oy
zC-*vMij%^HX&T5Tw2sTt;Qwmd!JbyZjV8!Dc`Feu-Fvp#MkqCNPaI)l!fV*4@B3%DQUuiHR#e!iFQ40z1t+w
ze$V%LO@83Sf9gFtaeHfd(hi>@muCUx(_i`kJy9NpZFG*$V(yoQX$~t-XDQ04wl6o(
z>Tu5j_Y;(rmcT8QWM-?VN$z%s{qe{CUq&B-&X&y09Vw1_CR#aG&F*Ws+0v$Xa;iv#
zWVNWH=qG@a3&k1~e8F!F=!E!p_*`2_jI_SSG)dVc4Z!Ou^zU~*!w6oO`x|6*v8)Uz
zS@Yte=6&A!Wa;nZL{$raJBa;m-B8~-b+AiGU7HisPG8WCl`fIyaBUQcc4rFf^xtzn
z>i)}Cto(<*+=BM+Z3$dKe|o+Td_Js%W|(T5q-w7&$d9QLYIifm%hsEyWNLVUs4H$r
z8#F7)mhGy^n5x=+ve6B;1MW8V(hY4?kKdf?y*ahGOx~;~4LI&X#-_9-b>e0Jn^d44
zxnArvWVhapK5e%`_BDdP18U;ZR(g^a+`{`{8q&9gwf8`xNsKRv!95T_pT4u~o3vqm
z-?jGkVXU7n>t?O%anfYJ+jwK?u6jY+Orm4)SuVY0lH;Gx-fIm98{LuB*5F1}r?``*
z{ZWPMdq25>`*cLH(~l1;u*6|zSNp#c2BUaDBc{|S9$u173w*DdA6`?)jIR;RmyLfR
z{a3nG|Ix2~!c8lMt{xhpAX>dNNBQb;O~jUNR1n=HY0VtGWGCTmSI@t^b`$rL+}}C%
zN&5tlcTSvjtw_Sb@pz#nNtR+TV
z&lsTi5b5!NX4mi|k$IXoX9jhxa||o*nN5%`A5P?&mygQv0V%;3GLU61H5x6QC1WAC
zrXE3Fe+H{Y_iApP=bjsE4%kv|HNVd-jO~@AJu3cp;daT(lCzlUkfd|`0ZBLZ=@{G%
z=rjxGx9LFx>doejALx#t%|`O0z2i;hX`;L?)?w8BSK(4$+Le-%mtg%5pRsEERQPXn
zB{|!mN}z-8!O(hhPR*-vYL?!r^@@g(<5>C6$r|MmtT&w$wzhd1?Zs{C0Fx^Uj#+xt
z@DwjfIpaMF;&A1A+s*{`o(L>wUn?!SPqyEX)^@+ojUc|JRTkC)Ibb=hY_cpyd_}aR
zqKhZV3E>)XgdgT9?0*Uf6h4(nY+9*vw3lL8=5un$^%EKk!Vb4&TX24%_MgfBMgFsU
zeYz#vHAW@9Ll~g>;*-isY0{^CEzOc&Llfx9aN$0Zua5V5?o3=OP{(?_ZB;09fFj*f
z_iFDl1b-wP{jj(=XOy}$=`KA8c6Y6+2#O#QFvf@Z##W9jLoxa9MrcM&E~o##ZMgKU
zy}P8aVP<=c-GA+HNLxRKF$+e=O_U@ER#3xp1x}XzV4a>5mlyg+@j7-<1AE<{I^ghxAEJ)nINZuW7BB5x_%EbqCve)$a|&+%8gw_mvizIbmUd
z&dMm*{jM;8cuD_J$_}ji9MHpLNfc)LH+K(Eh~`#u9HedP2Vw(p3XKM-wi);8IeVNG
z-#Dv#Ox9m(9W!yks#Hfrtr!ThZ_rbmKS4o@{jj+
zuAa$Bj(}$P_cX1NyYnXI{>I1Vg}5i>y(<&La2m!b*@JjT1N(_|nOsFN`_sBg1&OUS
zNc$Vm*pzu6ku#)u{+On+yo(yf#cFtOTj6xV1V#Len4*46DNsk=P~TK8TEY6*PE!}pHoc)1<&
zK3YEA)Q`MPTw7`2u2N@<+#x$rA3BL2Nrz7Ci_HKjKQMJOm%0d_bUW#kwY;R9%_-ZH
zK_{7br;iksxl+nWS5zR1U6{=Xa_g8E&@yKB!ORHNf{+g)6rZwVczElNUbF@6S5=Fa8$cwEfg*6~N+B
zd7U!{CXuJM2g=P$9*WPIwZ5(
zEIvxul!Vl61AgOB($IJ!8cN7dS>vO`-LSvFLTfBYUO-rK)}>*pwR+&#?7i#Jhp@cg
zhJ+1o=juJ7IamRbGf6W{9BJMr8MBb-)f~^TNCs{kcCFO@-tqaU>>kO*Kjr>0;T|cT
z&3iyOPwKpPphRVX6z0<8X~V1c*+VD7t15#q*&1tlGZ($|8=~~I|88g}HoapkQE2^_
zGMFl8t0kdf%@I+~?7I|evg;7-7A&1*%Pa`=xl86J1;K=$`X&^dg`tw9L3{9i1z}!*
zye4BwEBgtdS@G-9zMg>HNYqgg)Rk7Vry3IBA{d;^jBidP^i02v2S+8$9ii-O{2X2&
ziK{;kM^`+eV8fI6u5zyRSzJ!@F7X`qNKJf0TQ~zUz8|G{Q<{N4o1ynVpevCfuF~`s
zA;GQu8N&|;SW?XJfFX$QOZZJOS=IFK$F8V8s4WBhDf|%ZaBuE>I
z#2xX|BmOL^TPHj3r?Yhs=IjJWW_uMD2u~W3FO*
z*?H!vDi)z<&*Oi7pY==Y&0Q0X>?9TGUI!NKF{RttUV1c4aVx@h@xB0$V7OTS4W-7Q
z$c&}^(M0pxe~|2w{+@%3C7Ka<$ybG+>!B$VG@DmFe>BdP$W=GnPjL)aaBET_vTY*T
z7rXloBC>nwhgvy087R+%l)-eoRgiDS-$6Cj9f{qy*znTHGD?sxI3qpAh1Ro^0-
zX?}90bvQ2Duxir)=&|nbRY?eJDY49$rk;E5*-q)~&%An45Yje0Ec#DihJUfYo^l-y
z&Cpl4dqrJ}TVtg4eXfLxmK7@I_)qy!7p1Mo%rh?VIRH7ja{Q5PGst_y5A0N2SYt2+
zKy>HKR5B4p)Mn{_cN$Qjd?CvVrQYFu2=WltqTN~kd6C=ZGN4vf<+Xpe{gxuan=@Yy
z9e*pnYHrSNjgCY*L!a`hf7*GS29R+{tkXL(wv_zj>_aZ#rNusoYJzs<|bCT#e`ZW~6ptR-8m({Uw@@w1cTv9-ofUqCSL7x%jp^^;W?3O(AaP2)#
zhvh8|Q3INUia)5ij
zg)*6Dwh+H7xGn754CAAq%W#B7cRzgY2rA2*?Vmp^+;thKH!Ia65#!n)TsW+?`npo@
z)?r;{N#@y%en=rSK=*JjRbbU^-`enE>vygprY14@_Cg>8DO`@%2Z|$JtXZGSmlk7m
zY56EGjg$1HaG2)!0zlilY6!>|@d|#uE$3Llk~T%>g2Z?#|4H-@JC`Mu4GN2DcPdiFDkig7p
z4!vEE5KL>Th*cf97JZ-`GSazdL@^xtn}t*qKSUWUio+#m=Z^;KDFoZqBOjc6n_BRl
zXR)Z&wRX6dWBkEWH(YUqk>AxYcrO+Lg*-}em8PU3?Dw4cPaW&rFk1}3X1sKJ+5+-|
z?r}!JF9Bt2Q9QKOtr^I&iUX_9ZZi+)|oe2rHMoa#f
zsoC172?{~lZ{kS}roBfg$l8#}@;dDN9FBM
z+H>TXaX0%}t|55s3c^&yZS2gO^Q)`bgYxZ?0pi)#n{%8-fhC=6ek1J4T`^=_@U?bG
zkkJ&XsiA>m;U9-!$;3?=>f%~sfONy3IM|$jJ;U*vq`VRq!kR~=E9anb2LE8vu>7Mx
zob&Qp9jn<{(*P))PE~I&|-N4*m$9pi!mAc5@s+s*7Hzt
z{PF0vmPaPc5>?D!~@Za52S*}8DsOqa%3tlM1si9p9rH#o9!eoI47bReZ+rX
zT0>MMexO+**F^*fNfPUN#-&#Mx_8_xSQ%{JchQ(A(GcCUNkru%;#N+lqX81?fzXd9*lzSs*CMJH^g
z0BIxm-)&<9kYO}Y&*+`90UTJ?0Twpw5+Rs)_<#=Rmu8|XH^_tcYzD}(VEMT!&@dfb
zj8nO1KHjTN=vdDCrj|D=`M5D)e|tX5oXZfexZOF~vpZuxX{aFQ(sWftws~CIK{
z*o?2>Y01>
z6;WS@VEtq2PlmqGS;seeWQi+kP%{aPd&4dVwpGp@AjCFD6ni_o8Eq>JCol&STk~mt
zYHfQ<20OPjt*+!KJ&1H_l(PF1kg3Y?g{>UIXSe8e-;b#*1?AE>T8?Svmy#9lGLX78
zhHJHWhx)*XhTCK$P}3bnMtAJHC_g_6FDV>1^bT>erK0Y^(y~CkoveGmZ2#!nhk_sF
z{o^N&^9hj0QS%A*)4PSo^;S3`?ee8;&Ng9ydRZ)@5xWzCY|{;P^>r8~X{mO~R^m_7
z-ZXpzblG}Ud3aqk^lAR#M#))#Gaz1#eJ!6umpGC}tgeo;9#IRc?%HP`1;Kd{2FD^)
zUoX(qr#LH)+aH~C+_4-i8I#>8&9!?b9JoH-o{jhzQi)9WH)w8+?g2F=0_HN`fCv=bwlEB#QNwRwc-0G_*#KhPTOWOHD<$kTOuQTe)9gcO
z_0DTIL?$o3dbYXI@CI$WDm!y4-00ct4XGCH
z^vNARKD&HV*Tbn+?ZBQ7QT>Gfdz1?1ULeobcTSuTr>pMNjwAK=Xvj;K_B0a;lKY~n
zE5|}fP}3pz*%54MsIG}i;-Y|5~
zwp`5j+tYWtDx{>M&ckb~p1GCFyzGmDl@-_3L7bkm4q@PA{?!qc-r%z55Iy)h^rZ6Wq-y6`X;n9kVS;`2?
z=nwKv;6<>6XjTI(n!c9Xg$hpf)InSf@MLXxae>(sglykoN+Zdog(x{6DTZFDb=?@<
zI?$>yML?2#kKC!Zg@>{B7Ass}Qd;b&>nDwE2u3GxRDAt`dt%-v9#5Sw{;#Do#=Y_Y
z$R%%Rkl|3AluQU^1l%x(~mA&tW4o1N_EAVL`XMo%&F(_o_LJX#wm&W~4k7CspeE2ZByWM#a#wJfZ}yr$yFN7lbn%k+o{O5{
z?)%n;DRdogej~@+Cjq*R-rh;O6u=4R24UU}7i+~=##tFGK_fH$t#xd`PiNS>o=5&F
z`cuwift^F5PBpNlM+kWK+cK8i8gqO*XD$7(H{Mj5^`zU5`t8Y?_nudcp7B3C+t4Fx
z5dJH!@aW&V<1!=#jJY9?e$6p=!}Ey~WmDh;Kf-qm9xx?rY7w7KXYiL9r7bk&YxtH@
ztBCq|WTMoi?!Gb7Eh<*ktyA?n4xeFgT7J2Y*OC&-^42B;m99V4db+B4YENphAi(%wl$Fu?i|=o!cvno*oAMsRfR9P#0q?lNd;Jh$_@yaw*|Nc+1Ku$
zBeIWNum9HfI{f?(H0|%gt6>aQi7rif0X5Dc0j_M~WA}Avb5!!77i~+EC0WWtU6Rq{
z>{kEO>2O>~rtP=O>00M!QAtz1y7hY}$)^;x+ImCEy9*c<-mH}dG8+bDGaUUoxGgL^
zZ8uqPxZrG>H~o{8^I7?CYGpsMHh`u6AF+YYf1CO5^`dCa&78Yr->?$NjyTIBe!cn|
zRwbui*q;|$DbZe|I$h*v$5?*MgyqQ2H3XDb&Rdr|J_SwsO?wiJGMDme#Me9m#6wnU
zg>>Wf9N3GtbT(u~I@1AvwXGTg3+JHd>R;OG&f)zY`#@tk&Gw5^XrA#ixXQC&?|9M$OrEx`58j4XE#dQ^wlc~y*O
zZOSj010dD^d`DW1fCEZ~v4DxwtgHrOi(NIHl2o
ze~B5s2(+HV=drEmFNk-&`JFR&B|GLo$+$Sn#O)Hmhx9g(;zvm;Jsq^2TphlXkCj&;
z1|UdY_vJ~n(kEngvR}ryg;-KCt@%y^&2m#-N~cANf)8nFM%{b|{2}}mSh5$GOOU9>
ztc88q{+xJ;Iw$kwMiVN%)w=nx0~3T6Rci*_c6?U76?-_&x{hIOu)U2_x{R-U9SsJ6vpUU6Kub5pJUiik0+d4>4Y4tGGYJr5mq_
z{q>~@Zxa-U+9aiCA+g4fInOwf%+M<;6G_!+xlbYJlx_r(TPFCz6pr{;1cT^JumUCJ
z$`PPT-NUe!{O~Z^8lhe_uuNK|6|m4-TExAHOM-Jl<3K3(;}j8ain@ty*iLuEp3Q-bH6Wh_0l!zw>!&!I`jY{AGg$J
z6V*4*p!0RrCADpj+d>9wKEpp3gE{fdxSUa-7@NkE33lnd`&G{jN)4grmDR>sz@|=G
zeT(7>n^ht3wWUc{OAXw&qy?z3RPIV{Irt3>GhELK@RIL(cWl}nwyXZwb=_AU8O%=Y
z9hHUUuuz;H!cpIFhA{#QxVE$OUrO67GPT(_Jj1d@w<7VfKJJ7+X=*id{4K$A^+HOB
z9QYPF!Qox|NDd9zVO@YbjED|PuN(8fv&JjrS5l~Vg|($Hh=JZRs}<8H!}c>b5%m
zaPaV%3(zZ5+qCHW`O?N|^t0Wc)bB@)B_(lsn$4RH!ycyWn%ru$2jZ|h?fJQ=!terq
z7vik7D^|RdccWkKs
z2y&yIxv6;{m8|!~4_Vn2C&K$(oy$@jo&z9@f%P-5@>J9%|p8k
zPzhtFR}h)t#b@~KEkiwjRCiPdfOR-Orb?GqDbF*P!E)I)7@znjagK?S!)Eys*t%I<8T%bh_xipbv}TS7oTl7nmw$N(~l-Ov+}o!2!8!!*n6
zU`ZjDwp8kmWN^Y#fqSwTd?or%O+N|uv}JeyyUKOA3r3T7HPyd7uT5LsCJE(vxB;K*
zw(tMeZQtL2F4-@?L3|2T#ZWpjE4b$12HW`fQ4r_WP|u9z2DwW~;c1ZM<+Zz|?O4x0
zcSa}sckUOGN@}^~x%!&?&R|8H+$2idFAS*6Vo-ShAT{EXGniuDKcLUN)PSW|8YV
zWWC1FI`e@V!%C`K+rxm2g2P=6J!~5%tZP`ujNyEl!Atc%$}qfuNd$BVNYkc?(TY55pTQ{T>qUV;9Fb0C^9qT$cV%AIt*1A(1DBd!PW*L;lE
z|6w=%V$*rGu%2Ikj`VarS2cN+k&$&^!?xir(l%vdhD;sVn&WgSy0C(Ye-#tjt}
zO$C7|OS4QXPwq;SqhyL`N{VadmXk<`f-49j?&1b02>f1a&iVfS?$hhTv)$Ko-Pe8H
zzgiVOuZtgkj^+osTPheg5{wh%%f=M%bz#so=j7<9`=AxDOET}ZVCgn?y|IHU(-mn<
zYrJ30Fra5n?U7Uu=!qj1;2i8Qy_(O*ELzXizAA?4CFRLMu>h#5>Il1nn70NFH>LBi
z&o7n<(}79Q0z%|6Swdq{iWDPlzu4WOyUA*Z)aF{@OdI9o<`Z?8$gu*~Z`$aNpv}9B
zQb4(CMA*iwPB@IQ`HWzpz1%*vZsaKGg5HkYR*1=dJ$0xz(1Sw{kT=-#E5xRG?wL@~
zkPKBE+*`QjKr7zmact3UxRvMgBzVW+J9R_Gd998DCXrHiF!vzVhzjYBJPUn4f{qM{
zu1nc;cF^REvh+Fv-KG1$^(_b`@A-RyHBc&(U}MSg$;I_`4*F-~XV|94{AUIoVlZ
zB(^4@rws=iIbOsZ>)|DSPzMdX*cg*Cm5Yv#mZ`OoSr2?7nPpM|1{boGmE4##z_Z)O
z8ssa?ogE~PjrjEFg_&&SA$$UBl#NozLN_bnRt=56K!Sw?;|rocj~5>
zY)cu(Gs~Fz%fJ*%82}0P;Os7nzyPY__&EJm2L)VJoStw`!k|1OOZT7FZ?@wf)dd+g
zT2b1mr>II^e0xo+gzuWKJ+I)oSj9vIxkN=ucf*f(r%qim3@^B`@Lpfn@o|O1&beS}
zVkxi_fO%<7Z>tCCNLcl9d^nh(jpq|Hp#}v|v$L2GL(bCLqiDv`L!My6xmFL`8qNH2
z_#^G4e%P#8WsHn>hv8;lB|AN6_rmg_t9sk&4wSgrI_(X%k(r);Yc>$%UFhqw3hI$n
z$LNv=kc&WqASQo!RMmrAo;xf^UVs-Qfvv0DZCwCFIzFrqr#mV=@wS)+;EnP}U@3u$
zE4|tG@#C}pkiFzx&JLHE@%-*U
z7sOLIzU~w!d42{i<9JA0lQl*hVr%sk{qM?_=gyb;d_1_Xc_P9M{mN?#8E@pLAVc9m
zc4@S!e|kVLyFP<#Mr>Bb@PSm4x_)ZfA-#>Z)fgXWoN#KS4(?m{)|n1pD}-5LdTi@i
zy@NgL2g+ho_td|D>*$76ZaA#W79q^eZl-2<5Pgh)vG{>Kn3ORRVa88MkkwdJLH)9!
ze21kT5Y9p##PKd_oe(6*KJph@uyseh68zjp^E=3T3B6~gen_VpjFry}ZT{GKwu#8K
zb1DSAYFncAZieL00`=+Q)vztm)%fAngm`c8%ExYcC8caIb?sskVMcfj(UQZM__I(W
zzQoY>^uC0NJ;ICczy2#HamnDck1Z*~vMU`EqFw+yFu-77(gkm2o|xfFt{%G(hii7&J5iw2zcQ(&EI#2pQ&$
zwjuQfw>w5rw3N36#kUv_?!RL@XLuWrT*`L=UG(noP`tG(MTFc^;+_f@x+~zf{Amo?
zu7l{vB(1v-rQfqG#h#m_sjjmL(yw8f4O2r(=c0R(Cyi1vM{k(g5|qAXJKIX_nv&7j
zOrTfP)JrGnn?bp8H8qVEQZbSK4k-jUhBA#Cc6evDHbvMTkLw_{?X;Vy)+;1<>xFgA
z@@&!qqBQ-M8O>?OuoHVOOq?e;zrr3qqh=zd#U!|hIJ#XK5L!(6l*1BBF*k-9gBiZm
zH*6L*z~vfnP}mi2J0k|(d?9kp4KBuCX;OM___%Vt`laHh74}N1s)%E+Jf;vzcdzZ%
zv4gE{JglHzZ{+vnqF(G{VR>r={cYFM_@NTBdZ9+bo5@
zjfnorvw0AFB)ujlr&v86U?YFo8?ge=DG3#BqCcxMJ#}ZZ+}UllE#l}|<3d(UdN)xr
zO36)36dv!&$?(*@MVjLg2^NFO>7YCq)4ppvkl73w(^Q+v7utk-Nt>S$>Wel*g-?hZ
zwc=Q^F8&7iV~Z;lMeo~G1bdm;*B3G8aDk{{giBy}tT|tP_N6_e~Tb
zUCI8B|Ct?~*~Kia<|DoCKo$&R&&-D!q-9>f%g1leu4y=f)WjP?z&EM^DJ!w(wrJA2
zmT#upA%M1Qa#%gy&S!Qiv5XqBbh#+Nr?=%v33aXao!8U9mn$g-i-%N!(AAslT-66F(6yLd}Q=rH@VZHS_E_K`jj8N
zntU*;8HKB(rb|{X)7BlZCX1gC}i0kNF3>m
zIm?OchhSTBd@D=_Rz?wRlz+g-x$>;$^)I-JW^uJfwkW+?dRbP^fvq2f{R$uvgh$5U
z16=b+fL<6XAb(-?qJQ|3EcU0|uKpumky)K-Ky9B}LZzL(iRe|hQ%E&&R8Md=Qr@6e
zXjuo~6YMtmj&Qr%fC@vwE6`9mS4rVD=;OU1$hlnn6)51?z3;b6)A~s3;Ww1`r_v`2EhR2NYYs1
ze2H#pXNhzYzUJmalJty{*G)r7S^;E9f!<1g@SVlrgI&q+(K$c`d+ppd#{u*)t3ux{
zi&vWSdTVHg&P_~kFS-U=-%AsK`o?>J74#*%h2E~#xX}b#X`#^zNVK-s)C>WEw0IETxm_UyhQE)3mwT$9P@(V-XVwP;<)*vfXWdWOnYCHzD;
zrs{24%XjB`FRX+g2wV3ATGfWMmiK!cadK=zc`lU>G^b7EQSI*1f9KL*=1BJEuaEC&
zw10}>jtgqaq?ZxaLdZK7I{iGN^TC|=GW>K!q~tQE8jv*+e9_ZCEf!e{iN&C1+Srb3WN0Wt6P0Q<}op=eNa
z4Ven)#Q}|@`nQf9xt9%Nv?)23guxeyUUODxZBA#k``m$%JxYjo;UoDD2`~ZgcdyBT
z28-1Af1At{V8O?mtdMKA*%I+$R6BjfU
z<>_%u6IS*FxywAj9wg$JpMtGZm?~x8O
zbU81WHs7<5GG|bh!`_Kt)qXnig1
z?S%~w=vI_}eyNqs7ovh=j%*t!22Tm^Olb8iwG7Z-s3J$iSz&7oLRD9rHs&;YoX=fr
ziDA5J-mf!X7|pvz3|3y&*9E0EZwR~`n*TXO(7!dNW1YGJ_}U${jjF!DSw8(F3c;5MfbRWjJEp`CgA
z*vmhHVn56}>WqcTej#$Imr;jKBP+4GboZ50xkZOTuN2hJC&v=*D^|WeYY1sqYdV%5
zV$iG@+pZ6n&Fbpeuj?pbeF|DcDy`~U{auGk>^PY?5&GI
z|H9)
zp{$!!n3{)=$dN3uwD&=?d3W%EK#JrxL}|M+`)6UJKPtj_Q%q>R+yDJNK!`)qOfM;z
z@Rg_e0l9pjlQLhpG0;c!#~vBsZpyW$_Drhbx?;x^xAC*=G3;s}3?=nZEddlEPhWvx
zdnhXK<9lLNj24Ma#l~JG-$y5|r>qta?wAu)trp3BROJGR`>?mPpQ)+gCmiewGz#z@zfrR)(sj
z<_IGG&bN!ZfE)6N+azzaJv9SH89qX?&HmsRJ8E5Z?!}$}v9hB^vlX+p3{t#8HpxNC
zXTT7QR7};<D)}qFGP2o=*
zO}AAAPnRjmzdqkAzQplf7GwZDGM&pX=MnUTmFb{FUZkH=@_+~Mp5NAAT?sc^-HIGC
z&!=)w!b+M4J5v76L-;mI@S9z@*~JekI-P@^n}T7a$;u8c
zT3WzW-fQr=rE*2KEZej!EZVF1-1?AMU>{(iw>J!zm2amwO+c@^{+kGE+}~U~x}W^P
zNz+ODNNKLTDzNE}Gmv1uYW$KGVwdWK%JuCs@WQO623Byk)BE4k%z(;ojAZ5x$`~HlRm?D+7WWMgaMqIkn__Ttjh+2bQMXFL!mp4o8VrMkD&QYNkQ)v6(BPJDM^k5+39j^$Z(43WC(hNA~=oeDZcm$3#b4xJxl!iI-W2xx0
zjV3xr)sQa_7Ks~h%-B(^oV>m{X`vh>$nYTKl;x-@QOR97f}1Q>;y0-+ky4;6+Ety>
zu(dAMUx?I2&zdbqhvdnHF1WkS?2R86rJm>u=K_5)O!Lynkpo#EsO-*7tB}5!BS3wO
zMOi?$&TykG@ah+xCrtTDHC6*Jpi(A*6!N)tE=ENUd#xO%Z@%+V?x=R(2sBi6!c=3i
z+-N**V~(N{CgT%MjEn*yOtPcVMkp^rRh_F7>zc+?!>9PT+T|^EXSM!6<;s
z%T{(LczYzuFK_xnDfJqR*{->e-wH^-=$Z*3G!BEP@}%YH8>#y77dMbfich1`!*4@#
zyNiJen~RrA@$@k=aO%*~*p?N*eQpiEZW@c95@EwmjQw{QcNEHOQC61DPc0AE5@*2b
z4<`2K4T+1~w8*jdmqDAo$#}_AqcoV(AFp_HY`sSTd%j_b=fZAD({VE+i@4=7pB6b?*#($j
z3%Kj|ETi*)d#4$|9-?$sli+d*O!T9taaJthhTUqwsJnbwi6G?`t`L_V8EI`#PX&~b
z`&zF9iTNY@9+*}mm`K1#l=6zFJp!=i%5#9X#7K*HQD3#MWj0C^0#3FEbaPy0F)j*3PDL_NM19}&Tx!pqwXt8rLI;LOF1
zLGHzkkqen7f>VwI)OEFSf`Ez|D=qrkoJM~cWVy&F
z`_QoQZ*hjhH;^vr-QDr%TcXp-iWu1DFWQZp=iaH5ctuKsC!7RGX^+I>r(4!FVmAU$
zwZy5|K4s7F9`oFdHhjYMVPL~zx2b{0727?8x@_|*_c;yXV$<%(h3g3VgFM9~siU><
zmEl$G}kOS!%vwW?!@ms8YBiyJ8TMECnx#k(-J(pySw2
zp8(RWZ3^6e%aamLo`~GwW&?h}BfnY*Zz;DqD-CpUK(y;9I
zXsc!hP7BeuI|e{s;fpZuQ9CqL56t~9c-o%MHgIPi5L|DjMm!MYwqIsP)}2CAfbxVt
z4Poy%4rZooHJCZAtfNiSFfy9j&Z{m_-5&er58NR9A-(uY7gGyR!w-5JcJ;x%qHuM6
zW}04zz|a8OlmQ!cF#K|&>z)9fQMUr1WlHw&Q*w>ff)5-ynZ&qn)T*Js_M2&Kx=_Os
zX|xoClLs}B?SKT?r^nV1@Hjd*nqBA0G3CIFV?>0M#%eew$QR*Sb(ldcw9TrkQZUFh
z>%Oe5L>b7TaKICUdkN)yqrNhnt>fgi;#L&=7sGX*5s0tzD=L~%_m0*a{m;9z()u4*UuqWdqF#u{5$}KX|O8WACWSP*6!Q9!#
zB%>K6nFH}%pn(Z`Ax!>qhAsay%+Oj>v@Gx%`aJMCjitqGQC<$}u1E@$3AJ<1((Z}Q
zGj*`+_K?bWPvZnbPuYi&MAH^=oxP87&kqMI!Ebgu`p#0X`2_bDvFA>)q%QM?^s$zv
zo$<(mhM29zOc(?k0}vgra5_*n*&bmkQJucu`M
z0*Tc4=Xy|A{;&1%U5&I9fO_GbAyU)gz3fadxT
zt}}~o3Qd#Ut<4Io8R`4{p0Y)MYojj8#gWH@#`m|ps&zqn7FpRHum^|&o#rQ9309bj
zIM1aLqwMfp$FjcA!T)@p!5>n!)LuCP@NcwMuUIE?2+J$AE_;hE<==DYc}U1_jNzey
zNrY(Jq6O6N51-A|Bq#9rw1c{*`(4!=G##yC2J3;u;3w8)!uB@Kl1AlRCAFS4-)LV;
zJ?Y9mFcrc{u$x3j8+r#1^mqgV5Ml7kiTxGY=IrguV>bDox`6>J&C||ExIE2l%()R@
zxwkF?{i)q?NO6xajpM_Kta+r{#WgTz&o}k0^lIbo35hJzAdpJ`^ltAvWq%qNHpv5C
zRCNR0V_kClH#Am(?5g|7X4+@sW9cfuk3DR}yLbjn+yoRx_*LHPe(iy4Q<`cGoXC)}
z;#d)gEdz)Tm-C6fN7DIvT8@~3T!;BS<`-s!x{Wj%!$&XO>SYDHIIb-jYI(8tx6cF2
z0vM)0(u%o&+WLG}BVu-aKyK8$6e8PEEmKI}+7>dk#m}*3M7Hy&cu!L6zV`cxWAop8
zhb38PwzA61!@{`Fv_@zYuAQ9#u=>jT~3b`6#UT
zQu6~3vOOmLT6IK}m4cUEQ|hSb0SJfvfyHhWhfcn+?zB_e_>%_KBogZDq{p2|c78E-
zYw8wV^ekJ1(6%%tKY_fp-q3uFx=ATlo@h~r22b|CV_L3UKnc2PPezi1>a&I)I9G$>
z5gnCM{ZC&vG2Ti1SgGekaPO+o7%5{lr#YwVY33^qU9lN4=uLG2Cp$WtGuhT|8QD_!HF$sXy
zuCwRSY<0@**@B6<-byS#Wi$M!*mLzH7!1fUUuNDQ93%n;1O~&^=VMETD4(V+2RvTz
zcuXu>F~^COSLyP%a(|%JSM9&s^xMrdC+pMuNkumlUyjt)vk$VH=1p|Mq>Vs%)%?$v
z`w^_+>&~)c2_d~tKy<>8Thv7WkSO}zkCchV<_O&LP8#2=&LwA&moB4RJj9=&3mHD1
z$t9G|Y<}OngYtY`NkXTPH<}h@%D5(y!#A`9pTC~_NPRnE=m#yuD+gDIZ-znexpyZ3
zRcAvS4+sFi^o0Ln`ZFXyaosl>xbA}beI7{O5t`9?LtFBhWhTQjgske1JMYb6K%A8#geDR
zK8@kG2Ef*s!pOC{heBmwD1Kq4InEom(cYiORQ=4szx+UWSE%~WEr26!M1qY8Dy3q7
z+bE{1dxQWqW~#G8wo8p>y=`aCK71J7*;o^Wd92SnZQYdUrx+&d8M>}?#toC98;kLP
zYeAHGBgDN8^R?kcP0`iRwpk6}UcZ-62J|hWIEAVnWkJ&k1#`DocTVt_K2FIkYmKTP
z=x{|@>oX!^(?GXEZdnUl$b=e=>A(glE1|0p4}=M9K#yimvEF|s*1_boWC_WTZO;*>
z4IBaPt$+X?Q2M30x)Z})eo28fmq*0ipKAEh2MZ8WxySEnpXh3pFzzA3Rs&_zYxfwI
zTxC&R(`HR|=BV=M!kB_yF~{5BUB~Fxz+!TR^fkuv+i9Xt*b3v-iN%=q+5kYfiYockYj_|rMd@}$MFY#sa9{f)0uzFoMg*F44CNn|UHa^+#A
z6O*mNHKd_-y|Cj7T_CxOXweQ;bllKiFp{BRM!ex_V0wV`{Yeo2d9Kcz%o6If?Ua3^
zcXYS>D=wv7)>m4_OLU`+bakx0!tH;SRe3we3K5REP0lvAR?^K#y3yTBT*
zQ(%zy`jXOZ?oruUg?8YmvcItUOxG-Qy-2b83%hwqQc>bMl`)4ar3yC}k&8J=-uNI~
z6t@44mnb`+qckj`#mQG(U6`NX=fuCiI!c=YJOaySvH%BDFPoLszntixcxNJESl}i*
zE`)E64q*8Uo}<}=9CY}4bI{tnj%H6TR&S6^5Vi!Q6#=k}Zt~`h<$tc0@_dos>a
zS6roH(Kw|;h$~GHY&{f{+tT+kXMj^(hm8gl5uq+mzTkszjU`1sk|obsDW(q)Gj+h>
z=~lAxAea2%^J{lNnENpjP#`j;`bBpK`#tbZTAyCKxOk17g};F$b6lCrq_*eY_iq1yTfxubdc-f^4J(jYQStz+rtSB
zOFB>|RZH~8c|&}RM;R}WcqsvgE#fg6P}UcjS_;n$n^ib+1=I}_iK$Y3ymWe$s^*bs
zX<)8{kMgWkEQ|S5&zRF02?uMvLG@cIV$-87jV2TiRzJ9{d8G6UQ=eIk&c_N>
zb}duVQS2n5MYuSHS5Bo5hbgz)+$Q4}5V1aT8C!%~oWd<`Z&<}P*n^jzkrO5tfmSsD
zF?kHOa*U2{(GeqX&E)#b^?8LkrJE@NDO+K2Kg0*-R`rpsOb7TP^VO{^sZAQyQ5Wt7
z;y>)<-`gbpxsQL7-5zMJeQ{4)Y(DlxEv)%}d6wI_*fpEt3D#d(v5pAzF1=fh2`)vq
zfwXmz&&`%26VK?`Qo!QHlDlkHp&eoo84le5DaS!hLnkavQ{uk!2l$%(6?L2sr{p1~HLwoR|xrqnWAP3v4
zP110cv38_?TywiyDf4)&sxE~|R#Wzn@x~9k_Ij>tAtAt@U=^+Mss-!l_nbn6#Je+x
z+r2P<1D=jcROLWI)18?tMAR~G?aPXqx)kIDy?h3)g0vO7Xc;;X;z&hS;tB@-n`~^(
z@972=f%Y&;U1!|%x-;?-y3X5FH0-?0P+~H(-%J6Ss-J%}ejoO;dK9NCi!r4Y6(KB
zlJziAwzH#b!`3Wn{aOnSIYE#Y#7ndcKQub5{7CHT#=t{b7oTL~LJC)E;q(Z*?fOm&
z-)TX{`adeKJ+~9jcb^cUp6?UAJ8L)0_Kc2tkNL#+-s%lGTZJ`eqqcx|{eAO*$8CCN
z%tLrKC77?`(V5wnxxxb<0v*+h972~Jy%ibvn^g03yW=ixR8jxyQKGdIPJnF2bWQ;Q
zYb~=aNW(+OpXr}`?46lrWRBW(NSui`)6Q?F4F?Mh-J)xiO(5j#3OeKSyS|DQxz_VvF;A4{JxmBV|1!uJ(-5M(`@RYk)H@%oUj}gGfUI0H)
zznEJ{JHv)vv-DZ`0nXKI!960))tRTz@;1SCu_e7^6O0H`QqZ`HAj!QWLu!x0YG9Zz
z^_@5|qs4J56H1&?05DoZ-*+53$$or@A1_#dJt$fj08on;Vfl0upO+{Z3F63;79rA@
zZyEx{P*+cRdM}AmJ@o{px0<#YH@HgQj0PkLgYxRw_gmdVHvWcpsVzS;fTe)|<#*Ju
z!xep7FC_jFP?@p*%*O~7d~?+vHw-thj?I=&V`6-GOOM~scLR+_5)r>9hZMwyo;1`l
zyzh{HknBXx%4r2|$fp*^1K(O^#Z{DgY)nA-4Hg*vNi<+Pscw-D{1^Lbjy(sm*5p`0
z|DE-;?3^~x2PHp#D*&(Bf8f4UAK@z6YT>7VMsM+=Eh
zPU?7}Xtg42>R1Z~rM@nxE4{?A7EirUR?2(5g*=;D_PC&k-7*&)!thcZzI@=}*GZxa
zelMYl6}{}jgg71S*PrClD4y?ZK;NuGk@^fLHd=)x81zzmfTo3NYHg&=x_*+-1y|p{
zRXp2-XcyaV^8rD44Ar0Zw?<*ZT5PRvQHbVlyVU0-y1
zPIqSuWt(}(FvPoBpeVWpj+1VaLy=TGbPzY%IRbx97oC{Ge>lEnrKOoq5tw;>ur;rO
zO8UeVGxl9vYTU+7|6}`O{7a5H&YIP6{&2^%eRgYl1FLfL>T+E85g8_(<`{5=P?^Rw
zfySs|&p_A<|!MU>k!fdYRZDSoZX5r+HDYkkN+Bv#pNbGw@0
z!%n*e)TyqDhQR~)8Zr&P367XsHH{gX5!hm`*u{4(TY#rBx-=>%QNuygfNU}V`dcm5
z5HM58JDm&D4rpt%$hW0PQkEN67Wao!;`*)G`hEF4M!qS%0vqKt9)`yORjJ@9@bb+?
z0hLbg2Y1CIcSe>uJ3dMxSfYV^{CX)QH>Q0~&7*en&P?lN4fEizt~G!Oo5)L8Gdo+q
zw7GCKJrkbZy8%d*KtsxZsMfAnfCe<>UgrdIVusxKOIDE~3!1S_3cr`+eAvcF`69p%
zcN>@akAAA!##{-B(%J`qyi2p-2F%+$X3$O}aJgr_2W7ID{tp4TxOmvT>eAX~)R-B!I=elx5-R>%Xx(*sF;0DMv~xNTx)JAbjAa^cTd|bVR@T~Y
zZSl~)S07qt2kQCnKo`K{V^3pK?l~0R(ECfHOx*AikrLczWNmj8JL|%J7n5H4gh{#8
zDZ7w&?*`tkB|P0$)hGH&a{zC^c#f42S#0e>ACi)&P3sPc$9`T#3ft
zT}``mdAqCV$I)N(F#pDeT-)=>sK-QJlez27t%G?7v9pqPpmH(zPrg79QJiO&Y&P64j2{bR?EqZgUdkRxQ36Yug
zk<3C!nq{p^5>rSaVBmN&?Ct&!JV6FsoAwpPnORoiv(iqRh;t^+MYkipEAmAEv^2Ik%fZ>gordoCV
zO@Oo>fsG*AXeo5bA=;2~A<2;1e70(1?SJ3>LX^6pe7hRWiJWb0#o;MVqas+oUO+rP
z#tSg@`2YN9fK<`8XBylkS;MI_6BP0Vy?S5zrIy8^|52p#JB0GK
zhT}oBK{*k~L3ktpuib?iD|4&{fdnDS@86U~=O^@D+A14PJsXj`d^XZ-R}vz96JRT%
z0XIt0pm$Z?Yt5$q$<~N@UFeIm_VsSex#FPkO^LrnsGb_e(5vox
z6XhQ+@~17~lR)?B9;5UwdGQ7jOqYDb~G!D}NiJ!GC
zo@ILSYu$w9Ktb*WtADsbK*$ueP2tpyX>a&#Wro5}3#hpj(i_l|oA5&Mn-ja8me(@O
z6aZpjuj!KY2>$bgC_7to&88!_H@nl#N`D7rH*WZnbjr$Igkz0Cf!;rx0+8q_oR-6P
zPc_|fNN3Gn0{ig(&GZa-e?)^YaOPpjR1(S&&jrDdY|gsD>t}~{5>jT=<7
z{jMw@%5X2r&9XO*
z31L+Dp}iqt#`*W)oJQFL=ftt?nyJ!5c+9QF&+@4Jw?hpRKAgC&Nj#M1)MS_9Rb!x1(K+!yeaO6iU4C)B8}jea
zuYY-b6aqef=HFkRUHRAkU%zhq`os@E-hcP6Uv_NAGWY@wEQznWyKYdLdKB
zO8ElXrzxI2GWF}2+nN?>0Ndd17&S~>mj7{-;X!{EK46*k(D+y&`UYL9+L0RNLo)j$bVQ2?>8u
zAy3C-XjNg{DIrnbQT_fMeI=dN0$o(|Mp$TJ*`|2s$s^hM)fk?8TgG=TMgis5GdvaO
z1D$y_vrN9}wLImIHhNv3X0vkat2Ie_F}9)>-%ZvnJq<&R>!nQC5Xy(z`g2SdhyMPy
zBD-F^vvYTl^JD1GkV8YAEbXATuMag>ZKf^{OpkaJ*4eHO3chCRb+_vKm%qJnyJ{Q8
z?F*@v^iYjVSi_HKuN>F$V;O^6qJH!#M2Du$8x@+j{|HaBs>*g*kZs%k$Izqobo?S4b=U&yQaKXi{2CA-1Q?RpwfloHQ!F@`GG
zhyOfO2ZM3wL}49UkvtsIC%TzKhDI(T+EH!P-pN)wqp+yz^o@2F!FNa4{ewm0`92T-
zW?JWHKSW^SO)zhFYOtSn!3`|u^2nacuddq6Z~b=votZ9go4%JGGKsbuZIr{^%_+p(
zTzF$hX5Cs(V@#zihwYji!!fsSY<`>Fe&!o~;4wdYzD4Vqn)RhKyF9d?dC31dR1r^#
zkIGRaQzreS*7Sb$PlMHvekD-yIHt9#I?(UUwfL$RDP^c)#3}EvmA))+rVC8|q06PQ
zGlEt7{`*~L9r|t_;|q>!`V>Cuc}V08+g-*+l|O@2>Cx+jPl0WfD0;8w_s^d44c}?8
zpigCANwhm@f+gw5Q`k+Voh#K)cYBbgLmKqfB_w`|c)ev#W3R78Vrb-^ANq4$%e*~D
zCX8+hYlgVFdB!!}1GNE^ew5POlD{UlIn8#Up$*UB6XG$0oAMyF*
zKQ?%)%#f=?jHSh+NMRkTET&!RzmV<%BcT|>iB{>H&2F1M`Ucs^_(0X;6TzkgTF=Ac
z^XE==X-D-uoI2j|riy}NnYfzxuju&=hoM2epBHTK+^A*cqK!MM;@8e7G^8rT8Cj7$
zFdWf3?neV>LRKXgn{bl?TXpK&pWYnad3@y8o)Gy<%BwQpm6!hNc~D3l
z>t&UBjerT}h$@{Hnz-n5mM*^KZ&PA-4#K01B2SD4rczK=8}4AL%)PGL@}!a49zz%G
z)PG{Gm4V(1~QaBVB@_Lstzccqb+_v-cQl+hZCGh@jVYH#WujHh(e66~3R9Rc2nG0Br
zJx@n{{5va==E)yff2f&F-PV)@F-f>UnSC8T`(6Xs2N`IrmAbgw@iOPX7xYu$&i{y;
z6M9c7S#2+o9J_0&H%^h_%Zs{BsBxmA`|8|p`OuhHFW+oqwe2r(+tqE?DtqQezTcSn
zpwWhYPHBmscxBr8s*AjtTU%k3`E435^`F7Ie<9r)Cj&OnqDe@l?7EMCe6Qo_L*b+X
zlykK{!Y7OsqwW^V-r1S*!>y<8cV_~ZPu1Tg;(B9W2&-b8)-H}(nPAJ0VU1@`W;W;k
zv)PSnw^0MvHuVBdOU?b_bf_vSthv(E=QAAi*{)xqqceY`0hC9+i|pa
z!{SccMb1}4itLS9r1PFf)}eMkR0$wPaBuZGyH-JQ*m&Hh;9UOp9T25JCciC02G^z}
zM&^`aSx*C*npJw+!ye?27Ehw4GHZ!iE_;E9a_;e^iw6$2-R$AzAlgssmG2yY`VF^t
z)C~PxsHKzE?wnPppdm=+|J>F>m$%qX?DjH(JoN_IY32QggY?|l)*i$__t3-ZW#~zD`Ntp*+0??~U1HSzVA^5gi7a$fnis+M
zUkCZeu4R9R8r12&N_6DlHoX_x%X4lN;E{$Ye@Cot>Y2L-!#AN|K+QmVp`+Qs)(Lq67JZ7?R!g3r**m@KzC~U
zN$;tEP`$FWdj63A`sa=I5*X@JxtfmTYY>Eg_~FgNZp2!Uxbj)lMip^;wNLMETM)|K
zI)`2B)a!@6UHWtP@HgEZ0nJW_9EH`pMstA?0ragjDP;{`-AVX
zZP>fER&9!1J{8S6eitSyKGM=lN7^&=>y+)YTKd=~0Fz~sFUaO-h;jV79_vJw_45Dj*W05;04T5;ZeKFJ<@4HJ*e;yU
zXK4#lm_%>C&e>GPA1By140RAiz@Gb3>nj&VNSn*!djJ*>OIKqZ3F#To8iht>hAw2d
zM;(?X$OFSmx$hqVh%kcheS6e(6y~{KvS0dCkkZWryk=f*&LcsglfQ$aqWa735sl!a
zxXIthUYgn8-1y7lSI_0ppLOHM*ZpS7x|`PzmvxNTCk~=<{3K_8O{-E7m25l5vEAk8K
zpK06gpx=Xb5BZw}HSuTf4A`lg@N4KqNO>f#3f|uQPq$d*HgAqsVBJ?xQ~RlGUm01%IUo9!Jh9eTIhq9hcTm425r>{})|A?ANLoAlEnWX73`y*yecJV5sx
zQ-!3}>#V##5(qb0NuAGXye|1@56S7)9tT1<`o*bA0g-hfWhR4Jt5>DAaY9|Yj*^UC
zv1_WY836131B{caw=FtSc45Bphsj+Rk*sc+aArZ7Ws61iwgG##0PnZ*%F#)-1VD`&
zb%%x!o<~aQ8D&r%lQo(9D(hW|Q_BkJf{_6imS@8#EpE(oU3lv`_V{&mJuZ*(X
z)hpfE`Q|Bz(~v>$v7Wg={mSx70NlJ$>3(tV@@%ajDLHhwY~m7eL2Lrwhb?c`p71t;
zI2{i6D}7@6e;^iHwM^&b0M9)PyH&xx)^
z*0H*B*#Q--6TRPBRuvL#vGP{6V-|sryi_o)v-j+toUaM$qiYZKxC<$gGfv*Z1IY+D
zL`Y$^-GN-o@=S{
zmOps22xFNd^W`AOYN^k=a_6vFM0jZ-#JqFhDG^}uLV-JRcendjeAB+!M5)zyn&5%B
zJOj*T{_(p}e5ppF#|EpM`ij`8_4!g9tl73`vNGyXL-px4Prh)uNz3Y(v;-1<%+U6R
z!4D||kax$7h=HyBlR67kbBEjxU3^{lf_ldyF-z7z19rWfrvw{1abX7bJsA%#TZ7w;9>9e5kupsX!amT{>a`J+!&h%%XsP1)p
z)G||Y_&-8tR8WWFTS`e&<&3j##b(XQ_;`l1k3uj$b;HN^U)A4N-RpsT;dg=jr`71+
z@VziOZG*&s>Z27uJd0cKn4-{G=PW(}r=0U-koZv=*#wlX^M6TqpWtA#AOIS=HBq7%y4_P@lDc1V*d)5j4H37Ll~;hpry0(W
zfDcS*_OrIZXVcStqe?IG%!Jz^BQ5&UsbZP(<;efdpQSGUJ!{lYXMESJV(CSFR2&hr
zCgi3Z2Zm2axz4Y_#Nm$PS~|`iz58Pf@uffMFMURL`tkHRzoCb8?DGOlRZ`rS9>(65
z!QrXU|Lt`qZF}3c+_fk$Bq1_{O<6$3pm*Yv{|;mFUmJ-;<6-T03HR!PX~&K^)HD{5
zySizlJ2dg!pV2M^J-4Vpf|3o2RkjiRd1fw~yP9CU%pOU^?9Jg~6MHJnl0KN?*9MPZ`&1{c
zR9)KWv?7OITKHAOSmoHu6t(oG`SrZ~B6R
zSAVpfjK6oPv-7&6{@AfQ(?;%5V-ev)k+mXe*n5R+bBe-3-0G%GjxZXhdq-Zg{x`uK
zTm1gBwq{*N8iD_a{28!3E+a)!N$_gAd5D%LQii@b*hVJkZCoC6JV`XhO
z^~YD2zO~WJI368}EAA$O3mpqx>_f2+N6C&lszAF63J4T{*3PTHK4i+4RM2`=JF7hSF+Uv_kYDD
zlh(c4)$H9%);kyCdOD*k{WgR(@UX?_*@lGa?y5*58NMfzci(yNNZw+WsBrNbqzyeZ
znSP_x*m-p%bbR*Hk9sW^WuZS@ICudtEoUju+HnVx*=Uk2WR1?5f2;A|b!m6G>zg?^
zu_<;SJKATp?6f978z7X9KoG_olWR=9`VC#J&q6d0+rC;q2wMLZc{(&c5cL1oeX2Ti
zlJ}30(W0b7QG=v;W>&RRvzYaQJfXCBb((iyTst@34P-w9ZyJNayQSCvCN-Dp_I`Tb
zwl&^Hx*#TzUFenj2i~^*EZ)B-R{c3@U+wEW*Qnd4quI!J(XVG29}G}9_23m_ro7t;
zDEg@k)|N!it(wB}3X*bKjn8s430V$2AVi*De!>}>lWdxkbuld2XYk^|96bQ+x3L-8BT#U|qT;R{)IL&oc*V%P~K9w{(p}WP)C#C7L53jWP5%}D`
zb5%d*yqF?huJ0B`TS{`bFSm(?R3B~KC!E(rAN?}&V?*9j*{g4qx-ePbnY*X)g5tor
zAY2UYD&|thn&1#_4X7
zyLbu04WF&p2Rj=YOB(?aH_u=09(kag8oj6`+taj?MU&Q-$JZ?x&ZUeFZzj!OzKUM`
zhM%CFo-6-4+B>W6n4$0#3{JvC#694paAv>H@sE;r9=Fpl)ghk>J360@()Q+2O1g%k
zU%4hPDeG@npA+J;2TKNMUdAM1B?}&|;N3PyC|AObW3-hOx@HB~P`edTFyv(cIF#P4
zg{pb_UiNen&RKO_1s(!!h2c!G$AlrR1Ed&A*Bu`=V4dOoRsT?(Q?FNewu*b-TN|z=
zoBC;}(<93Xci5IY131Hn%`2wn6Rw|>w>3BvP4PkSY(F&YW0o+S{gFyvDSbdWynXvQTACjsVH;qoU92AU48?Oi4MvC1z!!
zlH5X~PEI^}QSRDao{$|=TF$grszv%h4NN;TWpWjUP*;CArUTp^J>YQViSi5pt3n|wq_(7b-`z&{|Y%DF`DM66mbWxzy?3g^>C?$
z8g#Lbm9LEAW$vI9qqjqFb*{-V=&_scSLnaD3nd(<3Ju-zMy5Sb;d4or_B^O}*{r&v
z6u*55Y^Efg-iz%I??U<8t@Rov;Ssh#WdgC){mwm)&>!oVOt8S?`wU4~`WQFEVid?P
zK~p4aKpHw^8*O17d$t&SsZR8yy1A`EGz%1<*eNQ6H{1ShO|~4!sgG*t3b5O^r%L=#
z2t!TNnqGf|PC<$tGLq*o&32vkz^Ve8)b77VTS>~Q*Wo*_ouAB=M$?oGF}q#*pr_Jw
z`Go{!V_B9Fy;l<*vJb{_7stf;og_a&>>*|r4hWzk$H
z`aiT9UxG!zin!g^7dw0T@szI!dH>fdC!_TUTkw^cy}f*gEPk}srTbw
zjJBjh5Gy#i>?N=#l2EACQrxJiI=DPbp`irGiiswOJAE|ilBz=emLEH`ADj!
zF-eljgMm3+K=^fqAXP{d(_=(vV5}^7YDCEJZL4dPrn8C!uWk7cL+jHpyA6@`w@-x)
zNo;`%Rhlei6(vM+QA2)^Se}_50XXQ$JG%7s3*V3c=U63h9U->ONL&>Sx4DL@5K8X27C{YY}lc
z6{xD*ql%sDB$`#6Eo=ds0nrD4&|hnyHhb(ScIgNn`fT_0bfea&+#l}7@%Ue`9=ju|
z;&99Fx~uZ;W(#FhHnU>Cs}JZydVrsYOWMR>#+m37LRJ5Z>@IkSD04nK!n@R79umW&
z48MMR-&PdFDKsqHe3+M@a7+hosx33mJoQTX5L^v?s0No~x6!h`;{Oa+4mWnQU8S=b
z$GeXDkoksSNoCFuULB`P!Gk_zzP|dT)p$xY!MhUCBn^JF-RH^6EU*GXsZ6=|SP!y>$4
z%oUVY*a?V}n{;iO{6;x18c<~nRU><*B*l@>3Z5PFc;B$jxAT*;I>S!;ZGDekvH@wl
zO)+t&mbKvUkQEGw4_}%L;>B8*hd>!*=
zaW{BR#t-MqzeTSMUBj7`Vm7OC>48=l(YXbc6h|NP%Z}$6l=R&Pb*J+R2mDFCY}1l9
zaWmSk9y%t@E
z`*e4WEfc?K7$fezY-#t{L7;hPLKIe|T|)eH;}A&7dn6P+%k@!yC>j>5iZ9o-b+5XI
z>YQDlh}jO$Yh?o2T-E*$fq#g-yT9N9Tkw}Yg8Ii{K$pu;J?d_Z2wyrbRi@`@Mnx(^
zDmuenB7dg1X?Cc+jsb*U2ACzao10aNi}4u#w>SZb+J@_r+jXteiAdz$KuH%9u(`k>p(
z!+y+_$3M5A)teG1lprq=!a2t;&1?F(s4{19u(e(42uS-hM{{$w^QM%5(0eugHm%wWcQf?gD6n!Y6f@noB<4FE}
zav{xUU)rh0hj%&7sDC!t2~1nU0-9XHTx(mr0R0Iz-74H#P!w_SH`Uu~?d|Hcd;WVDaifdu8`Fr
zp_*^$1%o!Fegs|4V}jUv!Y4V8yXe+1``JMs&MBx|+Vf$I6VHYZ`DM%9L$$q1HT0kH
zQ~QdAYs|G$#OAc#;=AgvTJ0bNel=mrFDo9m3f-Q8mN~SmhK6qgUMKl(1H%2NQoWO?
zIGgEy=G?#lsEiDc39&hg%_dn1jaE9)g&Gt?9E)1Fj)>sDY^ydQ!GY|yGmip8Xbq{I
z^>t4xPg#pYV%)+zMCD!xWjfBp>{n)QMV%kJ2QLQTgUrfYWTeR=_%uQ(Iu{*@@n4}5
z<^c&c~2F)1fJo7(0h$BC1QG6%1m#BLKlSZatKv>En_ip!fjS3n;$NS-+%bcC$r
z=D^o(dP|@?s&W}(t!0>3bC;%6?W`s5tXWP5*3N(xPjpJzz_$(?oHgE_GA{FLlU|Xj
zq072Zo2^}YyF1xv;A`ZjFcx4TkT4i#g1RR+J
z&e2k$CI5gqcN^>Nj82Hk?8+9(XwCvUn?^#F{Dg@i$k6dE!=+I_;_hj}gIh+2q8cZw
z2t$|M$Z{+&!5{?H05Xc|72>uSUsiTR8ys`5nreGF-n-mISurk8+>#;N+mc?Tq6U86
z*d56MId-GhfoZeRvTWBW9L^(eidIwqkl)>AA04Po12%y0sW7IrV4eRa&rm{;qa1|NsdHTD$vt^EEX^Vd-X#BcVN50|ql$O*{K^anY
z+F8|{0W2Hs*0sVruJ!W-uXEQ1!(8ek6X9Pk;3dwmF!0Rra-HP$uKBCq=;>LW%QSOY
zP9GjXtiGCiSHQe8F5+PM_4bn)2*uO6PMxHsJ58)|mUdwN$M6)>JhK3D@L+qmgIze8YqZ~HGT@9)mU
z@ySbwjWI!LqxikpzUejtC@5N+Nr&?^HT1@v-_Lmu!?s1RM%eAa#T4Vs;PE?eYA^KD
zm;SVxa9M6sys#>DS-Pjw(887Hoz%M~Jy+Xix7qLRa&Bu^+oSl82IOV+6c6y~?|qSt
z>HxXS9Oo1!%{U~5Ud;h7ew@Ey9D}#~n~E7ijRDWUa&(gY5UWp5
zwXyp_<<67K+4J!os9cB78A*xHdQO<6p$7ge$~ee5YJzm2^O;d^E~N>yqY=%C_dtrG
zCKtZ^4J?Dti077jAt87|B)?cbUynptolSEU((ey=AKZz-LxiV$KmVu3v>0E
zJ-(yw^M3WL)*Tpe3g+h(fL7X0xku&>;ytI%*h8p+<_?u+KGviXk(tW)K
zJ!tX-YJ1B2k4Re!a_nj
zZv0zDNB`Cwd3!D%Vq-zpcT6L1(8;L7WVR)4bf6euqd*af_@{ARE1=82EI<}99PFXR
zxPsQgaB`r(tILy^BTsgAHj;Ouw_1MhS1+;BV2OGon5JlIeC|p2%xy!4?Hat_2FCfh
z2FqV449&jnBv{9AaERfqdz_g0N)mkb_n||w!uCmJjl;-{Eul^>n5DFTg6pTI(E~w~uX@0adM>juHq)hFmlQYu
zWMAb&TKPK?y&uh9k0!{1#?3x+xKlfM5j{3cYP@Qg=)gR`e!koJI#Xj*wyr3Lw#l6D
zb8%6SY_uoS1!Vb(p31-9WswJWtsN9Dr8-2Amq^=+@;oPz>MInhRD;GIrl;%5D7nKy
zq3Fk`%xdCbThX_&A*&;nTUQscezH!pfytLtTSt;f)7$l^T*2rBxaaNC
zm?Y~H-SjA#(!y3#NlZgOSL*Z{5{ceX%u-Lzs5rrpPa(!HiV|
zPcbH}H`sL_r!(@vsLphtM;LVl;uFvX>edu7%WXV1#+kX#qzZ<2y2jHIp8o_pfN=@55o
zmn(8{Hz+r6Kvp>ZNYuUlynk~g-j&V3GF?NL#?HGFnRVC(>Fn_?FCoLOR?9Jyj`vuY
z>BNqG+G9#WH+YF>i|Vx<1C=Y8Q!kJHNI2K{Uz1HX3iow6@Sl2+
z{VjKQ5Hb86r-fA_=M@X$c1WXLr604R?mWwX1>GY&6MN$R;@;-R
z|3p#%ho^rz>j0~E@}$cJec^hq18Mz_jt_kY8LcAz=S`5B*esOiZj5Edyq*xzl}j12
z`-+mk$ka!p`Xi6p{~GlyRx=Og>Ji#5uR?k1AYDCB5_scOzt_P2`+_6ne_>Mu-*cK|
z|1u*dPph3wU~Tx)inmWg!O}}Pz-qIuoeG=T4LHWchP!oT;m3&t$+c6`r`l
zb~P?>=T|CO%kO{aNw-Su)NF+P3cudmaWO9;ed6JVQhUSHd`1dxWg_)M4hgK6LJtZT
zZm%|to9%Zwv-!?y>vF4|dudhQR?_7DaoJvH;cds}$9+1V7n(plgPGBZT_?(*>nYGe
zQRmb~<(X{dr-Aal_|U2?9ZAu21DPSDl_11Xn63+d#ULXA5bBnsIfHc>I~!1W9548zb9|LCT`mkiS;fe
zAiZ2PNluh0ZPISM2T&-!0LEk&QmD3;a4k$lkHl=A!PJi-ZG8%BA}`3d4z&}nFL^jH
zOO^|6uqkH}jPPDDC+30BIl9bjaWi~SkR{n$;P7KFh+Ji6S$4E3ED)5g#3yDedK$zH
zAJAK!l0=W@mWELcfG&}wPS7`N7K0!CmLdMbVVN7EEd9KW={wjWZCG;DkE4ZHU_Sit
z9$quOB>Q;niXcOGz<^|)JhfJV9#
z*Dw>YeKax$IQt=aHB3OLFAF^DH0gyl&&kjPYafU|Da8~FL|Q~;EzNapvxfbs`(b35
zA3jI^q;zrr=2s!nbV#<6#;roVM3kUjdY7Q5!#d!fRB1`E&}k`OvDA+PB%j8e
ziQ6irzTQP~2t-`vmT7Fb-ohg1Zumq+&A$Gb6SGbE_`w96dQ7OAk-W4Us^D2pL9+Gp
zCs!T3DONd-I@mm26W^4fQ?P8%#tBq?ng1A2kdN@yylJWVTRQ;9FIU>8mLH%XmDAGN
z7;edK!R)>)OvffZ4OKm4p%di+mIZJEcW?($a?6aY$DJ16ZO0zpVg50NnUeqc0{L_W
zEpQ?_BY%_2VcU_tK!E+vUE>Yl*r~pRx3i|7=WBo@WH4SCaV}!-c1CopO4?ILw32-M
zs|$jee2Xs0#>a8Z+zEk+@YCo+EQ%!m!d2G|GaZ)`dL_oFexj}LeyK(bx`f6dnU0UmMskmYIVCx^%`<w4ugQe{Zq!q58dcL%|X3*ynr+R2yY-z*sX2BArMzije@d7`cYpjN(-p=b~#QI}A$
z(^Yv`yAtbg$4BO6^E}%o*|Fn49enZlfgR8Z@}nLIs>_^JTE}Ujd8={3Y~G(0PSc{P
z4BAhU&f-!o|8RQ}U3A83bh2o9T5{Er{8^%)mk<$U1|$y&;q7~8oOQQpP`$709WC`I
zC^vN_9udrscM?gx{?^PtW>@#Dy;A*sY61Il*#4hA)h@nCHAf7zt)oI?a<2`G+r9tV
zv0mKG9@T;h)L5>#*ICfB`OL|2Vo~xm&v3(G
zg`Fa~H(PLLu+L7EfsKOj?G(fY?rW#+%^AO_spSRY;t%?9Z)U+Dy#tF(Ib75vVyDy*
z>VkWh{GDBn-^@m~$J!*+W;5LMrRHf)o8^hkr7U^ZM6>nMd$**%X=3eUacG_-zk)XJ
zaTbaU+uRHQOa9h(l#3_UyE|oM*aOC%>5!h_?9Ip+OA<7(#*X?$9FWNG&=4rPLN0ua
zvHU0lcdRdR|LjCre=emNi+RMT{rH9Wr+lc$Ecxj-WgIMq!xho3V+Ri
z?sYA02*m#R0sqJo!>
zkaAS;e-&z+_-^MAppKTO^_Cw#a6+?vzP;<@!kfvtS>hY(4#$^Wtlxz*~hdq%|@LTH+Q09i@o7e4e
z5@W}6g~>Tx`}>hkI|o2VS`TcNUrj7$>-EPU+A0t&9VdoSwLwgv9OD%|mh_;bOhXWF
z0(Ibk^%D6BNx|7w^oF~5VNW}vK%TR+o|Eq%6zPCKtlL`SX1y>^v-8S&!#bN
zUr!J@n~CKt#ug98)+LWWoTz+acH%3VzNktz(Nia03P2@|y*5}?gn*6P&?X!>f%LLy
zi)9OQDH4O_@Hb0fvEGM|Rj#Dm;z)v|9SLzljpRA(#q0f(T-=ZOXFx(O>>RV+{D}*!
zF#JF4X1)o1Uv)+Yl{~2h7Te?$ZGYlyM>vTKLk(Vp!%+waM8l&lq1KLU|xP
zhL=P|Om0^_5tsdlyE6ya}i?P}+
zwxf;3fkXx$
zc3t^PE1SF@s2s*CYG22GS<(#B34f^zYjg1>8Q8=S;?@ndLuD!Dy)9$hn}-NW05V=f
z;o`CAdj)VptX;PnBr)RPc`y4O0R?;^!=PD>#-4Xg{wNc~Pc|ei#ce4H6cKE^Usp2A
zzs+7bS0Z?X{)j5IRVh@k(Fv(<)0oof)d62Z2v2hCgfKx(MvnOw$S<1QL|Qb1ntMgF
z!JR$-ttPYZ;UBJh$sSV7T!@!sToU(Kig|lrA~e6L-ykOV)ajJj^ux|ylI61tedjb_
z{{s3>ezs^{+9DVi&!TiXarIHUz>BM&lFqj|p$jD;%-(5qBhUkfTou1dLse~Elg_bX
zhU(gK(Uk2k0yq;8b_;Sbbw?th|>sufoj+b%9nYG8Pr#%L8H&GRbdwi|y3pshKEp)uBx&a}m1g>;GyUnKK=U02
zCRn@i9AYG$jAc`EA^kXDXz>i@EmU`Zkbdb@aIPWoi
z27*zpbm-e5p2%~S)}H2~lDCHfw#V2Ebgp|QfO6RY%ur%nopzl8#S31_Z;7id@&FS+
z>6grLzEHb$@vz=AOQy{+61>V}OS#|e-p`kBS^jy<*1gINsp;Mh!r?Dc2QjBf^22(z
zzF{Y0K*4Ne)mWvwiJ4Lz=%^kV#nk50i>ct5nE^5QT{$ufhfec}jURJLh>0KjRPK!;
z$N)T~GR-{o2C-04;~I!hm3?UWo$jlKX!aHkQ(vVq5xdeST2^Djc)+XR-nKISD5eHKJ$}6#9QyRsgAXY8j_+dE*4pdlg;iBM>Q?T`0YKl^9Lok^Zoes-_I!zYQJJ)W!QGzqHjEDC264xE`cBcu1<9-`j=w!?Mvp
zGm!WbFkOlEu{LKN(+cedkI2k4prMJtod=BU1${yI10Z~`>MJ*uw-7aXtU$H+ay!dU
z6GjMuAhl%o^1DW`ap}WmH~V2*-`8W$TQ#w5Qaz*C?9Bag}JA(zn~|OLMu&RF88j4V)4Yw>!;&DSgZno>d2qJ?nbX1)e(5px&)1
z7}bQ<|DB1@xWEidOS6(_ZG$n07GeGdGV{I|K7p4UH7#%)6x3QUV
zWt?K3Hu1;>!*kb2<&~54?|PfmTp{xVM-0O|Dsz|)U&6d{PzZCgng0PC2J0lGI(Ygv
zZv+{HT8**!1Za}K&WgMKwitbRDbL;0QXb;(Hme(i9G|&SbM#@_3-}v;)Jkbip|4?X
z;r<6hDBA)RSKuVN44X8GMXjwbRZ$vOR-YD>#CLvrTT%d`jdcUOF>ArSzC!$kT|1ff
ziIxMj5fY=le8&#Own~z^iat
zfL|%SO4BVun}WpfE9^0%N*7e+<4}0y+FqX%r(RtYcVrHkxmn74;~GA!8){+Hc4pZ(
zMnaEP8}&34c|dXLl(+XK6QXN?Atzq`*=H837k>KTH&-o~7R4$m(`!(jJ~TIbtNQk#
z_`s#X3Xeg0C~s~6Kp)19Cr*`J{l{FRrqGuF5KkdvB=4%eBg3!fM~&P)$A{CEz^`6=
zfw#^Wf#_r1T+;&_2}Zjq9~@$%Eb7vOMa6Z`R@it`IGc|&*q35M?22F{!?Pxm#vgri
zqz-_Pcl+`oNx()%D9_9tj;P6C`fAI+>}radPQRiZd-A=e=b0m6*Gw><*qrDKT?y_9Gb*L;O@*SnV+^HHn
z4X&(_rWZJ_4ErVrL7X(ucLwK%%$m|lFDfubbDSZhH|PG7(BB}SoZ=KDn$Lpg09fl5
zH{(iMBHR7HtVZ`z=j>ryqHfaAy_4y=kg5WIl5V1rUD_lgsk8|b!CPx)e}}#Wls6uS
zGGu$}^`7jn1)Z9%3att06+yadL!=e5&pfi5_3NCf4XfMES(%2l+spi+Hd2GUf>3B&
zNT4dFBXb$jjm4tM5m$S-C4J(ry@7RIc3YwluT`eOtlan{nef5v)E`v|TTPH1xQSiO
z6>+!dFM0p$K0qT=H(0bdhcdpSr4*mg*I7LWBND1YjY(T6A0E3O8hJ1Bp6v)ZQ_7dvjYABz?oabu5ZQ$UyxOFgQcM}#zNO@&A%Lz0L7ne
z4(DZH?I)_v!b^QS{Xh(^uA*95eHFCS-4MewOIrR0Cjt-(iBzEckWzT_S@kM3HVK=19iV3
zn$1oL+<3`h09a#n;7mA9g{Xd5u`A;sC#4^!bQQyph(KxF^L+5L)qm9+xwx{wcRFu{
zz(6cUYBaU}ZQt-9f3s{Vo#kNx3axU16E;qmSt+mVgHXR1255hk2R05J>b(dGhGk*}<{Y8jsd8vjQU!8_
z*VV}>G@^0J0zaNaV^Ob%$ApfNK$x!HB{{Cn7t}dLR2M;5tV`5mBqo>!ffHsA=b>NP
z@lD+$vOSoqlx09y`!L|m%|Oku#1kcBT<6?RFWL`LrEg#M6*u{YsKdFu5jv{+Psl{B
zT|xL2QXQYJD+_}F3kb!rm^-k~Z{Q
zqZKgGneGLoS8ef>Nzxb~DvjtVZC75l%E#7{+!m4|t8c@kbEqj(VIjltY;&QDveMVn
zqE4--_nlq`y<*!Z#$l7HC92oe%Ph}t6{5Tci@z9W#j4|)>Q?_Oaj~KGR7HD|t^vjh
z@<1CM!nuO;AFH3d$adLrhbnr}%(nlEH9vd|yhm>z?Jl+1IT4wfyf^}|w^ASTR5yHH
zGyy|95IY2Nr`sL#lhFZqTpfoss2vO40xVH3yuL7VLU7@EFUv7KQ?fY*rHNlTU;x7j
z$r(SRx-=Tk?@%+g+91^K1JD++GG-HDQUBHTW&>r!t)cm~MFF-#;NZ8joy8iM^6VVC
zcAOvHc`t2{)%nnmT$tO2jWs!$7-RHDfCK8oiO|^>NF^W!`XXcGB5Lw!;E7_6zgFw*
z=az&!cI-(JF?2e;!hwvwq*GRwR@9Wr9}{N{1r3AquO%JL>f4n#Wak_mQLIUX=54r%
zhrIUjNyI7NNLUbPa9>r}iDr55Net_8y>W@8(!~akLzP1DbP!d!|G=9+LP~B8`PDQt
zyzWvr17U6Q^L$g}V4j(oY0ijiM7CMfA(=rmg*>B_o)&B$wViacN&uwR?&Aj|X;D>FZZ?8VjBv02yQq#-GsKn;rnf48U1^Uvcxk0ZhUU
zo`FG2ULaN8*P(YSYUsoqCi-`iROQ!XdS=hmSQqy8>^;ycy+UlPH37})3hNK}xz)HJ
zuC>U-z&u7#{qIF(NwVf(bKE&TEQ<-af`s_TXxm^7P_wzAhjE9^tU>_~5cs|88N-^=sLxjr($#1GpI*#;SXR4f*?lH1|u-r+d$u
zV7jNpaUpTExLR%5iABLpop2H3)y+~egPQ`PHgJKh@0B|c3!3PmlJSX8o0K0$+%MX@4%w%A1H=KF@YS}nTz&;;feLdZ(LtOQwH
zKqS$8t<3Ui!)9b`oMDJMaD6=+1cxwyiD2DxI`5ak&vgCrvbrCY*Bo`c*o7FY3Q*bQ
zquPpLhC-vq1@TLHegGkzDCPcV7-kMD1%o~WPp>pw(P95$7#SjNun0I`SfgX$S
z`r5P6-_WAuMDxEmNOk-Haf3)E6Tqi~yT!F?)mi0|@OvK`0^!_n*-CYpUO
z&B(Gby+EbN(IN1KqBV8&yX)JxxXxzP@@kv)FMZLyfE<8`i6CrMjw;kN0DB+4nbXZ3
zwgNQpY7xjiF8zcV|MTU)46k8_vW$?P6uv&nt1hz>++mwWbpa`?&9bW#_uWTTU2&ag
z>j1{|DKR2$2?(*I0DmUtRq6>UZT?@iA4k)zPYN0A#QZKBs6OVsQpsFNufHknp@|+@
zO?K?lVcAfD>ibZ!RM&%KSNRy-tPV^VAK4yXF<-p(Ho88kjs9@{XR4{-M+ithHu&U-
z;C|=SX9Hb^joBaw81*4YPdG))tUFqtGz~e6QfzVscq*yTH>=Lq&_hQ%4pZm>WKHr0
zH{Q529jyeE_1E{no`xKs>5>Ou_Wq>}ME9N;!Al2k4;=~932_q-BX6v&{ZdLq&4+4}
zAm}LRP=%kQit7h7*UDXJthxfeVQgtA|1YG4p*zp4Ngba3e6kpAk7LbU6Iag1;{18X
z*P0=oNi;}Q$aqb1_&f6Oz+8a!oyitSWHF+}rC$o`tz;Fo9q&e0*Yb=PJN
z1|&ZYfUMRIa#WD3A@SMVQ~wo^@-P&yY&)K#AE=vu$;w@mIqwggD|GmJp4a|YtcmN@
z1#qdUFmDemX<8Kbl4_`Yj3RCt`Ayo}b6BdEvRSPDrjwbqB>x!kln~p?J~jVqU1fRn
zAr#OO1Blu-Bau&m{MTwG9OE7sO$N1A>=3;-ZwXp!0wr1d$ImCnkAVo&d~UG`J9n!`
zH|U+SG0MQl-IEZAUi$Q6m$zm8nc(=0{kS>ptt-5Q&?98c5)uHxzDO^Usg?@d#1MB?8$4v)
z5WwEPD<3AUHpphqmxH|IxMQCHv@sra&B7wM1`tXuE8Z4TvFIW}UtB*6O$EtTn~(mN
zFMGeWkU$2=4FAhABYsn|M{f$|3Gsx!%BNKNn@`PmObr<|=TCrMR<4chYzTL@6}!Dz
z^_YO!SQA!#z%X%L?9e{S-e{i54wA<-&LJf~d6wed%MiNp)m>l!5v4ZJ4iAfoZ^r$E
zV2K?fVM2!l$#aom5o~4Q2h-;HW#?|38=>r_$%amu{
zLiuGY@2m86mad-+{QPIalKkFbDa%hInP~yIi1{q0`Akds04sl7WAk>=C2VXQQpJ@>WZd1
zx~ORQb_c_AyNCB;-#E5-o
zo*el%cb~sra>=%_s^7g#1HjIPcQJ;!)uwjBaI!2&7#=w3Z~amQfK=4dHNSQ>&+aDM
zE-F2-e_I{S+?=(7kpYUv%<^-Q%jT3$6J`QHYlsUmY0gy?|5jQ){&rB?C(G!?6-*H15ISZDxLcKd@+@Z4OTlmNjD9W?*55eyQOB
z1>uwxUHvLu=uW(G=h^HM_%hyN5nel&*T7^FzK0o-n8z}0%6F^47J-Dwo{p31K+ZLv
zWF^11l1BAia7QlT-`7AEv!Y-1>NM@p+3_`VjQ|jOhvk8YYs=5Ui%iTcKTBTLORigZ
zmWSpE{(0LM=lE`IlLbna#8!A*4bKYD1g`Okx-F%S{hWgdl!GN8n6t6;v>!5qbS*hT
zEfV<>3!g;(&^?V-zjgou`$_)OXXPea03D^-2MYBeC$Xcw$+Su;!UKq0<1Hzl#O`-M
zoXVGUAi?}|&gbi&=ll@VxqZCE(lL$Itbj4G^|GMpbwBX!l`jHmY;6
zoF4|!&+iV6!fNaRH#F+@lN}V?9%dlz^d4hz9u(C(3VlR7u>6`5-0OFdW
zcNX``-Y^_)Zi5-C`oa_mDNLGuYEaBsr!OYje_@CBR0I#IBZ5SmJi`0nBE~um@u0QF@TYF1S{X+~Of4g`+V^T2V#d9TkTR5V-=cT`;4}maH0_f3K{L
zil?l$?UM}5SL`kc!=;OO$=og%sHpU73vU^`VQIU?Ufg7NC!AJH;~wpzox>hT^*g@o
zdq4W?JAKZRvFbNzF6SXC7L4SwT9@P1XNdNcaas|*yLU6!W0kb5c<9G?Iy9D(fjZG`jXowVfjG~LCqXmrVVl|*@8j}eR=9YFA-Af*d;
z%2780ko;`rhkyP-quV#$N4KbkqFt_vzR@c(TCGj<0{)w@vA~Iq$+f6r+@zc|e4HJV
zDz@FxV=n#KO6qEzn6;eWIQ4l=PCn>eie2)?xX>lGRT=KrI@bN?zg-MT4&wNXpox$c
z=@sgjG)D6iz@Uo(*14^Ma2W&)9CX>qaeS2Bh$6M`Y_to*-_IDW-2wsMx8jL?pPaPD
zSU^2o)MUwvf9yjk_8G7LJIH~lQ%SwlY=wQBp^eFkab^pSNPe^cj;&R>J#(<)JwH%q+f)eN
zGL&g*{jU2~u=+>9zb2Cak^+MCERnkwIL3;V!(|7^KOAxdBG^FCN=Hs(=h`tc0LGV@
zfv3Kh-y2sdgO?M&82IxKmHY;EW*1^ps0Hmzg4vR0`;w-v@JPo@#`rE|uPgLfB6RGc
z;lM(Ry-Z1{FL@u)<}LcD+=Y9pMTY<;d~RzoIeGjrFwd;K7ZdxO%K(kRSfm^SAmb1S
zKzTS3`U_f3DA3
zC94$X?JMT8F9DR7GXAsLA{sMrCkq9CHdGof`es1&L_)u2K|j;`^T$9zi*Jy*{Td1(
zFRngDqpzRyH@3gQf8g*%w-(7&@N|!}4hh;+>mNjdF$Ggk*Z#DsVh;Os{h5PV+B&w6
zC`pwp0AKFy)|eQhoaD`!@#3)t@l?8ibwbxi@Q@orG$@c?ORPZsLV`DQ}%byQl_PLcVwtqS2s6
z%bRu$9rHe>AMy7@gD;BrUA~$cnikJpS
zkK_sab7G~6lbnQ|M8I;5
zNnuugf)Jp)C1a+7hbI$j3pnkKeHT2D5TNnlFv^9mzAA{6^d0EOEK#iO<6ZuYo!s5`
zf!Li4Gh`0Kj&HeAuJoPc@hQgYMmbUt*2=M{=J%
zChvjh;ST7nYd}8!F#n@FQC7BH4Zy34-KT1v)TaJuo
zJg^8wl^icIO#!v^9vZ<|H@3_7>ZN#m`XQo5%9_9NoTRChlJSLO)3d}TJP?L8UA6vn
zffRHbex3WQD`C4^OYTn~xmu2exTHmtX~(Ss+rZ@iSJIirHFa)l{NCD%JyN(Hk0MG#
zZL8FSf|_Co8PKChJ%VVdM5e^4L=$C5#E^spl~$@CTuTK585FA^A*3`$NXQ@}%8)@S
z1ewB^1PCNR2qE*0=k8DY)86~{?sq@?dEfP4YxSLG9>mTA^+Pe5+Bdb$Q&FJvg
zvzah)04kok`OzkUtpXE!6_9(U*5b&$v)32-Rgp*XA~^%j9Q@yLaznjuS*tbvE4-&5=H#8;nz&=Oj-xQi!QzGI`|J-oPDNt%m94m6
z(06Vdt?P^0zDYkw*`ob;^1-?G)F@NQv7QPHyQ;h~2y9XvWJ%1Ep3KX{u5i;zw0#~9
z_48kCJl6jYXU~{}h?d`M|M}V&(Ukt~F1DxjSN-O~EPFJpF{5eQn_WKp{+{KjM>TyW
zgo1?>$i~=lm*Yxp;E~N!{p}%F9Dq9AS^8m3PiBpe;8{T_Sy
zoGz$%Te+3aRc>t@*hD+n+Dy91T0=5-BnPruEc@#sw?Mx#^*`En6zQ$U-Y%?IMWMvf
z*ea7L?B7hId4=5XDl8tQk{AI1JcwT5>Xe-N(s-g
zVw+
z?Om4q-12tp$AjcMmug#ru1K)s%UfB<736K5Av2m8NzGuq2%p@}wJDA7r3s#%66FpZmV@?3P;{EqnK7_=vQnmBiee*$Le((OLFDS)B+V`4ni(
z^%R)&$~EyVcZ-~$kmx_tREvo4+_)E`@cRM}G;(S$y@!Ew)l5m7D{LKbZJhite=~xTps-`eKzkDAZk6%-^YlF}Ke3A*y3`@e@%LuWmcBAW3Uy{x1
zkFp~0S>sFhDx2<`BEByp+;!+3mkXrf17)Eltb1@BSb5RtZT-4+Zk?n?TbLvHpX~f!
z^M0QLE3%50i)pN}MW1`2zkG0d224ClpW;q^#rT5dOT5+M_Xf>y`q^F`Z4EmH8`;6|
zP^B53?~9cuF>zeo!K_n`s6}KhGTdcgm&5NZ9R*z;d|NLsqm3R4I2f4?RmK{_@>l#NvjL
zB@m7DmyPQdI%n_eN<)QK%k~ecb7`#j^eqp`
zv*!XK3#g5!=bddIet}xkC{(~n)J(_kh
z{IWr7Dyhhhi$MjyIW}(QC!Vt=267%16mIhxVR}FYL^1!FYVY%E(n6=bf#H5|dhkwY
z=JmC+1INi9we`N-;6ZKWpSH*we)AMwT*TL_X3tEL!rzbO4n5c1eLiH;mN2Z~Q_1kB
zOWL(8d(V(+!8hUa=LltP=o?6s&%S|xAy3U`S!0q-!|KW@|nr_
zVw0Zn#V7l&eS!2aquZVo2ehW}kAemFOzuIj-`61Axx&La+j#Em_iJg4Qw5I?e*XB{
zm;JL1kBk5HF%f7Cy8bVA2WYeOA)&!nf>1%X^y7vR)Hd;-I`_*#-wT$BpXwRo9D9wkmH*%Vq|w3AuQc1Eo&|g2-YA
zRI5BR*Y6>gUF^IkSMv_*h}wR%kr?H|u5;Y`CU1k?FkVF6cx{fxISdPH8pf%BLgd{T
ztYrfvKD`Q{yH>B#z6B8F`4;zv#18PL%eduBvqyb?Tcx|f_7c;@O%-Fv-pO`Y5?YN>
zgjy~vKSqHvhhMnet5+C|y01iFpu;uL6)@
z8u}w2VPF^=);}zCua|j#GTr4^xi_d1N(nrBvhv4bBISXQH!n~$-P7(gL6!ohm_O>o
zEBe*-TUKD{*QB+Y$X-()DvvU7{i@XMEIM_0c~+-%#Ow{K9pshs*EB{{N1Q5g-f=J=
zm-&q);PsE0SnDUP#{-{SFS(=*_*0Qx?8StVYx!4IGcg#(uAqH{1Tu3vYk89E5?VLtJ`ep{b-ik55`xkt{qifv
z1@P}`m3Cp_dmxDDAnm8jYb#H@!7BW<=3f*aDHC)IYslP(i`Q?t5853WnZSy~<>(uu
z`&PZ|O5_=3owUcGj9tehy!k&Obf=3gpO*}PEur^UClRJ<>l@8OYvgyLplSPIxRp8v
zh&OW@n@fs9U)$+Ko8>v;)DLeUd)35hrqgkX;(8%h?tIhwNPpKD&_n}y{aJx1mHJD>
z(~mP^BQ5#*+C0RF^fc+ds`)f%pf?RxBVNPZUX=(b2dEK5e%j=`pqvkD>Y{6g?Jxf`
z<~Go%?vuC(eMv4gyj2+(i9NJ@aag@GU~OP1_N@T4Xs-mA#yjKFZE41oy*)D;BWgF~
zUC8@jSvHp;%*K_A_LFgLRT
zsfWQVWPOc~Fai1P$_90NMh3+P3|tP*{p}zNZ$RyiKfMaRtr73M4v{6Ea{
z0P;YgZRwh1DSt*gno|0%uz2~drbwF%#FM5pFKnJ6`*__yst&7)b9jZXlezG{1+(hx$cjR1nW#refEcuR1WXYb6>sXq9ztPoi`^mF<7xI
zBbHlU@#AYj+YEbian$Rf7DtZJ#mNgVzU=^F4ew~GFHK4Bl$5t!!=5(9!!_;y)i*i(
zU7cY&Ms}RVH?g9$O=)wIU`iVe1nTylvdZTJ&83w>{OD7*(zcyS#;aaEH7*9Th91RG
zj6D>CqJP1B+?Wedi-g~V8djcqPF;i!CH{S3iNakQ=MJ7?>7!{3ZZ1~W;lX&t06q@$
zpv%5~jB_9Xk6~m1DHeH>wCUX#gqICu9#POm=$~2i3LZiT7Bf&juIjuSS>JqAI40_B
z-fEkKJKy6~fQ_%OWbwn7TrTH-5wA)_5I52}lStPff_Bvx!(`mtb;x
zRd2MhBG+=Jm}{dOi_TK!Ng76r%kDt$
zZzcMks6%U)1P_rXq{36F=|2av=-<`rs-sKe{p8m@0lmrqSQmW_N=}~wG-fU;_F_Xj
zl_JvJifk<`;ElZ#F-+1VXEA%}O^cnka^&UtEQ$bwaINq%^j1FMosU2e{6
z$;kmdLbs-4IEWH)!DU4eelCjl05EgU$KB1ZNL2_l;rY62jVj2xI0_IY?^X+p`#zm)(&?E0AXy&5n(i|;cNyp3CVD@_B7tVB}+B^
zmKeDn(lwCtlCbNjJ#W~IX1l^GIw9j;oWq(+lf_X+V
zxnGd31!S7ryRt`40*1vhL(@z%$oZwAqkJX{-wEfNl3My6XlVVIJ|
znKmX0si1yo7bd7TROgKct7(tjx2*`~5#uA)5wm(Cge$#pndt&9%CepV3wwvR^qk`;
zf!8x<9#qi9i8{|Q;pO#?C1l&|V
zO#ddxx2mJ@YO!gq^5=NM#*}gr7^90(OKkLpzdBFY&jN@@(rv{}Z0s=>a7x!D(Duq9
z?*PM_fADNd(H%gdC`31?6hXtq!G_*kUE|ebf?ii|vU`Ws8pBLpqD@u%UB+n-nNL!2
zOWIc_k)Qpb+qu-+qghDOdnNWpv|1G}_1=^m89TpD>#L1cBTJmY;XLM%AF3O#x+bUO
ziKU6XvbTlNC?dwv!&W1GH|xto?^o>k_L_=%a^k6PiDZ$nD?_CYSfl&38uVy;pTxDu
z7TROP1N4iL%2gQ9%)jrzN6N6
zfIZEIs|jsRgB8AtFV=0OxR%ZKS+*#Ec@m&V{6Y*5v#@INv}SMt^<-r<;U@g8P{K=G
zNlBX~h}6?Nq-;oh37wpeBOS^?k_PlyKF->GC2-S<+>=@LWNlnuC~EhHr|1`eNzGvn
zy1pXp!W}Z8A2&zSV0Ky7UGcH=rZ^B^Bp2R5Q_Uz&tV(`Fh{GP|@;VbM
zGm4WK{%p~ZtTA%XP0NKb9|eSU@dAez-~#S_3(Y~aI_Av3|FRm=xzxxdgeQRiZhHlgynE)
ziAouw!xZ4@w~O9D_R})9lJchHw0p@K#(!6o1AT>WdpL~3>aYlB3R}dq1!_9NvG>Y@
zRZ{kXC4fWlw~`p~K7pa(*j#zC{-E*u0&MJvH~}_<$yPYmzCNhfFXvQq3ohPKszn~p
zG}E`L>bhjUoqdZ94Ja(?5>ZUJQP~gVA1Z&`*Ml_^jLOBf4(NE&s1Xo
zFcPUJyKWgKz@xb3HSPLK@Uh
zI}+pK>?$Cd`$ktD*-ApIk>`u40(CN2v?Q5oUV3?gPz>jp6RTn43phlH@Dkm3v@35QIp6J3yw<
zfwyy(;+Se$kNQpuUNbKd$||uVo1Gr@AnuL<{_Zu`UE3H2)|O%Cm^e~b*PgYk&=m}x
zYpdX^eE%FWO;H{59#oeNH?o2Y6xYN#JzAYvZx0^g|)
zhpIQ#q$-|)j*d_U^ut-bk>8V7TTpXA*m4d>$2-~D$|kpWC`Dp_$^&*bWlC%A~;wh~!
z-*Bm^p4651Y*{v$On!}HliG+^pD~bBzU4OdiMg|RyyD`W@@;*lWO87Esi4p0nIp5%
z0wok|C;CyAQzc9-1DtKYSF9bFHk=riLE53lH(*WOuoS7>8wTvHE)dryTf9|<#1hl|
zv-)a26UQ0WpFDq)cOU^wBF?Z}pRR7nyz|+qLRQw4AxggZHoDO@R;R$Ia@Wc6N&$vV
zlRw)&k*kXx7C;z|$cC$UvLrS3D!d&1^~7wVo@SjUgN$$n1gu28I{4aLtsN0d5hk_Y
zdq^eWX^GWiDhzvP#zVLvaQ(Xx=U97ra&NGLI2;%l3dY{`=40QK8U;_dCP>%jp7`{W
zkrS0@16{jdu3IsuL@<4>%zRyzre^J)=nJ9ae+qV4K60320%Gd|P-jqK2pJk@_
ddY;>_A+T-lFEbGZ|K&N3L>)U+|F6?G{ts?5@#z2n

diff --git a/priv/zstd/doc/images/dict-ds.png b/priv/zstd/doc/images/dict-ds.png
deleted file mode 100644
index 1153f1b95fd59d83448b93945fca4efe7c60df34..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 89590
zcmd?R`8(U`8b99M^mH+;DXPkuX)7~hs~TI2%uLVJbd*eMY@vxVl~zhDV+oRUnO4;{
zWeB2jI*JmJMjAv3DwZJ9mc+gjl~}WpMB?+-_I$qIKjC{_-ydAA=ed$+x$oD#Joo(~
z`B!(B1OGDk*S2lj4qW{CKUcPG+n&2^+YaVudw?0D$!F8RukBG+Tz=eE*<&~l4EBcq
z>>IUho8IBApX~_ZJK!tdZ@c)PAAXD5zR)mCBhN>V*{peyqHoc!vqRbB4o~V;s>kku
zy`MiaG;7-PZOqr_BWgJZS`Xy@v#$62w=3B@V^_4lKNR`Hju?y2Ivxcr1h{AKYk!n>
z=_}vIqnTzTUX}akE8j+kepDqQUCkWd;QJ$&>GF|jvQnTweUxk6rb<(A6d{WZF`{M=
zSiy$JuS_%(N2J2N(p~X8obD7hExJwMjpUP&3B3!y0ORi={{_7uHWA~0Skob{{~0#?
zVdjm_`@IE@cOV#{hu>mLmg&nEpslH`HTLPe-x++({>lGV>;=8i>Yk?|uLBEhea7t4
zf3iJRCEEPYAmxwa
z*yXap(TP?P*YUQ-oViJ<7k5_kdgIYTt?rmGqp!P9Z!CUa^XKT|xx@wCO09S4)$92(
z8NHv3OGRB>v|_HkY`oK@#dfH8yG++g>ogfIOqJU0Jo
z@ISl~Ai$WwePQ}Pg9rfdxBtPrUq9h@BoP>oBtE$M^wW-ewg7+n?+5?GqW~BS1l9}x
z`n2QeTmazro_^Q&37>YvCXY?j&cM
zk1`&+Kh|PxbBDXRNW_%@TE#@_#L2jtzARJho@`Y{N6&=Yg5O6$tVL{{sy()N?c+8*
zTc<8)CJfYkl*7_AU^R@42R^thWTh3^Zr?DiER+YC}Xk{
zobJqmCSj-syM90g{s}wuw3=NsbmBnb!qn#d)yWjgFwH7_bJ>=no*H-hT9SknjE^Ns
zL7TFjsS{)r1}VX*=Qam}CGug_$Ue)4mv=Uw;xzC9$9hMfF{Ql5u2JKy5eu}js;Gp*
z9%DrYE=D5G*yylLRNLXAB=ehMN`6SfgAW25?_(AhHr?2vN^A;y1N)#qo@_s7(sYYH}^p$2JLp`7g|5BD7
z+xY7AS;v|!RfR3z7>7Ut&fLk+upqa_RKj-KMpZ1Bt{5}kWc?Yvdo!zXbsWXqz-f#V
zCf*WIOBh4!;i+(i+?!dYkTuG^?Z%a2{6X>2mG)rc%{&}JA}?|w^l!cepS8b{*{?yn
z0s4}}gH>ViJ9_sf&U@pcCHEU8U=&j^gd`o**ZjP|u^Y?ft5%5X_-cmbh9wTM8h%Im
z7&i+atrxWzk0q|+H)}Wq_-4HEX~4UC|MUM|Z_y4Hlz;3LOxc24pNidPbc-obiU{EK
z4HOD@
zWGF^9*K2Hz8`jyS{SqqxI)xc)jO8j&_~PC~ZsP{X&fiRPLqvyfv~s|TV>ryQ#`UYl
zBTyLjJ$NI-R@(@s{_$HJdy}v!!$q&UTqBM}I?LxYBM)}YN8u#6fqDgcqHwCS5ej`ru6fAGITgJ|2bJnm^Is^)CiAJzgtKowy
zq_#>5MzA>wd<{E0FCva#`Wu*D&pYA5L}r;SW6sV3)L<|Vdql_Et#*G$ml~aIGgW`BEVVt=h
zM6tt)YN}VyjY-BhYn!h&#{^D#jhC7lsemxm^NSF>@%4?l8s}$gnx`2k#&Z4o5d?N{
zf}YZdN2|_x%c|K}hm7s(h{{xv|yWMX5d$Xs1e4t*`x;*9>H@9RueGaY`GQZTi
zFCwE7gXWkrK3^&7G~SrQ{?U>Rd`ejf?5x^s7Nl)1*Vw{07ZBDwP2LAbfIgwJjo(po
z=1vOntn-QsHg0VVgx?g*&VrRLcFW3%SX5WS=i%=YMP2Z*deM2~p~Mvz+$~8qZbiFV
zv8+UB2FdDsDMX)jtvvX~EPPB8;kT5g+}N?b(Q#$SQr*C@!>+|zk7|x?!Pq+9TIChL
z!&PSjKG!Io24lZR%Sv(alE=giHphE&5sYy<`CukW4+ZZkVLW!DL-pNO<4t8ISQSX&S8G|}{0)0AsRaa&PHz)RVz
z^rN)wO%!?%hjyrSx+ne5ZbeZGla=>V@KxM2QPb;5oA~d#V0okG+sc!;M^<48g*vs$
z{>yV{9LD>95!q$SGp6qu4^8-xfHJlMa1<^{rTG{cj&G^#oIzsE;)nclZY#j|sE;qH
zL?6bn-)#kk8!MyL9|N0e%OuxgYnLe>#v^aH0$)*c?8n44d}(X5k?~1pO4E!~Km&egg}cxac-P(l!o*#Z68GNuEKYM-c%#v@Hvh@UZxs
z2~InQuhLrwx8JqrYQ^~nn5p}g!QZ$(BP*+JJM)8i5O>x8#NP;dA-!6t^?;eQH`YeN
zKE842=s^la14t}hh0%6aYVahZbmx5a_N=|?5Rd2D
z?WclAKH?eB_LIHqn59^U>Oi!eEcM?YV;rujZA-LHz_9qMw@;U4e?>Jr=%uZjVgkR_H{k!j2V7jd&dRx=^rIpb#Mg>WS*Gwp^mO&7>#h6&Xq}Q%sq|4R)lVXnVw(FHyBRq2
zpI-!C|AG4GSVpbq&KmDenX=>P-u0^$v|$RgKlBH
zRq6tLLq)RRK0*OY2HZI1@yn;I%NEp`vQ}Z24Zpml^J0bi(?0gjcQ!Oql_!Bw@jJ{6
zJ=5*&?;OLj!i6_|-~D4|`Td~FQP%rM40E#ihU-I`@Pv=q>l|hW7JnvbL-R$u^7y$b
zw&dJZQgx5dfjH$LoYTC0=it=g;A-6mpq%InvXRehC1nIzX#EE%I4XPH*Zt(iuQdjy2{T8xC
z|BqHZ2I#kV{IN~2QC=^^5hDvg<|K*?NTbH5xBXS0`EdCc_$@XRWOo~NJOViqgA-MM
z^vPW1u8lFN^9HjbLcF3bJksvvpH9Ev)xhw@NmM)A9-O>&>%2KbinJCpzO@UAlke)+
z)5@Zp!eiwSW7tQHhKK3+C^eFEpYO{c1$GCOwNcULH);52xz?qBiP}#3-5wyEwyP48
zL(TL?V38fklcjsc_5EyCJ_$T3@Ai1?2zNn+l3vX{+X!lXIps>rOc>ShM>bD^zsFKV
zrJMuBC~6+Z&BSE{D!*Gq^eRM~*&Nmq@jh5j&$S)>3QblQMud#g4a9B+S1Kc^{ub&D
zO}44ltIfT8rl=1DblpySjD*+8cDtMG&7>-3_=L=&l8+v-76M5A@=KpSJ}mbCJl6r%>dHAdy&NrW=EY*E=EagY@-K_%^gmw$x({0!opabp?Sm;`NuGw
zRd{MEWJ%^O(uUC8%zTi3?bc^!m2eO4&DF!)Z4EDBI#_;qEqeV
zs|Oq6InaMj9LTNBH+<;XmaVYUY$OF+1g6@KByN28ixi%
zmu-i@(|n*C-NPV7tqF|9iX7
zVS2#BR2f}BtvH0j56(vJ3}<|s6TL#iGguem<0|q!KrmI&(Q6YQmG!-Qfb{B@CE2Kg
z9K-RS6qu86QEW~GFC~b5eXLGUamvDOx*~~k!T&&YCF>yeZrOjPZk2By
z?00@WgN*7G>)gYulP5hZsk()xqBOC1=tH$@J7^-d^}Q
zk80!X65|@@){@4LDURQ>bRjst@DFJ|Q)N<0y^YAlvd2;|3?rP4$hvU$}2$c>(LTd6{x3W+nEtZ4vthBiZb4rU9D8(>iZ0
zw0WJgE_h*q?86Lt)Gu|_M}Nz$n=$ov+lpBei6#?s{-P&5{rW&w#oM(@Q{w6wS7&Ce
zt{L)BfA;w0nK$Ll!Yn^AuY_zcRrlPtA9zulNJ>~QlKTVO!t1R7sr7d1k*wB#2EU&0
za&lzQFv%nvucX~k$;Z42Bl)7OFjPCPvmz1ACC*E@HFwALd@SiBWlYCqSbgL~8viqj
zJ~dZHJwkGtEpc{O=Qk0_<;F&*Z3#!V*W~#Js=Gy5G={UoMjy||$ri8H={h?#sMC!p
zhom)7g;$C)u0nmIlKUB3m(jTW7mHQ*1e9V?Hx%OwVk%6)>p0XNd8#raxVn!(F$lB}
zwa_wr1iUV4rS8VrE=>qvo4UWir@Bq-FzaIvp{O=}rUBqolSv0}z0CPzCgk{O8(xy1
zLVD?v`Fb~~e=EPQ#p&c?f^`u6ioE{z*Ah{z2+lH-MY68EIMy_P$8sNIf9)kgdG1v-1=eymds654TI2v
z!@YL+h7m}hm>M$UX~sZekgsc&wp{+5_owo5um2FVXp5ft$-+kZcmi}`!BaK-V?*^)
zSDiRxZ~;!ISNoeM{FOB{;-@^3uFAq2Mtyh+$#hm|e-k;hn)vDiRu6R={ln{g;=9g&+u0C?Lm4)xnji)116N2KOmeXerPvuw
zVbNlz!joy0BP?=gWhi8#z+^%KU;ZXS9YiD^qVPHPqB|MVK;gm7zkZQM5YDO>v~q}1
zQ%5s|g1$SxmQl&m#(rhI8Ve}(@{^f7@H*$9NtG*AC3%M|yw=Ks|0Ff@PnD1r27a#f
z!jR2+OGaSd=Pl!#yF60<+U4p`EHJg&S85>%x!_f3Gjp;Mb&#MBwKyF?j!vV~FYw*r
z7_m+kLEovqiB`J7n&{B!hxYp*k5?FOTsErr2F~Kvgou`IdOBRBOzfsiV)`1L5V5i_vSu@!^*)9H2X_@{)`ZDyf!-R#nE=n46nE~7DcBF&G>*A
zfdj?Y$7g(wnIVHw4#G6#lT_K7R_ZqXkL$MNTq;m_aW6O(Gc>
z77hVE#>zLod?ov-Y)DoyuE^Gdf>d3V=_LIP~J6N%j!FS_SwU)Kb--IS4k
zN;N`SSVgUHNJqLf*+K4MA^45Q=|gm9YQlH;T*d+%*&lZkUQ`gTYN1kc`~~D`STe$p
z(XzAcBtLCpxck8G&giMYp~pr`@2>0v$wE33lAB#GfmfmX(sQGme4wi#)?m_|Hh=l+
zwJM8xmQ;reeLwN==)L(Mj`vc|7wGA7J(McZt!eJx%R`8pdp%0CT`R`?16LkeBVdLN
z%tR5v)gKe6obg}kvX2V1CJenD8^I?Wjd*UZ4OaPqshwZOuzO3KG3(*17c7_!%4s#V
zIr6wuK<1?{?Y37E?U_`x-7WKoK!t#HhF@b5!S5J|&m$^|>V&jlA+Os^>0icCx3CMC
z>a;9xnf#D9^40;MPEg>J#z>vLIcrE86zSJU)=)cSYQOkR33}4~3;+QeNhOzXkbih<`e8P079p7M&W?(5&t#HM0qY&au-H!ISG|di&CW
zWq6%OAe@dQP@zFYqy>h&9_qVHRLYy;At%Pi!iAk@^Jp=FO8#SO;Z1joAt@(FHu)ae
z49u%`n(Ur0wZA_FyjsFp?~)+5((*laT4JV(vqz+F`;6q(Mu|XvU0h5sD&4w3%7w_8B8kCr$=z~~cT
z2LDjYKa;;07t&d+eTQGo94>|UD{LM_`I#n6_okSxUdBm$Fl)alY}_>+l*B1kRVh}`
zi-6d~5C<;fR@B??`CQRGO#10zR;f1J_+X0u$UZZ)(kCY|kt)=g>nxmap~Cow?eGRx
z_GQg>Z9U(;zu>y~wKwuqyFc$9q4%E_yvUgf3upCe1$nA<>*Mm~NhWK7Zuaw}=Bg{S
z^Dz|9EXG`OEwlc7<%^M9VVC^7
z<9>5ZZ}>L0I%4e~PnQaK=pv-hbp#f8v&)
z512-{l=}XvFpZjA#@Vpi{DMQx=U&m2tbqxQ(THWDq8w7-VBrK7ybOub2$~j7tXf=H>uh6>GULh(WT8Eo0Nj>bDQCF(L=S4l|4J&=419bYJtJ@#(umm$zFv6dmZY
z!uu!MJ$4L7Pu(P+s%B+-gvvcpS5+zAWGY%Q;fwb0?gMg_9glSM7~QjWip-3qR*Ds(nT6h6Av(1ECI6OZ6+Cguqq
zDbZ{zSQXpN*ljdOuxM#w7l8?Bmh8YodVYfWgQM0bw%`;6wNEZZ9W+xPYL71($t*M!
zl_;-fkCNz--1&a24KsbLE~F~Q;WP$4#A9Ylv--x0y*ZfG$$o4bKNDdt8VF*Sv!P4eJlj_teYJCK%jgy?{xp8x;ok?p?>p0>m|c#!+G4r-X@nz5n)6Mx$0Z
z8S)D~DI2NQLc&14(Ngi!Tg?nYP0k?4i+ZGaHSU4)e#gx4xUXp!h=$0AH-YZuH*1jN
zNT+Ww4H>D65R@uI9uyX{JQ1EF9-eWEUmc^4ZH6w78}Z53XHd96z1#?8Apa5*3n1Kg
zbH>>4^vNp5?w11E?E^Y3#7R1KHcc#VFF_eo>yj=PjO1|(YrBI+OLOV1$?UY+vWv!U
z!eq$RqPinRwz*Cu6iVzbpbKYDIlt}>x;lT4p_dpLl1e&0uX9XsBDKzJIZAI){$GmI
z8~EKo*LVl$vw0o3OGeB^)L7nOOI{6_Uwq*z)P4{i*829jwTq*;W}?-VzdH-1VGfTp
zu7QW5#1|BYO7@T}DLu*cY8m}TIqLX|KfTfcJv4JC;#4&_V4GV=mc3-s$d7%LM}^Z*
zSTr22srI2Sh5ni1+Y9v!TF~@eYi7|7I-sZc7e@*MdFkH;-sGj7PWa2Ukg39#+Q5;I
zf+kB~`%Sq_ab}kC5O=HyI`f9sUCQIuGtZJoLMCY}QsXn?%_iQ>*%BVbDPz8DZ>dnH
zzrBP=_uv}&`1U6XV=G2UilaFSY1U@N`U24*)oZGKskfdVe{_1TyVows!iIMCi1E!3
z^30oIjrieJpb++K@BJg7>hEo@*j2GTOfv@RZKLw^`c1~`0IzSyHwkmHBHJ5Sk)vN^
zgFvgNoE>bS3L9N`5DiB@e+!0mV@$CEp$s4NdL;D-2n@|eWUxH&wV1vDSyt@vh7k{$
z-6HO|QvwGQzd7(I0nRhYD6nCrac**ulX)$VKo7W?uTlyZy_acYS?l?)JV-y$yx?g5
z^YwSmeJ2qml(@7q>gMLXr>A#?+IEz%59ztOwN~s~I(&lPf0w;G%Gb`E(RnDVlnG5Z
zX;H#~iYrXpG05368~3Y`{Y#C)GSlFUL&277rZsILy;G!i#Gpq5dNDm(mS4-%&0)%a
zLCeN0WIwjIW+DzmM9JUWo$m7MgGWvlJkuVHmMytH;j8nK9Pqs)SAg%;O+k#rNi#j+yfl#`1BM%fyP?yaaRXk~E@;P#B
z6kNcH?Oe5fyymMS(Gauw#)C8IV(vb{!iBZ2)Y`};aeoi0jWD?o)OY^Uxn9B=_FL4Z
z&Ly{h|D5_Gi}#v#QP6}i6?IW+*%1R}a-aZd}L+VI)~%pgGjIC0X2!6_waI52_)Td?Jq{@Q*Hw-sdRMHVyUsGuBU0^GvjOG;U$x%)Wr0c
zzpv1HF28c~k7QM)qoe5QiaffPaD*WDNl#qVZi`<4={F61VTMnm`d9WPlc^swQPlV8
z=n8$C!=Or2QQom@g7R!v;{^86#TG+;gAmEP*@{#@HmXc`4X)0qb#)M#lrEwECgoZ|
zWr2VaFw}s^)dp7BKQ+}hK(%P*HfY&a=^-&u5$8vbp>wFJ@u#o6qy8h)Wc6z%cSVLJ
z<+XIomG&56IB5dQq;mS6fqYB{8z59v+ByW5QP5H0#^(Y?UOam_^N{hb^e=s;DLwFn
zX+{CzNH2fnIgWp!)Qdoud04+b0~XV?(IMf3)?``pI~NewfEB1Ly9jU4w=$KTn-S6@
zDQ7Yg_-IGk`7>})dSvn>BDK)fj7)ERpT7K4y%&*w1$Ds6Y~QO<@Aaw3WYiFjTnIBu
zc*V^#vS8HprFf@Db84Od+4wocjY54e!t#QwyNpw>@4u0{_(M-N`t(#MNuPRFJ%W#q
zk{`CiF5Eu4_lw89rMH>2&|8AZBz
zx6C)7O4tE~G+AUYKl!}n^-=O6n3X71dW1C8jR^D7ai3-H?(c_=$B~Vm6r@avw-6l`4TBx>dizbZanJDQdpu=R>_fD`eK$))-D#4wZp$$_VYojXf0p5?%?#!pIOaEA*Y~cyb7#Ar
zD?IINpjR4=pH3x}HU9p#1O|6Zm=Bu0d<<@eiJTCgsdmmaP`@nOjqu#xV2Yu7EDW7p
z$s|#tDJ&(!IGiz|oC>J!CS+4OuHY}I~UAr>g|6w?({y0LwbB7efBVM@!IO`ixIk{T0(~)eCFn4u_fHe
z);qE}jUK>nihQi&3U7c$MbdqBh{eHrR~t$M|7sAI_xSAVHSn>B44iLqdje$$TPMA+
z{O5FXk&&qL>^%3oWWVVz2n}!g_01BB!BYUUAyhV0I*9uNOb16)jv%HM$2GgegS`|9
z$bEmIzq-4Wn~rpRwGWvOdE(43Tq)N!X-^Dk_M!I!mF=sJ0p$Zet}T~)>#T;KdZc)|
zI@_>;n2}Q}oIPp59rN8;h@rD(%l>U8o`xn$YuX&||Y&N-vCV9qjGE&lMugu*Z}Y#f^Os_hAC$
zwu3}-Zdq!bWSLaCk{I?<9Oa$onkeW35!F?Vm*sDfhsr|B$p{
zdq|lp*p8s^UC!ed&XB(eb}YASuVbC)c9hq3X@ny#Q-dD<-9AsEn`Uo6hIAKH3*Y9t
zHZXP5HGD=KHHVQ;srQAAxrHvBP}8G<0wGXGTyk=lAHT3kx5K-Q!MyTU>2z@Zka2fIJ|!XZUUZr;mn5g|Y$KGjQfCJ`e9leXeZ2Ny)_`=#&dAq6
zjz8gk%e~tfYU5)MV|ngttICNaVh1dO&Au}N7g
zqHKK6YG&PSNTk!xF>vxL%d6C^f5ALv8se6ro$Dp+?Z*^>Aynktazp&)FjSB0DV!Ho
zX;Cp!`mljs^LsTZomz}^aG}-IsS>bi
z<8ngIc|v?`+dAzONEQi%;is!*rgov{t<33Q&1we9uj!)U`1PJRHY~~Y$q;SHCV?G|
z8U!Rzc2(quFduhnCMx)6D4zG|s3qK9S2tyu7Qz>iMjRop=UYPjHrrZ~2zoI4^#T8=
zb~kY8UdQ@4Bj=Sn+P5sh`^JdGbLQ&?aJ9j?c#TePEDEXW0#|E^T8eB<=_+EtF4E|?
zkA6;fScpE&@UhLdGk=inEdnjMG4S2V#hiMknp|vy!l5UWKEQLJJk~h5h?C7=$*kdO
z8~U5)y>*)}rPdS_%y6HH^VDP4dS#wnDLum~Cwn~;+dkG%Vxsnt`qrocRDI6_XiE;&aW!0oRFjPdD_0#Z^UwKDZrIh#IC0%q6R6@}qX^X|XA&ufxgzegA
zAQi$Q0z*EV@GJ~yMO`;v#Qi<|$O7KsebCA^1qDg$x4Lx^1##fN8``S6^XtTZ+GCQrYVqog@o7o081mc6a}
zw$dow(ds*Z0TQ&G4LzohZ0^N-huUTna}!lMErf_x-Zk3T*TfNF7uO&hDAz!PUM?9|
z>Y+u@^CVk`bpf4C(io(xX>zNI$i*VE>fdq=uhY#jTEOevxpoGBR(;CJP=cl;6SVGS
zseua8OuTFt-#uVnv3m4UdaiAh^o#zwjG4#Q@Cb!9$=#G&3l&Qz&S(LTj*uU#_&aWr
zAoamK*p1*^_25gx3InS^2f;fpqCMWGIr94{dQ97mNaMBu7`rA|@TS{-#zz?Qb}9PL
z>)4r$?~9o^1eD=mgVX50V)A#*EMn~}P5%z
z>8^vu&4cWa6IoG%$UmFQY??zB`^w7-%4wB3i59XvJ=ZYx!|Hs`z5-5H-#T(i;($L}C+01sNCVbwXf5P1i<1p|@=T%K!M*1lf
zz(euKDtLqldj(7P)bvs3$PD>U6(|xU#XFzJX%V6;yA+t=q7{2!ks0pXrgs&`-
zUjAg@Y4GChl^~1hJ_0xxfq8SiXNV4ygYb@#ZBSX;35-BWi{X1(YLkfd9?~T`P^7)N
z!x6!V(;Swd|IFf&oNXPH0Gio%YGMXGm{ziivisKJD7cUe)H*W%lR0qR-O8}++vlB$)M5|koGOBncU+4dJ
z6c%JNjme%s-ehd3Q4
zOdrxkZJo5Nd3gh{FX1k+;%8$Rri3*Sp(rRO8YV_f`RLXHxnf9^C7a@0KXawDEx=PN
z2Z?KXW{>G;^SxAHSnK6qsavn)pR$9BXOAMAIXBDhee5}|vp@A5k6O}kVveutzA$&c
zwI7d1PQdtHa2xULHQy6zizwc`xQmv!v|@Or0V2K70;90W!FwId)m(zFmS0Ax4N?F;
zq5by4$BC6v`pQZg^+ul}HQ7&(;1Gy>c#o6gFXnlpAd(4Xo@;8nkOWx(CCC6o<6`+Y-8x^bd>#51j
zhq5xr{?y02gM1O3C!NbGS8=HM<`z{Y}ly!
z&k8E$u!r?L_Tl$AM$M$r#U0dzqHLFg#Ov;Ut24PfUBM3P(Z1(a%kAu1IL0(Po-t`$
z0WcDsYkUe#Ev!lc7OX**4)Y+C?N1JQH5UX@&NT+>Z3^28Pi3lS^fMNOJNK+U|F1s3
zi<3{IqLGZrnPN&9nWLoJQt7?iAx}%VyTIB`!XwjtOP7cS0v8o%?k6VTRP@a7@h>{H
zx)Oz}NNgI`w65ZuxHXa}Khs|g3Wo#T(R*`r=gp&~L~fKa+$Wi{WbL3FJb&ClGL*m5
z<(v?16M|o$AJqTXU>qB9BJ8_R-sgmN#C7%YswKLx%EBR#-(A!7HId%yl7)GQG`htp
zKfC5fU+MOQTcFpnb2hFRN775;k(9UIl?I|Y=X7384j{$_lsK>_r{QduEKQp2t6*U={eh18izHqS(F
zi$1jam2>BlN4~unPvn?#%(#~66-K||I|V4r6?O@!J$3oGctZS=P1nt>HIVV`a_n9&
z-pK|sFxf-}i+sXs(LLh%Q4J*9Qn;wfzs3cd!a
zJW}Jem{)7yAYjo2Kn|#ySW8tL*>sgi}-j4plmhh4KJj6jc6t+
zPN~!1Qk?Fz>|HmzhADh`ngiMc3p$-s8a
zpcc;D{o0o_QRmeVjh7;oeh}9NDMD7Zm`TiKuqM!VNLeXv`_mmiv{!vy-N}Rk5B23m
z7I6H8KZp~`NYeeR`f{NAQjr%QVb1WMN+!Q0^;Ysg6m?G>|J~CC37p$;ki?wP#MpN)<-tA
zO2Vt78Yh4prh)*CV&4a~WBD&17zWAON}+36%8Etoh;jW0LD~0^m(S0gCtn8g3n5*4
zbanyd?iY=evftKVfsDuf_FQ)>P4J7q*`k?c#~Cy(
zR2{k31?^naf7QQm-CR=S&*#+VS5RkKxKQL8r44IGM{6_SYY0pf8)96z_U}Tk2FFOj
z;$uLQY0?we*=FCO*kv(tF-dz3ypkp4>BQaIp;*Y14qCSfXeNcZ#FUB}eraL6xsNdU
zD*I5&T~c$TXMs_EyM07teT8_{<+;U_29mYk)XlpAFLUH|BJB
z10+UpF9;?Z1ffs(FQz7ycz;NA&P6LWyb1;oJp~cYYh}g?MSXbKn
zHwD12xmdoNbL|Ln5;`KV(S;D=!>9W4xQ4lo5_%)mU*?ljclD1Ax;TxzT$n6F8b_5i
zBZ}J^f@Yz}KRunSOp!}}k-SwQlrur7HXSZ(-tR!6|7lEw4NKV`Cm;ns!z10@7PTP<
zbLvfP0s*EB67(za)E|M4Naxszwwc)gjEM_VR&`Ln%iz_GQBrhYdVGGC>#TI~CD1vj
z`rK;AzN3E61eti}x(}_<-?bxw-e_*VuqB&94;H#GedxaJ1?uG0ta~V?U?wHV)DGDU
z((M}JzpkpFr5uFwyvH&HFJ52!yH0xTIwe&HasVrM$MtV5b8~i(@3bb?na8bWqGf?A
zGENzCSjXqwox~+6rdq7{g;;N>dT!HJUgo^|PhE>`E^RAFlm_x@s`*gXJfeWkTFm~`4)r>)QCu9uqI!|{*+rG@o+~%7sujF|C6_`9
zJ!O6?Q>~6x&W_&7z=6J#%r@X{6e{lnm7=tRqM;FSO33+TCP48C)>%2qd);E!Chm@$
z_j9diD?2r34VKLMl@68TiR#f~{I0Vr6;HD*5xAz`cMwkn-#XOFZU(^_C(L9@;X@gT
ztY$|g54)O~N6!{(&)ItM-%@N-RJyGv~`Kk4fMC(}oY;^^XUu~`H8g9$S!
zHy0gxz5SoaOX5X-r5~9MM=H2PpOB8^t|P7~CTJG_s+es~uAuf23)JK!+qE0c$R%z4
z|KvUYeab9YC%ViA6ij|}j6#(s`H2oEnDg!iJ*jv~q-XGaJ2N8X9HXArhB@bo$NE_Q
zouGpHiY<1Dd2W27mmsENnzGfb%rK4ZFzC6ouX0TFw`rIoO`IdO@t*sRG`cRa+fD>6
zB?<^6?qjREzOz4Bq4~{spHx-cOdCq@(t|CXFO8B7Pd58iP4lxfY9mRswDiLraz`jV-7Cb@qo`+NcYq3<9n
z$$vF-EsN=VIh{bMEzmbrg5&ye0G9wY`Vd@>J(-=Cg
zDU~0ahmfO(*Z8uf{#}U{FO)QH#yLEm8voJ`qv`WAMq<>RRw!K1dH@TcD8vDj{$P{t
z3%t@={di1;DdsdW`#gnkEW#rT%hMs&RV`7~ujWQbnAVB+h(+mJ
zpMAsvgXs_+a&c$IDP~FxCAk=4t11v&=|YFbf2Ixl8JRQppjSeECqkaVvp81
z&=xdIB`|Y$V0dDkalMkJLutB5pM!r2~
zrMj^Q07pQl`A^N0dV3B^2IB#hv&!9s>IP85#xS*}i&z2(=j1XUITnJ_ous^}LO
z@ahM$W!lJoiZY!zzIR5_{Y6}G?cp_tUyv|lm@WG<3^-i$Xm3TBIMZ)6&)Fu@=v=_1
z?nhoD1BB*B*JQ29GCKPyPT0+ndrE}8Q~j{_hg&F)Yd`cP3J(uIvV`{?nwl$Lh4x&b
zRA_UJpyH_jC6wB^)6SbQ6$!Zgmp2&QH%)V_hB~d?{V;)E!q^U==#g@K`Z`lxcw1)z
zsI9as9f5t)sDS`c&dMF>?rMPvI&Ha@W5ra<-ahix>e@jxm(rrcn@&cQO;qT|k$*UD
z=Tx2taL8=>x;DPv<3|%R-<%9SpwgLh{P3(*VaaQC5ZG^Ech9m7h^!Vg$&`aF4SXquA{ZOlGYq~|TRj+B;
z5M9h4@`;8%i(~=Y!nPM-k4V=~v#0WY49qW5B{RTDsF2
zZ$;a{49Hoe?E;e@U!~mRsSksKEi2Sn_p}RbRRmWjte9+?9$f};59B|FhelfC&mxgo
zu^t$HNF%68GGpEPUE;xB{x^@$MGx*1{nE`8gjh0W$d3!8p%^P
z`OVvn<2#&i@wYiRsGnND4ueh>s)@O=Z}y7uiW|
zjtr^w9&Q2CHbK-63)dk*Ro5CS=s?Et1@z57y0=d}XbkpbTIF;V&JT|(1y}BI?;;NX
z&3y>Tnfe$7i4wACcxNx8vx!tG`wppVKp8;S9eCFnZw=!YL^MSiw?QN2zl;NXfpzN<
zs1G`lehd?kT1vd?g%b~pDPsnLnUKk16!EcB8x0Q)GOx9H;lGsPuWa+d8%zm{
z=oz{&`gr85Cg7q`vk+PN1x8>(mSB>3tX
z;SJ1OFO31rE-RG3>LGHr%bNeFr60&*jt7QEClg%L^y~Y6Kd_M(d=a&5W1G<5@Ec~-
z6{rG1Ob>cDj(KxS)MiE;cawj*0nY-#j^p{
z_&8;F1(B)mpBQB3$nbGcvQ+UVd`%ddb6*&S#S;FVAqo3uDo=4&F}SR$}?MdM`bFm~`NOP3y)(AV4bHZ#wWO
z;MvdAp$ClxgzDNYuo|X;u6#{
zknii?K#K8EvEqR25;pRXL3hi*227WaY6uV@($q9P&WuV+ukrmsd#V1
zzCu@cAMM3t&mo6L+38D|=a1$~vCMLKx?t}RZAU$y1nHvqgW~r$0uSo&wSN61Fs8n}
zVQz=g(l1QkU5?Z}8;U+vRG+=%xaB_TL2P>7kX~b?FnI&eCVm!m`SOQ&_}!;
zuC|@8avOZ%|7dM%cT_i_35@RotL?9=zYRf{JZ~Dl@b2c;^V-_ds~oCH&jgk3t;(du
z1B&N2`KNiyRetJWM15RFQQ%uNaIon2*uIgRL4F2$2ky|9W9Vl#tHCE^v?hW%{rTxm
z!GTD10&8PQldTpYxOA+7UBHmyUY+>ALXkj9=^yQ)rKs2#<7?YggzzMzrie?ytd}wr
zEZ#-=I3feRE1iv;c_1F0i-0wk<`tc>%QxyQ7;z&KlVpU@7`=sq8t#v9y+hkWP}JRj1N$*W0k?|^2d(9MKz85#HDp8gi8ViGjiZL|8yDgn{iqC+gD)bBhvis
znRi3%Ux2G^dMqe}+H@vLA7y>1_zqP@YgiHh|D~nZ{{?bhc#22+x!oVIeq>pI#}aGs0c9{oa~74)4G!V_6yb&jts3878CB
z_s1=6=aTNTI>IYMHIg@~>@h7cNjkHGYNz1~6}Vcc8VuMY7#9@G-%dbh2+s!om1wme
zBBs7Pvruv?{vmbu_fE{Z&Tlno4w?mWwxANTMxOAj+sy3#7=
z^O0-~$N(frnh;qTn4Lw8!G;sMMId$SUm5+jDDFVo!u=N(FbsNHL(D^+??^Hv0)Y?O
z-^7o^X%|?koQ_leEO;vgSp#o1c9mA2=D8+v{0$>cv7wzo&AA`Me|zT6-k~i$pMxrV
z^FAyp!XJVpR5NTnGrcs!zW5MX@aBCLaCPq9Zs5!asCBL7uWH`-+HI#hdsdI10|NYFy`8T
z2y6QLa4q~;S5y-mUDb{Z6H*#e?)FDDroa1nFVeNf7{=#4%jgLv{j`{K{quxl)c?GR
zucu(P=r0czNkB~RI_WTUyI^k^t;zi9Uvk!=D6hDh?8#Ff1l0o4=bL98%Y*MYFVpuT
zmhZRzo)J5n7&_JBu_Ty7->s>RiJ1>C;uF|isb{34#|v9~nS_ip>8y-!TTRN8SiFHG
zC2izk(FWT@7?>@Oe)~U|aH)BhV%r|0*=;7v
zo*ucoI!vwqIJQj8^c`@nZuj&um4w2^7Z5)KZ1|SXBme2YS+upiI1lhmCe<8|+hQ$h
z@Ah;`xuAO)DXp^mH7`B?z0aFvQ)%WBbOwALi{l_2ve#U=e*LR<1CuZii4^3CbKn)h@!=gjkowZbASS+90?iO?0
z=+GZ=cB(^|(4*+<0l?BqaDlDJp=+z85tL@>s2jL-ci|hRlvaP5MzBn;EXLJ@0XkTq
zB)7V+W%gt_0|mL=jK;EC$7?|G>n~tHl2m`JCYDj0Pp&(Ok)a>ZO8E7J=8#VFfFxXVRY{
zey+{!vPYRUdus!Z)D85wonH!PI^hy}&Q9Jt`!pOY4RLLqR096@ck>O+E{FC9Pxv)u
zy@xC?{|x&#&w6o+&Z#bv;B6~Ko8qrz|8yyIHGSYrc~pijzqp32_&rQ+SKeOS
z^r!TG{o+<|7}Wos>)Oak2KA?X^p=jLB*fHol}n&BNOr|ZD(OX>Zj>HVW!LV_8?UJY
zPTQp@Z|wZj=*j&vHG8_P%%(IT@(Tc;*+egGc+AW#bZq_D0NMs*nIZ2n8atjcTp4{G
z(-HY+_^vh310@VV?RpU8HMN2cIHCh$eN{l@>&JT&JKiU!@4SO{K2lTqK~Wx~dNNT_
z;=HG8X#Omcep>d&Bihrwbr8rNwY%_%lvZN>7PT1$^bfx@1to4(ca11|ODXYU@MHkAbJN5)oH_jyye{FtRct@)L|J(
z$Ei=>!AYe;ZYPSIBt7k&lJ8BHsPqunKvR4rje~qrjc>s)R
z$V>D+Rgk>rlRM|hU5PRk(#u>^oSpu*G4q14>a^o&1o5?)%Psw&(Z3lGA%DGbH*)Uyfxwm^T
zB-Ap%g2StoxY@xZVR_Ehq|^RZAV80GhK*9}-;O5@k#2&%r?2;e|9x}NRG`M50EQBK
zr@|tAPkc%p??ui^tY>E{`+Ei(k&_ovfq?9RuYGQJ_!U=gLxv8<)8M6XNiXo~;npbq
zKzC!9<#tc-9r06kCh*sk%r|9dr^nNCD!$^izf;!(2Y~#^D{3CN19I@F9e$lsIxVLgE*hHxT;bMB(Av5j@kGtI=>WBl%E`^;1?vr|{0%KKd}g@P1nJb?ptGyx3yu2N8D|meM`&7bh7R{hv~Y
zq6$&UPIgam-lc?P1%RH+an;6e;cP*Ya14|N+ddY_lBKy=
zoyZEaij^DYtqk#(!kuwy^cO(H-+&5cnmSxdwfrP
za;@Q3oL+t9_e9nf)?-XW!?z<*Z~c*@N1>
z((bxQKsgxC<4FgaLPZ%Stj4t7yN`KAMo`xZ8(VFQW3JdC!cBm6S$fDMUDA&xF_*8Y
zg3l#2GRpe2@59%#AMplvNAqDPTm_+&0ju{O9K>kwS7S)i#NAa0;g6+;rzVq6j@k3HU{MC
zCSn(H6Sn{IGuT#gqr~~vN2~a;>_=_haEX%#bUeFzX<{087fP=@kh#2uS?>nLe&8bi
zbWBw!UZ1)4brs2Ir1fcw4y>PSOisFcgX@d+KDWPqAWQD|?HhkkD6%mXJ#ET#c@)-nJ0gCO)q!==AeyU?
zt?9Rz<&BSc;TT5&*MxC`D1$7eeP^;SbSHvvzas@U-KFJP95+rsdB^*K#*iQK(j;D#
z{@GPvKfP%0x|@r*BM-jvo3PKjm8+WiW8`|VcjUh1l^|M6<1~==M)U4_ivv>6Oh!E$
zaArofx90XdW_^*;!Tk$#!N>1=#~$!&t{U;&9y3tzFXJKfM8`7t<~}A6+GB2~qE;^4
zo&tplcAeiQh9w^__P!j>fG*_+@d-c|3Q7#Bw%&RYQ?so&)}XAPJ`sF(JijxnUy^h;
zyP>iR$hsRMtF*1!eH?-6Ntdo+ItcFDkpu&PTv8RKT2nTjA1umV-5+;&zG1r1Jg<2E
z05N*D^QrwEs3f|l{qcptsFE#b{_9bPPgbtfTP`m}pF%sLVl^2x8En9G-}GqI7vQdm
z-^P;DS&xWe!maUPN#rRC&^xBqx<^|12w&UW>l{?h{4h>CoxA#|Zu-6u>#n-8lsa%m5~K%vOT)=rr?u
zdoAhk?JD+mz<}upS@b3T@LSipk$tvaP~-0)@9uylLlTTg?XLJUaOCAXS6x}SuReT5
znm|N&zOxEb;^7ckQn7v1git?aOQkW;#=7b2r?T%3o)4$On+N9N6g{d5
zgyHKs=fc%@b<^TC;GUy?o8#GV+t0t8`J$_;zSuSW!m9L*f7j_PwEq?5hHU=@nk5)|
zy2XT5=^srQCkO{0jsB%|CegOd+k+s6(fc=1lLO1LfymvcIzMv{;F`6bAyyPu%63f-
z^>Y|6keK)Ru~%#C3osMREup5~Xsf(w7`R@axb8-{5s`g&rZBN*@D&h^d@JV-@?Ntt
z2Y-%>tdf78XM6d)!qz$AkR}D3N}l7ley4nrT{lYlg;miU>Fv+h9y)JeF*A_$kwL9d
z#3%-|_=w*j?3qX0m6=U@Q9jE?8tY(q7hX*wSh+6ff#XB}vL#DRi?hfl>?z2$r$Kyagw|H=46196(;q7$0F~%Bt#J!SmZpEMj6tYhhZ94*TNj0%->Yb87WN&;
z0lZw?F>vZn1h>B_0`SsSvAl-=9n2feN5fI+&4mL+!O6;{a1f>;2Rkn*mBdFMT(02&
z1TF8M!8Ko{QHRcqZ#h@>1Af~c?{3sx=kCTlXf1?@xn1m?zLjcDU!-z>ZmV6}RsEhA
z)+^~PXF#!|KeyL54@|M97XV}4BIZU-Qds_(*lYmIg*f4UZ|n+TtR8}~6JaJyWN13ZMQgMpv&Kyw?0uTGPv_7|k~%A>sgM-TWuSPl5J6
z^Y@E#wcqhepjbe`Jr{Eu$Qgdg{Pg}8N<)3k{-$GfG2mi;e#cTXkbU}(Oa9(E_ZnT>
znRHzL8e2*SOf$CrQ8~BXt@CcJcZ}KB$w{;>mQ5_Yew2Lbx}%r>HTc%5t-bEi&z-d5
zO>dq)xcqs*aoFF!`XX0%Udbp^fTg3xsq8N%Pb@t2@xT@^AjQdY6(Rb$kF!&u4tlq$
zb$+-EuTN1#AsG_XkV(gVQ?t_JK2zS)b_%|0g1aixTb!4m=RK=(=k0DIQo_7B@V7jM
zd1MTXrY2=tTOJX&3xDjX&Yj20NAx4!yYo$e+uS-Xi6JgvCN!yyh=ZXmHG69_l4qx1
zX~T#(Lt?A9l(O)$vfzOnlvh79#6B{Z@^kit__wD}NF4C6;Meg$e7d3t`G{%R(!qSQaIB}_~W
z2>(w`cqPqQ*jA|}
zJalqFT2J~j9W#agCfA8_J&E}^@EEp58)&pmJ^3(Df?Zk~vG!exe@?!9G-GAJcy+?$
zzsVCAX52S#=2Efq{4crNgS2~veRXf3k;70&qbonPA76^l^|6DJAG!NsoE#^M+I-)h
z7Z)(`5PH|@?9mKWWvqu*ASrc1d-0aPNs>nlR+Edy$m`?h3Dk18nbvvYT9gu)aJaDA
z+WeE+^b-g>I)nuw^px{;C~;>Sq_7cB3lU>HY>|gOJX@)O<`MJ>IZ}>GjE0Z*kIeN*
zt|wx_&W)vVxCLoP>d=4NbNGz-gSkgc()JTm?V-QqDRCG_QS>?S0=cYx>f&i|g7ehG
zjPTnoUaAivAmpahTsKA?opa4eO83#c<+(22ha$gseBq~li0%Z^#H-54G)Z|ZKJ8$P
z_=INYr)Cw`!%<}Qllyu&x-UaD_uwE{axn%&901mEV$&3`NSc>ePNtE#3hReumxWC3
zk&>ExNT3%y|s`xw7)
z%b`)Xz7-{3EFR8jkg(+r)kf6V%QM|KF4&h`o8ptdIi!0Bc7%xNsXzi_;t<1F%fw>ckTQ5#Of==>CX<>
zXcO)k&yYG1H)mDKc@&w}aC@KjXKFKZK7w<4JVo9+hC(2q0zuv4-$ABXt(f*JbfNj`
z=*R6dZ>G}}2`27ye&Non%LVr8R5$`BpJ>(gv#qZyTTNvbJ&mZ0xI_~@@UeO6B0og?
zv1)}j=CR{K>Lof2-cEYed~0t5UF=-o&8Ado-DHC#)9ZXXGj_4tSLdLbvmK_{f1u$O
zAPqfp<<@uC)1PU#78DmGg)Fjqk;!ZvK|ry#Pi0;2VLD>eO%D;{y`0HRvl19J3Vr&|
z51H&}4%A%);XrfBNAp*D91?`=6UAF}PbK~!q*IG`icwJ}O+`4g_^E&3V=v^jVno}@p>hm(0CSLVZ+x=D6puXG2*=5q|rO#nx`Jrt3K*Kgf^C=Her2X35
zrTn8V?air#3}_HM@^$OH@F!@{5!K#(tsIw_(-@>qaXRRxl*hZL`a6#JAR$>aV6tC)
z)mTySVNqM3daSW}=8|Dqb@6o5L_+J%^k;fB~xM+F0ae%yr*$a=Gm~
zN6QGrRj4OShl=STsug1w8sX)RjhCWYHoLzy+=c0l4iz6n<5EvG`Wv_;HLs-5kyWl<
zDGSzyc({vb?p^2;2N{=}>ZU>wEbcS3?kn(hNVVV;eofV%FQeWj>_}0b4GwjB;W-xI
zRHt7?Jn;9I&0)MUjKd$c{zq=Ir4}~w8k+TAaBY8=<2wCKFpU<@^H7O2Tk}sua9j}4
z9t#q}{B&7eWfxe#dQL@M_m!I6^}rQUsSI=_=g_+#MSiM|A=zp?BcIj+i)QLF9fTAE
zaD?1EWH^U%Iy>mITx}L;B1wl!LWaO`72NC_Wq0fHMyCFVz)pZlucRvyJ`p>#yd9jB
zvdeHhN8L(j#ZxeOWevaPQh8VO>2FZ=czFEf6NK^0&
z++-S|S=Q;Sd1$3hnCbFBP6~3K4rY%~C6rTlbJLYK#2{#XMat%!Un)V8W;#sYvy`pn
zn%m%rAv?(=CasU-l@a0q{?fi*@<@w|rHUsKekHq1ZJ;
zJJT8ZOIqQq#QDJZzHYlnW`79z;zZu;{ACb{DTKt
zewxrmT3UX$lpQ;VT`5-Df>cz7VZ|WGGRzxuR$K4n-}@3i7f5?=pVt~x7k?r`5^!u2
zS~cFe2SKit5Ms1v2X#I`BatyV`113%RLvo9ZI$p=ajXogzqCXW1`!Rz+At2J7RT$A
zBv5XvTUz_VFnm^3AOl{B%Osyd$fjc86b3OzyI|!wKV~tb=2oP)gRMlFHjO!tDE1$|b4~?!YY;3M8SJgCC>(;aY9XPHCtRXds
zuDX%4y|I&O(hwA!^9$Z@-FPtPzKuV&<|V8q=a8rNm{(!NBDz7v_>!K(fU1;AE&53x
z(p#o&RlPm!nw(cQ7hpHjzs6{c4qYw@SElOtjj1sN|8Ci;kQP&{y3w=b_w+0y!vZf$
zh?%g|OzeIk!;=oi$dkT^ea=0avDzHGv8zZz9@0e&1$m?>sS&1-@sG#+)f3UB49dbS
zcRpD$Muk^G3}AEPdqYQk)f8?Sxmc_emdfSFsj-X2D#Wq@^hVrRd05VtZ}FNXzq};+
zxl&KPgi#kskiT48(S(~sbqVP}LGU@@o3G%)O<@Q)1s!Hpxku@n1`GZIs739}c-I8e
z8V9z@mn1qd0(BuW7=X|=c8$SV5u~Il>k3ziIBP8c)r17!>L^&Q(n*+S`{PgsjiyIZLkQ>2pMn9uqu6{3>)|B%JvBdhgmEQyI?E
zYr`5x)}JF^THmzBxn4QY*x8=CJe|AA5<*9m?7=Q(Td*2T-u}X}<&auz_2}kN;2zlo
zJ4}KrvUZ&v!|yMWXy4dpeXyA(61cbqX%${M0M4Xeh5&6v3=E0{HzCYKWLr55+Swag
zv4%r=IDWrUdl`)lGGB(2aeR^r{L&sW=#27p_V|=)wN6#g&3M`0>aj~Ozzvc;IoANc
zIts&}BiN)QVXbC6j8T=rz+(&CfCcsU_}J}lCA;f@bCiE5gTen^Uv;)`yeC8JXq1$;
zZvMlA3;m~)54oW$(&XmdC3M18>_=!nkm+O`@^
zmo@b@qNQXfv$3X0%89{8pwJ=<>HQ$&XWBws!w(0jGR~t>hsM%l;BqU3fxcj!1{KTf
z1GUudqU@PNftI{=?7{bsR&+s1ZaM|*yXzh*Y(0j3JSLGz@z;wQo#m_na^)N~%0y;F
zQo(rJfUvWDwfqUDE{XnbTGFRqez&NBhTiNN!=^!fpjXK&@T;yKG_E_mv@nN&L#;L=
z#_=N18{|3uo;j?J?lyRs#VyV{f?jqQ1LLj2nITXh%ra3U8_HM%TZ`5=7JZqw^)(2@
z4dCtauC8=whpes$B@yE*#{A2ci~4?GorpuA&q?VG7t@!jE}aZi#K5q!@h5r4*%`yp
zjKdk}iQJlOkrX-2!0U7ST}gzUQ6`djTDUn=wsxCWD8+3-JK8#cm-0BjwobYk;D*3*
zWl?8kL?08{@0v~C9PJzsYp7^ZYBTS->Mc
z8K|6%n04o7F1^jIt(w#IJTcziB;N^n?ZJ?M)0mH8I>O}$LI!u`T+)0GXpcv}rpD*$
zPVfzNO64Mr@J-meDT!~Gj{L=M>nFG1?(=|VYb-pxbk
z>Q1~aWH+j(&9C~ZcQ1b27yv9J*uAuyhJ*0tU+=tJon5XdE{n3ZglT3Q8r2sUzH_T3
z(n6l8vnpGg2iD?0#Fn=Ds2PiD!lHeZoE0#XvBJ-3(4gS~g%Ew9Xie~%0=CVi9W{?1
ze~}b}i=IgcGSkZ)>wKzhKAB}%@N3!c%bswN^Rv;CB^?KsYFXWli{zSK{7?p2UVds7
zMF(kXh_BV4Kf%RTzs;E^7QcW-?l{0h9^uzrT1{wkwXnz57dRchMC>ccX9(oMs5c;Y
z(vTv3HNi!<=-`IH=@y^qC9Kj;q@;c6@Q%>rAj?v^P!f=PM-0V-m$(Nhb>>WSbKFCx
z;<%du#Fhd&*cAI(-)-LDhkO~ht2xP-EzY{W8d)ixGo8x$RK}(t2sy&Z9@@0<$Ns_0
zxxipf9`MLa`L*I3bJh#7)XL^Cb+H#V6coZl|(P10HOR3)(6e}qJZJ6#q9MZm&kEtM<)x(?m&@*KhkNj62|M}5tHR<1o}{_1$hzd4ix~X4
zui_CV%q`T7>Fn65YY-JL)cKiySO6N1kQsHt%*Jyodyqb)#97B`C^BxI8IXyNF{%y^
z8IGf7msjnawRz57)gGpp24Ix~dH%!ZYRe%pQbMioYg`AO%|XVOG7pgU`!H<7o@oT3
zTgYzb4q7>-L#(;@QeX5`#O0f|Mf0D7iO7vWIYkaW3Om5M9If}QbPR~j>#I?=Ji>24
zr--5_AQUCb0pv7so?YpSXYJznb!UV5ALFo#iyT3~NI5jw5DgBN)y)w-0Wu36Br4F_
zz&W9Ggc!86{83g!z3c~@VucEa4lNGbQ*iHq3*E{HS@&?ErZQ%zr%
z2XsZdEz0Kln98Psj=3j!{?59vtNtWQU4&(Np(GMJUY$1c1XStx^wNrQDi&j@0Zz!OF%)B=os#Jv>gM|pE)1(JRh3N(*ytRz=qFADh2<(YHlw~dW>
z-+aJY)BMoW0WY{$IW=|150AR);ILeH&PP8CF$2)2=zeS(hhpN!!%G=_7J~6o^U?H#
zKKsM6ZG}^6lV5X>2_@SW1l~i&D$+84>ib9zW-cJ{`hdbS5zdm;UX9NM?#jG8AHorI2qRmz$w^4%D+hg?t@i%O;<@Is@;o)vy?6HWm>6W<
zYD5}tJxG-yD+5R^89)`qXS0(CB0K4QJ+PNQi*{OW;})8~Ry!p>oP)}z3sx^H>+G;M
zf&pYhyUmQrIal%Kz0ysG-%g58mVUSog)haLQ&;J3VaV>0Vm?AKHU>A8Uk3WGZW#C=#HE^0K>Oq`)dU
z1A9*!3fw9j7E2^5G0%hIyk_Mb6hRz*Er@z;rN0r3t{p
z)`h4v%7}F#k5d-EF~S^OXD)ZE=J*vu2v*6|b#f3XeNmfjF;7w|d9@?E!`xqZ`vQd7
z+#q7=q4~)noJO@CELV-MtI6-%?8Kq-^3lM-D6H~uolYT`#Wko!8Obk5hf#^p&8nYR
z+LzYAKm})y+b|@RBZr+kXXrTB9=6h1%D4p@?sZ`&!;ROMxgtJf4`Z;J*-7c
zQ_l{@e|`4SV`L%G^Vp`z!Eiud;IAzAT@B48Bj8c@QcgF)ucAnhXXd#lzP)WydKIE*
zJ;X=}q{|SCpnIm@<#Q`Cw;gWs3_b*z7^UwQVwm`4CB1uK+=0sDX_kj{;
zq+9_&co)Nuj)yU4o|y;C4VnusI+4@J!&(zS@)g@`dvR0u{WclZs2Jiot(b_jvl#nC-M(8kix0)ELVVPw(>Hkbri3tMp
znl0=$*BDP;z-v(MRC!-V@hB(&
ziEhz^%+tzAEA$cjK$!gBG(n97sr}h{1r8Qt;n#xbFZ-YYz`pW%pKads&EQ?}42lS8YwvBFX27L9kLY#|D#B%g^UH
z%9$btUv$;B4bMSB|JvMTdfA7(^`>ddgm0evee_Xf|@2D
z3%R^irU=ca%%3YL)BLQ~4$z_;;Z!kAPeYzFY~WVQs=8Kr*ysIa(V;m&$JoBI2i=DK
zxZf+gec$db4~(9=jxc|~0%zXpzF~OAiw-i~z@rPb<24@3f_#`_#%fnAl_h(zA*&9nf<1>UUUHJE
z$WWg%h#>qmn-5v#c=2v0_MXtg}k2{|LqS5eJHHMF?@Wd8|I{mEZ>|!)AUr)n6%6@G=pL
z=CL96c!zA~V)*)&iagauaM_1?_+L;K`Ql4dk*iTN84s?MGPx7Tx*@nat<1`ptsaIZA&RgaXrAzUdjzKwl0V>G6
z;WSWdmQ2|O{a-MF&e`B-(3Jf6{AKgIfqS45)>Jv=zGXHfHs085yLO)TIv*)FeAn9D
zN>BODHaH
zHwrEHIf4)+(Cx$hMWbozyo%@;?YG0x$)l%R9Rt$>@a`UHY1XPJ8-w`zuG*Z9C_5W^jo&ouQl=ct8yF&p8$T`#(?xaM#VA8Ed$0NBTfH5M(pEI1jd
zKe8i~59o%4P7X5?=8=HuYr?7Pygpm$oxE1FAW&@HkO|aBthW)P({HD)<4s(KjqC=EdA)xFS;OPRNvlmEMUBoBb!UGH{K&I=$cd72B>mRfK0?;ds05<{58m(%!w
zp%yo1kL8lG{W;ipzai7#y}QR)C%fCbHxV_0C*p)cS8f1*BHCj*a>g9h4$CcTWa^uY
zY}wlVMsm-eOl+N~8#nzB0+hLh@b|QmUhRb1RKR%A>+4UhhSp(O%4=6)9S*EOh7=%=
zDqe2ha+#K42@;Jz3~9nIC{+np4#d{5A;nVSX_UH}@GwF2fny#6Cz0f)YYrfjt`tVz
z+gKFtFKRKxzK=m%ti(N;(wrAhC#PgM@y~H3tUiBCSGjq0S_Nl?0q1`?@+D`WWR$aw
z7Db>-N2#`k0c9wh97bdc>}cZP-KvQvrqV3y2NKWUQsM6(jqw#;uzjklQ;s22>IiGv
zQGVB^NCW|~t1{;wi__Zwl>m?6S-FZ)Fa$;ePtUcvTA33DG@7G~PAiiS>h{^bnZh9D
zpIh!56Zz=UG+^IYK7v{brpb5xhqYdgVK7c=<{Zv6YhH{TjDPW>H%}edB}a*YU6b%&
zr;DKbd0nBG#B9t+_VWr{a2f(H@p9&sD=4})ZJi&N7-(@%EVcfGL!zMO5I9*MO?4LC
zul#T>o-IYK(o*jhE6e;hxzNVFT6IR+Urf&Z?B8Kjh8$@JaQE~_0#iH3VQwzmA>j!2
za(Fj!lGRwAVStTanz%;K&dAZ5-^%STKZ`!&5k53$U7Bhs&V{yZbK&br-2Q>XlqEn&
z_zRL?T&5wfCg>L*Q$7^F9b-B@4P=Z@Uy9(Ta@yr)Is;bL=TS;Ap=eAM^C;+;a1V300FCwuUT#N6uUmCMnM
zCICl;MoK-So~c)ThL=uxq=-sUmWleJlhAr+oB>Lx
zlk(Wua?jERv)~owxRV@0zDgGzMpv#aR1QU74@2Wr6Uu+J<=g;V`if3a32+H@H!duX!Ewq^os+R=@EW_~vS
z9mzBH5nn8JebFhu({{Y%Z2O1pDloVyE7PTflBJrvau{}%d3k;iWxDOT?^tdY9B5mR
z*}FkSp;W0OSQirrx5S$P_Dt;PJw)PybMF*-Vm8uUJSD!Zkpw&m-J(=UaPTPLbFq_>
z`=HfR%uqS6u5RE4%h+c7+}vA*zUNx}atI*TOJtFaI4Kqc;|BcEJ@PptJ3?;v<}5rT
zJU+gC!_*&zZ&Kre7m*)c?v@S`@4et}LpMDqg~Eej$;w
zeAa5T$!^c(WZD7uylOX!-extevk+?v3o)zJK0}#K%JTY%TP9q{?8-5xn>pU*CJAU9QDfX4gSiwTOf#H{77#aFEQGTBe2Sb1LH*!j#i
z3%gC*1%Li>6lm3kzO2i!Hs)B{b8L)teS3~wl_UECy=={XAMate$=7Xpe|@_r_qBCU
zTTL){d6L8kL!;uOnHjF;w1d2WJpT^(DY=7J)SD2LrB1b(04*E6R4!wadg9J2PDeW(!l
zeI7E*`W=S%zW|~Z=Pvu=e|rHmB94%&8ZGIJ#`Pt~(oYv;(d}ZMeK>YKe|p{NVdHP+
zxbN5hbyDRHp{NVb5m>?*$+|);vwz=eW0F*^=2WPQVl54R4Ip{^b<1`lQx;o3mh)w_
z?6*EO!REBQD{Y^XoTW~}Q;Yr9%{Zb;E+d*=f0^;d!9xI>fY|2$SuEjiYwW!_X1_)`
z_SUpDqkL~!=Z8}^dCqz(<`;_pU$|er~P*kfE3LmKwgkT$r<_ShwjB>k996
zoi|Ysxn96{=^>W^mnAU6d98MJD<5`)>kW~OXa)s#+Y+)&8!4d4m@h!XbZI*$&$>K0
zlN+QOTfY+5v>&yl;qa$~Hy{ErzoJj*Rx7!99?FrFlCbmToK9ylVI_WP#!Fabw$}B}
zKGQFfpJ*r}2y|oJP3~M#nb{7H=AhHzIv6oNiV8k$<}(8LaAO|T`if1rjF94Ksz2%A
zcN4l8{QBF#Xl9dC#evusPdN-4`#wCYDhJw>kIMOVGa7}_Nsw|Tc6{&i-_;lOisV}L
zGy&OAB_7!aqvHuFNkC{;=mPTy$fvgyMm9W*@Ep$YF|G)he^_H+VtXnlUY|{`ypj$8KRR09^XFIqzMS|F*K6G!n^ZW^BQW`(3ZOLNtG=iB
zKxPW2iIxg8^~U5FYm_)Zv(G=C>T;PZ#hSl!Dn{nuGctR>G|lpp0-$dv6QYw_t;bqM
zNQ%LuY_mnAozI#%o%N|adqKAnl;#iOa!NYKpkD55?HFGwZ0~6k<$?3O#CfVtOhrYsi+)exCk3V*HMR91=>`6MDJ?RZ1`PuPTkU51&T+${
zzpKMC<=R={okGVcHOV4tcdqW=|sQS
zS=%SEI2KC5#MRawjCr%cr#LFDma>hpYf>;f{$0@~We1c0$?gK_5!~_iw$#iDQGHRK
zBePB|=ATuKQcE$u5-!E5a4I3?PhswNMt5|jACa>=ysuJJA5M3~dnp?|gp$(mV|1o~
zngKwF0{V}*UGDgDbK@Jh>+f^B%V&6E5NH%?(_TlX`&2`>jLKP2;d1-#&3oD|eQuBZ
zC1>R=dHEtb#>ooj#XV^>^^ej97nA}HE(d-&+j4PcIn@I4UcXi7P#53-Zl3e@x+(rD
zy%EClY}C~?or3d?PZi@2cM64EH{dy(1EAc%w8z{f6{mRNyCk~1mzk7$)R1WWxsMi9
z(7fo&WCMmOm$<}*76;9I%x8hkD-D8gC)`n4yK?p%u+v8X(XA=TG%P++gtoz4ODU$cSH>!OB`iyd4p<9cyCnQ~(}xj#v$Z{bL*`jH^eBxx
z(w4gT8=wiIlZzJ|Bdk*oabgiu)8Asv1A7dWl=6F#WH#=hxQ5?4a>Vv2dIi6^4>;pixZM`#C%R44GQur?owqy++ZHaWL&wld*U^xxLB(eO^y6S8Z52)+tOe`Q{Y9?Q*D0Honpp0h>t`^qn}a-)BQ
zTer!AB{G?k1M`tCJR}jBY{RJcfK06Xlbxz{clXLf98b{|JP))RB_rDM(TD
z^?rPS1cfGO!6xnaQw{NJtxa=7%OllNW~|56`K2j0VY>L^kmP#VkUBw*&O7{){nH8QwG01P=WHF5-p0Ba|aJUlJTvT>gCOF;x
zrycmCnpYcle&%{58F)9t)q?cQy&kb9V77*q!*Z}yX5q)m!#S6v2(9_F6#TpKQ;eE&B#=Q>lL{WMOj_@$Z^K7{S-_OB)v|Axw#dSfiYeGbkOUc7r$9GR^>w0
zs?u0tt%1fq5g)%xAQ*riCC~SC%ju`!sDcGHQR6afhJZ?~oI7se!QPB~*J;%u@7cJU
zKyJ#M3aN&|S&vm$?@n=c$g+p40KYPal)elBxE(oIP83;8whflD#ZjxvN>9;uZXTFt
z=3u?O+?W1Ywsa1=z|Zs`S`#$)0bkCqNc8x7I{i2x4%`cHsPzB3307sj0Q`gc>QVUU
zg3yss==T3eYe4M}b2WTz%InvsVVWj=&Wh-t{U4gXJgUiS?f0Hm<@2bdJycPqw8s{D
zY6TULDZ{b0#vX;VwL(D#txA|AK!D82QL0o?QcIONQK_VefEJN4iHLwmLWBTeN@55k
zgph=gka@VT{qFtCwUG6$kazEA|DNCQZ1i%=i0OF2zQLqFC677l+XulbB>l3sw*4*W
z#R+3w_4gKo`GzBd`1ZRGBY0R|*tdZ_T^Q+@qAvTl{n*7DlfiE}@Y6dnLC-%aLI;xE
zvqzq%BuPlMcbmR(isvGNB21xi=u~q=dAVB*%rTCGm1w4;g*G`3mi)7a}>gT+m%*$K}=?xoQbysRQM{;rBrH95#_cWd*i|4
z-A{(;#<90T8_rZY$NimF3}-q1+*hTSg0BDj%hb7yaHO5oyJ~NY?-|YO(pn#As77Z*
zaVp&w(xS<-OD)9i_-~RWm^5jZ22UGLZ2@L{ip5t?;j2sdh~%fl%CrXGWC$2Knkj#SEheQGM>9Iw`PZprxOBL{KO#zv9f
zYQ_NHP%h?7*p42%4O8L#u^#~*hNv&+_=!>Ve#v5oL01?ZCiom+e7EMI+$DY8xBJgO
zj$F$3Eu}d>6IZJab(}DAyCO`NGzCur5>y#!?D#{b49(9B7+D+sY7nJ($h#(%5EYrp
zI|3v-kp|dkZQ7c2{4Hi-L@{a=5pPLe9ExSqNn_h05ZX}w-)#;?SLHr}P>F&OI)J;c
z;u~8X?+WDX?^BMdzq>Icm@we+R=_ySjgK?V@+Tj6XbW6UzrxT57)Fu^TMd((U4xdO
z`bP-}TdIiNDR_8p;dEYucO1T}W^3{he)~NB((#{MJOccp5w^}8sHzu!|o&0YAu;B!B`Ui=Q3k^&>dgfkuT
z*JpZk1(LRSM7ZfmSnJX+eogDEh;AGG&!LC%W^+!rg@>)>vVu+R9F$IaS|1)fCODJX
zR9s%%(~DZGJ%NSk$^LwJu66FQr82?>Y@>Jd(0CR+ymDF=@DwSsJ-^S~I3Wl_sb)R1
zZz)7~w>mT~;=b#fn*(!Rv`ykexuxTlg_oncCvR(t@&3ro{kB(>+53uP60v+@pLje*
z5nENm9d$4d+PKu;Fr0yNir(HO&77Dx_bn_zF|m&btCol++;=j(MzXAIqzYIUf75Q`
zdMHgBB|gZGC34O$^~I?lqmMj+l_7)p-ScUcUuiotS`9bAPH(Qy)WGB_j~Dd*Tldl$
z#L69JVh$84r8Q?_Rni5mg~|6Z9iU#;Jqel~!ETbw&G}xirUJ!}t)SK?^Vox;?o$d;
zQzt1-64vAODkKJgd1^+1?N{|GEc
zD0!^IB79<9C6D!8i#(*97;YXa00*UHB!rW~3m(}jkqrGw%LH3>MX#`IXa+c_$`PCG
zWvepLrUP1kC9I9Qg%#(%_Ojg*FjUXnN^<3Uc53>_=65}GX}C=2AC|32>A(aAl}BLc
z3pd;9PnkTfQM0@oohe7gfJJVezZH>bIS_+<{zCGFO=#P9)k9&A6&)%=&zNZr$Wb+Q
z)(&cn;$ehB32_HZ3~>Mz^cQEjn%xxQLo)?K0z)b5lq)6eZSsUIa8L_WATU+LLy;);
z;$}eoJ-(my(W4^Fz9vgf?fua5873-(8N*i5!D15Td7B%!CV6Iow{#rSK*r4lL(%WS
zGudKM@I*d7;wX~gks`Z~S1`*b0l!i}sANH#Zm(sSBFDH4I`>&Gj+Y%+VA9PEcbkCv
zS^@BulO#@xSy{sDqy#Op%6s-8tt(
zdzl+~M@8jnY_jf23ovGxpUxrSqE2@ZnRyI_SO_cX}uJ|W0qGI*a`~{bPFnL6$^lUfe9RdNt#G(io>SU(!!f3-Vh&*AN5L)JblQyFF!VAMsoEOIK4*Zw3x_H#>Af{cZ~3Q~fyx4sX@onc
zN3!&9ErD6io4!m1(zV$TB`M&*fv1^qMefEZW@fP
z!FR6)OM)lVw?IG~`;6u;`vWwbdshm0ykq#^qWL!!M{QZoG-HF~DgD`UQc|v?$>F_i
zuq5+$po4Jv7DQ7wsA*xLAt3DgVrs`(qNPvdeD-_#N8}jHm5sW<`<(hxDohqSL^rIl
za|mF{%RMM}iZO4`Zx7T0S%ahIpy@-aEIe{x&FaFo(ow4>~_
z#t1+Q{>A0UkDJ_ESZYRM5AZ!!u9AabQ-F6zbRV#VM}?G&buoHGh`$AbDc(O#F(@P8>S}Tf#gJqE<$=)7zaK};vRPpL_r}y=5g8p$3
zLKa@R+&3&ZxAY!BeP}K9bXd2Vsp826ZhdO|2}Pe9oJdI3R10dlI9mdjJZg)Z`P^oK
z;^n3&>d6*3ZyvpE5c8xc%rDd)st78FQUS3O=-RTrfl6G{`dy!RU&lIUe@3UC1Ai68
zt%_PQn%FtkW?~qtbCz24n7dYy3w_TsMQ@ekyt|)nDR+v~wap_Ua3{5pSNv;b_}^
zC@T?P`PM2$d`Aq|o;-U%{Pj91uCKU{sTEk{w2aC-RUFf6HIm`wkNLiO`mHWeva`@f
zyq0`z%i4KybIj8M81DT&68l4570|Hlidb@bDD&jSafiiM3uV0L@RIHbsi>c8Yz`;n
z)dDvKdT%W*S3*kTc7RtRec&bw7#cT&Z~Y&
z6ZXk@eZ6lvl#1z5a#efS6sbo^3`Et4f)pu>JXFIox*4;O2K^~&5|!a80J3hkev
z1`Peg-_WkPpeTHIEQwG2Skn5|(duw6q~nTLt(5PiOZ(;;5j#>#J2CPF6d;j7M;=bg
zq-!qd&Uepnca4*QyR2Wo6Hf*hm6^xIVlU9bgj?>un)n9Hy-?^~!$*%h{bU@$
z#^n*vwuw053?h>Y3D#*g_n}}xDUX1PQ$GphaYGk2%R^eOG=*U|vt4P)+ZHWxl7D$6
zyThu&Tz}E=FNuplTgpN=R3jO!^Utw?WJc#6uTrGgey4ACXA^7fQ32*OG3PHtbF(wl
zGkfH9j^PerG5QLBgY}A&H=q
zxrN)UT)dQ5xyQ|t{sTJpT24d501spjMn1V
z|Kt#M0L|>*w2XjJ?PC+;Ad4qyD@3-v_2#FlCk|trldI=&EMzk1|&d50f`wuGq4qYU5QqlS5P#dRHxNA
z|A*Go)HzsFun?clJAa$act0>L==V>&V}c}epD_USA#P3n7Sup4_8cbnRPSjbw`%6b
zyG%|3HeE~%FMwGLdytad*5xO~*)2fXf4B7?+b;U9bQO3Ggj#=;c8z=v!w6(|f~u2w
z;F=nrEVQr*bp#eZrLR7wK3h-HH@x)}b?plFhE>)mS-+s+OICBm*IFMXuf6&$SctGZtu27{l3gQWhu2M~DLmiJ4
zzN_u{H?<`9n7w6UpLN3({$?$gdu^~6NPplr5QQTgo4by0Uy_HUf;?IIV_09d8S+vjFhYy*~BQCF^NaY`N^d@{D4lu~Xv_eVewa
zwK3DV+FHt2dWAjKp8x_eI_2USoY(c+RR|bheugDaQP`(PKBG}XsJjfXJ-bkH-Lx|Q
zM$~hZ12f6xQ>-Z0L#mt)So|FBycrH-RWAXdGsBUgyMh6i^rJR8xPgeuAZwLfru%Hi
z#gBIWdTjG1W#E={&%PpfY<%~DFGM?&1Kaw_UitK`DSD4fZQy?COS-%l-RK?D;zEA=TZ>0cu?v5`1Aq2nFiA}JsMFOVLwyE6ycm`U+L>pQsD_^8lo&wJ?h$X0C*TJ-5C!
zZ7AQj1u*6F`*kn*Z0y<_+$y(!vhj^H*m5rKTvuUx$z96o^O1bku<(yoyYJgBdIj;GyX&Qm^U9y`um`Uz
z+&h~n>^7CV8Rv3vHg&q>;rbfO2596%2kSNG)xqHv9v2qX$A!XiD>Eo^B7)JPaQc|q
z`T9zeJxfdEMd)n;Q2?3hG9W5Di-o33m1P3r7#3Cq(eB0vFP8Drli{62{oJH;P#4i%{DsEOge7Fmef-CsOHzgBrN({YfTKy;6F}0{fq#+=U
z5gG|w84AY-pH}o$9tKj${E`$4VF$zKx9T*czExvs`ozXso5s-LO#p!MEEO}HSAv5S
zaI3PH!Y2+aoL^0S^?JQm-UVdx5fM>~mo!CX42UoKcJ~H=GTgfPz;nN!O3;4gTfpEJ
zh^w?*M%)lQO!~Barbw2)LL&9>z?Qn9XE{SyNr8cgYKM0M_GbMVeaDf=dO)Y_2IFEZ;wTfm&=
zJF*mOt(iWR8P4>8U@eD6!5t~q`
z96z5L>k2Q!&n?|Lkk-l2zITBhr(x{+i=C;Ww0#if=&UFiUK=?kBOW2f5{Td?-rG1=
zPtJiu>xTI=Yr2=RyOvfEP30Tj$)C?C#K@5&(C3YJkDpb@WNMPFyOc?$E${%R{_t2`
zle=TWo*^G{^dO&UA5jOxmyQsA291~kd{X%CS~K|OeLz(?7iZZW*ooqg_T0K{!R^!p
zn~;Jgz_pMgi1j&71RRG$osL@O5GWV`lQhM(&P`OXdYWx8Mq-_26CjaiP)zJ(k~*M3X)cZ0w6gS3#}5nmOJ+r>WOAwVzN
zSce~+DJ~jaTI-l~Vn2e!h?_rDi=1VC)St+ndVePR`|4UYpeEQ}*{EhoQKe_@M^oj`
zI{y%FC7o5owPmFa>7tv6-EnCn|Jf2&fYII1{5sbR0~D`^t#0MJj58j;BhmH)FmOt0GOrptFNFV%6IEuzPI}RU!aEHS
z6#nvu+E;yuV~o~eGoxX(o9UO#gqT{fRkK)Sm2eYLVPf9{!V2*~k!&u~y
zM3Wj#IccIdv_Gwm&Hnsr=-=2WMIAU@gM*zblAX4b
zSBLUNWPsSI6ts03RVlsPm;2#ApWiwpU^ozQj;EMXtt#E
zA{56NeqEV_0!aV_jSB@l)mEaMXpDy&H`qt!HIa^G>=oI1_qKxpe2K#_P*h!z7Xf9O
z{*ZkuNxe*h*AB8S$qmhTlo#6g2XOOwxxZ%(gf`bWg#kFI&qrQ2YxkxDUFiC~G!X(6
zP*+-vwF+eB0|A3I@hLBOw2_B-g;!N)P*$f}>swoP!!OwnoNcWxd)#Qs_hl*aMeL*t
z&OKAzaws=y#>V``1f|eAY@$#&RqKelAbF78647z`KwfLe8QNMcvE+XN8<}-L)DI|&U7Wo6c|tfxsmhy2=XOHtn2;F+D~^Urw%xsnHX
z;C}e=(-S${^RI4S6QrUGwf_pRMQyy4DtXJ5z9o6^L19Jf^G>XgN)b&Li
z1AmWYcXD5wAQYfX*Cbd+D!l^{prD0bno`A9MO@nPeRnym5)asfrGp!Jr+8_MD!v~8
zLu;xw^>yyVG9Y`n_h%Rh+UFu>cCv_wm#-+l4niY{Y3gGlCX~ml
zudGexMRhJgo=lq(3*TFcSS_S-3B
zgrs~@(y21zQtR7B{#XR0lAX~|(@%VaSS&{+2ki#uF9_O^lH|nIR;J>Cnx7TAw*myC
zPd--^1q1U^jQJM|F_nU1W`uKcJmhDjpJ$d6;8lM|9v4)6lwYuq>6TnMNG+Ts*@%S_
zrb-;5ht7VUxDT@`f1QpyD%5_%b|ejlmPayx`08LI14!*@AxVHXOdS7Z1T5YUcf>6a
zH4j^<1#>NJ+l2&v0zPi;pyWBx@x9YwF;&E^)y7ZI?9RDEus-s@uV@06r#F
zB~vFH4A+PIwHi_`L*rOob+*np2zg1m7^hE@SM*kkSL9~@rwCD$xo)(m5V)uh@F4u&
zyXoJDfmc5WFM);yE9MLlnlM$#4_%O~B;Ow9pa82%fQ8d+F>F2H4PwWU
z*#sdgz`ooJ3~=ZibSMGjxTAMxoNzG)ghAdirRwd@Y1l?MKcbB-oM*3gvVl
zQ;#rdZBK&iyYX~->w{UQhAgFb0uyqkr}cBvK3CGYkFXcz6W;`qOTWq|J)v5e)GqZi
zlV=GED|Q-PtHw;C&EkXy5?lIMc`MK^?H&vV;m=kG&32f~}ZpE>=^WYk0p@z`@O@q5Cg$9AOm^U;cqF2w`@9-nJ9Ogp;W6Ps`8U
z@%-0RXwp+ufiD=Df!&gbpL!JW8Wo+GA%9FFU}&}QP8#jfm%#X!PNSd^hxTtwqbH(SqLu{|>fiQCb&W!f6l
zFYlf(ISoV406P;mn+skY9;z~Fw~4eFKe(Qtn>5oS1uSGD<4``wHI9h)x-J-rNv@M$QZ}{JvuM8PNU@XOwFO&`(;~|l>YUe
zCA-T^bKxp$*_d*931wuUC9*Pi?&B~hd
zYF?}BxcK4KM#mohf+5)DN!5A6?Nk@v<>*UsOr(g|s%3F^kAx~~#bXKQ+|b%*WSV_<
zD-H4l{)t`YGK1mv6qkzXSPi4
z){bBfaEK&~pmi)ZF_mX4E)gEzDNfIprZXty`B
zsU4M|_E)n3b>+fgH_SamCX{4?NL?QwH4@23l4y|4CXXuQ%evdIRHq^SbPt63t-YR^
zP0UC*o59p(QdCJnE+9;o)!NG|*gME9CRfIz+)Kf3Iz%|u8u-pn;T%*?Ez{(T50HIaE$EzlE|>{}T8;C-rSX-ODJLZSg`0{ntysdL
zVo9UCejbIuUBMsdF+ryL%VvNOb18~G>+<7%5KF$&`SF5aFqj-7zN#*#A>2pi9v~@L
z0>7rAJq0-4VNw1;-D{Um`2vF!aSZsyUNl&rZm-i%5u+uVgsS*p(8bVyBTA%?Os>Bn{h}QQ&95sFF9<|~z
z9O^zGabp}8ii*+EeoXX=4ZaQ}uz$My6}iFKAS)?u(Wkzs?qaR=`gCTR>_~hXmQbL5
z>r`7CdfCmHZ8{)5w~)%;4fZW3U&ah<*UFCM>G(hLQZ};->pz
z9m1CGtP8`)6aDm3gW6n2IuOw!c2$WLbtWgkY?@xX#E+?ij?WAE>4O1LRFL{)A8xjV
zHsZ0B1~|0V0FLOP^+6&PkW(Z8K?aQ0+M)(>aD&>C-%BS;at{Dn{$lY^J`WwcI*kcA
zt63KNSx&=rZ@Nl3`jBLcImeze@NPUtkuz6=Y*=
z>1*$STOzBvP{rlJQEXD`ra@E;f9ZN;1?D$xyw0~)j9r*b*BoX*VN=*|^?b@&Eo}hJ
zPIjLM17jmI07;}f#l3k=-`#=vrn$4u8t)o?DCv4?P2wuTY!v??LH7VK>$v`#4_JIOUu0Oa-p;u3OYr&cE>f9sSZ2n
z{r9gvzq~C}^xmodFM9v@mz&q;Umo=?LJWNQv+KVD?;?*wj4$BN-Ua>a=I_6uZrjzM
zzy0|6<_kZ6@cH}gFIFeNdk>!;_9#WA^*T!)=%JWMY*`ouGty>Cz`#J3QWd+!)}^uS
z;(O^Wnl|H>eBbJeDj!d7hN}{9oMxBSRdfPkK{mT{5?YNb{Z1z94LuSq+`lcbb7zb@
z`1@l$2~f;Q>d8cHoy@@Kgobji<-Sgqe8ACm>qPL2&Km{xsf9^7_FpFNq+C(3wV^+B
zK+v_2npAS4yI?&T9~e~OSC9J%Il4UBXCX@${0K*@A&+6^N`2DdQI7OJ_!K~MpGLe*$D}|TsBh>qy1FS%2rX*L$h6KE6
zFStO+lruQSwm{O_Em#lJ0qHd=ZGTcJ+%cpWhwt6FX?8r98zNfzv_2ZNUk%)k{%tj0
ze|2xHWM(Snby-70fMbi`BSBkGW%>|{jgOAU<|9%4W;1C6$IsUw0uIfd6
zkP42)TNQJ{6Hz@92hzbl<0S+%gI}leYSe>`hc;R
zp+B`pzWLh3OpADKaihn9O9MOn`Zql|?EPQdPRalwnpRT`8X*r)SPYxdJASX7qMy9p
zeI@nFI_jWtwyQbd>AdjWr|=rsvTnY}7ctBkTc0cC{Wmo_i~kwrq;q-}=FjK>d_qZ?
z^~HrU7;ry_Y3$R|)B%g=@|MEu)pUBDXBJ%a{y?8+bPsF%PJ-epu|7N@ls&xV$hRN)
zBg5iSlzsiJ3GF~v^IV?m5nL9SyBxw}riKDNrQgmA`l0UI_Qw;L`pLP~d}|*d`7Xb{
zp0*akM+m|Tp72rxh{1R3s1p=c9C_l7rM4txT!MNeBfk@I(Oxgtx@NRl1sQtNP7XVD
zX-HDwY`A+_xSX-ik8Gjk-0!xdZ{9z%;ZZgBOvt{OhF)cZV>-lVYKQA=>MQ&9c)OEa3u+*4(aniF}u4m$u#;9;1QkZ=0(Es~(E6
zs+7wv$Qc&D`TT9Nfu2x?TOJS7c>GZNZx_8AW^pDZ*@ExiPKLCiGsj~Sg@$GF)jAm?
zvP~YBkZ36PJpSv$z>&MPj0q4Y9Ic8hMaiv@D+JZeo(N}7<=^5U&BRY8TTD~?$!7;{3w+p#Va!jdI_0*$fGhIe6H?!8
zF-UxfugVkn6kq>X@UC~|wlv&Q2;-=mMfqHo)-26{8>}II$~e8nP`#7?A3+T}$9P8_
znVkV1Ru>17KW~$NS60pN@mwgfZmgC8BV(n1t}3$B!q%J4my*_5l*{gMs&R7eEQNl<
zwxQ-(n}k2A4HKLHOb|R~2aN6pH%gkE7bY;1=8urt03S~HR8=X1*t^f;5bsyT-Avfy
zeuO8ttRJ~$Vln?c_~^q`!kaq@Ymm{aD0rLk=OXo>>{rw${INY10ht-d1xIn0kDszT
z@E|f9JcI&B%=D_b_To3!>)J_fFcR_k^zcIWfOk!#bF!NCpiT2ByC1Agwr!AaHfUK?
zYQDpE;lki(jP{|b{R>V?8@;kB5*C@uuOwD+r7*(3qIu
zOG0b?k>McFwNu5xo+A-_*6II|hP*7o6MhLlS`N!se@nX^G*hW}Yc-Ed%NQquK=S?F
zvIs;I^lGcQ--z_4Saa21XBF^sQh625ufE|&WEz*Xqk5fvs9$vUzJLk!ZR~5lTJ)oy
z3#v~YZDXG8I%R+2Z35QNs%^8@q`)4TC3P5ICmyC$nY)X76#nis59Xj@o-5tof}acR
z={ddg)LdWR@R@L!_t)Em`{6BKdspaJTXCr*UT|9@WUkH6cvNV6){kU*W-ph?aAN@_
z*nuHD@ZTQly^X}*M&Zn-<(z=)>&R|SrQHW@UzMZUJQLdP1VDAZ#lvGK)L)9Jf5?ao
z^<8FJI~co-Ns+5-iC^DHj&|3LUOVAY%>Pw?$UYtd&m2mbWcU%)9!nlek{X-m53zAue
z0nVp|VBMF&yrWPWxo>;Q>9i>qSQ5
z0s{gjourTtYCLk@ad@l3*DLjNmk?Bntv#@w2g%)C+c_G2A;TDTQ~NLT+?FGP%;>aO
zZ~2ML3qPh*1nv}-p@L$~?ql2nwd_!rBEkRkYS?r(jX(9jH4dBe?=
zKKdv14C3+H0sDwYSWpZ+xoWz4(^x^Edm%a(vS%CRXzYl5Zms-kDL&zbATP?v{+8qYU
z5*c_iMV`m2GJNj-AbWF7)irfzvLudmLjOA@`Yaf;iMqT8p0YZ5oC1dDJBXEnJeTRo_
zTknt*ZP9zTY-a={Qylj^8biZmX|cyZQ|ufb)A(ki!28(fdsB(?52shTetKnpu*`U*
z&iw>(?pRRUt*21mL4i|4{Gi?SX$-%Pt^0#Fb(~UAL6}b_Nb3)-8}ogT!V}f&X;mtm
zwG3XsbHFF4zf-5#0Favz$|Wlv9Y#e!8-zlfH*!1LVh$$KCm$&P1^zV~D0k6-@89X;o(Q!EQ$
z>(^AbBbpdxGhp8fdL1w;zlKFKH>jK$P^$6kW_L?k_28kIH{)NGq1M#O@JKQqC21(H
z7Es#g;L_B!q`J*QTSoMJ=ZvsT9+e$EUpMnU+z~}>1r*8+@{m}Le!Ha03@xL@x$Z=+
z%w)uL)b-C6kgJbDER_h1Me@&67eX#Q^sDlJf}4vcJ74rR7t|1fSbYUe_%`{6Gq*hmD6I$Xn!VBQ*4GXOolspym->em91SQoe@OkYU}xYlcm9e+
zzk{m6_5erGha3jPa=}9GbzW#gKof0cScXymu)|F6YFK^gDexxaPAYgPG*jjlPsStLU<7{%}%&1d+=AK_K^KX)gAGmG8?LfcvYZhp0LdxG
z>?>7OmZrX5b70WUkBfS8561TC>vd<_CXY~`7`_(OOcvJq|BTLZefuy>GOqMx#~BcF
z4-U488qeC&nq~1qPmt{Ey?BhTU_$_-h7mZo(0zNVs_SGBF=b**v7Zi~;SN{Pa}Y#4
z_b&t!8}KIVR)R~OHlfgd7o!OKxfnsV#O`ciEqVL0W%AWS&bkg0!sAJx>*uZSAFe*|
zOfL8L=O1JG)j)~#olkdoW+iKz1;>3a;BueL%RR8-t{0eS79`S9B#q1LZvm!w5!ayb
zw#obc#rCyZoXmNRh-^__nxAa4_aM5A`Nydxa9E~B)c_nt?CF3UwFx_{Xm0=3}5J*Pvy+j`)SPf~Q!v`eHXdzztF_mUU(JfSr=
zkyx}e%c}Z)Hzh7d+TZZW$l0NF5Px_5wx^z)`SH_QQ2XPj2(%@R<3ZKheywAr2=!0@8Z58j6DsfC3cB4z}NR}DAv
zM^{Uv3zie@em$qV(l=aKN-d)uEby9&bma6dJ*@k|v17$=w7P#!u@rv^Pe}1a%)-RV
zK}6Jgt6LCqU!x_s)tQwvn7OXE(VEG=%!4Ml{*;}t$#TYaf+@Wk^Kb`kdouuBjDrG9
z8GHiF2hb+)uG+^rolchJ!ax+>Vb5M{>I;2J*{%;O^Z_x#3layVGnwEgLs7BR)k}xI
z*mPrYUys-Ez5AmTR|6RFO<%(Rh>ha|2+zQ3*A#&Qo|bE};nsKk+Kc}GEP#f~aWY{^
zEay&u7im!Xr{VjknF;!NFFzH`o6QWt)zl!t2|bQ>kmv6u$m1o|
zt>%d$WV{?A-;cdt9SW^Z=@0+IWU!T%DTaDk}5o=!_
z4&YpAO6pJj9kJ}F&JG0bf!YQ2TaLJiT7E7Vd!_*3)fZPjz7
zao@ndAdr=-LlZg1O0U4&*gSq^JoQK&%`X^@%6vZj(FKKXBeJKyGgeSMuuF>WSC;n~
zDp|EBGV(+6rYLibtIYpx6U;Yy#~lZm2l1*@$L)kndvid0mB%(Rf19>f@~7)oz3FB$
zfXZY24+qTbW3x6%)6U?k%*xgLhS4_vp36w_W9$3NjpF3cL~Vc-u!tT-Zm}p;;hQ=}RReQNb1Xkj>nEiXdmkR>?#W_>AKv=BpZI~Qn&9W0)XP3(6Mtr0
z6X|E1C+aR6Z}ym4#C|iKoHUvNvfSG_$h7i=f~}Ac#UC-IKc{T_T02X58O<_mA6gEa
z+>IVTIGpv(p&7iZdfWDPcTa;iV|~?bSWAnF1xa#4%A(#cp&1K&l#86SA?9OyEM&%D
zXm36nnfOT7TvBBDVl>`Ymb?LO?gfd-Z{Fpzs6oX4AZ^u;@yovirb(QaUjI7*s3ddF
z)p&J8FrNy%&F$^`gH)UguZV}&jk9P8)OMd0W_*Ixi6Iy5oj)|$Et*i5JwIuyOcida
zDT|ERYC)0L8rjlV)r_-_({uWN0y3^4#ksld?WaiXT#?IPL=r(nYagG1qA2aHr
zqfh9o-juGbimC&{S)i_*Nik4OsU#zTQS
zo}Twt2Sg_P(c)7WR3$I$`QOK$in*f&nYOGX5Ts{1($?NwqRZ=eRZv<-CMiQ+0Qb2b
zcnr3`&8&b01y#gZq4HLD3YjY)isSh`3GZ^eH^)^=t}Pu1~(C1l%R+&q`}
z4w<@;J+vI`+|J*AZnnE?3d2nmh61LQoeuv%Jasy$7g{I{SI&z
z|66YNgX*%Gm4CIn;lG)4YA!0aY1;nZcZvKEdt3t6)R@5~z~@}P8Q#ch%5*-2P>%!)
zZyxN5K>C5e*D2dgY;zs2tLJpWZ(rmcyAg4C+{62`Smwpn7ANu$>(2C0KQw?Oe9`;R
z__OruM{wi+e&W8(9buO=D+<=G`&-p@dp+}^h`!4@2*M@GNKCiLs19wy+y
zUt}D;(~yAPFzB%|b!7dLs3NRJ}gPRA}cZDZDpBLdA+87YH0-kjfa
z#bd1;T-~mEyTVq0R#0*AjRok
zU)($|{v-9^?YUsq6KQ|bMBD{yoF!Dx
z)$kj>7DrnC1Fl6GN9)MEXa^Te?hXGbWP9d;&hhl|R59tt68FL;*-|>ryJaGwd@6Yr
zsapeR<43@H`1jk5g^k7Ne@m-MQ8G(61!v6
zs5CSyFxSuf7DBb9jbEM~!)c(^+eW49xX;)RV946;^|ya?PjbL(?A7k3&T_|7<^7bL
zktJ&n9Mw#N>XxI3h%ji6aCOv^8{+Nb{Pb!3`W>Fs&_5iPKtDaGdqES(zFIwLz}@Ve
zZGF2~ZLSS+;ID0~L*q(fw0C~sD3Q=azx~&l4g`d=>xLTb{FL2uI_ra&cm3)qALt8N
z5u|jH<~_hk9|Y(
z^3E|;BP`G5(&>zhp<}#RIr$we(_<-$c~2y<`7K59P@0s)g5>{nt(TKrB)epF(Yp$`)maHHLG4;`csH?Lprk8fym4~QKTpj
zGj6p#A8m8>ZaH#s|CQ3X&U)HiG2vr$DZHj{X&M)Kv^tRkoUc4?byU^+Jk=BDa)4`P
zaq(B}`Y4E1pcmS{arp8Xwi%k(;Rat-VaHYy|9bI)eUyJ&H3z5$|-kU
z?}X#Nn3cO{{P14P^H5qH{_itkSuMMg-u7`Ty}@yr$1z=gh99^dPa>0Z<@E<08NVE1
z+)3D-)X@;}ev5Q)7ESIKar8pxbCIW(?{wL3z)7q3hJ=nLiA~n+THsi_O^WrEVd_E=
zTI685G$|1d-&ZYj#D^Sb97n0C<~Yw{;SQ5iD&pwk*zdD|)#8nRhum)PU8GdjM4_#D
zxD5ASk2GQCZteh~(DuKpBSLe};)oZe4*?LNvB${xb3Ho?_41aVsaFKS9Ks?+M1s7VP^urCRgh}
zYtls0ix?E69_teEoiouXx_3=3>%7F?45yAc9Vxb=ZmPkJnx}KTLOZ3(#k`LSfnvN3
zc99LwYcYua?4s5W{9m@-Jub=n{R94ex5{lDSh=#y!&;@=TAK5$2x~2^nX+wg>`fvT`ay8V@ZxuD%XWERjx)#0!=rSEoA7rTXkir#w8del@qukPta+b$-1R%
z*bqUBHomoCZ<{quEAoGa>DTzkEi{|Tqc0bdC;Hk`{We6y(4{NK
zD4DdrLAgrJcCpJ;gqAKDSt}#>2CW1quL+
zV`r)(QwfGeqV-Hzg+zZ@xWdjD7}Xdiv1)m0rm;|A(6#ETo7vbgf&e2=mJ}cB+bc|_
zFchAx6TcXbCbxBI1{y?rO_CF)MuOUId3y~FG@S}uAN8kVb!l=M?bCK(0KMt6
zPg4Am5KEr0O05;*foTWyeMg9Jtiw{na@K?-c$3(e&Zt?_nd
zaobvqzL_sEBMNB?5e?Rdsndf9^1tuMMfe2vaf2Q4_f_oliCbdx&)mg|=f9
zl)-Ks(fm-8y6*kl;3qh&r!es;K8aeq#
z!`fS|2C_0R6yqw~S?8okkx#L$1(;8jA+Xff(|jzU!mvVUo&1i$ZrBnA?r%|+wY_E?PKLE}H$q{d4IT}5a+5M)x`F?-ZY8UtrMql|Z
zCKH@P>Mq+cQ&LAq{Zc$&?!cN{Tlr#6U>TM_37s8~5sV%D5q)O@u!{hyonQ;}Vyu+jw7+FYTQ
zV!JFfObThbUP&J|m2a?A08P%^OxPQ?ZnviAT5^<}AR@(u=1Zz$G7l8)b#Vp9F{wP+
zSpw_Ry}yuDs)Q=TC`m7d^zj0nmUmlC(JYvAJh!WI98KxY|!(AHQ{45kY*WoKaa
zB`eIE#%zKv->$+iyzJhvqWLpZY-SwG!ih{6I^YyiVW-Ei#>s@0eZnM-USrgkgc&Hp
zRvj5D4Ll0;Uuki$uQkkm%ge17jc(iF%bUIVseednN>1%B*~-xTX@yA|DnPa*J%r7*
zt-o@&Y%F3M(Jp=i;m_Y<>7w6Y=}#gkiI%q5m%p|ysXl`j$=;AEv7>Vh1gJ3t=#n5y
zJQKNLGQp?~(6$-@*OjIjyELcBm|`p#pf|+OvsZM3dZSekz7RWUavbQdTGY00Lz!6q4$ZyUzQ_c5>C3^~N=T__eZh1i>D|O|+j<45&$(
zl`_?V4OvVOtk!j*L#gN
zBrN}9Z{XC}7e~LeoCO|>M47(7$;_QHoyx8Xj7=Y@euv1bCkzM@4!^*hqnYJh^69E$
z4_evoc5FmRc=
zczRwc52K5F#py9NeOlnWi+5qww5S?rz|O0ae2xB(`QDbOK(h4650m^3eQf`-u
zY0$K@s6HLLygSvZHF{xQX8n71NbWYmQhled=B+U6;5rU>?i{YEFMX$}Y+zn=q6ZiD
zP(oJ!4*&bR6MD-!bar^Al4zG*-(C_YNML3B5F
z-k!ho6*n7x-1Ecb_PJkTgmvWSjG~o>Us;Zb1^I)*e5H*7zSI}Mx1H~YpTji})zGxI
z#qgbf#r-;xPaaqzhT^r{T6MqUJ>poL-H^C*v{EvGTmTsD)p3KWT60Rnl**@@AIaoS
zC2)QNs61%l>jDDg;cYjBI9jcZR{Voasvr(euH}^dx{GFWJw3J(3U8@aHoB;)b2jm>
zg7`@7*rLBcFeirXFKo&H@VC`pCf@5(I(8(<_~Z(7d+2_psVmIaXD7aZZAcdt-o;;s
z&_ZKb{cG**x0hYJe%jR8J0s~+ZUMDBwQzbC-`_uErWXZh9v&{Eq8Ci2k^k=HYPD?R*E2@Ow}rKwiB2zV4Ss_G0)QoK$~iHLKagtfI3B
z*dmpo8OLnq5~E3s08}=SP@)Cy!_KEjzumn!*7>g~m2Q+Xftst#E2hJoYk|c6Xo@kW
zfg6)$NjRxXem_PO68>u5{jviSn54mYGtETpw91&}U7=V=x-2oD6xPWB6bO0Qusm1E
z!sWAhiPuE9j$?cz^#>HiG~IaD4*Fc+>*UBcfjYBlI@`_ckQdTB#u}=Oy>j;Z7oZmQ
z%Q+_)fAKFhte68p1m1OVpOYWy!?276tI!&KQTF7&7%3+^j%(mMWtg%|x*!Z=Al-wA<`b)Y3Vhf-$$UKkM-ZpJ#4O((lm8S9e)abbf
zRaWJW+;%0Whf@=&nzOWJqvkHV2T0hr+-}7S91@bp?+hTRz31v8@n&sAd8@=KJ?szb
z_YLUD)ML)LlKBVQEW9J^|umkSpNPnu)2}cC!r!AG2`T
zX2Z{ZNr9{8P(Kgl%twtyXM7JCn|KIIL#O}TynpoFkp3)d{Tn0|p$%>8f3`dGWCBS*
z^+uxh6u1l`-7rbq^O0?}JkHvN@NpgszEB)g0I;Zj4h+sC)SNWH`S4-bqYXMwEDLB*uFLV)lX|Zh38cR)HQa-kXPJF
ziP-Kp{zGs?=!!^0TF;lYtrz1SBV0K7i2?kUw8`~m3HYg)yNskkdd&0ccHXK)Y4uuR
zFHNVK&-JDFP}Z3Yh)g+-IBIWb+S`md~?miFMJW5R>(79_e#aA#
zAgH*uluI&-F)m~fI=3>?9bpWS+c_TRknhykiUhH
z1Lm)QF!9&pyWiI+f8hK5Rq#MzO%dPo6*#A?NDaC6EjUOU5bo30+wM*}4jS@FMtOCG
zgdW(y_$kkAkX0}~5ET=^S^ub;RczAPUl)N%pM27mxD5id`E^R3>&Fwh*EEq&b*&qP
z&Nq=q4kuw$M;X`7kO7kJL_=bdn|`eDNi_fz0ch#fhSxv9)|;NOoWNgRc_l8&<-kHl
z&|8Q+tNJD@lu6ly#24?JjOTjzGu~C!guc&579>Lb!JWaQN8Kp^Z`IOou{=*YIS7~&(P{S%it)&LQe2*_?Ox0I%Q
zHSBXB7dr0@lfFB%=M0{g49Q-p*d7Abz^j5K1t0K$JK&$nW-0b6k)ta0
zFgZk@10F*=WSI1}1F?hNls9XjUN{p~DH5@T9U2nIS$`!kt9ozMGS|>{Yu0GlNyg<0hmfTXsb%VZhmCmk!$ALPM7Qc$V^w5RVvr*g7^ZYb
zcu4e?o-BZEA{78PExvc;A*5{kLxFpN#QZ4?d_!n<#EZRhv#3ZpZTh=!E&EykC~A7^
zEah;jUjyPDDCP=#R&jk)MVRzm>C;!@b
zb?7&dZbS0)^tQieesJ&(C*GS-**GVCcFtsI>L9Z*S~%-T%#CmXw9^B_xr7v
zY#qvYj=&)(C&{eU&S!3BP5iRb(YeC9v-HlkuY|%!#HE`;nVp8&5La<8MvS>}Ide2?
zE8i<{gxeGNf-n>d1(VhnXFLEY#{L16h*wK6n^~VtCT<$f0=Saw%H!DMPs|L91H-+m
zLYM+Vf%tc{Iu%3QOuCCm0CMpr0QX%1$Z;K=^X}|*yEH%`FbyjdAB)1l)2n)yS@_a)
zv2srNr#F-2>xUnN1J2kZKJE5}q2)NY_i!U0KL-ju;BesF_25sDNlgLs6@`gTD?TYr
zT+ev@ek9sdGHvf6n@*2Q0IjeEH;AMu!r%TISj{e3E+v3QB>;(ihnWK#ztqu3EvxF?
zzRi3|2rHXNHNFT?WLlP)`7!&C$$x3-@KM;#m-nj#k=}hR8k|RhW+Q<6ZRbSdwxYZ~UwNy5}jdRPC1KTg-$rRL-1xsu6Z*fF}h{+-Nk#bIW-
z@LVc}@Jx0QShy<0W_BD9(kDc-u>Bza5xitvm)m3pL%kZmSLR?(8nF`jd;l}mHQ7By
zEe?2f4UB;X+8e*RE3Q6>G|=<4)8k&(;!a~C*jvfh6HYqrrtorRTj#lwu>?ud+l;of
zrNv^-7|crn#T7o4#U@Sy5|>}IWd_!25k=3g(Ke2v5sb)IY;dI;CaTx0x6!IRB6WWz;67U6pu#4qyr`;kZ42o9|_|sr&yy
z#3}iU{nP6!6Bv3QBzpN=^nRND;83%!^$?SPFn2|ga`
zlYs!Zo3}jxStmSaq`ff2Xf@V#DcylhhRj)DPeLmr1NB_D%gnmfyn|>GuP(AatMjO0
zI$uLWFo_F}g#cP<&xab$fZm{vjK!dt(INbWJ)kQ`ZtY9Jl8s6YYZfcl|wVPY4%w|$}@YKp}C
zq7da|f29VZCcrN|VKo8}w$p{Q?GWEhFp;OV6aT_K>-b590hs$9d;F)BP&al5XEB~t
zBebr-S@>fwRI41(jnQfcTXU}^AYSD4T1o6|?KB^}=~4GCNXd@$6EYtXARQSYy0az<
zP)=Co`YJz0hsXnFQDIy5?@>dLEWhTU-aLB5z{UUjBU1`ls?;lg;WOscbyb0qA{ii7
z5d%1z+<7D2@M=Y*eYmz+;J~^TFua7ScqS#QL?YAVEk5PK(G|V7qSRS`B9KEw_+;X_
z)62UOq>BM%U|&MVN)Dl^3D#1PyVG>|411#xl#j2NxE$2LF2$(N863rKKnIn6t)4=^
zoA>KR6ZHDAr2%Aqj#nYD!D%$NOT7&%j&|m!D++C1m;m~`<9@Hfe`f7?AfPZru?sd2GUs%^oEKMyQkss$5V^0>k
zAb8JJy#>?A?uOTu$46HJ>LJ|Y93W3SjvrOa7A3I4e2hJK;Y+ByWL-t-!mX#Yn58=?
z-2kqqToe+(Bo>zl3{5;Q6oh1Tq5l<0yWqUw!k@3TRqOz)5$z@e%YnGXYySDgwkhS*
zWXBUd(jfq2Ef;(X$X0&7f46GGffRs|aq$s5WS)h!cUm&-&1
zp{iO4HOTvE$)Km}5>Cas8AQ}@-Gr=@y^q*$yZn7T-RiKUMN5^^)v?7+5=JNE$bKG?f_uT=_jEQpTo+Z(&!mUaD
zkgb1tZrFYkT->wDedMqRE4^sz+4izq!6P2X*xBj9V+LNRlDI8SC(@EvsMCaW)RU)?
z&JD2VsSq2VVFQo7G`h$Rs#zHYKJLbwWZpFd;DZo)iK;nk+F^aQM6GHZIFUI(+^urH
z|BrcF|Bcrs^Jm?6gtjqfmIqgOwtc3+ayr_M;iR-0`Z%}aF+fvYFO1R_xuybiV*P|u
z>>*}A^tb2ZH0K!TJ#zSXUFv@Qi2wrfNq`Xj7PvHU0L`z3idRb6LG*0yJ?2{Sasctt
zET4>?8}vy+ULaLu(ub3O6k^{l-L<-Iw|xBA&R%J#4_-`^{HZ7UwJ7_O3&sPzjDKp_
z*5IM!CGI(lL=3=M7Xf{WJn!!wCcx1iRoJbD#m5W_r6Wf(y&ORyW*V6*+QZT73gNGwv&tLOArI~S
z9s^xfTVvHkb&-$qQK0%BmPzgPU8PueK1pBOS%_(Y!^XvHUD---hA`uom9&auk0`xUrYf`!91VzoC)<4~_(1
zSgCIG_6jDKrq0$c#TdPOj}0pU_to_;HYAk+@&=rLe#Squ3Y1cPN02-fa}zxkxIG^-
zI#tu@F$c
z1><2@Ywr-DE?FMUAiri*^P$9w#jdlWX4)48)583uTQOklC|A^l=~{v{S_Xi
z7Twgizq+D%d&g=PVdvp4@_Jq^%h>7}O}R73z{zMpyZ5(MME(xZ>Y@!HdJ1qTb^6KxE&ZX5*8Gyky4M=t{Hl(C0<;=a7fpXJvSx_VOCrN
z9MQQF7+_84_5SYZ0os)(U$S>67>`@Tk$KMca&2D1^j47d6QQ><)OE2!NiT>H2GQAD
z`G(45#Ow?J`!QQ~L#@;+h)fU2)r1-S8&6TzEHFb%0x1VeUAL^6Cc|cS?z7)L1mWu%
zTknH1t(R_v*(aYntMthn((Lm{Em8Cf2Q*(~XFtLCyFmu6f-60Km$gJXBHI!V2BT`z
zQc(2X4M1Ofbm)5de}uu~w5s^YLdjLd&u2l-9BV2f0}!*c?Eso=np?{XY9}L=XpOpzl*-<6$Q&;oz?mMxodMQ3N_DQT(NhOMZPzfSE|c2GZWR933Q(_RCOL+|
zzT>>Kl}}leZq;vgMJ#kJ#$scWS$Y^&Hf(&W2#4=+q58!Z`Qo!}zs18_Lfd!`+j;aO
zEz;3)JkY)PbrpLRt91zN_F`q`H5aXX*=9LVvN))LjgA+?$|W8$PhdAO*j6$GmLKk$
z!KFH9F%YG>*<<&*v({f5#^(DHLVL{e)@{BR*(KYt@kx}f9fV&r){6^g
z9!I|h2vdV}XV~cHi$SuXU;gEY0>?J%!c>
zg)seQzfXwMObPZ0#R9$QRI7^*2cA4j7S>K{GBrA@eKU%uj}qjgUY8)oGnv?n9LUHQ
z9LJ$>4YRY7rxLSbE#uWWu>D9NE^$Ul=rKFi)6_q5{z5g(?*i33gIb`PHuOJnHBT`l
z(z!@ZA>oKwrn+RPqE!PB31O{uma{F+O5j-#)EFu;aRy)PCyj>8Dm%}La-r4lfWWVX
z)x9j5{~JLncQN;1gx@Ze%sgdJuJ3yM=H7DUS(jc!dv^eWu${dR&_YX`~S+1Wf(Fx7bh^_D1(;cX^cpC4UV
z%gHLWiG4j(FkRVG+2y)Cb?)+ovE|`PtNjG4iuc|t!v_GXSPp=lj*9O!rOkGpz7|%t
z{v`c)U1Qh=)h(qhwsZgkoL3tfJi08;B0LKiCV;lOe{RjW#Qq%B#L0l{QAgx9b{;w1
zzw4vS&lVu4_Hl+%kISMgLJ*wjr1`m=%C-~>e`pE*iKD-uNtA4vUIyqMQI3|4)Cu?6
zzo0t
zofIB{1L`E`2%%|!k~kU}D*`&HdPYAWCwl2&a4}`WScKXNZf*sXm$?7UoXMh@J0G>23U=De?iNPF=?>
z$nf80AZ6u27l4#;i5DO4j4_`+WlrJc4uq%aN-fxvYa>tZOzcQ
z4yECl@`3;!i(pcA>_y=wh!2(TFWd>rQQ#
zaW`~fH)v+o?{4(fv07WcC-T%27Jz=PbAI|bJ>R@J{zyWtY(B^o&thC)CFM~4P
zuDHf(G4r`$;5W1ODmh7b^vOpx;^Z1Fqa<}hnQrZP)(R~<$(2^Tc+F=1CBQfEJG4J%
zyxMRTaZGs95>^(xq5V(bbB>;v8DPziO*QSnn{@dQmVB^_KA)1$mkw`4{>H-3?5q-?
z^W>4%y1`MH{$+T5)(B9#+2%$e3SqPn%n1)-^&sq0d#Z4`LYS`UhGj1N
z+#LO-d|L~ec*AA;=y6gCsbYnaA+OXuY~#+frsV8Txe9`$wf#Lexux-Lx`W7907+>X
zT7@l1p3W@`{pdaIZF5mitK1#V+kcd=_L{y3858^!;JBGb@AewEE6qTWsFgcN6*z<=5QEd7`6CfAE@p+zo=XBAJhP_nAmwh~5`sZ6)*(gi
zPX>_>j{7eh9mOL|N0Pu}aMRgeiOdfVbg<_oM!?Aav5|e$#TXL)!opU-CiCZ&7KeEX
zJgR?jBoRNYP_(m$DH6lxH@}`g;`&+f04uR=D^yQ9O2Wh*P!*ghgWKz3;=7zsFDsjQ
zX!V=rRRlc&Fco{=SKQ>@bS>uKmiODnY{D*VE%vawXiO}HBGmVJ533r3LFrOUsOGZ6
z$Q5`kFPM3Sy(=lxBQ)a`s+I@Gn;lF}Q&qHRKYY{0&lf|+>;hU(Rk}Y+LjGRN?ta=lmrLQq4$(fv2o2vnEYWlHQhFfI5xdA
zy|UCG?>uCR*#-qSupxy@-!2}@07lol6IW|p#^J+ADdWgEw+d>(&a14@inl1G0McdX
zt%W8GkVeZs@JzXcpM=nwK|OyE3C@VnMErI>yJg{PV_p$V-&@$i0;J3I(s=H8LBpj`
zz}sfNyqF!BwfLlsdl?@y2Y6NQ1-^54Ea8u?njTkwA+mIhxB}QH5H_amla@fIa_|IR
z$Q2OW$?b*d==W8eXfdZ!0BFP_Kf6)2zl-!3GoHgKM&Wy7W~hi7`l~8e(su9NkhL1?
zn$Xw}3fQ^t{limiACPs-(Z7A={$(#Xx_e`war5CyV4M5#+RXLp)Ca2v&tK!4A%|mni+(rQ7GEgtFNpgFwy90f?d7FTf5uuyL?<;`$
zF`ic+g}4KG1zqdHcX|}u@Gd%&sJ?0&toii^q5|wtIC$OzT!DJ*+%3uD?GYf}|I0A<
z|D@(M?+vXt@9@c5r6xIt@-t(r@CDGp8p%YnNxU=$XfdyA7A}7d*q=H&LKJ{#t1$wt
zQf#crHYKJqqx_8Ahf2>4O?5Kbhuhd#4)C^0#oAD$mWff*zJ!>hZiEOGV
z0cE`J3S$D83vg&_;0u+1l6_Qj472lb!1@XKLh6AdpJq{=z}KP!JYpOjne8VnqrIPu
z%^gs6U|?StKCI71y5)>Tgo
zlQq{S67oYs+DR9*k0_@AJ@A%^BYiZtjzf}}lg95dPa`TyG6r`(j7+#Mz<**IWagq<(3jqB$
zyueKKO`{*s-q<${c#H=Q0pOU2dxr_ySdHew(Ob`TQoJTs;H6-dA&!NQrbpvHGT+@zOGnk)Zf@XHC937t?NxV}8fWhE|JSuVs~9(2Z%-?b-{J+!Mgb~H{5l})As#&c
zYa}7I1zbJRQBigS&I5!%R|_|cHD98pXHqsyyQPz>i+$QnhEu;{VxKf!)&N3VDh_RXPvZD4$4~z@_&k-
zDhmcax+QL#QYQ^1I8jkgZTH@=(bSayq1TcPfB7Xr8yvt-XU+p4FLFoY;|cefZza>2
z5%`$IgD`1`%)*+qqdL`E8-7Z5lVj5-4F-EfPktOv=2zVv>BYzVk}UFk%FiX0;M`O|
zU=fhYH+C5o0^mQELMDub
z(lv;5RaEg;ff*o|ryTtZ>(VUKYwhw~{R1B=Sp5|sq&)cJ8sugmZ0B&%K$D|#u0iI=cn}EAXj^`eNNTVT
z!`rl!j!l`vM21zF8c>gKnVufCrVfs{w-pr1?eXq6TV-MD=J+kv4Qs_uMN#H&3
z&sE@8#<;8LLD$W?Y7{e$fUVp(VuY4l4{*!g3&cSoSAyKqq6o%g7(0t&qsQQwbKJ8R
zVspyO4ynRVWz2dtd^|bXfDY;#&C%QCNegnz?G@Xv$RI#=4@C?ZE}kzQF^0N5v`IKd
z(*OUt#LaR7>1CV-8qGKmipzC{0fOmwbUfq|0+56GT)-4k1M8Lpa_fq9)#<^q(8Ddb
zv#0n!t_QUrE+W!;)<n3XH2aR6@+`(_5
zw%V(q5c^c&;2g)^WD7z?k>_TK?|s*z8*VB2(dFLMj-YPk)vWoRPTTQ{!mU2SrX6Lb
znd;L6&-?ePr^?{Exer~=V~(}q>Za;e)?HWy7J%>))?M0_WPdcUMq+E3kb+QNj9YC`R?pK=
zB-ZW5$Zq*f-q=*Q6D%k|sAPTSAHqJ8e}&-c;b3W>8H?fp@7qqN(oaimg@;~e+hs%q
zGr?Z2NXZIt|Ikr&SbsXWgjrh<_D7#8WJda~*HZ#+wf58$_65A#N^b3RGIn~>Fhk2}
zpXiu>5;mfWS?Ww&SgAgBaEdN=bvFQ#vOaDDENbKAm)6;C
z&h`G??da#6>Nc)NK_3oz;S`gKH>=Y-J=R;+e4K{+KVPiag$G1s3DX1kj)idc(ORBE
z$g9Zs3#gw^xN!bWA4fBm2sj3=Mjv9$b)zH4yB5beu1AVa6IOYI*ZYPLxpJHhMb4Rz
zWP}Lcy~RHXcUZR0bW=?^w)MIVQMcVnEL?B&;ZF^5pOfcS$zllU!6m?!>tuU+SN_4I
zL923m5YYzEw%ZYJ!S-iPj>VnFC_i>+fY?-Nm|pp|56`_Ep{WLYXp+z!i=>HvLI7!9
z2>b5wB4DZsD!ppk7X^d~?uCtj?Jxn#zZEzdic*jo+xs~XUZeb22Y{3^MzV)LRf8R=6eiZ#c8=m#%yibSd;IE74GjRCPJwZ}%^!bd{0aHd2Xo;}T0g}|lV
zt8iQj2wPq@k1o&nfT^_feoifmDjYc;WS@jp>8oIxK=ye}7~p
zor=GKnXdKdWDDJ-YE6yaqF6^iu^|25B5|G2?S3hV~
zl;Tt)!nOlj4%xVK!ACeiPD@=ysY(K*%Y)+wc6q4oQ1$bxF4-aL_zyqSJEJQ#@NElr
zF`!tZFT$a8WTf`kd1GyejM%lCP=bnDG_(WoN5fAWI0ulYD&1CoH5J4HSrsmXp_it0
z(ft&_WXzShBRKE!h2ANv>rE4xuV`n&g@I3E=ie?N#~QTp9)n5RA@WaY=h5Srs!-bXLwvzX+@ctzr}f0BvPh&%1=>}a$>l7S=O4_Cjs8@P>o*zk=VKqLfkXr%khpL?}FvsO$zsZ5rS
z@Yfdzo~~X~a0d`rzT)FG$0SY|ZzpYe|)(FNY+sE8qX&rbRPpb!E`W0zEm
zyBRK@5p2O5y-4s^rW+X(i9x7G6)$w4l;ub_Rg#;gJhR%_IGFdL{{7`ysVGcmzX&9D
zLJ_m2fM%{HHP2TFRM!hn4z71qs;gYQNM-&3`-RKJ0D*Qe^Oxmq{HC`ozoC1hfoyvdI10c7z
zKi@r*AM0W=2BhBRG{Y_|@aAFun*y7HD$m`oH`aYrmMX-bQ?b2MEs-e?*R_-7Fb!OG
z&(EJQ@`a-9pw|%JVsx`$ZMKobW>t
z5Rd?Y<+PASRoDQ7J`rTM9RjjTaR-GUw)C9g8#=ZDoUdzZctq%`V-{bT?>{^8YOzs}
z5u9kX4*MjwW=GNRI|xg+hVd1ko|Ohs)3Iacn(=7>HY*pZvx`#mdNvq3P;68zEC_~b
z3r3tj)Ia!bUF(;2P2!?xXImhCdts$CNO};7z{%WjkZ0gfb~vR0*?rp=>~Ox1
zA=Yn=6Sm5IJXCLLqVIbr^yQAPR?lDZ=NEEnw41ZD8H>NDdVj4I)Mwp|`${>StX!!v
z2X;2R|3}Hd63hzZ?C|S@Lw%kXjc?66r*BXdt>U?SXte3RK%
z92>Jk!3#e?wlfew-b1Ny`D$@|C$uXC14z68muo8Q89^o31&E~1E)`5tfzo$#BI^mp
zdTcsPlt12E)ldiw3PYief#^I1iaDQZc)PafXZ(2^*f#Lq+>8fz<7V!n1kWj_Mlhau
zT_K(r-I+zmqqJb0H^-~c
z4TmTRdM||)xL>M-7NwO~=I&J5dT6|PEzo<)hiy{>9ojwY6F{8Rujq?j!-W|U+R-NX
zzW8J36Ov)2Kw#CAtKVIo;~c56>iu!4eAM8sOSPtScL!+RUUoAG{D5&{3`mSKcW!7Z
zK*TX&{ZA9#-?JgpxoFiCdykcRF;RXk+UT!ZHlTkyGg2{qXt%$hTp&HD>+DW%KNH&>
z5JuuXBvWq*L(vzLM>WtEmie>UOsHD^ux20+r=KHxhMflGhwFeh!<1?f1nAedW
zk}Ri>Z87XEK)KNfXcfjX6z@4qw=8GG3Uun9bX-O{P)lM4XZ9V!!^5qwEyg?qxWf(zfR&UfVAY6<6vUg$)1!pXTD}JsKz0K
zpTqwiR-nRZ=0tz|&?qS?Miw@k{ZP0b!wOW@W+dy6-en7RNVNO#vKR0!=C#ZVKhO-K
z-cBGhl=BBk+TdL-nfbO3*Xx7pC<=>AJ6*@wPW}@bNl99ic02a9jK|i5btdnh@bK1lr$mIbI(IYi%Af`G^&UGyX!33INQyIT
z1jne$E#*ENplt&Fq6l^#s#1SRF2`GK2tWi!yPTla;7;KE0@l}yzmt<5EU;8w8@)RB
zv4ic&v0KQ_3q=i#)E0R*b0ZN~-m$M$+&$Yl7f|G|QXUjZLoGR<`qcltSEPeV94i`H
zk1sJ#ro7!w^`K+S@;WiRpJsM%y6xa@lW@Z_lVBdPyd(Dw+ky;cAb3WWN6{;R8z%#CDI$z
z(aUDnfx)xNt#kb%qrG*hx-dvZIHCvhyv7umP?Z4EdtjbRp+1jx^Anqb*n-AsX?&303VlD5PXme!J
zwm0$?-rL{lO`GE}w}etq1++%}y^PL$(L@;;&Kv8l#??OPI$gmSKWR_y`;Vjwk}}Rc
zkx=K2w`g(I?qvttxks@NKShUe&&Zaom^*@cN+7o)LlHS=D$U$nBN5}Gz9&9O)xhTj
z88g!^b$9(5H#PpOb50Qa&^fL8xMV}pF)!pKAEoZwE(qPPqdx7(OOA_3OW;nPc1?{N
z7cb!%fyKVCNIFK=0?%%&7FbOqjzOa95(*kf6&E~T0YUa++VQ||0%4=u6EaSeW8V;{
zb^RV`6@>IIE1+w8-W^$kl%ncUh-7>z4hd73k2U#6Vx;-iXG^2cZ_L}-P(f(PJJaqg
zzhYK$+;QERwJ&F8;^qn)itt)+p?bl{FTFXPZ}Ub
zpX%EM^Kw=t4HQLs(Mz;zm0$8v(#}{cWqPtofT{~SZ`wLwjY@(?3m5ADYUMN8kZKcC
zVq-nTA>s#Xs47DA#yV5|2qlZ*K47El*R^x){~gt&806Bsc~-I#S<$eJaJnldX_Iq&
zo$xe>aC+xhb#V=hK3EQ&`J`yQ{PTv;2@kML{fQ~FvisAmzE(rmJbhsyp{oyikYYeo
zJK=)~4pSegb1R_=CSV|86I?c)b^z%tUO-VTT2#^+#^zM{76PY-&2WaCKtG&|XTAgFH8ozV
zsdl4bREegxZ1d&JAJ8-_2fABwNBPnC5CWx^$WY(Cjgkt!k2gxk-UPTYC=uY&QL(j!JH7Y&jo_H~
zOk8PDgn{k+d{fN1`Z4*5;6m
z`4lARJ{ro?m}*eu=Sh~b#Ibhe;9OUZ1bI5JtmP4`V*ZGI9a~kowGm`hpd`rv#-RpZ
zj!U6~lj&}d=+pcjM}DsLe(gz}1QpUMP!aLC6pc4sfEp+Y#3T&_5|X`9y5H^STY3aJ
zHEeBWgiaN8x}h~)#qCe7yzPommnc&<_Ej(0cuB;^Wvt&CWS@N6|IhD*KOLL@tOsRZ
zRhauPM7q%~%wN21lG
zQ7I_NbVx(8sxGX8A$^2zN#c%A2EsO4Ui?9(bOU#RGYkC)77i`9;pmBh>gp0yy84Da
zo(6bt?`{JxzfIy&H_^tu2qU4Gzf~7<2Ap4KHVWv-kHxrhQff87X~!`?up>{s-2}KuOOfHQ3#5
zNr~X^E{5PJ9S=)Ag(El*46pO;qd;PDr3q6s%q}-CS-BR#N0oQX>=p)zySKL2aH985
z6jeeBtF4SN#zE5ys1)s~L7Fc;!y%a(A?2LOlECxlgV?9zBW~H7Sk#QHZPHo!*M)?1
zUaZ;lr?kj^oo_JqNcz-LgLiEx`3l(2uEgtR5i+TPnHkBS%FyQgshC__wJqfS`i|k+
zq_~*TVCZ=C=%7^}KY-{R4>TvJ^w_!T%_cpAZ^G%g6tpvPB*^S0(Tpqz+GX3qxiDU9q;oIG>L={nE;YAgm
zx`|nz{gDgh{F*Eh!o7%5X3^?++xiCW0O(oNm!$7r;xZ6Rf`ic&Zs6052q(+GMRVPQ(CI*w<*NY1O~AehL?v(K&r%P6XgVLho&;H
zOrO;E?QLwW%pFqL<^}yuLrBLd%fpaKn$pt{qHq^lqHeq2lR{M
zDxxw+$EdhMx
zt>^-YxHd1jz@dfvWu!E}yJ&rUf-0hVR~K*sbkZAM{OIrBMXTy?3?+hAUOMtUb4RFs
zH_G(SP87|1v^?@DQdT4045#_S2zZF|4o~JXvk5;jZHXQKf0%mnxTNy-|9_^YoVi<^
zavIlg%G8+_m5dYxou(;gCY33taK)0+M#_yy7SSoE%v_jqTvCL)u`)#=GZz$Gav^eI
zN(EP3Kv7T;5K!EH$NTgBCJF@
z3BSu#fhCe`Q_Qf1-NFB@kFD_Gki9H~^I(1($=kf=bX0pP5ZirD3Uk`^G>l^*=Xd1g
z=UX5_+Bdy-L{>*hU)rbi6U$4wi0#)aO;=lI3oXK;JXgn!pE@1`qCQ7R`x1?;uOBV+
z*jN@IHYfZA5?WWp`UV%Wu96<2p3Saod+pWUn}s-r)q=Jz|748P|H#dkewoIwiTB{?
zX8<29!=R|4T3T}F^iCOoEqRmf#@>|k8#RT>H@2?D#T&yi4;R3aY&2ATVYI2R{t?Zs
zN^IzxAb3N+rhgvd2|=%Pc18GhzsG%Gdv8E#P@v=;KQqxwD6IW{M`1`Mu
zqTmpsC;%+F7^~^sv$2^bEmqfXZ@RUZcfV3_#;IeR<_j%t4}vCeTxl3y)SEVA6NRXf
z1~TusLd{!PZ1_plKv8!!1s_-P$bLJ53C4j>bSN(${q@BCKQiKCjzTW0d+b^5Qh3L`
z3oJq;H5*ewgMeYKmmq3Jw6w6kwXacI9$g4poAx^Qr2EzjXCImS=<*9mrh8P~>p9TUcP6eGxTzl`|zezdr{v2Bj7Bg@_Kv_v^z?FF@N9vWTO%{&4I
zwcL{X(TRplN3NOo$ObjDuCh^;5$$bE{5RQ-b|X4LVu^^a>nR+Bt>dk=FTIXI7NId?
zO}8owMsCyrL(KbQbX6dGOx?mgN7%^Nc9%RRt{ihrJ8Qj0)IIQmg&6>2FjZ>R>e}eW
z+9GgwZ;nD-fPr4Izl}dSA*4#FSm^(ATa~9vyH{Q7170rZw
zt^YA(UbT-Ib8nL1udh9(9@{VbxGYFopJ`lIG=>XmKs@ZyK~wg-TWLYV{}i?ixTAGS
z9E&v4>TcHUla8zRqD3I{Gj%~JNs;})8{Mh(
zqfUHPN%C>tHyKm_CC{7-&G%SWQ4o%#fsR3I5aM_)M`~-CQZHR;jo8E00gD?!
zY~F$Tmo_|~sINyvz!d?-CJ0ys_ZR8J+cVoqYQQ>~yE^GecZg?q__zRTH)Ju!U21cr
zfeinq`06<_c>LNa^`lQPGGiTmW0_w3!P)~(Xxn@qqS)b6o8;dOA`Ktlh&bv9oX${I
zKQNSuKADxy`$8Ekb3?8yNk`Y`Mqe~87c~Bk_)Nr|$NetS?MULeiz`$Qs<2dv)v<)Z
z9@*aUqgVG~p
z4#j%?I|Shu66ey~Q`w)ScVG`ifFRP;%@EUq*SFOBU~#xYVBVDHfH*epXjzZu={#5&
zhmUXC@k9*L>oR%wmpyhX;{FBGv3b1gG$K4@=oE;9-fkM<(9U`Fakz*}i(sxq#n%V9
z3tUY@m)|3+H7TZnoV+WZV12HsXK)kYQ$Kwj&4ij2kPfv#?2Wvw#Of`lA8(603JxncR$6bGofl}D
z!zMS)+B;%;Np@a0DLpO!ULk6y483+|%fefiXXxuQGfj84mhYq^12vw{cTT;9L)
zdscoH&kBEew@3K6si@VH~_wn~u=c1EHnbnM`x}}|k
z_SZYne@|Dms7Qx#F&UG^vV#iH+e(+%XyXs>*?ga_SX*wmh)`4$S_ib8iML9%^$52-ir0rf;
zCWQEu)1D57%i?|vU?hZXfI9#q-4Fn#%NwkxOV7I?PaA{fW_dZVSMT>_dCKN&?PY&l
zi=t|JgIcgA0?>rKFOTsk0#5o8Q}5vP@Vmp_o&8fMoBcFr$(c5d-M=EZ#mJOUQLyuB
zdY^qxY)FvY3zKyk4n@`v_6@pvyno_6Rlj|4VOcV@vh6644mquVyY%jzAhS8ngVpJ@
z@h&iKAv6BBG75#ZiQP#yp5+jQWd)Kp{Dcg>PgFonCmf&f`ka$5ZpCZY$BmQl
z#96fUkVF5)4!6U+s^+fR$dS{HJ#o=}QqZMi2t&frJnhBy;D{NjLedeUPAx`tkgTE}Ew8C6&og&^c&+4!hQ$Dze9>?l@Q0@Hl
zn8NtaBcL4tgRFZ^AJ-QV8*jLAUrWx#HF(SRx!M~9t3XeN+f=FSq7@yBJ@9IZmZ#zF
zYIpp%m1?A4l2GXQYwu+O&QSBxH51lnNpqq^pGXZHZl+k;jGj(PUbt{)9Cq<5>1(q(
z@Mohws`LM`KELSUJ2Pjb{L(40tO@b+^7TI{Z<*vd45Fq%Tb_%ERKx{V)=KL4>VNI$
z{R`9odK7NWSP0o>eMY^4Yal~xiB&_Zt-}Y0uXS}DA@d)*
zEgP2f9ClxMRMqPF?SZwZ%Xn2wn=cndbM|tDL0eZKQ`g&xQ)Y^`cNq-Ya2;SCUBhJM
z?}@TrUD%TK?1nT(-Y#U+IEdWX;09qizk`?|TNIYw$6f1kYlvXeh~5hrN7A8O`wGL_
z4p_sli)sD_s~U~D2hHAO(c?Tjob>iUx8>SdSY+buC}StX!pIKg-?i@+QjFWPY^~2M
zeAu3opT05Sxc(3MD9;-1=CD0+;}oqOkxVFVs{b=|>0an{>m%0+^Fnh~ZH#uA*36mx
zt7h`#+VaKy3bLkP6t*T-uAzop@Uvhmhrd_xr@GhX;~V*?g^zgT_es&Xk(f3AZsn`P
zMys1vpF_EVgsOW#i~r#vhR+GcKFg{ubdZG
z|C7GsR~oA-lorwO*LcblsJxq^8>T7xM
z9Pa0U8M=%r+a>!mDSDdQw6rHWBv}D)5c98T723t#5k`8}=^H-La7{V}fmwP3a^S5A
z8I@6)h#OzoCzbE;KKTnc)}d6b9_zCW^`@XQXn}L?JRr?305)7%LbsQDZjVvvL_}{IN-O_!B
zUBrAC5PC&7t{aLx4Mld3c=4a=8#mT+tr8C$vL~6;r>y>Rjy$>0y+ecas`5?DzyzZW
z`lJp03_(CbrDbK2oly~miunrJg>Kt!%|R%e#kM=~q(#Dq39hWXPj(g=drT2-zx~4g
zjpIJQt;T?x<#nbP2mGCyZGNmwfnsv
zNA?6S90r=$Ds~)j5vC0w3qc?kZzig2pRu^avhVQj#z1369g3C*$7g5kca6Esw%*mx
z#+HNVq#p`*?AcbEfn+7Ow=Zha*=*4eS=r5$8h
z$pM6fPl^9(^${tyB0`-`$nM|;CVVDq=%tm|-v)yF2|{0o-ZjB-%zdZqorG@(olwv6
zLF#jEnL)rNQGR*(km!#>chYO$#OZe4vL1%X^#t}^4rdf$69}H}5sB{f=72suW^|rK#UT((X#G<4KolZaR
zor~BeVE>Bs6my3QXQwRIEO(KmEyTrBfHa}x8?qfV`x|LKd3_!l8c+qvt)SaSuC8+
z$6k@}sg8-7K707Mtyf65&D6ovoTQ>;ev9S_hcs<$Qs$y=cF!zyLnJy9Kco#34^yb<
zahrc56=gk%hS_oSk6pmcXQNJ2^`|*HEbR^9LWuPz1xzWwws^sX{npqtANd%f*=uBc@;x|}G7cUB3P`CV*X
zGo_POr~z
zzwe&A5)+AVA{85nW}ghU_BJDcx|Oz<4>(q6k!M!}|05BdNSJ+_D_%X`Su>~060kB$
z;Xpx%wj>(qSFUy|-|R37wbD3tf!EKQg*Ir;n_wp1YMYEaUUB^<&|Ad!E_2R})vU#H
z6(K|MMpoAM@7rJBSADU(SZ44q^EOlx1XkUYMeK#!EWzN9f2EhAXHM^Bx^RUM&t;2U4k$wY??t2TbEa2jW&2UsHHf
zvDjwm79U{T=P<;D7f
zc|7y=Y3gMbJbLU(S)p<-yZpE{hGNoSR#6M`*7U#5@z_P
zwK9DIQzV8Tt=fo|Wyg?&iO;!EdI6^xtaDHBsrv{IUXj3mh^0^(Bw_pE5DcEzgZ{IHKHa-z
z87Bz|z0KCVY2z;)h+;NA_DZ#;#Jokj@4E_DuHxRG7KqRAgc3nR>k|roqBDynwA!8H
zOn5zMleen>THRNfh&r(H<72}a-f7PPI~Fm{L)Z!b4N2zy#NHnMdUu(NH5ESTTh
zgU2L<*|opUtyl#Lzv{rE>FiqgY=(<3N(X7^#xZ*uEXO4f2wqUxTj`>m_<;`7&!+MI
z#pvv160jHo0zSm1UJf35w^;Q05!2w|rOB(^PrJ)n<4(G|RCKnLik}Gk7?AkelNY%#
z4qW=IxH|J9P16@X4|9_AIyyQ%I6%nS=}XGQzZaofh;vp`}d
z<()-LjLo6s$vb~xQYm3#1m_Qrj7rF<#$|3YAAL
zS&k&9cX@dbIEsm)h=x(`glF6IR_}2Zk|VreUz@+{%dYJ#pE^VIuX{-6K_41pESiQ@
z8j0DB<=yw&uCtwtB-~~bf!R*R|MXm!(8CTOCX@G8`9+XlAjX_Ya=lfllF?IuKENMGpYd$?Ta-UL+!vf69gqI!QGsGF`fNrP&++5Zb@Q#c3?uuK
zyq2s2ZtK67ry@exK`Q=Ip4B)%zQY*RrjMX%}-Wwm%ooe
z%>5t<2fDwvpZfassdng>!wJ5Mu*vDlXveP^C@#4?Ei1?bTiCnT*~rAGXRl4SM@(my
zsOK)f*^*)XdutD4Uk41W=wr2%Q2PI3RI}1FMIThY=nAhu^V{y*QI6p{^68P
zg{lK^@gWcfu&s0B^73myS|dMVuQ~5+jKQNb4`A`2Tq~#a;Pov5!wgmeWT}_Wz_yx(
z@bp*?E|MP`vJXuRn^I$O3mjWtj$%u)t8ra!&rdMZ|L#^gfeBNFhn4>g+?wS@y%bv&
zQkw+Dthl%Y6?yrYpaBa!c%doFVT`)E#VR6%2rAESX_F1>ul#Iz+DYf_m4iIYgbjMyD5+Gb}t
z^o{A2bSHFNS#juZU+aaFb$PSbZXDAx!m1W}?S*LoBl2&Ya}7OMoz4d@m;B%V5kkU8
zma#+(`)dhJ%$EE95=yyQ7{J^gg`neBY;#nUhhlOQ%WYlCd^pm0k>jIapRGzYcOG>m
z0Mblep3055BL6UmB(vxc9KNc=G&jOggOl_3w+)E!Q5oI$&}9PcP+Fi45VN*>LdH6F
zq_=!x`|#RnFg`U4oobHky34MO5C)IXfK>ziRkg<>KYOWEQsZKQmOZ><8KF%7@Qjvk
z5!oJD=GQ|-JLC@g)ALrTj@7BwGhRz|T$er>_&E9*3nubY66N>@Y!D}|
zJWbNv+Lza1!b8g+jEBYbSVnN$vBcWJm$?QIVyEXv`v?bLGNq=J8Qy9+E?=|}e~v7+
zR-Fa1z=D{*=XPj?;ruaGI(fCNRH@BAebblDu_)TwV%f8K>;pw#agC{m&o2Lr5Bj63
z-o;v>Htx8fUmP}*F>`8Gbq%0HP#GF+RfMr=3-C?(;`q163WWJ-cj>UW$N3@5`H^B6?rP?K0h8FMvVP2?Bq8!OhKT~FLdSCb8uXA>QFr|B_gycyCxMCrQ3!*
z8yzC-m756q4Tl>|yGm)iNU|g8QGU7tv>2&?txrGBB@<;|U`>=WbB{Q6;?ArTVNlzL
zeoFueK|oW}F79S?-tR#=%lhP%EH})6Y5K5*xK=&uM^?YQNY?#!gvT+=Z+o%(hpR
?`VYjE@xsihgu#zHKp}!!;t6@gZ3@C>_r_y&JJJ`Y2GH=v+_D
zSd3fLy-9I{Jw5tc
zVVnOHXClC7digK`=d9FbO)O|!_t?wfg$Jf}g71@A3xiC}WCVn&o7fkr!9Kz)dn3x^
z;MeaaP-};eDj+n)xSJv&mSd1U=;$DWg&kKy!di7cu!{EwSVC^oZ+i(R!}sjNe4mmV
zjAk#j<~8r~4pt^$$-2i`WD=+MP|d^>JuzYg$_G%64j(QUrocz1c66<`#yl<-TA;A^
zp&nYHw%6(Zppqw&k{9CFKv)deu<_NM5Ds-D>>uqpG)0^Sdb)!#>Nt%Am52HYlApGe((-EplS45&
zejuP7SV?-*E^_fqubq?uubW}5V{z}mq921Xm%ZM`-Cx_=f!-nrDt}rN6)d{BKU526
zV%}Q}M#9VDI)R-250#38cIMOm9J*u`J)de=lzBC
z8wya;{38qfVN6)uOG3xo)+~lcMOlDyMqzaeIC59IdqjY}0II9VM3haHlta|CzQh=!
zKcZlmnjyBL*UWC6FOxp#1LhIe77NyOj|w0XY3CK7tiIE?GSvfP9zpKi+E67mA!SLn
zAM&N*+o#J+&=+^)Xfm3s9)8%`(=pUqT&=5#pKLPeX}L%@t8jtB;Z`b(`rWV`SlkML
zgIPKGWK_BNIn-K#HDz}KY5+S5oThyJU-4`ES!2?~x_Nylb_EF;I0pxHSh$rHn+kCM
zy%-&095sBm(7merJROJDP7$l7`t))xYM)>@K=fi2wcFDiT?Ct=NBwgo|Ug=BZ4uL;y
z5X5YVdsp&%WS5q|$1=7=M1TMQ-)Uz{H}B}vMl6Y60nzkvWx8nmBHTiYSLlA}^v|fv
zufNUZF053|LPZR9rNNOCVS>stV6^1$;#k&CW!KW%VQ97jsDyRp
zQN>|8m*UJPiau%G*PSiaozPuGKz%?{H|$Tx5CIZ&P+0B$YUEB)w2@kQ>#O?6^%_B5
zl4R+TU97fbU$T9};p$?}U@}J-Tr`}Y#?batvvFuBe3yS=MS@Y*+e4H8q;@F|UXX+Z
z|2S1t+l?r%qWbI~&KKkO*})^8o!@2YlpG87Cc
zMplBEl1pXlBRblV)>7r~M^bQqXcM-^&(GR8vg33U8vj1~v$Hq2
ziWEl|Q5C1@6JR3Imt5`peYrL7qu;aEdh30$WOW-19~q{8$4$+^Pv~B;mg@|ASR#9N
zH!E-1jmQpa1lIJXkr0{$M2_k3YPKwOZGG)UgNr*Dy;h22Cvt)(N{xnEdl@CmpXa8y
z+{XZQ*c?-{-Ax5|iN8vFAA1!^&1J9BkBr`%Z4+n#x*B|YS4``I_+`W~Y;0}!t5720
za$xrsKgZqSH;xfn^QdR4R}z`k1?(>1Iv3}@SFUz7Zo3o=ePUVM-k2L!7w%v>+ENyA3@xuJCY0MoWuV4})5}w{FdaK~UX9+%hgjxE
zUi(&-Hc~oKh}g;E6}ALh8@T@6qiKnZf%&Gy+m{Ogzpiz6XYKkL-j~r+#Lo+6Lgbfq
zK8{8dJ|t?aJ49}h3olDSlx4(d7l517^p&6YLFjfn
zrkzo$Eg}RH^D3osaiCI-aS#EPC+PPp|DfhGcb`%5XZ@DU4CCn&N_E1!D;wE3I`
zqyF)*Or5EG0wcZqIU&;+k%3B_G7q9_ik7dx&V_B#y+oqFDEUfEt*yA{SbvJ)Sq{*F
zc4XdaMR9}z!$^M@E((Eg@c%_=Lxv6UZmA?UHslTjt|hJqp0nBvyj%%T*2ELaqOQ}U
zy~L<8rIwul6>4$!@$!=ymBq2TZ8kM8B7D_xQEkp%N}pjE>5l+W^6$Xc>+W9d*vY*u
z_TfFPWA7@XXtaKFd>oi;V^zj4$s?58qa=f#RRJB6$2Mo@RkruVpb2R^5v*?QO%t*C
zU67aOJc2cgkdwtJu{(B)wJ{YJIb{(E7p5yWN^4z`vh5UJMPkTINOV`T>{XyM&>qrT
zCQ&Ri!uysnbO7fRn5ULRpeEXhT0S_2r`+ypS0
z9?;HLc9|^v*1H%c^0b)S^piLJpWqvD55@y{mc*i)ixxh1e~2yAy(C81$M;6h0YcltH-~eeU|96g_uEQp>_qnpf)Ire
zE<{Z|m3a*=IfIMVFY>E|P~jNVS@c4jPsA~QAx}ooVXRuMDhk3^7gIyQu3U@|OLR`lefrwe^7@SuKK@y5kLL39tJ31Ba^aXLpZxj~
zR5@rts6r1Js8`d4L?37SJi-C4u0n@7pzb$xa`T4XT8DsJT^
z0NjR(ayE_~{|tKdVzSloz_PW+=SHO@r!hW)8klc*e?F8w#aG5omP<5w!IU~wc}g=2
zvjux|rWw4fbB^CNWBTxnCz{mn9t$Q5kI#4gmsS^yjLevP@BWb}OJ6Nrwkcftz>E*o
zGA)g(BiDfBi9Dg}4YEOWEKj6%&4f_kT{AW>Jh%{i_wn`!xJ3GPh|*W}Snm}6K!J70
zDmY`Lvf*0;!&J
z6z~AN?+SFh?->!GH=EQ)rtZPI&;5>Y{~sGD?vA2
zGPI>NIXE=T1xlE$3Lgd4gpICFxfE}*Iz2~Fs{j1bVXli$Jknl>dm3zMMrs#N((?7M
zdJ5-nm1mP@8)sInSI3NcRz^40XB43uhSzkiMa;r{(5T^(`#b;#W}gE!yJ-~p?`E*0
zE8_TnSY&@5veD2Nl9VQl^O-Kh+$fYR17-Yw4TpGcC?87>){BO3@6Ii#8f+A~fZxbT
z8z{mP3u8A#Hw5Sev8umnkMQkh?d85lh0GrKJD0=
zD>;>?P~3eS5egLo{Y{4VjM#4POqfErP?e*R)`NhGBvzaV_Z0?bar|iNzk7~|*Ut20
zuh-?et;B@}JBop8o)fm3U#1d`f&fbmF7;7^dJM@>JYU~bNDS)SMi^OQIePt;?4`)h
zo7^>7;@S3{FPJ>D&oLSbJm~=Rc&^Pw
z*HmfVZYk1lYQVRLLstexIe8F$?Y;>InI!|D#~O~4r=00eYQOo_UDawbD@|G{jFY8U`CqqrkB1>sS_vc(wDCG;6A)})?fwIA@L0;(6mf^CHg>aWpq27HX0f1O<6}yl8
zUe|fep>nvx%hT||#Pko(l}gW`Zg5POwB7Jrx-ngq4bh=hJkFjm@Yz`wuEn%*d;p=1BSL1OixN6q{k5~6g618
zq8+GoaTa9^Gd$WoKw9CL9GDkX8^#DL_Pgm6KO52G2aO!&r
zemXgz$DJP7-s@bPS>g;3;Jp~;cFHwJHOM-_^DLqZeNfpJ$4H@L6m5~}yvJU~opl}n
zVq8v;r;5PD>s<7UslW%hre-M;XBy^l%k@jgjLtLI*q7$+j_iPB2DC9!iln
z8Q59u34%w&|3K#v4NXt=P(Px0Z*rOT9q9#a2nYol=(BglMeBuE)wHTmZAw3x2
z0iOY0o7KgjMs1ME=p&~z<23?>Gf)vB4;*W#X{0MUg_
zdT_;rHK@e%+#N((0B(;VE_Z~AJ&0~SPr7>tUpLO~UunK~k2iG(m`ZsI;NFRK0LSV9
zpV&jm^H>=WRC8-b*XBhh^lSn7MJ09e=&|s%O`ZET{C=bQNaM!__q${3(*ZWl{hH0U
z(!{z3rO6jjYrlM#(jsZEi^3KRd5db>A%WH&TSx%T4(9>{_f6$*4ghD3pc={CMC{w;
zn)oDrd=QHS?2YB^s((|Ui&MH)nP(%(S2bda>;CQ*wa9vXA!VpRMgA4;HQum!hO<`V
z5?6su<~`KxIU1eHO0XgnS&m$<1Ay3mA#hQN)s=5>grh_9{gV_{5ZHi7q^Di(RJ`nK*-+EHE#
zjd!0bwE;W)z_U(D7&<~5W?>5zZ%~U<6KNHmuil5OOUcqF!p5pt8TMOB(*?}%C^3=>fYG>0FDHeTTr5CCdcNc)@xbPpU|Mvw-32G7hk
zb=RAV%V7XX_rw=h>UYcKl-EOg_4Q@(G-?2(x<1wKu%!Tvq_NuMT8D{3>{>la5GB^l>-w6}h
zB8+8U4PSY@um8sRkl`b}vTq1g+a01a(LOA@6?1!gaG2(iM{L;gOmpQFNBUs@O`1K_
zv-HZ%1ZlHLR--o&=!hA~nPuD*33yO5RybInYJYScPg-ftI$zj!M0EsU%g?QCZoonc
zvVPXu#nAy+ulT_%b40!w<`%{B6*gi%LA1?bd+x9$yQ()iI%SsZ8=M>ewjI
za&g^sXT$|r(Fup+@(+9J6XQDF#Cg2G(yH?)2M{kTAhN=kw_og<0>3fxtnaq>W6M=?
zhuG9}C;X2g#&Csju9e`s(Tor2f$-wNzY5(2=d~cZ>|4c{RdWMC&&<1dacZk3y7yb(
zn{3-g)jY;Nq~IV9POI)Kjf-}WEzR6y7+KKS7gz+fpD$Mp%9I&ps5|G@&Aa=%o#$E57^Ga92zg!WRz;d+I4-cO^+}Bel{(13~
zCHuQd4)+k8mnX1z`XH@UNucA8sT$YVJ2J_+M6O;%N#c;x`RHnEY!Z=ldbBLUmztm6
zm%dcww#qeIqf&T#ZH!n}1YzG_7-nC?SiQLUlm7ng#7O^#{F{--6u|zBKc)>^+C$?$
zrn?44h2dAa+H~j0x~EYHHZNcH_N~c2*3O=H1g~cIFFV(M*{zyhI^ywB1BKI7n!`Hf
z`n>W*vFF-MPxSg!^t?q;weD7;(7E~xvzp$HtjZFkpzY6iLIVBmwyBS~4Y%s2U$HpY
z@pgs`0A%Cpr`#!!fgPQ-%zdy5n%E5?^aQGZJ#H5}p%~;GfYK-^YTm~+Z
z&|odC|FL^dg3>CWFFAfXLDb4i;gH5j-+}7a0zsa!(e$QTz7HxRgc7Vlg<@7z-5*3a
zq4ruKTONEmBtkwuOEf~Cr-vD(@|)2CHQP}NewQ0KoPOr^G-`M`<#5`|6xQ1^pmn+2
z`A$EvkbDTcktOu{sLT1B$2%(c6|G9@|71lr+3+Xx*6`MBI
zT>DDfNnb2cfZGpL
zV+8%!(?_|3y}ydmLu$lsiG(``&VQdixv=eZ(_w){tp&X5eN9dR$=_Kd80W61Uh}4(
zr@3M$?Hs1+GXIucJhb7K6rwTpQm7|Yl^i=XrKA^8k?UfdO){5bckk-OO*2aX?X444DnrOKS;TTWpYZ-Tcjs>>b
zIf(0g#t-7B1@`u_E){~UJkir!D@+xq?v``g%xd&F4B7Xl#OK9a)8$COv)cbukIwPKVuk5*Le
zDAMv7_9&s>D_Ed+T>W9@3k3e{BETp!_uH76e!afy4kdMUkkU|O5sc|ZI(C~*aQ;aE
zlD2^;*d0~0IsS(%iAC=qL#6@07Pm~Z>F{nIJ@lPw|K7%io~2H@J%sjB;ROaELB^rJ
z*gNCJ;>E=N7LbrOHe)|3o+8G=c<8rHYrtX!i(UoCe6|_mthgXox2PZIa<2Y%
z(paPN>T0kLFUyr2QW2ws!HGIA22ksge(8?&Rj$6T$Q7fex_@&-5deV9^V@z}2E~28
zHU#k!erG~H{?MEulHDD9(be}j{@Fw@15Prl0`0D**9>*TKGFo7WdNMBAa%HBi;3eJ
zD8yQ^WW?A#s)*nsCD{jEXxDp|K2NuAKH+iyY0BvGmof{|n%_p!eof_o;Rx8lVb+Cm
zs!FVCnj9@%_)%#pwGmH)%dkt2wp&ND@8k5@yyPU#JI8nG)u$VEia$FzK7x`D(7I9V
zpST6%)62GpLUl@>8a@00yM?Dpy3&dB(N0{($oMf|s
zpNgyHwLfVce$!6e?G`M}osZ}X7JryvfBPH5R9L3ZOyS+9JpXu>1ERU1QRT%KL%Jr_
z_+DP?AaJ^fjsKl)pvX^z!ipHO#;==s|0H}>ABxWKFdcI)u7OMhZnb>E6_#}L74iGo
zz?g(fT&tC_s`S3|L2VZ)q3aKiHV@_nwso4%`s{SP&)S}2B~N{#Ai=5G5b!O=jm!eb
zihXsdzPe%L&fM
z1$$}xwJ2F@u*(lU!2hBbWfFg^J0i&lbmFESjt9+Nh1^$3l51`&5?Qs4>eD)w0cHQgDx<9@RwJiR7*bJWB6%_y9~$saP^
zRiSMKet*yJhdS?-J=}j(uFBFaMF3(WP}b
zs7WtJIs#)_$|ooKhH{4s`~@u)6nG@9PWnfIVlsR)eG!fS*7bjP_L8#6Eh#8Fi_nhC
z2UGwY&2u){x4{fF95f+ZD8YL813j@dVKN6o6%3hGU?s}VgRQE!NW!$AAHRQtY1DFD
zfIq)~RCMOKFyEiadjdcbXW@V|PK&LOT9jM-b+ivl3`|tIfJnDZx^qKWv#CkiRBYuo
zmahg~Jv(_difVzz7+TvF#)ez-erM*|8!3G}#C2{?dw;|EC+m#dN23OZ|Fcr7z5|V#G4!yYo)JsUc&O!NvIxuOYMmja1^yRN!)O
z9Ou2~thzQe?UN^~AK^HcEbWlpC{7wPQ1ltC^7z^R8$^>`K$d%}dyBeoW(qGuS8bluDn|ddPcl&wxW710*wQN2T1#2DIG|`-d0#Z_39ki%&J|Y8e)!3V0Lful_cd2W
zw3o#Cgvnb&j^NwM2I`SWdzTga?ZCK`bf51opOEF$ZY@E=3XrHN^PULL9BwdB%ZUY^
zXD!occTH;_|7T-CU7);#m7wXp^TZ@#v`lMwv734FZMm{9B2<)RMs6cHKR$x+cFaU|
zqND(`v^ZgpFp$LPIN>XP&Od9wlsR1HJi)9BO^uGh9VJraLjC)b)>1fBQDWa;hhDI|hkT{s7
zt$-XA?QoPawp_jlXXb&JhSnww&0kn;Xk+u&pG|^N^-h?+mN`}1qP$Z(X0FG3+~%LL
zL20F7>c{7fI+z{>`eb_Zie19V>bUaM79R$o&o=%mf%aY1wP*krvLUZ_2B9tob6Vb+
z=bZ-R4RCx#34rxtxq%$33Do`smQYccM>aw4Vs0JwkJ83GMr!#rxwJre+y9RS(gFYz
zSvQKHa`hkWwaoY|4|{t6ls)D`37!3kU`?SOcoCn&Mp=0l*Szoz)h@gQt{ve~0f@Qs
z@&E+YLZ}F+=ym+9KH}jVPtf%WkZ0v3l{%QOt9mcc4fFx{0i4S$`%V}(V;|A7P<>2`kP3=
z5?%Aj?T|JTyFM4qQJdM$n)Ao`
zXPHjL5`)9J?81}IK_Nn>k0i88
zc?sr-J$VESwL3^!rRgg7FEHL{LAaU_oRM^Pl8G9e2rb%~Mo#e8n6jBa4S`Q~KY=BV
zH~(e5geBdXC)$FSnYf?1~uKlNj~ehg!J6=(IH+n)=*K_
z{j^^jVtI{VH4{IklY2XdeRdB*02&j>=q3uA5RM`iE_^?PO@T_T_;Q;L7
z^$@LK2E)+`n&~@Uw9^7wkf+3*xqeH-J|c{@Hx0z=t>qPn=S^DFxDqF%JU@wyd3aeh
zU<|lpS1nxkNhDa5`kNFC6>YfJw-pH&6UuI`I&H$2_G1A#2<+xVRwJD
zBFAc|DZ+fAdtaAx%}^r>WgM+E%v-Qvt
zj@^@`nmJCl)(-cvE|vv-DV94;CCfm#O`5Z-CKeWQ-2dWeCDY3e8xD?Ny6z#m46`AA
zgK1?-cff^56gHO^O3XuOBVn
zMyjdQqy6di(Ika93bRc?D{)1V$ul8!X!rp`<+jZBl`>XAAZ;x_729u`C2ed$xwtM31HhLO*Dc>n`J;`X7^g3kxMRvAlq6=m)j*y7n7hjw6g21l?DQqfRszt?&^hQDXM
zA3dF#Y5KefGg`I5q40^6{>7
z3c+7FjRYgo5Jnaam!gZw#f9gTLVF1mxq;a>77r>d?V8u^8R0MrkoeIga{mMX*;k*1
z&<>5ie&}6?+D@D=@toEpfl_#3Z-WOf7xg(v$I>NbV
z6t$EXfXq+lM%~Z1z!^v85au;{Ccwgbz*{W+S-VEU&Tyr(!6BeR>A@gsIQ65gca_Q?
z6^lHv)2#8Vxlb`h$*Fg@vJ_EQ1)Q2zDa#Du$rBhL*oiZTM98Dx*>a5cal%`1X2qM?
zP&1}tR~@SKyqsv%YUQ=x>o;n*%ON;kUc7sL?S0P@=o6zg&0SjKa8^{mnY`NjI}^^g
z+v;YiAY0xZS;ibtf%i5n%MsT`j}+%l^GTVUENf~X}=
z);crwmrgj0ck4sTi=LMpp)Ut@sUs3w)De~IJ$15Z@ygrmeD{Us1uXYv)~=iQa@)Wt
zTk65Hp9zVpad
z?|mv|(Mtb2HE2Skly^EY7g>EIQ3HLnCf@zG1hhb!FKqHS3=h&q12S=v;M9X2b;7lP
zxPx+0tI2Q%E^4TyP2sPIqd264v7k~;LSM_B>BM3{dlM*uZbgo{d@Fykgta}%xE!{n
zS#lM%6&~>Vr4$OuMm~S~5#_eI|y?gVytSKf`cK^~u$k`ta|K`YH6ZNWcxIujwMmq!0UP1xpDLg)P?
zr}R~7tS*CH3G9n+soAylE0TH?A%zGR2NJTW?j(!?ze{0@YXGhs6m7V8l|X#Cny!Kn
xyelwPrQiIvd&zNc^Z#G?Ix+PU&kdSVX
z?#_Aljfx!geAoN`?>TF^&N$9}@4c^m<>!iLN(wUgI8-<%PMpBME-S5k;>2mj6DLk(
zV4VivL|BMpg8!YgQI?TBk==T38vF&@N><(G#0l~<(4Uh=aqZv{*oo`X5~_|T=LVf@
zwYuF{w&-9d2Gl}H>#ugog+9M{Re2y+pWQ+}{BnKJoQaI-rr=-<>+21=XB~}U_GZ^#
zeC2)?_T`G(nO$2$#!s(v-9&hwk@Q<=Dw}69_uhJu`oJ`z*#C^fnE{D2^jP?KU0+dE8c2Qlz(8Aju&nml;}a**(6NZY^=j{d8HHF__bM#`0m(|}|qE=UDW$egUNRGb#
z{evGC7Ng&Yp!9#eCqMy4#3Lkb^q+6IijGcv)#@DM9|!ue(lr)(Uy7JG1omIf4E+So
zi1x&nQILT6_nrMbe-a6ibU-Vz_pej~55b5}N=Or*^ZEJv-+u@HjE%*3ZF185?{ue!
z#rr;{Ps9q6`u)M57gaq4j+nG+Bk=Q!->*07cAWdVO2>*7HAC{GHhUkF&uA
zSbSDi7Fui#6A?Xk2&@(+JkRtuQo)#UlSf8-jp737_NQcWE&2-u?PgS)PNKsduZri
z-fEI7if!NLJ5>mi=)&Iz83^AJ1O3Px>}b0;DYytGbVL-)$pKCr80
zHzPfk>&eHx$aQ?(b~ozN#P_GMrvf$4ycz%u_))adS>{g$x~GgYH(Vv|J{{rCCbl<9
z*cg4qW<`uv$d>hBi4et2Kr2Gwv0LOpUA5m|HJGy)EVg4zD|u0?n48vh>3#9Y6Woxioif6OSoTYr%u-NWy
zwfTs>5Wg8oW4*A^siHVhCbs$-x#mq|BBRkd9VEQ)Ay{;^nRmMkMGw0-2ZYkVXj<-X
zQX3Ek1KRenL!^+MX{9(vSEoaNrJKuKFM`Do8B3F;mb2i(irQ;+sO0q+ey1lDE$XsS
zK5h@L{t=L~5A)I2|0L66m>0Il=77yM$y;?q>Tp=a_P40*&D&Xb>R}8G?J4rB`$nzN
z&kP!a)`h#t(a^84C|UC}3Rn(_l+ylH?%~+vvZxVp9ZfYgHNMN28!uOFx0Fwd4#R`t_~yNjT7(pf$)-rHbqiI+t%E0=|bhr7#Pj_Lp6fQIhPqI65*DUrUTXBz*X
zdIK&;Dl1Q)((N+5JCr9jG`!a`Tu11!RcmZ!=D)GAv8PkDgj+=vx6_%n(-kC(iGw(o
zsu(9W#mmpnKhda6q{jpi_`(HWR$DWXj`kYS3X)d=XkJ!GWas^J+HO>qC&d-VITqZ*
z)T@yl_i44=qOeYitB@ot#D?95zM)aykHmtLN(M9*T8-A+EqU}nr(?7&L2CPr@1fwB
zb!Tr8qDI9b)^?#wB2rE6CGoVt#~(y#_4W2%xl6JO1OyJddYYJN%17mInmwHdu4!4p
z-=6huexQW6a&LmGG4*DY{(N7-vXRGzQ3Wqkd!D?BFp$oKZKuTyG3mZ&i_falW1iBywk7u+Zvb@BRAPjQJo!~PK#S`D^*7rPQ)q3iu9J{Ec)=_
z>Zc2xaqHi`@fbD@B&+>x{y%@w7V$M0$|F|ODG}ckODu;ghtgs$Tk0HK;ppdUvmdF3
zyFN=J)yKQj<{ZB|2gq#pmQJN>_0wdu26IvwCk>a!KT9KMY6lO
zxHzc0wbT)Jz=zt(cBo*VncYX2yssCA=MpWE@SpX|miP-RR~KVLEZ1Fiur3Iciqq!a
z!Dbbm%jQC0X=!QkMxU8WaN6rL-MSub2m9>0+j46hvTjQw@3%IJs$%HMCc-tHk<0KC
z@LXc0H_qngw7vdfb>P-#1g*!UT{p{y17+yk_#mxtx75~zR>XX`Qnb*#_qlj|jKffG
znY7Ai?n3Eoc2B9DnFwlc)q1gF^V?)$VPV70`t11HbjR{?u!qQ<935@rg_sj?o-@E1
zAWm-j8=1Jp&@xWf38RDQ~c(=lF
zYt)Cy>#VTDLi4Er+t%Ho%}PlBboPJ2L_=?Y+#dVz?7#U%)q>dNsQty@HB%FlXSF_r
zlkgg#aVc)zym>W_z9rUi={;srQWBGHjmi5b7(50I0g01>vXB2yFM@h?g7DAp)Nc1AMa0B2VPqXK}FDi
zIF|4gTr9><|0BTvIN*OG@LwYKKOOKtCHOxp@IN#7KR@7qj?n)+!T-6!|BD6w66`|3
z>Ho{Y(7hEbTRXd(v8_|s@ayN>xIgYB3IENZ?0gKvp^bG}C~@4GPBQ=~=I8eIGyZ2e
z{MfUL8KDS$Z?yz3O2EP|$8Fy1b8oNHLc-oI{^bE8)Qs+a*2&=B>yN8H0DtVifEAK|
z-aQ;FbzJ$#vRa0W6&3#0{F(%l;M@mYw)nec_7)d)E6ayFEQZRj6k7CuvD6*rnk-y&
zX*L2-8Yf5~l*I7c;`9Lubt@Bg@1kJjxXXysI
zELJ#Fr(J4a
zrPe4Twi3G4aJiD$WJ5}$G6SS*bfeaoF$h59KRI9Ic>=zI#d=4ZR!xohFHv)R0NSKC
zk(VZ!p-g^3!BrU<8NDI^K>ePqRxC(_cAHgFNWoQp^7O0sCvODk<@nBQPVkO%RgoxbH_+6=s*PE
zK-ICLE)5I%%sLqb1^f`kH~Ch4=W}pFJ-M#y(CeZhXEQCE7Jdj~F*Y|37;g-2q_!+4
z9zNJ8GMH?QS=L3(dIWO0j^gr|eR;FmS^#b+6!(=G-y>n8GruQ50LG|v5-lbsW;un+
zjZOK)qpsU(^((8{^l?pka4Qqk09T$YNM8|b!E&E^wmEsP43!?MTKvn>+S=NB4nR3g)Ms`)zcHbE9TH`FeMqwZvTQL<^294YFCs6W>w40rE|VPcxMi6;ZaZt!
z%iSLP-L*5d`6eA>-R|?_4>XhHby7ks`sw7Jez<#%DC-nZJjmtTdSa0la
z#J(5DPn#c6vwjM8UrSCTjW^s(`8WLvL6fj&5T_^b{UzI`WP%oP@%610Cj2yukK|n;
z;BCwxSuF=^hhF^K3t`MS1NP&I&*{trE#xcHy}>`TN`S4RJwN~3FQI2I+!_grim02A
zHzL?J&bVo629~du1}{G^IVk#6?E}B@&zADFwBe8UyU!eL#cI
zk}Ljy9;^B(u6dsmqt1Z+#hIBr^hBdw|KU>3Yz>~Wr7mG;buC~$Mx{nh{v}27;(VKX
zA#dg8T&1Ia?fahGMb+q!m6NlV9v~RnpZZc~N3%R-4OC_aSobaPlAxZ4SO4^$?j@tO
zH1>_b?Q$9mMOly~(gM_s`;c&g{Fd7$u*rnIJ^M5d1ENQ|JjD~&z*e#MoATL(u+ok
zKQ?+2jfBhU<8w-8@j9!%aMxS-fOoiYfbL>likAD6n(+g`z-ZsnRol^iSY~}|ICOkJu!Eu=`|bAEkec=5w+;XgjYIyC
z!=uZ8NkMVv!!%uF_THlkc--@rjXS$i&=c8rhu_!wl1jd*FuKVna2Nf7u{HeRh3Qp{tuyVQc?pzaY!tn=R@^
zH(>+FbENk!|b&GLs~rx1tpk&GR@*{I#97`&Q_S#G0USd_)t
z#8f&~arvSjYA=I5Nl$M7@y&T~&#(gMgb$KMSpGO6>^3fBAAqMh^gyqUpWUd@4P|({
zvpem64X8bW&p?FT+;VdMldw3X6zK$YRJx0O5x^${gAo(co7U
z%0MUn6MFjJ4;+g0HLeiy%F`^#i9?w4m*8e$P^20yhapO&O
z?6(f<5!wC_!cb(u2aWwcnL7ML%ft_FQg5l`;1T=P^eBJG7fDMAYlD
zBUqhEPFyr1ZdIX1-`YI9MP4*i%zfwWD>B83wsXQ8
zF`t67PFWL#0YlOm01}Rd-WoE0+Fx(>BTL2@wcd7F$#D^RF`z|QbIe0z*ma26W5Sbt
ztb?vta2Qp!*YseL2E<|~(Fy>oq!$o(>;87@Knk9tM+O(vpPJPPws29{FsoXA8!nrZ
zkEYT&feNLwj8-N`?GCCLA{frDn=L~2>HlEp5s^c=_0jd8cPWdwEtDhC7aHN2-n8PI
z{fZaCbFeg=^URDZiuaxhsQIB+Y61#CgVxRMFA6}3o}*Ef?Klda{
ztmMdA2Cka6UwiARG(F9fE#8XfAV6t~gTxafuHHj94JDv-1ZO
z_DUL!CPw?SYd*&Y?ZZGfADqRvy_25=9p+Kow4BR~Om5)8_IU?G16yn?bS+
zb$u>hqzyc;%J}IE$vy^g6BeWCLGXzazw;9aa+O=W@&`VXP!lvj=FmT-6x-xuBA@2H
zi>QQyyYeoIZ6RLx>ecTym2jv^#TUifsbXT1X5~?c*~E-o&V`ck=hoAjD3@JGLw{tV
z_kAT|kiqi%)xoXF{}uTR9YsE_U#e?LRCa0T=HxZR*f8*R^Byy_=uZ()l^XFSBi|Zb
zi{r!Np-dc3(susbT)Y~dvYj=2QWqj|Jfz=0s#5(K4zH2P@-i%VY!&oW7P*|29yaho
zvc=0v)RT+5Xp8YOa>UtkYl^XX;Z1VJy?ElC)EnUQ$YQ-0N6vrpW}x>@X;0UHM!N-R
zBImQ~On_dbpxS_R!uk&ttfY=MUV_)IB&yiNLx#(MGnvLccKM)b)mi|Tf#5zvT@PoR
zYO(z0Zn=7(_2(xU)}Jvt^sjG}8cR6GQOW0RURB59Va8>6K5BWeEkD^ZHsz6m<&};k
zTaE#|#01riHn*t%g^m=n4?^UoVHf5G9+ff$#h3@H#xZz^I|-onTId$pCeAoTX}6>y
zHpeg$IL=*#o7w?Dcye*3=5#n@hc
zNXp&<&0`fRn8gwUob4OMjD%-|xx(^Yn*Q>7U
z2EAp%l~9Nli^4qJs2CGS(#!6JIc?+Y;ktkD+;Uejht|)r;OR6bv##}scS^GrYxL_U
zp~EN#v$2{p5sDY0C!woG&(sAT$G$;2=5Lo>&5F^UCxe>*Y>>OVG=jiTem|kALeDW7
z<{sw$j)Oz(g&|Ee^*>*ST_nAV#ElqgGd9ZSm3YZM<>Iy9a}#txHJhmDFElsIbrG4E
zB(FtAxD7jv*zR>?`5-OCMmBYwH?QViiqh7Hyd!uY;J419SF=37sX414n8rprh@XvP
zYkbA`cfJ*yPd5*}#&MJKA`wlHG`d5Wpj`9@U8^i>)h;i^hV3aCq8RK
z+z&=Zm@x#awkNr+K4L3OsX>~UutR|-R%a?Om;#O3IsZ18u$$P?4`*K|w2_b|FU2p(
z$uL*4F%6me>4y+hxYf@r@{xF>E5oS~s;iX*lmoNJdt0JKPb7VsMEQO-lHR
z)*)rb(}JfC02SBN5BDH9M>$F#A?sZld|2+IGzfTYhE`lr@!wX!nCU$o^!dfk)e
zdZ7->k4X|}UNr$vD;cDA26*a7y`E`pq_<6y@-;^e5!vL$(|fExJ?(|;N2p_pJ7?sd
z_^MLGf%NAl&(?0;ROMyjP`e%Ik@{(RtPi@?rNYPbV-~n^|F#U($&gYM7_rO=R+IRK
z9xVwEkEO(JM2t0idSSY4rm5p{sQ16wle}%-k*4sm_9@>kJ%=Tq(Y4JRPirREV(FST
z$imIG)VQ3IT_rQmPRi&o$}6K+>6&sPi*!S)1o9K-QGm4E(nQh
z&P+*(JB&I>Na9fAB-GsFCu=S1;kLhf+Jxe6+lCXZmX!M1jhvg@CgDRKPlHizYCA%-ZFncF0$~4C^
z&diGKMfI!Q=&?M|Je@IyN_T=mN1}iMy>-G*`(LMn-TMdarK(FpQWASme)KaYmcH?&
zWnODR7ZfUXK>JZqtZTv*@F(9Homtlwk1CZp7>7X;hiC=a`}`Ws7)}}#i0YLTRbOLl9}|rf`?%HC0X9I6j(yqLrDgu
zDYwPgln~SNq%}|1V#CEEFEI<3;A!qO?jv0t6(D7ViO-~rmAetkAKKUVeLZ+P@EuY#
zO@1r>JxxksG4BO8qxsDNWc45Aa(IDr4K607hY9=A;f
zM)Vo8R_55*!KS#+z(+fE9O>E5y1g$?y?A$ufI_+0DnG^TpCX!#E46GNM7Y>Lxb7l3
z7kHTxjKU@3l=KYGvfe0s%MfL44S+$GH>d0FuXfTMzBL5>{O~YE0Q+(J0+1{TLI}>a
z)Oa$fJBA>YKMeV(xaie>N$TwgM4CS?;icApADw!ayNvA{@?k)2V{4uF+eW$eZC#dk
z^fuQC(}};oPKh6AgiOi{g#Si8Ce8?kkzEiAf8u41olJTuxu#X7{gJFmp(N5JvLs|9
z#(Z9Ik*5K%A$g&+{GNh=Vm0vW38*+fNcwE6PlW^_9SWMr?^-q$TJ+}ezacg91VTQ3Q9qA_vn4Y^*J6`yU5
zq0-%(vkRTkVEv%Q`Jnqpj%Wu5i*d(v>&7un3a28HZCX`r7ngKMwHod0b?r^ke=jLy
ze-W3VwDi1vh%(Q32`@q&$HZGwao)>QreD7{yxo**V7>Ce@@QO{m85W};WgF|A_-C>
z-wufqp9%mje*OU=`CqHR-s1AnnNeG*#~y+fqLl}*N?XO9x7(l1GYlm)7N$Ndt9D+=
zDhR1EiVKdLR{MIzO+2#8@I#(2_TbDc6CpXydr2J1m0ldtMYk&CM@e6s%LU}E-#ssA
z(Z8u{5GJ;Zhac(7-Pe8;X*(xPreoJMS0^8GuxSaVIod>KEZK)nUNrvTFH|I>am|FW
zC|^ri%tr4{W^PDD-dIbHm|Ti~tB(d#c;r(gBqPCnlH$$3*u^uAM`qyLIz
z8|3dXhReu(_c7fR_39SIRy4E(Jv3;!NyFvk7UyY5s5z63qD7NN=XY>=1H7DiS7b9n
zY$D&ciP|K%d`vD;FXm1WlV@r$0n!m2Kj{6P3(`Sfj&v9PYs_PPHSv8I4F*ohstycY
zDuU65?Dw1KQo4sl3d-)6#yu2^ETF0KsEgxwlZ&I*8@b0oNSW7*r;w89;;-7mZVKPeWS2kIWtQMi$Z7ES%`gYfYOf3JW$HyW3q_t
zRCZHaZ*Sb?E(=z>?F3aKXHs^uiOaD({J7*h7oYKobA)#CnvKqD;0+=uPHUXbM0G$R
z#}5(yivtO}je}^z%P|p3qVCY8F|fL-=JgRF@)5354OC`WpSB*C`MC8XqdBS
zV+I@`-(@XYlZ`cRSCeGiJR*h`C0WFU*kNaLUs_wb%2~Ijv82Vy^yEUSqrDQbLeNs`
zIK^=Vd76mzDL&i%9vfENbFJ9arv)E0+jkjd(X=3O1h_t!awV(ds0b-G4p6RJPcX}`
zESj9I#XumK!}2y$y$|G>Qg%oo$E_Y<=l){IAE7E+UxUQ2BcuTNmwVZM3^;*Do?%t%
z;f|gNJ&TN^s#}
zG|ADHE0^#{872Wf3OLg?ee?xD-Ev?hHQw)~mEF8v_hwzuWXyOmA2D2ZQEZKi^J0q0
zM~fp}6vz>z?}|D@xu2M
zGq$f@k*&8qcLYF!J`~W)B$&DLt2F=K85}%PfjQHMfug;$wwjHvHU&A7RLu=*jUO62
zB_GcM#Pbhzjlt%p#Dd&G
zF>n(b0{a4g5nnY8rV*3@JjAKnI85#n!5&l~h-*kO^n8~YX5+-DY-(x_oe%>KGDDR7b0SEtfS;|{B{GZu9#*~+nZtb^4vEt^Gt
zMLcjGazWd@8*@TdLiV)HI=hN?RYt>`bSD0-t=Z{W>>OHCGoSQ*86t708(g=ve!&5-
ztI&3w9YxOl+D=i~iDi$;b4oP!zHQqcEwmiS&=r-gA
z%#5xs{bKZ1a#n#dhL*b&3j&>ZK9${NAnM)XiYpNSuFOnXKPW9ZBAe-55I@#>=FA>_
z)x~bLFz4+WE+tT__r~aQGLin5d~ZSP(tJviD#z6`4AScdxhr3fevbYLYT?Aq^8dxc
z6x8sVIqxEZXy-C-slpe^nS5UF#Ty?1g
zuI+MlY4@R@8`{Sw&`Dkqyz=r$U(f{((-^Rn@03@`KX2VG?S0ra>o_PQ3})<1(uU&|I
z;w@~c9$9tG8GrJZ#-&$s0W#1>Z6o^Aes<==R&xtaMo{!^-H}i39-k%rDvyU>p!&H4
zK|SB5d2iKPz22H>p7vgR{(Vf?;o^mr$x5WVoB*0<*1bERUO5c8e;UJ1DM
zi4jI{&tCkb+jfTm&kt<>B}BP3;uY6llsg~dcQK-rM%+%oEb``Uif`eDmw~Hdn%s-$
zRh_Wwc1?>r&E%C@$B}M=)Ik^M_DMhB={)t5r$JXW4UKlFpox*oG-6B
z1y7qm03IW!rVwxCTJLO9My`9jeDA-zQ<)*l__Q5LaUK#U{t~)EkzHLwk-~jm+Pq$Z
z-ZwtLuOgoBU6E(D$WRZR2;b2eXA*ZvAWG!&MIO-;U6fHp<>xE_z#j=9(0pp8aAZ#?
z=-^>*jm8UT*c=7JIS{rYgbYHMu}j=jr&{6$DY~^Tv1C`=w|8BP+iYz0OvAK@BG8I$
z@h%?!#(cFOv~~U59rPgu=tDW1cE6wB-HS#KiZcyX8+H_S>?zG+7Lt!%QgW=r{l-@>
z%o#<}tsSdlV=&>xi{mqJoEm3+Tf~k4xMJu
z325fA{NVZN((d+)#;ncuvhQmXom4PQ1*R%V`39Vt+V}X4nJ|x@hd$i90Zgeu%@pI&
z4S8ap6KoI1BrqwI%3OU{R#K2Q{p`KM6-!h-xdPHqq`9TmXBLqXe)hgRSMR@G6)yx?
z^JD2l5Qe%$DjLCSmqlE`R^UlS-s^LAcEk~eP5)Fd;hxJznu;Wk=(RRC=xIwC9AkZu
zIXeej`H288mY+3Oswvf)yNdPlq6iwD0q2VZamI9a#AgtZZE6=|ULx&fF;Z2QxNSBAc3<`{XZ7{=|oGe6;5yqSkqY
zO?}B~InjHo#Ei4K#;3%3KE+0Vr<1L=)Vtw`Kuzm_i8xGUxyk(zOmW``9cMOiu7Z-im8NlT>W9AlmQ`-?Do}gr3!t=ap$Yx8
z-rTP-gz`r8`WM2SEPP1CAT5y}y+Cm%f|`0pzoi}l=>6@h9c^UmLU5}2aOUj@yjdZt
zBZrM>iv6gVQyXD~47y_Ttqy()b43k@^-H!kH7J)`bdj^Qw{Kty7HM}G`t*`L2~qPbQNz7x$J7AKFiRxNcn=gs0L3$F$!`mD+za3P$#x5_@lXnz1j>t+v-tA?l2p?sE*n
z-b?b`5BO<8p^k9sja-36E4+fEnox?$UuC6ZGhJEZOmy3_uH)3hzAaIgi77@8#j&5&<>!t4jP96Vh_}&2UIc^K+mYQLib01YPuu*3olJ*jdz5LpM2H9w`azS
zQ&eAUkg=aby6t2Wq;Tl6?+WnF%wiDMN_M{bDdqP%4{K6!&mPsJR<0=v6@u9TJqRPk
zX=oy2{5Wz(P!+T8-?C=OZAZCUD>yb(3hNQ8%FEd0!D?<$x}uWcnE33n>W=OMzKwg5-HrFXyV%+6<7M>G$%*5
zmdCdbNR{yN`2_^NeecOXD^UlN-5{n&fL%Q(`t(8$;E5C!u+bt%K$W3(GOR796{C1%
z43Ko+536r8b8><)eeB{HobyBEzq1{I_oYIr=1
zKBRraX6zvOkBk%Y4wP~FRUVp9IW1SVzuaI?@`K`=r7y-+8N%x(c;;hM$VKD)e*sXs4jrawARWc1IRi5Lx+
z#cb^SlJZ%RWO{u;%}fS2le4y35iPdGoSKHyrA^-&2Gj#~w*iJM$yWn#fPB3|o#n
z2v!@97;?J>%Do(EVdsQ~_NnhO5B_7O8izrsb}_1pMhM&=@O;!e_Q`To#pi$CF35n5
zEP}e=vE@d(V5ik@^-x_fD>}jC#zh*%{%q~CR?!z8;#MOtFzZ4fhk@s=#Oz7Md{D2<
zfU#H9$?%NtXUY;!7b-)L8=Z>5RA`JiaMzTM{G?PPz${OjT`Gu6>m06L`t5lyk3nQr
z`%73F_Kz!nT>THJ<6LedBL*=j$J$-25e2(bx&9)qjm2R)avev#
zszNZ9L~(U-(Yd>9MZbHWU`O(CbvpW9(U)7xS6=@#0`Fj%*tb^h{NrhCp6<_2j%X
zJ5en9DtAsLcD~J;oyR8rWrx&^;-b7+jkRao@{im}dTw=e4NcAQP#M~fWnnWCZ@_Sr
z>TGRLrf$7C=&(s!2Bw|pLw06w71>y^IYh0d>t>g1_Ext_Od(E;h7PsWXs|xhRWa`d
zTqSeJRe~zw53d;(h@C9i$!6ua-=gYRD(om2*5$=&uB~3GbU9!m{9s?^&Nl?@9ga9k
ze3eoU_AD!oW0nzXja=4a_@S|}Z%|N>p!1sX!OU>tZhuJu?VUGwiK{kUs>lh&_pG4d
z4E75HuTd3l+ba{xm75h@VrvP6__mb0K&hnw-hJ^{;fFFkUsXL_7}S%OC2R$JEi-k!
z=~|XPfBW(}JjSYqOftmSf@TDHMeOmIvz&t)6e@4cRvpY1IpB?VK%EEgG3lD60xDcK
z8=hd`>Nf;X))qfW1;8E%cX_mU=D+*C@ar4^*d!Asj13ChHuoXfR+hJ%6Q%537`4c7
z3+*FxTk;VP0Hxm(Uinc`QLAVJ8Sxv>
zndPCL5Jjy=ADLe+rN_dneF4px^li@ka7NV8gQ5jVq8tnn=ki7vICArOqL!^LM4jY$
zZgDWzP+lo@fzz#ig>qSK*ok+j$0c(rg;Q6E7s{-E766QOROiQi1*0`qlzMo7!C_o@
zcw0dyDbbQEm`|^Zv3!rcP{pn
z#gBMGHNcsk7Tn~|ZQXE&TLRBxc^I|pvDl5|Q!!W=D6t0R`o<zL&Yf0mC17#qj@0`}r(FqG3n3?-8}FmQ{8
z-Cg!-xb`GLdE<<;Uuz1tKIpy(HIy!2s=>9MYD*|@+pt7!SgN_9?BWZ-B^K}xIe$-h
zoPP^znnrA&kq5F#BWz?S^+rQ1%jI=SEF~c#HFz%P<_~nzOqy`~pJUO%
z`IKsdV9~RnT_F_5a@b+m%^D1KiS0(FrlvyEQdYa6Nh+?CY3sAyle|n|R*9RAi!hdI
zX7z^yYP*z;2Ady{2R}nwXp3o2E=qL~?8VX13^h%>UcnI6Wz~DtQEX(kDDtza3IxTBUC*Y@~(!Cly=5?>YqMH
zvcJ1I$&#Z{keTe?+1=fETTS~VCb6*n9P9MCKrB^1fE^vHax6J4&C1JSCZt_?5T2J3
zPCz5h%NRqcl2-Q;klm6C!RKM$;hQ~ioT^v>FJUe&E|nKmN{7mwR^=+^fC5-41U+G_
z+vo7HRUusY%(eHthujLMB9om>SP-!iikc32;{GRBU_)r1twLMZ>>dHRzd^1*r%tJ`|~+;%8QdXsEE@^ftaNP
zJe~Y57X0*9Z&E}B7Mjs~F533=AUfMWehDI8cYQzCP&_l%D~gd~RDYY@uyM`&^wYzd
zwV(3TMgQ*6#3vEoEikd>9Aw?{bQ3eVc6u6v>5%@aY1cqh#MSpj0_`P8G^FPfFN=Kl
zmY!ol%`_IhbKZe~0Tw6;T?h+;(j79qYss1rPujgk7_yeFMxU7c!4%kN(1;!#*B#If
z6_DdP!M>cK=yoA8^0bcJ2I%@&PV?AF15JF-#dlt+>8N9CFX5rff%4xMH&T9pV@fyZ
zz3`}q<#=gIjYP}`-7fVBUwhY}Y#;UjH*MXUAWN;)k3GEAk4@!bu4?n}F|ZXqQ+{NB
z(Zd58h_$@Z#MQW2h1z%A=rtM-*L?Uf!bGk~AVug5m|67fW|TlZ8053MnBkMr0)m~a
zEJSSKH;`!ON6DP{ZtFoj^zjQKHzO@uidO7?T(DsiXW;!P(Fz7l{fx3yDZPf;Im!dS
zOK0RKkMtHOcM?Ujv$I=%jdVTl4k9CQ<>hI<*-;SFarD8N<-_Z$_KQ%3#?+YDs)>(L
z;kwU~#$F#@Q#A#4@zg_0Z!Ya`7wQYQS<2zP}Pe(F+abJh2WUV#};B5Q3@%bs+5^p)#x
zEhqHqVEc0QZx_o~TZ{KM`Z2XDO`wTSN^Bq^m!rf+e)l;V?n3Ul$h(F0as{bjdCO))
zu0#A2DnhJ-s{3ezY;}fGjh>~nlxZY_GLI^O6nAxz9JV_-%{X#Ka4Bcq0@piy`~)=a
zFPzc;B*SJf^kh+0GnIdzGB
zDcIZlRiO&k!;Ws5p>dsUbh*Y~cJJ=xb63ZqD)sNxu0|4gwi&9jLIvB+T-sEcdCmkT
z4N@A0(<7gGPw~?|8U}@PcMJ6IXvJUkA?8IE0pd$_)Q`ZqT__JeSwB
zq84bU?O+BfQEr{`eB%$v2DdXjiA8vfi%yufjDUZ$tVaofyTec0$YpXRRi8n6^pRKn(XI8Dy#ko=9gcR+ZbF@mh=FwmMEs_{PDOhIJD_g>>xp$HOhPV7YZ1C
z3+I+)Fs=WfkML>1z6$mhPT3}Uw`D~4OH~KGHrxl8rFmnxCTz(dyslVG>n{~|sM_2g
z7+kPb?5|l?8xqu+JG&qJGK8i%s;h@aXpQt`<%OtiZr~qZTk`=i=uZdv2d~RkSJC4o
z>(hPT2~&t6IVmW6ys1I~IS@?l_Un5hFxID-Y)Vu6(U>^Bo04rH(Yu3=Z86W3)u`kc
zv=&m$Zyj8S^*GorXYyDk
z_aMe4=WG^7y{Frg(1~{bM|7{JQS2F97dsF<`V%-MDMl8u}!pYPmpd^jHZ+{iGwm*`j;8gM3Sa5aR5W|C3Fsae+Gy#s;Hj`s#oYn)
z9!dH$gWazr;13Zw1*k?rUy6Rniow-cmgj;O#U1El-4m`T6rNQ)`>oa7R}-;=P3Jf{
zCg^(4=tpTO;*@=%vJrW5JVQ%c`crkPQ#GI?{g?Ow2VyHsd^-&4^W1AhZP7t3&s^6>
z9o#1!5=%<1xX%{3vp)nQI-j?G_Ju)>h8OfmMGmKzy|_J69a^|0aaJt3d*R!c#LY-$
zU2<`U^}VfoXT|pX`By<>&Su`#C`E;5!`oZsJp&^Bb59bV9QXb~1tA-nOfYRAh)?T6
znPlWlVvE!ZOm9OSr?F1oC_xdnDb=0h9#8cv-2B*SUk}%9C7sRDZH`9o@&mFa!*9HF
z51R~O&98d}@9lcC*%^}Ku^Rll3n;(`rm3mv9yR)ue0*7JLE;|7hDwr$gVtbOShf$m
zXmy5$D%RSAbwo(h`u(^nfOBS`!_L4_VLN@5H!C%c_Qfx{fm<+@r{CWk1hY=-#Zjx`
zlQePS9_|(=r!2aFx0&gVWp_yB4O-KAZD*6=(S>0G${Q&>QC&;fW@o0IWb
z;XZ^J2U4@ITNBf?xzpH&JUS9Z9v1_j^J+h64EPtVKCy+MJq5n==1^iv3bT-~umRAu
zpL+zY-qv&$XJ>O7wnkIpp1tThn^Pq=ggV$Hw-|OgMTeyt0-W6^r)!fAy@+bGvM9yL
z(OSYdVIs_+SjysC$e~p4ovm#%a-cwNW_`O_krLtOeC6M3k25Vnfpw^k*ZgW6%5@Hm
z#S{ZTOCvM_wC3R=`gtgPS0>0(05<^?wL)QRV4Cg}=-lt3Vey`8>xyU&BHWuBJM67_
z-LYR)#PI$I6*}^~0>U19WKgmg7eQ$fcmjrya2cpROIr4fI|uQqRrD22*Xfk{)x4C5
zyrt2NxdPYEYYCR|7>D+b9yWq9T2zRi%l!0Iuj-{!dI-^_J7+FQ$TAYq)6=7e5K&&&v^TmZhv>(s6)QA0HHzDSY?oe)w;vZO5ca$7mxSp1{NI4QT;f^
zk30WB4S%sH!Ju>jye#EXM+49|a1oN8cP26esJY0Co3%|jYV!pSG67fU`<T*thc
zLwhi5mUHjI5j}r?Sdp&2e8uS!aVcOtxH3^siP3Bd%j9iCO)k-$ny6g2$%XSiqRAec
z=KU%8>+Nlx&V1_KSC56L;2282XpqFbWLIm5f7%wEV!8>QR#i}Dn80=PJLlhc+CfG`GaT{{ijc#
zBHt`B{`=&ts&EKoRP@;CxLfXM?eA^XKxtGb1BNr4Ex7d>CWC_|ZJS&P4GoX?#rR@5
zK;Aw>fCPz56~qA8ibpJ8C{Wv_?1Aby6KDPdmNhM)HfEuo47K^HsMX%Z6s!3G-Z
z&AHpXIKD-hkq7cYIxcsF%Xia@igbir*G|6e)!sZ7o=s(qim2-b$p+M<`#v{>CgkOhJeZnn!&Y3qE6s^<7hEP+|pZdtFl5fyBf9tZY9I
zKiSg{c1HcNkFOd`C(Gc?P#T>RW>pZkzlS$vHk%Ut`mo>a$gO0xfM;fALQ#viRhtB6
zSIty+j_!uj{?2+qYZ_tL`J126h;zzU{9w|eG%PFXFnY!~Bbi}HuHk5GEYb-1Kv`)g
zWUKYety73DLXvA6CL0{8ztH2uYfoWpOG6GHpjJxlW)mG2hq|N`ofwtXbM>#Tmkdbs
z#j?EwR26mjBn*E-1mwrpr2RT1KUFYJ9y^=Z=mX#JEo{t&e9>oV!*-6SsXI(?JDa|&
z(4@duFIgze(K$sV9$laaQO4}KUk-h>jgM#}k~d_vT6Rps9$^Ku#^zDz+M8c-vi
zgkK)XW-$ecZuFSXrb75YXf`x>=Kxpm$?HA-+Zhz^q$#~`-K--t~EQ|BshWsR&9fpGV{#r4Zu9Fu{m{YN#
z5kSSCS^DX-VfA1%g=x&{Zwq3=y_zmJL_CZpM=hbmXgr+t
z*ZU=Wi);+}XQzQ2_q=hw@cWvUxOjA8BAg{(pHm3io4-+45mp>8wjLkTJ($qVfpd7&jNP)+S>t%M849!FaDMdH(l<)%GaE4Cvh~+
zecZJAIL$Qnf{D;iA?DMV8_VswpPEodvxLp;vZ-ti5V(|=L{EqUl}mpua;WP7ruHnI
zoKuTJhQ?0Sb*CflVSX$wx}OA$K9R!kGX;oq)FI_M&oBGVOtF0$GtPsl|A`4u8mF-F
z;Wq_~Ma1%1PFU9n?{t?&qv1~~W_-{o;N1Fc5v;i|*zMc5A(U3VU&8bBe1|9>qmnG7
z6ZkZDK-D&!3eBwBB9KztneFV{bv|uGdAU)6l=I;F){NkI@yX@g#yjAf32`)p*{4PgSJ9H(5o1-kuw-)*Z=ViEYFtA#5(Z7b%#hSYf7c{G|}3ELcLG5Hej0
z@P(kIq+l^BqiE}f*!fW5g27XRuVI+DThj|8*h`LJKXd-DPrYrbM2S0K+7uzb6cHQk
z@b6C*f*PeXg)O!76}AHx%h2AUO{tW14cEXBT)s?0U9F(F9R(<
zsun%KksMgs{>TGNq#f7x@h%1E2(}^BAmxr2k$T81jU%mP*LAyPrp0M8hP)$9(ejS=
zORTS+k73ec%}>MtMdR@?fHnRH>$7*|@6)a}uHO5cc=eXLdI{G}X!O`_rveii4KqE_
z=UXeW0K2lQ9hqyGJGK^Z>~o#hXWV8wzkUqc%!s*$E+hx|
zIO(e>RO-9Sz`gzo-a;Uq{Krh85M4A-8PbwNFpUovAf4*;-u(aAd+%_p`}cpmL>UQ1
zDrJ?dB1L3gR%XcFl!Sz`x2}>zR#^$xm8{I{ky%!hJwhmZ?>)cgtM^@Z-Cg(R{rTs2
z9KSz4|2Z7IuGjS(=Xg9G=Xu(jBj?KWBsxp+_(3Cf=b5GH*9u8LspMad+$amUc>kv>
zy2!>qLe*}}#wp61o<9DI``a;-yx=-3%`8TaIU{{4kl`_0=0ZNBqSu`+Iz3!-m!NioKI{TgdEbB
zROtgbktpl@q4gg$@~;btk|Fv6&JYo71r
zgIH{Fvh%{;1ILdb_Z5gBUNdXxUC-;(BZ;?m8g8xCg%}ZBD^FQmhS}L1x&0)H-_9q%
zb@1ff@z)8LJJR%g-M{SBjDVMoyEJq8r_SXU!;RWUgyfIPmfouMB0HPm7cI2+Emas1
zWe1=VmYtp?{Bef9FBIw^(#0PHI49qS^W9~n#FK!#
zSm+t8r;2(l)OZ$*aOqE{SpKNy`E><%p{oe|`NtC{`w_(!@TQhUG3@w0D7fZ?r<=%s
z?$s|pu$(~$(_9CXFvGMd2I+yvc;u>POG4gR%D|MuhlWW%WEj8v3*1W&0tf>S@2scq
z9J_Gyqc@@_fGnsVBzP9>78}b`G_Q-ruuAy&jKs$Ai@z0w{q;T3F%;pKY;K;>E992b
zjoNDmGYxL05AUA^3cz=)C4n~~i64Jn3?fy|cv0rxKKrj6goO#6&7@*%JS0r&gu@>G
zb*=vTW5f!4ApU6qkL}>HfdAY9^i!&En2z$nzo$%25vwvr+UbqMc6{Gw^zuQt|D0wG
z|7Jm$SPaeM4@TOG|B!M2dOYYo@Db@4i0-VA^-xdMrh>!oC+xOf@wNPcQB5GjUFZo}
zop|-te8PKYG3-M)mS^!*eh3wRIh0_>QyJdCh?V>Se}R6WoZN2r78SIgg>-=KdmhvS
zuIFyE409zAV#oLFJCLH*un+GcJ-nP)IMXk67JokzJBshVHDOSln%Aq%PS^zUq0zol
zkKnMdj$<<*T|8*8*-vdWQ013Xzk$M%XzVnvsxdjwz>
z$>D@ZYuVfrDq31v7uyl^j6J>RpqXSvR)a8fDV)3fU5?P;I($LW_}aNj<&#K5yn+eT*t0B$ODelOO%g
zD*SpTkb}#_@CMA;ZJl`T&+c36JT4zuAKS6PXdX*@8Y-e+D)AL>uD#E+
zc%e-D7%UFLC4Pi0Z5~loj+z^&rp|cslIj&W46gblu79RP$omF%;29em-|aLGs|3pT
zITJ=9nRXhC&gl)o8#RHeHB!ROH%?F!4IgjT*B%ImS$
zi8YiEXJX0|hVd*$UD;+$sXBRHNqkcD>EQO~ot(ym?WZkJg?
zWu|f6b&zXj07EX#etIwIvEX85>v38kXUYo?GN=mRg@P2{e8crZfjf9TZyf@l%jb>s
z&6!l%gQm|>3888l|2j>LzR?v9?y%15U-AE+FNXY(tyI=7|F1^o6P0G3rC!l$zb_Z8
znszq_>}(~>(tF|ZLVIa_d5Yc4?kok}ydK!^J`?F3TwBbdiKg59x^E5?G&ifK0W^B9)*7gL`OaYG5P6*+{+uo%#>GZ;(>=uP&ms%4%Np>)%F;UukaG3<;
zqMiUd)--2>-G}Re@RhKpV3Sm{Rm=@>{DG`E7Enusgh5VzB#?-A0aoPZo3-5no98sy
zm6KdP0n>zRk?}iLv)WRTx&S^R8>MAE-tx5uHctJR{mxq)WxZ7tYK5pNE?
z!ipzHFT_B;*nZL-CL2|9daTt+8+{C+IC;4OtUv98ePs1f^9opcBsRDnVf$xWGYH-z
z@Ie0OYvnef^IbXt7aqYjbttZ8DHv5_Rx6nM2cIdXIb0$j=t|xk<}G~;3PBzPp`})5
zQSWTxegu^42tg82NWBIo40fDt$8U6OIinN?Q}1Egi=vL5z_mG8E;J(2H%~7<3`GKF
zu2bd)z7R&`XCy7vC)^Y7>Q9_bE-v|^n0y@R0i9w1);zVNH2WZ9NNWS=NIZPtKQ9VH
z^Ibr0v!7mHp6p!e;uEFEASS@c{tu!XiQCY736zB&S-CH~xC_z{Dd@;clkzN`8Hysw
zk>#d#t%1K`8kb@3M(1haaLpo8!8C>RoGfS?#PCg`I5
z5>IG&IWV6V{ZQqEgWEpUGpgnC&;5rp;M)mCAJ=2&+g++iz-!DOIfCb&FzR9JyQ4><0_&r;eFPzC-5J!6?H3@PD-w=Ur>tMZi1Pgjn4o5yV9n0*9g)Kj%%3L@YA{^?L!E(K&TGW6
zU*FGud!H=O2O!6hi?=n81ExGTv$H)jH~hk?3R?G4nnc;D+ePK_AK|w(MG9f&dS={t
zdto`ot7AjR=~m13C5en2K(J`(0*2;gdFIGFV$<0x7b&I7G1YV)g3aoh)yHk*v#g&&
zb6Y-$O4X7z#zxLq?6l=s^=Xg1SP#7KBp1f<>0m~{F&?%9{G-_Tq>i_txofghEk~N!
zFrm5W4)3=F8OSp*_abnm5lWx&SjUzqq>cv>Fz7=>WKSdSJPgu(n)K3bXQV~>0pZoJ
zmrGN6b1ig=7NTZ8mXOo&-7$Q-lo3n^Flqd4_owAM+kHC%3YUh0PhV15*b%lSXp~VT@tt@A8XDU_5s`s)hnrhG@YFC2IOk3Bf-w3
zGaxi>OKqg>7U|FMD5jXEF5xi2goCN5mFb?WlA(F&Yz?WFu#eDOyK`coIahg1&Bu7d
zUvKVFwR)ACV*29_b<0}9e{e0q)Mr?C1(6^(`~3RK3?@}NF(u_m_Pc9fU^5KM?@xxP
z=Wh;(Y#Z%AdOlXauSH1NkSzo>tFY_k^LeG=4NH?l9m$M;vn{B;
zygf1n6DPK!b61iI?lThXZ4SM{Djk@+1DJRiqClSWvvPgaq;}41KMb_Ioh#IONKr6o
zh+8JvA%YEHw8tjVPN$QfsyD{olM)WzB%~U8;E4cSe+H`Ac&uDYP_-4c_0ai~XuQy3
zOW1oex%l2<7ZV-2wxZskYSz9ohy{+q@JFjm&ajqc`8d^PS?`_IZ(qRLN9<)q1>sS>
zwiFIih~k&5C9#Ic&Nw~$tV-89OxU!%mDvqP*)>$x4e54Xwug*ci&w7*>|YjUE_mez
zjO=qs?bD}9`PbwP+lJq45Vq4#U7A<|r4_;wmHu7`1aEc^
z$%mg~a8c~;`}l&FGZ|BIL_udLcFMNvRjlwfxW=009Yv3$2D}DkGvF6jhd4d7*zcUb
zUg4b&g=h=oB*VGcvfW%~b?27V<*x`a6P#4;Sx8XjRy%8zb_HxCG711upXc&3S`^qp
z4#D%eG+XVn409AE2n-dW@4Lri$Wjt|8)Vb2b$N|#Z_G3Z!;0`&mmY$RT;m{b3R;iG
zg=3Tn6UDl%U|i=vI9q^eJUSL4yY9Q7OV2oTP1>Ly1le!f?Ri+G-d~kEK^3NJEfdSR
z-klt)b^y^!MM6!%Qi-NJGEw!X)4fq1obItT5w!iTguHe#jBOyo;8Q@(M3+5J^-|th
zpT(|@^H{6A)iAQ-2WKMhd@bpXk(}Zv9F1{YY?8{-Jz&-ySA|D07SEbtM=TMGnSg||
z3NfsEF+6av5JB&8$FFEEr}-Ob@4X?B|6r;9b6-&x2&w|;N;@npZuKUCrsVs8M3*?X
z#TM$^p`jrz!?Jt!JIW#!`<4K(Fz%5n4=Q9z^^|5JkP(I|rpw37yVS>_Hn2wBD%P-;
zh&fUzPfOq3GJsyfe7_)ptg?aCcEf=7fW1qxRM*AVF)@tIvQfb`g|E-wYE3-jAfx^5
z4ydaT)Vn=);8jfuC$9ehg8lT@7_EE8$ah^Vq5I
z@zd4%Zwy5T51M#@=YR4{QTP%`DB$WxJMSL5sm=A0vIMohCTDDg_Eu#kpjQ6Clv*#`
zx@z+6-NPVv`{oAKu5s2rApJ@{d2i#qe64t9apG)a>FpESL(Z}nBV}bHg&-=JB9M~E8mHTiG*k+MI2d^-MAR&Vm-c)ctAJa<(
zkGW{P17N~#3Wez&oL;Q7V-5ZRblW8YY^`I;G{h!jToX9FB*b)4ktr;jf8)&v1}W;v
zwd#wu;ISVJk{VVRX?u&3(7*Di9_Qi{Op~+ma
z!>=b-k=h(QsxjZ;LkfH^dzY>Yabc}iR+o2#&NsKq4UlmJ(Dv{fr`tx>$Ctl-fO@2WV9u|=&ia?QZCo_X0%XV$lut*IXap|Gn{xh2=kuxdd>*orLaES@g@Q%l}aTYHs+hZ29g691P%_)BJn}6(vk3JUS7%rfKiv1TL
zkMmtrCf1>6I#xPYMPmd5N;^@=)MqJRhF=IJQs(nPCCUI)p!z`N7CWR;VL3uui!CqQ
z0{jzM$eSp}qyHtT21$Z?N)bGBY5hfRt!z13A?lWiC=#PW$ikD1xlh2Zp5i@J7iLoa
zAjiDp=12hW(vBT(d(~#5T?FQ$SBjWPB#J=4sMVI8)8a{VXt_N_Je@?smZkI&uA8Pb
zjt9z1f87J#!EXv7e-d7Ltyl?|km{9Z+fUucn&Y?}XTOdD54Gg9ZwlUxD^^2%=ov|!
zlje_J0GQ1igVwx*X**Eg=(Bh$G4^aQ2dLtZay9X=73b;1SN^s4=?cKYqkg*px8lF
z6iaKiflpNvIEz{iiy(du@`JQ?J34IxdIIPgl9SG}QFS)8@3WuF;wS}D_nPV1T7Y?6
zXvYa|j1R_dXJH-(o5a4f?sXb5-tB8!>d%qGn>Ie$>-cM5i@!rlVBwgK)e|r@xAP-|
zSq7>_w(q|3=!q_ocZYmE=)=b-fjoRqSr>0JDsdxG??`!VwI)sSn43}A?_ys00y)xf
zZv^K7u*O3sXj~l5uB;c?d@s^kyRYd;70{iTa;yoSV%R_=2RF-I4EYN+{B`TlG2}G_
zhwAw!Qf>w$7?iqe^#toc)4*Ry=|3zAs+=Si^$x0`vOHT@AK$g9gS(NH#9I2_KIuL+
zatL#GJY=PdVLNXIn84Z8>hbaMxtVu02qla_r0>s+eixel^X@X8R8m(z{OYn_ZPf-y
zLwL=4D!%>?waR~N7y3Fi-$WZq}RYU_}msFeS~WpHmOIy6xeKH
zb{0JP>kPK7Q}m1ZVNCanVr!vN2xDy?wau6bBmiTg;bD*ZFO182quH(=AJq~_7jNgx%=>>%5f70%UlZ0t}Q>IZeAEKFm=h|_*)~nxpCw!BwKgeSe%=DL4hPI(vG9{4T#OUlh#Z1v&mpJIYf+4EFaRfR5G5j=!vFr`AIDmo
zZ5Am|Ds-5kg{(9H3Sl`Qpy+MZNmRrd;tzVWguiaSit8VJBn>}?b0K4%@`oeLueYaY
zW!R22udY^$(1O&qZ-N}*oA;5$T(HZS*7B+VF6|;{3!geOuAEWqH
z1MtU3%Bp`w2x15}XIfU7|2Lp(a7tP0YZW>B$-Vl{cu}%eHJ5SWm)|c_HUOLwE;23$
zaIQ8o0B5((g^;hYH0N>s0p!VmG9Y=05sa1B!ke(0XqR+yazgMomn#w6tO!1_Irb)+
z-1H@U4oSHxPJIB%obYyc?paH4{m4LdBfvKOdglS9@qgvd&jz@U_<>8YP0k$TH5%|X
zLlYlIaf}$*4Zt!&?5zUac@)Z|4W5a5A1_0QGNd~CjOH8q@6tPpH;gfc@v=B31i+U)
zj7Ho`(0!8E2wRSTCVVjF$_NTWn*c=m3@}3Ol@>Y9VoEZ>S=8Zs(jz61=2svMK}Ngt
ztTL32ND+Z84lX-I^AD}-f9}>A(>b7OQpDlF1$b=adH4c4*E((pWcn+ObbT&hfe<=1
zcIx>wu#=7xsd@b%fO`xhuyWMh=m-b1?xjBeSDZBF5MWeLFdytUQ9R>jRZK6@vpXy#
zr1BBeUY}tJO8bNnDYc}+5Dn(QM(8UB)Z>Ccly2j(l7GhnH4mMZH(j1Zh{2R;;9y?-
zhZqCo-Zh*6%F6%1DWDBJer;V{)^Re}Jzto@b@ITa!N8k-ZpgtXM#NNFOKM#nXk=Ji
zl3Mbu9+siSBj*fJ$88%$5i&@-!_`z1aN29sCb-SlO+41>_fvU&FtcocZU7d@S0O5*
zx9Bv%8Rhr`RT2$
z*ls96^#&sKe6D3r*Viophv~?n@qEyh4FLRc`;GrID-uG9RT*4g@*YZnqzJs9FE9w)
z;HRid0azG#D#u}#y$}2_+^WW{Im4A__)Eo*D0sK{x_L
z+12iN`)aQ^eGE%N8}?U|^kX{!tOYi#!bD`FGk-iO`8&TITSVcp;^3i?UI$0?yTNQe
zEDDJznaAq;PJ0DA_IS^Bvt;a|{uw3$2KV*Vu!!Rd#7eRJbVBZzU*Mm#CKG{p&79yK
z1Rf!ubch+_uoZOMvyY_NPX>DdaDUAHZYU1740^ZIvr#jy%*xGU*~N-%Ao9j!YN(Lu
zLXZn~_*D}d>zlh^H+Y?k134g(2f%7LRMlbf-uv#`FX9Wgq;<^V)XtI#Eh-)MM)Yhw
zY{DI&noUH1`)94sf3|6gVYc6w^D;1($-=h)C`@%O^)Kptuwa#*cS1#FONRX<(4kqU
zx6|X3a@KPg#JyClT3Q=Fwb*L|^6dw##toVD7UD4IKUC#S0b)oMg~uFv$F_ZhQ}e@l
z%++IeNy&yr0a`cpQbBlaQ2IkX4IAi%Wpmp)fYS)=acE7v%609Xr}WGTy<@b-QY*C!
zI8QOKwn&#CNL%C8q{2&V>+|NDYnl7Q8eG}iE%dvG_1IW5~*b=|33M{F^|LT5vhJ|;)9=U*~T3O-2N
zR+L}yapY-`U-!sS#-3VQs?Bomoz#h=B9RL{^I;rg-(|McCA9kWffo67NV4bB9E#b!
zNNGX|_A1|>?*s0sQ}z*NYtrO9@}ASx3q$*~$YTH!f;pH063zy|k|G@TTv+KQlbp8x
z1?n200uD6@t>`X-1VVVVoa`piCzYpD3DM4MmZe+Et4N(1!p|YRKu&Z^G#&mAY2%Mu
z@XN);e#LKYmxUni<9bwY%d%8}$hKqXzyKT-e~@Nm_J%9)kHzwR^E}iaD1P9zoyC{@
zyG_uG3Q_qSY!KOTweO>ps0l%^T7e=cAR0hq(f%ro^AJZ=Z1nAHYZHA?*`V~4F1Val
zG+%q>bI{ucNLRDIR&ct{`K|(;Kn)z2pMJ6P5J%nwU>$F*U4H8g`|}dZO3_<5s1hbK
zTI*ckxp-lv&%+~Dqvz?oP%OPz?U<6o#4F$?J5u$xE>RmwGdC|QKu%f9ikRvYeQkoP
zd97}jwdVq5Yk7mzbz9HExKUpn%K|16`yv2O?|$T}ZcT0Gzz{HYJ?s?!`I*1|pyZ6l
zIwB^QD^N?+!?WUbc*KRzX!B9m87;eYJdqVi4_Uq~@W+>B4-^CWzS?fLQeG0+6J&2PFyZOj0L{gl|
z;zKJ`IiC59h%LR6vg;fVs&r^?DyoQMJX5W)Z5#uA6LFc$<_I)64GXmVsq?N3XBLih!fuQw6#!r677L@ga
zB6dH?mQ>~N4!X~PJddVm2r6SU7f4gzn7$FEiKO&4-J_a^8*x>^Gb4#cK(x72tot!45OjVe%z{-z_gst154fS;JFx8rRkLboKLs2zNH!mu08&2_-?SI(Sef
z!9A{x6iG+G&U1Hu%I;}FqK`A_@1dR~jNp{=xqg3vX>Vkds8;`k?E~m0q0z_8l$~}o
zHnC*3;{ifHLw6s872CINhrLaCZ;|0l`^&oVSe@>CqOaJ!?>IRS(*E=F^V%Q0Y3BJi
zXW!HC>)DQ+CKb3O?7aCTf9>^-rLD1qHW8v%wUi3ZHddCs90mBaT9zxYF%9s_n`GY^
zY3PTR+FJH%44JZ41Lgj4FtnDsF8r*USM5+X`~{U
zRmGZaVOo!#aVB2k(XS`=$8Be^M{Yt%&rw^s+W=o!Oy7*YerYBtH*9$5B6z(RC94A*PXH+JDc+a5n4
zH*e$>gS=p6O>Vq>TBD?wli*l=#A<2R8H%OtCjtb!k&bqghaqxJEm5nT34E%Z(A*d*
zgQ&agdWMh3QeA+Y<-=3Wgf_|o>(Q5wE)&bgTD(;54a_D`5e`*Y`^@Twa}QA&#IdEJ
zikBFbkMi77U7p5l9+qARIVeA(&pNgUWE6$LTCGOrU<)Gl>2>mu3yqo=w4LhWp=m|*
zo+)~kp5R97o?aah?r`-O3eo6?LA~D{*YFt3;#DhJA5ZQq0HdT~Acs!L7E&d??Yhz3
zSHG_8HkZB+Dz=|w=cq`9Ztf4TjrB%~xNt;_qy){|J5cH5Yg`vQ
z=fkXM#^PgatX~74O4C8*SzDOO_3_|*ex`8u;pZm(nC&r4KiFb#uqjp0eBk7egS5`2
zHd4M={8lr&_j||$$;}>0*3vwMDhG(`I*EOuUbgB3^Uhhis>YY%1AFLJQ3&m=WjF{l
zdBC^#kEDn_fgv<*kQ04InF4)2NRl=>fbOT5Iy>!zBMl`CE<&v<^SNb2mD~{?cyb|=
zGhU9CsbSZ5+@8+$PSN)I#FBI9eHkRwmw9&jI|#tJJ)tg}Ox3I|1Iitf&~64MW<{qH
zh>coBD%z2ntHa(ksgcrCEn5h#G&yp8dvh&F|233-Lq3-^*fvJXBiHrR?42jkToz{Q
z%)|t!Oc;xmWu}14!7OFme6cLd(Veybl+GS*(9Rt0%%EVEO8h
zw2S#l*n)c5j7qP9pFb5AD15v~ZoPVQP%JnJ3Gr(ff`)EI&fm
zaTSaYG&Zb8z)(a^`64QN9WsFA98#r|c@F%F_{#M37GbJ+v26$an8FlvSmUPNHYYPN
z^`ysHXj|{NrLvP}q+564N_jv*j}P3TO7WB;@H@G)W(qPMOZpe+L~Xhf#jz(L!u=n3
z5$I^gg`|KIUH22>;($jxYY`)iJ^&RXqe|{%xN==ACBb*>onAt_=MD@>H_;hi9BW}l
z3M5a-*iqs=JOzk}bXHtCu0uyzgzC~ZgEP^|hg4*(el!t2#L9e6468}7X-hrv@fgmu
z*opNG+%F_8Y0qm>5V%6l$Y~;zpbdik7#^M;90Ow^oOhvM;p7YefH9>VIZg`lduJtpcse`6haT104!ERQ4Bn5?oje;bd5uB()wTQVkPk;C{({
zdjT`kQOtcBN(`T>jcn{6`%iC+e;5r(=0;E?PG1A=>rNd>HSy<7CED=&#qwZXb&iol@f+U?j9K293z!|TI>5WVpC$Awv
zM62O@qyF&%-@iFF7$4GXN>J}_a1TN-GN~fqM`#-iS+&#$7o6i?nb_|@!_q3~T(e@f
z`HWey_kRKT7>>8TW)iU9!zqMTh~vF+5|=9ayG8AigMBQH6~cv$B9Kim7ElA(JI$m&
zy5jw6h|!xA2w(g?x&kx|vFj;%Z!aRHV~E#>G^yePGv+vg9%Bwn5TOr4O>Q>1ydBO>
z&GssTVCZ}N0g>@a22cgsc}Tv8v``grfbFV6*m$H1B*Iat3(*l$-iMbXz81QOV>UJn
z{ynt1lqcxpNH}6u2akfhKrRYNdfF0iBm8k0QR)2xu|I
zo?wdsZkOdrY0)Pj!R<(%!AHANfnc+w{)sy-qokCLhh$e(_7DPbAMs2Sm<9Y=3V>jH
zXQ*+q{$k#eX=Z`Hydt12sz1>aH{<^0PBUF7OJQIXL$1iVeDY*z7w`e7kdHf;dS{^
zQ21ak>8<}R$X3QXDdqpMY6D>apx5Lw|1x~CiA<78CAjCAoDyREdC>7OVs45X;JnvF
zXz;Vf1Fitw_akkKgLz{zGNHa^b-kmM7Gb+XK=PHHkyL-EMh?y4)X5%&J8YsLiF98d
zn*;r1Rpcd`evo(iBk?8FX&;18r7qV(*69?Ww?@!!j0@RPjEamMxL<>c^Iqyt0Qjxs
zORoC6``q7A4@#dT81OjbFulWw2rJZ;Kh-%Otj>$cg+K=Jex!l#GdtZ=fdL43%*X!A
zXo_E+(L@4tJ}1%u0ui-*vG2ABx=%qG68vQyT0sUtY%K}J+Q*XmkE8#$?1WiD)L|%m
z@C9UtJ9Ed&B>qZXi$*0dxf0@t}C|ICcuN9TG@-)Si1cBOci*K4LB@F)SGbmvE)
z=sM%lS62mEn0>j9DX%|)IOKUTfXNU<
z6j!b^f_|6ybHwYDOG3E94s;ClYFoN{h~Hf(El8?-WsnC
zz^}oj_ocr)Kr6^+UJ7X5R$)LDewPm7K5%Oe&`&8o7uc9wY@hCVJF^o0)@~xS#|ZAg
zh8rg@ePc8ni>cRBTDV^NN0CIl+I~=<^o?XdpOm-!9TJwt6~cY;;&@YMV9Dyg(&9W)
zV}ws=g$kYDAiVO@T{*H)P6OH(yjJxQCtPRC&swDYmjElAfQ^lfG4E^(Despziph)!
z{|$I(L(+5WE|GAks;gh*
z{~A2F4$UCE8{C((kWl9464Lttv%Q#bGAz5WsS3!B3t*<&>3VQhOrfq4#i~)T-kU9G
zaN__pj2h|b4w>&s7qFU~Q0Et3+Q2r8t{a@sj%TEw-Sgd%O4aBOn^|YIuz$wJouQI9b+V
z+7DOdBif!42__M|c@Cf#-tWayaHg}U$Vu%OQezN%BM(BndcJ`tqg^@X;%$*9mB?X_
z2)M5B<5G&CG6-W+!#UngX5Qw57|s`%v1%VG_Ulk`5~MBys?bv|ikBED@hYK?=j#3}
z)BU)PC}k{4R#3=wb#_uMa8IKd-Y4?W)+hW)f3R;qea*5=nUA;I^%id&XgAuG0@0|_
zSmrYzq`(Nq!#z~xWk$&qQXc?Rvg7vJ$jLBzXDDk#K<{dxgpZjI3nDee^yC?Ij^F1s
z{`0wwckx&g5uscqlx-YGZUFz&`v?6(p!;kk0`RN?+x=AS=q2kL5V|oTihHDEhS5-M
z$lQv@&Waz8L-a1R8zofvO7VUA`89s|VU!OId|hQ8bQp95D9;E&L5QxRQ@u@-q>v2t
zu%|T9%hK70oE1o&lp4~q$#t#Hz#mcdK(2lSLRri4i)j?}jbghmF=`XW|1q2y@mwc3
z5z@;M;*NgkvE-NTHf4TywtU}AjtT;Ds*hyWaU>rQi#>$s-XkHJ@63^+bvos;LI#z3
z%wQ&*L#J`NQvssb$O8z#oV7~~V#Ag7R-_L6y1Fz2x>9(CvPii*7rf|seCXL%1F(T-r
z(KRafg%AhSSjxpYz67|K`5|=0A^ER(6fFClKSb(bNN<8WJS{
zn1754v%!n@J=XWj+zD6xy2u2t;Nomp_M@|TT4H6MW!59)#nlT8OVAn#DO_kkgvW8`
z_Qr-8Z
zUz#3)&Lta==x6MBP5<)PpQZ`u&)5(WWTJ&HMjL8a3|8M!Ux(Y50pcB`>J@}($(1Wj
zpl2I~{GYo|_6p9RM1r0vO@SRuG=7&pDsw!ScNrho-@$=U$^=KiB(Svik74Y8tuH))
zK4!{K=-*T^!6}fueNZSy+1dd_k^3@&oPu$gCt6h4u?|3597|6$zczHWBE&?UMW#*+F(+UeAP
z{qz1>t+VRVA5xI+HUHCdGjeZ9`ck#4pS42zvXHa5!~6DQj85W;HowQl(0Qfl+9E9u
zc^q_fvSSV-C0-Dax7e>Y;0~4
zK=LsVlCahna^VO`KA#M{PrlQal5Bn|(bDNu|LjZVH*k7T&+x1zxIYZwkQJi)DWN-C
z&t|K~43XIFFBi&mcQG=(O2h1n;X;EFqB1yRgvY+q3BJ+|2&LR{wYUimM{zJq99y35
zad}5xz*iA{Pl8{efN}Zwl-dwnS}CU$cbC)zXt5c076gFJ(H^hL{)qaYu
z#UHLF&`S_2ajQ4S1<;C|1gStl1{+f9gw=)=`W7*+x_%!WXswoice&&G$n=S}JzL$k
zyvJ2KMYXhuc>(7zdmCS>-@U*^!0JVN=M8;@flLtv{Tm0kUBxu7aWqQ8ekIt3t|=U4
zfi%iSI_HM!ON;eX((Ii@GT+I1N6`8cL3c6;8_no6a76r+*{HVmy#5lWyeg3C)m2>;
zV3y!#615Xmd{cjjWfy!XUic|J99Q}cCmy6VpA@$oZg-ZvzAQFg=-}*9`2fGoPS5o;
z3Y!Bec5S(4x8K9V@1f>kP+4E@^{!_fFZuh#`7QIG72vn|>CN=UY3QC`vo2sbHf$5R
z3w;_M5K(sb@vqV8e}Ym}332S%Fk0=|w~p5;Q#5sQ1Sf{?&HM1VjuPGd=#8(?4WdWRgP
ziMs7Cp>oK*ZF@O1arm-xTqL=G!%U*xloeeB^c*8m-aIR6r%l8_IL9j_1#L2PVWEd^
zYX1qW1P7wb@ef$*x{%PvdN#XsZzm3i$`x$1yY&^gY(%RRV8wc-!UsJQCx*a=TR;@v
zlv^_WryWo#!%L;$t067DwA(ZL-M54Q4^~8&ve$+y7Aq|)T%4!u!XB@>VI}%lx4U@A
zbM(t=^UbZhJMD%d)+>lvK@S6j$1Npu0&d9fFA04*O{dyOSXmlXJ9WO&cjOlA_SD^?
zynRIA>#TD(w-DdXa^l+)Drr|*W=O57TQwEDIid|JXhH9Rh8eB{6e?1J<|BlG4W-zE4&3U_Wre*7mUD=S(-1+nqMkV@w_&dNMz(
zWIB`3AM5sK)tIxo#L(>5B1-6uJuMrR3uKT<(vO2eF{9)8v`^$w5>u0U1
zyi!BvDkfIAN1AfR1>a7VJ6d*%=hP1gbBo*yG|w1uTZz_qKj(QYw5
zYx$wWy*{~0wVtk(Kw?$&S3u10BaoAz%ewTB&DxFUL1j8qy3BcMwOt=RK4YeC{Nar7
zX2EDn@lG`M{R^$xYXj{|E+s39eVe6vT_Se^U94MXK56d{>WRrn4R5a0wH>hP=5kwH
z-3bgXG;;>i@EI^2@2#?y-&>gzlGiArbN5qbuNZ8MB;0vle9JF{h_uIPquwIJtlR5z
zQ8C-at(~bJqR3N{Q7qfx8~w+Ql+Gf1ai?TYgetW^Y^*+j(I)j)_eFg=ON=G&5{PW84uRv#!>oWXQ9@rLIz@QjYKgnK7!F{|6$kg`fJdG}hwokPfB;l#w=BaE}N
zs!Y3@5-Ehzdo&mIO_}eUOE}2lICqgVnR~i{wTSWFIp!Y6KB_UYI?meUFU=dfef{Or
zJIC}M%ui?ZpvT(#bTL;9g-pdCkWrYfR%=A-J|A4)Jacbu)@LI#lH_97>8Z>+eU#Oo
zP1|ph%IZJ?4Z4Yf-22E0DVKjj=KLtbGkXY(ma=y=Gg4CpcbD4h4N=W(rQ7jf%=1><
z+~Xre`e@PjoHy$7Mm9=k9tW+Q%U>%`ZaGV)e?fi!$*!5A=P%-~+-yiMx~S-p_VEx`
z^TMTB0;?kj`D)nTv}7&U*IziDZpkFMi{UENeUjg5+ukjH
z(fc_e-yY5H-MaqDBS&6N)U)JX`5hs`s$pW)VfEfOFV9n03-6$OrC50wZ2Gt^JJ+z}
zbbdM8qGP{fc-Z!H{z2Ezj_sSZp=#6SmF^HPh_pn=Ddv2H9e8GIfAY>{}*mlahfp3^2f3ZI6vaSNU9FMD7
zbiWI?L)B$71>;^%M~pyLW@NEdW{_1cDn7F-MuTwtSc)WM>NT$gZJ5B6$a%^VFG5W-m
z^aFdi-{^X{Fex?CNgT=Ut1YynY4>ku&B>-i-!GSMiI-PwN%$n)!d^@?-;o{Bkkh>(
z+>kQdkS7)3d7JKiaOvcI>&en}r+P
z?ArHWy8;a?W@pSd8%A~=`P|z_Vz>qMLS<#)JA1lctQ;7nno$r4u#aBGa9P~c&i`PO
z{QWeWex_?qG$7nXnX6H^|APp*VIt{4iRTmzZRd!;zG&#?*UMVm^jbLFN*mMU`7vir
zdrk0gG4=ca@$tcfFaQ(CM_5!BOWEHyToM~LEUQ_1%}u*_cx-Vog38QzXld~RdvlUw
zgRqF&+UAWRnVB8hIlI!qw5;Yh2fs<8ISM)nv^+KnRi1LxrltR^gW`qwPqN9;+ImDs
zKFaG@%%yNApQltx@nt~YRPgOcvE7>YW%HZldCx~`E+!Uxq5e3I!_*0KfZXMSA7owq8w2`I*p1e#%2z$k=QHn_ByP23Qig1iJd64KI3va
z+q%}7Gdt!K@}5;1K!~^&pZIOckPyQ;bsHv$bWcLU8@umsqeN*XylIKo=4U_(2qxJ7Av}T#xam!kIzN`!~L6w@eb@kKbR|`
zCAp{_o>t&6=|vDRny^*fk~x{ND9^&4h3!M_QqmEE^l6^$L1!W7FkRwk9)h3
zE*==|Zjks$+L$(G8cGv@DwhzM5{b|^D&`bARHglS8#zZp5I*(Tq_+O%;f>hHiz(Vu
zbfT6ndlwvJWFZ$iq;6cd=3?w-+!L}Ad7-~>a}3Si@`+5Br{5YR!Kb15jL|D@li?z6
zld7tajv{V{n?p7!$wkx7gYmWt4>ST2W%qHq+t`g_D5!!9&Z6fCDIL2?Q{`TfBZou&
zIz$;Vu5(ep(r3jdXFqnSX?>+9IVLfSJt)Dlmz)v%rqDz0ux{cRsW;b#y0&+TdpuW{
zaoa9&p2lLUjQnP&lIfn)R2HD#Y?8_k4l1LBoTR=)DwYYW5I_-zT=i+pn1F
zem+${?|dB1#l6B^lv~8F{}%V5?^1dv6mu4Bg^hV_aLAFRYet`ND!<$vt9N+%#Q{y*8$Mn_
zuN4g~jFku5nn)P#@3HgZ7}x2b*7Y7L8WH7bB%f#(e14rT)>3}zW5_wH_V_X51{aH+
zb5dM`S6@C7^FUp*H)e_b=FB9Y-Ql=@>q67W=;~jl4&4OI=#eW|HvYEDjg@#EoNrm8
z?3cp4_Fu}{d@P_`R9`wpJ!awJ&L?^DHgCcbO}m=cDQ&G2g)DgZo#c|08Y$6rKY9W5
z?yVe(c}^q&z{+p5?}+vG|SjBNXM^4I)J*!?H&L
zzy)}+|A45l50C{~?N9uBLzCQCvH2)mttfqtarl&G@kKKF!D8}t
zm*Y2V==P^1^U{g++I$0V8xd`iXBjDMSB1rj%4Z%w#98fvPnlFFj$I
zYw06Jx0)M53`a4R#X7Bj31E&`!9kom>>&7eCUoL7`Fk!&MQ?SLLA`9lFbdKZ%0sMV
z#0M5v#71AxT${b|;gi>;TRHwc!JMZx>YZu9TA;D0_CpNLr{vS~(m2b`C1<*=^{i+N
zONKww&wlS)wUqrSs}m5_|$B5$?W3CQ&T=Ze8XTjB1rh@c)Y@M^)cgf36`9mgl9f}
z*h6Ud=;AoZxsT5;aY`zBogZr&Qw(L*Pf95`C_Bgc191!I1`F_PSXtm_(J=Zkr8m)I
z=zga2T*J^pTjTjFLp@`6V9FO(G&}Mv=oO9i2B$nE3zoK==IyS=7wUHE^C|{&4%W>}
z^u8;6gc*Mk?0ibtqiE)7t!I0ff2?%%VARw2*yka;-bG%wdeA?QjV4;ibZuIocRnrg
z{I>V2+KO7Pu=~N8*9v1E$@iTa2~$6Psg%=*>qCLn&!(p+AXbCq{sv1&iP7t%>ks#?
zZC9;R@Qiktr_A&zX1pxD`@o$mQHh9Sk#}B$W{Z7eW{`F_*NRy30-kE=DH=98l_X4+
z#kJw=PH``;+7U69WwFHiM~(Dl=PaqBPwhLe@$OVXqr#7F#EtRbWnbL+9#)~Oh%5NU
z+!Sr~)tzFpW{AEy#@KxONF7gYb=S};Iy);O8}GrfMe}3*Syd}td$%G4&x*JiSTxR<
zr+92Wu4YqQPL~@I5fpHV5Lte9ibeW?J)}mmbouisXYa{KmIPq@MkfK%*6)!Rlyi@=FfnE}wh({noxn;i=-~j2}|`
z5)_&s(7Y6|DXh0K*gN);s%|dddOlGUmlJ!tw4-p^8VV|u6AZ~myf*(;OxU!Kz>2w}Er
zORo7a8U~VSwU!DB(Df$nxOKIfz0x&*`wKXY)j>?_knHR4!?m8gM&UD*xU4Jh=0)lH!j0~v3F2;&iM>OQmsIx7SLUYBKD49m
zo7;)=o#wNVP^Gx%_DNyp*wv%Ye*wwDBa!>EP$=-dzdZ|K#U1$sy{))+5mmlTftp8U
zi_eFye=To%MJ-K{2uc6Gc+>R^%ftx!J!AD*lY^TWNLgsah8unBg^ToM})g6&1nT?Z!#E
zUYUHoAPCj6cWe9d%5`z)x!3DneoH)l^IB`Qg^mr!M%ib`glCo7S#~BZFwatxX^oUR
zw|nvQ+Od5#g)JS`67QRm&GVzLtvN~bvYh-iYQ<84`BM)bL_!~Q^x^!u?YhgZ?oEw!
ze)&0Op9*DANDG{aOsN%=iQaSarA4({EsX3N!l
z1w+);^^@6bE>u_-Mf;S!>ryit>PlF@zdvM1EoA77L1@C$yr(;_+dR_bRf}?EAu%3%
zA6zmQnlvGMmYYa9xNC-xSPEwiEfv_E2y66;=`M-G|=
zIvjP$i^C_Hu#*1Wcn&)|+B0Dv-rkU}qT82da>&<=F11@pPe@TEr5>qhy!t%J&ZlZI
zih5eb^ah=2WW$3!O}psU_VQG8aF6oVJri2%qf5oKn9K@J3$#*{pF;`cuqNY2p>#a{5lzu_wS)$kj;*J+|
zj17f%T1MhmCLP4Kn*@G-o4s2K3hyn8L|-KkRH7QERWZ?pyyX{Kmr2srRE_%c9u@-?#E}
zdh63e%m=hJX2dU2*j)@&+0v)XVyhMe53=N={fBNeJQz8s^O*u>c*P8jvhVNWv&7t8
z3wQIUTQQXQ_-Iz%*fAy~x8N)_8O>dM~-$)5W^Z80d+#gf%DdN?JQAegI%ac~4TS;yY
zRgX^)T@~3CH1fDiLw@m(DM$E(i_qZ5wv4y@&G{2|C{$lg;P;n2-aGJDL>Efq-H~e0
z(YNO%-;JvV>7FUPVv9=NSh2%`H4lhFdiS*%zH1S8Hp|xTQ20bGe)Lm>umA}orOQzX
zMNdJcbL4_7i>fuwtRJsrtuI`OI-jGW$VH-Fxia{!+vB-q{!DYNlEI3xo!`s<*WR0l
zL%qL${N+#zMTp2=mWZZA*~?ybO2`tCM3Q}M%~AFxDNEK6B4n3r9b1ttvM*&FWM9S@
zV}AF$&N+3?x6hxy-*x@2>zu#NIoFJN&ud=GeLwH}^>|iU+4mk9DjZEOav`2_p5>6{
zDzC(;578I?AG)!Y4kUv|%=$(nuU&~PP->#j)$8
zPsu(CQnvT&`MR3>^^#EO_4ki1Bu~FDk{UX5M1{`rJe+3e^9=Pu|EDmw2?sgvVqE)l
zZIc>jsC+3Gt>$9h2yNb)*TR!FO??)1i{+ulMDI)=Bhq?*1<}%+BSLn)Fn2jejrKIIV8W4ln|3R`bgCsrr?W0p
z+ty9+me+*5I7RT?P2A}#6w@xd`#klvE{?02>pJfyHDD=wxlgwCTE9bPjm8jq>ujgE
zMxKF`s7go9RO;}bJJYu{g>}Ioyvb>35q;so0vFQNIX2t=M6b`5zDIo1)M*;OfJ1lR+aD@OpVha`
zr0$kI8h65tJfq;*qf-3hHczj?ErT2CNuA=4wU1soAsB~CK5#fwXg>|hDo!SIRRtU8
z^ja3HwTC;T-jg!tlL;6xecyJ!Zy4=;WXL^Y!$K?dp$kfH&ZXKpQ(aNLR}%x%KID+y
z3R~%^mmloy@!IHmsu59a;Of@&>X!7am$^OG#-((X?d=KTHOdxlq`P+Vo5_A#PnDK7
zLuXrX)m7RSK0dx%@g
z-Gbz=VMI#OT(Y({-gQ8;bHSd_NB*hz+8(E<8Wl--g}JHL!84VsXY;alQFFU#(Fp7P
zM&%`az+A`b-xWcuCx-G2V5|yP1hf3edGq1tB{$yk*B=yL=FzNqb&@A9?Ew8zTFv3c
z`*roW3pXA$Eh_4EemHcBP`YNHWcWe+)nWM^irb^!1X|NEg3{TQ=E4@tM|
zEoBx846`ubtyT7}Wa;)Z#&$LH_79W9oY7IT_E$y3Y;MrZ5NW2}$I!*+Do@60k5p~q
zhN`Qp{8kTkPlQfBAu@y;*uBd;?D{$80g*-`Z(E|Sd?T+qSG#dqmr%~w8Y7lnkkk;#
z4sO*)bWJPVmiV!*-NGislX#I{A*r~3ARVT4ZtNQPk{!U
zHEUb1lyt#ue84`I&|b$3`$1eC`uQ~pmVz-x(!_!n&5-V~l_jMymkDW>y4`jQB22et
zAGa+lzkaz@a9Y)VX
z1%!^V9Xxgl&7fOlW#?cyJz-LrVUoXybz1*uUph|j9z8-dJ8EBXglvv#b%xkg74V3>
zpXrWlv3=3^fzs(ZXG(gQG=AwdYxNoF0vjO4M%%ip^n1+qtfl!!a<_-oq^P@U`lnlT
zx;J}21X2HzE7Pg;R*k&D^*o(%Xa)LbRbco40!s;!tApzkr?7QkU=n2l^n{GkYT{hq
zZ$-XhfW)dPqe4EG$v@&nWx;@L^`-JJ;!I)IS7OD#5_@i@8pM5?2a^CAiscM9G(OQV
z{$R#$F4CgLS7Jp*K_gPfZwdZY`msI3i&L-73!veljiJVMQl7bfRO>42$oegEfuedmG&W#B$YI`qCjN5C)A+z8>@2@t&*V8SGx
z0B#ckXqCebb#%w))xop7;X*RcZ*&&U1qnqX*34c5i5waum0NXDS&Z(d(@PYNb{=5}
z@ZjNnCPue*q+&zkpZ6?zi)-MH_O1jH?6wi3m=7&t142ZAj%fhj&QGq6lZ%5=Eu^L^
z@a)S}zZxV&N0KInNUYd}{Nu|CCcj)nUntf`s`HM|O=l!&03oM+kzyS74>gL_0A}6c
zFRtu6{S>KOP%l3$>fQb4@AGZLv{p5Pn?s*G!Idae*a+Tej+|``UhUd6f~Nv%|Luo|
zs4~yVky{`yw|L`hAJKH`+1%Jmft)2{Y>&)nat%}@V=Svpt-7vMWB!llK=U!kt8
z31q}S%8^~H`OV+9^mo_=nA&;Fw_4bKdF%5L8NyWR1Yent`y{_UEE#ec5QU34tH5ST
zL;M4B;DYLLAgEQY<=7v0XQM>Z^R)i4Q=?`riZm
zHv<2Sz<(p~-w6CS0{@M`edq!|Bb+ZBk0_gK9b4Jidsy
zI+g?Uva=F599Pn36;}k_#!i6xPX`xU^!eFIxb2G64K{dxp&)R!Kl#Qy0(5HRM}(>Z
z%!6nIaRQ`{#8%0L3MaVipAP=I!gk>NY3zRcn0j(Fhz#gy8;M_eqDCrw2F~@1U0jGU
zvr`?Na@q^sjC3$FO0)MIW1R-hgoY`hzo$Sd@_yaT1K2A&9Tl9uKG#P5D&1$^b1sirE1&nv=Oerrop0W(3wvUOFWl5g9DMJ$P5pJ#u%>~L)
zmSuSE|MA~7SM~xVkiKtTyzhEsxqmEx7)rcB-*YZC0-<|jkCR?_fKo^E(%79NzZw%I
z`OnF|pj{4i4K*T{-vJjAZ5MayhQ^Rop;b#$w=7UE|Nc`~!vpfScH3-SVf&@_lz#x>
zqB{4mirHogGch3wpOWlRt7;VlH)wWYZm*7fFoWxR|rp+y`y*F+NmuQYSl;abbn
z(|wIf^5TpuhP-lSwut=Q-Gg*@{!lUg6g!wLF~Gmd@Ki}x!UTX@nUv%VNSYE&%B7NI
zMF_o6I_FA0_Z&Fr+zdWm!d%n>YFmS;+2#hvN4j458iUzLY%v)rtL0zn5B
zz2}WfqY^ITGzQXA-Z-
zB(8oAJz3W$8738g}A)sWnUA@5fE8YPjl}Ttq#c(AzkmXmu1I#5%B8&$%_Tsd{zvSw_
z9!zcusgMqz*5>)u>VY@4pMs4-+EE~Z@~^ibpZn8a!%D$aYJJ0N^D9yb@>;YKJmU@F
z=k&k&O^`X0fS^v?dlW){`l~-L1i3c2rL_9txfA!#pZn7*l2>4dl~{P1N%zl3`}-x>
zL-34=uODmN|JTF+^$MrNnivXh@L6wnzmcugAH-ZGU9(R
z2VT|Fa3SVU@kwXb>qjyB4!V8KZ~TZDy*jOZ($CngHZTE00j5~t-kHnsZAgOB^!nu5o!1W>07Jr-flZV98ueF2lMSfud5
zh0oz^welXqW56;3U$Wl>H>3Ms@Am&%x0lTL2y$qo
zBM?A?nk^uHn6DFzQfEq62u6~YENmlavY{iN7t(H*8_x94k$L;ft_x;vlQ(FXb&=7H
zY<8D^1oQc5pim|vO7Y8%)!aAp7ZAjIIk`<49=!iuq3m}qtuFb8x54Nnws0HxS63AO`FAwIY+j%dlG>>
zJAn`E^CyD(Rs-Dp9sKoeIUD#-{PhcA#qWuFf}@TiR8nB9-Z!GSbmwy7D0{$e)tTom
z-afZ7)G95El#^L0wi3ER_0<#JXxA**54nBniiPtp#E_Fa5gg!WO_NMkp7va)k#g9J
z5F$6bGGv~NGR<<3HX8dnd+T*2XI~Z;G_-=@P#R*}wwbmL5lR%oc}znn-@w9ixd0rc
z8^u>7EwdgRr^Oz?_;YxlX-SY2XLJ03x(WRGW-<@NGAgK{D_FRkf7aazSVlL_`S$Au
z5vHk3H_p$^2+`729t#p!kKN5R`eKnM>D(@wD!@OpDJ2@Uzy+Kz}jih9W1*XGVCrA>W+Cb;Qdx
zh@IsC=JvsWMCqkM-u>t6URPihMJ^!lsKU;mjN-993+6UcQ|gkIL5)Rf$*kntP*Y3a
zsGOg(_wm?7@K>wxQ&JfdHp(^6)~9qmTYa_}T*tkS*<6{o#DL53srrX84zg@ss~xq8
zHj>rV#ky9#LGR>}o5^8*Su&|PztMsDW$fOk_q3)AnO`ZxZfgz)-BWMc@nG3p2P0@m
z2js6SSZLYxLrtpSQqNUKbwdb@N(MDz`-z*#6Pce$@Au%HVZ-T4y{8vQ92Jf;KRl`e
z9DCeDBLJ
zL5!`|+f}wISc1pBS*R`%zUpCowx@hFAR5|w$VJBbsWf3^q+g&DyU|S_Lrpdx`~J?8
zgfVNX4WeC<;#|1g!nZF$ryf$tcC(Sq_3-1Pi3MQ{V;wzI=5=Wm`7-5njkG%=`UN5x
zS7phhxoI_Rr*QI>su{}Yr}(;V2afKG_?RJ7#Z!f3CJJz1S^8R(B5vwn9pmCXT%?=M
zq@JL=Kvm~?zMlP+g+s%9M!r^Yn+79zO??T->TX@IpL={r`}uX=b_;ki_BY8IH?ERz
zZHozi*mpiTo5FA3JITEn^r6pD4MZfqvHds=Me38409HO+1g7oyw!SGPpLY$NpF51W
zmyrmHwfsfGN#A`lzhQ)#0=~qIdIvCQrgdM;C;qD7UAF(0E_;`?6Gv;3tgPT8j>3|P
zHu7@g&*0MjLF3sOCheEj-)2(zkS1|Yh#n^|RcMkW-Nt}Tc8-peTLJ9EG>4wPCyMGA
z;Q1ouzE75uu@XJ+xnL`Q?~sr%QMU(%dGsq=tXwH&hz;kcvh1d|1RPSj)DCo!If_B3
zdD2YYw#~apN4!WaSj614X0+I)+{AirK%n!^lo&1cJSJvU`lAft>nUrKCtG^v*z__}
z1VQL|X`NmEM#bi*yw--5Ru4`vaM%6x%$jA$AKz|+3cs(A+(Ul5d^(*Wk2y|eKK$n;
z5lyi?G7YRJS?aSb$jLE{m?elQc~^B1A44Pgi7Uz9Cd{dgOc^??_f8)^XVPh>T?rze
zaiy)*N;WEHDHKYlY3VF_>|xXEi{FRrr`>|1;OMIYu4?vZVEfBj4|YmvX-l59raQvH
zYXSJZz8TmBa5rM*#Hr$eAUCb)v#A@zg$g@68B?CI+}GwUMkTCZ#x);Zw%_6p93^ey
zk6ODypXdCOjdrZehsN#OMU}UYzC6-SL6&_v=K=!TEPUD^tu5JiTT<2@COL&(mWr7k
zIYI<|={k&{1kXMk4SWrm=cxqne!U6qc+t@ZsYcltVM
z+BGFY@qN4U!t4&=HQf!{@fwD
zT46;Su`jnj?57i8(c~%C79fr$BIhb*8VuV
z5`&;&hK|pXyScfOBQnbNr#fVcO;oFhvXs9NtAbTLAjbzBfIGP
z>`Zr3oVzFIzh^`8MXhka%xc=bkrDKAfrJ2A>ai2)k(ZS93E`gOJOYWWVSFR4vZO7W
zi50%#lBChyJniaa2%&HDV|3NyHPN6%+G2~o(!0Xo;p!80oNOPy
zuCrr|pX1RBZMhRk?@F~lr#`W0mQU^^*MM2-)N;D#x;VOtFM0pBW9i$PW9pnaqME
zfHHK$AB*HeyXa}M+=KXvciG1lbTbt-PSu?NRB@DIYX9sa}#*e32O&7
z0mmOj49Rje!B>8{p(o8YOBs?YC&Qt=bmNjF?lZQ#X_(R}SI*lfWE@xO(&UtT?Oarl=5yvJwPEZbcv1;P28jPFT@M9w0YQ$)G&1a02m#Qb%Icfs8v4QCnK_WJZ(j
z(h8a^KZ?FSn+N0gwQ{4HIcgg0f!h3h`(ecf#X)p&0fWpfxQf(axj~<_p@2lYtcl9s
z*U&36G1?dfBz%jxA*4B<}BGEhj2v+
z=okr(``B!ha3wS1Gai)ldRg7BV`34f3bJssqL-~0PYq7)*YWik+a-LB6
zb5F!3%g|!Ykv(y#UUx0`z#_p&-&pv`(Gy%`y2m0vTlp|H+%K6+NA??!a=^vDFi4#c
z8?cR}U`LGGoWQuv>Wvo|UB(PAN0m}bC^+$j@l}oO?~2jnW|7i|NIVxH_C;W%BWh^5
zi>+%nnK38rxqDK~xUDH!**8fx*=)Fh-7<@q$2ieVFoaEr5;AzCUd2j(uR)8cV*m>w
z2i&?cDzes=0E(eb2>n$x)Uz$XjK)ob^D&q7+hp6yIxIA#-Ci0mdlnmH9`#0@(>r&o
zWn@d;5bTz^c`~)l>;O5d0VZZnYpam;=v;v>&*@!)IJV^FzCm2M{Z&S%v}L%QshbZ~
zH!23n;ULkEL9&M;7+$Ldl=77c*LDW^9U35s5Nl<(y!z?yY_sUzTqoMM(Z(GtnX~>a1FmaF&#IuWwqYyN=-pu
zZL1uMI9yIctSV@gBV79DJflV2oE`yYH;Klm)4DfMPBCpG^>h=GJozR{B!HNPxY`ur
zkJ|Xs;&+a^A^B|3uzJMk`z}ficHlju<;PWq-(2P-8$gWIqA%x}46PnUT`fYq)vYiU=IP%vo~4+mJx;0jsw2ynvR*ifLoAmQmzP*h
z&&-O^-mftJDdgEzc8Fkwl4&)ynfQE~R=PaG`7T*dX1E#No*#U@RzPjgqY=v`ng6?7
z_#OpcO>&0Oz;f(R`wWqR8dYH^^_)d>a6k=6Mz?EA7o<>|1Y`3
zAGA3q>;vuN|B^2L`kZzukaQ~VFed!cG#BKK?^Nx|6IqIXz2#rBBpO^MQkZg69RJc!
z{w-XxfiT(ej7bSdTEBdWoCqT6{Bg-?-#^urzdtWo9yC#j)ju*1{#$_g^CegckaSGS
zf?EH5G32k$bIJtm%-@9h(~nE8|NIt}$fX}D{f@K0e#9N$y-eDvQVsvtGcqB<{+DAC
zzv>%A-qZdJ2AU0hP4Cx6BcSggfC-VSic|l5vLB!K|H)+N^!Rcl{vUGzDhWQswdsnL
z){92A`HE=pSMTGGTl?``lpzra$>VMR4{a3Fao`FdYQM=fpb~Y0c|am~5gXa`fRJ+6
z5E!=TmAH|3IM1S=^y`Z=AbEQwOJTzdh=1y&4`Hsf
zw3373hcd0Ev{Ra!ckGgD>$jiw6d98D1}W7eCm~cvj0F;(CW5&Jy45i;61)jYk*F&T
zzcPjUfR~8aiE%3@Sa1-ol$axj58?^7OU!WQEXMp^e%WAaAd(Ci5e!DGHc9m7{<=lbCR3llkgPZn)_0Ylvnca_*owwI$zuh>|ZFjXx+Fz`b9
zfL944BpK*0wYKKH_0z)5L@2P)^$5TP=5!w!-JJ~p@<$4TRTLLvXhQ|1THWl2Q*CMs
zZjF*3VZ3L!@Gr5qG1k;Aok06d6hZT~>v1Mxt3jtLkb?8o{vc=O@x_6WZ86po0aG6s
z?+m+=K3>J`%bkEgFJwOq*7jG5-$4$jD^BYG`0xzy@VT_Y$TT{VuTl+lEnRZ5?d=7U
zj2+1I^+M{=Vaho
z0J_1q!Jfpp9oW8Tx~b!w8Nn>*jc8yZZf~gylu8g0mg;<+Zc7Ix&XlxfI(_fAef-kt
zp3$f^PvDpw{L*lC_Ib1=y`n$Nhyh6~vph-3QCLk$wK#;4(WLy^s=EGHn7
zhx3Clc6gby4rwD^3kvu$HuKzEGoTtU^SQf}FTcDJ0V?Y=27)1&f+JOp!e=kGCrr1G
z&f+iGn-UUu}}sImvp%3nJe+5qrgykZe+3*NXl432sVc@IE0EV&u$X|W2@!_JSCR&|SN9^}OJ
z9Xk%aQdKyomy@PnIde%M%t#H1+rNcre$}}gcExxc9EiF_w0=S?!1iU#WaglOF=iZoxzjTb6-cc=SF6BadFFw
zMtQ+H(cnvP(&={_3w<*!`soRDBh$jYF&T25)M46Uf3FEaQv+khoq?BiKIqf$^i}a$
zV)E&@5RvYlqO9l;7S!t_IE^%uqrx@PqN`S)-(3INm&3p+rnwpvfb>gS?hL#}_3o$r
zS?(jxAJN};CZ|BTkk?Sr%h10?h$^jk{@kw^Dr8lL>BHx#lMc{$AaNTSnD?E3JfP}?
zhmTGq3{ItoiuGrjMA#aWE1J7KlEw|5qH?MuFGnR3klfZ*C8}3bv{#YG9917#hqCfG
zEEq0-6zpH`Ij7GPR(zEmnHjA>Ji^a~N7D=Ey7_f1h
zIf61PPTgInb>$0vo|}&3)zKIS?-m_ud-_@nMSM&fmypHXfg#rsX^-<2CVdf6fy2Vc
zek%6mPRN%Lq0nyUFbl-HV+aP-fX7xXgxvyHx|!x#DA7<7!4lGdOTCielIL0#esaQM
zK6=2uTH2$2ZEp{3r6^d*R`~ggl~a!Lbs9*PR#cR?(W=yzT{elDUIC-5p+!R6!ifbM
zl>KnU%c=7pc4~_;R+}!_s|X5Iv7)}Xq%kMvny^gcj<3^^CJ{-aZ$8DfVb%m!j($@T
z_M?7-LC(&dwcn|b*y|W;H_(6yg~yaEHlSnwa#nfA4ji~ai`3T@t?7W<0T_X%fjQot
zca!`CD5@MaB4PG>a%MM!$x}Q9Wl*foqAy1pX-RflS?tJ#kl#q)`yhI&COBCU#dh}{
z*EIN<;vRAt1T_Yluyt^<$m7&Eov-q3IUkQv#16W0?Hc{N)eN`PN+3s8d8qG
zHFtk_Npua_oozigZ5sag7G?v^da^XA9NtJHKQpM^8DOJ&!D-+
zL$?tV@PS22RM$mv<`gxx+pLxJDY=M8?YihP2`@|HV`WD+Ep0JV#jpH{!{NJ{tUW`M
z6{OCwX=+x({Rca@_{<)0aGH5)WzjI@VJyu7
z`OgaS*02fqwZ&YOK*LWR$oC8x_#*wP5kXFXT-OF72s=gd4@%0g7?Sz)9PXsYIigm5)*^~@W
zN-1ce(3bU!YAv8w5V)!c5$09?9T)0VOHy6C?g-?nez-+9Jpo484}IvHJV*WzrcNzY
zM3tSonqd0_MtUNaV%N4!;)lJh-#ZYTFml7J+*yXUb+7)yOpMrvSxs$_j06x
zuZ@)ImMi3f2CumH)-%s`>|mvdrVDYaWgTu`+%rSzq7bxMHO98^j^);vW4to?Z{{Zl
zdrd?3a8&ZlJV#cB!4MpWNvlZFW^Sj%pZJYz}X38XRG&Xql{NDM$%PF%wy}A
zP{+1TgBuA?5;V!rntO+hb`EsRjzQVA#m~BFrO^WlAQP;|!zZ0v{Zsakka{H2S@3S3
z2h7>$dERT;vA5!tSA_(2S+RV|aq%+nJvkD7vPZJjLbPe>T)?YP0wZ&&NEYP0c9Sw=?@iSDwR*A9Xx`pPyYWlLbzS|L;k=Vo(8
zN3=lr$}3JbC_;SVRCpQQ(6lu@<5n(%W);1NTyrhlJowvgl#3_1`10d$%_JY;D&>3E
zK{jpiyVHcDbCe!m3#(XSK+ikEC7%6z&)2PErI(_8@X>uIw3p8Q&RYL0-8?r`1r?%a
z=WAc4AU^}P$B7f~Nsvib*rww0%UV%Oiv;-TY-qW|DnYWl9BOXj>ykvvLF4OE#bKG}
z+P6$6)$ET8++m>Bba*6Eg^n_qFowjvU>k9{BzK5ZU;JK|U7<;~ba}Wb?Nj}ivHpa#
z%~TGe^=5|8X2w@WoHIE!)EGa!45CZE*)5sv#_rC^J$WKf-|iT}OOWND-L3GkznDSD
zA?yViR@I(w5m53)^5u-!)be_zR}q)1d$oL^n@UuOU6W1O0-a{f?=>38H#6x4#(D9>
zYq_p8eFrtQ8yBVBH=%l#NWrt*hW8-fwagHyB7OnYK!CdVC0EC;YY+jnl+<7E!;=>m
z$6BysV)(f2u{lHRNh=N$7H7$X)^x~ukTxk>UF!Xec~TQ^{oQ_-_Oq}#3RSf-V%WO#
zK2l6}vI}!|rn1^_T!ss)Wiv|=fynPs*&G$le$?Hj%Z+2_8|1QBTX(ky`R1}7D`j(!
zxW@=o!?UIHkr=xicV#;vxW**aM71T1Zh-qUORZOZwwq~vNlY6rnp;sW-yrC-7JFGv
z4=Z<56tRktCb*Shc~y?cZUOj0ei=IB^e=+;$-#S`y7pf4Pv2F)
zC*Q*R0b0Pmo%Oa+{+HYs@kz~hx~XQ$w)T25C5mGk;4I7>Y+%#HTm^=3dcPfXAMVEu
z^2z2gg3oE>YIoI?^syAr4qkMuLXg?JJ$&&GX#`GPt-UE}S>P**H}z&ubxx?QHlgLt
z(yH()4sBG=I%BPC;OkP&@mlvy&l_8OOf#p>>V;$8{=2{E$tcj~s0A(9Cq6ZpaJLy5
z>*sK4Ki4<2f#X{^{dg*PCE%uaoL_)M_tVy(oXkl4xeEiun<~hF1UF_z%S~M@ICa+uXi_AU}$^({MyC@JEdt(uK8e-0e6GQv2b%
z@iAJGlLY|`mDhtvevGH0zt5Cyb@BUxN~PeYjmX#%nAvj7UO+iG
z4O^Rdrc`U=%`J>%VsEEb&{xVNZnf#g-*_Y7lj74~bhA%O2UV(A*n=bvT#-`^z3Zs=
z&N2q}qIVk~o+K^qCp~P1LSOkMXlWQ?yL4G&-1&CbtrTtJ;92F)-y1hhYm=-3Kr2YIPHCEH!d8kfAURI8!lu1Cs+@)REGLGU6;z0&PZ8~I9}
z;vntk7RaTsd{3cp%bn-exBz>#L2O|EWvQgg=$)cjHy(%L&y1?hkT$|e){pIa*H8k^
z)KrdRq2lRKXX%-KdMj6TX?zut^IvLL40jIBJ$|7dal5KD)lzHrBbK1Oj)t(n@kQM$
zRSW3~&HSDV*^bd&EDclGK6>c`+=_Vtu2m}u0+X);d~~^sR~B?Gzj{Ebzj}xc8`gibWD-iG4s*Y`_k|3Ia2=3~4%qSRBNPu71YyA
zJ+;=)t&>BQ230!vWvG9I-RStU1HPf=7^(Nd!Rs=FADo+Lc
zU}aezHa22Jzm}$1Pe}jj?KMKwZpTqio*h5qklGPg`0MbTKbIak(hzJTZz>gfn4U}g
zDgWsPyKue*i^HoE&C&X8V^9{$5pG=Xms6}-f;ItnG-RQL;r8gxxU9yO(r_H1z_PjE
zz0C@jSx{peUwf!?{fgk^P3N;Lx+}W|dhLf__1WM(KakM)6|efbx{hQxnwrKfSu2^?
z%D+fNpSH$*pQ}mYGmXwt&^a{YJ;IHR!AV#Gp8?FR@pmnOie(2Y=EKU=RBeX
zwBDzL-tQ&?5*IjmZKapr@nk!fgLQnTLnB-Cx3cQ{qtVwZ$x=}BkQsSz5~@iAC&WaW
zCaj*z&jh@f(vkGNPi7uWjaOf2dL1){Qb}JtT}RD9O>xqc&-M)o5M~OYnRq?hWG!n3
z#dnu$hLA_v%ri)}6(t`Ah3p$Mz&T}*nfoYM8r)l&Va~z#1#e+m;8AEiQgNtO
z3VLnubnOE_#7r7`#-hhP=9_+SU9grIjPep1FO={-M!<4mkOb9W?1rcd0AjFnT3?s6
zJhGOqdx{P+cD@-Q&I>Kl(j<2D;_+=hG6RQ0T~P{ZiRNcAk-S%cS2hv5id41h$NRKL
zViwPu)H7IoCbdBhR~VQaJUd_@vx!YDJbT96`dihIN=ZQ^(AwGcmZ!&Z1=%YAvNY*aZ9>+(KRMn=>KD*GF7@Gj>D8%@6Z|VgYaDuN%d%Oy
zeK9Rkqp4~Hb=7e0;Y~W~Er^{T$!sr$XP_N<#@CqVy}&M5;P>bV?f`vzx707|5%%G#
z*(-jeEBdU=?^cSJ6LE4u75Hk!&?dzlX~SNL5GUNNH{o4d*Ig$Z+?gl!;Kkp96p$Mh
z$PC9lVZ373HsuL&t}OUzaRPEeVnE6tyhg{!Z~}
zj_!Vd(p#+ilAm}5*Q}RTUj9k4gZTFIExh+zN)?BdH2InQPrqN$7u35Fz$v%t7chLN
zzDDIMK~V&){jCt1f+`m)HtaEf9Ya5cRJ0|a3RifR?~fzsCw02xbO8Yj7V{h~z1IX-
z2rCS^bY+1V<2?0JtSAlza_B?T#+~u^EEstQomKojP41yR&bQZClqzSRyU+v?Y;XiR
z0y3_RB1ST3g{^^VqLEm>d&kN7F>C_;$lNHcT+4i9g~r-2(tSEJyq0ntL-~jk7+7)dL{tM`fnA}Z?D=5srN-(mz7KJ{Mm?))xa?82%r_~IzKLv
zdshT$9@_7Exx>sGI?Aj<=Q=WbGvB@{ONxo(Zn6UlYnpJzP#lWg>uX+bjp3lCP@}i`
zhs|DnR6S}Lj4vm)wsF<61Bc~#h9Ix&^X8$A+^ra78Qh%HRUA|8a<*v%n(+GQXIbrv
zv=82Y$9nD7%4CuSHdBg{jwXq&%-V`}Ldno7ZR+&pp0hLTgs_Ec8;@0aP|P_C%647@
zuZQcs9t&{b?npUsy!Go(RLdW6dx8qvVYIp&NJKh#^9Ttc_pT3GbTnu7RWdqbsYXwgwG)vmO-cYHs&+l9e_wgSkuuC^+zy=l-e)Oj^
z@;yH-4@%*rXy^5c&DL)O4zva*3svg5sv!othtAZVeyM!odf6_*8SBH<
zPd+P~ytUpqeEVd-lzm01PLKI^{{%mWrs0${n@wpC;jm_5KV~3UR
z5}(F~bR`d0DQyxnhm<9I-jsp*mpY{;dZ*_iPv!91dOidwH!uO%=k$)X3T=M<4CfwP
zo*&4(C5Sg1GPRR7Bzhv3N({zE;?R*-#0T0`s_jw!isW3}51#+D(By8B`B~YtsQyGc
zG8VZ5O%j(p&NBEj&verVo1BR@LEpSgGzRnWy0_I4iLSQ~z8&$@AwFo6Kuy?%m1r4cH{|2(8_0--twtFMaoWcw&>DeIhpZ43SlF%o$gMn`e48aiCiLVzjXO%2b=Z
zJs+D6DDovuWOQTN3CO(;#U19bj4lq?7Phz@{)qZ}@xYydn#a(*Z7Cn$GFl((F_{+s
zzdHAkOF#%P`7hV`%HRI)5B$G724-k)
z7v%S10(|{X1&M$BR!WLyGk!Fz!t76^`}X`DNB{d@k~y^k&s|+5{Z>1l|

diff --git a/priv/zstd/doc/images/ldmDspeed.png b/priv/zstd/doc/images/ldmDspeed.png
deleted file mode 100644
index d5445f018adedc0f0c0ea7880782bc0bafb35c5f..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 27594
zcmeIb2{e@b|38crWgA%r*;OjCWE;Dpv{({CwrHX3gs~2HVM4S@*;BOHvX*6H424L_
zzRk#zeXN5q^L(zMyYBDuoc}q`|2+TmJipFy-<^wbT{GA9`F!55&ue+RdD=*yZHK@P
zIyySG6UX(=(9to#=;#=?Gj9XmdAMDE5d1^$b4LFNU2e1B4{)&E^SG4{9UXip^dG%b
z+86LEI&>%W4x1tAC;Nhmgv?VUXHz71hwt8v=V3_Pp4E1E=N7h4nO^*R(1%2wU5?#p
zjDpSI+*BZOPw(1Nyq)0
zM=@b^tt@fo8*fAB0zLhcf|zHUN3skIda{VKoEz7@wUrTFCzG&qQoFKCjR~HkDgKe8X(+8^?}q*O#0zozn{^i2
z4{f`}C!A%N#H+Rb!#FBKH;Ol@{S_o6rerEJYRL(8R%(9mItMS_p|{NI
zXc?cnpKF2paKi(K=44fe>E5>v<6mFklYN?hm?oXOps;y$({L^OEu5IYEGq+j%SIl%
z)VP)Q@fxX56=kVQS=8ns2-mtUJ^WUqOAhY!s*eDpTe~^3*rkJaX1MV}yyn@aeori0
z1}leGHNR6brwoQX=h#PHnU7hXdv;IxlJ(5yReZv=n9#`eY9aq#6EdfWqVwr_O(jdN
zyr53hxx&ka1`Gv5LK
zBu3`tL0Mhg_mB5tT=ra*qR1(Pl1Yv$%_-`-&1TAzeszo96j
zC_5WTV$uLPt84^+L1fL+OR{c#dB8sS8E0P1nD9x$;!dyes@Fkyq}XK*b
z)ULEuj#MYxR|T(BOK0=aX5@1&H1&?{@U`O%wX=9E)=7J<3)Z4j+jD5hLextQe}k(A
z3_8o+<}RTOjaRT11I45U7WoTdXj4hI$KOhlX=?^-Y`^Dm20e`%NGYdaif(dUEI*fB
z$l|xzxklM240R2|(P57YK~P9TF}}o09l5r+;0oKKF0=kQeviIb+L@*&=3bgQ*vDH0
zZ7dom(_1=pinYIrG%8^)t)n>T@Q2j*b)Khz=Li@*G!4TQNYk
z1od-mV;AJ>pGzpcVeS6*8FJ^PicoxR`SeSn;NTLyPcviS(b#t0+$U=m;
z^a*)OFCgQRq}#g=MdQtt6aHL7=f2Ypf%W#I8cmu(OWgXq(l|}DEX1`64mH=;n?LL@
zyf*WtCW0jgMw>3%GZ3l{SV`*_p2b-2
zQmZr-P30_G?hkTNzscbljrwY=_T#BIV=WJtq!FuyeTZ*?A$f?Zf|^&sah%5$ZY7$0
zCBBL!6(1u%_+%-Y>V_^2ptOpto8-6$7x|Ju#UQs0eKj>c7`jaOq%y$D!YjQmHygdE
zy^z82tt4I{rRayrd#26l6Q#4_nh9nQY2iZ)iZZVmJwp|vd@yHa9OkCZg6FTz&Y`(*
znmCy49YF3Tye@3sAwnKxicvq*FgzR-oa|dsc1SBrtv`#uG~VgJ<>q87a_+IWw#&=l
zxp{bOKDV)*2xs~yufB)3;6~MI6?PE$VMP2H;`Y14^MZk|c=PU|?NPO(`n7&j1}Q~X
zvUA;NCG-8A-KV#qb(ch6poLmQYe$vux41j|(-ABLiA~sW@JiL&t0jAA6;uDN&M@3W
z_(a+2Mn&}Ifr)wxS*?rHe!3mhwHsw8Y1K8{1{~PvpT*EFp>u?uUR*5q3vI%ST7ZL&
zJKtn!cjoqKov`ERSBkW8{J~r&?1S&c#TeQ++|3OW-AOoLNE;Dfdm>=QkNdutNVRo=u%)J~*B;-3_BRv7cUFrnIGLU;V
ze6!&0`#efl@H-%_g~7mDtN_c&!mO2Jq-wCWH@UEwHGis%pntDd@!p;iH1IQKm5?%?sbwjDwJqfb?r-*>qN>=2mwA3XP$Q1P@H4RV)XTWB+m>MQq$
z&!-gap9qlL*sKM@$9%&05!e0RZ10>LP%$fpD$k-1m|ac_0?Qnqnj1c9u4xRta72d|l*wq@P1uk=jBouX5zNUWL|^d&
z6N?)~jw75T(q(S+fCmJ(fR)>QIv@_4`5@}#L
zIMl(OMp?+lS~;cg#Ho!xhiTVq7omu7l!@6&Hfl8+rh6=zu!%c~{bPIVsIY94%ws$=
z;GqZvZtkkj?JyG-jni5kBcv1f|C)2vTh5F%PLRelBZnVYM4J;!nh|aTRh7sA>Ykr4
zbJD)UX%iC_=nT_~Ysnn|z{)frrG^r9w*QJrr!{BVN470NfUDIa>cPH
z6`$YSQ)Y{?KE5$YzitOtCKR(1jbZ>IJw2n1n-C@NMn_vA0A0A<)@@`8
zKP#^CUP}LdSPOG+&`f1OvaDbRVV$%?2K>HF@M{MY~vPH5wDdxuyQEtt`;ZYYAN{)a0$dP5k5$sz9E5h%lplxNjeS&Az`U7_5e`oP;)Bd3P)O$D{Z450zDIKuJMHMzr8D
z6OoNsh67v*ZqQGE0~Nvm0OdOxvhmq@SeRiv*LyZj^WiYSk`CO98%wO2w5X05tGoXO
z0%ZaSG|J@b1~xxk5JqPrU)D!sXTtyge6ek#pKoF-Ioh-pmOZug>h%Znxh&^!%ff#3
z-@}+;V>>;!J!z~F+$<4UfX~`{|I_BMmH~X$pPzx7@%hhv`7D
zl%x_BH2qdm+PXyA#`l{!{>v#@w^x0D^};@^T6i`K4kPf`s3_x*aZ@~LC_c}n++(0>
zb{5MK_3YHcNFJ%P+!K<9kGU^5C30T=^w_*K#OCvfq{s;A-5coTDg)CVom%ZL@mj0S
zWiwT4HM=}2Ot|A6p7i|)XA))x81#i3WpyI2V=KBcXgRWcrb@jjNhPmy8Xzi;>r5On
z-3RR|5U!p1Vm3ij#l-?%S@)DRcaVNTBcHI&HReiX^4;%-y6*lvyOEVvN!>1?hIKPVnt
zBh4whvW!v$npH=W&&?Zke-%jDgbt5)EUXBiol*n#zP77Wv+?<)gfHoFm-}jN0$(r}!pEyPf>V>7w4FLADcoqgv_NwE@1L!8({wYlxgOs)Z2YQD)Q{d$R
zNy09KMJ9li^@;kypVJR(wimC$FoDR`AKBQWa9i#ygGXPk%>xoNVsWA)3XrQMcs~ez
zwko%GZ*remOy{?5E{3}4E%c7HXikUkAMR*Im&}V%GUDMj!XXQ-_)L*?=RCvq*H)&l
z(=-CS`Q*;)^pyl+YWC*F+_Qc_vGB4%3r1pN9VDblj
zt(|e|(`9znfblN29H2qXrwG7p0*r4>wZe=*0oy`a5V7ysH2MESLwW
zZzdG3MIpw+OC3wp8j$_~@=ZPYl!ZLyluXD;`Wul(Md*B^D*0Mo>plz{(`R^)7Ea^i
zxr{Y92@&y5DZXc|&4`4Lh^fwk%pXhtm7!FC4XiZ#M_&(YwC>*-N{q2zK)gRBT3fC_
zu!TdIP3CiKO9HwL=r=*G_MvDep(V@+fNPgDe-hg>3;SzIVR2lsRNEWN)wk3L7bNveZKrOWiKMOgrJh6V?L<+Cv7nh%ieg
zdmcfq^$gg#!dvueoeXO0&FksB2{$E|oH3sG8p8a_XqtTxpEz
z+{(hstv$#yF+){s1bpB%Pk{|ABVhoBtvF?TL>9Hus8&Mq)g?=UJ;(D~bCwO+)`bUrw$04o3I4v1q)I?RE%Vm>q8sB-?HTi$Z%0+M8Wb0Gjhk=bM
z4~GQ;=tXhyrE%2Sdh2E7sjk9o(zj;$3w1ZZ3b$Nx#myEXVb>4}>k2+=mWO>9^i$v8
zl`RSV(0eEQNj)QbrOwLzPOY?XM566YCt-nT;fFf
z9McJ*Kb+$R{QbkE{^5sdmE;e>{=Zi?2*--+O!kz@I=~<7-2g=FCGQ8XTX_O)8J`+7
zy&V_|SS)OP&C3?PoZ6KTAC7;BAzvbOwS@AXeQn8E;?~0(r%fSw*6};t=qhxA&)*WL
z^W)Gads@D`cBNIuUEw#z@tENeNjCxBH@7#)vgg|c@6&Nok87`vW#X&Wrdd2Hh{sGc
zB5z)9>!?~Pmh~}pEPA2MQL%Uxv^dI@l0R2N-rQPi~X|G
zLIe3Uke-%rE}pQgKzaevPPYscy0zXcefo_JG!28W!>mhOxBK@8I3X!3quBk~$vfjz
zM-mCFdf3W!2Yh$23l1e&TnpAl3=*5e}ZM7T1W~
zr6SWCIFaKp*;#;FeIR8Ksp>Ow032mx)95@J9dXUVg#`49rRA-(UHeSeg
zR%GKpL<4{^{?|6d?dK(z7?}kH!b#>?H|fHcwh~YmEmRj*SZk}*I-Sx&lxtBmrFTAc
zd10UR2KI{|?$c%!QY#|yZPEJ|WfdXatW&Wvl7ye3Qf6YVR}!M7#${@Ii(M=VWcp>g
zT@PU9(4|3jFYYOSx@v6{rnAUkPVF#T)GX3xShpU$ofeKp&0@&IvT*nbni@)a&!lx)
zQb0B}*0cgw*u|ZPLbp9P$&3ctBsW{-rV4v-D|kq~Fu5(8kmW+SF0Uxzo&-?$?Uj0i=RX;u
zsN%v)MOWI61lQ>W+bja|d?N4-fOw8w5X7^&(RC&1T@CR5&=vx=t?VZNoraE$e-+nq
z8*ThdT152QEHert7b+wlvbx~tOD@QrJMyvYJOHtHuo2tWj;p`$5YWyICH)(|qVWE$
ztHJPN8WNr}mCNl*XSCk`_$ZmiDqBTzEC?pl-o%f;%99xx5`q);3kckK{%Gyj-<;I|
zKaa(b;M6B22Ph|<$bB(KV|aNm_c&3@;_c`1&mSgku`8fZj9&n1-!1AV0SP7;JB(Fft&PjuMbP$&_BXyyFWw)`@9{P^{$-qTs&tyxTh!Xzxk&Goe?@?#>o&v}_lXwj
zPR+^uGUbzRyxY2iewWh?w{8R5+t}|~$vS(x;55UqspDGkHp1y^igu^@TQmeed_9r0<%Nee
zZDM%t-Y$4IW?%g7^C268v+53Jm}=ZhtqnX|3#dQG^TQitb{sf}%Y13P!RP@F?+%}3
zz=oup2@Zyyk8{yBZ^r@iw|m>!4T=2wK2e?Th?lE+H1=>O*p=N3f3P7i{JGSh8~A5f
zgz5axn^yqkb-nnH)ZMwzfvONZK1ziB)I%9Isk5*5l_V)%Ig==V;aH-Q%UP_SdGVDp
zpH1&*_~ZA7x5J1WYnky{0>G45HCwmKgBy1t(OG$F6QDWtR|Mep{x^^oq?q^8Fg|7V
ze~pft;$RW^cLetMKOwNQSud4~g&zOk5^pToDSqeLQXWVN2Tc|@E=BHge;yH4HW;hW
z%>2+kG@!tpLSDfIt(-AW@<#nEY9q8#^Ed*qSD7TNw)5xok)T!V2F!ry!eGW-*1c0yG9O(mcqj3?KkUx5Cfz7eCx4OzQQz1L_QCA!uIwV>mxY
zTqoTze7NzUMTLI3#AgfuPl+4gDO}h!;4EZUG)!U#NXZfokkZSmrjt#-nd%f^5Y5Sc
zpntW?HM;a#-TwY}{Mj$Nxz*>7guQnVJH3c96yi
zTp4~C^Ap#A0f*H21&sh5cBL&Vf>ePfm5l>-wq58m;&We>TsVyIoaR)ZLI-7Y=+LEtex$-2gIXY01603}a)hm5WFqe8vp_
zG|jmsf&EStsT>}|dvJ$JKk@>x9PUxIa@i7sC>LzJde+mJ3`6v26u4ce0S&Z
zFy}2F_cAVV!97zFyBk=p)b6lLY8C`2BisllslY3!&uNz@tj4~W9R
z#qrq)*ATc^XVi>Sn9VI2Ic-UDMIh&OI$Vvii6xZrMsU}dNpdJ`G+7+-7!fpD#hiz$j36dD7t0mZz=zPyCkf$b%#*Byj4;qn*SdEY)3&
z%aaHt4~f9joPeZjE$n0mtXl-1is_72GrP5XaGvh*--XdYp66r%G_n*YslD=XR+~~!
z-Ir@`2^cWssQLhZ74en_H~b_NzQA7>A)k-G-VYR8VgMveCOi~z{Dc6Jog5o(Ac?xT
zM$(1r%D||YYP~R>HHJ?ViSqRwOeL292oUa9?jz!D5nn6J0IVU&k+d
zTRMBHr!)$(?2CXD%~_dgV(3>BeV()-A%VXYL8u6RPIxc29R@hEgEGii)EE<+05^?9
zjID-jhY(*WQ@QY^yBdUa%9RHu!%Yj0B{wXl6up?LWu<5MS4|NJd-dy$_7rb4T*C-3
ze`K6J`6!gCA^k8$2@vMR2p0Un%??SzJL*VHQQlA>!YlmJ%G==h4&&Mvgj)95nG&dqP$0B?=c!uAR7LSr`
zZ;@j4-~W#U#@jUO&k|+DN?{q>?0`bCI|`M3N_6%xna@kt
z^XYaP;M?{ZvjO<@foH7VOsg4cb%sU;>Z`gFTfdfH(^Rx{R;RwzypFj8KQjE-hZs7lyh6P`8Srs&F
z$Bqy7oWguHQNP73_<}(sb?L>)@@ZDRXT5&MXgkR{;MAPs)34mvyFUQD?gQ^0{*C#g
z3+B%S!NtF5^T+G}aB4QVIc-b@4lpm`y}q*0X5Hx*z^S>vG-ZPg)&RCpjXD$AjS2J&
z(82#BF2)zUubc?vf=CEb;X5!CU*wNx4{N6T%CRRTQ@Hzq!zQv(7E>|(*)EufoBgcI
z5dnNLarXl^bAF2viGe5>n>$!
zgH#PwRz5k=*H(pln^M$EWpp6NRxqB$o;eRg34}cP1?#Je6WEG?`I;w3V`>al`ndNR
zB%YqIO#boIFrGo{cOiuYtX*7`HQ{Ade@{YryHv|B?Y@HF)V{+$j$?C#L%MN!wqC`4*!
zy%w*`+wXVJA<H_;%RBBY{aO`7PSs
z;{Lx#HU~IhP_htke+R38YE?eax7NDuFa@y{j?)$M&98bWW0~>nkaa0R)-pf6DLMZ^)YKl|TMtzJdGyb&??CP|+H
zNz7hM$11iF?wcBIm$yvz>%M|h9tLN%j_v|M+=Q6G3K6gkz>Nab_bmY!b=o@twu0u)
z=T{Kf(|?pR8)$A6V-onx_D%H@!VpEZx>Sl0(we&y|8=^ivnnL0v(U*HXn#4a&L9Yo
z8I8L%1(i;hjp+%3?hp!rvIzQbplr)0rH&g&TipuhL#e6`nXl>Sq%J_c0OTP&frW5A
zFwf6&;2xoo$HcXEJxOl3Z4xRo0N|lnQ^JJ$71Q>)&7e&YFNAdG;@6=ZIYAmrtQWEG
z4Ui997@Mu;2$idta`TXCK1OcSUN`kxAU@(4F1k=3=Uq}CRFNrRG;ARVVXV(T1C|!y
z4O{doT*QrrJJ{AlYy&bb1|0rASbaT)$q+a7cq_WYE+}W8!quIkzx5Awz=0`qf7Q0PgMYDHZ3G`40_DH3omab+
zQv@&{Dnn^^jkymJn(Q)KnuoM5UM0=qGlKZaW@}htrc#6FKF&@Swk$bwrCsIs7>G4~
zAqar+hQsPt%+)LueylfV^zRjVHV1p91LZYqP)Az3L_>o$A>Ot7PE*C
zwHhZQ3XtD@Sp_$N9m)IyNVCM)kHq?W(O{ig_le(P1&^Vm2jNbwzGZ#-Y|2b61Bd4En4?)fzSUd
zWd-M(UDH1WH}*U*6Y5;`quQP;FTArNzz59{s9ReU3`>aN~n
z00=)nowyyWKCzFRYCSWasifTcp
z-P^`A`*W@O-*h>LWL^Rbo>~1N+7!_dz0n~1x5JW+(K0e-)jDqa(Ajuj5yeAQmJIesHUBjDrTg3YxpuK{epH#roAJo_Lo_*rL`G&t3p
zoL^l=bOYJ+G9tkGIj(>(
z-Bk#e{8pL=Z*N7Xtxq~RfU=I)oCz>S4Bs~m)cgQ}H%pPcAZNt~9a_N4{h|aQgWtn{
zz$rwt$+eeO@c{XcM{72mV<9liYZyXoZot3S<=F!wvALF20I+qh{*(7Z?4~D_53IYR
z{q2JnGDX<1Q5-XibVGgo#HD5gU{PP=OZ0_&%?dR7GdKZk{AI3kgTj#QASI~LC>AP2
zbOP;Z4sv)ePxlqO5q!CBWgWi0jVGoNP;XbvIyOsRIxT!@hv27vu4j>CV&(fxdj9U<
zt(M?@z{ahgxxc@eKYLCp?q6`=mr+`37!Mi+v3LYDT1QKssLMW)U|NxW$OwvPV@NpJ
zBNe$~{r#%Q*+Igq7$65qD6+uvDwoc+D%+X<+uIfprTH1t30&gT9@Lr#8;6`$i&*Y1
z;N^EqLWpe9Bd-pDu*oYI3oUBK+R$t8m@GPf$(hgS3C5J~#?evQN@{m$-FbjmFT+4<
zOa#n~Z~MBO(uBYsBaPM)C`RVpa~qqA`aIbLX{$5ALf+L|;a}T*{|TC(0fiJd8|Pn<
ziKoY9pQxjg2PEk`Hv)$%j*e5rSJP*t36^%;%4m52g+c?aEl<5JPRLqDCiMPD8sio)`u_T7Pi06o2C^BPbx0WQ)REL1CZEm
z?sk~A$B#1z@28qlKPa}kY~ZW(2oNG<_;7Xe$WABhxk|x}O-5BrRHumU&Et)u=Wv+l
zxS{mVSTShAbujGprVn=?7L;HIE{B80;(ZTYt&HYo%{sP~rc`%$gsx3f?j3sl<(CSs^R15)sk@_!7s}M#s24$LR7}{;
z9AG#SQ0o=KFMPQrRVWugFgehYA|I$!v)}SUm73DDwSlZ^zrW|_5#1mFwul%fnd@u(;?tNpysiV};0o`_13Y1E
z;jUre?EM|s0eXhqEl$A?prUC#^Kb+qb-xA6_4zbv1u3{cV06(^SX&T8Djm9uuHfcC
zsO@X}zY$tbx>})-1`wE@S!#k-C&EdUfFi+-BKveRUsNnP04}ch8;}^4l>as`d3G|Q
zNyRu2(1^aC0-SsC*JZBbKHQNAl9ttmBy^l>msTinEnBtx?2b|n)!wT4lo@V)fM!>-
zGuHUgKPAzLNVZ+=`6|Q3Ttu~-2!I_N9De%$A{nBNhM`LxwLqg9+|(oDbnJ8+pk-Y|
zhB^dqWg%^k($vr2A=rB{4jA!OOde`|LQG5JfELx^>vI#$I7O}bjN~Ou*&7>SkI`7u
z6(|GRaPFt;t{pPOLm6K3)Bwc|?ZirW6b0ohrqN6s!h#KXGMi+VvqfY)z?V~h!=)GR
z#Q+kkm^%rHf5hM@l53Pz;bkSw50HF00pMegXVTmXN1upO9|#@e4sM2y#~C5}yZ`ap
zS(t7uXuBgoXxkH%)U35O>9|P1#Y`y2*xO56y?IL7v0JO_&A-5KC>&|8TU&nyfG!#}
z9giXpRf^zeIv^Dsr%ZE`0mdxI6;QW8yF>x)(hm~^q+HD%Yd?*UKoBpL1H6?;#GIHh
zaXrD>{e^lN;M!DrJ#`U3p5BZ0g{)`~ZM;t)zu(cXnJOKy(+HTm!DYluj4CC_`qW8U
zLakji$3cghUon_0i20jKXhiCPPKZ|n&#&3bt$Z{NeNzU|QfE8FUKPdoTi1g0CXKuT
zvgEJ*g(5^=_3VrJ39_Qx4J#tWwWP*ZYxjPJJh
zk_$%5Lk^t^(~%12FkUlzWys#J3PCH7r$zATi)^Zpc7IgJKicXa#aL8F^pE8Jf5u3_
zmwX|+K?_toSq<_m*5SvOXAZb%9vlJE4*3->-vCwPLDJ8@T!p#PKvM}V*YZCQwdokZ*8k;X{2pY?u6xb&7<
zkd3QJKYTs9-rS?Ntib&_9GK~()v4rp?E7%5onIHbHaHkhxvg)=6a1K(M6HlO{IwR%
z<%P1--hap7Y=HvJ)OO||?Hzj7GG7dU9}}$n?{0C>XHTUDG{)+i-Ty$p>BGdn4W;b*
zM$3U^wGreihv4KzTmL>DLT1iTP6~*saqTr=R&Z)&eQ4`vCDN(5*{C$@JtSsRJlldIS(
zs-t+XV6!Q(GjJ#N&tZPT(cC-Do);3V`7g#wXIYP#C9Y9AEx2aIT
zLE@KsJUD=kK3=d6QNW-DVhz-w5$Y{7TMwEy;-O}@z>zss&_@wjn(o^LN$dH*019(S
z_N>{Cmk?Pw4z=W49w_Q)DQMPQ?&S&vR)7e|+7C6;LCt$m3=u#v403bY6TXEL^2gOc
zGBjbJV0wyxSp%Xm8^p4KVaeiwTI(s#Q#Kw<2NV-igvp(%9gv+B4+h=AhDniafv+kd
zn=A0BE|i>rQq;)VY9=gb`OTM$p{#lWxmUR_6y$vIAUF9k#~!4HIgP3S=@|(uqhAwB
z9|u4HRF^~Z>xDwl(PsxtQ!jYz)qAM<+AN^ym8IvQ*4CDkwls=j#bS;J8*0%4#RKKW
zBYVyrPv-(`7VxUE?+Pc`uMTs!90J;DCaDbU*$7n2jvQ;aBQx6RfU?1-7cVLO582q{cPYCJQUK#lJBO9sph0(bR0AY+x0Lgx0KiqQQ-u@2k1T
zC^KI%s}|Ikyxv2YQh9W}0ymU7hc>$;&>Kz=>IotT@;uiAn6C;|GceS0YLMRghCo|j
zD8g&kkwZeg(I(?Lu*(?gIw5`ySU--i3R73@sT1$q%4H$l8jI!7wkZk#rhpz0NR9mf
zHcruJW`al6vCzw21zF8A-es;>>zk3O@|&;=UYhK}w_AH0tnp#xBu;jN9PU5}*F2*d
zuP5iF`fCD9aBxp-AkPaH+GrCVqmjMDuQOnl2TdIzvj?m${J<#_smMl!?Ul-_>kWKr
zAV-^q?yyZ{7CaD++%~yIgrwuPOq9~*3ctQ*5Jac%nvLeep~mM#R2Gp?hX`4pu$Qg+
zf`*?`P9pF_gfSfcLKC#*V{7re<^kHmP?R-*=#P8iUpZl0Y}(LQDsP;AG91b2rCLdz
zYaDj%3(}A(z54CtESc&uGkL^yyarL#U&^WUQGdV1wwuTI+beK+Nr-%`e|A3}{j{vc
z;L`(}GEe!Vy|?%6-p>hlf7%4QbAOIgWjca|&@fRtH`(6hG^07%G?85FPccqWU7M`z
zuyYArYf5#}oWP_mt`@J6h?((U@Qm}0&iR>{q=BsrW1}r;Yht<$3XI3iVDzJ4!5bfE
z@t12t`(R@*^`K{Vd2X)EmB=H<_w>q8j@{3%zIvCLEW&Uj02ptkwk9#}9l)Swwq6eC
z0PoD<$%QiinN({q#xqRAkUQBJO*oP{6!{KuqEFC;zv+5<;+|{aNQy%x__F{A!9i)=
zu!^8%cNL)QyvFu>AyAYGe~mAaz(d+9q#3Aa`hI1qM+Jo8Rr9_be>kLo(gm3=L9ZpV
zvsP0sn&ISJi;0P|Y~r8&7#40I_dRNz-+w6379{Rwv(sI43?4Z#%LTwL04L63oPPh?
zZdryYaXCfB`)0+!6o0WtnXf@TXz8`TaNRxtN~uX?2oCd$Fi{!Z4u%Cg{l
zij}BA$lmeyw?BgR27N$}A)C2o-3g_TyYzYQGGJ6-0ZYrvlFg8dsTTyoLskIPAr(#!
zU}lsA(dn0lCDNJoR;F*B`|8L5v?#-?qSV^sCEmj)MT!S2#N~%U%cqpZB_v&=p6Fis
zz-93F6s}>h*eZU29(-7bp56NKQE$7lYv*9fHt*w!oQ5D)_87xns0#j4z)*>M-_@vf
zb?FHB%Ts&8j@gy8-RAKl9Dr8*>or?cBs1Aq~Yk8zlUl}l8_o|cA^h?{xq~VbKTJs-6tI`ZP
zyFG!o{+WRGG{@!|^U+muA2d+alqBY;kZ*3uhwe@?VTc_6DoQUQv
z^{onnWluql(VsnP*M$+YF^&BAKu#?QyS*=V6+S;M(_tXPn=9dRkeo30FcggL|>n*+REK&T#FM=Rub9qyNrNbdPK~
ziC<#sO|sxE(ou3}TAjBX$HlFKxs=O%WGLG>O-)hfd$QV$t1){3b2+9rp)%@69T@->E?s)(Rer
znIB{o2|U{IRi2Y{kI~bnFl%>@ngW8`;6&E4N6lb<=rvZvE(6`Vk6HCC{<}08u<(G$
zef(bXj)voikkz6N6I+?@_O9a^qd){vLhA*Fv{O96la+6_O(+%Jf7D^qJeq
z#Vmxr%v(wbM{fy_a6B2QD802LQubu<5cNwIQOJpnuid8_o&HP+4Pup~M|_}c_qZATCzAxaqUVNc?STy5qUTyH
zmF}bIIF8)yOH>jFA0$6ga9TB2<@B|>d~$(1A>i%{r`^qWZt8R~%N^b66gGoWQ`!Ea
z!#G84cu~`!{G#$UQ`MDv_g5Xl>V8e2%D$ZKI3j)GejJap6-(stZ6>!^;4)>PVe2=<
z!HWTV?&=GHH!EF{%bxHsOz-}1rOH(+7UpzviTRF|sDa5teHS0r8W?=sk(AIEzuWu}
z=ROJgxkr}DA3W)0x}!s*LIg$l_-3)}&exj)oJW?cPl$DW1%Jt-7Zk#~YLAQr9^X84
z(=3*|kGb(mxeb^=_a{Q1D;?Y&b~{#e>hf#5M5W8F^@aUEE_Gc`JUt6W{rZ)r@a*M1
zT;Ydyie5dYNOy`Q>QQR!9W}L(CK0}2jx&}$<7IlgYA&8W%Mo|V#Jj}gY>uOwICwsW
z>E?zu46Lf@TBC;}Gn}B7eEA*#6%``C2fA4@#Dm*JAc`=;$*jwU^uKh!Az
zNAQD%xU}uAe7d0S@gq6A^of7mw@q$TL?U
ziQb9REEu;}oX4=G$Zh!!GPhdy_KG(E
zp!U^9SA@WIdkZI3`1#iT4Cr^rVbEB4q8E^|?jZ@S4Pxg%yyQxiFR-u7v%uM|n&@F@dP0_%+!Lkx~_
zp@s9MLlVg!4~UN+^FENwZ5KQeT*Q{3z)<}iG?mLaK4(-(W|O}Wem$P6dgglm-7A^+
zuO>08dm@TWc7OqX(redOX5Oj8^r@u+=Z~YA?pxWZ&MD8rE+#}&1_lO>3#a-C1(o)5
zq|Ha}Mt+dTtb^61%F=Fc<$}^&?x^e&5plU449={Hi?<&*?6hT9<>PxP!PyNQv4>nl
z0S1`^e;X$*qS#Xa-Ahy{I$zCD>e3+-Wy#0%S4ak4P!Qqy9yG6O%(JS7q1m{)ql=!l
zHlJK?)*9c_{o$H%mW8Rx+uco|Z6TrO(}A)#bDX463(^PU*%aWfSUH!?dsByzL4$F7
zb=-YeG)%r(uZ(p1tk14WJ5XP_!u@vYw486=(j2hw(B>)&hPZ3f3mO`*>#cRYI>rg3hrXUm)BA`jvShv~JTp9AENC5s;z10Z|4b^M`PBy`9p}6JFZ>A^iDdjwyEYJ&Ov{tHOw#
zuP*=kn5wV`mA+TYHs5otgeVipa($EDJmG^qU}C>1HTr*W6Lg}A$$(%fdEvi#QE+?r
v?Vg=!Nz;yEY59Ek*LRtj$#X)Hlr4D(ah#jg6XTB`+&>;VjwNQ>RW{kPyHB@YE?x)l;W1
zu4117e^Z~(+YA1KX7y0)?y1c7E3@E#aGr^)S)DpXLV)@Q%_ycDydrW+;{KgS_Gt4X
z=OQVTTyFo&8z>j2ruiNiDnd=~eHMFD1ivnIlb8ta&bf~T>a3SEmK3OzAO)%q(snb9
zA<(l-o*BuTb&{B-cUh=Ey~U!wLl8|vL-Ql2X@7&~@#5&na79VkK-q_q4X0hx#o-UP
zZcRJ8S&?kmbwthai9g!5QvSI)dY`Gv!8&S78IF26m*mnusU@y~%oV*TAQAQV^r{Zw8~qGY!WrEkejgdJ#i>?}|%8Ae-llsX%SRC`}y>0T%ri(VgfLaeqL
z30ajTc?pj%mclcwhboI1I?ry~NijNp85iW57?{P$mRsAhLw%y4@3#NVPX3W|CF0E~&HmnPiUpHi5<1
zR=Zs;UsP0-*?Zl+ez(2;)fS!o-0_u3HI+
zGe+C%IW9nSBC?hTKcg?~@*9cOHk*rKF325PxNkm~uec9C6$&cmiJ(gpjY&zud$Y5P
zWe8c1E6=~kn$))6Hu3%G_hW9RD^5{GrT=aCvu{wWM6g^%i>t>Xvs%scYJ|T?)CF?`EW$!!UI;(TI7WAzCL&JUinIU8t-7#$U2c3<015TUj^Wo
z?`e#Snl-1)w_2+GXFdK}b*C)`av8L&yB?_ZXs?9#KN9_Uu`q+(zUJJ+-Ch>U=$PFf
zj3z}Rwo+IW*76mpG6US2E`AO5Ougc}0$@%9tb1AZ^(@^6p;|EcGX1&NgtE73Dt0H?
z#vVJ47|Uub>746
z!!P&)&Y?GPNNdy+jZIh%HuY__O}|!X2)j;n^hWu#fkfln%LgxhLa`{nP`VfFES4qN
zi+8p0j77F3TwXD6SQrg7PUD*U84k&mSfWmj^XI!JILR!RB4k=v?zlE*YHj3e?z_c9
zhfjhVxm|m_W2E4s09rkv8z$j*3
z-QR@j>HGbdmtT1Z+LxXcZ)($X|jOmcIn
zEN}b!%eLH>4y`>htE-Jhkmg|Kfti&#v%VG%0>Q-Fp1kR4!ghYzxP6VO1;aCzwm0>9cN@33kVUf*#cs*)P#^Wvu%=TkTcL`2fC#j^_~>DOMOTy!DJPXIAIQjwwr
z*F|lVLlJJsoqu+x~Xt`VkuHReK8-NdhJEEHz|qs{7M!
z`$o3Oq!MH}pTrB$=#(Md|vL*jKG4
zuqUYZJJ+qx=XH!u`Mli>`t~W>gl)S+@rs!vTw`p|2xC)s4z?3TxIpE9`@;H$(xNh=
z03Q*?O-B&F#GrsAs6yyr*b7_|Vz;c=ZFJie+vj%j8;f#qm{W`yWULvyUbgGpm$k&}
zwerBrb`^=ZmmUC_VA0u-Ae6%a;cN_r@>2+}u;z
z8|zgifm!yyynBF2>UTh3dFfL!?t#ZLMOV?Zd=Rqgsi4Xc#34GV<+isrTU51Y79#I0
zjIA%*PQkj=nIay!KQgwb6@sxdx=|TA`tuFXql-@8Uy~R%^@%fGSYO{KeSAqGxmac|
zzehIhO5Wvjfmi$$d=>PbjEjc`&cprJ7woEbv}`@?e=7M3ndR4E*RZ>7wWzHX@6(!4
z;tYxpH;T6pnU}GW-yy}d^vShf8ejF2bEcJYu4ig3cGX)o_09EHh~jw29z@Qu{WEKS
zE-Tk%8)>yQ8EO=F>hSdv-vWVX07Ht)!
zWet)$tyL6g?B&r`pA*2pSUgW!wZE2?*P%v#MSp)Nz-@P8FCw@ipiZkbkl$r{)imC8
zmD&GY=*$kv2#majNGUeDLn}FV&Wq{sY!k&9)=r(%*}Q8IZ))n(p+SFEe}DL=AO2Vs
zau1OgIKAck(bB)Bw{3{C6aK6&WuPkS%(6fJCO$IEinn}x(1%@xHibf>zZh1v5`}m|
z7c^m~8ayqG+#0YUqEprX@jQ4lilkpTSY4vc^q!yFo7&9nY>tP#Q!hq}E%n#yRWb_e
zJZE>Mf@Y+Gzn4tORQyMB#VisMgU+53S+lfJL
z#muiylbVpnO+Otm7nJwVzpv|C=kt8ri_y@lcwXk+zL&|xPpuzrFG%+Xs5pV!
z4?3zQg0LJpdf9Q8d2%`}EXnMK_5HY-iNP2?o2RhMZ0~rf3^;RPy){KwmU_{)*x1A^
zJTotad_NZeX2%SER#$8*-1ON|u*G9K5_)kGd8i}nzGm*C?4@j=goI?%|(uidK!3F1`|IyOEghmO4a+R~})_@tjN4MwFIr-`&j6OW`R;
zGkbG8X$4=9OB)|=o!hu$6JZU9;QhLSE`p}yU2fz%S-zB@`PPkqx=t$O5|vR?lPXD^
z8XYt7WU!*_>^sdi<@H^{xHI}cOoBH*$0~c_d-XN-B@@P#&`Dfo5M^_nxkr^sucEKz
zEK93E#xTW4nOtWy&%Qs-zU|!b$=sK+?Oh`W!`%#m1%KN~iSRi-OF`w03P+9W9!k-x
zehTFdO-Y!Z4wev?!nAka!Cp{R!Qjv8QFb-w&`2T&#ww5Dpye98G+Bd1)vAI!1b;TL
zW+6{M8CS=&upf7AV#BKS!4-z827QO(OplM0M%gh5A6-RlpH%JoBy8^WA+5+`w&wVG
zK0l&4h%yZ>z13xf{K$_$xyW!@Jh$wrqIBgL>L4ivz5BAh?&O&SxI3O0YQf@(F3ay?
zTFpoN@$Hrxr*$O-wuD3(MNv`DdS^<_yztl3t(m@JuG>>O6w+Q;33b>-`@%Vufj7Hd
z%;IHE_jz?ib97&qtYgp{HEw#Bw&b2d`naSbD29g`8-JI_FTf(v|8E6{b#?IbEDa9YaZ7c%gsoM(;$O>&va{7uIgw?A=>tSEtPh
z?@)_~n9AZ<@H)ntY9h1@yaz5QRsfoK?g!oe`29cuvUUQxPvap2#WI|7ly$r5f!O5I
zUK;iKm0yZ8c&SWohwWi0@(@^Ud1l({KFknahEpK45RNL`0Y*r^KvjSG{`F?@bsHzM
zlp;a%+JF+_xK}-aVw7rG+uTFT7;q7Z`hET%UQG*aOW};vX@q`z0ZMQeB);(;{E<#x
z0i|nil`C??L6~kyJFT~@{dt;raJ1|8Y=Lc-ue=|Ii!Yh)M14jJhc_E#HBrAceGe@f
z1zq(7nqHs54V$zLc-8Ry?F;>gG{@1dq%a?zL^My2tM!_#OOuMl4aVOL-y050HuaG9
zQMfp^XpBDm&`dWf=EcssOmA9Fl?i`b>`!RcER_LlU6}6P2s`ph<0=)$XRSk(%eYQm
zGuYhK$8(SddyA~G*4Em*u*X)QSB
z%wqR^Lfw@R1-*O=*P%6Cf5H_=!@ZF0(6CxdCxiH%(u(!-`GQl8zDWaOURx9$wGevzby7X*5xMjTbWkYB@@WGiZAN9YZjC|$#uV6lA<2-jJKTh%2jl(=
zE+IQhiaPN{;Q03q9t!!1z`ipgFZ;u3E^=u$HVrAm^Ei7uzW6Vy?A1$+3S}K)TpysJ
zG*~}v-$TVKbZl=KZ@jsw$4=(dA-M4bcf@N_T)vK}H_K%KGHZccw_u@5*3+mUkPGg3
z_i*Xesv|=TE@#jO4u%?CseE=faT(uAKZgfc8sjt%?y=Gh^nWbmFi#N#X+z!*Y5I4_
zWp?Cqajzr+G;Nm4T4`nudjdF0X|m}pghgAdE2sO&XV)Bri+IqBl*^V~#vOeM|=JxArxH<(S)Bp3H4zb~UO;d?3vrt2#aYU3Y60ud6Xk
zj1Nh06|wTHg1d)JC~fJ3r$R1=j0nA|MdjAieCF%TZd%G+<+S;kwYOAOKua3a*3`)6
zjGiR#Od`!Zk%mX;--kJz)-{I@6FyLpQW2q2R;tM!@8L(+66>TshNm-Un@`VGF9)uQa*cF8w$^=rOkxTrs-Qa*m^9&g>n
zgB-cPsoy7C>$U
zVU~fXqK(rId*e)>c&2FN=#szPszl~`mIh)^r2lS(OSoC6aNX1IpI;9kCY>GK!;BoA
z=r}wa1y>OkagCS1Si~ONkKCI^628-W84x&!mHBB
z>Hb}xOCA_Z+7d5sx0N=~)sQJZxPSKsK@-OdF3F5pv@=iVbhCcD#W$rolxdsiM?eZV
zHP(r?&jXaI}s@*0W;
zdk&vPMIoBReycXw)86#M!n?J?Pvkz10mi8Zr1w#RHUdG|dv0gQ@CT5QfpyVf!wQonaq
zJaooMItH&uS1jndr1PDnNp?404S$7#4u^KD+{qdc&b$r)X{u?ceYUEzL|0Y1MiCqN
zWlCIw=9a3xp(+E}J+bb3A~c2ZbHScQ!64YTCH)oyw!l5nC~czUB@>5|$eMEpKA?@J
z-P(gp)LxSze^gEDDf(V)%Yur!sqhT3iEd8onARb@HY4k~o^{^AGV6&rjOS}yL*8s(
zzC7o;gsHi|0|%tqf>lP{BX+8tuZ`WylPyJ-1uqWNJy=24`Z9S&+aYwSQ;SwSc$ls1
zB|Oz3jNDa^cw;t#BG;~WU5X=~z@1FXEWH-N&t(qxzdt)Px?X5X=DyG9>!8eI`t_}!
zwKHHr)CR5;ji5rsj%Xn&oHl)b-m4VPztFs2XjA_p_N`$d^07Lcdm$~Wl8@hIIFY~8
z`BmG~v1gP;+B$TzEAO+M6P}kkn-8fj0Ujj>ptj!5R)?F=B;E43^0K|VYH%^}C~|+p
zsHI@v%j4xcjkm9Cz^SY<$+svgT8G2=j
ze`~zw$yWaJvuV6#d50LWD8Whxa<_v#dZI{~>P@Nn;&918^1`O(8!g|;wwQ;MbS2Xr
zF*+QS^SrXWlfkCe=2s9_F*};JaK~YD3OUaJ2wx(#Cp+%=I#S>yn5IdC?wqnMneN9KOS0I3fw|2nBCGTU5-b#>o2QV>q10^Qwlg&E^D#R^
zR!@bB#hkpOsPS}y-V=T2knwQ;R~mE)1GXIAT$R3G#2!_B!(>l(khypeIGvx&;|%T)
zuLJNNWjkmxfXDz$Ep3E~Kq9$k*SEmP0Iarp#K&`N#j%0eX$M{q<18z%xsSDRmIpQ`
zN4;O{TPINwBrL%@cmE-a0Yny
z?B-Awbu|>0R{#!FqjU|Xk!NER?J&jN=)9Ju6Gh8G#2`AcVC=Qhuod^iW!9}#;5!jr
zajMvd$u-(pBDxE4oZ0?j<5j?61p$4PJo#CIE6hXcbZKrt>ClTnpr;2X7<+BET{7!6z
z1u}N3tSy7PuEWswh#0ycyRMDR-TR-}gPJXU?0gOVQt)X-*_{SjZbmrAkaAEqEa_&8
z2Q?;-iDx!2wUNHQ(o|4>KGA$$F>9pFSJ8F!*#dIs8bYd~-x&!lpV+wP48^OO7(eGJ
zo+$c>GqVUV7$eLCu?lAfkr@^)5Mo3!p^m7)=C_y3q7urXj%Hu+%jT@k=U-7Yy8lT~
zQnQiWvCHSFGR6Fw{0g-oi^s1N-4@rTinL}sFu+-D^R51ygnDMXbVZ(ei0L
zB>KHx!jyDqcujB0@8_}+;P>q`%w&m+oDY8G8E9)cWIF$jk$idL!X(!qUSlgER)If0
zPL}iiDUqQG-0zN!$pvHLS>*ne{?-xXygHgmfxABUEqw20*syL0%SKmwZ*M79?DRK{
zSs<+N`k!gO!$(31k}WUP7tXQsjBf&J%qg$1(VCPo%KD*g^9;z~HN1BEJBEm|h9D|7
zBXg7DqGISgLB5s|cDv^vjY~`i?s^F|U@tgYQSqqT-B_S(zx{xUe9MLFZN2Uwh1ab3
z+jSnF;s!*aBhKiImG3Gpd>3l&5OJpGP0iQI#<5X|^ksY(;~yIqas9RH?E?p_XK&So
zms`G%5d6V=xsUp`p=WR|y#sxtWUp-rNw-T14xc^*XUeA#}i|9Xa(%mT_3
zp^d-Zgnq~SLZy4Fb2y{c@?s-(=S6fOsRcX(7kX53l#3JgvcMF-NBd|T5gg2M=$$3J
z7<+V=3M{Jk*^qE)-TRo%A)>)UO@}0|7S#D7tjh*6AbwbC0MpYY#X!;E<6<--x{Vml
zA-1g@qX%<~y^NlSZTu!xpWrVU@Tfb9LHW%L-!KX_lLNW`_z`%MAiYiAM*3e1FnAYG
ziL9T~-~DR=IPZanms9;E{{E=Dhz5#*eh_98^w)r3F$}>&?t6V4|Ejzjp97WVLhL-*
ze@b#5JTy$^yLwUz)D+BUKzc>|7$)&ANy1SN&nq?la|u{MJ~Bkx%J)x6Zh?mpALkA$
znI}Zee+>%!8n4tC|0&5E@bK0nig*87f8g6>@(zF~VFjRL9j}Zhl^RWxAtd
z?*H=HVDySwHmQN#?~qkgwe$grRg9_{KfywoQfSvuhtptI<75EG;dWEr7Kqfj?ucJ1=hPD3Z#WQ>)d4l7dyPy1JW
zL})O5br*12KuqrD`;>D>neVq}&^o}o;kMcmpM0fp1#nHB4Urfgr&q^2HH
zO#hvy2qEU6D+a_D!;klo@a}h9BiuByFODrCtjtp;3p%2HgW+-QI^-Gs$lLcE5acNz
zlLtKhHooegIQe_nFdz2H+w}sephRk+US?~y-qY9j9x#^(ecoo!ClCV5&?xeAZml9?
zh*6L2avZwy?_$R}FT@CdzV__-7xsK&0Ont)uIIVjC)s`c`tie|Lye|s{J$EiaLWwS+l
zL5aRh=I1y!l0&~C{^do!doU>q
zSGs5l{d*}-LA%f9ySyk+{xJ?!+PasvyudNI7Du&b%!k}v=^?4wtnVEeiAt1>3YQh$
zTSYZ@O!hqllJl$n)3o!^51O+4VNSFz7Uw6>RF-ZzS}*Kcwbqj17J1`mtVzbL%~8a`
z3L#k)+!`+PIgPMEQ;L5fs0^`cxxJBl7
zUK2VD7*0sV6i}VK%&8>xFGQ!7zYhG5Uj04Df7SBv6HI{s@4a3mr2H3F4v~vU3OGyE
zrB1ScDiJ-1BtGeyT>FX6@(Jth-Zf|sfJ7b!pGl#5Xk|a%jXhq
z#y`RCJ^(w0vmuH9a|8pqRBC-GToBxY~
zK!ErE6CUVV=Y+>`VGK&^wloAQJ2NC;vB}IXjhQd())~cfF0?VX**i(bH56XL8l
zYi0n^V5Yr^84HeSF?+&Tc_L$uqtuvohFaLe-So|(;EVgNk`sn&Ba45Bz9Nq?r19m$
znN{dmfCmtLC=jojwaU$H0j?pg6{;+xmW`j*i-SgR+hMqPR6n#lgY
zekpW01T-ARgO+P1R2OJUS(#I{Zhhgt@M)#?fXi8Dp+e{!(@*0-A)Q<>(edvvxR$na
z-6~sjd1Yv9-?nrr9MT=m1-aQfVmrhd1xoa@pdWSar88*qG?Mr##NssS4ESF;tLgTP
zbXU-O)Qw4^`PRH*4VM47_6?`&?&iEI;I|FQxFluE(EHlYZJo{_;~(GfvPJc6MDqKrqB#VEK#n7aEU8
zu=>x6(aXWjJES9yizU;ElP#f1;{PN8vU&^tna`DA4hq$jb_ngngQj(MKMH-5@?OmF~t7TqQy8(kx
zXQkRKklTqL(B1&_HV
zae;X3x?E<%8)vP3>WuVUw?XCDGJWY%i#e6<^!FB2H=4*$eN6w-c|Bkq>vaaGhFsP?
za&A*`RA+bT)>K4~kh7c8J?`5VWj^>hlSi$w}$5-zq^X3mQ$qy$l@hgDucR5+#(+Kr)Fe?cjmdm
z)J%qbi;_-@nnjTpXp9^1a%
z67BP|kJ)C`y{^NRYM@m1dEceKs2HYlkm~y3QGiZu6GX*^EU0Uzm7
z#bX;dPXS`DL&YGAMLGS8HfYD_5Q10Gyv6a&lq|QqFeXr8{da~P&eFM#11nCba`XBz
zgR(*fwH=EzS1LLs(6T(11PC(~Wh&dRj|Yg*iiW$b;C4!CpwHL)$6O?@RVqxK{%5?1
zkrWEvVe={IN+OZ4Mx)saKEIpt*oxINea;OTr{aT+&
z5~_3CND!_zV78Adw5h9Xfjaf@F{ych$$Z3;C|%Q_
zetXV$R8VK`gHIneO#8glNd$!IodY1W=Fs7!UAnhEq$p6GT2{vIqddHhEG(*EMbUrn
zXX-W6zzGdGMSArW0y-7_N?4NMg2`4Y(Mmq(XP|2H-vEVI4t~Qch}9lBxkd^*&4g%7
zbQg?mX?$G_2o?F?%pNB3jB38ILWq*-24i<){wYxMHum;-v;dCVoPKjX@uL0iQllch
zOrsw;k8Z_RyhdLS4Ve!&6U-}W%*)pYA$eNDR&Jei(*O(Y@8}M5|VVZ
zdqbX*{KsBV%Pta7Jzno~%cGF0CS2#jL}P#)AZWjgUEJg|>5eB7_6xpkxXT2((sjMv
z7YI`Rf=s4QB16JIQa$fZufa@i7CBi<}@UcCRCaXCWZP606R)BxX2Xbp~Ubg#x3CmL#ilPZZx
z42Yd)&p1J8Uz)Jf5UpS9gpq?@P|znuv&Nax8&*j
zL4o}4cR84%noO!5J`3~_Qa
zZ7js*o!r#V6Wa@xvKEwV_^x>S-_gB|k(z{k0}KAllkd!l`H1{JTXx~>BSzISWv=3P
zPyhZHzoN(s8za#F34MyDi17%b`qwT8qiS75kGsDV;vH$-gVw*wS4QvZ{)3
zo>X7zY!|Q}3*;$xbe~{|`bnk4O*2YvGz1r>kCo2roKO`&1%5__a@?F`un_b_9OIU3
zIOmC_lGjGZ)J~UcXF(Fc8h$dSPRO!ynspV&12q>wu3m
z%d&@?bz$-`ZWLxiln}WLe^2LEWLb#b2MBWVn!&<;s6Xo9+@Enu0zObmnPkp7H3Frc@X=RBwWc>VCVb6`hc8#(W*znp#4Q8P!QLI**Z{v|#Qs9jz}Yh%L*zuIYp
z0Z&bgYJmRj$=-+ob+f-h@w)ma_Ueb1efKioVD%jy&iPaPHgJ;HEINaZkhEN6jR;MP
zApIp){z;P)(R~7-P7F3QfZa<13vE>aU~bc^Qb80kM*g-0F!=(3obGO0ycyD{?qn~yb!#ihi2lNRS!;oRP9L>6
z^6EgVy5GpwYADBcFe&4fJ{`CXCq1EhodhVUz
zZ=hC3r+nV0zSK*8!XRQ3z!qxomGh}c0{98OX-X#ZA3Fe@{z*VArv|MopX&fL*50Pk
zib)Rrn&|N#BwqAA5Q#NLL5BMM{J$XMMlA4D?ws6sUnRg#MkId9N}U)6j}(M%@NaGN
zcVbIWD`TDUbg|@0)X7~H(e(g!XXn|`juB3M2x5fp6n_=-Z#aW}tu>kz$9N+K)UtMB
z=CF_TXwb*6cD9c10yrpF;Df?81=^D&>KjbZ_7TTaJJS(^mGI!wqVrGf-v4byqO!n>
zexyfviRhzK2vW6NZzAg}Qykn?)!#{Za8fYp8z|RAC%gCxgADJ6jL2#6)W1yJwh{>6
z9sniA`>GtfeMdzrt!Tvj!U<&s5ey9w{v7@pKk807po$3ZOr?sJza2QnSyZN;{LJ_~
zlo8Z7ZJ7TWPZGE=b?+M{Plj*+q?CfV)r`cA;-tYzq7M6q%bOT$fRmkr%HLsXC$*;>
zNH*yg6;hOoayh)E+b2)(=f4Hoa}HBcMP0la8%BIKG4teHj+@Vmmd}Dtl=7UO=O+ir
z074I48|Kp>1O2s9gx4;dgqT4MfD089SsM>7-N1q<(8V2{di||DfB+y!ce!0oBaa82
zV@5AkCW%)Fzw_5lb?WF^BQK2-Qp=x0{ft{Go0yt5`~Zc`XtPrwQl;B&i*mwcvmaM?
zcKQt}q6J;CAYb0oVpxcQ2^gvk21uc9*>$X@&C8Ug7Y6!7(@;tS*`9$Zua
zUB6^+zxHPJyIY0eNXhP!5VqZQjfnASF&?3?{rwEA1VP3Cc;3h_V}-60|Gebv)To2-
zxz@>8^ArQ3P#b?BWG5dw$Mdy&$mKG#ptL?g-#Q4rZd~SX$4^c2R=16zoPa4vWI9tY
zV|IA(6RThmqpjVg6q~`rpQ+1ICt?;u>S4@ib2e;2=?W^p>vC^_>zN|Z#vziaW`ccs
zaQ~nUEcP{~UVEQti|!n^qx9M_0$?`;
z?}N!~#$NkHas?}cQSv|b{0t#Umd&>P@UmcXBID)3^c69+_jYGZ+FQMb%xYT&8mO@P8NpuRo#n!u26$7<$Kgt_Q~biCgtZqq~->P^J0I$Xa7*-MPGtQY%&Tm
zpFYX=K`E>HBi)XsiS8{Us-XSxS9?7@>myu#RQ%U=c%Q-QIL%v=dq-BPJX9>Cb#`h5
zS+B)v{E7nZ;gbpmN6p`Jug1m(B7?c$pRzk_40!v{_le;5nGXYU1&tl9Yr1?JxeNoT
zX_-2K+SW6av)@i%RZ+>2KDLFe
zZ3jz|2(PpynCvyQz2Erl$_G`z61wPTO+O&H@j#@DF5U$-y-q`Pgpi4B`0dJD@HKBS
zSdv@C;3G6MTbvoTBYcZZ1a=}r%z{HCQhhJ;EFOl;VK7#K&LIZZDc^T*_71!D4aTpc
zGOF<_Of!}P4tCwQOgr>WtfTiSFi#r2!Gn34QUA;}+K9QPE8(d3G6j8*dbRZ6@4;k9
zE{RY=TfcXUr
zcQb1f@Bzq}+)em+Ae}b4lQdbxsKed9M`%35G3IKesTFvuA;-`YOA9pdW41`FF1m|o
zcKBF^Zdcb86u=o){{ge@&H@pi-Ejtg@
zLH?fZ(~d`I2tG?$gO&hu=NqiMBhAfD=TOodAl(A0BaPA$){=WR%%dPZu*dvhzJyTy
zm;xh5g$_AwA-nqS)vu*8TN;PwW>C6gMh)INa|c#Wa1NF1Ifpu^I&oY-M7we9a(Lb8
z?%t7xCl}O93>Ep1Lw1*vEY*L(RHrrA%tS(dG$;k$%&iCRNrVXZc&!7!E7F5;RfhE4
z{_a08y1v)M0^3-w5Y9rHn)kkIY
z1Eqth{$vH_v2%gKK)~s8vk-K6N#F{u$~*oD6nkiAXE)+GZ8K4zZIZ8Dq5l;&1+3F-
z<($X{YA&(T=m-Hp6*KcBt&hNqmyY_y!0RlB^n8+o$%jCq|O
zTuIRb`sjzPM{N2N{K$*ibNY-cnxU+C$&80_pdj;MSPDuF?aqC!ChMy>YECeV;UFQG
zf$@9?sXgZ8vpx0~emOVNe32nWRsGf3uQ~cV)sui@$(2Hgzr;L89PjV%e{i`;3OUX|
z7y&gw8t5qNpQawgBNYeH_Ca*$yI;7(G`E$8Pb4<-j=fj=O4QXHa
zWrkllpoKBCvBG1gaRuI1?u;N3K_?jth2zY}_id;{k%NFwd}!0n#eKj<=Q*yy7|TJ^
z-t%u1s>zg(%T9abK%khmT1flwttUIM%u;sNEHWjnZ-x-E!^Q2S`#DE4QAwCj^N^gq!O#?L_k%ib$o#x
zkkO)H%Qjo5bICGzp3~SS-aKcz__d&WS79VTDTMV19_mT#XY*_&idcuj7R%ify)UD)
zZD(=KTF6EQHTVzkT?NV`)_|2wjIgNWb(y*qBY^;n
zV{TwNT8TkRh^aPgKRFKY$_6xUX8GF4iSv^c7V&RBDd)Pt(q&90Vcc@0Wz0@^8cmL|
zB?n*?n}I2`o&@h15_XbOFM4d{_-t*;x(&hCQzj>rogrg=2<*TEJw-PY#)4pQn(qmJ
ze?{2MoD><<&O05s3dMD%MqN~)W&i#4dwWFTkh#f7sm=S1t-GMT&S3dR6RI07w|So?
zTM#&}m&r1u5CJz_Ix(^jW*
z#G-P3HV96F^#n0UUDKe0lJ%TQ*Qu(^Wg}JweRmaOpocTBUleZee(#>H69`m?2y+h;
zA0q8<1|6gP6jn2o?`@+|s5=wx_otg^X8lD>)6X3e(<^2k6t=3|52{i3gk&{qldx%q
z(UzdBecmN*ZTm_cIr?cFYjcXrQD)pPY^WLFhcNpcvmJQpLH+Kp=}~Dga}>7a|1^V%
z{MyNe16rRYtNi8&nC~p8W5}XTnk~Hrp+xC5@|5l6(5muJ_M6{5jI0V8^3gyY$K(VP
zecZ1nA_!Fwlp~|$`e;P(EiC#IOG2BV9PMJHss-**W(m?{>F^s@D-gXUvwJ#QX0X!N
zMZ)2gcD3HCgK>sL*#+Uh((fCjP=5dyYXUu-1q-!Sv?Y#R4@eT~eMpiP7kz1EqWHL?
zth*&kya^ev86-nnwO
z?kDV`0tR69Y)e{ZLXHaki
zcd+=?N*a3wmDzf}Q!dN{ne7no_V$6*v$Fl%HIkOea;aIBWUpF{D(iN^6;}B3y-o05
zeLx^_VHu$F7F;oBgi$b^UtB$;!^6K&w!x;x-jDK0Hch}MS#{K^c#$+9XAsAfu(BUfRKTbio!LQyP$6jV@_qfv&S_g=1lOt!aOK7hFf9d{pr^
zHi25|^YwU)F86XKTERopkIc&H-(O+qELrpVtd>;PT05v+)30%0Au7<*hO*Lb>w^RD
z7eQTpayGGk-%SLw4*f`LVyS^Fm^iNt!Kt6l={qV@k24?!hox#`8fZV2;4Q%o6UA$S
z+p7jXJ#z&S*AT~k9NfF+47NRr>NG20^r4{t*epbML@12xKpO$Q-R{r>HQCT=d_sYW
z*|+B>rPPzG9FJpmV>IwGG4?06e5gnae!BSu)0dub+JjjoV@nU1nL3W8Sg{~Tb{D&>
z`_@?gGp;6TTsUGLgN$(I7FHU5y5Gkm+Du*S8?RswM)~)!5AQF!Ogh;mm8l45|6yOc
z)1a~VpcvL!e8f!q)utTUGMd5h6
z*PI?aLU#Y^w1CKHZTp{;?=ME7y!_9(3xA@gDBvb+o>WBnRd<4F1Rp1l(_vmkd}$NT
zLm9R{=wb>hYotU-A~*dQOj<$~i5D`=k8i~EMx}xCo5mE-4D_gXP7HuchCDvJwkMy8GXrWIoDwCic?x6g=SgS{3+ut;%61*n(
z^D`+UDbfe#f5~E||V8=c-whE|cQ4^7BgnQR)c|!Lwg_?36GO
zooAQ8u2a0+P86s1tBVOb1z0ogv9Fi0=Zi%IXp5~LA}oFN77C6_22aq9D)!wuAstHt
z%cU10dW1D|naoCqWqz^du}xt9GG}b<(QB{jQojNNWq(
zqjSFFab5sYTCb6FrDoYS{=&Rfs
zTJ?+BquJY*MOJ^m`RJjE*oRfiNurBKP5i++-+t&DCDcxt@97nm8NG40
zV%Lggs_=*IH#rc`u>5t
z&Q!hoTW$%I+%IfY(QDZ{OPmlifDPP)mpP!Riv1zPGauNFHPstMlt-!><3P93JKx|d@R}dd!jooDTyF3zTR%*31F$)ncPIBWy9K_uym9+&0G8?R)^OE44<+d-X
z#DZU7ck^J!<@KO@M$*z8L0s%(`-n-9@7r^_!G9fS(!~Poqa9x7B8I3msveN?hjHV5
z&8%Kxj|`07SY>|i7_&7Ml>c-g@lT@X9^i&4N}~jEeA7`7o+i3J+JUYZG)navaY<<`Jy&qma+!=3opzP=zj5^ESxJ9NE1XXh*7VXOO!(@Ks-Ki9>2
z>@s!!^t`&pV1w^j<&i)GNkAdD?@Bry)hVOHqmPp$x5rb;lHO@^=5+^Vxgr*=H@q8J
z{%}|4wZSs|G+YOKGDhmO?n0362=AR|hYKz53I$5-YSNzWr6$I0W0NGOm3!N4I6q;R
zqUZEcd{r$AOyi*Rq}zEw#=W%ZbhSMq6mLQ~;=~egD;>1Scnsk&=qT*pp4)Jf`=y+^
zo~XIM$|Hy3lgvcEeb@-YQjA|*V>TPOJudU?DC3Rg!dQ>urm2|N++&FQvsCW;mtR#JSdN(!|_g=t5D3w6Nx;$e(ys36#M_u$)fb6gr0wJS(ehdcOaG`wLe6
zR)Qr14r+2$biX`^ek(m|454&#ub6#;g{&n5fF=
zKVd{Ly{Z-_Ml-!G$TU7B9QLckGGNFG*(&q>aF4g>yZ?+pxO(iKNiVAa`6eS}B+lpprdV~%J0ff4f+~v@A$6B=anY+3*r%k>i
zl$C!gMm{Pz;uq5yYhms*3U^nUoPT+6K{ME=1VZ~+e5WM+iz9K}iyhjPoEhpvE3dPD
z1=m(!bndEC)>W@iMVKCp;2ZAYhb5Y3mS^h{R^62E92b*knFBTVk}OzREsXLbkAj~Y
z(m*w8F=lU|T!JGdEVGZ!R-N&g{qE-@5v*7Uz7v9|a;YRfbI2nt9QEh!og+et@
z4ip1YqMx#MXgjaaJ6z|2S4-m(Rn+$rkmW3b+0R{mE2Kynh{_8!>eh;OQ8DIDr@_VF
zZHCq2IJ*N7!z48)Gnb!JsDQ_)vV;?yT@L7-J=ze^t-%DwzWe%~J~k({ydcUmTyRf0
zT8{HY)tfm{V7uC-;`jmbVq(5%nPxY
z9}E)O^8*$^tcV$WBlu`Huz$DU$%3*FT=ucu!$Sqs)qr+I#dYtN{{Zospvmj~DY}1hZN+@$&-v7gq
zVx|(J;_{N5Bc~ujO*nIUumxAvS45gJW+aLIri~|vNl8~rCwdg-ih3iX!hJhz?3e63lx_XY?F5Gh4U*y?VI^M0=anr!un`4*B
z>F%65{7K8Xe4h)ULs1Vg%eOF7(675GUOt76P3;c;)ypK}ULZ<&k@nkbbhH{;XrQo7
z`u+G*G`Fit?mBK%qymReD%nKb`~DAK?;Vfz`^ArQ
z8&6e$_&k;^0!
zE?~{B#vyvSIv96vb#Az~$N6B!i8@4wyLM1XZAJ3Ni9e4_xUZRFvv_@HCz31pXG0Z_
z##ZLEuvm#7?tix-%ig^98flwcj8+XY6L^=rj%jnaUCU>81Eb1nS*Qb{%Ui5aV
zh>Q#sAL9`S4Ze(dX+|UxI1cSmlT=ECAv47pgYHY_g__!h&#@OUWJ-CD@NtrKB_-uL
zDtoA6m0!C#{h(msN+NDW2|F~9c#BoX9mNnzmn2ROWU9`_|5;E*)l+^a9lrB8sj)Q1
z9qn^SoxIrUWG!t6>q~_5c;=0N2jX;>oL~-UEWiM=Qy!nn^E-*9{zxp@z*yJ@(pPiQsXklg?Kw
zNVsR>4Hfd<*JNg>V3@(~Z`eucuw)8jH-(peAv*8}OdJb$4}Rg}{dsAQt6ix3WK~wC
zdNLu&yY>yH({COAd%5E=%RPEyHwbw=)IVwkAA3`6ZQ}v6#0(|HY}(sTY>Px~$coke
z>|5BpsN)pIWebUEj!xWL
zL5DlaiNYF_b-f-@M*WGZy1G`weITj0c-H=8VYq*PS}ETP>`r~dvf9dCEw64`ST#}f
z`i{H%&bu!)f?9X52cJ;%s_J0@?J0iq&*psFJJ2S!30fjD4-E~OlXQ1?^Ek~Y(%yU=
z+Zqa;8f>Yqy9_WmIRXl%Ty&Sxo;h>1#Js&&Ynt8MlO~t$oyI9WX^N
z(k^4y%q;<3kU!5{aYhcQzrVl1Q&i3w
z8m*+q4V9IZ@}==l@(pS<5sypABErMO*q5CZeq#5v2(oG*WE6VP;2DTxk!Jtu|)oAMatd7{Z3BD5yC-V>%D@LS7cx(
zFEDpO7q#j{2^&HRK^Cw>QQK>4Yo^e4vnSs`WPY$9x%HlRsZoeG^hQq&dN{Axe=kis
zP9OE|-Mh?uVpaBITAN7k@%i2?gW)Lx#OB#+Yh7xyG!-dT$wN9aF?9t`}4Ry0Pf0q+6TU&s$=`1`piZlcP0MzgYHzR
zR8}IsLXU+$R-J0+_g=g6S(Mb&GupNC1O@RQ%N&a;%zO*HYQ>Uwg4DhHyyo66ElCB(
zgk*VprQ5{w`M%qDSJSHc$BwKj;3wK|ehf1xzP$5{_Q-Sb_%uV>o~$hIpl{3`(@B46
z?Ab0jTe#7n?tC*_EWaRRBPMDn`ogWoweK$(;-6=mcf4h-^Vk$d@h5)B!B-$IiqJc;V-Q?G)8u<4@4ixI~z
zx=CF0-FI03T7TeXFs_xS%Vbx#8LjWLGws;S6jSN#fzr%NFD&f3XGD-qx6OI&n*ER7
zH&^qAin#W6kP>x7PxUn4>MA135dNIF4^=Fo7(`L!ZAH^aakwd!lb*zpoICNg
z`LCy%kitBb?Pzs>n;JczWvIVxb2w9K$sLQf*h^Z5?iq2-)lZgm8-G?mo^wCiZWK5D
z_fvr5Oe`ap64f3kL^dgK{3vuy&ec|Eh7oh1~i1`I&By
zy~)i-j~=Do9)$F@JQSKeeo<^Qa&xHOyXFLgSgo>vYiH6ejM)na3W~UR%cDtP+-p)$
z{Mt3y7v$&7#h~o#D7vjpv1;NenW9lJgE&{b8Y2sf4AemiHww`a1_uO$#Ta@tr&GQP
z385jMutH--OPD98@th}l8-!E{M7B9S3UE4&`^p8BU6J}uU~!HP2HVTkjW3TcHHF$$
zWVEjObXp*H{cd$A|UQBh`36QJI(-g4FHpJ$}OHQ7}v{9knj9k*8>
z@J^}|WUAcSjBK5cx6`mlfAQi)ygn+~_pr(`rQgtbW&vtU_1DU*k_IsCic-l;ZtYA(
zFbm{np01pZ)?0}5K>Lu7ozB)o3!!!I1R|{x1^+-cJVf-Fx$bvWinP&;3WFE;4}5n&
z9`J0}o};cUo*GT>{bSX)%aKfoT&P(MYig2(hUE2e^wq8_hP2{7wL=3V_jPsI_I|Cz
zgk6yt*s*;>%PYO1q1PRU@;z8IViFP2b98c&^3SAm%gcd2SJKp6`j%^ObO;i=vwfg1C3OeQGvBL}Yg}+U5f)ElZy!!sUYLUwmnK*$IQfiU{B8JVxm3Y_
zz-SQ+-DQbzrP3n5-*AxdnzqXv3eZevC!kQO$rruMY>iI
zb;4z#ax~=*`g8A3Z7Dd&y`SVgkNquD;{I{B(aTyNU!ID&B>AH0%bWA<9GdL~)gGHx
zkA{jfbUw+`6fg7zeA-gl$@o5Oc$wnNqs3Q;Ec%c2<~cjJgs)J3ZBr1I5%>%7I*;#r
z$c(@+F9!skeOcSUJ~^@t&4@yU^p*LxZrEjO9B!xo$Gox6P1|ANoU$0
ziLVgD#b3~oD3V~j`0Df(#fh?ulQU-sy(Ae0Td0k0X^2IKbLb)Y2Lxb76YiFN@(9iZ
zfe2bEk(Lq$hU+qh2R}j;WdkF!We?H%0f8a7b!bA|hGtjpss;0TWOtvxcp?95dDQG%
zrGq1gQUYf5Mr&LPpqZ~Sl&dq>xUNJak$3?iAu$ui1+Qs5_oFWg+M`Q{G8AY+DwO=G
zsRY+@InnVtWAo*%Uk`=5TTBR2YH&-6+(Xs!4PAhFh)*}KE-bU#80x?+Ohhef8w#~yEZ>sQ$a}V
zVc?;oGA2HJCq*BiiWe1j3D6;gmKX7t7GwS#4jkvo-_ReURrE>@)#goMO@$8CNAGHsuD3t8D$a`g7l
zrnwoaJEx)CI_|EFOpteAzQAO!0AYs?<5wZ{?)@C3lWin1?sMX=P*<)8=2M4}}mdEk`{!Q0cgdx3gduwaNS$0iX
zE2|uxXVzf6dy35z+@appZ1T&SlPE1CZw(*l1T5R&b8unrs|1>xP~W_e(s(n-vx5<5
z9Z1@0OC!9Bem=vUfffG7slYIs?!V}i&H!yqkV`~F`%)4Xxju!vuP$_6
zi)?$#yH=p_p2u3v!k1QT@-7yBai3ltzAA-rCgnCGEw5>L)8TCM*iT5r-SRAd(EAp(
zHIcI{2tD80XVYX_ovynFaE?l(d?#x9FueLjA0M}8H5so8s@m4&Mx^zX?%Ih8_V$Hx&fp
z!TABPo(tDR@3SdHGYHpEdgAt;AMqKup0%7@0H5_ho7o(lZ2!Nap8XjJ28vYyu&cWx
z^cJ<)W3DPE;VTe(D_LfS49FHbQQqDi0PZtJC7{}W5S9Gn7MV}3bq}I-u-Jrrg4#jGvgcs_1oG8aw_i}6U
z1;@w#A;S0~k%Jw^?d|PRR4gqFD-N!!m}m^TWmM`VdXQ|tKz5kia;o*>_^fmJQh5qH
z(ceqn_e)@Lj+|Z$R=DTz{)h0}E2xUh)~3U}19krg*pDIc5VK~R(DFOs@kn`|GV%Q^
zV_(&D$0y*+E37hCpVr|1TjjDeL1M&za40b@YAww1HCdBIS}NA|@p8zw(L
ze3!=o3%KP&dSaIEmeb5@!ehr;LoZ3D1JbsAlj-Xl{=68}Wr!esjX0Y8Fgje#?($fCM
znAqq{*BSgRwL8du&rr#;I9c42!Gb2aei6GII1(4iwLX&J%usRTX#>iPI
z9+Bl6ikH_-QWg}5axi7=FHhh-z~Mtt=7};^#9Nu{D(#mLO&GGWvaZ31foABuVs@~*
zNy)Spa3gxcDvsi|*OV5II51t2)zZx+&j5F8%Dg}TzjRBvZ6=DnkEgLZH_O%u&|
z6)?-oc`K^3K@JG)*V@iQY5{++knjBC>ph>t_2gFYl4j6hqFhw|_8RouXfkjeWjcZe
zB{{;+y-Bvq0qT119r6fcZCQ4Ogqvlk{zHYc#@q!3f*cubCS^{mIQIA=WuZQ@U(7bK
zpYHVOOYI2)0yTj_LDQcCsJ1@VUYQWbct{{u#eXG+;SjqXLTlK(Ncsg)T=h$psaD^c
z$Z8k%M72e0g|uJA#T7207xXG(yD>*dT4GWbV;kTQSG~fZ%#F=|
zgScCIG88hr_qMniJ2yYptkknx59Ef)FnDk1CxpXa$7umV?X1fCVwrMjZ&7aWMLFi|
z!tbxbfS62L-xw}~DQL*S`$40ENl7`SN+Ed^sQ~e=kXKlF&aMWuj$z1_E=KEaop{_>}=5+gmH17$uZ%Hb!!+IjM
zNGx@c@lR1(%2u^BQU%;}EThy>Le&2pmhkOPYbvl
z#rS8#yWhXf0AOq{tFRmA`uzE`xk0+fO6`5jkaII%mmdP7&Ji3s#h*4RTowm@Tl>NX
zA1|~g2{}o_!{3Uixyj3WU$@MPNq9)D6)<2MhoOvF7P-yd8-cM<_>>Bkmf7<`10jKd
zjye6?37F5B(1+40_(JnNkVIRF5xte{kise8@F*#7mZ|)x^(<*%>F~8VZrpkAN?{?}E#v>AIFR$~>r1fue7Wcd6){$Fdi`62r!9|4llh6X
zUA|`l3D5$;o+9%8Lw&kf@{=c{yVGQXh-u2w)6+4O(!->Q@?Q#0Rl+KQedT~*&DV;9
z&)vAgRXulEr_Q5{H08zf=W$yY{aDQ>N9W~9`Zk4;zC$lyXnCv$
zI09b3j)cOSIOAO6=Obm-(7TImZ)+(6LkM9^Z50f*HU&eJX+ti31mjV{(dbOib_a$&;_=$H*Qs*M`1WMPhLVcv
z;jn!LgYd``pz_Q)=yLme3XH_p4M$HIyj|EDv5SHJ<#B9ZeEt=|^#X{Oo`Bf&2Cox;
zQ;r#gt~^hEXv-YAXfDINm!sH}ybj=`ELF?Fntm}Ns3Rag5n5R(h>4!A3JDFhb>uD7
ze)&4+{BHEiIr>2fv=N~!)dVIdj02jth%{|Qzi-94ykC5hrv5vI$<~lyc)-oU5m{VZ
zEZpGyBE3dxabT9tBY3MIa|pF1HaEFUXPlQm_qtv3<;ggSY_2uK``t3%mp*9ZW!*L;
ze*)Q>)m&$Sttard5M&!%_kn3s=IyBv?2Vif8M9t|No);7gYDBQBk#>9xziJZRq^CY
z1-B}5G$<)46_a^+crIAXDH*l)m8i6XY08}
zo(XSuI!+9H>6_6d;fs_AwIN2;ohj*xN_^^yg$fdAF8hf&6_vfOu6?V9G1dHhA1`5k
zR5
zApL1Zjf5{2nMqO@Ly5?Ja(wJBFZ<`!_9dZzmsO}O%w+E;*5R+raVfRE9}TX`knfrs
z)DrdAoUgWwnsM&m&*+bW0oq>)Ir$k-TuB+Xm1a{4Y7V+e5!Ho*z;`MdYtxMM7|+Gt
zc$ib;oVVw)m6s{A{j1@KQ<&NS?+0{hk67p-u&mc2rp2K?mUu+Kv+Mk$GhK~A>_
z>Fxm1%n{ON#T_&}1Q)`9@^R49YMlkO!FJ~NzY$Is2_in(33zhz(>Z{PwhC5D?4MWeZk*rz>E_v8n_Z2J?l{a9W$!nXp?TJGA#YIM>CHFC
zR?cGIBOl&`exF*g14{@#bmruhHcubyQYYT?oIvAO?XR^?!`SAUT1Xa}|IC3tf(66O
z{L^>5ylQnwP{Z;{ZV=Nez3R+3y&8)_GSYIA*k_+eK!87N4we+MC0Abjll9GIO)0tW
zQpDlyuGjrG4Mx|;$K~nh>vN3z9@WjKb`1aMdw;)dv|k-BM0D+yKFkYdX2=oSN={1R
z68L5>88thXwhfc|-ZpD_%xA;|&balz&8wd1e@w!b9TKUt+b0kVbi{CW0~
zavNS=<;|kQ-Du4`-MAqXbRWwmbz6L_?fuB7AEu7ob^d_LX@Qx(k9y8nRwI@|GUWuH
z{D^)0weUl_UbgL)wT6wm2LryQN>Ih=ZVf+GtlOZX3v%uQYG$$My~2E`5n%QLQa`;X*+c3{hb&W
z`1*oSPxp)UFM(&-uQD-7QFCZd%nj!1l$egyy06V7*u_iamEXTF{$uG88v%K-*eaU9
zJZ4M9KVgfggzZNnF>4aDxUH`dZriMd&V>1mK>+`~r<&OC}qghf;6$53a78VI{C}D-Zs?nB%y!{~`dV>^s
zf=pn4E2BFK4ZvY4boBFE55#)YwE<75@+MeEM@LOn)tI`%aXI9`@iiY95VZo99oP{$koBnJH&R@Eh)+&8Y+=DBIo;{gsQ8=O&Ypk+m<=i#%xp&bqA}5OhKAK(9K!ZjQA=
zh?I;>LX54ay@BAf)`JV%5ugVP0
zGw%j#;kx_dD--uI*_`(y&BnjKHt-e>MES);`b+o&DuWC$dfbawPd_l+L8(ptW6%HF
zlQ7eC>1RQNY`x~=R!k7@y9vYU{hO&!R4n|Peq1U2P~OaDG3K#0Ox_>Obl6|$z4xS>
zaWP#kBFFh0@V8g5UTuPz7o>%nte=#VY3!9xtG=CI|7eE98B`<-QFwMC#XmvH3rj58P%&I@~)G#e@v0OGTa~a?VG-k
z!@qZ3UJivI?Z^bPNFZpp8@HCmAjIE{-DUgd_a!!g9lqJbZ+QlL7QF7GDe(s&$tWu!
zffR-Mc*m)x(=j4pF)=LAz%mTdjPnC|39UE87$*b}T)f%_>oj|B@Cl@_Bq(9WZR0y?
zZ=XGnJn~2nGO`(MYd2O+)t+Sl=>q@BAY6=#lz4bt@qE$*Nn!q2JQrK30_DZO-&BR6@;l2uZ;X~I>+8fxA#!Wv($38{>CLb`F#bwh$hC)vY|BCw5DGTo+T|jQ)2vJ7d
zjfXGVl5Xkk{#se#d5uO(%zvvYnd8ucGyyxsw_=kyrgV~Qv@wper^rq~Iw3bjMotWX
zad)vs4&&Ut7Df+{nUN7kn*&HTZ)=7S;`!URZ4_x{MF)!_ZC)qDfzt6e2
zN3r?{6D@Bnnb~9S-&Ki-c&V{(TeM#@$;H}2SHYrBjy-*~2AI?L>C@eSSFb{|l6`a`
z?A2Fv8CbyRiXcPMQ{!qE^UzBIT|gN7VL_`R;R6oOe?0#B$GC3%%VTjt7v#7@l{{rX
z^cDUKLVV0JBVCAEVj4Hr4h8JSzD*f=uQjtwL-Gv{+BsG(uIQch*@SPoZ~#;12|C1&
zyto-iM-
z`*^#T2fL@XgCtC9Wao#9s(#2fhw(C*74z&o)924gY&emOi-3>`i0D97D^(XTotPx}
zP^ClK!&gA0I?kN%ReFLf{GN=stsIhjmdbdulN&z`r?OEY6YMlOa6WKQ5m52OJs|-i
znzS$z!f22(Ouc(~F?=@3Q~B`lSA)oQh0O>v44X`lqy4Q(frBgRU-k?S_1_1V{K|E6
zfZZ6+?pe@~b+=F)JD
zW}pJhU@9_?=hox-@rH)hrC$A9APlGzr$OmpNAwiJwTfR!ez-h<|8aeu^fzhV?H_g3
zbZ-oObU@;CQ>%IyRY-47Puq!pK>V7XX-}U%O;1Tl8J@f#fu1FTDd+*n}p#h?6WKjRJ`)TvAz66PZ0#BUTSY^>)6^)Kr^2c
z^JgEnf9SG?&5Ld%Y6@W
zDZWCRv67-;xlf3`3
zNrD1?0sibggkB|^kyF%P4`Y@7KrlAHo*$Fp2j4oc+6@_{Pp#ezOZ8gsu^G*3EDg?T
z#ZaY?`6`f!zvZ$J2_lZhD>mJ-lceD6hJnV6@N@x>=QwEK+6*-PHDIlHe1Tb6IXbk{
zDKdF(xr+pbvf<}cB_(3)n#4s-yIS@QQk=h+NU@U)s7`pAnS2c1Sk7q><4+a&H@XzJ*Q-f-^RUwQha)&~?w3WkP;-qrsI
zDS@mB4>fFww+X_to43`KNK>YvsZDrjC}YLAPfZ&zn?ELxA$&MNWPQWye?-c!)F@sRn&JispuDH{H;#(F6fsGIzXXiO#-uFxLwZERR(*QFepLCN=Ip-&FRby-W_
z11XQ6Uv$8!WX{funE2G}9Xqv=C5g!}E<<~C_ME_V&7?ichREoE$D_%dEG5T*nC$bt
zeNG5&2s*KNr~c7Ymya(-r))Q+^9Hk27`kboYgP2|LgC&84oyUE$K}UYjHxhS?aoQf
zdYt4030TcU_gNFstyHtgd=5xD>S%fUs^!!7jzz?zV1#Pu0-`m|eS_omIwpEGRS(wn
zt(6DvH!!G+FQyoio_7ekt5}H|UKihAl@tQOnc`c)doY!jwj`iJ_k`G+%}e
zujW&y#r*rtu9%|?I)Ksh?M*n${GRa3$=AI2nstXUgxU!UH|-4wDOT_KJuS22bF<%k
zJOB8D(UOG{zNSI86>w?AX06mz6MbdR@7%d_RZvhHlkBkQh@3?#$;pKQI@~HFPPS%^lgS{XOEor;>&reLk
z;KD7BzE7Rs=4GaD?&y~wnUadQOAg$(A-TmLqz5?=6_bY#Gk{y7q@iH}K9XmT!ShE^
z$ss~@y-O$%c?#6w{m1OsBys$`9p$KUf{|t%Z5kah0kv9UIjq20y|UKI9m9G*Ggbog_P`{f&R3LYxa)ul
z5{j`7V5TDbjT<+Ly>`~vRJvK}Ejp7ptG5Rl4mY`n%B*8@^{doutLK@W488a6O@IFS
zh_H5FPtPZYFSVe1$LC-82-kLVcFiN`I4qEPE=r^dh>^cigAL!
z9+#Y%g7zYZq(@^@#fWm8wb#x8>CO<-bOWEjSE)xB*Re|F_bR~YuF)o|Fp3Y%(l=p#
zlQp~1nmtD
z99F!U%l6#d#3WVj(kdpm_-ovk`C@_N}!-aNz84O!aZsK|v>;M@cYmfXek2hT+
zF_5#4Z6Ka=wtmxepJLS-e-@7&g2i1FdIB2|qD3xO(DFkODaF7
zV=Yq}JYX}Idb=|Rk?djMt$qZ{bE8CupF%g8^6Xi&)?+(_=hAKMfjGcijDag
zN^A7Ius=4W61#FeSLHP(_+g836gApPpV@BvdX5Bai?N0ua>BgFU78^}sazi4%yXJap>!Z)I^Px_#%7>H-oF#7rw*22e2GnVRvzMdN#c5pB+62A5o
zlNyg#XS|;C=I+5DDwP%Qsqh9BDX9SW=zzC};v%0}H_
zg!yY&WLc?Ah(l7>JktttW)B$wZ$*F{RgUQiS?LPL9fM?9r7F(aVEIzIDzkW21!fy}iBDFcLL8r#cc8`_Mp&g
zRDrv$Z|Z+(y3GZdD4K^^r!g_e;y~U^Q2MQbIZq8#`lBgBqmF67c|1ml_R;-rfXF-raQL|
zfqsJw#VN>n`R*uueyZ>q`mDmza21HvRl>-onjcAOZI6^Jy2UF|mJx|!LGW~u7-pTQ`H
zxQoHGykA;9<$uu`Fxq7`?HW$UkXIZCc)wfX{VNcWNV!dTxUtKn6Q(Z~wE4whX?pg4
zHD8m5`Zl8cGqP
zFfz#1^DXa8C&`cDvQ|D*(tAq#B9D5mcD{bANwI2%iJI0%%^u@0wizO=GsJ~ZyJ0L`
z8QI^ud}TSa&MO-M*VnUGDIqrHa8Fc`kcP&G!?k+SVh7zJjLSxcw
zu+a@BEN?UJXYGPaVEI1ju(}kxQqM
z#g|7=U0eE3m(HGBP(i%LsS_zI`TRmBBxna%r0cg2)2lMMp7iG#n5G#dll|U8pcjI9
zs2N5LKK0_NK_OjW99_cL6Ekw;e3#5X!OmQ?0tv>c7WM)@UY*5=tp2f!Dm@g5<(
zW;A&yaL?@Hcds0(N>XtqlEh6d1%d}2(D6+NwMUH2PY`}bTI{3k%e6vd4}p(aS%RX$35dIBm|w~wjwUUc@DzZ
zTWc#}E)UtJs+Ib^t2b|I^6>Dq-O&Qa>Z)C!QzFg7%WL+v@IkQmV~lHs3bcO}8_bL+
zusan_W8K)@PwfYTfr#iT`3rGoC>
zCsn0b^~6^r+&<94!^x*C_5EHI8ds%wmOlQfbJz$FL6Au+`0+?(;)E6Uc3q~J@K`rN
z`R-l95BG%t4`NE$vnTcN29X
z*XPj8cpLYk+K8g=caDaQGsV12GV=1RQ#DJpJhl`;t2d*?2mgp3Qdlu{Sstqsw?U1i
zGS#EN9R*xwY}|WHr3r^&t+uf9oUx&Yzw?Vlj8lNB3+9wzNY7!Sf6LL76vjAy>*%VG
zFh}LDN{iA1~06_#)tHCtldr5Bpl0F)%
zt(trh{a@8!gxapl-&ipsYs>^49>*!!`&yl&4ZaN+MUmrryMO`+hb#3u9d6vDSS`gQ
zr#R(t+ybUD_2XVybc~pg>4HzimHQoMV&qFE0$E1CSv`}-E{(Aee#4Q`-o%7)%tX%E
zhsw$|8TY^-_BG}_Oz9T_ag~*|d72q~iz*)zl3240?v-&GC|o(%ZfBK$fcCmnykH2T!%Fu%#trY=iVPpFHjhlqE
z%4i<^0SGJg#(a+s=>%vTX>L&6qU3D%9wtFy!_15Xe#^ea)!dsyA2BB{<`?DT4>
z#3PB%;{Ot~wlu^f)e|paZwok1owKXr{wuE{{_zX@-&Mn!Ugazn;Sxn&G8nrM8F_|E
z-v%;}`Y;wLbp>+sB8yz5R{aaP-Y%o>s-o;aS7k)hEMUp83OP@`9n
ze~^X0%hvdZ0LPc1NYU?}|G46GrWBTg07>isfPF!Wmr
z8N(HIuIl)`NT6J}&68N=0SU*}~c^5IXHpfUvS
zUoAC|GzfU|pHIO?S{i&jYTpu=^LX6yq*~hbqX6Z*@>2Uxi^}RX<96yPl&A-M$l1_4Ru;Si(sY^yRf<8}!H
z_+{s9Q;I=%QEdPH4shT!6+N_h8fRS>HC(uWD1U_kWRzf$K1E9Z#TUXPmKQZWkuJB~
zwHFy>H2yf6Tow#!fxxpfo@qF;4~nBw3x)%0Hm$5*PLlNLV5AAG*pTq|E`Gz-g?i}p
z==5ohto6WY49R#To9}FMekj{}!UX4D1TmXVGxHiS;<>pT0l~r4?VTVqgmN3^V~Z+#
z+EY1{CmC>`%I^gY$%zx8=}DYspy-}4S#&j}G`4Yr9(7JmX>9Q!pa+;Tq~
z3ITfRJYBmtpNJZadH*udDKUQ|x;vLP`)vcbm%B#8TBt}Ef7c8=$24#R74k8+##CDG
zvhdHo=aSgO6lr7h8Yk5av~$4j%n%1(5K`l_U;||S81aFV{Tw{@e|i;=@TE%hxSz!z
zm@=SsJovix#?6Hb)5l;tS;EjTX|9?-E-qiiF*7SGsD2BA?Vh{RckjBLVF5Q?x)LA_
zI#(%-GZckFg@5OL1~Pnwi*B&7wG?H0D$QEGRrdeqP@jV;%nPbGrr&2Jg+nwbS72CY
z3UCOM=vg0pg;DFlT*iMpe}xrYnP7wZe&mJR{F`1l9)*xj&bW{hZN-f_fZyXN_hkM^
zTtqok)zs9?pxBLv&aEFWcVKgX$9>H-PRPkTf>_IicohQpM~J$yg(;hZ;!h_u-#l%A
zAUHKh8`A@r`Kj$oj%(Mhf9Qu9l5K4n^#l|I9pws_=rd+S^b{S+J)WC
zXnBOc4Za3c-$GM^2s~7j?L}|MoGOr7{%8W;@jMTD7g*Ck!-r6TnyO+jJ2lk={GZ(#
znoGM7{i*Wpp0Ld@Uw2=OuGsF}6{<O%ggCU!h`F
z314L)VFixFSJ
zq(y?(xvA@&WColDF#RUfRt&d1N?~&0m$wPw;U)v;9hG%byhXgW3)5_Dtbq@laX2`A
zMY;*2?*|oSbc~VDkfLzk78{KLMSb}qhi<9t#`{$vrQ9qm2u2kPdj?V|s
zJQ-6lO5qt1U}3KWnw^l?IVjxx13oyUOCyQ{RB_KK2YLF~ccob{-`XwE=^M?V&peOY@)py=5cXoCP2#W9cGFn>7kWJ^;U2P#pX=vffGxe1Qa+b
z;+0evap;vRo}?GP3VKLtZ=RY=N;|x7
zOSIW^k(l!As`|PH=$mkw9@RjD3AdYexP5+-xo>pKOjk4<skU!H_o=eeOu)c&~X_)15loaAIexuia(g~+O!A4c@I
zp^=6&~RQ1Q))hxtyT>Z)Wbdsfd>_Rt>Ri)Myz0
z$k0H4?lI<-E}rS4jr07q%pWo{*q2L8f|3{4=@m*6+k(leL0glcdO^ANR#jCoXIYz?
znwHu0InyUrxc
zyhK8bj1xcZ6&=I(r6K8Q?AmB}!xI+XTP~pYbQN#Kr|q9{JK9N14+hM0j-Q3R`kX^i}j&krePUhv@qFiaZfP5V&mk;lQ=|wa}Ci_Mg=bo-rcl866C&j{-6T%gq
zA!U&_9ONCIwl!J>rtag?8G?@4o#FBf$jofV+dYM%&3+Qg>-^czIVqqa4JDRm`;&iOt%dRC>#N5^1TjPjz+$-h0WKB
z5dv3dZ-&IG;m8jf2I6zjl%3ZblQV}}_pxuK@MH;c&-+JjD-o?WT?uJ|jvjVjQpi*@
zva(vq1-_|Hvz8gi^x9Y*_LEXE%L0Ois;TxiMND&&H1XXAgZSh!NWP|$InMvH2A(vk
zV$1_nHaaHMgFUn#?P`C%81eg;O=R(kNZn0zwe6^I_Yt1Q<^mIxQJTlQ+RQ-lMyioK
z0JE=zd?{9l-0~%pk)v!1<7w-^3JShBWF~3hF>Qh6j&OFFGV9`c`v>stpq7LWnZtW)
zspQuAhq)d~vuGROAjL2eK&fH=?Y)?W{m=Cy92YV|7Omee=qJt#LuZ)o#%+GLoMbyl
zLeL61rl*n5z8TI><8|k6+68rVZ0|-q-Q%*X@xJFX1=R~|?y&Wy0J}tzao2VcYGXJh
za6*w#Y8s1Y0}&x6l}~7ZY86=g#%(lqvQX(pxsn}KchqoghNZ+NC{n2E?x~3WeD-*_
zRPJzpR(x={4ss_=8}q%^c@~?;g+~p7lt(fdRrAohhnL+)T28UpP(Kn&8P2(YBRB{t
zEVcbUHm*+(h}-bd1e_oXccnQQl_JrT$e$~mhhbpfTuBM}vB;s~{n}6g#BcLb(@sVn
z^Gv)E>f`(x62Po~`utg=2B~R~4+Yyc=J^YzpL3GV3~s;8B<-5)z*kT7M(y#3pr{Y@
zds7Wv<|FzStaOPu4TbzQsAdhF+WC8OG}wFP5>vfeIV)n9;(grihgN3#IG*s6K27pO
zcSyye@IO6<2;&t~Bopid-kc1J(2>HB#-1l{
z7Rw}pS%lZ1ROckE3l^5(`Mo$(2^3SVtk?stpLLiMG4P@<6H9y2si4a#gI$7@Wt5eb
zqhY%SFz*AIg^U1(rcAJR9xnlltzbQsE?v*I_)H}|zVdzCLdoIO?}k3c{P^ubyRAlt
zJyxSzHHRKcCp2e8-U%^7=JFbpmhrMj&lf?T5cj!vFBLnE9lVW>cw6W<$%2avW$q>85R4v+Kl^1x@2oK{nwurjQk(2bf19{
z(@+DnNzG8da^Y7I#BSjcAB~XojPTSKFrv@;Q@Evv0-_Uhnnk+n(RD+H-7Lbm^FPas
z=`!+P-7h|U`qVU5=P4Djzfd0C)1x*7EEK4D*S_%yp2s($w3j=L{y}0?UG^GB`{%M>
zXDl)yUOaWII3qp1?WX%xbTvWhEcV8XKt1A`Szsg@aAb7mtadl%gGVaN+v%Fy+9F}n
z${$@BStW;~)Je^TBQZSqh`%pjc&Uq-S)Ee%d3^nuGec{I7iU;S3o36o|Di+toG1zb
z=+hfP=1_Ed!e8U03xxc|mfe@T)e#W2Z_A;Dq$F
zu|%rVMa@HsM_h!Fk-joWHc?64wH%=c=SfViivJ?Nt*v;$86xMfZ;%*
zq|o@<PE3n|e@|fGuQ1_7ifPe)A1#
z{eM7;nwXq!YSp0FG+=6W7E@1zrTYO!EDClIBYe0gD2KVH`>&7JHO_i!vHXBg
zyKcI^>(n3Mxp3wGy@$>Aw||=J9W(f^7A}oQCyG@Ae1o~1ZS|e)K$}O1__D3hA|4(r
zgq1+wK^#}m^
zy0!B~QsZ&Q&2vBbr=;xz*!d_pSv-Z&T_4>7+Z-MTq`SYXM+jMKMm4vIZ4MCV_-slE
zdGGwop8^Eqq6FWsEo6J1v)}#>sew2%bA-P3TrV9+RpQ@B4;%XK7m;RuU_ik4N8E8C0H=ic
z08*KDMMr0h!5#RV$3;c2f)@uX7)tCTh{63P)478F8NR!P(G@BQ77b%vd^|OOPAn+;
zS_H$5WO#_O4gZT
zdwolgCbt;0hz^pHf)>_tw)X>sNkvhKsUMw*ylh`ZP!Y5|0q(o<&@+%7MC?ngB9Y^S3
zH~nvdD2em`C5T$1qL#Tw9|_JyES1Rc`wP3OT)yagd!l%@`-XnQ%vWJQF`)RR?)os0
zuy>qBd6gGC7+ShnXCFEo`5$LZJQ9TQP`<|uWN64OCk?>dAW(R5?$FG_V#MU-O+>wF
z5Mlzki^n5{!zd}I1-4;!!}KIq$4UAn2U()Ar0D=mCNANAzW}(vD{XO={>q8`=Q^0g%|s9Ze9?Em6;F
z)gLrmcW{*GpHw}}Xi8e@(W#0@fXaXXfSPfWs~g===mj?dqG+9^e82v1uHrpM;CnlQ
z3PZ)wG5?(ZNV?x$ayIH*LCeuLhk@)V7A!y4d7N}{&vx$&7KF(l;RyoG$sYluj=?Q8
zU4l9)nl2$_B)#$!^tg=#Par-Dh$L3rZs5mp*;mX92tPtwi{KC)oeJbzQzA-jXKH+i
zE>MqDFU5uKByBh|G}2fC`Tm5xhifR6>zACI)WKeu=@cPQ$s)CvW4gMZUy06E;#Ap7+@@LA}2=PdHx0!PHJsOHV4&syn3#5ZTsj=#hUw
zbjF`c>?Hz=fx7g$MIXp|X_-cE@I88PYgYh;#&PKOc+<_2LG#6%A9K&hL0h!5a3B0s
zX#D!LMO!5Hb0BhKK7RZ-TzacBA7S(;kP8pk$tt$%ncJ8d0v$D42k@$R>~t*~3DNFhHD9=yCn;
zHgVrHF*fKFd|s7)5^!BXRw4r4gJc>n_@*elPg?1%T2Fhw`JvcZZbz?13p$HW=I5!f
zE-}G-UkaM(r^l}idb7XD6KLM5SmtOf?AP5O^~!{9Dg2ol@o}
z4(@>dQ=Zxu#ny4XusHf47qFkS!fFQ+U#)xlR*^9C;>C-Irntbw=MI1}NGL;85x_`c
z{0~Z&`$ZOM2TaochW168b{3HFitsN{sG*ZoEFV?PDSa+%{F<2qxtO(s_LQYjNnrC?
z-O(qpWnKb@cVjplC$J65{nQ-SV|e1EKzIoD5?|D{Iq^AIFQ_4oZCpmUb!mZ$i>1VJ
z88=hj+@y&oc9Jzj47uPfBk84zrsi$Cn?^}MDxL*ipd(@c_@&N2u+1Y2q}4hW_0|r(
z#z5QV6s-L7be(g~_?YG@>%!f(V%z>JTx!wZiDX}rf*f3-`6nhydeMG?oh3vjaP2zq1p
zGYFyeHsHRa0le8lw*=JaHMJ$ZRthglCj1f#5JU5=a$okeBefCgzJwm2@7Om9L9&sR
zb0c1_Lv54I&eGv|zwY=*y0MNH`s1YoQ2!nJR}coa?xGy;(iN5x^)*HW|)A<2pILE*r;}}6OXfwdolu_C>)9}u(_g$HKtVd!N=b6tf
zQ9XQQ$$6$2YjbgeQPSx7Q6h`^W0`u2gV!!lYr2WF?WH%-3L`QGIG6MD2b@M({T-td
z_8Zc``^+s>u=ET)Gi58H7k^lCF`EDE^0{Rk$7;a4&-iIDB_yXZ1i>j0b|(bJ
zLj8B3-if}S?VR-z&g3Jxd3z1|gaVzJ^WO|^ekwe5^V8DADu8LgsbhQ>Sj-O^9bVor
zzr;(8sjs_J#?#;heM~qNj6rBu!i$dgEgHw3)*p|0JolUq-
zGBoTY>kW?{FG~Red`o$JJL7-C4hL8+J2kktCS6^7HM3*AsW5|LQs`YvCl9$%lpZ(^
z^^47Be5JH+SjI`(>P=_e1>@dJ9v8dxE}RA6?bsP}QxO6pQ|epm6@DCn%p0THJ(ry|
z8N;i|9=1IsMZJA^_ihzVBth{E2bl^3`_YhndKcI|=PoT6Yp)ND>&#{uRO+~tXUtYE
zNP7o>IcHDh_#F+>rfv;cP-2*Z8>{(GCtxa=mwfu9uLo@t#*(g;jJZ4G(#hG`>c-y7
zW+EakpjLO4Umu%9yc3w_y3loy^nOz1s(=^r9s2p=HhFf?Kk)`>zXn4MtIeGk&A~Ws
zR3@TK_sb}6{)FgrXJ48Bvb<;F6SA=XGGVU%zUL2cCTOO&zgY?JgIZ*{QYvW06Od5G
zlaK9I=o_?{F3izd1z*L-Oqu$DMQpmp6lp_rCh#`h7ca1(kojd|^SI0A4cH!Bxtrmk?n5QN
z+@$dVFg$FEE=b)DN1LE0&(-%aQxtP?`njm^n}q=rNK5$px!vucK!*Ck^^JL$y~bLlbc!wRubdapv%l#<+TY!d
zy-c}c;}u{jDmBk<%sFD^`=H~F=UVIFo0)Gx6g<=+)bz2tQQ6n<;OS;`g%T^?P=II&
zQT3!~D-dSs`?;7p^p-!WuMovZ3rlO;6zbP%&t&8%FXm;}I?bYGsIjsz_P3QySS|8M
z#`^l4PvqjFtK>{!cfCi96N$S{O;l~V80K})-C!DmQ^J_nrj7nc?ub-fzI+E*%xs;_
zigbsQC^F1ycbtyx=zc0b+SjVyE4)u)$UQMCtsLBcKK}uq*)1u@{AhElQ;az4z|l7M
zB5=kls2+?WM9Xk#&NX6V9UtMIk%1oJ$SO6qbmz^7SfG>z9BiG>6WhdP$#rj)wm;L6
zEsER@0}gfMDS5LMDNjOg0_ygP(qa`~Qgs|!(=Kse83;5E+`E*KEQ%3W?=)rJCC}@u1E$+#Y9{%psgC>g-kfT7-+faA
zuW_@2c`c3CjjF|djf?Zs!Zd*s?{=VtS=yh9xT5lMeHfU_vNUmu1D(&_K@}ZImdnI!
z#A@tjXzu0`L6SghWA6HASFMG1WKS?dJte?DeBph^h(f8Be`g=C8^M$o$M9LxAO1Kt
zq8Bch*M*(oA~orZnRRvErq|VXcQei&9qerDTx6#EPU81#7ersiZ~Jr*ru5!{2v>kr;ms-Z`bD*?OC>Jcu;;EY02$49=S**>SA1ilLz$2z)w
z3d(8NzxSol=2x-(Yu}Z04cwGls#h&1_Ax^cUDLtZrEx92=(dQQP6TgN}3MJ?N7
z|MmPgWg2v%&n&*-2X^U{DeSOhHcn0jYd@6bpJIi0pqEP5dX*dXTKcvP%j_Q#lmXE6Hp=$g3bPyc{B
z8`oOL%cQ4r#Wj*CY(6OIDiQPU3N4`n(u-=7$}|X)$`su}MjUdGv%;&B84?}Mw56U}
zQUT=1Tr*+lvVW1)Nf!*E61h%BXsz|dpFukSCP}Hz2nnZOul47}KNn==Ji<(-yyAAZ
zSP3eQhZ@ZKPlAVL5#kYH&WeX=>$g=wfd;Ea@<|T`^KWA#3Q2ueXaFP|s
zb=ueW3GE7o8!!2Cj`@F&YMmJyD47jtlJAzPR2G<2sV7(RH24xJ<}+81Y1&uo-z>v*0xgS_dV
zqy2S)aV6c)ON-Ahatj<0IJdpQ*zJjsa1R8X%UmOmXbAM}7sBG#k`T(;n368&qrX0%
zN-EOJvh6!1?Lb37NqU+vQ!R8bs`Z{)w(##)5<4fKeS`+y;QjCYx|H~9gS4T`Pg-wXj^mB1BnM?e~W^komBMR_-CiaQbh$7
zTsRGZ__6(a58g}^(Ux<87~`gFx^Q4YfbCS>&X?cZy6dKM>k!MVC}$TaN5rkzq}WHa
zeLa+MMUvmh@RQ#Q`@f&Gs-@n0SVv^Jr>X4*Ta|RhiFZDw6qbVkKRIa)1J0cc-_>hU
zHC8E{vyAiV9&0?ZdOFMRnOe3~_Xp(
z;VPwkq4cy9flV9Y;^iOuuRGk>-Zb?PjfgXXz1-a~ao#IdNEgZ!0LrncyLVAh(r(!m
z%*oqk+nNsv{yqVzdqjJdp1TU&4Dhx(1!QybMB`u<|kAKA|o
zsw#A5=6N{oK!or)HD)M%f0uRqyONONnTb$IrH=3|dmN!+1yQ+UKA!88^K04FjT_k#
zE$U7uDZ|1^+d{%3U+~txeU&HQsE4LFQzJs%1hd;Uz30Q?8-X(ZJvA}-sn1%2&$AoB
zl1ft2(xbr03c-mu
zfH~nCTt&BBOB)}yUt;6xkgbmz@s0Jdb59mtRK5197|1RgV_MGHT*)a+p?cDAoF=NY
zLe<11KC1CF{O^m{f<7dZT|?eNw`|@HMOCI<4CjoAD>%YA?DWk>!!)|M51OLZhkcm4c^X5>69^!V0bi3C6yp|77Kl#ldE4bKcTpbxtU2p
zCxxjyR>a8kjLcQ9HCJDNtMrBEY}tJ1lRNM3{03w+5=>J2XEDac0_5c6=4|W4Zt4P3T>g-qqPZ%GYNWzBcVDlx6jjjE0|n_iogJ(lnzdq1~Xw#kn-!%WBVAa@I!$eL`nv?M{F$y(y?D-xPAqE6d|P8x~~{Kfqb;
z-J1F8=EmG+uv^)SxFty75;=dlm}iwp>5!sP2r%0Zym*Yg69vIA$>~dIQ@Bk?a+RP+
zieWp*wcB8*qJM5;!gc)oqw4Y^S8^3))5awy^Scns6jD(7PGW-*7l)m5Zl|u-AH1tR
z8jTn)fu!hC)$iE3MyuDc;i{0(=iyv={t&6!!=}5!PFnW(xovJdJ
zSYK>osYRqcs8?)!T;?)ILSA0yy)IQeu{@%OBF9bH
z{fgD7P*-0&D96QA&=?w-y=|UNPjZN^@oCxU{D+uFQXZcl3ls1@abD|hTM)q_zAy?N
zs3*278n>@E&m9wIQJW*wnobte%kdt0al%VVlj>P-vmE<4t5e$YGLl&V^3rN=EG_6>
zOGN+C1`v5JmmXXZgA}g)8_{kF}TSa@#iFCyJZ@o%c
z<+i%m-oWN_=c)|CB{Wy-bAx3N?mV3}Wh0&$!NS1gI4;O28(Nz#uc*KI1+hpEQk9>b
znGtKZxon)(sdBES9d+LKdfEwlq1UJRZdpB^zT{JWBF6AC2fNp4j~!VN?05RpGRYKE
z@0cULdlv?6UH;KEVV{pg{~DR>QHof5M(pGALZ`bX$sA+Nl`1D%rzLVBD`(uM8pz1+
zGw*wVQE!wdX>U)@LvMps$UntIM2nu-eb4Ue3{ty^n16zm*yhWRVw#z!B;Xw^81`iuaO)c@jHlO*Jc>3?iMuo3WKN~`
z&8;oPS6A(o3|y!$UN^|%ZFN}_hx#73LIJ_VzX`GECS7CiGi=sEf_zZ<>1gZB&Z%%-
z-4D<<`=NBB{$5St!5;syO9pcUzoYfJu&$$T|76c))~YlaMDPM>TQXzBSZi;G6yxsbyA*(5b*6zqE3A3>|@1-}beN0y?fp*xM@Un<8Y(aZv
zsdCQCao|=%)H)Ce)xH@p{f11kHMKMXFWdXE4-}p^i1pe}eMy4OJ|Q9{
zHsz9^Vp7)^q|=Hm`UK$Lcfe5cjnzLFa0vp4?}xy#Zz^yux5!f``OZsJ>YK1rX`YDrt0`fuiM<)Ptr&SLpi^_lp)z2td?$8h!EW-ETHFSl>5X^8yII5XT7ZJuZS
zSdW~^#&!;T{ijk#eqs7L_7xCYWVr%~JVwk)Y{Vw~O72keLP3U2u6016(q@A-Q*GZ!
zI^Ludksw>HVAfCj#Vd27`mT3vPKPxLYZw?R)hJA0Dg9Be
z{;jCYX*|HrIoVg0-zTm0Bz=NjhEBJ=t<6Q%%9Mi2mC1}SJIB#!`OZ8pJ}~8a+%+_0
zXa3rH`EID1L`fIjqa?fRR02IORZ-pXBIhc7=>^1QG3vr{L`lVYCT8YXqb{jpRECR7
zcl84+a_n98Y<}v5&^3qCe2`QuqU$s&Twvlz6QJ+*DSS37LgWPUq*oa?Pw`MZYsA_r
zcCZ7tCQ
zqQSilOQPPR1DQr)q++*z`tCmx0tUNn
z0~b^XGwBT-d8K?Ec05I=$xVsv{kL0Nrk@bO-`tthif0V*?V%PZFEwr=ExEz
zb$=~X9Cq&MTd6A0m=_RnONuclDk{2o`*xWn4la{*#eJaehRafLulW(DNSI2brx|FT(n;Nrw%4e{=dl
zr7Utgv$jjpiGu59@~yAU(K95599lKz61wTEcfPk
zi+u?fUGahhD9Q_%$->u$orik#51%`C?wf1xh1JFe_gJyh0|Nsx6G}$kyyAY71aWsz
z8Dpz^5B1+<({R_coIZ=ueELIJhKFV@K3Cd)FM%T|)litq)qngroA1C5V%C_2v$4sA
zK4DZoaGeXH1T8#{Zyj)m(Z-e;jGcEPdW`Q@h
zUABg+94zcYz6ySq;dW6Qv?9hV5Jtb3>Us7z)jW^x_2y^pDer$7I>~o+>?3Nd*R0sL
z_FGEbkF(X~hrFaujH~-gZ)fo#%mjVJm?FL!ZC#_|@~i#rh;`p9={PIi6DLlIoQ>5>
zDG%(28uOG{EnC{_y=CDHpej
zZp69_M+y4|1F3@
z3C^;&ikSm1IRCFH6$pmyrMbz`<=;@%#9X>
zZE&&iDsGd8`Fhl}PKwDo^rFU(vrxpmdHr~RAUiqvytR!@GVpH9_(ebK7+8$|F(bF@
z&p$qTq@q#K_bcXO+|QK0zDv2yp|RH0VID#y^6dE6i?bf*IrsywNW-+U?PUN=XaVJ9
zjmpnBZXNtPXUaI7lPS#Vp9A*Bw&-$((i~VfhDV-Us#N&l~$&8OhNcPx0+_
zi}yL+(2_V=UovY$d1p){vK>g-E$DA^{KT(&jz;lIxAZGrKU^PA7&+F|6179un>}vfL9eyGR6i+q$2A6`2jhCIi>zDh?!!j-(d$HHfui%1D
zxG(!%VsVLSwE4kIAIlD-Rbi2cB=^YOGV^p~1T5GYnVKNDfzTy1V%-cM1q>Nl@@xcQ
zJ~4jVx8^F*LDGZCRUCQ_87E@-bfAm)p>=!@9PJ~ydOskkSU4}Qw?@-&u{ep#t<*e$
z487fBl%Y-_&dBRP4q|q;fM=6|fx##=0YsY#SisiG{31^I$ZbU_DXH&S_Ffs55!PB-
zVOt>2g<~9SYa{z-+OsivXRWQRkupbEUIKgokx{>jgxQE7=62g`3jxZX2YP9XZq?U}
zlhZs)_%frCQmi{Jzv95(dgwO(Z5LUF+MEVs`|N<_43nsRwU^107JHuNUd_^-*3fN1
z=;{5XE(L#XGkDXBlzznL7G4(V*n|8qEj3lhCTjx*z|fHw>Z^(9<^c96IhmT6srAZ5
zzZ%S91MD6yK$4;Pz~BFTGYM$Vk2~V^Ec(|^D`2I-^NkUI&4n0~7~6dco&E1Z4TAW@aFn(t7>0d+z}B=
z{VP|5$HtkMm|ASCS#<^nR7CWxNLubeDH`Xc2M49_G6(hwhtwX0*_g@!inALgOhtby
zg-+}Yy22^LJ}@tJ2oDc`^~71<$|~)L--8;}1ETlnK1SLFOy@soki~{&+_G}tOMHJm
z#hK^AE5KOoyw?zE0`amBv9fMTBOydgK}?xCHo?0rU
zAvy8EmTPR5Y$0(QseLIm?%Sd5=VOpN4f7qRZBq7~|C)RC5Vvr;|8>Hy&OYH&=Q={Y
zSVhELMXb@?d%F%@!A(VWC;;kLrKo+E?pkcWvV2%YvDL8wYG13vmL$?2(9RlHxDwde
zX-L>Ad<>7_WwUO4x&CiQ^wVO5CG@zk`^`}K``dT$eukq8I2SYt%uS0{ILD*Mm2l!|
zy^`(;7YwMKjP^`zN!T4Uu@`TY-ORfo&urAsuyeLT%wW;tcFX2Ffm;RbD!2q6(6(M?MV^X
zAL!AcyJU90gT;AHL6xGA(%l9XM7JID`2O=pE4uN_X!dd_>F=+P!`$&y$T*7m79
zWks2w~I$A*5vY;>8chLZOK%hq?Q;DNIfm{I?n+JOXp&`&tyPOw+X
z@%#q4BfoKK+4ZJhb~;ax0-pDM@5Bmdh}jkzf^;iGynNp+UCj3}nT0E+n@32xLP6hS
zF
zzb$;G{$IxqzS!d?GJIbXcHt|HusJ-Gl5a#CLD^!kuIcJfkICuE6?4TuzkU>`&Bs1r
z<9E?M-tFFZuKFr8>90a9Qrps$4TeT?RyH=wC7+S<2thc&k{~LE&3febO?%H6LtvcH
zQ1~~jzgVb8NR3E!32^#F4UM;X6%_*&_5N~yj)LFfsW)0Skqknn_Z8yUl8DV7&9Z7+xOltJ&`EyrLYI0k1REu;>jr9
zCzo0}M}*Rk!vX_qL=_FO$i!}#k9Ix(B4G{_u5#3=*(j_j-M7X5&Nt?H1ToTqJgDhe
z!}KaZXKgZ@QSEn>&b|zh`Sp%=9=vx{gczP7IQI?jdZ{w7N-sl#E?jx@LrYb59|+Yb`bqsRW>ebFx)knQMDXsZD!x>I4j^=Kp3g$RYc%3>QK4
zoTt><=(1ntr=`l*V*0NQe@(BIufHVwK^y<~-c{}6)ny(nry3fO92zi__@DXvDOf_@
z%$8pYKK+$MhO>jp5sd+c6>Tv9D?p&>2$0x2w3H-2lysS}y(uo31Gyg9P6iGXpp7`Zp<0R6
z@WjDf>j&eICA&Oo_;#YC8Ys!rIUj7W^HAg_S3p5xu9QlAJO^pDAQE3}lJ`%<`~~S9
zIergS{s7cLJL9Rc@i>tJr6N9@d6@T~L^idu28`f~T5T^A5nVA(7m)MZa4BhDACssK
z#qgO&&^Qq5W>I*+(1oYWwg%&|?JH%V&1Ga_a*S&Wya7?-dQ?=>Fwxs&u`5h`ksFpd
zWDHNTH^kHUV#O890oi%Ib96PS%;i}HF|?4|k*;-VP9uHCnSw)8ipeWQKf
zY^Wt)+3hY>c1u~jo7b<26Gl=DJRy|X(cF>op3j$WlgmI~bi!5hGGP>gR5E53+Btxn
z@q&*}b=1XlvCCq0S`rCT&>S(tVijO>aYkE7f&HwNt*R;B4hpWS&GotF%gU_Bp)H+f
zJ6NubaM45*Y>XsgEh^{YWIauRct`8nH)Z3{SH5{Kw&C_~gp@gc`@@OXLEUxLuMgy|
zxZRA>i#uQ$g_HPP^1J{qmHBNyCd}k8m38h|zs7-WsuQGR@(1~D**YgPZc#dFGEkIq
zMQ-(e8UEIZwI-~u4`X|$DuFmDE||fXfRN=_Tt8lOT}(GGwvO%npBOk{I{5aO1KB!f
zQg=FQ5scD@1~ez5ZL&kZe!Y&M87=#MAe3&Gi&M)QJ}Y5l6ciuc02+R4b!l-in%Saq
zAGiQW$-N(;a57~C40GVpy60@RL1
zv>6KGE!;(3tAw@hc5X3tdo&$0W2TO$*SofU{Ozq$S&*b+si*7}<10Hmsj9&GwBZ$h
z`L#1ccYdpNN~QWL)VxpvH*!9s@~cMx&b|$9-`#Bry$RDWt)pcmeKZdl`TX3fGHzP0
z0r4RF08FzP+#Du8uc~W~EX5j&5it?t)Mbk{%ZM?1Y|F%eCo?ABXM@uza1;BDznv8t
z|LdELFlN0pz2$@;(G~IX=u`@u5Hftl8o{-$o!B;F;44|6k_70<%KmR%{j}kLsH7dB
zUv;fgB?IS1UWfO$0~Oh{tSA}vlI6WEmG#-y<>!oKZi->Dm}kLC6515QQT>@9+RRgr
zX^#hT?v~TWfX7spBO+->2B`q4AlR}DmltjBXWday{weR`0*00QbYFk}iQ(0urKI9w
z9XTk#)jPCW)bdWAJc$gDa+Pn*gt3g()>U}yl(O7B^{VW+FB~?t>_2OW)dv3YVD2@)
z7Y=U^v}ISxaryQ3H8+2sznCzT*Qxzmkuj5?)#3EtH{qpujAvyw12o3F+licZXCG{m
z{^--rI2jQ1h$4pZ9NTi6lVh(>1rL)gLqLjM`BxuubGUeyPddO&+4$vgQ_#jQmcl0h
zzq|eiixx1_(&98(>5BXgQ&hyOujeouufvof*4}ohm$hm)Wo5N^S6{`iLi5(fyxDt{
z*CbSv$JEGUz+zDGQh~Y4xvXhAVN4FOh7>o1W(&-3K>0??3m>=#Xby
zv&~4y&LD~|gt-Gy=q;EQ$+*-7YDY1N@-EzX1pg!1t1uz$W^|Et5rix&OG}{~tJv;w
zU_iNa(GZrW^}--Do|&1M`Jx;zwaKZe*hq$@zgw{3sYv30BCe^cF^4f(85uE?$7Pl!
zRnYE^{S2b0L};Kk?XxkM^M3R`k%ot5eDmuT*TPDtMJjV*oz(4*k>sukE8H-=fDf-n
zewJvSTCLv<{OOv=HC5zR!BKL@Zn<#(AxAO$StOwg;?~sFzP_1`x|>5$PL2lRjnGNf0UcGiiX{ABo3xq$fmkmLf&RR5Wn~jfw-3x89NsNDDww|vxA8Jmxb(2
z*UmMhE-_?S#bO2@P604W)#@QTm08e|voZC;7^LaHId6oEb}U=oMh}i$^2_j9`^J_G
z49hw3awhH-VLCA=7i(Hk?|o^~PS}JjR&fC~l$>l4-$KDHQKiD@2{|6npg#WG^BV)x
zC1NVBgW3As9qbv4UUR2o@-ge~2z_#mJ%Qlr`jS!cMlAg!MMb|%#GfU`uDpq>hdjNI
z4~M_pTk{QAd^T0DV@#}a7oZC+YT{pat?b9Ez?PaZP>FGK$2vc?#4X$<6$pV_`u22Q
zLkoGnIoKK_gg8d$-p2*?Hc}Kfkr7JE(`){C?_Sm3U!V5N{Uj*3=L^5THBXdT#{jV>
zbo_9_d=N8LpueaP6CvG^a-+*hKWqV5xIQ1o49)k)ZzhhwqcGzo1q_N?#pxN^iQv2o>VY}H2_#Nwv!NZ(%j%E-a0am-lIM>UD-m*Ar5{{K`C
z0|E&yIz@*Rq-Ij@ALY!L`s-ZYwI9jjvBc=|^757z?N(cUfg_dFFNsBpRB;IYYfYRM
zSAvRO(I0kOjPm^wEmjFNcx#sk^irAJ&SgiHmPBS-MSA?~N?_!L1cR@GD$agCCWhG0CD`8pMuN0*)uZyF=FMt$0$KhrmK99Xy=dI{5|yE
zvFB}wECzpQB~X5!RE3E6
zg)?O)dY#@2w(eK4XU;{*&JUt7H%WKUwdWUMKZv9?7g0C*Dp*~6;xR9jkBGJJR|{!bXa8A
zXdj(dTKcjhiiOvW8%KXoL0vJ>vkjJJVvZoZxgHloNVv@cudzY2$;H=$=zT@eFU(NU
z<;rNxH$M(fJ8H%w!bj@g|H<3<^G?$1$rdGVYsZXO5m?YoWt>dU%{-ltK0ojvFcd
zuSYQ)Lq!2_L;sP@GI%=giCN8Q?=NhM#p~5d*j|zpItKfRL<_I42z3sjA?$3wxWfq)
z85WVj+w(Kruj2M)DANaD;}n7~_GllkpLT(kiBvmDiXFpd;>ysa@xYKKsVeHZy?-x2
z|9o!XM|u_j6uzFR?RQIdfRElSbGbgy0T
z2%aPE5KySBpLpuh9!J@d?XJ{OWTnu}X4H+z3OC;yp5VK%HvA?r=R9$u(%4&H&n~tr
zaA>Pf?vZW@fODUlP}Ne^Y-gSOiEd{b32DI_wor+f;s`nCtMD?78tjw(tnDqTgd3Brdxb^O2
zc!m0?v4g`(xZVQNrkbq+RtDl|FKzQXcIrmMgnZ|SXXxfu%0*?*jm1OM|o}YP1ClIvx!{F2Ak!=}?Ire?e+OMeHPsyp0dv
znEmd)sI<$FHi!Lk)&<{NDs0K5G~U)@gzi7#qr?3gTVPwbqB65F
zhlsa;Qtu?7bs44{U>2Q-b?CudG=gEu-n@)(#oqgSXe3
zQTLJRIWd6+D?X)hwukp=ZS-UhDV-teSK%LjFgFk%nP-d&r#bq_AD)X&199>HANED3|xVt!tYcX
z0_`Tx^G#T_>;L%;=WxOV8yIEt?M1SKMVd8cQ}VAlN-BC<1uc4BDT2hoG`C)ga@p8$
z_f~}4(g@WiOu!FpxxTMLOk3Y}7&(cpSA?n2^>onkQ9ekD8jFeb;umI^(Qq{l%Sa;n
zmjzG~O{NFT=;d{WtJUrxliep_kLyd8F`#B?Ne&Sw6<^Pm%^hnrUd4R;pG^64z8(!q
zy8N+zaxac*ZLb>p62uUvYT}@MzKryiB&`K=p;!FHj{6~ueVTu;ng$vWL~|ANUsLTU
z;;k#`Gh9jKH_tOrqD0t3$~(goDQo}-Hpj(W+Uo^mQ#(YEu>19jHNREZiXnH9vt&W~
z!I_HTQi7aWV#Z*TfN3rl|LMIQbO%A1{R2Nd+xmG!ZuoyLm)_#2o_izx<`g?1pOE1v
z`o{Jo+Bi=nE1IqiskPQ}*uL_Bwg~Buj=I1DoHWtox!*IsMT#uPQLuNUr{#8T4df^P
zoebY%tn7BVb0l#FhM0!|vw*V-6nXh;sH_+!WCjiE=3n(yF+^
zAa#1N^g`z6h2LA`+MTO93J`o6Y^!R}(Dsowh4&>UBIv<6qDNqXD|#eM5ND*kH$;WR
z^km4>+D{jWZBo4d?A%4dunEHs{E|b-QCpI5gZ$_TGj`@rlkN7RZG8;xxF)keK1Fho
zP2<00Ekzj)`k&K|htYFpqk;~4+@QDj8|t?DEf8RSUJ-WQ4lqbmo_H(72ib5<)ca4SH=V<2
zfZkW5TDqJ6QYo-Uq6%1I42#?-#~gVEc6|J{CPR+q3!i|)3OBMr=02N*ll@U-`2U_#
z4fNa5GY6mx*8k^EgQ)}0Y*^GO^6keNKrT(zsTv-t#sHj1jg%{~jj~RCt=iTr+4>`&
z8(d)6#e(_p;`x{Y|DB%I{8>=48S{yRDY73O0ok3hE4RATCGYDalhZ^<~W#4GP
z^LQt7S8hFuqDA(m0tMtJV^r}5oFO;2F0hE!(8@>O*dY}=w3CWK+>Ad6O(p3@?83xJ
z5q{)BeGQRZC|qXgJo|o>%S)xz>@3;UV{$CCx6E^uny^K_r?;Xl@&}YrGd$ECM;PZj
zTb}PcN*O&gAy&n(XcAMkgkzYK+Q~&@>)?`&cfu;-AdlBGAhX+x#io}NxUQNGXZg_(
z6cg)V^*dV6VaRytL-}n3QNfj7#u15-266B8i
zxs+VEmUiLH#aDGd6E0N9_eXJVFC4NqCL~w2IBMvp8jo$Q)W8W?%h;*6sZ`HT`S$Fa
z8hYo&Lo0M+$Z&W39hHM0$e)V*)v^b2xwaWxHS!Q~*9#(A(7uJpfuRG&B0nb99q*$A
zLbXT#5jIi!KHFylBdUgB1k9Z;(g~@fUhYINmmlH7Q&6BNR
zbu^LqI4@3ArfF_Uz^^^B$j>T;gj@yK&Q2V4O14FT!URJmSIxIVEs!B0P0>3@d{<#{
ztGeM-V%4$EHK&Z1-b*VaX;NVqXW{#A+zEWNo0WBQAU76683}5LCY4m|6QNxvfV@nZ
z;w1l8SA!`1Z16r_7mQc=2i2{?n(Xw*UG=g}mbx)dp^~%a)4&Z|=Wx)(iD8^7WCo7x
z6rNPiseRJ}K;B&GzW+GN{N3}wt>E?jH7xU*p__T^IPB-!#R^WQrpQhdr}+1oPtfTv
zj-%idbbi=QM0^b)e`;Mg=->ltUQLrzuN3#ehvgoGQg&xkG-e}ZlrW|suzhfAPu$^$
zJ%K>CR15|Q#n*!mF>H3@hd%RlzIDjI0n)OIWWifMhy1Zg5>h)EUu4R)74K(h08h9s
z>*48XW@%~puD>Vpm%CwfOw9RsZtID~m>*0P{xzy3Xu|hbjCAacJuqLp=v>w^*ny89
zB{Uwrn*}Ol6TJ|_yzxjZJ3_IveJ#{TpqfsOS4DO8aCHq23xX|LHDWB*Ci7brVKFKj
zfh=Cb4km#i?%QN!WEX%XfWTgkU=3^?d^c&=3*h3lYr+cQcGZ_9M$jm|L#Yyzxy4Ij
zQEs+JSe_D34FQm}OQ%DQ%7Lp=Hb5S%(Y0wd-TKCkyzpjz`oK`~?~9-9BNf=$>+0&p
zZhX)GvCM2&dS($E!HKWZ3mWqwbL|J*hP}qd1whgBn{#53`8JT0A%2x>CfZsV+Yc3+
zCCK0QL}gwi{r5824kSGz`Ek^*SNT%&HvHqr7oz&6<(Gov?Nt*%-nRhJU-irlto6u@
zGVs(7f8sTL!x1JaLi>*NJ6P&I3saZ680Rs0f{}$qR6fS8`j-7WW)jnj3WUIUn3&3^
zIR6T0KL1Sul@szgqD;C$+v!6W5w&%^z8k_Z%|jzopA4Nl&x24)boQ>y?-mho_hRSO
z%~qXodV7HTVFbFPCcW5sHQDeUJ;`^4gzW3tUVURj;;WcOtlEDw)eE5S{{$cKL?J0eT}Z^2ffDPt%EaQO-^I@7u=VJZ
zfm72qZj{AMA@^qb?$-rBC0Nw^ci*5Z1T-&4ukm6vs;RA#ccKMk&LOWNxUR_@iNx@U
zr@LLd_LY(c?^M37WMp}e`|snPLmhuF1Ss?dOHEAMgkIxxD&jq@JV}8!G4gm$eTUy5
zx+{`?_ZWa3BYkR`p^yE*#%IW8pf+M)Dn#ko`8Vv)94JQMBjU|6G!Ue3_^l-MukpbsPQyvSBSBbuQRhKGVqD8aLqq4d0mY?wLqO
zYGd{gPB<9CennzBPg#f<|JR|o8bRM*FfsY~KRIa+(bMXx7b{{in@up}`GT&lqgFf~
zuXFp?d;0TJ=|_OGwY5{X)#znF&u-}hFYO4#U0-wrn)8v-g5fPI9lXbS994cGH~9M(vF$8b3nH9#?jSTBz~<4FS<^3NrK4sN
zx|v*u4<81_6W{RKn8YZ!9)+@P{PY)=k>LXX8>GNxifvL;e5(Z$iv{vE1SrWvTOUeJ
zi*5a)zo)=fU}r|9Z7H?Moo2UdG9S2~>Y02%L#A$%%nU@TDt&)#&=myX^YqKt>sR>3
zsTxyoB7Q|K4vl}``!ZBxgp?G>@wNhlOM4|rJ{OhiGbm%kY^Dbg=OGv*i|WC~zC}Uz
zKbYCj#aLj_yRF?JNI{%PCGcbtWTF*jJrA>8>nZUh35p8hk-naLm!TdlR7Btsf&W;x
zrC-LiLvFTm$2aN-DhzV}mZCR>_06;mfM?SFJ1X)AK&EY)yJBS)wdG=W6
zM^K0`BjRK2KAX%sBF-Bm|2BU&zh>0d&G`CrLXMhxVX2%)!qal90yusTn}wYrfAHBMq9h(otoltJDL%q;r{vYcB)4Brh&C*i-sqS)
zu(Pq#WRORc+b1*Z$-ISRQ77~=E1{40Oma(cUSvGq>m4v{2-I||%zUv?`&?Q3=%wr{-*q0jlJu*oAfqPJ;_J99i
z(cJ93ePy!4Q||u(=|;(co`@$`dLNsxMs1IwgXhTcl|tB{OkDSqGB
z6Wsq}?=8ckTHm)}7zZRoKtTi~Bn1T&K?DWHpi8A2krD(Xl`fm^j*UvUbYl_H$RLf1
zv?8tKdo708zkeLh=l3}tKX|aW%$l|Cb>CN>*Lj{qQaN8`7EdM;*tgq;4<;O;2wrv1
z_Q!aUiPiR<^+FpXhQaigw`V4F)XQGnWU1};{V=lg0X(m3RLnk06!?F4#L-w`Uj*QN
zWd}AE3V-s(%!3J$(1lp&FhXm1w9k>xkN%>O7=F38<%#~tc^*>p$mV>rUE^w~!kk^X
z25A9wN|D*`vJLCupsM&>IY4EJ`U&0Xo*#?NZ76STYvfeij8KW}?w#GQ_ArlFLP&gC
zP@}3U%5OW|tEGlLTW&~u9F6LwX`lJrzqRaezEosrQ1EvKz6QT${n2mR6?7!?9TD}q
zugTw*5{s9)ax92)J9{mKCPn6S#3THZK@46sRhtJ{OUv(c#v*gf|EhhipQPYcBGh1o
zxII4&S0Z3eMPkvWwie2U_}Ybv&5-4m^OLd55|jJ1mO)3oZfMq4TfY)AXR^bUCh$&HIRW#z~DdBx&R+6X7?b9XI;v0VT&ZfnZ3+|W7^
zgt=|#(^Y4tvv_5(P-iixjg8T_NYu$<)J{{<|eBWjGBY1Oj5-05pViJO4biM(}n}
zQO7CPqNibVM^Tzr89?eCv7hM;VfZ9`DG4q6LIxdyK!ldo9_dT`xsFPA;SZO}s+|B0Q
zIc>%8se8V5;%J>SP&05mj*tCwqrz8ePZb81CWU(>tB!7xvsOe^N(|Rk^@QTck8$|7
zdtS+y{72r;8H~SwtYIu)jhR{5Px~o;2ja1#){#thJEYpHB;uS@{JtUvQS_|s2V(oYK&lntaCa)I-o}#qSC;A`WlzLKm)=+{@y+Mr|Aj@&<%k1gt
zfxc=Sa0n}Qp=`dbX=lUfK=rQWvB=8x+7BqfA9gbx4u|HRTGIb()um7pbyvB#WY-NDOKv~hGB}Yle{df^~h-bb`WW@UCtiQ?IdEe7u0pBRLl2P8T!8n|Ssd`q+
zz{;4fmmr3!wV!(f6|k7=tl;Y4bbDaKaa-$Or<*2?
zm#e7$OGl64e{K;d17W4DKZ_r|gG;}O_TQHtMH&}z@4K0a*}VU~?In-AC~ip)^!ycOjXOqp%l+qnLI+^?
z-(eg6_C|(XDGFlWPpQ=`ew*GGuhYQ|>f)6ZT;>u^%=lFOCQu6Af$={9p)>N)1Rkbar$EqdNQgxL3bayH#Xq70EVz`lLJr
z6Ffw(I3d)grp=oCr(?T>h37>H4(&MpTNwX1i$;Y@l3}mJCTHe;*nJ&d_lSXBMx#!3
zd;>xloG;|3f%v;tQhlF1>ku5-_2Yo_F!S<8rE_x^v^_Xtup6E>Bml_ycyyTvcCcvM
z6Jy5Ui-6_;OlZgm?Y1d^U5hN-j2*(ulSry^jI+kPSGfJxLNCAQ_URQOF>C3z?+1ZH
zBY@V*%F512+1TW}>5TsQaJ#(c6%*<&a}oe1p`8D}Tr!MGUFL3G&>}gF%o)b;1TWt7
zQ|XI;vmn!fm+cvg&LYe1q*VqWZzWWqzB}@qt&aZ(zo(Ir?pe|5ME+8FUJ#$Vzwamd
zgkwaJoHYmyO_y9FPJG=KnnZ$6{|wOKtCONFUKQNOtloJpZvSAp
zJVW*FI`cHD&ODv_p>hnH(NOs(qPz=gJguu|OHXbaq)iePRaF_FZqdSn%(cL%@yMlT
z8D1*W=Pq76)nO)(J?+;cBh=CP)TBwV=L=bb
z0&0e-s?pMG?IUS~TJs>74d+?_JDZbYDs{4=@
z*?aT6Zf8d;lCjIYJUrBH6k(#DsqMDL8x0(`=+5EX#0ql2w*SkP^?n{h=
z-B}-&q$?dD;nWCnarN7T$7{`t>f?g#57X)-Py1p?O10Y5M%47R>#++Bc27fOGV%3z
zY=UH>4>%NgXVWD)GEPs=&)c3i%N}=N&7U+kFS6{v&|7Agsu3H1w~?sD9BZ&DpSxn;
z@{Y78-Tt0!cekC{Yk|tM`a9E8P;Z53npidGIRvVHhp>71jp3kC+@E!AcWyYwlkj(|
z*xEgPbicr|PUsxG;!aj3TT>0n9C;3=+P&=%5m0#2(%b6M|JeHFaEv6j^z*)vr
zdMd!8GMrD#S$eqik7f&#MGs}{Yd|H?h%@)T_>=DdaA*^I!s7($(QU-SN^
zWo1#h!K}9(FI{{5sXLmv+3c)^frLX{WPJfb9Id{OnnFF;{T8Lz8JQy9zMcFe`4QK~
z@N%V)-s}-zGWm3Z62t7~6-=9T0GjDcfjj6F$k(~+GXh8fiYKotoL9;|
zq;@(eqb*q42*AE{?=7vYE-)P(yff;el^BjUEgha-1=#)FNeji6U?p5tWIwKckCG&`
zxO-dv1slh;BSCdvJaPPg7v{zv?uzivD`ILgtlc&|vKlS$)O@m6C#I(Og>pJg-OR{(
z(*-ORGSgin+Fp^UsG*ImExzff&j#7lCa&Ci{16x0*S-h0%DMbi7d@|D+W=D^^tweK
zj>bycFO|r-Jrln_K1)t;9#^vm@Ee_Hw{zxdl#sPvlZ3#6YR&xc&=4>10|`{8Sh*^R
z`lkpQ3*Gy|4D{`{)YVNtlkv!ZSGK2>OKQ4#B&n;xU^fTDn825wN9g_jvcf!&IVn91
zCBsT$#lR35uQW>v-7-3u{x924!j0ZtOzXDCq3-$0B9k$BnQIafo7h8*BPDC
z8-Soy$P*;HWEzE&E@?fqYFzG9T(M8^zfIHPRPsGimRD)N~K;V~~P|!JjZ7
zl0UCYN^+!P&?4Fkw2EQ_Lqd)SBcy*Y>>C*q^Ipi-#JtkI%u4lCS$a5j{|ok?gB^xS
zXkjp6ni1-WntRk_U3_`=lef-GXRsgOFxN6S_&fijz+=n3_l;>_SzSc82Y525h8v2R
zw8XGGE07Hk`mA@?^V9u}(?TMqV6jRZXb*PVX4tuCidoj6HWW-AW&`mk@5^0_2>vsQ
z3qQNN97Y*5D;%>mBOS8VV4y74tuPB5??sq@f&mT*WFn#$)V*c%in6m6kV)}3YSTan
za1!V%Lksw)8UyXS6>_p9pYIPgcG5_1Mha}SwL^F@FHsB1s>gm6nf5C@$LsgrO^Kpt
z@yX)gYP|(JhRoj4F-E8}OSR>Cx1S2xdo6`e=+8Ypv4Nm6|k
zm%_WD+fzf6oB3SmvuNXlVO|SYS@D=N_^YLs6argDB<769K?r`eC~PwtD;LW
zjIwj>W`16@R6vm)EX8dBc+I8Bt~Y>
z!POZP-hD7TWNDIX&V_GDXVxu}4YS5)K}SQRHkvwCN`6cw^J-(wF-HJTl>9KQ-rmk#
z%t7mXlL9(^au9E{p_>n>Ns*~RZr6)C&ww)@>wHO?*;<*ZOfU-^3Zur2S-lzOnds<3
zKub0D2a%%4BwMtoOYzo~k5RW((;CF&$kbwYUqt7zQ}Pv@3}6qp5WjHaYm(?}116a;
z#%=dEAgsQILbRCPw2H_L%>_J=Ha31OIuBhEr}epdAdB@$u+#<#S8|>2cbu
zzPABq)S$HUw+-EeGeEVRsK=5`DORr>fP^6S$APT7OEB}^n?--&-dT$xt?`Xbou8+U
zws!#Qrn|oN*mmXMY!%pm)Sl4HlOudy$#iyN>BcCLbwMeUUCgc%&kZ#-j?{R^n7^mE
zxbk@}SP$I;9=nkk@@$T{=21)2mzk~_wqx7b%vpcrVw9nBCr2)M)z%%tdIOj2-~qIT
zTS=?@PI!)PKBLA%pX8vGjU5;`6DYQtR#;S|nd-WxbCkPy9IHr}X}Mc+ngma-AoW~~
zXfzWprUq~#NK0Ke?ivi?eC;1S%o|PhY%O+RkgGJ)y=56ww+afonjjhfWBPBZQJ&-Y
zu%v#qo(>1@QNP38nZ`xYGmqT%@)6WfmP6Y+KfHPfQTg01c|>Vo4rJD!u=C3TIXT~HRO@jVsC-*r}s?Dzbm-#0fzAKAv^7M^&GMdxf^g2kgj|RF&&UI&gcjQB^O4i;
z(M$`t(v1NJBz3K?czYykr%?n~f-xF^T4;dMPi1wMAJfj`cGAH642H2sWr3I7=CKzn
z5ltu!KDRj??dWC$_Sz|5c4J&AYrn$5N#Mtie-fFqnS?nT+*^Nb^SXP42#vDs
zyPNtNty#pFNvO5a4)D$+r_P*BJpw$eBR2-fy9^KGzS0O#6&7kyWyC1PV`up_PLn+G
zBR&)xI>9g#^5?9_$nx(OJD4Fb{K*)YZbQaw`5*k!StHTnHUJ^uWs6)!Xdy_;GN=`3
zRF#MMZ6k#MHUlZNXDbio?=Vj&+@CrgVSBzI<2Ls8B*V<|XR708b{?7etS&01(HXkX
za@Vf;xHTeln27gSD^e#1a&T>t-ifBn>4wtnHbDWO!HmH+S1<e5a4MpYy1`exPEVHs{^!?k&gXNPsj7w}GQ|PEqqr*_pNy
z$HQOtL2`Rx5ye?qw3!@n9^Jpf2IgS`P`hrCSIgFiSXN6)>M3a4s2S#ed8n&nQ=P*-
zXUWbWf1Vwslh1Kz8@^Xd4=Z1lujqHgYk-(alN}Y}P|9+Ep^TpV0nWiAwE?y~n8c=K
zRJ=zh(vc_7Ftyy02irR0Fuw+;meLMaNi72JNk7+^zgc&8^bXJ`I5^0#9f?jOojp0?
zj$d)THb@kkP{;eP@)dI;f#a`%=;g)jWFnXmAF}`Ik359J*znKGUFFP
zz*eaIkphY%#X;AXiC7AVPCcVnqoTRz)%QbHzk9h?%jt4rw|ilBZZ@_rqev?&m%2zx
ztFKQ@g5ZN#`ZJbf&oc#&8Bksr&qr)Q4nylol|rFLAr`h``4{y-KrT7zNOQU##_*fvQ-s+d%w_H-kMk3OvR
znQnF;o!L+Rvs7k$jVEy(cWdu6pzuxMjQu_r6@Inf8G(1OadJu_lt&%wF($2XTq^^1
zfrwBvR5-BMe&Hvc3urOYyp#`uij+6>T3FOur%##h0@OMvCa~GDVPRot2lJNc(NURa
zk-v09U%kreLu-XefYuRt^Hn+hStqxXLkb)g?cM}FIW
zZbKDM%B++2_uSm7h(kX9{T18cc{fqa&9$VN?F+kxM_KEqPj6N<=|#e8|GD-wEAqAz
z@2OKna>7*J7;Tiz5VvqwWSz%h?45A-w{7~`<|lR=My)JKz9XQ(*YNx(XWzX7MWGa@
z_)S{wmadCDpJV(h*k315W?4F(IY@awtv2Z7wG&$BGah5^LF7hOpucqBCK!>+5am^u
zJ)3H-uovq__yPFMKc8CYiz(C-HxN`R&#kPi{A&dygAehobqYSqCBOP0q)2(cAR^JY
z{=o_AodTcNVajKLfsu#{DYhEyGYtsbZgUFiiGco;=9s_UQZ^P5OQFTWYbW
zr!LaAE%r1
zfU;HE(lYz6*vMkr?{|TWVI^X{Cac+6o$n`?ehP>i2vBX?-45jLW*Fm-VSF-U7M;DJrIJnR$QYgtZ?$a=j$L#gknDwQ9B74kDr`^|&&
ztHY~gUhnjWnNcVahcBQ|-}0{JAwv{0O8rKz$D*OFjeM<^bZY^od94CJiYLvA4=fiR
zOm*QM!YPttvWOl*@R^l{?hOD=iP$)hLKbL?j*cEHD=jURAO?PevkS$=7i$lr2bc|b
z?5TS$a;i&Elj@fJGo7}}`gUF20HobR;s)~WhaE2e0%^Vd>Cdgbb}koSC?#CLwe9XW
z&k3A$P3nS@j;KEq{sw6whlSvc_)tM1A$3sw88ixb4S16VP?0hQNzPQ83qvn3R0P|{
zZjC_0ja5Tt=P*DvYDxO=GUIu3kTmQfx+uIf6Tv2v@Fe%SF?G=`n`CTb_v@YF)y1pe
zy(y5>wmD-e9tz~gF~Z?Uxe90zULdtae%n#$j=vFEuk4DB9Xr+(Cv10pAsf(d?hCQQ
z(lC~dm>{(a36%FEJ*f@+Ep#R_DqrAbR)_@m?S$8uLbN?qX1G1tB8lrm*7pu~YS
zvw&Y|cR3Zm0;aIy(E_fQjPVrK@R?xS$h6bain$C1#>Cs%&39iGHlhWTIFY!?4Gp!F=!ZyQ0Tm@?e@76P2e3cs7t97*-8?AP%r{wB|}pWg>@^gFwdS4^5hq
zd8VR1w$Nc;Mp0)99YDEveLyV}VLx)AxHB|In?8ujcJJ)!Bp-s+<)0QFPusnYD<*JY
zr1G@xwwbbOX7}te-(isP7aoN#kVCW(%m{1H)07z=#*RtvWb5F}wP>VeWkFUl>qNPg
zkFs*j%tyTGUq0cA*&Iu_8>~GCN0On7S_O@NkW>R7`>=)*5xpEa{L*}9$BkU~I^TNn
zT@DuP^o(VyF^%wLi3aJ#w=+DV*=kdYMIa!W%R@8jCKA3P~X_OVtWEcQ86Iicx!WG
zxj6KKxvMhj^XG{|JiR&Rs`*bfR^gg8dZ!nL`}v&xb{(JsWB?bIMyR3rNUHL8j8I!t
z&!}hX*`Kkmvd>mzBTJt!XYvhkho9!7=(x&6Wy7S@9TwJ$xegN7-%_i)W7_DRVsD!ceH=Y9fCvVeq{)*36M=eA`srkArG|y#q1z)!LIN38gjfObcxl4xVb87|;3DS5NS=
z#@P39EQP0of`XWV60vwe_%7A-+aCvwq;9U^>qAvq@5s*D3P6tegA<54QKTp0XzqK2
zQfBFaNmoAYM1OdGU!TUa1_OS3CQ^|kk5|vFAxGVX{-06H+%o~&c7%Dv5jMQl?3JlN
z%quka1@swVxFr#|rT0%RXOEI;;9c5940$Q?jsWaD=fKZEy`pm7uu81UL!1$2R)aPC
zXx`Szi)LX9+U#Xf*K&QVNQv2lwNVhsFaux|gm7D26ca9UNd+>JO>P+N2FRw!0F0W)
z4SIAOYtV(u2D+Uaa59zAg&{%)_%nMwIgv7qj!xX4Kts@^wtdv#DVBbvhc&G73XQBJ
zZX4)u!w!GVAXP;9tQ50MhOhKh{9vZ$sH|Ple_n_pXkb7``!=XwEISGa@iKLtp6GfS
zA~bQe5!c!Dl!NCfFZ`Z%0YypE@V8jHZ{k?$-E-cm3ub$(53>&Ks7-wAyQk!Gs;a8(
zv;Ha{E%+u_eeAmWc=Z1Di~o8}@7KoE8S;}Pf{Geh)H}0J2LAh%qj{3-@|I_MyGB=>
ztDus&nKVqF?)N<5q0?{iCq=YI-6I)e9hJKq-i%_TghiYf^lZy9wh0YU)GUABNR%Hs
zGWWth-29S<)79cTzu8J+TWRR@Rf<7d_|R2S^+rwV=T+<@j_ezlD+$X9CdclXF?jI(x9y_-LR`}}C
ziN2yt``Mwv%5>1K0a4;>r;~ha_4zYya~}{L>@0eEX(B6*5EsO+z)5jX(!Z&UPCh+C
znum4%ZZ!Gaz1nox-!M@$L1$G|v;3!OdUoz}tBs47b}iS)Rj@^{5wype!lW2
zHhmEJs%=bX@TLmaNe@*U9@?*wcZLib3k!Pi5lYul=I%
zJs+4{5I^5kKHT(ucHm^a;@RXnhANp|d9GS66toH2RAXNF`o7L;c2Yk3nvJu;$y9Kl
z<<*kTJaOXR&t5pg=!pz4ZTCO5sM|Zz+p^ZPXL3K83ASx^GR!w06gOnE$h>+2S4BbG
z6v?ZUlowlu>QFPVh;GDp;fU}5l=Ff9^kHdTw|8MTmlZGIR&xT$hcDTTciE%8ss9+%
z(-+j-Q>y3{Y{+o>SAdA#899PHaQ*)&O9lHWG!KSyWtz=5b4B;EGT3Y
z555Ju7C8u-H~P5fmEkbXk#&7&;?$NiZmW|`Rq=PmU6cX=f8P8tKDv8_ZExk-0D^Q9
z<9E8D*~$(@D*F?1xy?q=6S3U2vL2c`W|s3fEi6pxG3MI7^oqoftQ2vWM8C~COb@|$s30ZCG(vvEJjD4dIWb0
z>qoMZ>zOf@XRj?D-*!vP2%qLhcc!kZXhm&7OV7t2;
zo5D{s^h|v{aNcO3U0ylYIk$mnsBgMd#L?*S)TbA(@3q#*{h$w&)%}`UEn}|~_0(!w
zOf%9=oC-mR
zT)e`38>q9yJ6sxDzSE)e5Mm=DHY=@I#tldDH;nY{W9N^~6G$ed9VJD1C7Ycq9c
zPf1hu(8rX(+itB#m0Xh-=rLrwjvJqb2-2JAv$ws|)7`P=JdhU21I4wW
zTwXsE_Fc7_GJDq}!7t?zYm}TQR!<_-EV1mz>J>jbQPU{&qDV?IgllbLj_&V9Yz3<=
zBMGi7TssMNCw}PKXL5W_Vm5(+j1*PbKnOcElR@sa__jY{|`_B#~4o@CRdj%IV!L;hL+wjJ?Vq$v^SCxOOdkY8$7P
z)|B`@e!V8^TuJoh`KhFSs{ifk^mQ@E)Q#0klQWu!O!jC^F-dmBt}CDZhC~mYW%7{G
zEV{hflO2y@b{bd;X*ZRwuDeW8YzSK%i2iGrxcbBjpL`mwGUKD3v1hD2dPTsFV=ZE~cQ7v)_wpRSw_rMd9Q`qy!G
zVbOB?8)V6LbPVx*#&2t)rR>dXHMe(tGEXfL)@%iDTndWHo2(ks^x`w;4`#-S1efoa
z4^MjZkt0WpI$z0zL`V0UJBTs{zW?wcx*qBUKY+R`2>7aA5bC}RJ|a3d9~%2qMy=;b
z|JP64=0B>(FUWpq>@!n&YKOa2`)$O5`o$bQNpS#0T&h_3>xlY+&QWG6R%Wl>R
zkqA*L#@swZKAK@e^Z!Lf_;rS+2^V4~mEkF)1!$1TmqMN-Qr&LG
z;IPt;T_qp-xc^~>G(yo^iX)YD;U8F%aC#Ih0tas6!
zIAKy$KI`w^%UQ%WdNRub&8a`aorN{KN+(oj1R^4K4l^FAm8P9C8)3ydM1P@~u_eP-
z4`~z>7}TMlajx`K=v#rEOJh&!Vo}=~c$N7-!zB`ytEdW=op^u(A6z#j=Cw51P^;FO
z5vvlYNZTI79mP?byaP6ab)LA7&oJo>bY@M!t7)7QQ&d%4pY!TcR@9l(;mj
zxX|vQ#%)f5?U(`clmt9*BPdOAjVF3kL)Eu`96ORhs5$I1E6T;gQ?w%G{QZ*t@l(pJ
zvzCct;VUmjdkHFLdUl_N6vc3fR_V;M4nnj@1?H-dHgmVN7~iq-0?jXbfm||o(!w`T
zm6n6Z+6bhb3mm4^I=Bu9{2Z)M2mfYV>xs{A_?`$@TLaB>i+G1OZdJ!+WrRNHiHNeR
z`qL_wo{=8epGsDkD)7vV{nUx=h}esW^sKkw+ghqXOf&Hxe*=ZN!51d%x)U#Ub8txP
zPk6n0#fE5q%g2j!qqVbRoT~H?FjM8`>h%2Ar%bX=PDZoWJ0EBNTH?9yQ1|&RRz3v;#2dwhKCg#AI&opvNX#JLkgRTVmpy~g}b
z^G1!Wt;NG8{${#>I?<$SXKs${s5#;Msq5ac9~q9#|t&ui9v>qE6djMdIl9Xbr~YuM*-&ZXHlK0Z*&!nwNOnHOGxfsrD0=-^+0+qr
z%bsVHSr-WCcY{~Y)95VBG@|BLR_2edltwz11j2Yj;lc?uIm!dI|5{qH1T2xQNOtb{j5R3`S@=idpK6YFXb?u!A>rp
zxP0=#==nkMJ6(v?$X
z-QBC9(BiIphL0~25e!@ZyMW+eZNFWA=$(WF`QoKEX%Af&-k5WXX&FlvSe-V)S5@Dn
zxOo@6Oj0O`z~;x9S9k)@CcR39xYuu%>mzcWg4d-Aa0L)}xWm*)GKq+B^IP@_AR?Y@
zTwIMgcO4wIqewlsB~`>ko)C5ZEasR&A1b*LmgsI5WiMm?$JsfnQu5d8u#)l5Smh#X51YCUbpCTuM67?+N7_!6LoCbEL7O@k)mYbO~v3!R50j
zn0JW>U)q?oLdowJ)o=1VY~&Y9gBN)J4lXzd?B_C})EOfM)XMijp%SVbcLH^~owNV}
zVLWEWaQR{0AqJ7c#yv%qp2^CNG(Z-tW_cO;MSd}#hHi`6KB_OiS@H6
z&&|W1-zWZMk(93^dY^|eB(JbZf1bX4p$q+mYX65v>dxD3W`f?tgJ6(
zDpo+M#FvII;xQ>r6UdghvEHQLJUh&$>`61|)`ec5zcenrHA6Mbw0ywmcYl$a$K!#O
z8IJVyC9(%QWkd=BB+JE&hY^+P)piY9U42n66tnb3MN`>oHU`X@VC0k4jGQq{c^
zI1~gk3#z$}j#7<8g83r>^c0+r{QRh<##B<$ySLvdCR|Y>N|`XfeN#=%*jbqX?cT0E$|FL1d4AJf5z33K75)=0LB9^sjH(xd{;)y8f
zLOyN-1?U2c9^M7St`Qd|*nFg|uFFu6%G4s&BJiP=9WrQQ-I;u>L)wpOFI-`xLsqg}+Towk5K&
z8`b3t{}J}%d0jx;4|PK;wrQf{r9|rCFVKWU(1i~s-n4d=-|gZMelv~-Wj=rJ^~1V3
zq=vyeJKNiHxTWgm#Y?GB(Ro0^X41c;82QAh&|XSHHN7fvZ{eW~)pt}{K|$~e_HI{7
z|5S0UJXHX#m%ZVY;PSes(fB1liouWxm+nvkp9`Ihp`s_|5DD8-
zK7BZ^|CR3Vs`WD)`=Jft75?6%8O=77oU)gWRU9m
zG4cGm@_jW~|3gjOk^fXRDKIa?gPUaFlYMqH>U><0q8QI@fz7&W+Xtx0XJYPKYs1@!
z0Y1LmMjKp@;e7yD@-LHeTHcs?Vm3iSjq_70Ypwmz=yabqtMB$YzhBsWUx;yZES|XY
z_3h(ZAi!>F8W}64?LSmx5lKtjua&DHFi{lsZ&-%??@($AplO*=jSe^-%
z?b4#9(LmnqYxGjFj8KW|dN99DDD$rhLn_IuL&X*m;a?td3Ey(69ctT;;qg$Zr_UPH
zdM5c2{i}%Q<%p(x$@0@^^ekc{uh-JmO;Jy37PX406l~41EOjqi?37QppXMTi*ZR6^
zV{`Mp5~7xuPM7$}n8YqmbUohhDU1+-H4c~{)PJh>7Y*K0{ft*s|XUNc&-HnGdDd^dp+wo$Z0%vc=qcPRXh%6|fdN78SxmI?Q&CdhsLT3|vhHvBYN_zQ3cbFLHq;&&x!hGvuDERJFq$D=i`2yH0)*Bd_UbAI*~*-Ml6&s+esTBn{_B^@Cum1bTeRPGfc{&7XU
zTuE{(X<@(Mynm+dheDfCXz7@PL@hB&c=(tMJ+y3uwKL=!J
z%GNj4(Q(WaiER9aUh*>?y0%A~`m%3Ym0aPsX&3xC#(Dr}oA>VwazsfaJDCxj^1~Do
zge<&2@A!B?#I}5tqq|rumN!AA%;DRCZ_kzP36dY&f9$=VgphuZ-R#W==wz-D`oPZ-x!A+Y8$FZ-kQi_w_=15-B{d
zC>rRDM2>n~;T8U_6CD2X`cy#U@TaGZ2URy*EdxV)#NAr`464{Xw3@ZsF}u5MZ{IC=lAWC7a!%*ZKHebF~$8d%xvx-$%0lI-I1wfzi@t$^ag7Ad8u#8;rV(fY5_gCXcS8GIU
zc~0nb*9BSc9Ooagp+!}NHS?ved5a{$8MQBU`d!59_ao}P=MR91YB|T0FaV0_7$FsO(B!i??HG*F=8{
zl_1=dHyYryEv>d_&&CoIyfXBc?&$hIezX_e*-H6biMXo!;P~TB#-V@tmEEthPeQV(
z_hTwVP3S?m6!iGak6SqzmQ~}
zLfu(&=baGoQ{W}}A5Wi`8Og(Br+E$06;Q1h1>xY#6PF*h3!DQKlNBh1HMX?{c5`&`
zqWh?$E>6&C=CASe>X*N4sVpNl=Fk5$^yKp0cm2(uuKc&njA8CW`5BPekt5_=2pSA9
zo?%Q|f9h?A-Bv*1CHN_$v-DvG5vs8_H&38`QT~3<37&u{Xy7xJrlNCXDw{U*!_jd|
zGmT}kUw4@W|NB-}1iY$X^I$cU?iw2#gZr&(be|k%;70mzFfE{rwE1EBgmj_z)M5Mw
z#M}K6&Kl;f^PgVnzda`tqP5Web22@4wAG49*2Goy+RIK!-%;0oU9wljyBm4;RWP?t
zqN7-t{d9A1C`X8(%q6q6Bp^jncV3?15-E4+E4+)u%@biLMx_`X+pohvLY9;zxYf`X
z+DE3I5wOh3cm=-MD>m(0zxyzPi9PFh9THP69*Dps(tCS*Zzr-CG={MAw7vt78Vdzq
zplm=TNAG;`t43bspCq)*2aOA;!aek+BCVHxb{*Wsk?iboW-2e4P>#nT@s%Lxg+K?D
zj<#?8gdv?VV_Df3TUIXmkWBh+q!wJ`3qz|bNd&B1lu6RNT%cqU^)z%!0teOEJukRo
z-3{3CPm;S8^>RyY-%eOvT|FlJ{rh(brmwQ=g4{YGVY~AV|FLeh>7>W%
zu-#Y#q}UDA2w7ti9|S|6rI25cInAtMr}gZL6W2wb>edU^Z+Xt8ijq
zMIoat$Uw#66Bn65WYPLHu>SFAeO&s7K&JVp+3dIhFagYifLV@21v~)P%8-k-@5api
zKu>qB7;z6=cVdI}1xMB40sAfm{@ZUKagcS4#BQEIXxK6`GG56=^4flVOw+_uGQcu7
zx2{`79PvpHK@D%NkBfhLLPjrt1G+eht(Rsm{{>t>mu`h)k@mZy+LUKyWL3v17dz#U
zs^TX=$SbTB&LR&OyEVQ^Hl{U_OR3$D=$?pgOez&X;$Lz5&PTssYhW|eA-xyeS~T}r
zS*a05Ef8Qk!r8{*Kd#mO$cKjLI&l13Tz7h>{s)v(ji9o}@4o)R)2^H^+3HCqXe>7Pv+<8^*?*)p{ZnIfNfN!t*RhJf8vkG@7*w)i)ClN;
z8;`KnK?
zK9SRl90
zLGlPOx7Da+Tb^g>R@NO+>UvHRfOH)N0j+A{w5hiD2=BvCrPG*8@)DsKjmDAujVurQ
zt`T#<0KZO2NdcY5V*+1C2moJ(lsdlsjx(t9CK%(pwfc{ixU@x#uw4qwTZxW&i&*v*
z{*HTg>jYmCt172L%;+EITXkJD8fCVxXP^PZ==%GLCITaX9s@q;uEI|u}6BIVvP(2_D=;~QmAYIO0Xl>23QQqWonBbBUOr+PZq!4$yD
zFN)+!kA0y!SN4@jr-&}COX|=+j>*=}ojVIwf
zAeu;f{K1zd)~RRlKq%o&-s(Sw=X>;QZ3`~ZUEz7hUAuHLD=vpueq86Xg#Y65%_?L0
z&;Z-@k3!WaH}xxZ2c@~K(e^*gHguDGbrbAbg^OS4k!!7GB}HdR*vts!eKp5tC{uxf
z3UwVDiBQM;JZ5hx?f9VTV3KmMquz^H8Y*sX}c_`W|n!yB9q%*O7GLkznOxt&&YMOtw=e
zwU;J!X_@RywL1(%wFpqsX>`}9Ob^6bS1m$4oIEd=qKQK!@4d`VnWq8$qDw{MM8jjXl{uZiBsTq-y4
zH|QLvWR;A9*CzL8b!qxQ)nhkas)tM6>MfDnRhx+pSWN}3B;|VaYE}~KpnzcFyEl!o
zPG9Np8G;u->2G$r9&QizZ8_TGJ;sv1q$R#J`K?(0Z<9JA02bjgTcs{AvI(k{{bWD1
z43yu`e0=}>XiFGWkCxPHR>S|g{RUM@3HwKH!b^{Vaa_s5cZk=oLTaj3YE>^)$BlYC
zGhmc`OpC(BP02S7&>U)}D}m{{CMGFPyu7?tH?^w-rL8I19Q5#YN3Ke}2@y%f>v`JR
zJ6l(*l}jFDuR_|mfdWyzV3;($DYo^u?O-MQjRR>SWS+|DQn(3<#MEdBch7;JRR6cS%=5k49n$
zxOV^$S<+{fLy+BBI_5d_y3lT1QF++fZCaaW3V?ie-n_1G9Rl)86wlJ|ST$Ii=o8*L
z92O-@&Ou`2ey<`UxbyKrfMs2MsCb<#=V*JdtjJa;SW+GJ2izwZ@pH((+W2+fTKp8j
zkwf`w_O>puMyhMOwwSgykA~En2`c>Z_Gk~Se8b0O;r1{tvsuyW80|^e>QEjCVQCY&
z`|ks5j=v3J>WY|;vyYE=blhzT-PD-~J4t6$bfgC*$8sU@z{Uv;U&iV2x5Y<#yo>Dz
zY~*Kem2W{4f2(0^>-dFxQQ*p|GjqzD1fE!UU0My(`WOIDqT3k>uGX3$>bz-ye8S~k
zzZ=n)9_0KzD+rE1ve4T+A)xl{W73w(a&Q|LYA!ome>23LQR3w~DW@+IpX`)-jX=QD
z3exm&Z^6lf-(lVW(#QN7c^kL;W(S|7Yt^lvm@p%Z_fev$>gxX>&;ZLX;u0Xa(XL>d
z>p3+47Xp!J&lp~_H$XL9agLanc$rD7-j9}5MEvCtcUH+06H`-PLKDG}j0O8?u@D!6
zML0^FIxatp3S3sK7V@-SdR%Y(^y&NppB+!0is7uL`k|ic9*e5O)$Nlki*EqCmMR}@
zC=`WQP&;~O`ad2UJs!~n+4jNLbVnV#QWWOhWXpx_9
zxoYQ7s|0^R=aFJ7on?`e^Xic&Y?xQ$edG`?|eKYqoCj~9NGGrIi3!)RZDkjvT~qJbS3U@
zNOt|wgGap2(jJse=<+#Vn)sZq{IlbXSCc{FB{V`&0e|pMuRZ2-1>xYvB4%c#=9$kU
z8SckE6If+c^et}vS?bZZJ|?_qeX0lL;s2#?vwwJ#0~(YUhKY-eS6vJSN^QpM{t=`;
z)Z_hSYQaG3W#WOQ2Q|D_Q;DTG7h{B8Tq)o{Wd#FzDSh>;*0^#9^Xc>j;t5Lwk%O`B
zNmx7*VtfzS^_z6@*4k3V6K$RW2JOLqei}2b;s?}x9j?dnTD=xO_^Oq&wurfSO=rtv
zT7^=?utjU8py-$#kD0>9!8O6!9PtCIQmSMbQ-g=RU{_lBCn>`aJTj}Opm>7xr$s08zh@8J6(g59Yjwc4i7J?{FwWI
z$`HuvPSKPq%}zhB(cup~@0Vd4PKr!#8I!Q_GM6;E6DS5imZ99YIX9G1jhlH-jIR%2
zHXENeH($D>9afj%UZXHNI;skxs5}`@oJRRl!lHo*;t1K!;y{i+oPkq*i4K6x&x14F
zcjnZo+tJ2QC|seSdM5rgoI$3@!ZP6zk90gn!oQT!y;y_9yQ)L}4CVP+?t)&Y{UA_%
z98R_SjCVC0q*5dGV%Cd@H*E=;JE^vR0`N>XdTz+jcz0GpXPSi*BLI-4@=qZ&LVmNg
zO=gc_^i(aqw!a5Pl5w?n#5o-wh|S~I72|KeGv7ig=*0`%fw=H-QdTvUXhBk?&GnYo
z$U!Q<^iDKRWnnBm@?P9xwC%uk>ir{#T6qh5GEi{BZt&-Qv_wm&ZDO_NbifE?y=Sd|Jv9^8w53{%VA?3`dDtd@?+mQh)i<
zwrikK213PGmEOdAC=DZ|(!sVo>nh(OXS7+QrG6c#n400#Ju;q^qN(2s)zjP0>ZdY&
z>60|n6Uw--SFO)gR-LRwOs#}+YXHp8v2A%iiZq@vkuM@gWshq
z3%Dhqh_k@2C**OVfN&f-H-0FP_X1dCN!Fe$&$n%fLch&(jU1Pi7#
z3Pm5}m#>BY7%U{IF%4+J8{C*PZjCkZLYJjq6>bB4GayLpK24-U<@U7O%k{yZ-O
z1_CfSA`t^5bXG(l1)W@Khbg3=#!2taA!E4@3$32DB^@&!OibK)1A)TTL_Dft4^K-s
zYb4nbG6UrT3qVmU9p;O@yGwH6L3<`kN9R1D2h_k+8_;AtMBzM
z>3wCStyo5)TIh0VI2EM>2OgwwCa%ag5if(AL7$*M*cd1y9Mqr>eB}aC7d@WKWwx{3
zyakCuo)k`T^TBPcp5*lsO^{^R2bAjog0SG%LqW8hC+%F$cWZKLqPggRY=<YD1?Xq@t
zI4X>-s1(J>w8zh)oW$CcHl5iUG2}&ju@XlU0AXp
zEKf?ZatHRdI^SYWT3UV86Y&pSbt4XuI`W9s!#x>2+sw0Zdrsc|vS_Gl@ai$@l^wsU
zc3aPCjNf!5XP|{xH2`ZjLpgFp7Ym+fM2@Sk;`q6NYl^hDI&0A63;fEp_b*_UWtIru
zEt?u*w5iZlv@7UR<~w|+-`VMhv9T}N5B#JLjG+!Y#QM0J;i1rhvyzLbS!kp7`e2Q%
zJ$kh@b~HJPI%v}ouL1*jYUTx~dsX0QV1Vfm@_g+$wa|!l(hi$UkJMGvPRVUcA&U5F
zY`M6A*U2{CUwSBeW7KMvLslL_>SqQ=x|Uh|fJV^zdxjGZ2757EkCgWxmVT349?Lj^
z33(*stl`_o*8GU}`>n{dJxd?QwVo4*CN_HeuiKQtYTvQrK*9Uwwl+;Z%Auh7=BcOK
zOvBq$ay_Fq?>hdn>Txx7aa8;H#B43MT1qF6&oOE1iEdyKwtQ>1=)L*!0CrO3@!-g6
zUg|&PXzD)O_umVbF5~GTl42e6=cZ=@lFq1gBxY7>^$5!Z*jpWgEn5vk2e1?@BP5FZ
ztFK?H6H7BzO@4b9LGjpGn=gPZ%1+S8KpBXYsz_HOH$
zq!~2sdZTfs6W5@*r54poVxu0EL6PFuR>LiN1rY|lon&&`EdAEZd|!$iZ`BETDPb>2
zn3z>jUedzV;rX@q(~Xb3akPl)vu<
zzH@E3F2t$L%B>s9ff$629D;r0u7bE%MnT)}xp!|=1M2AXvA|!$POC+6=!?k`di{z*
z9FjXUU@r6@WyM)6$s~pq`J{7lm<6yC1Z|g=&eg{l`x7`IeHf`^%sf?Tkw*4x=*Y&meUX&mSr=<#ux7_qtIHx1&ejCw_4SsN+NG3E$eoF40;Kec
z525;f1$A>L>%w#Y6nqW*Z@O$zc$aTo6&H5&P@S##(E7^Q=!pK77cU-x{MQehf+ndf
z76Qk|&7f&YZj6fL{bthjmz<&rI*ecV3ysB6=ok
z7PvDvmU#!ZUjH~|z75?w&aa*m7S9qk_71YKNwQ?0&Dw4zqEw0xJUm(Q;`b%j-sRlm
zdSLOiSWA*oxjW~V6Z)x01fR9nVBicY6@o<y&*w
z$PZrX=A^~F4hb~EAHLS!TGDDa+z;oFn2ZJQjQpT)BGFh3k=``)E(e4qE_Tc*-?eO=
zZ2qr3zRHzcX_ZIQSl+-x+F>1RUIa=^u_fxdA~X6NVp1L=7#X1
z&5w_+oQ;n1fkkTQ-^mUaV8bZgx4PJ_9u+?Qbpp5xs6CRe{z+?C%G{lSxKeJlusQF>
zmf}p&G&r4!lA9t{LZQ#X&kK+$UR%*>?d`*6CW>TAH=OeM`{kvE;ac5R@TSD_yeU^E
z*h*Ws5EEmA!>f$<&pyDjN#`Ao*7jZ20CK#$Z$4bJx$+uDMx_u2!fNY^gT_jmy#DP*
z=(A$?CO&I(q)`AJXQB+
zqhb%v1OFfLe@?3Z@sQU!j2=30pit9q#UbJ!cevq%>>y+MpvWE>%YU6V$V6rf1{6_d
axiUXUIpA*IvP@bBFRY=7LH-H*n|}ey=Oq{b

diff --git a/priv/zstd/doc/images/linux-4.7-12-decompress.png b/priv/zstd/doc/images/linux-4.7-12-decompress.png
deleted file mode 100644
index c99ff9809d540440e09e1a88a9bbb75bfb52af7e..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 56215
zcmeFaXF$_i6F#Vj4MjzobgXoc-irkgQL1zZ7^L^!K`aOfRi#K5L`0g@&_N|Zx)6Gm
z4njbBhdn>MdarNz@3;N1yM9n3A;~#2bLPxEGxH=sNkNvFh??lYfdj;Hw{EH&I6ycH
z{;(c90)F!2;8hav&p`(j+3N?gnrNrMe~#PU(sDR(fbuN#=b%YKD|m_20lAyk?ztYE
z=|BEbPx{q?Z$!t>JYbR{Jf3@tEa1dJlH>JP@3%82CHe;+7aC#Y{Kg}aEORjE5rXl{
zmowz&hOhTY9px@MofsgJ@#xaI3m2}PPh|I#Vx-y?b%^QYDlc0t5$#9KYD_o|sILxe
zR95OY)h4{xNwzM<6*H({$Nt)02<>
ze17j0zMQ_?V|f9jOc9FWXYt11V{=F)~vFot9pY*$MHYq%;XKJp{&!i3?%rk
zKF4|RY3a~&7rp;3>z}vqI>y|$>^pLCpQk=wPP7%&UC5IEpACUmCY}cGC}Hb)6aOiL
zB0{oRKluTteHOWNKGC-GXmH3rQaTy=@Ke8SZ7Js;vim6;3Gj{^Rr4hKJT-JysfdQt
zt@HB#O8pGu*Jlqu=`jdNT)=
zZqAlsvwgOw$#xm_eYTgeyz%paOEV^tqE5BOh2~gd?dZ*JO<@;tP0dN8cZax6Klzd4&6qP
zvYp;zeKTxxN5*)^a489x{DQVj(;$
zOYe5cYf4`Kw&eDdVm)fZ%M&ado1vA5c;!Z8`QciRQKVjLk=+QQn-A6RtTVr(QLzvX
z?-=ntO5ZiN?#TExOGNug4c@NJXQlat?SgTW;PNer~u5uLSOIMXx>Kz{}IZ(@g}jw
zhNZ7JPLs>)oEDw=ur$WyQ=DQ~b9NM3#T0nru5uY$FPG1Hy<>-#2{~7?>#B>-stZd5
zxdq`7okVM&X5zwx#XSe?D{`z$t?-l<#YLdxV}Y)|nzubW^;}ZuoV(6%Zx8NnhXx56
zr-t)l-zvn3u&-*;G-!@^KLn8fE#UwApIE
z3zz*F82D!}bnJ7$zb_F9)>uoTS+N?`u4BX8qaNxz0EOq)TIB3l*6%H+2vo^wZ!_{PiA@LP4lIyjK
zhznCg&lq6r%E8>*t3JCf^Q%&8H91_KLnl0R2l|Dwxg^adg5FSO2u-QqhjZZ>K*pIH
zMi}aI%x=33xJ{(Qdmp{f@j^i)t!A*7`2d=qriQLFfcQR~a$>b?LcG7?gtF--@Tf66
zYc-N9Lb1%w^(NMaPWwa!OKeO!j)uv;J$!=V%?Zw;
zL}t%Oy5Uu>iae%xS2$`;$&;QY{iZLAvqAHtNs$|@_6HFd?5Gsh~$nTN-Gz)1nKMCuEA(pf8|Aa)DC@b
zfCFQ3ke%c6JYQPD&^cQlYYC=3cZnln?kiw>E4g>*&-oTROi=882N2L>(unx^{jMF)Io9%WByEBp@1QssU>Q_-NFvh_2GhXRzVNgy*ERWbQp^_
zm!Y#(S506;yz>W+=5o`Pq@|V+?|f!;^i0{~QzGxy;)3BFDUmSk2E^tUSqYVyy1t^c
zFS}dKyKf*5k2V{2kszv4whX-B*dT`NcOEIp8IsR0Qix?T4#i~Tti=UU`Eir-6B%<`
za1l`gm#E(=I=J3695pTp7t3*L03IX;z8K7GEo*nh*uV=oHbriEc7z!?!uRJ(De~?m
zf2HKzN=l^6JK(XIb@O1Z*y{Obv?{S97#bV)ieBX}2oLIb_wQ+qH&|h^E#k8tYfGt;
zwrRBq~Vi>`w6$*HJMMz4eGbyDI|JaSR-#?t~DmWq5mpV1gD$L>XGCnG?}X&@(Z8q!vVlkb|W=Zwf^mP>iMg|X6B
z^2SS51r{RmoP(bY$Yw8mh{_>7j9}PZt3lsM)I57mIs{yQ6X@q!6ZQQj9x@hh+
z+(T%IwLteNB|2gleP)}a-YXebw%C-0N(sH;IF)p+0BGzMt@2vHrifcq~ZDYR7w8D}>_t2~3GGBZM6XagCBI#~<6a57v2rqy7IY&JZi
zNlVEQ5r%O&Pt@1~H?tx$HKcNmO}1>2L@05;SO)&nhkG-B3kaN>jmP*A`U;)$mj5G1
z2jr)o(b^Z-TBd|Pr*h2*nx_>}+tg?rvujhVa2~S+W}ZZ&EZES{7-sXdbgj${W9d0q
z*ab(zb;A;vZ>}tf(k7r)*8S7-ZD>81Fv^xEvzen!OV%T}j?2h)}
z-pra8$$3y#j6P@hRyUv7d$kR|0yAvk+^7!hWWFkcq(e&n@ICEFjvFptvz9r?sohtZ
zi=r5uMpZ0l_E&Va2yWG_!Od(HIWTl1-_uMx)9i}H1ZJJOu!BrNPy3xWR`_-n%0Jd&
zmA2`+&0=xmh1gi)(ISP)&qlLid%1(}M+%VbSSnBK-SP!j&g>owyzJh{L3FGIzH+lc
zi8_NqI+*#J-5HINRKd;@O
zf*dOrFNhi<#|?PQ;Wmocd(fCO+!r${)xp)11zf43RrzwqbdQ>#0DLkHeX=drzhlj<
zI6zh`V#I2zY|9#Rge7N6UXi1sQ#?)-5jr+g$y~SEHcbDhyuUO@b>y64zEOQdilWa3
z)@zohPhl_~qhBGY=|=s&@}g)EZ?FXuDsDUjJ91=!j?-Zx?B`)Fe3+8^nB%)Al($`-
zAsDlKeeM?7u_Jltz}H<KviEtl*{3XB
zOupqFphUkGte6i%yG8FZn|Mf{=Q9?Qrmr7yXH(}-NM?6kb{VY5b?wr;WGSJcnC%fg
z)zOtb?{T(XvDeBdHpOXi-fP=BQXNNKlRFXhbgj|GJ8z91?RCIV%eLWpP>>|Gj;I$+
zh=sRAn;Z4yVAx}F6T?37F<=@_?z-z9?X@mN+!W1wabT4JxO|A;zIA{C&?mmsi7+AB`7|1d9q(7GS0e=%%R;na&3lQEJYNQ*+D`3xXVtBE<8(&MOpVxJ@--
zWjjMmz&Lza(1BBe>%_e=u=dcg9W@3CUWTx0tgbi^a*+Jw#-?E7?yjw=oT{op>b9;ex|O70i26nM}1e@z)#n
z@N;I9)F+HEdFz7pS6#E%eJO=rqU{rLIG!zhCgfSwl=1*7K%g8J~tRM4loU55$W8Vp*56P)set78A
zt%S8|CIppGPOoKpUN=0zjGccPr=4?h0VKh!ejgeIdf!AnC677i*y{b`F$3A*G$H2?
z&Rtd}v=+P_&KR|opvwUan_V?3ec3jjo*bVlpYyWmt&gvF2uDW%Cpf2}MaV1}QZqn=
zG4h=OS=prakzQ9_o922C40@rNS!_j6^-ojbA
zSFuf9BK+1BGM3j#^Ja!isp_i?sWuSgY>2rjsSN>oou^{_!6>yC&JMq&Aai!$SI
zWR_O8Y)O)~2;`r&xz}W?GxE8zd>*VfyC_?aeaiha&47~Sg%2R^e%m#+$fm!3JEuA~
z+$b*xIU_5v5Ejp=Ttk`G$%(*0}O|}CMnCr2&
zVCzsACYoUGc{;Ke)EM8ld77c##6Tl(6WRT;at+PZdhIA(8}0-1%f?r{sl6U!NX=kc
z4tomG9|8ds9=x=d#sX1Tek3&M-V1dWy-qM6!)z=ROt3EE{EB
zOC7~(CIYVQrngiO!FbnRj(pkwY-@fP$;D~BU7g!B
zV4SlB;`3>3Zvomo+>sNn!!>)$)ycFacIHDUMW0}TGnnEWRdVud$U38al5E&Gh?2*$
zQuQ}lBTM>AuST3qu&-lD>nq4z_vG%i0U!a}Krk^+(z(9A2rm72xbcLI_hL*|ND`wC
zj2BUpusFhknJSy5J&su)>XAZ`G)ws&Umf&Zo;wRM*6#!RN@IChNLEfSzIIn>Iu~g4>V6Nl^&?wWQBsj7dufcA+kz6Y(U<04
zjf};KX2sokhTRr^zl8zcd5rKxES8^!+uj4f5h*bZjSGt<7pEDIe5rjlUO?$_oWtD!v`Lr)xc)+bgSUoG`?
zRuo1}QHa7Z*5x@T1tJ)O>BURF*s+raUBI=-GQ>IeJ9TC`RL?XsJ4)Z@%A(7gP6{RC
z#lal{in0wyfIotwH8JJDU}9m;vLBz|0>)*WF71KCnt=snOb8Bt<_r
z74OeW&u$)$T3BQjd0A?M*=$MjKg&A}r-FIHnzoQWp*4Z;x~k4c#A8gxTp=tbHO9Im
z&2_G5Bv@x8mdm5N9zh@CCM{-p1i^BDv?)I6a$8L9aF%g{@^ICX&H>Shx
zb@F`djd{<+9GUy9MDNEG8+h1sMob#>#^G`fX1XhLxE#B{@@1C6kZv1ZlO}cn(tyR9
zlTBR>jNXIrLob+TWE4j7#xFP7`D8Lzq32ZlklaLOo%%jr+?$*c*_f!)5^LYc&=VMn
zdIH0hZ%}fu)r8qzhWqKWKMSIAW7zre40}p+=Bv}Kt)^{g}%g!vu8ETyE1ySny2dnV!Ea)$&?b7bFDrtHNMC2ep#hm
zc;{rbka4@8o#iCS;lZesbJC^E!!>sry;izY#k|Z@ZD`v%i=Oc)jyZiUSfBfnWw7De
zY8^Y4CQ@s~B#fMP+EbKKEd8%gC2*s+HL>09ll?2SL405FUPVAEl|b3iA1<%BN;^HB
zx8QE{`U;U#dBG&9bokm)d$Ox_6w--N#qF+^>L37qK=c-8;wLQFrdfQMce|p
ztA!1n6>T^W)MF=e<2R}&=1(tHG__#uEH=wO`a4;L6o*fPD~!x_Si&c$QeIg%uuq_(
z6T6;tfKoc0IiuRXVQnfK?Q$`TO1eIZzZ1Kfx=zbI@&g3992+$=g%#R9gXL=j)vJu&
z6Ygvc=s6?L4$XHV7CZHoTk_m1nh5VUWm)pi{+dZX?Ds8a2Zfq;FzsEac{foEz#7Ql
z7co)jp3ZG{ke@ac9pzQL|Fv!~EJ$5k+=jo&ceHT51UH%i0)k+gNtdGejd)V1kmKuo
zxK52JqOOoFbq`d?AopcfUs89RoX)ei-6oe#(qCe+fy3x2L&V9CxzotI={7JTv{W9q
zyHnp-EZ$`8ksjQUu#p(FEvFCEd}cA@r6=fJ3BO|EFrB&9+sB14-6n614hfjU@FuJ`
zjH5O^>GEdkJo1;j=WQ5PR{N3H?R*BqoxQn|C%bP?+vt|ZCDV{j;35YoI3h3xxjfYaU9Cftng?B+sEM_$z-5
zR!*18F7uBRp#b8a?bd-xmKvwgkvn_W;vXwN3RW)iKr8U~E`L7=Ck5Nptvea@?;HK|
zj)|wh%ALOCp2OcRD-+mm@k^?!zd!uf11UPN^6#NW-1z0RdkSE?|6f!TwMrqVq~zO=
z)%m%&dsBPO7Ei=4eYqI2)Hh@^m!)063hDt~Xv6Hdp2^NmVNV%6^@Ju=MQvR-mrNpO
zQ-1?c$+vEc<0)yXsc)gkx8}uO)$F-EryQs;-%i)a=G>U6+})XaLaH$NeHSX6EjCL^
z_B&$lP5~5B9;yPVzP%$?L+7HaZ4#II{Y~b|v`7xqZ;k(cP;mC0*U;>EjEzE`NwY$-
zYzQa9&gfd!I_et)*@*z)vvsA{CShQ`$%P{1wAc?RL_#h)CpE#_UAx55O!-|esODjv
zI`tws%a>Y*w?IvSxumcsTP$1lmr4GziUYnI$J;7w1x=b_9l!Y=eQSn&n=*w>UEQFu
zokvrq+KpgRRx5Y6(d;FYMavyJF4L8^L!TU>Y8a`a7&oqTt^#dBdgab7`3QD74Sg>s
z5fCe3-KR4nwQ-%eQP>}6XU~q?ZhuQFh$$f2OfxWPj1CVLTlfMMEhUzXv3XE&OF9P!
z3Pw2A9)2elSW|+eB7c1=6_N5QgdwlG#@R-49-5=|=&uggkFSpv&NK*6MKW+WZKz6NCr`
z^IhhZNs9+|{5|IXr!fH>JW?iwj2lt#j8{^-YU$CwOJuX4CaPbyJ-53vhqlfI@H3r}
zVFauX#Tn5fgZ!lH(84*uHR!Q6^lZeaejCxWgWqQGE(JJ_6J|bJ^EF7A$6UFK$jpb&
ztui!LFX`PUUptP!GI@*SEMZ2gbb&0CJrkI%`1;X1%uQ~=8MF;y+b#>BtZ-Ke|#VT`?$xdCn81rEteJw%PiY;me9D4ud4
zYyQuAQYx}I-wz;s)s|_1T+eir_FZ-cX2mrSayd`Ax^&2ores;?gTXaKQa^wv`qV3}
zndb2uKoZpn3My;*L0J{C*&ePH62zP&MY)Rr}`Y4Ic7aj?#tiv(G)swz^NmT(Iz{(v&)dVVj+fcz(1y2hbcI;
z?-6Qke$p#V+nLti)wYx(k=L)MaukodIO{+eqw;dKW;#u=tkb-5Ab3^c_W}R)Kng}+
zG?cX>Z`6C&qM?e-WN6vRvf&FdVMjZCdqXtjXZricRkLvRgRnGgos9U`Tl{`j>I%4k
zUR_c-hc6#DaMg{4E4JXD{0A2jZ6oC_JiUhRWkC;%-ro=UD>}%WLjM{AbU^+Z!(U_g
z?Op#G!(U_gYYe|7@YfiAi{h_m_-za~BqBj6L_JHl`-j4uq6X++RnOFJw|KTTQ?WTa
zou^3KXI=^88a;#`TeBa=JfKpGxh73wJ=<4o20FFOzPF`Kt&N1tEuNf+bAgqB!U1gf6;I-5Of&LK8%>s4knayxnF5Hn{B*|Ry}0~#?|y~Z!}yW26`{F)
zQR(`440fhF4?EeCjQ!r8j!dY?^{MATkx7?kg0`ffZa2HFsnmq{2u?k1vhU6SW^e?x
zgA{qL@_eD)Kq_8@Dykf487bSBv?ps2<~=laceiZo&EX0}(|
z>3GmI>ewPpnR4iq5F_rx=Tl?7dLbt$Iq#qby*;8Oyxeahpw{kA>mfs&|i59O@!e=_-%n631z5?1jaRfndc41=d~=C;-s
zu~54(y~j)oZV^B(;^@{c<}N73LcMUsPY0CPe0#XU>3HArKLU-9SND3LWa*sl^#CBn
zW9zb3p`{kJptWv~!DHeQFA2~HIqVdB5o9rlrbBCnpt5;LsOR+`i^hTFHx?o*b;-s~36F-tP6zBI>LQVI;-Joi&H=d0@^uOPO#KTiv0%!$n|F!M
zpg|Yu(dGq8!R!LBCNo#xtEH>-9nCHdFRhIT0Xdw6Vrlla&5cs{1|GU76a0|Mg=2IW
zlm->-5=wBWK?(7NFBj3x08t48kb3rrTYiw>fDng%g=Y{i24v*n@|HR{6egf-A6d~H
zoyVB`@PeNK=Ho_=TDr}oJk2}t_^QJCSN}*IScG;HI>Guj2pc@
zdF5{OOE3fy?hG2YvzqIfa{8Qrt>1-ujMvqp#oX+B0M>wgN(lp6ZO@
z8lc|`hp_aU(I=n(avZ;3oM;V!%k@RB`+&<}3`HY=kLnWMD!?cL0GA`|=Jx@YuLE%T
ztQpTOd^wZ=te~A^WEg)4<=qp22wZM`5Q@KYCkPhT!JzS{Ym|d)P!%BT%Hw_N7cpSv{XCp7{O$g~Sy6#$
zI#qw@sY>ZM?bfWtv+r$9ItP8{5`DjZ7qnq!6PH!M1seO68bR^IbQI}v}oYGA}FU8OKE9Dn5kVC4mJ1ycCieSZmT
zH^q{Q4S(fUVCCj7%zg2S^92kopeeSsuh;<#rmb2*#};
zmn^ESppYKfp*4{vVg?eXxV{tn-LRm3?gECoQoHj^Qd^Q`Q=^nAB^z35^L3GX)12DoSoI8+9BG
zV0sIU5Khw6aBAgV((_twpMu&O!7woYZHyfU>EbMtdxm!)D=tw8%v$Mr#-u4a}qjfB&RCES9C6hNy
zHlWOG_m(#C`DIc6=8J7Ai7ULbNz9#cr9dEv&!7pk8ya%P1kpr7h5CieVY{uhdGyHR
z(-N9upr@f%PQ*0_Olh48wm%=l3Y;Qq;iQHJ@1^b
z4b8z7_B;3TnYF&jQoVUUtJsv1A!0B8mmUOV>$ombe9`wDcNFN)aK6)jDA=PHJ(~-)
z?4sh}hO6C0t9lM>E-yG3ba0)X@y`02gMQBFrJsH1kSo2aw4)Kez*0MHb^B5N65q?xrrCvU;(|lLU0{xb52K)%K
zfDBa8FXEsv%T_Rw77d$6XuP>`O87z0#pHhy{}x={UOB#eEJB9@029;BXSx2B_AmLH
z1IB_*c!?oX7i7agv_fp4r`SY($M&cuUx?YI?yB@8b^
zQ&ynyCH_}U9&}(Te}P7D=3$ON4xQ5b+vK~aCn&Rm-%Y!d0@%ysEgDIg9k#~Yr3VHE
z%svwf-pRQs5D(^#J_kUPr)FS=mrJ4oOnGBLLr}~tK<)DXQ;JXdd`dKlEQCz@Qul=(^W1Gj%`X&Tw52cV45QXx!3
zLi)z9yy^Gp3=IIm{FMN*BYzwLNWGx!Pvqh@rpou9Mf{`oS0FbqdVcHvFDv-hE=GYp
zME?DtzoLW8>8~;TJx9M?#9w3hYYcyl;kN|-8pCf<{Phffjo}Yt=nQQhtB*_#XVVZU
z%Nxh4rK_g^9w;ufp}y6J&1EN!1boJ|QKqX`DnolhOwkB(v;Qf@>yKOtk=QU5+1*+M
zbTR!eK{Yvt&v~YcODBdCz4ICZ$a-x2QG?l|W!_-`otYf0wkK>@PAQE)I8O!dV<
z`G$HnOmBMG{A6(Bm>9oW
zh6J|@(h-nAOjR8^eFvH$E-4>eg9FOCDbS&>h)q>g+?=cQiH4H%VgHM*Fb`aKR>j8m
zCD2?z*?+WDf8^Xh)5`yi&)-E#;ZC^Z88_aB#vQd?`kg!)xBgp3&upG8or{N?S(42p
z5j$5}Q!eh`8?DbOYJ6vxus(uAegqRF4^c&-^n>R|YACZIilSk=51US%qL77CZ(}Gz9`|PprAh9i
zc^0JrDwn+^8PI^df(C9=?VWq2DfM1vm3)7H!7S&&vfiA#2E-2LcPT(Q3OV+HO+Dil
z7}vm+V8mDZRK*7On%O_jb~>HkzqSoNKsnK)$sr!AmXDhCN>=64&%I4xU@)q)=Q5{`l(i+<3~FCAvv`bN&I?VYmO
z!f34-0H?SRkLN|4U&KlJ{F6?%FlF&~ZEI6iO8nRGezrWg5#39&ML~_}V7{aDiuT0hhz@W}$Sh^w@M-RzwbAov6S_Joc;HyuT#rGJjPESz}
z;E&6F(N8@4wDj|7$+9lm3lXW-1?}okhYCwXx{Nz~r5B9W^pmYdBJZ;Lm7vGTf@tn7
zIhO;S_d1pBTagEA1+%wu0NS#g$Hw|;wr*6cmS=ZT**0#M<4=b%DjoJEDM+6IgG2EO
z66>RUVB!WYXPN#GP>b|EQ@~#>V<@u9KiZCRH4CYC-*C!e>rT|w^EfbG#4>Bw*(*L~
zFZVWW;{0Aui#j2zdBM6RGZuV$nI3{;V*LGg1Dgm=JP$GmT5MoVkHWsm6>;-)wtrmc-
z&k>A7rvf-LlldDOLnb)r>7WfU`~g3wMm8V6**Edlse?*6-K+l0PcD`}0g7{>RsQUK
z;UoYaf*L;Nc>zBL)apdeJD&w;`G&b8niXF0q-ZLX0;n$hnHzq+ol(inw*_LFPz+!O
zb|IMbH~_Gf*l`j$9i?+r+H2zg5O0k4JW~J7oX_s<$%-8bsFB16o`-Qs`P<@d^Fw
z+t-P7?c4R%k1*wWA0BX>T-jb}@s$!KsE_1Qgs?uSb!2ZsxaqaUk{-aMH+pfci15Ii
zXuCJ4*R*p6C8xqipn0I!lIPQR1i_S%W7qv>DO!2PDT>|;FQ&+|U8UUt@mA~QNZscO
zV)NB}9xF4i?H%x%1*GZ;a-u)9Cyc+4n6D%d-UX(>rt%JJ1dzbm2UM%J{aEkuwdcwC}<#EpdV}#Q2xLjP6Xk(=Wn}&5CrN7
z0PnXDRbn_}T94~9qJrm7OWz69Y|kbQmx0eo0l$*@4pw8hWs2`A6pv?shBdREd^5#z
z?oSD7R%JKP!bvAwDgpZ#lAu31L?Rlt_KET>L>~Zgc*#Mu1FeQ3;vGgjVED!n;$H;d
zo}-Z7$nul_T_9jB?2EwxazX=$S?ykiP++5Iee@Ry#rFmt##wX>g6YAiwRRb04Y-4O
z>D)%c%mBuGcdU3g!mx6^(WVt*UDK`y9FQ}PV7`jd4(_a=rqcDd%{KrYQzX3k2^iMOSThA+^%QiwbZ7P&Rxf4Rc(HM4
zeqcmzkHMc#0OGCqm2Q&+>+OyeB#F)xLca(MdcCV3NtN6-b01^Ve>EJ*)8SXcr9Hz+
z6Qf!^Q@VEexDuWoLz5vfh4^e4mi+j10y(VJCR10q*d&??&0}#P;hJ}zu^VfeQw#WlC|X
zUVq1auaW_crESp23dg&aK~0R1*$l6k?2%jQx%7vFj>R7Sig?T>V3B$4?*-Z@(XN$?
zadU3~m2av`*$5rlPT6r2aMZyvz64(A2hDHs6+lgIAz}k&O^P`8wUJndCKl_D6evUF
z^+B+yk)`ft@4`vpSad0gRuNJ^KHCdtVV0g*cpC&)T<^;uZih%cXRU)2YW-2ZlpJTt
z+sD(hE3}8Q&deYE)7vnH=1KL5up?B*?&SId3buJtjw{0Apgw~R&PUUDZIQ^UBxfz;
zr;2Azl7~?0d)k%kY)oUJKob)NSWPv!>$wp3A-)mB1$f{{d$zYz3o6czT|56>6bYrg
ztD&(jS?7jD%iIly4W%A%4I{IZ-yx%w$rzHqx&jdT4YOvv?Wg0?ca+ZrQn_=V;KB^3
z0){w<1CAnHxL$%}6Jml}!rAzEXqxnAYKh=j9u;gsQ;!;bm7D^x{wxVOV|Mq%3^ztf
zrn7oMq;VfTQ%YI(?XYyaE5~W<7~XYYq4y26c}}b6ThL08EyE9w0DrI5XP+^j7ay+(
z{A#)>Wr8f-6>WB2Tqd|$?a;DN%n232a_%{SXlt&cJlyV1tWZvrxC@w_E!6Go2De5D
z!rAU4&|HO(Yy(B$3KYqPb%m-=T?n!QJUQr>Uoor0ZucJ3%(-=L6?guxgYnfR+$gE>Vb=+wt_6Ls
zB1A4A_U8y@J8@q;?m=IX9Sf1E
zD4EFdo;GSazqKG>b!<5?J|u=B4;nsT@nlR`a-t9NvE|(xJ-SJoBo-Brherq+>iZ68
zvnvL{HOUG9v4rFseZX&rK3SRTBRb;mF)mGVHKMc$wCH-x7&5TUzSf9O@2@$hNVYgE
zU}+NPq;5A@zE_8FYEv$cH-B+gfJI^xF!{y7Z-j)k$vha!B190g-Y#?H>Y%N;R}Ycv
z8buCszrAXXC&Ch<>a#6SU8jp&VC9f$fpi#$@mutRG*i2fBGa7jIVg%4L(2~zkD!AK
zQsbPpbNB?UZ78I(6)+^ED0ph`yY*^7k#X6$k2UiJ#p-+HqhSz}?L;v7pr3b{=9JEY
zL}Z}W=-EsZB&Qdos+=C?c899R)#6NGC5@e0&@Lksd0$;YQkJiXIjzmQyMg3;1WDlLwu^Y*hWuZRp{A?
zPJCwWIHH#{tV=6ht^?30G1thBbr8pQHqqH4!_M)OW5soV2@R>IVHjYZ4`h$9Z`>Zv
z)AXk19fmvW%`nq&mt6~J?o%>lw$0klGv9d2Qx
zTs&gJY)1_7lKU|iQ520;zH-iIOR{egtHsSwjhvCruA0OmR&-;xw{lxYxkwZ^a8)hK
zAZ=BBdCPk4lVc=P3#V~W=->~xMnUuOq2$!4D0bH_65Y=@so&Awzhe!%d1=xRrf=RP;IW7JK>OiYLj6HdxwC
zk*5Ea6QOjmYB$$~>6ZR3zqxUe#6NuYOtiyC)
zPYAsuJX2g0eBxczv7|>AK3`yzZxecGnUwhCjMh`a>s{yBYXxoA}$`^Qhl$U$y%bj
z0&>O|I@ZPL2Uq3+2@UBHKMBT%2MCV+&tHUv5A~1CI+l!sd4o|fV(>CWKC%u3YomY$
z>LrM(q7DpzCio~e4>^O=7t3W293(s=_2*x<(a<}PX{B14Cn`v$rKROscJs*Hx)n-H
zBXA1SFJ(n_Jf#A!QK4W^yM;sr7+57KJv
zy^4}-J&<;%I7~FzgR9V^7>WJkJ*vV&pC5YbjN^a!q|)4O}^9WCW)uzgA~z
zZ#iT1U^~&C*G;;on1qG9*^~9k-3tJ{BxWW6kT<&~oYfj#wro1Tk7yXbDH5Q!(zu_R
z$!lsxO~PE&uXGzJ0&l%`HX~rhNtj0hE-dNZ&T|ILYu*!#n;{UZr
zj~)?WO}<~)cde@g-ZVwnZYPV*tZ;z$l^S=dWooN!tl-#iy{Je4t8I#N65sq&bw4$k
z_>RDvsz}s(t0?ds_jMi~o;NoG&bHIHuKo#bdyB5Lg^;puCq5$Ex=J
zQl<_n;>Qo$?h>c;byqC$sZ$a3;_j}c4Q~5N%JTBJNMBL5+MC+i(G3ZbgC<`&^-7|s
z+$9F3r1yQn*1amOLoQC!9pQitqZW{3cp0BKe*C=YL>>h>$^Y2oo+|X9-$$tD8Q=9m
zC42p0G{4S)u7EE*5?3pBZaVneZC%za-FWa074&P;
z6pXeS4@9i@75TS?<7bLWJqyLC_WNMp3n$JLvGLFe?yG6rb;9eMgUQI1QP5EH1rSD@
z@N&q3quI7lEm$K6~ZH`ntO3Z{A!=(=K@bl2dOZDIVRZp-?qP;KI$#y@0CR
zZoKggOnfW=`;Bo35nJ$o;^$YA)f^+J=)Jq`;x_b@@>oyty)|DvdG0XUx;m;R#E{H?
zIucSc(VP%@Q8xHX?F%OHCdx5`)!F_l&aIg`g2m7`0xTSxEhZxHrYr*L4+AI5U8x~X
zRKxK&4!E#OJUp!7JmU|wUjPgxUg`qr9HGHrCWb@LxcC#ZMLa$fI0E%BzS?DpY_6v&Cl#x(;spW
zxNOJ*SaL8*@(K9rigv>g(SFT&Bv(Z!k5S#3{6&!lUHp?(dSWu(<>)Ee(9@DzUkRJ}
zj+un_6j;=QexHmRTKT47u@YWAP8qA_*OlUy-k{w(MCZybMi(Wy%njIYt=X+F)N_r2
zE~)3BDNhaDKai2VA!q0}O)7;~@1CaBV~uc*aRCt|SzG`&S@c_;Yn
z6oV-w3?WGY9iV|vP1A039`!t3<8y5ERNThvz^1pzkdR34?G3q<+u@fuIPR*bsNAW_
z0<{+7_a?oCR@)!O_>SYB%A$M%F!NU``?YC%in>iNk1W}Kfo}PQU
z(L__+xM;Qyz3aDw4(?#UG1qO;I4{2t_-J~y6TPQGVuWpvcfm1nh3cs~-^r9#%@VU<
zKMvu4*s(JQ@3u{4PUfmLlG*|z@JN3?x1MWMA3a@S*`brB^!kzGY34f
zAYv?j53>}t7r!c{2)#eQKneTGGY0RgG@Ql{9%!cCg(GHWEIYX+|2H52cbODv7q|s7
zbc$z=eFB9>AZzFh;rc&YQmaXPA&2u-HgpQ5_oUU--&)wR}$#6eh4Gu7LU9lDP
zSh36#@BnbRab4<;ucmaWF+d*CBBM0>?1=d#br`W+H=aEfxL*D(*
zeo4of%gFCu=e8TZIn|QpZT1FH@nSBK
z(h1onk`>UoRRq3(Bdhel>6g3B?Y?A68dWcRnD@#R%p0MOv}llwJkZ?drt3XH#r7MFa(fgEd9H@;+Q}WA61DCv@N{yf)v+M{>eUuv#%Z-^Y<;`y8#~
z1kvwQBVYUZ`9;r;iaF0EXI*a#K@HW)V*7G2$L
zn1eNvP0P=(oFwj1<}826@mv*jxqf+b4p!;y#pydb`rwtQOIF)^HMT+i-eT)fLVW)X
z?mcgI10b+g*z5NF8pcRYM
z9LJaC0pC7?XwM|QQs-hWTTC{gB}tJgH}L>CBaNO*LTqeo%_o`MgC61Cp1?vM_8+z+
zEmAd&GeQ~GoXWdXD2=3mj@yXOY@aY`7nYEGAKigVF_zIFrm7#zKpTNtsr}F=fK9!6
z#Uk#p!dD5}AlX`4T6kQ47%&AM_rkvjzy_o&!_=I?m(}q2?0Dwg9|jKE@R4J8cX!qh
zw%Y}mJISg;7IJIfmsa@^6h_%aMny4)v#LD@4ckc0XL=~>xT8*Y?gWB6M7tG>z59tM
z1WEhfsO$IM4Q?FNX(;MN*(6kBFwu#6FidpObtGp(%D%t-jqo4q8UyrVuyU8#KC?&e
z+9CUkk`xlWMccbDPmpkc`+q}sytcNM$7NPGO)Wiwj0+~#>7=ml#~8>S)S0pCEOoKz
zF0xC$6U|pUbKhlQRIc{RmrziEzin>*ep03T+T$bLEeQe__X)ZfLsK7e826bOST{s*
z+kW2kfV=I)HQxOoTV)J&xTsvaAY*q?-DHx@@{5GiH6#PF+2M
zjLjHXlq?Xr?{1}D6IxQOm)H(ne=Qlb
zCvDmK`k-a^GBAO>7;&8ReqmPCUYsH7GW!x>xylL&5**-?d=9QSd0X2La(CuIz*7qV
z4K6o;!KVNh3KOl{CrASCJhK-BOeFYlLIL9W8-D&*l5GcjtwDOY0CJ>SDA35R+$o8h
zF=N9&t3cYY!#&Jl8=S)TlZ;hEKOZ}c8czKVBpDYx-o)%U+jGL
zgY-9r$Qr+=Pu-k|iHZ3;9o6X%nH#6YFM;sKF6bJV(YP!k
z(&N-{dVhsMf{HsbQ)n}2t;+-kyHn=?8Zd1KTdknshCithKDCcuB|P&12?d1E*{@|H
zdR%8&`pHz8a-R)W4MGP58<@MlOCgY}qVN^9Ig|?=k+AbjR9lvw4j^S1$)ujZzrB3Z
zFI=_gU{4qnHK;leQj)3=_uM4jO=e?tjte9l$eMyr^bd@T!?%)Bazw$UvDuq;&
zsnb>9FW_J)QLLm7ESOgK0+V8V*(B%8K)DXgb?7h@sB&#+Q7%3N9LHaveAB%ec&W?$
z{Az9Im5@MEkcZz`o|eyn`|xR8tahK>n9hy_K-4`}^$cbP@3s4h!RNPS@Q=g-`B&Wo
zBFS^0zrG1IFjlb!4sYz4y36|{QpXq>RRHB8h&^i5Qol4cQEV%Dk^;l!yl~B^Pc*td7b007LxMhYlDW?Pm&e7H)*YaA$?y81oB5R{O^z$YS?
zGr&px!d1C-K}3#~msb@8W=w$IG0~L$N_G+(lgw{H2H8Je2DOC$ZV3!Sw>E1h*v05R&!
z(o3?)ef;=wiVn&;%T8WSE-W#T5ejanY4-_K4>BE}gxP>x=4$U#y&~I>ghLrSX2S~o
zl1;4CLJouS3UmFHK9!RdcG?*x<)D;z1rPuXltXuj@#!*9*Qh1z&fuueF!}CsZEhVf
zg**U-Hhb_rX>ye=##TP*9h&;%Sqv~uiLdeJ9Qm`(%uh(YF#AAcW;9X
z%f27>)q{`ASD~oYsCYv!Re`RP*YRvb(>v_9`yl1kn?PCjoAV5uq7_mCGfU16u*aSt
zRpWnAq)UG2$1`vMM5I*&l^R}AXw}G@^h_<)0Wjj|w;wI|x5zQRgT&UwM{#|d+1JX!
z!IXm#J&+yEMlNjiXX%M*d{tnZY}Fy|!}S&OHdn9v2cEoNxDa2@@Z0gDtY_>C%)h
zk+%l(!*3))2GSv7W#}_HDRGZUgN$R#*fdIg$lesHdb3;{ypTTq2(Kn65$%k+ECJ!}m<3mtjv#NMK7Fzf`Fwh|FA=YQQHxNME
zM55=6E`f424v$J&r)l;j@#T4ycp!{GSa*bn&jwth7crFfle1-(rl@U~i4Pb_kND8n
zsR_^Q`n=fJ^UaUXV$ZR7NRQZ5jgDH(-sjgZF6~W=F)y<9H>_yN+3d`|6#BpP>3_M0
zL8^@5@|@A&f!PXgNCA=J8zbSmgYSE~JB4t8wa>>8OXgr$>>6vryi2{6I}d8^hsaoY
zh3Q3@ta~oN2WO%c;04JB3yRXZp+D>L(?>R)d9tv#@=C8pj-E)^br;yJXl5_PI2i$B
zbYKd|0STAMw*`#;&X4dYu6v^1q)Ed^x_>H~7F}CCv&Q%_pDq)#dqF`D@tyS}yGPJh$UxVFZQsf@2{N0JIUgde08j1&$^3Mgmw
zOiMukl!UfMm~yishjX147#kbAlzfi9#Rki!?>sj3JYXaD(W6J3CQBe|PNqNd%>xoX
zDZ{9T53h73d3Pk+Hrl^Qs%h9Fu5jVPiOOdUcguljkGo?7sA;@7nwOwXy>X*bUzIn?
z_iY)k10`v+&Wn+0Oww!|c;S4g+LQ0{6ZL5MA${#@!np1Z{T8m&k_BBQs~pc+>jKT1
z+P-4C?lIwd=pc+9wf6~l+$td=uKago`2CadL`vj$-`o~A)gZ{8wC#Wu|&Rk_9`K#hmM-r0|sAT6R2z5}rV#iA%dk7+yWU#9;@Wx_>
zAbqCMWHFl9{+)}LTn2yY0)9tpr(UtmkvLJ?N8sTVp-**Rn82x#!=tQC5c>uty%q0^
z7%zZaq!tD(bH~KQ497rN7C90IwaE0>`y$pIZ=sxmG@(5{^!|O(u?QzD`$ADd%}X(I
zWf0v?|0Li(Os(zV2u+k=05UH;c<2yYXBEUquBIeI|C2k^ufV}P;WVr~)}9rGfHVRI
zrChMd?eritEk1;NKmpS41{UGcQ-C^Hwr55-Pj$7oL9^a%B%pdgAi0&PEmKhX^R=w;
zK42Qm~ztNQt`5y>unZ;(Y|Oj%d*83v9T^v@Cv%Qc+PcJp`#K
zD1=bSu|_TIu7E`@Y95&>0x07Sv4BwR>)Wzm(b5OYJ}c-C>-m?%Izxram%}%+pLkVt
zDACMmOMIzk)3
zsa(B}&cy-4a3PdK%0O14QXPf^J=J-ZtUI3NFJUwh6F9S#Ox7-gXMpS=%E?*yds>=u
z%n30;ROCQ{l;=Bu{!D@2n}L?wS}dyE1Y8D>ts?~FdWqK7)`k+1<;Kc=P_ab@Y}~pd
zGhumEZq-&L>*)Auci`W)Eywbuk5M7GgOkV`zhQlEwu52YdAuU!%EiZL0_z>tyN@>-f|7<{_`hB)m4%}6C;p$9kRYKx^e;<
zA-9CZzwqdTbQ5Kp->BQyrONj*J9jSIbCFCs$wa4&6t~W|5eT{AL@OkUF_X{s?c2xW
zlttW|;o1DUrY5A(rhJcF*hP!a^tOR!rK_%Iw(3@SmAUtUNW{!A2D4hj^D5R~)V#&}
zYj)*Vubik^b~&-(^^fYTBE-KOKtD6xWHohD|F+`o{nY^hzFgO_bPD2lbIpba
z@4IFzYAnn~u^TCUGU_gca-Oz(Bwc7tP`ze)
zsY&V(PIw-UOESAnhDsa{un|$fS<1mJm>MFgB?Faar;dC>qlqC8x{CleR@;ryEgslrk9G$9`C~dZ*dvSI|&|S@W8i$}U&X(Cli5S`m#OVV~
z76tD()-{q(yU{BnEp5o^r9ah13Yw1%ye$CH8e;!G$&<0|
zb1+$qN#)$*+P%&@3?ML%zSrr|Pz|s~XdHkFj5@ZprLsao7KuRg5jHPAZbI8v0DA2~
z%|4qsVO?249NP1@1Ni<_=7le_<)Y;#%Z?$|J0k0IOO93k=F87yqOJt_bc@Hjl+i@0
zShEAl~=cL>+i
zGb9ijo(#4rU73F77DH5Fg4)&;W-@Na@7fRO&K7eeqt0Y5EF!{`(sh?Y3b}y8)qjpc
z|6s;j`dp=J^j$-jKmATc-kFxY@^cozU*Q9MjE~rW>H@Ykl?5_9;pN(?4+Zk~_ew-9qMn`Yxki28=ZHNYO&&CC)iCegR#>NY$C?Btham34{G|?$0wX+kS_^2kn7J@}
zaz?Lo^a0p4Vs2oG$B&OQe>AKgSUKS^Vjbwbm`(K7E_bnoN%41cOD=9DjU1&XDCuRZ
zst<{NT);`UNjeSRH8D3=a&vR@FM?pf3yK6Y8WaDBrw*@?x1wKU6>-$CqVt?LS}{8k
z0SSN`Z?Ipb@>&|p7=jA^WX(zdY5qcu!$XTa&#nhR^lWuz_&C2FdN?}qq!E=ft`D=l
zPzka#Sqa8ADMoUz@-15SD=I04
z-MK?I_OT>a*rHj+(0ypTlK>x|5?~{C<2A2eD?-gP2xB=;Tzj+mLxp?6&6_tBz(aEj
z3%AWF`+N`mK@0|#*!M}Nr2m5#96{j<7p1R%ruLUO@SIf1VeCrL(`vNvv>=#v6i`0f
zz3*VG#zBn?)d-M`DeV%qISeZ6hoH4VA^8=^A$UeJ=IpB$&74BtXctzj%+$@mN;Sn?
z!%F4-42)ZVWQw+488AW;%_2zCrPsb+`%q*Zh2S$c{wnYVYQw`>=@}RvF>L28ZTw1x
z^vWynqa}VzF`eov;*rh3N*4y(ai<@D1X)(}v^aWPCrY{doO#prVadQx(TpW>^=24nA>~xrX$_`AyNl3{WH~bwn7xZ)q1(
z&d-1;)&YQYl}8Mq&d#={m(qger4|AZNcn67o6J{V1W2EKQwne$f?CH|Y6E~|-+qcr
zvDkS@CaM?vEXIl{d5n;#N)nLG^dFddS;b1ua0BVWIMg({{Z0!TNfTJKy*d$gGE
z9F5KK0XxW1^WDB)Wj|>b57nJ~_H_`eCx6f^9Odjm_2z!67Vl7X8EP~-G}okhSY#(U=sAQ%6@88o*=A>
z6muHBgSATio`@VUs02A44k4VIu1l<<+)4Ge)9)aeha^ru)u7CAEkikkG~@9~u(
z`EB=cC4SbR|pu~Ry~h2rd|lL&T~@vtxS^qP*#R2Mg-JCXhU#$&)-Y&y=({rcQZ
z^r|Qsh@Fm=;@-o-C^;?jF87cq9VIJ%z8fx)H`l#B?sss7wLZ}etlGJTw(0(eX!{a0
znWRKxF#KQ@j}S%MP{G<+B_+~F3z6k84tX&+-Oqj$RP~31QhUZ7!G+<_U
zTCDXjhzq`yG%k6t}XBvt}X5A>tGJTDRM=s%wMb$5)Xpz
z-4l^5uXvENI_120l+3$wEhGkeMG7c5KMgjt8XnAj?XB{*gnf}JyBFckH8X9si&IP#J
z`)h^dbykvyV^XDZLXu1vJF9&m^5~IRsrfITUJjQ-QGNo-=`xtVJUhvCh!pn&bID6V
z$hsrhw9_C%GL!a*kBH!Y9sFTG@ks-D8dCi*h5orJL$9xL>>%Tjuc7O5cX0S0*zwEp
z>OY2*bo0a>KEM{xJEeNaqcG)&xgxqd@Op2FJ>``PH~GlE{!guHd!}F{i)xQ_*kQH0y!c
zME3hS<$wb!H>~uieS9`>Mx>qHm3nH1`}2Ns$?`oUErYth?4ANSi4{B^HbLW%K~}MH
zci^XM-@SY19(#?%VIy|C=KwXZ(c(-0!5MfPgWOcpd<0EnOcBKgaJTmj$n
z3s0#45+FI2i#nzd{eNRB(Xr(6VG3#+{x6Ai(VVUa03Z{Vm4nnw>V`|#AlSK5qO`Yi
z#|I!PPZMcW&i=*P{GJozU4Osa7Z48f@@x{2A8CtGSydY)R-V;jlpI2b&0NaKJEmX3fQumHML83b)EW^oG$Rm9$G**e^!8aDtTI|OAVdZ4y4kux6Uo-wMYcT|
zW&=GwSCMk0-Z-KqImCHC0TJ3!S;7*NAZacW(T4
zsi`lnQwt<5J^QCAaox_ql5;e)?b!hC{W_+#zdczl1kvUJo|0acukT@nvd389_;Q9<#@bYy7@7VM3o-H4{Qlub)Y!jvqdT`-Z+(L1#xz_Nm{
zk!}5P#OH)`mEG=8{?~JOQqgX9XrG-wyPUCrr1s9f;#s3>uDe!Roj?+iuj;wl;r(6s
zcwi%ITWIxmh)OGr_vU{IRX@X5l)em=>rzWTC}_hbKOwTpO0B4H+Kn6I(z2Fv=yzu$
z0$!mMRr5mhbZ?J1KM=GcN*959JzUbaCjWUeOQn|HRmqvmd^>FG^xzQ2c{fZ8Q)n-%7+CH
zZ@xR#Q?4zXpaGd@L7`^A-Po1=Qc^t`>7$OiJ%{WeaHLmNnS)lB=VOjQ#+(+&1uV?=
zS>f}c#{uDn++pek0_}fwsne9OhlmzyIS4(|<+VGKck_Ah!NdrE`8T@ub7U(tIb$F?
zAAyDox>~B`!*+{U9R!_jUTv4SP3JM8I^~JWPcOYrNm%wb(`~;xH8Jcnb!mMK(d0tO
zD>8)zIJ#y)#3G|$LU<=a@Wocn3g5{H;&-0!gBmLh@-dEuLCNOS9l%N+7g`c7&lZSl
zFMUWmIKu~cC`SR4$jfZA;&xr%B|BeU@GTATVj2Kcnx_Yj3oD?OFRzM_l8%
z;5R5$hj|+(H$n@N-7~{36euKuWERQF}4O+sx1((0+
z7t~r^+KM_eVgDMWH5gRJQ*S5it@)G6&cDyQ
za+am@J-bURy{37(5qvac0)--hnE`-TmjIYk+5#tt3={I!gt(Bg~rX!B!i
zkXo#W7L_aDQ6jP;sPp>J7s3u=sF=s1kmiS71c<3PSxF1+TNbY$R#vSYm51B-T{!v)
zXXOas++oOSOCrkL)Vke^hA4N)M8xv_D+D4Q6{dSqFqA#Wtfx)ou|8+CK7@XQv5QFO
zTzLOf;}DQP-yeED8!uC%4!LvZ0d(TTRav1>;sz<_83)W7WSo89w6E>`Hhm|xc0MUa
zVWnuatrliCw3_T<7q(DO@cb}lJlH+jY_xo~{O@`d|A~^mw;)=qV#HaE=4$034XU?`
zz}&5xn+45!Ds6RQ04iEwuIm&)iG|u}qd~{9FqVcq^W_UXu=}mM+Z0Q>F
zEb_)x5C}(0a1|$WKmYjfxy`KPXoDh
z{ct`~{={l(o!qqt$|-A%%R|rld*tg8nWSjOuEV(NNoHqi%X~g;vCSa=i>yfDBGDk6
zZ0WHTbT8r3j^ud74V1+!d9N?&swhFLoEg&B@=9Mz7jusQ>C8vQ4UFViIvFlOBrksx
z$|(qSRQjq(M1%ECv7dC}uUFkKjQk=ZtAqgjj*yU@zc}Nt?e`@AN8*n+L(nY|``&J|
zY~bEVW7r1&5D9EF+GWaX{>7;q0HxJNLVZiakeWe588HhbE
zfPRr1bQMppovS7Xnoz1EPYi=P={Tq$RELFixfjof->(?<#=DFag)^2x|A;TWM6t^)JeRh#S7%)Wig8m^NQM%z$>0Rr?^c
zF+r*Pe2?}i@;ciDJ-
z=%)7UR;j_FuwVOi`Y+ILUR{~zo8#>rh@wnc$=4KSKt3P;6)>0bg~>!nbCFzB^CfZ?%;azbxhaI5xXrlRV-9*?
zCXn{aK6?^MSB7^(<-~?v`+=nq-he_uImB_K^Smmb655ru${5*AdmYD<0_h9<_2G>oe+%ll&;$Wymee8m;@MU^`qG
zWQyhE?#quC1amB
zP!NS@mLb;)LY{9tlTs-zv()mu9gl*AQ&d;(jvgSrHgyYsf}y91Fc%vqr_rdVQ*WL%
zK|r^{?HPz?G@;r$fPmR*(u?PMJtp{(j;O`KiW+fXziz?+C|MYIw+|Ss_a*j5EPkyq
zo`}G0c4KVCz4pQr=FTPZjz0TYv;clq@IOiIRy*6ELdkPT7sy
ze;pbYuud?r?Eyg1iXcxLO>h#A%Yj~pnRk4-(N4H?=;sQ`ev*J_NRilQiT59$E
zFN19&bnb^f)dL7!w!PR>8ReRjFb(nMPBudx-WR!`|9L4ZkKZqt>c
zat4^Mc*_vv9FL&e^&QO4F`f7OSYRHy0@D3tp*Cm5Oxo4LHGnN_h|eA={>oC;cbMp@
zX`kFtoSK>%t$+3E)rwx6_p*!A6wFups+W!j6kbE|lY
z>O$#6Z)G`Juh_1K*P{>bPc;N`qLU*cZ!@yk(VP-SA&p(Feu-GW3YZL6(VJdpTy#!O
zu58@Gz#RNPc7U1tLUcSW(UV}Qe#x9+{GAd;<%tlbh~+KMy#%T~D=&AHFOG3da6T+y
z#fzgf{-eo8mHCwWOsaC6s0vKd5I}?{Xcd-I7RD1WKY*#BZCpuFRaLaTTj=>Xb0_Fm
zzdM#^-6z^+2z^2}L3jmNy1%x9bi06Rt^hi23*KE~(J5uaM5hVSh;Xz4|JKsq3wsw2
zR7FpQ2sUOM*R{^7)EXqyx?wEj4+u<5?S&r&aUB%ICdG`)
za|9#P&b%upU<5!|#q*R)_o-A?p1$r95~wjv+yY;sw21WJBR&bVA0wWjMZOq;Pem61
zk2D#4`*64wD8z}vnv%xm)|eZyeKO`7??WrXWX(d0Jg0k`(~>{Llcm7#@GWtNZ5kt|
z2yjSg-j}v$lO&K1r9TD8$+hC>$k>u({X3Q&TKA$xnYHf4fSC08DGN<~5aoY>ngSo&wdWw&zwrP=1>rsPTgO;hKUNNqnQA#$sXG!&Gp$A2`5RdL>-V
zN2Kr5$vG>Qr1n`pA`-Gar?Y$?MjWG1zk-qZxAYE@Y
zY;ee0o&jO;o6B`E&SwHbPp^ClC`-Sd1hn}1EqlceB7N|4oqpdDla)WS9xZ$z*r(7!
z_|!;J>?U$jlT$J>RGL3D&n>$fHtc3$xpu=s{3Q{Rr(qm%(@E%M(XKdG@W$#dRr5(d
z+9s=x>>~%x-#tdp&!ZY|kzX{P`UG^vb&$eT^3Z~^A(!vv1Plvu4V|~}N{6bA$Ny%{
zt##ididP8V48G5*Sk`IlQaku%;k*p`6WPhKl}N2RKPram&6+E;?>H)(g>9`40Bv++
z4yH}{;6I?HzY-U8jL>tuI55e3Ot>-&6{lJ*=#Os-N)dRj;dT>6BVcA0fm&8B&#m$^
zi;#kX^yaNwiqO8|C~{ar;$ya6+XMjp-%7CsUBbpYcI~oioXD<(WDU@tJsWpfNIDMQ
ziP>v0Rpu(zdu_y=hnqWQczN}1Ih66W2%ZZpakgp4^LEo`;;#z;tK+bIFeS-VxR)e=
zG9AwL6VPbi8B~(2WR0#auLv$m?ZCNk-*8zHVB9}UFw2tiTKA;MJbfVBsM@gCcio%i
zR=dkMXUZ0=YE)Y&(bW~;$mq5jP}8n;Z|}POlhFOO@|Af^y&~$6(JCo|c}6rPq{we=
zxwlh<{T4Q^L)SG{5ot9>;L(<%_7wThdEAzA_5GL0czwvww^9c$%I==AxnXvy76@X5
z0YC;7;2u7XxO>LD2LhoIG8~``Hq{LFEq{yo;OZ`YC+y#W?#H!ts^jgcT#>eUfQ!TS
zpE^xI=w@_FEcdPdC*hpwCWvK>@`G#zPV{3}FMmu(>P>H+EG
zT_b1bLbdy`rlS1(4H>wo
z*N`JJ`UEj^d+nlD(av7}glcqzHrBAs129qU5fBZr+P4A&>t>ry3yN5^IaGQy#EKvS
zM(A@5+vVj2qcDeHGMiI-3ujfwY-tb~8Uuuu$Tefqs-4F!9nmk&Mvu;ULV{_Si^|*t
z{u7&RSg8k-PgP+pO^`+2F)=Y+VK?&#NHS`Hr$(aNiRa>&hZ%~ZP}?F(EoOFh%giOc
zCJzC!{JZ}ln08VQ!V4j0dU|^4&^zeRrjxA6pFuPIgAS1d`U)AjLcoYc%?Rk^$s{Ky
zo4kFnkC}O9qb;ONn>nQofV@wGAqvBwhAlIEMOGr<$AakXK*nqWs=ix#YkE~)i*=%I
zyJXs8d;wP~Ah?biq5*i10LHHLhKpVqWRghs(W2|Jt8}&~fxvd1Tm|#vtvIl;vL1vn
zA3j1Gpn>C9j5Rt@g0b;OA-C@~1ae*5qSTCxxM}FAkF{U$EhK^qYB&Pd+Go_(2O@I0
z%82E^tFQk3)Z>P)D!YS`Lu713v39bveQ!Aqy;zOccBOV(9%4f5X=rrxwd5?2Gs&{$
zFx|C&Zl}uai_oNm^yq+)_&iX%R@ky>cXQ1SC#~DMMiaUVGxx|GOQvW_YNFT91(+3Z
z0Vq+)weJI0<-VYs%0auTG~5t(2oZe2D1+J5?Cfju;Gt5Sn*{X`c@TXzu`;91ZLSrK%SO5L
z=P$rH1!U%Vk&Tuhq_1y*rB4MJ)2&Q%-dS>h7YON@N@uT(N}$J0%sMJzWt|ykrpDU=P9iEICB5fM`lBc)H-I1odh>y~GU-37U^5%Ix|#k``fpGI;t2@h<}R
z*>~nWmW0V$$SGzQb4)G!QR7&(9WH3X%-sQXQ83YbpO^0-A2&=c_>t6%c^yBFJ!
z5gL7LniXQ*%BXLryH*;64ws2CeHXhP&ZwuzA{d2a90G(CcL7Q|>S!5gN*y~cL}WPr
z1!R{jJ#~#ymmZ&?G0F_eo%8b889@$e*mD5S;d-C_g7{C9`qgFk!$MzI)mg(&hrV+Y5{?zsTec~Q11P>bNI}E=j`airC{O>+9-Sx}%SQ&GK
zAp#BjBM^Yq0*@mAT9i4r3FyHv0kt2DWUy+K2c{XMw!9$wM?D;O?|wxAZ}{iu{QQ>;
zp6=KH_Q6>x?V^UVkg{T@-0$2fhN7Xxs!8PP+$azcj$^%px(GkN-g=^q_gPr|BfQ
z`!r_AtHFd0ti5J4QUIO6H|RyY_8|-H3Egyyy08yqB76d&XR)4MIU~5m{V*FuhT-?m
zfw95;z5yt9b9;Ma&`60=yga^`68fO7j6ye-Akr&Ry)q=oykke?$X*z&Dl+o&z_op_ePtm?xh9CeTTc1L0@g;&fGD~)aec*H$XeAL0bbs9
zN5sU8Euk_mA8~5L4X^1)Aq2kDJAwysVfH_oZlkYj?`Ia-4J!BOtYMgIdCq*m
z8yI$EIHr>nKR>^AB{Jt2AOf-J|5G0{45>9Porab;1SFH^XKbv5#bWP4e~Pqv!k9Dz
z7p^7<$7%cToo_J5!i0a_RpD%m5er;(>k;50K~3$JbSq^
zo|ng?zjYEk+b$mm5}g?>@6H
z?vj$Qfx?xjQr50}lxe88{dcrv`3~H`7FTd7EEH$m(b8qIO;%y0wq;00In&r)Iji2R
zV0KYgyf^Q()w-EoUs-&B)9?-RHZi9v*93|fr~7@bjSJHDyZajJVdIocy5A>(0_~@y
zTO9NRj7zQE{RI+92ETJ@;2okqWL^IEVg(9Hezs%XMHMnpWY$9+F)po})a3p52>1>D
zk(+iB^$e5hep$EV_t#gxWj)qyI?ucPw*mdgfOnZXn$52Kg3U1ZS?2HG{rL|QhP&o(
z9tFb(DDizs^tILR+Vo`{{u$+a6vp$QfBE|T)D;5)$>;Zx-uZj#&90XB-jObqX4+?5
z8uH{K-7lZ=*I)Y!Q@lj!rOY4~_xs~IN4Jx>--?xV86B4jJj9MClB5rD8|CftJG*X?
zd=!%c%dze>5#Ft&&*LV%#6P$4???In*;@%X-SB9`hTS_A&&gi?%@+Q=p+Dz_7CEOr#*fhEcY*0&BWDg2X4H4*=g?Io`iz(F??F{)z>6TSC}kH{61lOR?9p{?^GQ=
z&EnZr(ygwA`gjKdam_%A^iH3ECoj}_MjDj5_#qs-`eGAE?v(2?-hoXoTZiFL>YcpgMBXrQ*2Kv>n}*#V7B>d4k$ZV6(A+91iIpAG(p
z{l7jD4q+Vz<>?&E9`Aq!HwFa-1tOxNS|vR$`clBU7eT=(mg@mhZx0YpjU#h%C97Zz
zjR&X*CSW{zY0|)O{NNUnGlS3H_T_##MW)Zdy_4edpt8(@QoWUZN*Y*959r(+j+X-N
z6-GiD*g|V_g4^dH4_JI?4Jxh#ubEnL=sB70lntH0^wX00Xh^vj)fW$hN?ro_V-84h
z2(W(R66`tBQBhWIgGQNCBa_JFB~hDB^#;5vTtWw^aWBLC1T3)J9k8#%vu2Bj!8A3Q
z4a|`kzfX34@8TX3yK{$8&M*!3DGXE0S#X$@n1T+}ur8RTI)ZZPsqQSa)PUY{Y^>`C
z5u*SOf>fU?ska$A((l@hl9_Ih7)4~$jiIkx)J}sobz~S#KoPv3EO>)>xso$t@3+$4
zTDI%gtgOcOH@fitcF#x8;j5qTNJfu^LOX3;n(w711>+!^iUA@egB!H?N+cfjg!*x=
zQ5rpdd1M~+1s%dLXSU}xpl#b%EURdxu%5)%UJJgv1{p!$kqWydW`0MLhsOjR3@DjvE
z`!+MV)}k((A=tGNDpyS6hiLE3w%JJ2%}Ikm&Kwg8a{QW&oL1~H`
zxGy0-ve~1%g6#{*=lS9DnGw5N*d$n?4xQgvn5SJ(_5E{57YMAU)n>=?dvb?g^1{~a
zEDz{V9EXRH1u}MzwZ)MM&}iqt^;UZ7F#fmMZOz!3Gy}>fm-`;eQzavNy%dikQnyjP#C>*H9QsBop+ZA{FpX*l?kvzt&hS1-E^5pQDAifJ
zA)p#_U_d0S(eX@Z-`jWZ^ao`-Uf=MIZy)llBB5A{Qe$ZEw<*hs_eNuVCk>WHzTM?#{%#$D
zZBJu{Y!Uw!fWzAcE%44(zt(Wh8Wt^E=J!m`ZYlNKxYBoflZ+F?zmss|bJQ#M%lEN8
z17txQwxCpK+xk?aW<@|dKRr#ZB3yyg{4BA8eK?jg5Vr43#%oKvOzMoRL1XQ(B#{jC
zFas17W7)!R>$Nz}2-t}cKl=`-{A{zra(KZb|M4eZ;2C!>LkG_|AR$!hMXD%GOXSm(P{%y}2{I{|0T%HXRG>@B@k)?fUJpz+pieQ40ICT6sG&XjC
zPGKC1wj57lnYkO=rwCH3K7Yv=R$n=xZkKasXDmv&HUwT0p2m~2grsewTU>oEyU?$D
z>cIFM5nnG-17jLx`|^o(bw805m}S~Y0rpQ94%5m>vO2nN@G6(&x=A5mu49x?X>B|F
zoSXEI;LDD6&xMqdqM0(r)bQdCsNYZ`sVV@}h5B-W?K&xq>4&ESa_)Q*brdN!Ad_SS
z5Ut>6>3^FP0NC4@j&GM~5#Ps(T80x7;tch?VqCF%>XEQ9pfFTt_=uNUV3l_;XD
zqJp+31LVK~WZskw(>r^rUlIC;$b2i)Df#}U24dejP4vJGuZV-^?`?qp6y;RUVb2)f
G_`d)y8@(I=

diff --git a/priv/zstd/doc/images/linux-git-compress.png b/priv/zstd/doc/images/linux-git-compress.png
deleted file mode 100644
index 3fa0e88f4f169b1f23c43c189097af7be1d08729..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 105620
zcmeEvcRbba`@c?v782P+C}d{OGK(l>&&bFg*&L*@NwQ}lduNZMh=gPBRrWqc92}hA
zeX958Tljo`|NnmPKi<7PoY%Qu_kG>hcwW!zx^MpX6lKqyrZ|m-g>~+>oRl&a7LGa=
z7B(*4DexP76^JbO-wAtV*;`n7aH@IC?`-5W?6I&eUBLWz!X&8+d_@B5w$#ms&L@^e
z@#A%jTsT)vie6#Msb9c%!+V8g6(MaNc(pHJ_eseXF{>us!^LMMR~P#Ga^I;GUMEdE
zZA$XWEO1CQTfLC|VZ$>Osf&#Gm+5Z3VPwu~Mk|8I
z>RHitlqZ6GItE#rz8I-xwPU5G*1z_akWRu2>jVTF@2?*uh9RS)qvOk(l~12I4Vz@h
z9rFzMRt=>4YwqX3OHpyU_pAnN^)D;=E1f)FB?6LLx=a+wvrHLn3P+Iq2KF!6x
zqOLVBAoKTEe$CaJ6mlWwx(yZmu?t{5f#0Vp6hd^|@{(V8VVj?!^8I_wzo*x6N8(vY
zM2O)biTwK1^fKMYAxP8Z!}9w1>4yui^exjS$&N@9^Xb3KJOTOtW;frL2+jSi20ahH
z)uL7c+dWq73tQN$8s^iJXu8vt@=au=?*3G67IwOinrkO6&|tKuM@_#sOJ!{%2`#cU
zXp-c-H%SYt51I1B9(NqJwC%dh{F$qXs>bVs6+L
z%PajLRBYF@uus2gIZMsjTQw=r6=^ZmS>`5QKv_}9^N%k&iPNf2ebpf8m+c<%1eT|x
zKMpayG5cxf`Z+jx6*IBrsFkWoe$Ng5$ybu+=bb9h2MBbC9(uR`^T~p(5&QP?#k{Hs
zS@GTbBd&|NT-IaN>K{z+i%efr^3Ti5gU(LF`D@pL%h3m@$?eI|(31orHdT`ZqCf7r
z?=R|c&_LJSU`V$x^E$EhFAQtF`B2_ci$UdvV*QWLmfGcvckQQV1k>iOXYFc>J2!gPr6O5&pXyi{DSmkC)H1#yrs8cpqmK
zK+a>_P@J^C1m&8p5R_kUq_hr-U{xdSAF+n*(~C1S(YRUI!t1u|#SL3*Th}yUP>-o-
zS}@JeU1TR0%e0&d+CSHo${5DKw1=ImKF~)kyNYjr^I5B>Jt!z|-{6Uvj5XYuVivDh
zT^Zi8LHHIHEmA(HNPwlUj}4jU*GveuyD08#Ip(8LFf?UF!^cS)WH}V6QEF>WGrcMbD=8xYpkmBzn~Xk
z2j*d%t>`%#wvVysM?lLC5Yi7|8^SQ+82vag57#j4wgzP;N%8HE1Y1n(#Rg1n?c(UY
zfod1~>h*~HB}$o=Wd$4eIZ0ZU*ROL~j6aoIKXc%WTg-=v9W0L@AqE*6uh#sGPY5>(`Mb+%$!8U0p!AfLav2+R?9g?k>ph_WEt$Wi)^$)
zC&QZZtJl9y@T^n9)+nXdH{|tpm0_jD9KJNJrh70n5*@(BKHS>Rou}~0*zTIRp;7a5
zi}6%MyXV2i_MEIZMa(N2_45MXyaX0=ic3-P9*bJz0rDI*H|+3zYZ(n)d$V;(b}Cp~
zY!=RMRa_lz?(ZZ^|2}5zkuTokC_J_^_(hy-idOJcWVN2&k9U`(#Yk$|>T75lzvcy{
zBh1H`U251|^v>_?Msdi5`
zI5=29!SHu7Dh%VVhbol`G`-
zGLPXst*^O^?F3r%Z^uv6dC>|=u6{bh!8UdmMyx1sd27Hh^h<+1{9u1x$y2kHuGROI
zkw&S7Mm4eqas7gx;29oN5|5RAqz!zbHO4h&e1@`(V}fWagb0_G{Q
z5!23Q08dq*l`1jZB%rdy=54I*I&i!k;JWrBh0
zPM%1oz;=D6iDD(eaDGd%z3&7__?tGv9hYXQ?-={IRQuq)g8#5JtR`AeCod_kpGRjXgyb>RoCsg6uKoC~8{XViX0
zAO5NB_3iIJzD_BPlSl1nd=)^!zfmiWt`AApgft2SZ|?VjJxnpVP=$DX{>&xzr5ZHP
zPQvXE>l?fjNXaLH6plt(JFy;LP}e-2reIMuOGX|9mxgzsk$Zd7CJcx7Ej|jVcwhy$
z8+ha^EmodWZEb(;rNXCKTKtQ@UHB4?$duWiTbGxOoZ*L6@K?m1o3*G@cy8RBzk=M4
zHC>xg+!L67^B^EUd{!B2hXfJ-$Z=;n>eBTY*WBgS8`n9Kc+`rg*m@OcwywvF#Pgb~
zhFP?vHabTrz$5iGJe%cpyW*DE@{|1EK2Q=ZkyD&;6O7{xH_$j(B|sPG*_AjKuQ8Z(
z&a`&3#jMigOa(R6HuvU)o97t6=9Y(RyQ7B3$KtfxkaqDr_hT9R7pSwQOr|#TJw0IU
za(!)sDMsr8QBq_%k4MPWVp8X|m`(0(ExU~yRwSqzb@7|5MW$(!e*5lAOY@_6kpHH5
ze5Db}rzWKDx46+ZUHlcATRbMFCfXWy=O#PZQ;hgI^Ax_CG;0i>K$nTK1
zFL&;W1bs;OJ|@plgYl5@32}^`p69BqHxd!3HlKIzXn*_1Xpqi@;AhMH#9(y;cvGIM
zQF`78w-*XA()ApcvWIxL%@=H*@m6-OK5aJ2880WcIn;AMZd(giKP5=TTUBwGQ@iF}1qGv%{v(+UOWR9-%C%HUhy@1#gCtR2^MDO=EE`c^!3GEAl_C~~x}+|JmQ
z+(}TYBqveu^ouHS9x*WQx)
zkGrV5aKg}f>GUtm*^0Bv#K^P57t3h!W?F4^!@SgJow47fO=`mCPE1{EYDXyaM+#J_
z{9p`Ot9C`58$WI_I7IClagHP-32x(kCMH~X9kqJCg2dL{8|QO)1`g`TO;0ZV;H6#q
zE_-s3V1xq|qsKv;b2d_eWidiE=BnuOhwiUssG7*)^!{8ewJV*)HG2zo@OLe^ucz5Q
zE4(*?2*EzZ6A&(Hy?juHa5-7lA!QdgI5n3aD;SY4=~B##a(8WfMF~WqzmTt-
z{)L!0Z9(!*Y=ZduOB4#&UsFGu@+A`3e#JJA+#}d=$Lq0?&(nx49C263Oq+I0
z7BOtJ3nL<9{4UXYdhnR1F^}7D5mP>&*Y!d?^QMRRGx_2xC3QSSnx3$&lr5?4PDy^}
zZjNOPubjWp=l`MbLyHlF`(rFp2YTL)3HknRoNE;B)hME?Le
zPg0Rz;EDZ60uCeh-&~0I8p$htYCUT;hM&P=lKmc&mkjqLmrq;CgN?V+8r&bll|0Y@
zu#zKO`>R|{l1Xr#RvBRINw*^u6pa;POxrv)>;`?byEoAX$f0LdS_@rl{9>+S;T6(UkwT>UrM5zR&I
zDVsu(jyw7#)y#I07VN~Y@cZK15{p+hkhjFPEenc@lYEQXI?b4eDgW8$b=}t2uyB&!
zUe*A|J?gQ+zD~lg09hd+C|nTF$h-P%y1x>)HVNgzMy$W1DHbC(-Y)e-aPbCm_}chx
zUs-_E9jMM81MQAn^=7Vhu=q~6__aiJ&yP5lE)oPU2rm{U@Zt77>5cMsu!kvVPWO-5
zGmVDasgNDIVzI-1X&Pfu{?)P!q_
z?o5RTcH0el*+tIOIbw9a!htNkcJ2HKd@#G>qC`mdqAs#>tbM-DRd|SYp}1qAy0Da$
z*1%zZv;PuI?d$Z3#Pv7nOE!aHVNjY=TV(+<8Hl^{FaQstl}?M5}8=d-f}
zE>^qE!5EiSaD%V^V%uw;m7>S%<{7(SqFQWvwbdE@NN>^4l#{CrO>D&9PRg^dy=v}c
z6AZU5XEdQTZm!ky*zEnh1>d_$dm*xgB~dj
zm|LHBT!D`e434P}N8tA<;2F~kniLq5Tex^l)X|B*M7fZq`cLFim+*}IG!(gZ)+QFj
zTZAVXHSEBH#`~d!{-HEngE;qFYkuHdQI{Qm82HmSBqvG0>ApVyqL2RCpaUb8aY|NwzJdjS?kPfk`PH?^%a+DI@Xii4XRQxs@%BN
zW)0=h1$0LvfaojRb+}^pL^KXSDiDIqFu7G~{cH!Mm%+7*F?oRJI9Nd(T-C}-qa&shmM=LpYfUF@5MWPCQ)m^Wb4aA
z>LBgqDi);u`Y;kO0T03yPnvX1UpN5}D3;qwg-M}keC20+$-RtvfpbKzYg-2>gkJTG
z@(GvmNXDiOLt4~8a`T5GIA${%)rXhM#-X2i*EIpu)mUo^-aAX>&~txB6~?WZ2GEgrWoZT&kC^?C6N7uXweCA%O03ayS6e>uME!IFgq&}MfW9NX|^BT@>~Nx)7Aim
zr?yP#{Jc&xx)LKwiNVB6U)`XN(T%12U*c7vGN|6
zB=Ixt`LFFLeaoe#{a2PDB|30}HgTCZJXxNoGEcXT_NhO!ktbqZ8@dPUQI}w4G%izN
z20BaHR&=n-ubOwX?HD}?be?ufyWqe0#dVQMp5Re$B2??fm{7+cWQTS(#@S5eEAxGm
z1ow^ykslNBMiE#(AZ@S%)SLBnTm}5`j#nIdHy_P%q0D2L
z4aFaQx6ciex&uVdrr0dCE{Yr>7G%vyc&*po7V{z0ZDcawU{)>4eoGBb+De`m^G#^#
zm85IjS90f=S8WXr&=|sKfNRAGE1v_u-A^RmXn)3JHI!1^WZz3xV5$WBxNABX{mS*hSbb87$C1w-DeM-
z?jnydZGW9KX(BR7KK&M&U%xN%L%5;zIiLK}CEEg?Z
zqG0<|als(F`cQG{>6j@TpG;5p;
z(>z?#wVz<;CA_lD6V%a}eLQ6cEYPAnkFXlwW00D4Zm{aQG$
zk=seVjmjPU6nBq}xN$1L#x2#cNZ;C6DsE>t?lXQ3cqexw>jcN$qzJI@JoY@DYGQR+
zWnp}L>q0SmEiu`GXB-L&$p#c+I@)%HHRT;;_rGw-bt{OSi;!qbeL}Ms7vCPe{`L{M
z8~g0)>!|8fJRW2*6kb5B4zm__yr?!_=~2c*o`651z&+Dn-LeTq^<695xIG)Q*DN;U
z^TsadCChRjwc<#Mpdz`GFmm|bKBeMFOf+1a?Cgye+cvjim1kwW`<(G)FAe!0CIN6E
zFY}moXlK83W%kiG-cu`O!@w)bpUfAGcS}W7FbHyphr6`X+SHxcheplXG4G%%5eQ^$
zf6*^G9xq5cc~3Qw5h7zXr|>f@ab`hcu9CC7?O#wQml8&=#XEe(&3ZFCy{O+@_SWE9
zd&}TG!N9_V*XT|?rqoka(9$rE)>JJfIb7YUgaZ>wL7yAw;15#{q-^S(Io-bYZPc3#
zCNbxhP<8sdVhyI>3cXP=rcctBuI9ZR`tp1|((!R+&k=yI=%jsBmBxQGGplCoN(L^Kn9v2d@{av+w%=a
zsOf6tv_#)-ObHdM6q$xc>z+DVfv;^
z5d-1|ri3ZMeA@Yo3Uf%M81YYxb{c=GKHl+%MEdC$T08gF-^wnFY-g-f6VZ9&liG0H
zUBxOF`MH>kw_d*5y*3@s6^^M@O7Ma@W;WOPcZX^azW~llkP7iq-MIYoh5wPvuOIH6
z1Ay^AYx{Epz<0qrvCYrn-u?1(oI~$@C<&@P6q9tPe~RJP7XMr!W)QQhpxRV_lbHL^
z>wZ4g3$`S;QNZunq1XMC2L<3i`~F?#|3kZZp6o+g9Dh@mO18oBP|3-V8%||bqZG(7
zH|r_$>@KSsRm)@R?-C9;?^XCetOYNX4qFAbaKJ<&uWONlu7S^=lMa5QH<^RV;+O;m
zsg%#X3!K0dfPyLc8!<&fOmU0{F2L|!;mJ(aaBlx_!EfaMw+fqG1I2c-QjpDwj%_3&
z8!%aJC~nCfu*x&(v;#PSDcS`-U-h28|j;>5$sb!h_3dmMuT$^iaV)wg%J3GuU-1Z$xtF(U>H<7>fXApEZQ~
zX~)e%yXmjxGqL6q(;S{IOGPd0omMr_;Njow&VP&x^FwkZqzzHh&%KvGu-gwia0t8T
z0k===j?<>j=>=&Tdu3(i1R&^_ownyvLPNAK&=F^A4CVIc6A2$@%RS1;lO_cqzj#Mh
zUQZw{f`OUk8*pJmkje$(oFQ!h8NVy;CW!m2#ue~b-fU#eNVK>ov=H4PNkEdn+{em-
zXb9D2RXsdap$GbF6Q2_XZEKkB-SiGoDj4%b?|&|E2YFARO13IVb8m@xf8&q&?m!0>
zOnyMx#N#c*SrLo-71@`g!IR@EJxz2_4hn&RJjiiRG*Rid8^^gD8Oh{H;+!}>OBSl6
z-JbMD`y|xJfCqAP5-^h?U>zLnH9xw(Fk)e9tOJz}<`#oRM#3A{9=NJ%T-6)SEz^-?
zaIV+OmhqbTP2c{dC@EJv*31iLd@_q3KjRJ0*06ix^|K`DvN2P>Tsju-Nua&c~(SAFB=eOYRUhuRLkDq+LE
zv{2{0B@^*L*8FPj5b=X;%zkqfG*Q_rOj-2HvsYXJDi(muuUe_3|6cjH`SnCi&VW^o
zCR7vqH^TXA?GobNd5sEfEAHvxw9!B6P7*XUiER~@@65!ViI3qiY2-;<3&ODA@3d2R
z3BWFi+G5C<#Ue*1rzTJXrsi<|cqYKtkc8O^1&pG0_N)nNAv>QvE6I7nzh3aJ&aql?
zTOaJRwETq}4+#t*De{G-|3RAuz^mH6ytGy-dE=GEn=getGmwnxzOUEBj+(Le8qrna
z9BP=9gx(6MN?l(c54i)kY4a2YP;vOaaLBO{^{#h_=NA=TU+IU(n%YeeHqWPAkvVS0
zEWjgaHa{Y|cyuZ!AP$(YS%1|(?6|Ob2ZT*kJ9TX7zclyP1SF^dI#}eqWAGb@{iROH
zuK_xUpd!6_Tqn~#T!0RQf?kvT)A8`R6yDVJ
z-6hIq582){q3;_VA^vO?8W@cZ@Y~lV<}!-%4`_8bny0W}n8=SeiMp`yEvi{3m^nQ~lv1LRpAXYo=c*v}NKGzph}xnlmmKbKcAWJRtBGRuddN0K_g@Lb3#
zq2jw4S}Cz3k?lx910EcD;CuAJQp|(YLf*$^qnw@KLt;@#p58g{QJQ`zRek0#G~4WV
zq34gxt>+$SH5^WM0Qq*Er)2PKU#`~A=4*FL6~G&1ooi~mt$)Be1naO_C>_s={o|Xz
zWyX6kTD3k}R&=TuE|e`7ecoalG-mos2a;~q?tftjZIHgCbCG}a=>vT+GNZj842g@@4l0u
zo83%g&0lE=`Bq@H?xY*i-f^*FHjxrEfjWiV(=$
zpG67<JN^F*0$gV
zGi2j{&1Cahpo^aA6`gc~s%y-D85fp!0*QLH^BSD*yE`b6+y<=3i5R_QH0Y5eA3xYC
z!<t~^I2+!sq56ZI=D}>>iK8q
zRk8rx97L^VDO6hl@~G-WG~Lo?-v_oA=SN~flH00-
z4CQj_oF{VI>r*UQczjg2yQkHCO1K;aeRzpeD;mw%PulFxr#GFzr6L?hA0XXi`J&Ea
z+A{YcuG+(`6euM4iaV99Q|Xm)j4(D6>c6m9I5Yx`DAVhXS}OTtOo&
z38G9ZUys3Yfsu0~*-!e?4MSarM-2{oL!?R)tQ48
zytM2Q<>tj`PqPLOJ&Qe5S>kq7E%!uul9a-DcH%w}?@){E*BMGMaa=eV&VAE$
zJ}pXyNwwuQkD8L;^qZeYS!z|PjT7AI`Yg*vF;$1K7QE_jI2?YnV#o@HtbRo5qa|(7
zza+g(tR!MfW|Aqi0Et5cZjU#~S{yhib%zQvP823lZ?>5JI==L$?kBrKfXT2vTiC`n
z7ra3rzGsu8RhB0g3yqhc=?Km#Bqev5@7c|EI=y
zWup3=a6=YOOUH(=C|>r$Wk=2ZBqAq0k@rzO0!Mb?KUK?&s=7p_P=VFEZMr$m_6-cI
z$7&2yniuwBDwS$NETQ)cMBu=tt!UI(CHq8VH$!EaqTE&XJBQsi9j6$Gev^|+ED3a+
zMlyz(UM&oj?~y;YzMC_w>=1ac
zo9Kb#GQN?H;VE
zkkI|x-ursAh5f~4FG@=aAJ#n~(&|&;es~Pc8>9eC{IM0BzQE8sFVBxbjD*XfJ+YEf
zRVv4MBc%O-&k-$4=EEQkau)ACW&K8PqQHZ<O
zsYxYY=u(rh&>bBqJ4#pI(*g?^I-gKy&RDSh$!{LD^}Kq1#cw)zQ{#8j=O4QaIvhc@
z7>ehRObY3qUm_1=A1QMF0-2=upsXyLv)TrvjK8%1AobXNT?hLbK}&x^(ahTi&26w{z4f%v
z?E$c|2Mncry2tDm=8STmK{U4D6P(KTe37TOpHAA^7rR!LuQU;r!Q8qW)tZj1BK$7U
z&Z6LqgB~UQ{?A0d&;oK~f+z7>2l~cw`u`APzD1G@1tAv(&`Jzj?tP`~)=$_-Y&07p
z9jK*~iw`?4Zy`*>fo)HN$PRX8C4ETw6@vvDQIBC8^M-&j#aigX5i#k%#+Y!?iQWW?
zGp!<54LWh!&gWEe8f^B*9T(_Wn1Rk!Tqe3Fd!|*K*Isw
zo$##p%er@g^zRYfl7;hmep-}^#mD&Eh>M^kG*y6?m4f5wqR=p*bOV27$D*Mo$$Dk@
z=dtxEACr=Q?gID=mt+Ki;*HVETXfjFc&%=a8uoZ%t=Zgk8s6(2>sB7#0%E;TPlpHb
z!J~pg8-j2|acOGA4d$~?WlmlHYh;YG^Y#Z5OOW&EXX?14KNRoBz+u@lw~$$~`_)ec
zJ+N^0=r&_FYJh!?|ELpESAe}G!ZqPl9GjjaAUqKk(dMCbc+*Zmh*{`93ccN9S4=+V
zEh$b|xOiWbq$~$)bitK(ZswHCSx55*PK+Niyq@C$5oYByG6s68#IG6C*WD#K?!P@f
zje;|>#ieF~LPP3t}jluNGwWBLZ0Xr_F`FiLwn4eBCBP66+2vdCn9E5|W+t-aim9SV35t
zmkS%rlM{uCiJZFBb>)bMs=EjFP_o%M2`~nvp7aJo)roTa2lNwt#S4TbN2`?KGC)pU
zXVXHSrq;1N0d|asF
zG{z{DO!gzlb>fXPdI=|_1kZ^&~@ISq~{wMJa#qv~4%L#lH+7c)ggJy$7-oIF2t
zU;GhuIA(ELftO6mEZ@QgbU^5Mh`?NKTj1!{EYV^V|8ed(C>DU1jQeJO5-+gN3o;v&
zF>hgiaPVljp3WP2dO-Ot){7%{8chXW5pGDe`Aovo`&!kF$kXM(Al71y+8l^r+xqRL
zNypd_6WBPjHx%^uxV%RxdDQKh%r#b=of?K{quh?UIYb5&ryVX5^4?4?f>e+$#*Z)H
z=eybe3S3rM7Uhs%Cu;t9PY;MfB~}bfx{!LJxmXI@1|tk=6Eq)HqPOzwx6!+o4{g&%isaF|@kpiLyEtM1w
z5*dHY=4UeDZH6iN+iOcn>p%TvpYALM3yGr3R_a8B6W3GR&gCA}KtS@8oW#|M5`Op-
zxUri$LVKl&vh&S;$BVxeuoP@wL36xBawB8|eH9bBgbRK|5XI4&9{YGC=JE1}Oq}@G
zqE#k<QpHf8r7ARK!>(_A)m%%XQA#
zYecwcBc6s~is41;C&zBsLtqB?NUbl-Nq}G#G_XIH7~*7YiUCW&7G#A9Z$%w(8OxYm
zuufz0ZobZG%*fh7^QcM95!+b;^{z!lh)_aZ>V<)2TcR`Q%E2_@
zG0MW3m&aNH6f9z2V2O~95I2#UYxc=79fdshh@DwOU$FiWc!+%pL|kg@&sx|*n#tK~
z=HI`x(7#_At1mb(Az~dL>%1bQ^oLA;>L3}ofXCq~If8iZvA2e=4Aqv?U2nYuj|QLq
zV-e*=FdZ>GY`nAV1!!|%mn)@)S`3kiG=)aX-yCY>505@~4=CPwYUfd=j>tNqq@d_h
zHKpEjtPEC`Iqg}0vH-un_ycIsmhu2d428YPQL=2irW?z89`q9j`FzLtQz30&zxCo+
zl}h@)5LEnywdnA;-pCpjgN=n_L@9v_Hp_AK+oF(nDGsR)8JEX+;zFFNG@E$w@&lD4
z%|HsqVCKytmAf+fAF$uI2MbKl#^sK>NjHcFdmhPmlIuabBfNJq8HGJW8jafX^Uxd2
zNi0_9=QBPERK3rWf+p;5ANw63^`rtz2nJ)SF8iUBUYLV?qMg0Lt
zx3Mgh%ah3ud5I6yJb4XNlG0AT98D%Zq6eGc4Y|l||HQiOGfO)`ekaEUs#gMv8E7<)
z3zlgZS2p8}z5R#ts)T8O*=-Tggr7tA2Up1r9*Za$Ds5!zCiH-?v(@
zk*vbnAB3*jlY0uQ*w^yjlEVmvWB;NGdDnxd2{|
z#>k%Z<|A
z6ZDp*4UDd}R#N|Ely;X-AGyP3aS1JP|qz0V(W(eSPpyT~>9Dsh#@GN(TF7>3XLHa(F0
z?NiG9cn?+ehn6r&-Shrl;)#WPnVelIqk59RZ=}MIT>@b8^_|L5Sl(gyzpYXP+4tY9
zG9wdMz+GI$0ciGNqi7cMQm#2eB)k9Im}Zp~-jR*%z#!`UmzEIhMn(Ovt&Pej
zlB_<6=gv|PcrZ^y&4!L{emHVmf(+BsXe;4}55X?QZxv%V_&6L##Y#E62pu~HR%gV3
zIklZqD91MADELNAR7E@79lUZ5@Gcncu5-vq9`}%|@P>ojce&NJ-yA~B+|jE}PZxC>
z*e3Zaqh$hymF>mj5;|UD;9Lg1@T2Nd2?v%7iO!&|s34s68e(PMsT^*p#_IumU5W8Y
zCT&Q#%s(c%^1qp+L@+>F<~P)DF>+>NS5m;BA?0iaUsps&HPOX>?sE}GAb3U?Sak3y
z`3!8Pgu0v;M7|0AOMU;{AOk>{QFZrvF00>lW(mFESCdqh8wX+}yZ=CuW0#W_?jaQ6
z-3+K=A;HG`9C$ri`fK7c3d2?D1eB^WBd(4$Ce5x%Zs7ucex&Y9c7QCr`gie#d
z0TGy0;OZ^ix*1wM-bLaj0@>M6N)Ete(G
zTWzVqY+kBm{pF0HL~=OJZ|()c3J)2uaXTh$PliCcSqLT5ZvDJe33H9p5;z5HJLWRG
z8MqAY^70R4ue@qiIsbm3+}5x)UXTaVJT3qZ*&2L(W1LrssZ*9odev<~e4%uJGoz=e
zU^Hln_0x)!+G{MMB-Scxvlu-%i#R-c>_!zJ9Rg$<|G4%QH6*wJ2Xk9h5(5#a&DerN
z(2by6sdMGwC3bBx{t+8VZBX;&a#-k5FM53YKJ1^DeuF$P{>eKwghH!q_d5N24}>T3
zHW<#kcYoVFisi^myk|bN*w)(gvX>dPM3(>PlAk1Rcb1{D`*L~sMcLE&F7;Y>mw4#z
z{2I7~OB8d-nR92L?nNb+uMZ|-&GY>4#_^HNe$cY6I^*nv<^2(7MnrJp8_a^HYT1(L
zcz+Wu0lbstHs($^!_9@>wW6pRi;nN*;6Mh&_??viP#P>9UjxVGgzRp6DdZSGDbt0?
z0I1xdssB-!!BPBux+3x=aD(Z*?<4q)KOCV9!J)DODG5U?8rQkE+u-IOLJpT^d4o{V
zEwZO_D^-YE%#BdsdcExNwVjRGOQ=DaNK75lX}t;DvgufalTMrwTF1^aPK=xHVXNTZ
zxK3^ENr)V^am-2FPv4yPlKazMI0GQyXgkg4z8lhBb#Odz8(s$r94OGbqNF4=pL+TF
zuah1TE#Rcb6A`cU`$L%0BoI?64&Pn9i^z7Xyc!{=cFBD5#l0
z+ISz1uZ1{WB*>;X?E{*RKo6!)}*iOHlFQ^Kn$$8
zm>pGXx#Sd+0;{19*HrVgH9Bf{d-KOa1jgOKZCL6e+bsW7aSgyVcQp=bxtb~#?Q#71
z&X#4m)+hP!2+0!bawHkfqpJL-^Opq?QM3Wks84>PN@TjiW=H5bnVZQe#5rI+@}MFBT0B{7hz~
zge-_U{#o38>frGCcXgNbLLTOP)mY2d<-SGBfm2`zVu6WpB5`N;h7o
z^==fE#viF6k-fznjls2V!BveQ$YlwgwdjZKX2Sx`u$R+`t%rq5IXO8kfkL_M(3AAf
zx0w?jss@5ihD3d!dtvyk1L6~_o_^)iB%-tVl>!E12-&6mk+70kwnJgbs}ApX5qZ{y
z-s1rWtxW{_{as2CbUdgK)#uvD{65@v)^Q1QQe{kRt$`R
zp}5^Y38mnw*{m7VkZ?VmO$PnC-qx5hbV~Kq>8YjOx39A`_-XA*Ql=Jc7S2`IdO)yW
zUIukCnOhFfcKo;%E0Mj0&3XY1l_QgdgQCSsd{Qw!VYI3D{07B?Rq@WCi80TRa^%Kw
zaght47-~uFyTo*yijWN`hrt1PTj2HoS|MlzvCAPypI6?iPTR#SUmn52l&v=V_*Q85qQJ>Q@vE6R=`%UI^w4x`vbdh`a1}wB^p&#%mP=V
z4%<6ZHh|`jsWtZLJ2D{;Or)uH=4BA+TX-Vd%Ybp|%B0vme6lI15PXB|qa
z-uU^Ti(I~g6mL`hxLQ!k6@Yv0yo$Xnk!%1tGe%N49PavTXjkqZI<%1Ph2$YVp+^Tq
zy%mP5(4Y99TXZ7hC*eY+x3TZ1=dQn6Id%ke1YtV4p4%ugNF<+vREdgByh7eMS(8#&
zv(AYEjsw#wS*5PMaAzIn&xRDUeN7=nVa
z8{~(V;?(eBO8uod*&58x4;#w=B*GvQ_~xf1qcB>WzJHFDUbWg`DKE|FkU1nXU?8PI
zw8LvG?_0l_P=o(o!>h;G0#oz?xHwl^|A1Dy73E{hj49%!5FE$Syu`rUvur9rC9XgM
z*#n|$m6S{X6I!@;E(f*R-~GsOH=kN<)DX4k
ziryB^I$T<-QwL@i5|QHw)S(tsDd<6!f&reFsE$A@H{`QtLr3Tj6Gtozpkx{ImJkoj
zpT3|UA+vf~4^0wc5#&*r1!CAxBy?VRZdoLl+NyWtDL1M&<28
zHn0>VkxQHdn$P@c4_19`hb_x^?JmE*EWB~khTS`aG`iBfAuP#?P+|Fz^J*NXa*=ZT
z>0xfvR7qdct(U2^4_vV|QG@WX-h(6dJhxV`YqJ(cP}`u!hG&SkA=2)r5DI-r0dEH
zUzCvX(#$6UY{IK2y*2k!XTsB#2~Jtn&Lfq77%BG@w)Sz8T_}^nI)P0n@y9>j9hX+6
zZ`gr5oZ00|)be!)-`UT!-ZwMLk_o0r%g(PIGAhE{qKgut#G~`7yM5+ErBW7D^_yYL
zwXUH~-Au2b@Y=Jqe-8L_eD45;Z-H3mw{AT%>(5)(-Rf;5bQShk#Y5h6=
z44o=R&0^!bpLb@WuR-wMR7*IM~y0bpG8!Z?^eDPi8dXpPJUCu`jCE*WC0RX_*?*y#Tl>l3q3OIN*iYy^E>O)@y&KM~
zqzbO}dJ`QzM_NfCX!m&Q2I+Op)YQ}~n~Ss8l_e#?wkWF6v3+7C;cPmSA%m0m^h=9=
ziGnJ{kr~syQlewy^C&!%YR+RGc##bwm5%NQNa02_5jQ(h)gB9E5sEwz-cS)XPP>|Mx)ZuY8WJxCAHYWPZ8WY+mkI{D+q8
zC2n0Uy3~|d{+_B?P7xPHvFZL+evAwxF6;R?pbz$o=&~cu7PP9GU)L&q`mqlnygD3R
z)*+)&52kWT^X%f1UKJ4OcL|BNKPJ8^^S*NZMgDR3l%Af4Dge^Y#@mOSDRo>K
z(fI!TvYIZRz+N|$xz2Uyxi-cY26&WqzYoQ?J9;qRW2c+N(>f~Uo7nEu`fdBv)Pi&$sSILNbghE3o#2k8ge;W;9$RDX=B`MI%
zQXUWGdDMDjWE%>|M=bL%*XEY9BFH<6ihbasCfcaM*jKOaS)I&bHka}Q
z9_*&~mXiGKq}#F+)pjRz2fa37Zz^kbp7DQEJ~Hk%<`d(m)ImCv1~x9kb#o!_z${m@
z<~K9P
zBPkF0G~jql@t<3GZFVb(JACYYRR1#56Mb+;L7@jY^(=7NH^OYVG#3Ox@vCfXtxrm=
zMm0ml56W{aBtSrsl#lKN1MFP%%V2kiy`D?X#b5pt^J<*a
z&o4ROz&>v^R;>Xp&*;mzpVE`1!n(OM_+YXz*q&h#{0RX^o8I$3<~r+_5kn=c*fMZJ
zLW$&0cs;ceW>6>iQ~tY=%KTGH#Ye}U)}?!VGAFXo3|LeyxGKS_f1zN;DuPADF6~54
z4i;ty1yUfnD^c%4dOhJHS8{<*av{&X@weT8r!oj3mnrqzzI?ei{WW649iLRLgp}>v
ztJy2UK&>P+@Se-wNtks-KN8v+&)!FemAY+e9QEk;E@R&+J(WF=7$}squGv)Gx)hd}
zxKbL$rt#Wjja8UTBx*F~9C-CN1^gZXEwdfjCoLc9sLPy(9ei)|RwiW<+0Y)D*i{Da
zSLX^ex6D9bpJ|J8qG|&y$>aRJ>z<9~2OCQaK)`8C9TNn~pHN-iXjjnM7Zt?kS
zcD$7wDmH1q{kEy0A;Y*WmU)w02qOtb7D7@c2X|>r*T_riqa10CcjD6JmJ``Jhi$ly
zNEYuLMzUhy{!C2}dv9OU0c_qbxOfq&ob;9ltn}UlL`BQ>L@(@4AwMoVHS&WR%Qv%Y
zLeYbo6HZglj(D4UG8hdKb^VdSqLP&g0#VjYpHrVF=ErK>3U@p4F_Lxgmf^qcHY<;h
za4Y+|{w&upO)NY0PERDegPYagxB~zx@{7O^EV|4lq=Ua^VG1rdDXN=ijM9FWDC)){
z5?@qkvWoQ4y6jaqkN0#t?n7$!n?yS5F(%7ZQrN
zDXZtLB(B?;=E%gvJaCQ3!epp;ANX4sI;7?pr26;^p~GU|-AAPv3OHt@rlou~-z1Q5
z09x^Ey?GhZX!XvVEwYo$%vaN^w5uVcy-|NO{1M}W9(Q=c`N0b(DsZh!)KLIE=?<4!
zJ9+oz*Y4f{WY2wY^$G9);p?lzqTHXi0a-=XM8cpI1St^^rEN;-PNhq_b5RUXX%J9K
zRyqWhPL+_ZrAz5Xr6hmz;Q5}Tp7Xx`;l*`{yH9*(=AL`*nQ>awMdl2qDEak1Djev(
zNq{+W)Oht-NUp2^85hj}NBSu)d*LwrNycmX$N%-3txSo^*o=FD79Oyv=Wv0|CVYks
z$8TJ}KDpeb)Aexwu_eGEF_A@nn`*Gz-ha&Xdnt8WAD{^yWjzA@->C%`_9
zNxX^<9wzTBFvFl8mFLu#<$>!jPEkyj|8mS7_(Gg^Ll*2OP?(uBs}GH9fC^gYibwL*?ar51veDdMy~9cW^hxN@~YCcqaF}
zZhN7(vv|Km%D3!#O6S|rg(`~QuZi@Gu5|)TU%JYsoL0*-V_Ej&=86kUN?(TlktCD$
zx6Vy5^RSIzBQzkuswmt#CZC&Ar%aQ_sL2k?Ej1dCbqZ{wwv;FeW5g8OfoB|YT@WsX
z9+vw706f~@ge-WcDm#WEm|#skb~z@&eJ4b|r2MTRZBXZnz@`<-DfD*>HFF(Lngg`|
zJSjrrO)lMt)DMpjcR|mY%A`K~qA8&&Ixp-dvsoO!$kStRsuci7x*yfVnf$OQIr~-V
zm0}k-w_Yyy>(?K;tj?!HryUy~pVH2HxJvONak^AEr|D4H)_xZ&QsjIQViv_A#iE|-
z^N{b9GuctmzBw}@|9!}(V)!`GZ%%($l#mT=6+dihb(7LEyX@H6I|pboaku_Z%Al8*c^Tcc4tGUXl(OG88H3n9-S`l?vyH2+Av3F`J_7Ekb6U
z>|0POXos|8=1$+$uZM*ez1COeX0o09PTra~13ca};0k+sBxPhA4Fqfa=`v69nUY`9
zj@o$6KbQoaFVLLy@#ExK(H~FOm%j%+dx3j%%inac#5u#k0ub7CXF8i7O8pd{X-NGS
z;ZDBhD6I{|ML-azIB{aC`ra0V&CtZ5h{63m1gTr`02)RTgic;Gcaq=wX-mms^{yrI
zgmmKj!ki+~9+%1!mIt_aoc7tbEyvpa&f4}jcRPFlE&W;m&p~eBzY%VjLq>S_?%hN?
zG#iK2>VV@6%sjP?i^=ziF%MjU2ErnOL=@wkErOH$a2i&vy(@El%W!eU#2<#M(!$K<
zonC60L1id|a|T7F84JU$WMGbRC^}X-T^+B*wbnCS9C|#Q6@ojxkJIUGcCfk
zhtEPN#(gEC`UOoYWY{w>8O*Ly6-~--()O{4y6d7vZ^90&mymaOh&0zr^0>0JeIclQInl7RkS=-F;Z&)pVzZB_58o78ToRD_AyC)S!vZ
zR@cZi4%GPQQQ<{+e<<4qrc4hN$EF*UP
z&h~qYI5NKo)iPd{Zg}B}*i;JREQZ$;f_su$>^e}e64x+fkHgWe@yq~4Up~}YB0;nLrU<;_0w1vsBjUWntrwtH{Hdv-(e}%M`6If*54!si@5>@vVY*`%ITlKK
zNviG=JvJlsB4ihR!g9KfhyK8DqZ9>OD}Bqry_i+`QaH
z%$|Le4l|7Y8Y}6cx7NycHbi?g)t%8^x1)vBd_wnS$;VUD=dt$(p1wutyu~wsf#r|t
zuQnLqXrX{fVZt?1$Ub*%W9!YyijAiJ1C-UC)%9=GpiDr?qRkwd)a3BgOzq
z>o;+_iNf)oDUBCQ^UZtWVQic{>}`6c?L0=2@1z9C2VI&Fs+m+;M}~Ek5Q7xMpBSJG(mEQe*#byRTe6s?8o@2#+TgJ
z063UC2whb1Qa4+T>|Iqn?Ymol|PA
zb&!6I@jv&x`_m0lRRSQ+!W^FC`}e#fFr4>E`L?icgI36?g=1E~CkokDx0nS)${1~B
z{vMQj=LM~rXD3d(@(y|D=6Q}h=T8A5p{J|1^efOK#v3bhkO2R)x2d5H_ta
z>cve@tB;mMhhE5{pMm=5%%Pq&_JR|d=h=3gzAx;{)QiZg{6-vxF}tFTZaZ}Rd<9;4
zpx7}JSpqZ({6rfh4fB$8qvc^7O9nk9fY08FY%R6Vezk+%@$R0A%C8|yt}nyy&0-}a
zXaww7rp#`4?;^w(s(45T7%qbpQ>phiq-We8MSqFMHdx{(y
zBJuZyd-6PYJi-f2)#3{?qdZG~tUg$Mhe~1BHNB$jXQuWjokKcIaK;W!%lu1}ZL!^y
z&DEOGQGF~HTUeED0?gnr2>h0Ld
zgBW>2*FlnJ><+Iw9C3=5nLBRQIsKLrU`V-iuYAyTczbtrNc2SPG51cQr^=6WlMK69
zSSFp$VerGHv(|2|W0pT^qC7>rMUT7XZ2`b6{-7+g?2YEM>ZA0+6=ioeOQKZSX4M@s
z9OioG4f^6*u3o5E&-C1?kBepxpr~Q0aLG1ZxA&P#Z@-0AB*VQ^bO$A_gcr-qVb#V$hLM0#NK(YoEW?CV|>NjSx!{>J!j
zXeJM)$ZafTe6@`GlBe9=MY^hPS6sp`h5aWxWJx62zZ0T-xIRL2qAOu9|Mq-ueJ$-EVlt9X{>Ge1B8(tO$+!_)M%F^`%
z?0R_Rldj)Boi#{(|JoRj>yObpg|#Uc-+sf8Ccm`@3d==4{@}V$i#@4b|eLcv8%}sJMVh>G7963
z0!5s??%LE-`B{##*Q9%Xk7vM&36ZWbR+#$SPgkq6x;yui2$8v)co`{PtSQjPKkBf~
z<6qI+DZH~O?kgJBI^BGN+w?c2h+w2pFD|0AxxRcARn?b<4KL#$9E|@Ul9!j~HEN<}
zVq!|R=*x3%diMZ66u5c;D#=FXF=>MlE&1uU|CM{jHV~f+?RhQpr5XVvuS1kdT?h0U5dQk90SH-yv0-glmuVBRY)uWJOK5no>yrI_`a-%;i)
zCu9DT?(^D@-1;6GNIUCgw_rd(uKkR%MR(Q}U@#CY*(AE-rsejvDn%WaVvj`v)R+u?
z|Hgtw;^nq)AiQkDj&fmXJOd+#w6@3Vp8e}^26|Z%r5W~OrKncF1#(?O7%Ry;v4)n(
zW2J4K8$@0Gvld;Ynkj?0(fP{IKmWJba00R0vbhP=gOGH?2Tf%P^E-NuHP+S1TQQ`~
zJ}^hX*qB`Gm}2tHn2Lt%LsDk9T$%O|p$WrkrY@ZQ^A%mys^BN=gjZx%7s6Tu+c=kD
z$;WhrQS_%gm?VL_U-rXrZm?8v<2X`%6DuSq`A#d8B~N&_MlzmSlhfk+bk4u5Pb^lN
z*zKsUu+8X`Xs0jxna-XyYl*#51bg!I)lw@vA@^4Cw+FhX@>&TJ5XV$vU5t_&_gwzo
zH*K+?6O_{o)vaH$G$dxe;wID~R^daE|=FE?L%Zu
z1jja9O!cM8Io&XFIiB;G9k{l)q9K`=FP!@GW8CPG5+ejsyS2r;YRO*S>Njsba+vLo
zgGm*Xc9D9>6Z=7))GKMa5&o*MN|=?2qoKzL4c7fDKYmuTBLSBeHIF(TP9V=`}oIxjeXS!HDg<3&ibtL7F3nQT)CU&EU%Z;4|XMnT%
ze3e6|OlX6xp{}m2_06rE)gI)zpGy$iFv6bGzL<)8Q=G6ovgbdFycqdoi?{dAAnEE-
zyNnqCzC&*$L(d_hqz@J&;b2ntQDImbY1*B2H~FshU3dZX38-^jp#n~0gvy7}2W*?8
z+Wa%64&Fa7b(iPTpYLarec10n=jmH7CZC>-mbJ0TMpz_-4GP0SA4jo+lD>WdG9X;&
zqaZwcS#H!l&hV2%VLYqLEqr>Vl#m2Yka645xEMp&T
zg}&3n*`2|cn)kivxjduLHU}GnItLtqX<}-DlY;Q)Ar+woA0x;?AAke(LdMFpF9jPy
zCzNh}s|S9k3+6U0LnTc;#_ikFG&eDSTH&SynpK3ty{bW9lG0)Fg1=htFxwf=DTCZ?
zrrer_$=_ZLM&U?S1AdR~*>iebMOQ^FCJt?u57n-R>Gzd;mXnc@Nsb0leqSG<+er!u
z2_Y+_rMk?6u&O70P_lGxi&vM6BsJ~6p`_Mz%`xeDb_e|4NG7HHbS
zgvx$8S^x^`s|yQ!1=h`TX8z
zo@!?C^9Pu@4+T|3io;nn$*7beeX;XtIgC94mrIc}&q35ZPG~ann$X+guq5~C1a)^d
z_Wj3x#dw$&GI5Pfm*jmaGOpFyi(S>u@dT+HiWH|#rT*mY(m52dk`ziQiV}PF9%yNO
zgE^T66^^bh9nW-KR_Rkwc$-Aq+}b6G<$>W6!4!P3)h)n;Ye};!Yu_jt)8A#
zXMyqFcV^G&M7623o#F%`lVXee0Sak~b#*_9eHYJ@k>tPN#>}~Hm4`tt4
z9&(xCP@_ynU6sN11P`oybd;2ojHAmhO78@)BMh|k%lGV4%qnb8tw)PAeFm3qc;USh
zVN~1oD~%pkX1VrEO<^^N3u9ev55OZ@d@VMjkx-;UeaayW@LHM*cSXJNE+YTuQbZ_7
zQWe$sZVB7Jr%y$xr28*()L*n6m&PY6+=A1*#d`PyWqP)H3arWCS~|HQunBxIaM)^fN1Ah-#nh~%FF}-0L7XTI6CpCPoFxsVbQa-SCIFG@e->k
zmk7N_)b}{w#ZSli&)U70KkB_1pKN;Hc%3A{b>5kAVX1|5{?GplC}EA1Ry)Ap+0CTq
z*U@fq-4O%?t-;II-9?1W^HPQ^)xTcy;7U)fNpNbb3y_1RAZ36GVGgWGIwCYj86?_c
zt?&8r`3SL_+yi{JLi&M<)BZwVE+~Noz7`Gygf;_9idxl-ocU0tD_g5WMlmxjaSvu<
z+`SOB0CM@EH{~BsVCn9Y%r3a7`4+0D@DnloauT8XmroS-+SE^$!iXV-NB9$He)3<)
zLeaKgpCQ)+YyqaFkOgm1|vuWS4z&UbqB#IB;@C0`!q1wJzAF&`CU>~-`@Yv#PG$j
zUzDbI9FD=-k}^g{Mqd5efZ6@{G&O~NhiMxIjdpK(n4DN$COp1qugFVhadp9)b#+2M
z=&whAyJjT&dE~`qn&mLnb^{z9f=4N6XwpG0Rc9*Oorh~^khTE%)YgV;kIJri38O$o
z;=d$`Y6vY8?n0;0hOT&WSgb;vdg(UZH5&YnoBjDyh~EEOYTA_z^>u{vfhMD#n(o~c
z_|gqbq%bzD-A1Hj%)c!Te|f|F_dtTY?L0Bib(n|EAwtuQ*rAI+AN6~yC`-mN<^ugu
zWO9i5QWm3h_+F{%
zQj?jTuurlDARqo4x$gcH2e{^B8g{?&l@`z#XdrN3L%e?80B!i3R#=@%bJ)Og%oG$b
z2%^lj8IzoOrAyGQWcfXBvdx+4am}}XP|iTg$NLSX5_`)fTHzOI+X*iZwveiz%FvxqfzIKA{
z&pXDl2LwB))$x-jAQH4!Br>?xARnc^jdT~|5~*afwE)C@~^cd0r~z1*V|#-P3-
z+_Se<#1XHgG6n9x6-uDVkQ5iNQs(Ok4I!=W
z->a)&u#9N9_f&%zji|
z2?+EGuX_U31?m_r1VGY4EgBJ^at7n?M@B@b>B{m83CS8TtZDaqoP8zEE%U7_<=)j+
zP)ACNS8Sl2OUorhH77Du1ea;>_jx)69hCNK#nk`#?I8UC@_}R0q!JHMbOzBqxMpe=
zezWd{0+sN*s`Vi#>rO%&TGKp&5QNu;AGnN#s_;60(|0TZksc^a8|IJoXRW7pBGUgs
zzrJSsaU^aG^JCV#BoE${5Zx}XsO=hH#tZ0xR@jo~Zpk0!OA_(~LGl2XZGyMvEIm^x
zIZCROB@68r2DOkR4vs+1f)4R5GJox$c+GqO&mIte7NRzSWc+~#IU
z7u!&_>;3x$pDkp-QCT;VaLMtQeW+@Syu)gGMF^bGA2X%
zi@MY8odp#l{YaFGQDY<)-aIQ?yVFM;~TIO;wB+R^E
zKMK>~6W7kZ%K`GQOK@lH&KEK}gkZm;Lq8IbyJXI4acx-L{t?K~*cZ6&Bzjt8{Fb*M
zFXIVXRj4%*UjLB$>T7fcrGbFkniZ(UvXkzkqVux}@}7ip$Roa#XoL8$x{gMF-34`-
z4&T0o>s>69)P$YhikColWxyD)NoP_;u+Vt|)0Yo4`Nh|=%-24@{qv-~lECPC;i;I2
z)bq@ffuy9GvK3G($g@%c&9Yy~WBaVKLaL&3v)8KTRJtd2t1k~r#OA(Z$IFBBM9Gg&
zza5fl)pia|T44~i`vW+_y+{C4TcMtK=k*Bf2d<}|Y=7c>vLnXJ2
ztNY$X>o_-yUk|CMDkT2Xv&V59q3!*^=43ZDH6l+`Hn8{8N^K&r2=U#np$j;3U95#9cJcs1KX&~QTXO)1C=ieMF?)My)&Z`&Uo
ztm!Od31kb~zVTK%A|7az%q2_m_l}D<_NM;miI;~o4F^5>G;{rh?Q@Tv(aGIorsRnA{)H75nmB)Y7>>FbUrIT`kb$B_=89Yd#PO
zjW0ruIcJ1j5w#D8F)al}=)~sK{OnNqkk*b}re2IEDDrS_KWq@y1Cwx5@ChB@YC$nF
zmVQ@riLsh8F{i@n#{IIV;!QE4I?ckXuMlqS&T9b#;s6DmI*ay%0MBdmB3$^!?lrIo
zVxTKZeF8Nf^RsCuQ{QX#kIR!(tH@SBlV*&UrK7adWlRjR$IH5s?;k#OQChG18EgA+
zib2Z@I?+Lti;O)j#hh(ftuBsbt;G4ezMtv<=y*B3X*c5$VU*P}6tNwysG!S!mT2n4
zDoisRUU6^;3d;H|x12Mnr^8;Xp{zLffWcbo*B6&`oQRUVA*N8hr2*3AIk568iS?VR
z;hb9fnX<+!yqD9R5VQ+3#cxDJL==sMX?!DAvG7FzObv+8;~|M2G{~p4oL<@`GFYrJ
zNh{i7%STNfv>V!Lwp1xVo7Vgks8lnEo3=)S7KP@)slu*&K4;^oMoeHZM
z5n(jaHG%9)><|Amn8)YmTht6X>49a~$2ih?X}Z5Kr(S()_`%^^r+4`okGf_}zCtHU
zyV?Lqsph-euu?hoj=gRkU(pMnZbSkBaBv&-emb491F#aL4X3MWYN&pec?gJ%
z-&~oLTXQ+Kawd->1@xtouVIOOirkw=kkrLP^}z%*S^}W^E?xz;dBEjbp%i6zH$b*P
z;fuwckjD;;tW#-PVUV^K80M{lP>WImxie#yRfWyagTdi?&h5*`rx{HtC?$?309
zvzvp=5PLa_&+IMp?Z^U+Za3JOUS2R-4JsVdt@Y(12m-1P2iw0w!`s>o^`&wsPWksRx2mI~9=EZwpHQF6^3ASJfRx4eP}n56=VWJ8m7V>@@(3$1$7cx|W8KJ!T^
zwX?S)6F?tQi!!&hZyXeAbvHkx%v@RBRa(4S-dAFXQ8J^H#U)lzv8%?yn@)w|_k6)t
zmU-{wr19;D3stCRkTT6?Yv@4zc2E5~8XZNr<~A-F#r&Qr)5mzFm+GB}kLx#gt77GnEwnM9s$e(g
zr1Myd13doLdZhYObc2YT-?L{8hd|v{{|Hwx32(sffH;*MUDN}n^XgtJK*g~*>`g%#
zxPtIyo{oB<0<*`!Hhr=Ys$-OwcVLZbGAv4vF5ehf(BvIp9H-R8>D-h`Z=zGmoYZ0e
zj*y>qnz5f*OcvZ0__)r8sAd|<(1D7(uGK(MvNdzrD?%a_Q@5;JiOk#$|WE45epDdOa!P*l+z<
z+hvML<#cBqlj`#>ps$N;2vJ%yaN(TW$`EzD@2ITl#cdg3G<9Tv-CG7rE9w~C+E@ii
zsuE{`sgFD8dfp%#5(-^%o+7B|2pJKLp%Wo~FD8!q>37QV$m3)m?j89xXv&rmv!Bkn
zR4F>6Ap7GJPck=fdHkI)xPLpu(iJj9m3ExV^82o$ORetg)?Y!@+X-HfGZklwHg@0s
zG2!!~CWtP*$K3?#6^sw~F3my%-S5!p2Tkw~J@8E2fz4zs(b
zlCGO***QFv9b@tj$r&GtmiskJ_0l1p<#u(|bO&}mW837)NZxSDGV65UrniWOd=1j?
zu(kN%@cIY3ZF<+G@=J~Pbi?9KH5B1arsNGP0;`8^yu>l@ZhpmCW3rCy1T6QQa5E2N
zH$!TH%6lt-gq(a4>d;Jjz+u2C
zIZx$PspK`f1JMk>`c}9`B**PB2ropvGLKsVDG>h>d}w{=>bnMf_JNGv^(%-3?UdC2
zv}R>5UmjPJzk9b)l28Z|#-h)UPW4lp6Q(?TNW29DVmKC0-x#Q=vryl{GhBO=1VvHk
zZo$<{TR?};iW7TWD9;2rF_7+OJ7G_E**-=**cQDji=C1lIz;0ar667+h+^;b#2xa<>ZYGhKu5l
z5aGz*`GW^l7D0-E%ibK}=8tZ((S>{RK@_ET$!RfGBVoY1{HLl+<5C@MSH5zK5l1_|
zPOn#QlTrw`b;`0t4o+or+0FUq@$-5SC6xL|EoY!+Hk#7B6y$URWgNUa!7-cH;dQmc
zF5W~KIdY3q7mW6ka^8`}D(3RymOX02Accts-rrKyi?X6cGLK3${hV4Hjhq`Y%^GE1jJyg!~jd3FNfi%D6J2#cGppJHvQH^k+A
zJ;dsgrHBjd8`~x6{(dvVw=kQPRS0vL27R21KZ*5_sA_fSY)z{e*xJskn_~hRbsL5Eq;hk+uiG7@73xk`HJteJ<%`|U
z)@pI&;k=<@M@tpeF8So2tz-=BvZI7u2Y@v|qVL{{-+yD2*@Q
zPO+XXpHef?PA14~a!__5IsEdE&xUGQ7LvvS^`0$|wvtUrN5_ROdU2flDsZ^%2l@MB
zfvYru(1&Ucdb4{;aZE?FdywAm)Y6kDj(1gJ+d4&kI**??_=}b8{$kayE%0|76e52i
zCRqVo{Yp&Ie?&p+v--|uqX3Q4xjovkyKO0dTP=JZbjCu(0td|^DcYq)u#Y?iqBUT0
zIpxu=ymTldn}XRP%{Km%C(a?4;uU#2h-@%8sC@B!2^pdCx!6@3){=9Vb}#Lhzt*lI
z$`S}Q?W3Q9l`^%3nV6Z2d@^pnppH0L@^3P75d(_;X4x7wZ86+U-7Hq^WGam%-`!yF
zOZ4=TA%1^PPcO$j4RoK2p91{p3?ZA)Sge!WulO(z(oX(HP&z9=oVsue+C52#1dSwT
zs%fH3UUrNO$-l->+#PQ~+8=l6&!2x)BoZM~^wX<1_L|+T-gk()1zIn2&AK?j^zyUr
zQ}32FfsU)rm$ZLOcM7}eSdP;x^(EYQ)xG1{;om=tfbd8B-Wfn|ynh{35LPd604@fF
zcDcr8-3ru#(!oiw3iWq!>qU_wF(m0F5ltz3C(}Slh3T$l_v@idw+bnWc5k&^uKJ%>
zwRW?Ds-q
z4*iF01#<+^O7Jl-Tmii9z{T_ISK53EHq^@k4#_oqo_}fgO2sP5i4NWmn1)?W9;x*%
zc9#FaaXfs9ocTPbP`t+NJ9ix1zE3o(fO_T8ffGTEYB27BM#$;BYs{`45yp__LSKH{
zne%IJic709J*L{9o;UyP-4I}WLF9EZO{>UG4jNSu@zjl5x6B|pFG9jXp1TBOKu8S^
zQc<0wWjy1%QYuSKT`Q(HHI?&lgY80J+q??)(dqitk_ejL?Z}G@QLCt@tMefmc=&jQ
zd-visCQV0cU+u(|{&PUfHp!0jBL7uPWVb=D@PbO0%pzr3Z(!!J;$P1D?u!a3{YjS}
zd;{`N1JOtY>MQ@B^O;0+;&B32I3f2rAqIpu^XP=EEZ=kQOa9<%u8QwYX5fWf^I(x0
zs~5bjI-+M_um@?w3<^4-&HArLim{)&NGEs0#VpktE-5!xUpe~n_x3R_F=y~lyN0j?@s{QC755z~B|cKtW$8
z2}c2X;%c@ZuW;urE?PnBPMbktSi~9ro4fZ(gIPQWiqk^vIi-bx-t8OE@pc+x;qfar
zLn5VYHIh+R*VGgrz(bQwzHG*mCnO-&rf`Wqw)=)fD3d;OIN+ztUhOxBIU*k6{~?n!
zIP)KR#MDN~ExflK!by>Y9K(!jZ{dM|U=AMJa?M(yk~gf};S32r!SmA~{yF<}2y^tO
zkSa_4KZI0XVwcHC{6G#C_Wlh~ut2V4?}c>g+X2b{xQ*SP*5qP?==N&8xp`22Jw(D2toFY89=T4ynFz+^SGEpA~?OzNPL=_Pqnx8m?DYjcaoUv#(=T<%0%xG@pq
zS(Z`KwlQ=iH{dA3ESabgAnlfRR}|Uy>skPtkI1C&LqGlPSC?98Mt+tWFH;#`(Dp4G
z?LNZ;jd6Mj&#sNRwMqZxb$!V%QJ>{l?Of0UK0mB@1z5dhNP@}uP7h0!_rQ4tZzi&jG)A3snS-tBK5wnM#t4^4So
zQc^{(82lMli#NGnIg>x26I~5N{Qt&Q5SKhCKoX|(p)?JDjQx?Tu}{|oX>vG~)xkjN
zPN+&u`g?A^fq{#h%ku+$nd=lD{bf&N5ls{5JEC&Ud$MP_o(-E`M4dvsOBJX!nQ@-X
zMuRIPEoJ^TD?PsoQ82ztx;s(B*DLX{k5FpqmQQeB46`0}XPsyQajt$AC{IA;$HvV3
zi0ja9Ou~41;bnUThg?f(y8TOUOpkE5DHU>F{q5DY5~q!uT1PEgs9(S`TRe}2xbi7F
zw`t%e6i%W0wfGu@D|~;UEzYp5C>LJ=Us
zw#`sGyL{*>P+#Eiz>nE${uZG9iJ}rE^8zfwRtr3Vv-!0CgS9&BeaVgN$RQ5gcFw80
zSjkXc-3kI4VV90Mps%$M!qR(YUr!~dgw#z;Ozv;d`cZ9-55S1|kJA$X!LKV(n?xj_&qGcc!YyAPvhPm12N;zT4U&
z(M)Eqw~Bt@qmBit2S`awQYF?#IFoip+GP1jh5Jeg!l7(s*~~C&><$StdZol
z!x_=@NgQitBSMtAxcc2uB`K7ONaBMBzc@RqRBw(GNbSW>ZcA8t+}K4iB>vmCNoKf~uY+?N__
zh*9yI{z)O93lMvzl28_?LaW;)g^|eI2~~9UBJU|6VmPn#k0&Co!*~hjm5+RFIh3uw
z*DPm<{K*!mWMFuRMWl#(5pZ#ubQ;%?X-?~))mMbwgRecee`Ke1#YdtHICwg}Q!9}k
ze`Gr!jAXhd9y@8tOT5=Ca0g-AF9#i>5g_k*d}#Mrj>*Q(9h3i(2>NIFbrF--R917_
zcQ3zUQTW9UVyV%&&SKeJ$+-oI*n_BjBL2mif?Q8CADU+E%`AnWPzn-g&L|ux*(yKG
zZ@mzlZ;|3EO#nsN6-cKdGm56q9i$P+Z6SLJNY9FCAGDMPPYBFD%s^nv3fiC?W|-_A
zK2q`|MTKczsrCC=j=gN0(-JV#iJh@M-9JCw20s9S$|swAqB
zUB=W8n;%*IbhJFTmTRHf#6)#*LdWets`Fw$C`dBD2v@CO^a(rON50Mx
z>C7kYGm3G43%u8r{6UvgjfB!HDSp`C$YBQslY;0*>~Zlz=kbrL%yd>T7?d?!Y^{b;WH@4D9O^YuNTye#EW&7<;BVm
zYsR{$B**0&`Ws|~Sy>^1c!U4}zcJ<=gH$(*6FJ@w#@|4z1VexMp%WLb=RMf~T%u)Y
z3TQoN!^g*G3Me~SK*Cy^skReMoSn-s4nYfsms#Uf;ii)ib=gD0{@{*y*ZsTtAj6*J
ztA!pWAa{)R+;&Dd+WXThXq8lD4s1e#F^J6P!xz$Wn%W>+F{pY_@0vrOgL^OkX+UCE
zp-Z7OTww#9^V)Ye-wLMySBd02J?_t_BZoO*#nyfVQ3aA?N*EB~gr|BT#_)QncC_&n1K0Rfxn+GQJtFH_NQIPCabq}03F=^>U<}wR`#8DYg
zJ**wJsM9Kc|Kcytk|pLR>a-*F>KH+-z$~x`bD;+=g|(_<)Lshw^0-Jso_h&Dwcvw3
z@QmIk=66$}uuDgE3Aal}Ea$j;r!pT^Z=`~D>u7a!MtoRIi>Z?8mXhC>pWkvs_NB_b
zl6LCMGI<=qqx3UH%ObkJ#*JM7XpK~}VbAF2__azG@*fn)z_pJbuWJFH{X^#6ZYY
OGU}uspZfXDbeI*Mgt~)7-!GG$P2aKq5pjy=4=D)?4+3WP
z+F!VE0YUiCyu=27oGxvYLXPYE^y#O+Y2bIiHrQv6|^CFN@+0#=hXT?sCO4qG!h
z#k;ltzfBUZqv8|k8gs=u?8jAsX+p~P?%j*Cr515303t$d()rHruPRz$T(sx#kN72u
zb@q#;o#Mim$)>a=d4D+X{+qGD5H$)&nPI7=u*-Oa5ezS3LL6gQ^2wt|t@~dII?Out
zb07No?E$x92XwFro>GtVC8zceeo@Jn91yK-_o4ay6Or)*Na6s)bCCWZ&{06SJ-xv8
z&0iv)8nj{xlYJzUJAb#}L}*mcs%KkMxy17tnxXL1e>`szat7pqzyGl3gL%tv_m?v_
zq$DVob#7yDVU_nZFR!vZ=@BA-Wuho3eej0zgGtA7EnrR
zii}CA4Lpq&sQPQ>(+jHI4vO2o>!KLjsM5Kja4CH9s=E;7tv{RsDH*&$ymucx2a
zG%_ei?X4+RvgU9p9CTD;AksMoMo-S!@{QIqF7`8^WO&;v0i*3Su3vBrd0=8yN1sejq7=bPE#y7MZu!~%o*p3f
zAA1CGc7l%cY2Zj_9vm*Yb?L9!S|N|b+Mn(YY`lC;T~NJFob|b&_3b~t*9P)epz|!3
z^ZM?$BhqEcqG@<}7#$4W@StHaWjE%*Uk`@)ulZZkq4A%@!{oc9qCC#xJoB<-tf>F?
zLx=|f*5Sur5OgzZwcu?RNTr9hQSOfadU?K-Nxhn;t0Clq%q{%ems!WpCC_7Tc!tsb
z{Kmh{nF4y62s@!U%XGI1{IAVRXl5%gf;d-;0(;ME}U(kOwjh^caX>)6~?|)}aWq
z45csQiKf^0MH@5%5};051TYz7&z>;N^@4T-*Xi9?&qCU9ih=K2-JV&O%jb)hN3gwA
zl7Y{!S?4}O=8gSL?FeC(8s4lozdejI-zdkK?I;_yB`HfS-xpDx$UpH`@^h&5)!2_H
zM&>)OoMN>q_nMlw>iT=CYTQNn!qcwYeJ)odLBe@l{^uES>pP%knK{WH`h*m5el`G9mzzK5b%}
z2J`ekB`YMF{?)w!on>Q9hzJ~R(#fG5rnYXuWa2&2FQ)5GZF?5Ey4W;b2@bKnu6C7h
zKZdCC=CIduZf&lO$gb)Y&Th1JG;XWg?9|4<;eF-@E(LPai|r4wZDKL==8a7FblJYy
zQ3hxFR^u3Nkm1|nqMcP|!=mD8WqkUOMP?XJV$*Yf|E~4gW3$oS2fj*|N*75dNoU(y
zDT(dbvj;cFz`)QO{{C3tWoA-YFCy~uSz@DeV$;Di{8pb`#Xk7FXm-0rxce`$1Sl3U
zLec^)u{xq9a!vd`mMh9rGputk_K?!N|``3eCB{33iM97Bh)Jb!%Hek
z)>fgdbvJ*zQ>TYs9h!3%#erp|!V~E$Gv`QLcqW9bh6$j_>|xC2=-HP%x6&C}Z*Nrd
zmtl~p)i3$XD69SH{4L#QG}H}K^kW40_isw7wL<3@2)t3icl5eSJPaAOlCgkk83izh
zA$)6e4cI8-uJCWfS~w_A+yf;_z<2Rjr7xZ^e{L!zwJ-lf{B<#;6_zO?P2P36m-(pk
z{tQx~Q@bxiHntfhJx#ZH)N|h<83hcUGS=m+)fAOjZ@aq(Yjgk+`Cl&$Zn*4R)_P94
z?)M%?Tv76tiPgI=2cq39Ki$@PKWkLEc{iq}t<~SSCOqe~n_K126fA6;Dd
z$wZ_`Z9Uz=D(?AIN1}7OhR(B}_I${<@NX<-X@X0@E|?|;=_Z$T7pHyr4wfaT6JNi|
zW7uF^o*`s9q*a`!?^Sj03a}xRuk1x`MpK6ur8ePImMc=u2(EM_gd~P6^}`yOM5jS`
z0J*)Hpr6?1ax&4wc-a_fZFkq15n!@@skf;m#>zhjgm^|*WHKSvOR+K1J
zNWQY(Z`*7_sGfd}zuZMVDJAM!Zlk=q810Ydh6cMSX3V{(g%TzNYQ`QgW-;I!kxeGq
zf%#+!!|8?y9vpr4$Awo>#M(?xF9-_{!1$sCraq-=magTGhEEPCKMmWNDc??2rdN^o
z#&$k%J7HjR2Co|51@o$_Ls%7rT3_nL?^>nhQSl8z*%fZt92JA?i>dO2(_FQ|hX~%z
ztBfs$X-v2ymi@n@5L=EKKTx($qiL)C&4aX{N&&~(QciM^kA||B?WMDG-DTTMgw5mQ
zhV1IOwPPLGFE>9EW8f$5ZOay1ZDLc+~W2*e9%pQx!DihU`&CDbt
z^R!yCm9ckHi4&L#&f)F}zdONLan6dYa;K-+znpp#=d*+!;}~Uy|TSO3M2C7HqVuK
z&K@omSSqvjPoNYL
zk{qgPN2DZ)#D(Uem97%JITgnm+m)dizEAf;Pv(&EhIJ2uu1gT*Uo7yL_$AY&)O@7>
zBUOTpP^UD+yR3O2lUD12l6(Tw`jApENg1&UcKba-58h}mp02U@d3G@(RN@}gPi%w+
zp-KM{e^>96l_
z_^%@#tp*uEwPxMe$oYObrd}V-2TQE6(l?)sL&Qw;Y$S6HYpJB0suQ=wgKn
zbOmfKXL`=%lJ?=ezF~uT#}HMQ`t44$)$criyYNx#kk6R}VJtPtr|>$Tngye?Ccm3~
zefYP@BGxOGNzC}*-q+F19iI>aaley?QZLJH1g>V^UXh3?yH92;v!8}UYP$Vx=0LBs%_Y0criq}9(B5RE#ev*9;c>{7
z&x=;T+59QN)6vI1KA!Pc1cE2b(X
z{+J?ghg)i6tF7cGu=t;kYQcHwCrY~Gx0BxW;whL&et-~^;q>WiXaULhvAoWs+O&_u
zV`DpXLYE($Iq&p;Y<+n=)Zh2N8OFYE*@?)$W{pfFdxWtJLe}gGWr?vwMV2H=LLp}C
zd$tB4OGO!bjHP5JSz7SBqk4bJ_xGPiBd^z-d+#~V^E}UU?(|Cvi6}Waxyq(2)tn};
zF$ExAc8k*ix^%`bmb(P?z8X@hyacou;z5&jowu`Q3L^CS>MZpn8G1)5Ub8{>w0t$GLN~x%4GxmP?16reC|r
z<>DoXi-z7$haCW_&vFsbQc!0MO3dfvxu8!n_!=fuxIva}8@
z?%oPQlapyk%8!1zAm^v|%#wuim~*?rMucS4Dc-0^{mctkL)nG7ZscY-@7RPB|x
zHIty&H*v^-rTL$4ylZDbZ+Uw>yWHAqpRmd+WKv_G?83U75NxV5+~b{Ds|ipVc7p`j
z9YO4f`lQi0d{Mo0??voYRi8&(48P9Q?{J4#fQa~rRBH=XR%3{AR4b&caw;a3QKE^{
zJ%MVUg|nPrT*->46R{dcH#Ty$w6r74s?_Yng
z`nLmyL$Zz}W#_88gnRX!k4=`3$)#PWjxg<78i>NYvp8iprme0W-rQZs#KaWBVw39U
zACPsof8kLfI&sK$JJ;@o)CDyKtY~3dYHBJ7Q^9+QX1Bs#fG*94TIS~FcIj(ezda=<
z)6M5pI+ueZr^lJ#rh9iXqnbp1;okpz3N{JKYQ(+SdV{L`>gt8!H_-!V%NkGiV<=IE
zaNXng2NpmYHWfv8s?XiZAVYzsf|C9BLB>izqq4|E6^QN}A+pXx{#@|D))^70tJhM;
z9?ARnD8nNn7}kb~Fu5ny!NpiRU;xKW(8mThS50B1r_WBMaRZR}$X!Hl^WJ7@ZTKh7
zUppR)qDt39F@zH*^diz~AgQ9m$n4u)&k8)v75*HFKQ>)MLK11pZeKfdhQz750*t|=
z1`NEGgTqmP+^UE$1Jq>x5F;)a2ip|#}Ej#}g5+wYHvY?R0E+F1_W#k;JT_VGp>HbUFeKC95E7XNkCz3X*
zI;j(he|`ABcZ_Ieut!z)+TcFC%xvZ;
zh?H6Ij?1G;ZU+XC&c!C}(~;|3rEaP=
zz&Y;LAN7ff%0Fa*2wDiK%s&gmOS>vf53LaV
z1*J50w6sxG`PWCb^qU;U`%*9_j)DEgO^*QjOfjRwmjvky;w?o
zE*$1o8Ps0X6x=
z&*l;{1aklPl!JsPA`sYoOk^kKm(B5{5!pwvc)I`_rF}*C$HD)TC4w!-BVoV(x!=#1
z@O|#VF-@?BiXl8c&rlfs=Dh)9+k2UyK4@=mJtymX+>OWrEyz>KWBX#pTStwX%|AqN
zEA1leyJfJ9-UBD6>;CoyApf{;e$sqZvb96gBFWmU^v+QM88)ip?GE$tXLhX9JwD&R
zwf-ee7Q66~sdwxtsvjoGski>Fgf}N!bnK(Kr1_(WpG&W;50LE{()RkLIWkH%aD93Y
zHlln%iqaXL@?Ep_n-As-q?BVtLCOAaqu1$YSD`81{`|%)$vp6!dg^OC^3~h=>w-I7
zjsgsv4ETyk9p1-b-!FlyT$#Y+_0N98G&D2?MMY-}45*9DJrb`sj9HnRld7w$pE-NB
z)oFn%-P^;%L*4BAx66(wT$*dv_BjaMk)&Q+TA&&x5~KVf!3DTwJ7{xAAb5X9qEzf07|Rj^Mr1CM
zQ&C-+AH&6hw6Sq()I%wJPjz8|D`EkUw_oNGvnV-ZW_B-d7|gv`2ZN$(voyYgtFUH(
zxTFI#5RcXV=;j0!Rp+X*Ipd&;{@PRR14gTBmK^Ynmw
zSuvS2lY7gP^c)8<@5m2|D{=V5&|X5Tbw~HW7n^=CiZ2
z_MpxVI(_NZs!OjMp48UTy0P^gC<0O?VrH1AFsJ&=V>{`{m^4vO^PwB9&4t*8vxS6Fed
zTs-IeSjGl>PNLMn5!qJNuiw}tlF?fWb|}ZVfkK4g(~3k?t2(i+Xy3o|ofPXeXG5Ne
zk<0AGH3_4Scl{bn5(E0T11AOwC0x{1rKMnr6PYF4QtXex#t~l%thOvRwFdVG{doF?
zG5zO{$^8TXfG)A;Fy0FV?B@DqOO#T|vm2NZHm8Y(gw*!8qfLvJp?D2xJbA4oiA;9JCL!R9}ty?D8J(De#Ap_hmO?OTx;0a+5E2YF735F^gLC>
zz5Own&l^Tini8s}fTh`gyz8}C?2j?3?`n0y7!$^yseTKF&_tlYXfLv=tjemYIw6rR
z(xTTy7@Q7fD!!A|C3H=>2N*a*&_MfO56DNPV%Le(jn7$$+$UoQ7Zi^|5q96-rB!{;
zC-iZ$X5-$DWejz6oV95VWd{;pwLn5L#X4?yuKC+L3Q!kA*%*n37F&fb#{|6q-@}gt
zI849tX@gSIaZiudMY6}8)5&&cJZ~b!U-e|1U!)59R`qpx*?E_%V27kY9X9L{@!k$5
zalWtZRlPE-F2cu1@R&{8x
z3^q8R<0F-T$e2r|m44>Rd>r5Y45&A10uO4Czp}4cTe}-v&$@jcn+6l2L-s8aVU(6%
z?1<1_7`<6IA6M@7@(4ZmBYbt}*;1+5YNq#TiY}C9AiU9XJg{L`@6jsYE0Weh=XL0_8=~*khXAgI>y1lk(8NvhoIwJb?%o`SAS6=IhQ&X
zdI~FQ$7TgH;aavDqPufSIhKtUT
zFZHyP4PuyZpRT>j;D_OiS{@ieO`XH5nk1*N`U3YVSx5$V$mJmiyNPG%kIPBoV$`Ew
z;p@)LDSVF^=YKvqQ4PFBgIvWBiXyrYaprv%>~i>QU2fx9DTqcV-7x*Nqko4*w$t_?
z_7;sRYmR?QLa;z
zUY{v6O>qp3Mz3M)cJ=gWe;&B&OUGzg85tuZBNN_{-L?7=#rqR}^4vvNLXo3EHI^h|
zQ>!GmZOrFIar+4Hf$uJ?WcLs^c{*;-r(Fnq`r*U53m1665ZkzuD|N)6XmZb7$C8qH
zf92{6&9Jbr9}bM|`=C-nduv!9z8StZ7hbi0+7mQ|h@C0Ay5yzaq;4kyk63|;3x$U|
zehL>*Zr$WPJ}2NbNypk0y&v+UROUp9z-K3)N(YNK?muT!wAbGXywF5wKG<*wHG<5L
z=k5ah_KD5Mx>A%Sn{sR{BVH~n;oje2fS3>OBQte8@y-CW;DhbCNX$F!?^^*sz=ZH3
z*csky_=t1Q5^mpa1){I(s{21TMg_Ji@VLQZ^iK;#!^n&Sl5M_!!$o<;RsF{U^HRh`
z+nk&nHQwy4Zhqulc`+*Y4|?xCUg>QWNmV!RpJg{Nda`69H4Xl}Dk!d$!jK=Ea^bvc
z!BxB7ZyqTVi|mL!C=T|&us1CYnh-pJ$Q0vxG&5wZboXT_U<$qp)3Y=uE4eZ&v6Cb
z;;ZYyXGb0+vyCt2be#29HF>ufHQayY7v-FfxpLtu*Q=n8D;=H52U*Q;^oi9ZxhMc#
zYpv}(tw$8EL#36C%iVnyG6L90BfDA<-90FR2p6(Lq4nzFU?x^gUn+?zptvzKnyg)S
zg{&~a8{6AMtkrjqsm}$1ChkSa%YtzRyVFNrz_qksVLNTS?#>jC-u8d^0Vd5F$KBA)
zwsfzU@O)28n)*(*q@Krk{5!z=`=o^W_{a^Gs)?V9jcN|$^i+(uug+dq4ml9F=WJ4Y;wt}Jjf@9vYv
zcVDF%8q;89v*BE)PoMr$-XwTTiM2m@l=WRO*oGvvYiIX8Iwc-O#+qQ`U>d#_UuNpq
z0x5s!4`%1KtS9QlHL+X2c@fKfMp;MEb27c4v
z?2O!7rN6;g`x}IHT%Ozb*A1ZF9fGf~j
zor!X{&{tAkkm&SJ#`1<)iaCvsg}s@p>)*Dn@$9EfenCzkJDQkYVZKrSh#SJ|%?PFu
ziwlW$oSiIz7E{r?QTUC_&GU*bdhWE1E_g>3>7I9S5=55m+b}&Wz14O$Cf&F5+GgVH
zD?UpJ>Z;)HHj6WIV|qz`&dR-BsiXPm?2z+Z^WRtRPNbFowS6Zfuu2K#pDb9-(?$#K
zHo8^^O3nzi7>F?O{n)g;H=g5^)E%gnEpk9T?jjhR~6wtfBr04Y4KyG{_M$T
zkAJ?R9`tZo0XdA=to}ZjvorRwM^r3dw|=AAa9?Awv}yV3a*+2Yx&6fX*9Gfrb}Vc$
z4wlhBe4p4W4nF>Vk`m4JV4+y_>89`eGbO9%#8=2B
z1EWc-UBX(ydS#aJ`SqjFxEZVAG%aZ*hU#npiU2oo4zr{Z>>d!9b
zBIw>SSWxyR+>m?i)-J7Dbj2k=YQh6e4u4)8gjwue(4JJ!-9no*WDNz8(rFQql|XJw`=I
zXV$&zQ>*K^!u?w>%f4=%K2bC1xH~_zHo4dwx%upZrlY>?k5f-yP|#N4TVRDdo#E$N
zn6_Py9z{C_^n4fMoG?2*D78P!7xp7eK~MByd|1PT+Fs5J7?f0brM#M1X(M2@*>2)6
z)kViDP2ghRcJ1VLM3vTn8Dx06@Eu};rU+-U+eFfM?rHP3_pMbGL|x?(b!P8~x|~v7Dr={D+mXeO;0{3or0uYy
z`~xRf#-j4^gRvJWNi;f$+Y=(cxG6o8wM5vily%jHc|VT$8;KCkU9ccufP3DzP}C-<
zEsu)&+>KBH?JqX<{)M~Gva_?*(m8l}6M@2h8r;>8w9RN{O8~!KK-0?xMxc<6j)fuT
zGJdubEgH72OH=v_@I?&fu2J`PBV%^T%q04dlRR!-9nZzI%TKz>j}CM%izJKoxqnGO
zJ?)x}ZRt9SyoBn_rDwh`|D>qi%G6}D*DojgoR~ZYD+L-xn~{3^UHlSp-D3O
zpgQ?@tJ@Cj&q+$1j)fe3>ncV_UI0w;I0#j&)YpkB$x7iUEoX*ctCQFA8B2W{qaBZM
zJ!pJWs~BW?thr2@WhPe1{oKjbnGi*aVa|vsQIG1qTt}iQITXbhM7=VD^kt99zii+d
zcLWgfx+^YjKn61&TrO-Ajk8uRogTymfk23H3>obp@-R{v*N$jrN`fy&#AU2?%@3V7
zpDU;>%2IpD5dmvEl{jM6bYZg;BxQ-HgxVe6)Ugf7SMitDT}ajOt$K%c@jPX7o4d1{p3&(vQbXDR-3!gg
zAc5W;xPj|{He{m$h?0URDE*JxSB{nK
zPd@{GoW^Y6NW)ihnwu|M9q0;RmG@iR1Mji;&D*chnPhDi8-Cky3a3DN1{dJ`OmFo=
zES1$^SI-$5k2DHJO%|SxEv+c_bCNV}>hU9P5s2uDC9|TKU
z?5@loc@dEo`KwgOvm`+%wbCW73Ja>LQR^zyLX4cxlZw;Mv?|qWST}@VdoOP%@L}Xx>Xw!4
zZ+$H|dRh9=lN(Q?z!O#DdhO-cX8k^25aAPqfRyGEd+`*cU%24S>G!z!!TdqeN0O&d
zO+kweGT$)qg9ho1!cTD*6&%ch*;X<$qhA)lZA34@1FmBf-YOs@@xTEWjh??5SwWiH
zL3UJjU{dS_F;9SLGF8O%3us^}!V5#nAqDlz+W7yz(4W;2`n@{GNvhx;Uwsiz1K3-k
zPpjTR80}MqN}t`{cC?!~js{b`U`RtDb!uIj_S+9`p-;f2oz541SzukB7#nzKIRe|<
z@pVlOF4nwgz;{s~y&paGwNvWKO;IXo>bfuaGfSJtQFsRUtMt7(j<>%nLjQSAR~Q>G
z%YYo#9p5$6cU=Q6YxcexzIa)pFZlUFB&&UD##P!Xq=EUd5UaD8EF?rsO@>V$acA&6
zyF;DHNc8mW{H>rgY6~ms#cP4ploiP2+{j|jT|PbtE?*zM?9kaIrU;?110{#nA5#}q
z1^
zEprX5^Ru*2rBsV3MTJj}+pZrSRUM|g+2pM
zaD<;M@Pcvw(=s(7u-m;(&d?6jGC}=+@i_|W72kBwpp!YMJM+F!A
zWA_@3s{87aT!P(C!$YA@onSlEeb<7Lz(|po~5`lTmj<}Ot#|y`yFVV2lBEMQ+6P`m66b0o6
z$J2@*i<%_6PcDtm^?SwqStEO7F#5xYhuJ);_WXOZsdoYFbYsZIR-2SI;pLPRkm7c-r-!zERM?>fzy>Lih)U&WM~8)U6Pr>S2!G
z74iQC!SO~SeUkCU%&|l#Qq0&h6md2@i#*+s)#+vY%c7PZhKmUHVt1LMH|)in_VQ$W
zx~y$qD&9dN%;kh=@4UQib&DJU!Hqu&K5=49e(aO^$pqVij@Xk_z)zO5qy6DJ*?C6e
z*H?~xX}Xn8%-sCMyNSh3(yX*w**)Uz`L&q8(Ko;nU-JkH!3eotr~;q6hzdYu2eDI9
zC!u)UGK*ozHnZ$%%sWT|+~e|@`;=9|Lr*tMDD4eglvd7TVVdWpPgyyM$;kLv7OX`6kWCg&!_oVri&8
zL(K1!*Ey(c^I{nxD_O*#hPW%jmq#4v91dJ{W7KHAUYfoZX}d%JO(}ci_lsb6o|IF`
zJGEHzH1C?nduJQrf-BF%ze#%-oZvyG-)6Yvkh$fjNe8W{7%ta>e>|)G4BLWbMkv6c
zrH6gBux}ewoWZxv>G2gJIZHKHNhL2=1aK
z=K#MkL}yTs?3%?{OxIf@>sj}a-ZSwAbeg)(OnRbR+fw9ddK_heJ~9ce76L-!w`Yg3
zd+DUBC!bx$bwin(DXR)^lp+xyCO?U}_hVQlu9h|m{LMIm+<}-c+qJCX43@}#dsC3j
ze%a&v<3#9V5db`U*(jy0>UrGfkPKov$53FCde{^K!0N-0sdO
zo5Hg!DO)9!*;A3WleHK{-t_!HW!V~mI+6WVO*?B;6D1zZqT2Ywu`c%T;jCu{<#c^k
zM^7+Hh;8HLd6Vo?5;nIR<{1HdFO_<^dE;V)I4{R79yMyz7c2EXF9_={`?khnxobEY
zY3ag5TuhrO85WxWTX+>seS!rx*9Md`+52dj~f5vu*Z-tq2G8#QPy>Y=SaQjy>cimTVn@>
zUm8^$D1=}8qU2BcH3GW{EzYu);Ksj>80_Pt%1?-IeaC)F^yWhBqgIs@wJOl!yHmlR
zJq1sVBBEnlGR)t~_qneS2T7^iP}WH$WqTG`wC_7^)@FrJ;e(N9ENLlrSs#)`fQmkK
z*;c8~i^rLe!LW}XyF~2SAf!kL#iMgv9JfMT1TO_xUWr?%W`xS#k`TpD8MP$V}3W8eWQrvkT`XBcRx%{VUDGY
zoGzvXX*L*LvEbsR006+FRzh?d`H6g~4RcfXP8WUqJU5H7M!Oe!`vStT0`mHsXdSvn
zYhp#&aaQN=+6Uo#77*MV5hnJWu~FMaRP}N06#%c<+z>Jv>gu`2Nj>C|olY?xrw5;W
z$={NSb*e3~h;!gRWpPWm+SgpqGds{Agv>73(a_9(54e&}TMKWC@PH<3oRi^}AZ$YH
z-!LD+$qK?e!J+uCr~@oEu1>}UfyE#5ZF&c}8h?%a{ktO}0rNx;O6Ahr*FJUh3+`iXHvsO#Or_9eJq>d;WptANngQCpta1XG|
zKzb&@%9kvNi$P=?_G`4kOuCymlgg$>}P(@ZnP$c8Z}+oe)ogSnXsvLJf~L>*W}
zQvxofeR!UH*kur@MWq7Nx#I=o7pRnuqo!D5;4%UXG_KuLcS*R_a<_0j$p*L7s!}z|
zl{{E~mUAns1iSD-%k7fad)79}we4g$2H?zU03hgS|ukSrE!*-^3tKH{S#Hi~&jPX^0eq
zeKt-e*+jv9d4jRA;iK$rF%{OAcbixdX`2aMeuQ)?YPzXW@=}~Aov*!kpUr2~ttL9Q
z>+<-8;nvAR5M4MMB=BPTBy4MoAlMNSmIqKC@xF|AkRM-8-N1>
z@AUrPXHpz|EqVNrNZ@M$_%whJlYixMEAH%ia=nkZSa*m?hf5~*5}=Nv@I16
zZn2#bW)@5}T+o*I>0fOtehK@qsa@%@?VWUAvAd4Mo3;}h94F35Tt-k1EL|Np{V2q@
zaugv7$6azhoV-E|L6Qxw4TZd*7iX|P0DSgvhzNI?oU6P-=5@|$Lxkj2P=txqYU6Dk
zh;J`T|7p7wG!x6DjJtNl^wielqR;*znkE`+eXVA_?3~0DZ-Nag<%!6SLuf>!5Xc>I
z`&M)8+mpnL2^q6KhhiyEhuuO=SO?h{x%^gqt?5DL;s@<^)M#srd(1I!5;spjAwHI!8f
z?pJ3$A_fbj#au9aiva1C6%u)PJE(b@WFx8{#+WaiXD?Ya`$p6-dcP1_%;+ocPo-nt
zX2Fgz;fEt}fqdV+;bSYqFApzzDB_RVA%Dz{*Mgd;*r$ndm#r_I1b8v8CljEmX1mz=J~EsuC1!whaxeSc8l(W}B1vXhkOk+}G;(e}}Wr(!(9M5z=nH;b~Y
zQTFAt{&1HtRY$XW^_sMOpd>T+mn6%Uf_thuaUdswQ9Qqh2w8BtecvfLQSP8n;;3pdYk*LW`&=HutL_XYPXmUd(k11Q
zuSt8R{p%AsgF?QBvP_so3=+HAEaJMA&*t86j~IO5_+)Bs?yA7E0HaA(1P>l-nf<)a
zZ#O+8LT0tWRlM=A+*R=xRQKIDGv52riXZPXaE%%!ENu);cn1-X(HG;UPl!Y(a1@gd4EWTp(P?yxsoYTbc;<^+YR+d$7Pgx7|#IeXUfD+ZM0;fbin1qRh9bOX-PFYhy+WOSF)#0&`ay2Ql-zf%e}Hbw}a
zyp^9ki~?MKp#aiH&VTavYPbK6^-#w~aDtPSReKI$pG
zvYtfu{_NSQ99SV+3d_W$NtBP9DSNH<95G^yD~;A{)9M))r1vQCDdr3RbVf2~W8qX~
zXRz?N?WxW5meJUBRTg0NKtdqtLy-fx-(Wg_z^83h0<@){O24+Ek_Ds~uXLz8Kn8(y
z@c^s|$je6O<}Y6o7+jTV$*D|5ULQ0|#ff&-<#h!J98uDPRTawApoxMuSoi{;TgSA;
z9pcW}bRY*ni`1kkv80{IgZK286F@+vO`(H7p%xr%u9A%b1m`sIS{@u@aL&YlkJa#2
zXVv-h1tlKsd146D1mB%!&Hj3woz*ymoII19
zB+)nY)8ROJK@>}bi8y{Apa&zKSRjJ7vB1jrag2yO#T_9oE@yzGD;{OtIQ}x{Ij%(F
zW}Ya8Td^MO!qvyZoyUK~RTFu*m`IDeRO1KWHGO{YUG~i@t$sL4M4J4%7}^Z}8J-Y1
zbSR6F&V~k~Qsphl?lt*Hc5oD3pLtaY_CW`I5=U{vmBEWMBeg0xHyXP5j#dXT8G#M&
zoeVXn^=A-!iDLIw!bw|Sxp?Blh)oF_&&8Ie%9JXt%GRh|+pW#T*g-u!3PfGo%Qiya
zCGD3UhBX~C`X%fBFOFd|p+zkV=XR|d733^^7?NTEX%WNNCx@JKlF)X88?hI=WEJ#_
zrX1mNYnh!oZ+S|Np#`l9_dc)2k%5aeMax$Y`+e1rKQ(Se-sPPdTyhj0{zB1|k6soc
zyq7U!LNf>1x8w_Te_{9V$iFy27*9)BWqHdFIpJ|bPN+>*NRSdt*j@+n9>-D4=te^o
zzmVgPS|vdi?+L}fzTGEl?$}yfXK9l-N~(R<15-@%?2G$aOM(XTeMNqGN%G{J-ADZ#
z_b7%JPz$yRtCk;GtMRy9l>D2dNoCrH|9F;cxDmnRg3w@-FMZd=8SptwZ4RJ7PAu9d
znnw&2RWlE2jd7NrE_>NYaNC>Su&U(|X}8Y!l5A_adXb+OApH(aDiax5wW9aUr^f7k
zNNEd;aP?0UOuHj3n6`<8CPk+DT<@zMYQX6S>{ydRexB+xqAX9Ud5lLXi36*X32Y~+S8JW4l19sYT~@v
z$W7k+xl(`a%zvBc7wb1J@r!NzAm_(4r0hB(1ZqS_O#3zVf)@m?n{1APLwTA|i67m<%X{S2Cog4ri
zV|y&fsFxqA9(xrzW;TLymSbedu0UKFxM=xWBCz<1V7n?S_9U=^
zhiJvI-W>RvG``z9L2e+6C^Cj9XU2OgUiEkT1EJhWupz3G9CV<_nEK5SJD~oAyoQ6t
z+J>0Rbc%&F0^#Y%&OPSVYE{m?urA=fA
z6E)mQdg|JKmT!+roW)m7aRrE*{tED_7YMkS6w_&hn1fW1dbl!q6U^Ob4HMxt>p
zLkpG7)grt{^a)AegwSTy{-gEsYi?nbF}diX0Zy+P6+He-_SB=9S8F5K=wg%|FD|61
zf4xlo@27yY^%OlI_|2ZLJ~q_u4$0A$j5FUu!%otDpC}{!aauE!`%JQr`KERJc6H?Yh*Xpv%{S4EN6b)
zJx-=qw(k$)*Z7H;X#p(Rtox)c)%fv
zN9w}nQ2-8YNbY1HKIJ7=Z=`vw59ap_2Ual$>beHFUlPUEo21fODk;;lZUpdr^D&jb
zkl0I%zN++w{seP+D4TSwQf9KxA=J&L3382i86(?-yX-}_6}|$%$Pw0zpRb?Az`7W$
zq%(SJ{nZ4xxwyUCZ4glbQ@Ki2Xi!MFy-wiNI6x=~5x)wvh)SpYIn?5rZp+ZIQb&
z*Ue6>Jbs)F?G1Y+Qlzbq5y-1!|0IILQeB|;+<{u3;i)2%xFXEI|l#r&$6
zgfKQHww^R5l&SxBuJY}8l8|$*MYYb
zom;nQ;H_;a!QN_Kb>Q#+>=we=TeBxXEsi1{RoxFXcjPS_QlHW4^y2oBnM?_ous@Ps|K_pxh=s~i1q)UAf+SZ9
zs?DKfW}n>OYjxHXXkmvp-H#Ss5KqVXu^w&-1MQiE_5qx`#dhiJMYZ0qzkPdi(Q=yi2s@yJXMBI`SPm$TBw5?giE#22+oUoK
z2NrQTbqO#WLKQb2Q82Gj%yky0Uq^D-5v3_d7+7^AQx
z@-QMGsK-85R1UvQ`cps%?KzmU^1$Fi>c1-rm-@xSeTDYCuP-};diI*Ulh8PvU5UC!
zJDgg{!TGlF&cl4lG}>gqne1q$3*`};xnQJf(4(x4FP;)%0-2xGw0zQ_U$DEw5;Zil
z_g4MJ&4Oc~7WgM_{f;VFQHSgz+vBF4jzet|#5A0%@x{
z9Fi%k&b_u=s*D&UMJV8BK4|UC4MOiB6dQWYQO{xeF1ZdL8<_$BUAHttc8KL#VFkY7
zgPbqbkSjopYuAJc7FMLt$quln>2^cJIp7o!_3`|&IxwVmC8K;uiiRd3ns#WrV^*uREh|9M+3|6>d^nb6zMM}fW!#19>
zo`;5EY!5kZvsAuMn%XvEzBl-!QN+BVS^Rctv3pHe9fo{PYUt=u6=Q2v4=iaX)gia^
zSpx-p5nQHQ2$0^+`AX*q_V_?`qE_MJGjxBwZjW2><#{%iM|ffGq~=$Oa>!-088+vV
zQqoMK;#;-&r_L!hp|fpuEmJ$Kt!4)7Jh)4|iif@_8~HCBPNvb2SlR-zt*9^lgd;I7
z4C-*)BfO3q&##)z6Ai&Vsz{KCdDPguV}0&{Gr}Ky=j%;HU#YN{DdNrAg&TwBUzCX{
z=Dml<zHO#9!gF!jA_ycc2tdq$t~jF1uGT>w#<#4bk(@@aur
z>Lh7mmHkf^s`WhF3fo+7g!rya3z1kxCNV#zNXbgPM_bkb+3SaYbAJi5ZTT4;KD`x0
z_oPJ%7NkX!1g2MXdmzh}-Pjd)o1vH&6zu4;n0uV|zgZP!Qzhy@vjF~>qHhu!e2a+G
z@`rUj@0+(o9_ra&?j6`b98X@A&>_y^M)Q@h)Vw?9B{rGz~Nb
zYPtNcU8_fKd5)s2u7)0od*<5e?W381?r}FQCDiW9=bQ+&yZ%$ILN~CJ(*iAS%L(7&
z{yC#;Zod+JVu?wzA;(*&Q}9_40#LhF2T!?2Tep@Y%DpDJ@DO8rmXqmjbh|+FO_57f
zX4$wNeX^>1&>x*p2`$>F&(7H4#HwussNnmAKtM)zbCfhA?!09ZZ2OIFE65D#d8St@
z5_$hZfP^2v-T-x#uQ#4#ylJ5}S8Um+IPizY*e7~qPVIVU7iAGVaOWy>-Ln|vPu=Pm
z)-JaXcQn&#_+D{<-^guyYpqX~9u<+~2dH`4>s>CJ79WXQpYiv(cf8C=K2XXc;PRyf
zJT!)&zbOU$gsJ=Bayl2tJ~KL;^3laF|0XSREsY6x_EeznsFlE3;|RGMj;`
zn10dIA2r{j>ID+4?-vc~{va|%$wh2kSg7z;N8VOcwC%VNsgkzK82(sIfs{@{r@icS
zj^vM>L#j?trvZG-9k(D$JHYD?NBb)MUY?6vo%rE$v_IBlCxaMdjhg{k#zgt-R|eN%2qv#!>8xdDEQ9v7jDXOL__
zHEV1#GB9BzYcsSY($O^zU^giNc3rWJofNpHK6lOI
zaJwIu%vLk4H7pg>E;d3^F?40K{0)3;%RoURe*THi)r5r=MJy*&3cp8|5_s_sAZM`dJG+&X}FLlD<
zdYv_xRiLr~rO8lFWfMw-E;cXkILW1mK~VO!SGaoha+>C$wODgFD5HP-Q$`2QV^g)0RQHK7Ye(c@b46eX~1*Rbnk=Bt!D8O3ZIiac_%tL9X;4}gw~s%!-D+63pGAzJ;tsFUidfT}blg+tW1
z@<2vIV9P2{v)S$s-{;42&_!czl-IjCw6GfRvfOFN7sNV!(F}A@Lza>v7dgC!uc9?D
z@7;YoGy$ts#7c^6u%G=$+^|!Hx)23&0^%^5KgAvbn6kv8S+N|f>JT~E74s3akWGnM
zgt--$UNt}&TyG|CzopzRfP0*nZZjdf=3ndkd}EUIVdWsXt=Hd}#4eavSDLrnaTD0wV&(k@YO`D}H^L%p%VY4q?{?KQTgMIXHVzX%!
za~@_gv?9@Q(pqvxFHck(KX5E=vt*uvAe~=F#}oZ4c*2kU3LrE)YJY0O;IV7;5D})b
z`K6P?$-CufwFM40!#Iw7_o^_M0MoN;uiP5g&Z>iv8e%o0OT*XJC@04K*}qwEe0@EN
zu}Wnoq=&#Qv}Ett{~xHelklekqx`1=19l@1zkM~y#cQoj25&8)pg9nhIb`Cde!XTuITaJ#&Fp
zc{j$o>J(aB4D`uQX#(n38|Q79Ky${R4)^g|7+B`N4Bu!6mtp|CDP->9pQv3;!$0FxO`L>hRv!{aOKiY2;rYnfnzdz-D=I71f9H1d_G;vC3y7xcS&TzuZ!*o^&jdw*6b5##
zxyKC^(ZshBp@Y|0v?a)pn1RZlXj1fm4NV5gKo%kk*M|-yO5Q+W%CdxA97T0+
zkYzf>wA3TcZa$Crt2IZa5{>>@wfKQoN52bgH!H9}$vQDh<_J)O?^VO5({Zhm;jac<
zr<#~FzeyL!T)+rbNE3^Rwe;P8;qxoMY2P}ysy(dlE@a%*1
z6K*^U86M}&GRMNSE!?FXufE|xoa5sJPMe;U4cGiu!bjWzz9yVK8_@ZY^GyM@IpPgp
z=mLuRICe6gLX+S3ZPBr4G@rY-12;#BOO*m3u=ZMww`begyWUds!Yyzy8yH@QO5aM>J#
z_uv7I>_AF8((HqsB*9d`Ofsrn5@+632%Gm(B5LIwurbpHH<}OvV!vkv?gv0X3lYD0SWu@z_%4NqLZlNMJKj98O%MOXqNbRcM
z8}LvH4rZzn$-b7lGd~iYG4RB~
z$Gf|;eVQ~)<`vZPs==)`z}+Wv9GU$;Ncb(Y{Vk%mkJ2vOxy@eGbn)V^IYewk5z?u7
zDn|n(I|{!*SJA$~C+-#Zp|9KF
zMcqyTnsSAF3;0?3qVxv^dc@J$Wkn3mI8pKgNq`HRIb&9(J
zvJ6f%+)DEMY#NWQxX>`igxTBEF36^Gn|%5S9LpeR&YF~J4Q@2
zq}sT_pL5jr`2sW$1o;3*WfOidvzk{{x{WfE=)@zkg@ltO7JC%*+d0)jZ
zs_Xx;^_5{!cHh^`(A^~|EiDKrAdFIqGy+2-EgjN10@B?j2ol23EnU(j-6hh}A^E>i
z@$vUw?^n5yGiUbMvG&?)m%WW!RTz>{C)3*ucoVoLw%uRBeH)q5-j9O4pUfsT`v{6c_Mjbav}
zh@^)-wh}#RtJ!*oUe5DT-q3{njgl(~?M9VR1CW+B4;9@MuV#>WG2s+Nw?OR7EG
z**7RGJ2?uiam(XW`SK-7rAs!&AGJJXe-@1U_P=WOPX#+ef5W6j$#=W3UeCiSo+F^a
z{awHapoyb01DqFq!}bu>BXvxL(R7j&rM|iBw*f0TK>HrR6rTlBg7a(A%)&GXU#fdM
zUtDj^qPlC2y9iv-+(+}qoKc=3x@V?7LLEl$^1M=bX~I_Dq`EKpqsK7I>*Va$U$d_t
z^u3ABE|`9hZyjflBS(o_(8(5MVQDUpW4nWmgV%PEX8*)nj4~Z5s`}f`A>!iFoc+$@
z6SoQXHGkaqKK+k%U=72NHUe6^niG4pOY^X=%g4m%)h3oalybOvNoRhsPTtz}IFusu
zFrU>a{8xi?%zR)w5Xb*2py@dRGY_fSJLz+wps{qjef{6&84N~`d_9p+hB#^aVsJ_`
zXT%`3$|(?HuF_$IZ#s+VZ?0fiP68<+R?lg+8Zt*PPjm*PQfpp}7|6P_Gi;QEo#ZMq
zQSk>wAqeq*3}CHP02j!`3w)h2aA2K;Tc=n_RO|Spl%tuFn^J{Gp8xY&Sh(rI4G3)J
z#r`P?NEEwO`#A*d$>!z$G~^x*`aT%TpBKThA=E+{>)aT=3vtlgSL5-A6Uy
zvXMm6K<%!N4NY
z4t2_4)T)my4Bdz?gT8`%aH{M&U{6TrIJUnuEce+2YP+oCXA~9~qe!*B_?Hc@_X_ir
z2deI);wOrVRh;*`vj!y02?`L-k(fKtp?xkwk(BjlvX4i*Th#WE)H&1PM_6(%Y4AX*
zk9m4sGUiP2N_ktACDgse6~i5hoU}Z4f?VM*Bp#0$5r*-`;B+>v2MP01&qbk>L3i`=
zx-iJ~Vr5aZ2I4e}SE0OH`a)_*8rWyF34R0!9sjaDV0d_X-h4<*i^l#yyR@%+PxzNh
z2G)|3o5~8T>c5ynd=?->Y=p>qe_>7SorTk+O~HzGN}h+dq0yaK&!l3_-u@6BHnS2P
z;-VfM67_Jtbz6MrP+X&IMT6nje9$C9AAc)(v5ZHQqkXDg>jMfC}kSh?g
zokXZ=;?e)(>X4+GNC6~rY{9vILj~&NpjzX?`|D5%^q~0ZPlkmJs%OINh})Txk$90o
z+wC;XNpQT?T7jCq;WtFtDo<7lKXOzIKO$Xvxkv2gM!2x`68N6>
z-m7Gyi#?GfqMk~52PY!j&_ErWT~+w}d4^gmf4enb9|jMj7P3>K$1}oE(w^Q!Y4!Nm
zvJ+Op4L5BHl|^yhro5J$*&3kuQ&`AGHtZYSI%SkzM~D_tLND*0f|sgqKYlpBi^KVV
z+HW#})~woC?poyC0|+TIV9E#Yr`<5PiNT6&*xcR*E@R_AcKEf+}kS4Ar&O?y-HHVp?%=69Tv3^9z
z(z*BU$8~MyHrF1AxvI1;3wA^hqxz8PM)8MPeKpB-eAw6~_NDXDvuGtbh;dy~CYdRA
z$-Qqj|9GFL(BCG5_x@wxJAhI`*k$v(CCknL1G&-6v0hW*sMT$8Q7yP#)%mVedrc~L
z%BM(@u(=nd8T5Q;>jL>s52W)RD
z6}#HPm4Yi24J*zxWP1=CX)Gm;3`9v76Y*&1W&RfpfY~CulLMn@f}HZEJBHqT<*WXg
zzffS^u8d4oT0JHYKK>-JGFe@lFH1|n0Y~Thq$1kh*~QD
zIHRJ9di}eW_`434^NveqGe$jY(AnG(^$%CXfN2~uo-f;l$EiHduB#gi7CI!jFB%am
z=&Co&u`T(xgofVc^VL5iO)Pp|f>nNIar!^JAKe?mk;-WqfFrT~;$`1FEn{s6it>r>
zPsV;eN@@pd*#wl$vYqz&7b5H=ZAp6gY$vofj=^Z9?~mV`cY?=K@F(HunT32bqA&T5
zmd7(BHy1IfA~0WtS}+FpolexNL*ENL_jdh;KJzb<+9XV}JE~{ot>PEmi;$1;2T6s%
z9ubFlnkn;OD`Mgyb
z4~;kk&yt5;TdICp!pAfieWTqP**#laixNq$iBMw`*SIcTKh|lK(a>aFS8G8`SDi%wjeJuKfY7|m_U*LvuzG!AemN{Ngs#$vt2Bsm0T8$0K|J0u(N!~>_
z!1OLrtamoOBgD?o8DMcC9%>9MnEL9d+7XOM?pcT$66r@rPSZA(
zbrfA0B5a5SWqfRZ!v8PF1?=iN1p@;dco=2(`|blE^MmGz)ZbVNcUaR(Hetq_rh#^S
zs7hv-B)Pt={1D+pij(M@j1UBI1QOC8pwHK9+c~5TnnsURTQd|_Ibv}8Qu&3sq){pH
z$l-r7=Q;T|gE+TcfLUxj<7u
zF5YB>kc$|mT0=&HSda<*7r)he4~V3K+Akbmo&)q3hAZdsq-K;ucQ7=^coP?j|EAV%a
z92WJH%-lP{El<1leQm|<NY>fxdRA*vk-z#y)DJ)edeX{qGq+v_KH|0^>SP{F-=
zRQCgcMfPn@4F^=^<>l!`MYuIJHBewvVF0zh2c}}?_NMN&AS)Z&9w14-h)8pa&}+==
zxHDIfQf4;Fn&p*#DXHzAM3c}gD9i2mhwmh#4B@m=i6|#Xw%bwjL^Z`DFDMQ1wn)Vh
z2*c%k>ce|yeTq}uVF#onf?-OZ?GpcU^6}TTKGS-ql#sEp4Hj?GnFMx!$8*R32cuo0aVw8FAs+abqdSNiB?utq-~CX^_~!8VRd>Jv`McQ^B7hd;}2#@23
z79P+Lc!eIJ=y`OIp1CQ(L1`WjXc|xV?+8~vA{N}XQO|mz^7ypHOZUsFmkmB?VX%ze
z|5Ql1P`%Sef|nO~Rf31s?#mR;-y)^b$2XblMgS$sSl4{>v5+eaz30yZl>{Lusz#XQ
z^S%O0e@qks`Ker!g>=(0V_N(C?16F&yK9k`JGJlPh#pFVBE`G-xu1lG*gVj+4)Up8
zRE@@R6kLltRHpSd^-@UcT#MFT&gk(Hga50bX+|{o$#$@rx=c=h&qr&76ATz=A)}Q)^*_0)r77Eug*x*R!wHA2qq#Z{6$kLmY|=o^=B2bx}rcPJzN>ik<_^G
zU~#$qHm}3?tK#l|{&z?d7*MDIoft`BDCij@XNR%(Z(XX`JCH;85@iHJ#;b~|s?;8l
zm^M;ywo%=tqq&l_L*-~f_E(gl9xD%rcXx8_og0b1;TeJFEN8=esH_cS_Z`_or@;ll
z@OEg*#HlIA`#SnN(=X_Xugi&d8FN6J9+QwovZPrsy
z^otlV`U*`~-Xj)@)D0if6+-8lJzk`>B=uTKfBHa96VYu|{QRYknFUQ#S<(1n->~Hs
zWHU=c=$m=ZzO!%zJ!Z}8NLDu<9DuZU3)Sh}MF&a(?=mVXD(w7GSFs%!3}loxX`woY
zxb4*HSN$7B1U#by#+rVK`*zW;U$wn6-9FvYgSmO^Z>?`MG>VB$nQo9>)=uPx{SN^K_UNW`gd9di5oC!s)!45}rrH8489EotJUtsqMF%}IIa_dV
zuP|4acI7$kvi+c+%dU9(FP18+tg=^k{CPKp;
z$ptnV&9^k3p2Ykd!6)-i#$J0|&hlTZR}C!8dpS{U$33~eZ*}WUZeo%iCvrKk&Fd_W
z67sZVO$Js&Ibtzio0o@CQBeV?%{K!ZhG@$aGBYv;nSen#IXP9c?5-0)pLP)t!|WEx
z84eV^Sj6pa05%*^A|nIC&%js9HUQPuE=YMF9c|ARzgTnoVURRwe^{lTTj~{SAZg4(
zw?x82H?L5AUNJp@7Pit~$ydhBX;6Ne@uAjaE?vTSH8@)xVO;E=UAfsVb$>N_=68lO@VJiSjbu{%-n>-{F$HoJ
zQKqa%o)4ee>@GaXIsx{v4GZ?>`pc1^9$?E#k*(Sb`xNts
z!e(TP8uXPMoChyQBv+Nmv1`2Ik-b!DfSk)Zp|Rt0Yu`Wq6IpvpAjMAXJ=fxkXS_A=&NaH#A#ih0hwb#(s}}sOd#!Yyei$FEw@<+^E)e&A>mg
zmLbjp(J2n=OE{&qZmu3KX!#+Z%a_w?k-nQ?p=vnIWP50nr!rz*(Yn6R!d2t3p&<~a
zyWaA}$TonRXH$iWcR=y>dxO9R34tNV!Q^OfsWz-J?@tqdCV084z_GeW8}F&_h>;Z^
zIzhgkUmDm2r*E!LRTb}aa}7Qo{65bmV7C;!Hy9*OC-7=L_ws_9o%RJkmGF3&E@iHS
zSaP2i}aT+FCfJ`cNip9{4+lS9E=N;l7^3x2!ZoLgf(X_2lQ
z_0G#5@61^SS>?a_zAnCZ;+Z9x4d}4#OLLrJhfJTm4;=Qow
zKlKK~pqDz5xw%Jz;xnd}(=*jj@OBy||
z9~`|575si4!C9&;TJzI9fRFLak)!$qwebxWzndPuszEhMZDYmjX7WAQKk$T=Hh_z)
zeEn2q)y4MLRl>TE>Eb~zJnx-#auo%S9o&ns
zdyT!0{dqYutyn6f=dd)&ODV>lQ7<}y+Y;bcc!ZG?>UleSF?D(MxBTaRO1q9vd(PG>
zv~i7W>f(5M@K7_+Hh6FS#9g!NnQUl3iZBmEi0C6#PNQ`^R%tf@7_(yKqa@PBnq)o7
zc3iXfdD#uw`)@M#1=xZhsOp>c_mefrpc{G-KXW!c-N;JY<$TLmXEIZe^=Wg@uhz@k
zw=>2zJiJPI%tSkPyKwY5NYvFS4N>0X0L$}p&Yerde(wPTAl(5%fBBE!j1H1sA*pfG&@N5
zGR)XIVw4XrB>&*fQ%KS9!e$!F`v;w@h{d{BrgwvQ+TF1#bn*#B-7D^Roo(|vZ^}>z
zQ@7EF!*`a!2#0Nd%^Gi7flVo0^hUQ{ML;
z^*C`?L%`~Jj^GYvnodb$yMx#XA
z=XLbs@%rN_54-@ayE^U5N0O2jBAf!LkR848>JAT~)|LkumAMqJmaadeXxPGCMFDsv
zf>;eH^Zk>jX~UgPp-fmWN;B_nR&{R!sA~1h90BOa5^=%kl8zc-8)rM9Xg7&ubJ`QyS9?seaJU@O`$O7
zXw^b%{`nDZTEnF#;Hq*rSxI54))B=+N`9FtZj1ZX;^`H58lgYlZQA?mksfKjAn90|
zbLf(O4eQSK^ph|~iVsTPoLlarL%?M34w$XyUV(X-TP~
z)X#rdgL-$-PNk6mu%l(t_y%YD&42{atrMR{rmE
z{-*(kFP(IJW{s5l6*tOMx23`h2p{dWFKzC44|bY|M6ikKjuFG)9U+w0VX0e@ursuYZzyVCs>x+qA`vy4GY+NEEs2vJ94
zW4nWEA>*fYEzRl6SB^tsrh!r{#qMk5^tnX*a41-#@L%-tK=TIj9pC~0zxTp8x7b=N
zq?f5=L4||XC%@F8e!b5k6uNZj9(=t~z6gyfl^oHnN8G*)T^jwUHMCy2Y}Rv6%R)Hl
z+nNkR09>td54q*&4*Xt7yS91M;N&JmwoGMxjpTU&DVy8w)F;)p4qti!S)`7CVT$hs
zH;ChV4FGWzcA*sf9Y|>LV5jE@J+Bn$Ae?%PN{m8|h<0grIU>psHwa&I8(5BMORJh|
ztKEZ#iLBHC8642z5@Ua_5(+=1OE^>nXfS;%yJNmuS8}xJH
zbX<6&F0emLAF0=HB={L~D1P8S&4Q=ez(Bu3+K1;~IuJG)9tw;9j%f+F;8z;7i+9tv
zPrS>N+n`i*ou5&kT}4#+Lh#b=KXS$AU)}b7Voq?RUevN;%c^F*UeI3B?XkqRYo(ax
zfd1gleWprVgqNNX^y2g5+y%vWEaM_ZNnaum>
zL^e;2C}*Xt9#<<2d4fzfap~@{in$=aX-1xSK33f~5YW~idT%%2GoaYY>|iQ2k%(SFlpDXq4~>(K?9*WHMk%gb6Hf;UjnNE|
z%~Zxf>F;J9)81c47xx!JSjcU5wS>NkXK!XO42#Dv{NBd*I}eCO1AItS;2rA(tm3eo
zmOtG$mV{?UiSlnxOJ+fRAQ%1tPx@c{hMW7
zZ?}KK<5L~LXd==w0#Q2=Hrx1x|HSNsc<_*U9WcZj=0a1nO4XErC|;0M(xLJ;*Vb<$
zqKxYDn3^$DWlkmzo5fnl-~Py2Y|L6V1Z%EEllPe0-g)s*oRE4VArDEZDCi81laotB
zt07j4?H0z@x^m0{Q!U^>CGWC7ou~suCvG8Lyqg}Ma}v3p${wIO`6mb^69?3yt_fjc
z#kdp=*3fV_0*F9$Drq6FzQh?*mIXxHsU~-5Dl5f=_{q4F`MmfGc@8^*pu0Vo
z#i3lZ=7rrBDm8ejjeUUt`me%Ym3wBh=!!chIQ;GqNs*s6(FpMi={KFfDH>i9aEy1~
z>yRF>qCgREc}nR`7X%S}YJ}8Cg2$jRl06H~l6uV%0}rCXj)Bv%?ov>)of9q3Oo&;Q
zg|}FZiM=&;SYRngBNRv7R$|ciwXr+9Sv~B&R&Z#~Qptyh)OL&cVbs8P(*Pp9V(CWd
zR06Y8q>oLm{N3XO4fu5#WB+>@n)rjhhHXTix_gpS?a@(?5m^tSm(LaPFjB8eS&9<
zR=M<`R6iCoLKOf0FP{&x2IRqaKHKxIbOO|ms2hQ#U+&~U4PtT}hhpkMf(Mg*DCGT~
zkgoHLf%`?U9Qhk2c<;p9_UBa}3iBy}CTviZyQrc)1WC6RNSLr(3((NYLfL4|XGl1M
zl)wcZh?zYoDWpb-hLXUjC<{fzg9F%sEox`#ZKez)&B`~qIHTg4BY^$9S$#+Ur_SmP
z^1h20z=Aa8xmrJ~$HxuDWDwzDt2&uw5TQe+u>axnoF*_Ytj8u0x!5qeLPLJ6uF$YF
zyZsx>`RTwZ7)6m^FPep-*z_eRjnufCiEhKY&IpD<@6FI`=pX>ybg5=^+fsTglmK`$*SCB8(
zm(qV~%HDdwh1-jw3Ooj*K&_L)nEzDc-_sy19vLW`&zl@)&n>9jBtpl85DfZLgw3U8
z;s9+={g3Nsrh_sE6o>5+jJL`dCv<9$`
zwnQhv!KZcX0+L;3Dm}cmDSu5sPXw@lye0L28%qetZ#ifiGQxfRz2)$s4&_1l!GgI|
zMFFmGT*R|By?G7*dMI}#$|)o)I?5$Ig1T9xcDr~u2IuyjCG9^FwSDvkxCW(xk5I%P
z^9dMY)hKFtZi{wqF;`g*9?k&j$Iw9@k$UI;I^Qke`wQ>;4nQ_z#b3WFtq4@KJS|ZG
zC$s)4Awukd5+aX`3-vkd6OtAuDJv^0?X|OB2{h)1aT)oeM~_%oSiDv9Q#S~Nf46pk
zvFj6Y>k#}c6%&acAow+EllkzG+|D47XWeEziGk7JNXZBnWou5N_|B9i@H-@t*p%-WfnFpwX){Jm
z*RuC*5J;%HA)ef{Z`*$}m%iB|8-CBjDs*&m3U|}`Q9fy5YGoyO`nw5}
z0Bwq3BB|CuFK?hd3*fppDZxFgfx+N`pdb4wa3I-_UeX93UhpimU()ED(Tm?4aL)kS
z3FuLikeBGgI4hqc+lfE-J_kr%f@@FJJ<`6a#o;_uHdZ8QX6+7o`c&rh3mN?!K*+8M+*w2=xt+ho=O_&)ACA
zap(PHpXLM|W6NOACk|+2W_Xtf6e!q_riTP3LQ!61@i6&MhXDn#!l*5|3wjSeJ~c6c
z0ruz<-^~XT3Y6gvFP0Pl>PB~ak)bk4v)~XoxzkGfJq1Up#!vq)g;cSy+o3nu&$~eP
zH)u5yNRI)L6%px$!}Vclb#Fx>=F`E+$xnu5-Pe0j4jSj@=dlAg{)p7!Qe9R??>3Q~
zXMkxjc41h;QHD4KcaY7jxO>e0<%qs4a>lr;=)hj1YXOMut3a^c2G7e1-7ns)$$|G?
zpi$<};kpR3H9TXO?YA7;rsS1%ITtSjomf7Db*1~UQ_%9NuPkB2x4(t@_gByhJdUbR
z&v|M1UwH%Q`vY7)(wfgMt&fDFgSGm|A6ruz!bo+TL2@~~rfRXlul)S|TlKh4=cTN|
zA2W&ekdh8zOcC9Xn;|Ud&f=l{J>g&~F5FOQcCzXVVnt^!6P8c{#~keQq6-3lRvnV&
zC)V1EkDB1sPu)$Abm{w22$hzxN1Gp1;x3#w)`!^>&$ZKeEXS-Mi5x+2=p?Y!{%P&O
z7BEgpYV^JNste2P_)wrGeu)B!$S^%rsI_A!utE{DO^(Qys%D-vVWmY=fUW-kDA&{p
zBeFpK)`W?0=K87;ad1A)I~k_UXZ}-#JQv>&PliU6SLO?_hZpCTm~GV-Q9q0ZAl#n@
z1`QOAkZ2>)Ed4mUGeNRJg
z680CY-8;bjLBPkV3tLPjX6aRP_YUtty6!i{Pzn4#Ww||5iylPLP_%sU5u+R1&@*2zXg$ceCgw|3yUZN+
zeQmoF#cb;o*=xLVjdS*jY0~-psnGkM9$8-a?2~*NF&L+Z^flFPvil4s`*?q|&vXba
z5N1&_h%!8YV-5u_7H4xT*wxUML2GMknI8-A^OH;itBgwE@-+%$osccVY5MT4y#a~n
zW_9)VdU=p7XOC|poOgIh%f7fN(IO$S)1|v!aW)wo;4n!VRusAu4kkU-vk|~)<}mA|
z&T~dT=eh>tRL#ymF)k6Q`EDJ7-(#UF+RZ>wugdIMUWwQxW$F2*z+`^m*t4hnlmXx+j2D1{Gx}jI^Cy<>gJdgD~0rlu0wLG|c
z&RtM{1Q6-ma;c;HTnD0kbOSc&Vn=s=rt0X~CZy86E8dEG;AN(ZZf1l)08JO@VPu
z+*zyT8g?w?F|$9P)uJE&D%_z`n%XzpLd7rM*$AsL2h%G#aJWJBz&*em}=#}2H_2I
zf&$GUz*t-cPPzNd#*`=l85YQ6;sKiI0$1`B3&qQhg&!Gpp3O01d^rp2ahjBB0N8IZ
zTJ)Em__=Pbr}~fP5lS0{FCK|kO`Y9|nS!fO#b46LRHz#ev!d4#N;gV7!4q-8vRlc0%#?Q9#(X^=I%9?K{l+S49=S{%6hnXycLzR(%j
ztth}kb$oYxmb9H@q1C+6dn92CkIKaqJ9rZQfscj~`_|?+03{HW)PwAh8=BBBHLh69
zQ)!A2Qr}dwG+~inH-Ky^)eue^Lgkh+S!VypzV0Lhy}JEcUZ)OsjRaHso-8VS0Q5=I@2*G3L^9y@ZL6V52^qCL2)r8XwIfH#rAl6(Z@Ev>2f(NFb!
zDZ#e~Awtszz6~)at87YgM7T0R3D7FTdkdzHyf46mCS<1>$47SVvei%ne=Nk~Hb&~6
z%E~QNN@G6oZUL9U{~NK*F~aH`=3&}_=a@Js{|ZgKNX0LrihuLP1e;lzpiz@^?g}G&
zN3{7h3VP(H25t8=afor*m7zSJBMp^y@)1CXm$p>3CwfsX)6yY!n|ZS90Y_312F6kI
zeyKYD;=X!2Sl~J44K%oxm!@Iu_N!n%Alt<34s$oLaV#{p1kE}Xqd%-ACxai0l#7tF
zJijp}=>aSE@bJmVL#S%DFZr{xS)Ew37(3_xxNt3!f*B3N43z!eVet1}*ni#2{NH`A~s{
zV0j{a7o89NVn_PLN<}&
zMEj2Uxm&Nm+HI?LCqa&xY2_r?#Kt9!UXIg4S0tfKt2
z>i$;=owG79h5H0J4!kjaHp)NNK-Q9#9*
z&%Gul93&x%YG^2HRFJVP{9fp?XsxvJREpYMy2XFo6NLPn?ee_(eod36$<%J|PEn?{
z9?LH0=hbYfz!!-kD!uXF@0$=(wr!o!0@R6`{_K+e}bz@CF!
zi<->-U!e(CzxGNUk7`CaEzG{Ch)*R~|D7
zP>Av9j>r_8{Vm@b*_Bu?00$if%d<;L*V!&byZHV+P_Ni86aVzr#J#}>P)HmjSu(y5
z4<1{Ul;`nL?33h4Q`h=Anm0$tdL3>j+nT!|_3%@{(-kRLnA*E+DMJ<#QCtQu8~$u_
z$se!C*P0G;8vVbH@m_6i@-5yF(QMtWd~QyqmEK^9Fz-@`HEwo(K}8>`;eI^iK2syu
z)fi53dqoO*4ZuqKyd`p=bQT_SbB6`tj3w|%}v6VZ8$S$qOKIN^X
z5kTbsq*L0~TxU@TT4;F;8NlCJ_6uCqDxnFeRjvqULp<{@Y7BWCe?^mG<$wJsNO^2A
zkk2dB)F1_TUQ8r5HIJQtgbE6uyHZK264$uN5;)e2;^Irj=_EkIrT!LdT))r>rhm~1
zJR(pc$0lZj+~E(*&a!XEYJ7;@e$PnfPEqsfF-ajW`2dyGt7T>VryUr131^GV?{lKBd-peWB_l_
zLv!z`tz-HBcmwyFsMcNvG_?MB10ZTY!jEWHNxZj-`C0DxhY-IqNIj7ppzJQ!)6vmg
zoSX3CvGKlTV`Wv)*2WHQ&*+Vuw2+jO!@@+jxa>1s
zjSxrU_xCI975ZglS^pRrk%C`Sr#Bp{TJ9){yrS8vbjus7`s{5XeHD<{$6oS4-SYd)
zDxO|h4b48T6TIj&|MKOF{!OyC8z3`KMi)KGH!|>&CSugqcu3v6wtvS$@Z?g
zP3ZLEZYIBscJ=1M0EVmCzQ%8xglUpSfK7d2c5b>>(KLb1M?H|3OH
zPs){YiJM~WJbjHN7)pH;CrO+3gJtT6zP@g)Y6n9BBG6@OCjFb!7Jm{0AT_=g`HzwX
z`w0|A`9UUsir(K)3#JAHMa@VSO70w+m}xL?gf~_t3WY({gPKTfLW6?tRLl+zdIS3n
zkRC9bkHMcPD&h}b@!0&lZ`-dBr$2)Ov;(bZEj-!H-ejC1czRu-0=)H0PQV%ir{G?p
zoi<}cN0~CEcS)OEk1GU?@Yze&t#RkyzmtEQ;A1n}_QcD}bc^hCX(2Ww=~3>_U^nk3(@@e2)T#Y@C}^IJIhh3DP3
z@K>$pFY87D++R24A`Xg>|Mi;4SeZ`b^N-+8d9B6yj?gY-PF0N<)3R}jBH34V}Ja`&7XOAu9I*g@7M<4F#2j@jJH$^(MhHH(71uwmYARMyjyW3mqUeDr#wnsBQYtz59zSodHQ*(+5-kxy3KYf`WoEZoaW`
zajd#Ck&WqPpTvOmVjBs}VSg0)xyQj)RhnI%+dDh{?ng&QKj&8}dxPpHnR>9{eAh_p
z6U&Xh%saaHaX;0r1`b{=+YO@&d!4zhRh^vDAk?S3Kiq^b4xR6zJJ29idl#OD7-QM|!rEVO0pt*xzheLmRQ
z+CF>!T(MN|;NU<}OAAZg=g8Ox?pRC3SKot|U*xAg|IH(>AF*1&N=(+RoB-JWrQ_mN
zpehtBPc@^-D8DmBhI705Ye^WqvZoKYEHecW1ITq`o*rWQKX;RoX!
z#fL(%IdHSerNN&#?0tcf8I#=dX({0nf4DA9?j*ZLzxv81iT~TkeF9Q%t@!ks<)L8v
zX;gId-5%mjCZGH{l6Pk?zGwVeVjl~|?g4{vkHYrjkYdJb6x7uN+0+WtD=SG-Q&Xk2
z)yWU}$guLxg6b7%V8HMVn?a#PBLnp;qCXUA6JRA}oKo+{Jpo$#V*eF=aqY{C3C%fGpF!
zv5Ki5+91r%&PIoE^7E^zFLcKTvJPx+Z%e4D#oJlwIz3kXd<{0%PPL=*pY|4*ZhR{z
z^`m+`c04dVT+OV9iHV8z$Uv59xY|R^(nMk!S=enusCc68sPfxs=~B?{2;e_Oc=$%%
zQIsw}a<0UlzutC$qWY7XO)F6PH+tyb*QYzWD`bTe@;8?VA=-^a12XuJLDH2#i0l%#
zP55Ic#Awh0)y{biCXCYVg$;lsiI0E3J#WVcdpBj$m-}2Hg4p(<{w3)H2PqazD_IGA
zfDD|-xaro_{`qOe5w^zeOznL8Xq@uZ-8)B-&iY5X21Z{<0EZ~U2}H+M0Z)~nub)M{
zI*>|EN8?460%Cv8A&*|5{sSaERk)dA3-rcIN%{1yjR2&KzV~h(77xgje!c#ZiS;s!@Lu&I+;;LR!nXT#m#v@6wfA$uB67
zb%{4ZWiq$>0E`qoSYagHjCwMzV9J-8b=ux#9fVx0anahvy}JAf+iL*1_<~N^I;C#P
zFDH%bfXkb4pjy_j#Pd0Tr@~eLgADP4ZXoP9G_>}~M12{+*@N2t^9==%4(f%k^!iwH
zqf7X1q{aF)>Exmcz}w=Pn3|f(tDBmhUVMX-D%2m{371r_9VNAiJ^E
zSn|X#5218=cc5FhT9Hj#nBqj>FEZ)N#5?ttDov0_5vMHT42SRbI-`(EzvsallaiBz
zmzMND=H$>bF-hK2qvh3^wK~Z?Fx;MqizCU3xq-ix#KxBQSSs{Af^9yo0dzF2+H#H@pwu{KUeh>=TtckXu)hs
zXQA2sp2)xA5!-1xYHD@yGm%DqAm=t8frNq^Zd4HSY>xkzt>ni<`vTEae0JoAK)t+G
zJv)I$t@r79c1*-%uAO255T(9-`^ExNQzvOM+KkFfXBgsH24+j#R@
zz))6ok~8>D0nkM&$>t`BWC9d_KP+?pH9!b}em;WWj&YFdVaG8P-AF^;kO7-QFcRhw
z9}2?eqUWX$-{U<|qt|Qj(5Q-iBB1WW$HzwuYz9}=0Yb&#`kRR6vB(u9LlSdqYc8Nu
z6QgHtV37G$iZhClbU$gG#2};t-~$idGb`mkdC69_NwM_>7`novi1fv>pOe9TrK2Uv
zHy7YG#*~>?Lle3^=j{p*e1PPXmbc3n9uwfQm*S3gd)yI@U#)}iTSVyBze7#IdqA$v
zw?{w@FYO9ZHNe5EkpAh+d)?V&W?{k3!^>M@*hRpuQT`15{nWN2V}js*QfZwxJ0oom
zS|^s;q!fyVQIkV)GJ;hs^!TB3Ar%0MN|OL>oEIoakS@-@fi?mt9C?w1DB_L09r$BhaBn}v
zTRPfO`N&=FL3^Tz3aHWM1g3Zq$gp5c(}Jf~B@PS>@EJOq11+SeZC3NjZovZjX#gW2
zu!s%D9~mESU9@3YedizEcskZ;Z*45ZYjr;^%TgR*aUD+AV+!y=Sz{sQPrgbk^3Wa|
zbJnK!M;_F&3!vl&>)T4kpsiK8yg<2`uPeA<{Ub6R|RV&5>}#2hsUDPQB(h8IH868QV9LSDs>Gvh
z6j4}IByR}mHj1v3jU&0~hrND%&yXBMZV_vQ_Ex)$Z;Ff=*pLxyWlnL&tq$}ZkROP_
za;7p?2J`42c!({XGk~9$pjha}hn$UpMgrq4QXk_e@}v{LMwk5dvDC1M!Tpvxl-`5|
z4E70%6_?qn1HBKi#FN{1NSh0`Yt9#s?3%iYaw=g9Z>2Dlbw?XyMmbV#2!36m!Pt}(
z8=DnF5MhLD7~x=1tP+R6i>$cFNq
z#`xss2VwmY*fEsEiSYF@evQNe))z=4BO@#@6?Hj1i|9o7b-t4fubrYxHGiO>yiot#1g%U*0;M2kr
z^9(Zxjm_l&q+J(OF;C#2p-X(;rq-M(ji9bi8z5_3`K7)6E;BPKPZz{EzdPOB%d7F4
zlV@#eaxxGY)p)6*axd7RivV1uQKT}at)1q9>uNz2aRfDrK2isW5-7muRkVP4VF7pv
z?Oi6ylb|S&Y^qQ0>*KMh?G5{drcWdv+sGs0sUPii-ExHhn|OOe&Zm9S-);nq29j>n
z{pEo@A&z)5`T{qAHlKxx_oNx)#pOg9%Q|B&}zdY(5}2NVsR>55n>XcbhnQ8|7SAW`yp
z4y+_feJC?lqI|bZIT}cMNjs!vWmSMCC}gvf0K8wu&Y_^FXxpP+K>l4=G5N^xWw|b7
zKE3lBalxmYJF667w4$~(QA2``As6nMkXOb;z$8%zFsbYcm&+295EBgpNXnMT#=uy!
zwQ%4s5$0ck0D^}EOwj{_!brW74M>RaGLHW9Tl^Q0If<*1*nM+75+CFZ7#EV|&?
z1B!^W<|q*1(%#<@QUM@3Y|0MzT?PWp$4g2Zq+9=m^dx=B-n;&8G3FydSh+mXm_R_i
zA-VU&1k|X6t!5!sE=Rc=;FskWbv5Ppn#E=z8&;aj$b@_yaB|Oc0yG>}){`U162rd6
z4coY+*tls`&$xpv>yH4&CW;_-8F!A|$mWA;4#>B6?@&XTI~8)Y2x4DXW=
zT~fY?VILq!DN;~S#PWdlJuIT1Om1yi7=a4bIT@ybVmmGEG@FH3VWrVR=_Sg0jq8)n
zfWCvB1A~W`k{^Va~9c_49vvcZ4@H>wusGNP%U?IM7?+
zJyqB(B^&0AEU1HBCk}bpl@f!Nu%T|atx`i9r$zPxn0qE8Q_yKRfUB}?Y-|9v;HMZ|
z?&Q8fGiKdMo%|tvmnlhx;NDRH{9H2sQEKQ-p_U|{k(D#1$ph($0*NdK&N*mcSF+1P
zG~VLpNOU3i4|9BPLflL@&rlv5-E69{!vy95-l_7|yM89ri9!8~JOWga-rZV>l$b^FOfkBH3Jw$4E^aBJ(Lwg?>`2lhAT<;sE1z&*bF+o$9CZ^0>m(S%6p>
zoqAtiUxYdi4;tHMdH2GWAxB?IaO`?jX6Z7WD{5_QVP8Gp!+9Grm%tu;gOIeXH`Eja
z5$c~bRT&mK+i|caW|cp8(wYMk3ol9~&@ulj1-OBA;_&DN-?O_wd&}e9Ly_AI1$^`C
zRBi}T2j6BLoTC}d=ahRmII3y0Kb6`M?q&5nsI-db8^~}GJ&;sN^Yisez
z$lDu@
zw9Eui)Xiw=`DyON0yPU>$R&@S>#i1sperRvyKsD??UF(naid4>)-u_(Kz}qWc>hPk
z0)SHYkWnbSgK-fqSHFmI5<&nnRQ&(7_oneswtxS)oyby=B2ki%rEJ+pB}F33*q5^J
z!q~@J6oq6-)~qph##n|SiIklgJ7u4-?`F*Sox19}y6*e?efgyOqo$3$uj{DNsG97$LGBBn-fw(zq$<{D
zuju#NjXe!6rGd>|?wS?&ed$P&(nSMFfj}|gl|5!2Kg!G(8;vtwGacXk;{z$m2AP7u
zy@^G&f|Z8eD`PL@R*|Rd?d`MgOrp`@EfLI?s}l_!p@!Fa%=SDea>u+an
z-&jjGTUB={l|BA;1F7%zf+I&?>A25lX2pq)W!p`YS{`(@^QhY)ahF$Al)1tS5Ruvx
z{F>>Xgi4X20H)I9f*>&MPrk|OTTe1Z#f)yAXFYv=6!PPx{^Y&u?S5768LQKw(C&L_
zHLNWL@rzqr{vt}h>zd2fsKSG?jeWYi`2R_SW(B$}r41YVv&pVr@t+`fK(Tf3GWj@_
zmzNLKJmEd>w{YRAX&oyN+6XG?v}pkfZPzxwicT*LR{|*pBun>O`HXGZFcQV}Ar3n^
z(_L_;>AW+l9vo%VNM0R(<5sZ3@NbC$G>a9rIPpj61ki#)h=o^;dgh>iZOx&PW=lh>
z6jGDqP(4GT4+9r}Buwlo#>dA4{@H$;2>a(czimM?=(gTDrND!5e6d3HgP_R*sdxSk
zdD!c#F{@+okq2At1sOU6LJq-B)?{i
zwA^~GH&qHf?l!r%z26h~{EI5TxWVjAeP*SDvbbT6Q>UhtnwPz@D=M@Ldi@r9E>u-l
z<71xix{)_L2rCWB^6BG&DT|UeuYAkCDzyW{VAr@s%_7=(^^GilrKbW9J;h-6R}$Wh
z3l|>!Fq1#2P2tXFH0=Bp|Mi{J=n^q*?MiK-cc&WxdeiSFc_zpwZcr7aaO&dH{>QTwu46%&%)zyXFpN@%U0T_rl8D1pqn=XK6rD@tFzUx%PyzC1oVh(_nd
z(|;%}-Ho|Py3Sp4LQ$sccAll7YQT5{H3o_hQCBFT4wQlm2k@8g_-ilaZEI(jO7P$E6xN~Qz~mH<@?UMJT2
zB8_tAI-46bpPO}Bh*|VzsQ_u7EXp8Z*%3JwoY~X!8mCepO_Wx}aMfum>Xyl9qYh>ny~c{%1v!tVWI2LKm6im2VVB
zW0`+aep4#lLTerQqpS|S-IR$@;|cP(46-d9TlcOnKDJYNvS~~L0s?Bo!D5KhFG?sD
z#_rU7TykrU7F*|o(`m|UbA64)8qq{mGo_0G2%4;02}x|@WYPu2i`F!Eq);LSCzR2`
z7u)?BKZaJjtY$g1m3lq~!ZM#!BDzZ>X8T{Bbla`U+O^FHB`&%6e3CNx!7TfO55YC7
z`u&Q+%e5>y7MthiAm{&@4bk-R)Ec!x!=$K@Pj~m9;z|n!nwunh4MS#o8;4YA7H;1Q
zz3#$Tbr-^JSwIXdIvb$v`^CAod+A=wNdnV?!sS^ruOvn##SJ!HFB7JYhIxVtP}38z
ze8>tkxcVSp*tzogaJSNNfj!Eyyi=1rxpssAGj)?p(%1{$Fj%e3c((LAqc#=@Y;Mf|
zQ@E)GGNrg4244vJ^fsa~Ym}IHg_B1~w8%y(h0CIL>>G^}#
z+xPjKBv`lH4R03&YYJastsT;Ha$1V-c9P&oP$|EEUYvf}`xdTOXnt!*RwZ_uTg+lL
zWrJgh3~6gkao$(+UB-`m|H3B?<&%fWoSV0r2K^MKXpx
ztc<{Munn1$CqG3NITf;eC@BGdmPsppR`8?w#@)a5x0orprPLJbFsz}i!Pe`AU(qpU
z%I^aG4RL}5+)rFw*`@%%xo(_evXkK8dt2wZsD0FXh9*qe_e4$xtrWhKG*@Xu8Y_d_XiNf?%J5W~G5YJb
zs1-evzZmK2<{&T2sqYxqdkJS{Wx35AxA54>d>CXVGrNo{f{QMfAGeUc&7Y&$ADfW40azw
ze$2PJR!@|=w1CM?e9yVb4G>MlCGdRei5C5N8trbA;Wv`n$<8~V!I5KZvBD>
zSNh50_@L!-;Het?({?*+=ic?p($doGDbmh&N-P;Jj!l5x7q#Fkrw?Ctk>=JPd~du)
zkr9L>d(t~W-6HGHwKu_Vv8+4KFGMWud@uKY%)PLp>otOe_Qu~imjXvd@PUj4_u4+t_>nr%0pJkR<>AN+YE>-eD%dsC!@N|t8)FAE8$yySmT4&y?M3
zXLIS5gm~X-fTI3xSHpbbrb4zrcdCDvt9j!@qt_PmRnep-Ph^Ka3TDe??97ZR8?hw}
zTCR?MDxa0|J*SNJaTzYtDAtLJ*;5Ma2*=HGoB)xLQ}qeOR$6_DixqkF+g`N66g}YyEe{$n`gp`?tRBAUmD*YHb*WIw$1Esln{f
z3I+FqB~T^tytEJpS8cVqC~EyPr_}1Q>N4>od&}$?3V)`4>iMdn%Y$^udXkg5(Rxn9
zPWPd$V>NVP^JURFTiO_f=I9Y(75VrGyc`&3TC>gQzdCKSn&m?2LI}rAqB}Eud|$bK
z$2Y%|MQI3|X{KKPmd7pAN58RHEPP;PN&eScUS%_=^DIEQQxq8*gisk&mi5(G{aV9<
ze@KEzX5A9K_r&u+1ECmkN0V72_~ivr9c8ot1I>MPppW^F)~MxV??Ve1{pkpt!$w)l
z@=};cwG2ZELeE(LDMnQ!KHRJPo-qILTH!;fzylv0*bowlY`;nj^j*&5^7`^B%Guwv
zQWV#I;ThN@)>YX;lEWhAq4iEn>4WO`dMdpsJ}=2A=y-z3C=4&LP#G+SNk$0@*XZIc
z7%#o$1+M=56;NKyEY3MYQD{6@dj^NDe#uy}ZM~UyLvDF&V1~v|@SF?S*XIY4c&V-Z
zHLvqsk^x~J%UmSo9VR-6uZvl>#<)XpOqk`H`~?E}6V*e4La?*ej^NVr1R?#Ah2HGq
zOpB?l??z^EuKqElYsGrTMz_Gmn8(HrqoKv+LsIq1<)<4EgLzz1W000I4~uGpvxX7B
z-t4R}%T{v-RN$N2dg~p~qRci0gIWkGYh1>RxGwO%Yv(@7l5!PQ%_jBnB3!e~nCzwJ>
zW+m#>`dO);l>2944p4RqV(vja3ZE%js4Y#O`-NWC&N&eGaqXS-5+}i
zjO7no)Z#>XDj6{RX-O}C9s?auY%K+qfjGjY=K4Qupi3XWw1U@NzL}9!ylo@ODDLn3
zl9Ls8ymI%jba+JR?O;uFxsi9yM#uFP1EA;H4!pkv+c%}REn_^Az`KAh9Pc1svzSJI
z&QTvWfDk`^ViBDISgllO)N{Scwh{RnofX5KW1Uzc9cyN9!2aCU&B
zh|8{EFxZA3h(adf3vzNkjVovDoyITe;zsnOCEz2e`HEFgZ&=lrX~Fx@+PGh=&qJW{
zq3v#zosRq|GJamI6B7G@oS`hDPn0T#yuO8rgWqzH><>14SACG%0{$xOL2iKAkaQO;
z@}jhT<=)?()=yW7?29JY^t^kWFuj!BsUBCC6^onlGHt|#U$|Rxh?Z8miip!nV2cne
zZr7Z3sr^_O8DV5tFgh1n{4O#oszvAF!`J3$WLcRQF0_1FHF2b#dytC$$^3h*cG6l>
zOpEUwW}#{Y)uhq$*&R*@toA76cEPJNCRVk_pR!3k{v{pmv+^{(djbC_dEqy&(QQS8
zw(nOCq9kDu#D1H)HSIeM!zsK|r#Q?bOnMNxGUr-L9Mj#cHYCy`yi=7^jT}wSv%ei+
z6%}AHUZ5zZE)fb{lNboxzvO0FpNzP~K*gaYUE--<2?rG5l
z+j_~NogLhEduu*}gIbZBe*s%~M-fks?~9cBFKXk+p^b4}i&n7iLS9-knA#+476A9T
zg9qy@3^&^alu)avmDC&727TmUr3E9Z(T;7o`~66jj4h&ZY?9^Rtw`sAp2teu4=@ZS2g^T(&h5|idhwkLD)=D^E`!r9A5O5&taBKFgZQ{qc~HK{-fm>{fgpg@P1
zs`QIjfDJWev2#NZP`-Zi%3x~!U5{~c)>kVBnZ+d;om?(j`S@M02QG#&-T^&Q@XMIc
z^37A9hU1KXgcgVK<|)f1NtU|5nUhP}+%nL~bri1msAVX&Nij}Y`aIwG2v#kaIp!dBSGZ))JEBqrAGP-KT3IT#f*q(Xc|8B7|k^4RPi^2&JLq*%-sAcbY-0&=qffl
z_nDa_;Bx~vC+)N^$Zi$$rsFGOC=-h^FzqY>BbwED67|H9TG`+
z=B%Ugp3y6Yw!R6+BV8)!@g{K`nI(ZzEq;W^g~{!$O73!=4^Z?-LUJoeIfSA7@?{IbqTHksb&lK1=w__e+m}Y>r(4)%jI(RynvB!*os4@V0vF
z6b`fRjE5?5&R*mnXuNUWKJLonpY>dfmh&WC+)bJ7=q0z7vXr7
zL+Fcr^<(LT841IO527+$ojGhbrJs%W8t}?-B)DeVuZYKKzpECl7k}Eo@Jaf!o5ed@{hHn!CX6L_Axh38Rd0n2*#by-
zjVR|-V0+dpx6F1_gX
zk$PHi1yo37&7EUqHcw`O?2RMU4}5@fK$Z2abx+c8I0*F93`MdA=lINAXUa$-aZK3p
zyhEh?&5Wzk^})01a-T;W83(KLa>p_}tju0%2$)z#u$6i@BW^mn2$x^R^bKru6g#w^
z`6{XHMH$C%yA42
z3mNk9DY*?^sFSgCIeU_+tI&FhU)dP3WZZR!)^*gVH{58``3v6NxV&~u3WI=u;40rjs&$GFRg_C%riYN0`Dq6q&BH@sMF@0
zoL~X6;9E{2EP~7Ht*{yL#>yi$E7LLya$&=1!SWMFTYLC(Yoq_?)@o84jTO&#rkG9*
zYP^HNi!$mhip{-ZjH{3y4hUrN8|8XGzlQ}Qlal4Ss47J<<447{2_;`c=wZha>I()O
zOr^=;#m~U=F1e+Sop2)zql>9JEahEsNo_ASg<}la_09-?1$!ocNag~j4`QoN;~ZiD
zany1$_E4(M8#AEHhsYZk;dg4rZ3%MO5ykBRozg3Ts&gbv9BWmQyu8%Qh*!XfhP
z!2`MydH%L;#6qJehAJsQQJt2i(<@t=UwPs)-es+@gUdRPxXga#KIx_@f*gygeu(HQ
zm3l_GeNXm#zCFaW(B2l2)+thBm?1Z$QC}1I2sSpR0iMg#mS!_1?ns+Xm3MhP-6)>W
zkh@7OH}4$7Iaa5|O!@kKD%jE8*0IChm6d+6{R_1W&cmckUb&;2(NN`KWyVP>IJj+e
zilX=(Yk;#GIi|X;#Mz+?=|TE3Eze$t-oEVJ`5KeC={zwp!|$PBxmN+p2)(2&wx@T}
zQ0JWrwB&M1d=i;sh0)9{V6}Jz89CbQgZa3i`y_OCcm!TzE}V4d6^Avuc|bY0UM2g3
zwhRAQF)Vk@crfE7>2jZnnluzNE?}NkwNl?A=1jqiU6?}4j8Gn?GbW>Kw;AV0lP60t
zOWrQz479q0UW?~25gPXMPC1NDRU0iol*e2gpteeJ92ee~
z1h3A+Gvr;|aVZWaLfVKtJIW6d>+H5UsArU
zw}%}Gme>Y>Cv;4_v2>=0$a8^v-xWU;GJ|%zQU>`VECK3c3neTADxsr@h!7)2FTMDA
zil=pHLG2T!BBqv6xRT6ADGb#v-q0^D-o*SmYfS!<`04}>uQMJyuwDrJJUZ1J_NF7n
zDG!ZCyOl}NH45@@URCXapOZIh@Po6}w!NU}uZzBLE4(J8B-)#ZsjgG5dv}nNScFil
z8UwrDcd9?NZActQZj0ew-JG4D9qB2&sAS(d?9x+cMO!QTM9p71s7Z0JvRjd`*9?o3N!a*h
zU&jX5NnXso3xbw35_d+WtUKb}-1H*O%Xt+sa>))1)FnLq<$V3r9Sv7wryJ*3YZ5c~
z>XY^EU*inO8ZPrNnKTve^dhDY-;m}@xs#gY)RnWr1t-``6*}xb^-WOq73b48miD2K|GV&cssGN)6`?Q3-V$o<|
z0@?=UQs=nk8>G=#Jbv2040a;nLP}%zY5(=oZg0Pr6Juh&8&=#rX4O|o9=DXOW@qIL
zUC}gc4=#xTu*Ge|p=iK&x-=Cy!k4RNfdgX>->CEP@o_N~KqMtg#1C07ncdb2Zolvk
zVbBzTV6&qsUSR^kBZhraz?SId$Bog;HDW175i|W#S4u}VikdWy(6Y`t>G#z+Jk>4L
zbirUFW#y3B8WAoDdqZ56hVPHu$j6loG0xR*cI~Slh8Y#}h|cf}JEm0&Xx7Drev%$@
zyOm$;1~H{C5sdl!_{mo31c3I{0|F>@>K_M0yQc_9lkG5{`G#iWE+@mN^zPa
zm;mMs!<#_HDdP3Jt9U&a{F6UJOvOMtc}WM~#Jj78D{V)|YCV>V5hLlGz^saKif^eh
zm0zJlOg#>HL%`uS1)l)ippS(jqN2O1Fc=Kyrd!-!T6gJhCl_Fpb{2AKE!A#^l^rY2o-wc+^_T`Tp&qx=kCr_O<9hPxgn&F}#Ld6;)<1s<
zAW)tR0LMRJO!e%$x3k{HJ(}h{VgEHr6rmDzde|8;ZUcm-5iQJ0@~yVhZa-=Ge|^M0
zAjbnjgH&bTf1g-PTGR}x*x#HdyyoM7kZPA?>Xn=jAD^@5bdKq#i1}Y1eFDGGGLSMz
z+ksljWz0@bPfxM^-3YIT#D8A!-TbD$Ty^52ee*~ZT+FIH)=XYD;?93tUk|Ngon!Fk
z-$>BE763xivsiSF6i$EqgX{j-Af9nR_V=4orgHzU7yn5}72sepM>Lp=9bk@s-T2pk
z7f%CJvBEKR@SlDOs22Ei>WCG<@l9btn51D^YWK=O>!Hg>QY=%8Ff!0vHMIhA#$NVj#i
zeg1ZGVP*5;6%`MUN=XR`D&}O{nqX2!%DZ=U&;&oO9*@gl`e!!*N#-|NWv^4zS@e}G
zq!Ax954k`oSpPEtV
z#B0lxh>M!vK`GHe6Tb7q*V@jV>T0_=cg%C%_k>|&j3U0hq;`&jyNm$b+C`NMqB~=g
zD1H~nd?d{Wk=oJ&@%D1-pH3|cneVG5m9FfJx*`CJsJ9RXTV_Y?srUpn(8zDJ^X>rh
zV+b%K5BwTvOx&8Oy*`~#eY#m53rt1(xj_xv=T?^*i067@q+=9z-X6+p85`q7a{(l&
zq+!Qs6oN6GHsu(_gEFNjX+8Iaz(r*;9&i{h#6l;YG!@3Y#2mC2)&Q8lihDqxZ_9}DejkW9
z6v?rEH99%_+FD6Y{VL_;-e>6m-blN0TuFV`&X`B{!XW91?Ih=88yh|fI!{A@=##$q
zHHMkpX1fGkshxLP=y^{H{&Fyq^YSQ#f$_ZjP~&dH>b|rJ^sP1vWM!<@YrT~{LUg4d
zKfOYg8#>S>zjbr_nvgFU#f_5
z%^i3He*L=5N@kk^XdRR{4(v%{QWCq1bKhX)LQ6#`43JW*Jrp~Dpps}{x}PG|8Pu*V
zgeI(_Cbya$0HiVyi`{R}kPT@h9g!pil2pjMJ?LSvvoyTZAyhhKtGIbqZXq+QsI069
zAX6LqinuVh}+G)7+$n`E>u4YeYKrj;kT*ND-&W
z#&IBMvGkEa)Jgxt3En$Z{@=oY4UfW;rnwIn7y=e^lZ=4+ghSFk7FKE$7^qlEes)cF
z;R_*{L+eBD)4+F;_G21NlpUi@sZ|R`2(su65TNMM&cc
zI#?&6HR0Nk_W^OR-AxXC%M`csFw=ScM=O;9WxPZuVdF3j^Grg|J+yzP)dSQlF?guL
zZaQP`8mi7A>7ZNIF8_+6fvA|dOATRo(j_zhcEw9ucBN+ez~g2H+udaTo_-89b!Xm#
zw0FML(~*zqw^X3GZKVy7FVLOgHk;0O)}<(t-#5p{)|2#GTTqa&-kbdl&8>#_uIin`
zEDNY3$*hG?J@0F^Ck3T8sE@lC25SziW4m$vdDeDEzTyo@>SA4113eBI_neGP{>tOw
z{5oW0oa^^)E9)LnnAW{5p&Fy>ni+~|vRy@muY4ty@VzksxRAG;Zwv~I4+l%Jwe#sX
z*Ta_+D&`eg=Ir5&oO6{0q7StFsPWjNrEj4JQ|YjOcfHP{
znWA6#BEV8r%W#a@^2P=az&&`R*6souE
zm5|ulX4~d(J|bH)P!OL1+#vzQ3-;!tvJ|-mA0ivy)jMT?)mJCZ
zFWjmOe5DH;1*9i?wOLpzc+)5VIyR<4^Q-r
zJ7J?9Dzg(;ag`{nQE_4rzCQzR;dm$@%(wUe8no4`8rWn7cT$>rYYF=19%Ag;FzCIX
z*;E*)1wB}ABaYMiO&)F}p_bG!3A<5O=chJKw9}E-(X~H!SQt?`2N`(ig*LR^H_s;l
zTI%b7(e{M@>UNkuwQ3yz-aBQ|RRSLt0^0rqbB7tApGn&k?MrNT
zcMcVX1BQjJxs@V?ATUrA4O|xk!c*kkGo`jq3l+^-Vg={|)T{>w4-#6t19!yhe?$r`
zDUqg??h9uQu4aU~<&bzY4_%4fLiUZ5frR}Mo-ISIj8pfB>X|U$$)AEqn;8Ud@K!db
z0D*cdsN~KmKamAmacCEYP#<`gLAzp=T{&=$j;BYQ+^B5lo9MDXZ1VK0izL9#NWmMW
zh&>8*9;@l4)#*|sEV%{2{K!con8rCJi$y64;ztcEH^nM)Gy2)h3-u&CPLB01Ii#Vy
zD_NZX;C=nA%V4Wl!Hvfq-A?iml~nnQG6Pxs#t9@5!6OOcIY5ulfW?aMOPbOgx
zINNRZI>dX{v|zM3jMjLDOf@8t26d_Cw4D_ODYQzdsjwY?7?8Oeo|&OUyb=UR`XSdK
zf-$$1K1=jK5VgeH*KsSJyxTz`UD*2SYP3tucbY@q14)cY|09+GlBl?w+K2gIqe?-@
zEb;La-9v3EKYf4?R`EM~3l6VN2V6ln52y*_cP6%R7{VqM?^6t5GqyQ&o=*0>s_`0H
zaofdK#-Hk920PYRUzmfpA4uA90yMkg2d}ke+EXU4K7FaMhU}g=kS(?t0*)Q?KB15X
zsm;HeWF82VcI!u|?*ZJsH%bZN90ue)r&;$+FTeymlJ84})3^0U)8>Pt3zVY=;#AB_
zzIJpR*l!JkvQ=RO9&Il=&s`|UyKKQD8>_U@#tOI7jWkK(I%#5^1De6zoWZwSOEzh7
zCWBueHteP=O^m=Di6-2^TeGUoufMlM5Fie|ndHYjQ&4!*K~5OO6^>>_`+B&zYJ#VM7aNHs`x{+xq?B7QNHUqX0#w&)bG%_zhOs2~hAdQ8E9RoFYOhXq{b;omAa;#9&RQt(*FVRg!
z2QXQwu|KTRo)~u~8QA5;s{RL+qJisCfriCQ@vL?awbjAnBc;9E+yQIKs0YHMOfoYp
zD9xUe%DBeOwADT17Kp!3EHJnX+IZ^0jSB{?@?lhU1mttQrjum79WZcrm5pm#
zUp{l+`r&zbRUgxZ{=$_lE9m;UA^+6|BHfSOac}cIRSu#>Hu!!(!Ag|_-szSriunVB
z05LW{MDw(W$r+KP#@LJ?(tec%W0Y0bO>cAdEiUB@PS*PvW&t(77<~)~d;Mzf{PS-o
z&KT(T0Xup6l^T7!N`BCOQc!s}AgOv`zGD#-<52D%|GkXEgL$v*!r*;9ebWRtCINEF`;=*<$->POt5Hd%
z=3tIze*q9P-g03*K)fVJz#{my%`ekd-6
z9|=s_yh@p-I^RtjV*uYjGWU<1U=h0@0rMKr)qjX;ivhp`iCG*1zp`G2g)^tHgZk#q
zKrKfV;3AJjE0KISuRVTRY+8>7;-j`lF6}ZfY%!P5G1NgsNT|{^a5DuAAjmwnHm*Q0
zHh;Oi?R;ehamiN7Z);(#bth@#8N(;QUi}?-MX~TSjffV$zWLXM*l`L?#r+)Sl63bD
zft_4YsDQ~^EY?A8t%-8EVRwSJh6DTp>0AE72na~0NK48?bo&-3{j&q-4fBH^>_nLa{$4LQUKcmn4ubFC
z3X`vfZ5$W?xDxZKvwdJfRk&XFf`+cCkgYyr$wGa-P00NqgrNr>#XZv1_4^#h!FBg)7
zDT3(h1n7LfU2D4}KNL#Mu*9#l|AP55ms=CLVohPwI6!xfK-^3*ljGdX5fIRwZ{Y;Q
z)Q*l$u^oWINP|G`&@y0#?m`0u=?K6ywwB$)!qahKG>r62kD9L?74QJIgAAs~(6TOC
zBSp&4DoSluPw74V864oKv#>3V0d~Mrg1*@`YHrBHbhKQTc}(aODB2uhSQK(hPm8sRls^ln)7c8
z1{m8@#bWyND@8eBgZivHX1|E>Zf$UAf*Sqp%W7EIHb6-`0v>`ImCpC9ytR~(^B0h!w)j-}hhl5jKS@uL~8I{-zE
zJYzSrb49L)Gdl>f6p-b_8F>p@6vo@tce8Hi*V|w>cMdkYcU5&Pb|ZyK$^g`;dk28y
zWwFP(xIbUlI?F1bF7NB^LkmAcLIe?{b(#nOvIhsiEdXTu8sKQT-RuY8pm1E6B+~NJ
zP45o&a=EBKc4*6B>W%-1U%(ZnzZ1PYO+m$H5&)Cu)XD)KS2}ux@s3p4f1fJ!(uQeK
zQ?Y&0NpF`3JlF%mZ@57UJ!NgUAY*9BYn)^m*t72%E7?GxT3tgBcA$WCnj}3LP-*Hl
z&X(gs9*P{|?
z6~LbvQFIu%lA$q9b^9`efd#rWRX3;?Qg{9Nefq03*7}E~gk?mAt3V;T&_Nhqpb70T
zFWtFUrLa-c?C!Rb{&vxzPS3np1=3Ivne_N9)&5|_GLS9{O&+8Usq@w{ul#aO`o^6Z
zq}*)OScdg)2?<0x`~*S4@chuFm|rSM;Urxh4IPE`IuqF3d{vsAmDRI7PdQHe^+n_K
z&vIsNjaD19%EpZ7T=JBQZ}7Z~$60F*R=iO-f*cf(?@(zPP5JewrjS9sJTm*N<=1VD
zi8|Ja_hrI7KEH#R4|BRAdl6z_bui=oJn&bbP;LYI_45dSGNeGz{QCSw=D#%o8AUmj
z_NK-q^y|OVTj?%c$ONSrJr^;l>7gA7JzZSx#fXa@xUHj*eb?>fTMM!yeY
zJ{Um@A=5xb=Ht<7=S}EqtkgbljC`M2;J!7XRW$Isv9I8V!iNiR6b*_Ve@6qNJQ%kH
zI8a-{wh#?Kn`~p^?nfD#_UlStL3?y7*dFm3YDGDWCYffh4+3Lbwa-tp0rXxzYAHKf
zwqw_~FtcRi9CWKU5Sq1I-jVvCvK{v@)^PEC#QBX7H){Ps{^dwEp^KIK*1lI14%S-G
zLqm3eh&`NDTt2Cugg4Liy!VVCS2q$n4
zw$9DY?ki_>$>OeZyA9N-i`0HXU=IKv=!dHeMwVJg5=#`wPtA(>o
zM?E-o`Tkn-0N@5;0O5L8=MVY@UfR_760JMn6IZ)bl
z>&VVz@wU0{j8z2AhaMX^C!Vn$bIMsi&j1rkFU}>M9B5#fW{%0t+<$piJV0wZoYQ43
z9805&TdiMh^lAg6sv^$0KPM7bgAm3pwXFkcH|WYf%LeLq`B=typbrpw>
z!nA$eqM!XXA3aq;_g3bZLf%Cg4D%QI{coB$Le{d?4gG6OQA9LwL8{{gknt+4wg@P~(kBYW?))|KaVUFY^tQIb7$;KYG{{`u$7^=nse
z{PPbf0sJ8++YA1sk;fYg{@P`IL-xu)DYXov;D`N|*KS+?^AGJ2=+7>r$OiB$lK))4
zdif@5*F^We9L8Ju5>o+>u8=*^dqj5Gll0jBlZ-LPO%7aB{UmYTfjI`nl@O(ey>^QV
zOTu#CoM+J6N18d$55*#%KXfA{lZ$ymdH>;;mxVpH;p?68Lt#QfB1Q{XqNux=qha#v
zOuTJvw38+eqHTS#$94U~osujCeiBkL%9D~0|Jn7^hi6_zSbJg$GylCxe|xDo=@VCe
z{eJ5=B&GE4re!a5AZRh-`*&P|j8gMCiCVl;4U)Nlva`444|gG(V>yW(-&4-^)1ALR
z3%QykD*NJmcjzzAwS8YMl46XWWf;qE4-LNjaB%zbOh$Mv;Z>{XZ*M85$<87+EI!y9I;eHyiv{lWGE
z7bP;GEscsJ;dY!DOH5Tla}}V1WF^49zOGBo8+&h$Yt(=_^L5*{>YB`c{cN%@(Qe|+
z*K#e?^y77{J5Q8gKtKOkd3ng%_Jq;NAe9GKHcA;31
z$GGzAOQ$8uRtpyMxen3uCrNb&k1mAvtewf9DWhkrt+Tl7GgPT8I&)R8dZ1pGS+PFo
zUXU(-PyD%~iye2|85CKNV=BA;)?L6Pym^YphDnb7=uYLb;
z&alMBjIR#Y6lO3`dtu}_LCVW^NqZ=V)t-rP
zoVuQhot4|@Zg*Loq;FAO%<43k&&E3-9MO&WnmA?#MNZ;&r|V5v2J>x6AaW
zeT`nnc^clLIYU~s5Xl+M>e{x;`6Gz-2p3urq-E4VQ)J;x?c&s=BWzXZMVeWGt7~~u
zf_5BUa`PG5arNIVakQnR#5dpZpZA0GlqN@#^kCrP5qiys9CKRHcj`{a(*nkRe8
zh-GAd)q^UIAPS+cFUppv%R^m}{my1ROJxELbEA#uMxm}1aL|z(k9xcL_CR8=lJPedUxoS?v-ihUrwKG&%B#1cni%X)RaDPBAPPmEYR
z=1w$H6)4WQ7kK+j_=8F|`+Gxz%Rz-}r}G!{2{q*dj>iYcG7DFlQ|;&)bJW+8*H&5!
zm5jn|)tzdzT`TPtF`7DO#c4|g=NB!o%NzNVi}8`TCI91{#!|1j>96IxtsPo49Aeng
zVq*yrw6LTmJgW9yb^pq$k{y?lzqo9xS$$
zY~jpaN8)wdit4M_bkT01YZod5xeIz9kw1XJXM%Pg7QI-f;^o*4j6kj~_gpmK28&(%*DCE0s99rZJ^x5)!Zgw=3_)Ox+7(H~P7jC+dC9q5^
zcMXfTo+9&jao+Hzv>?@|IvQ=$G|7(ReQm0;i~+kp0@Ey57v))gw{UZvFg#xF3^!DQ
zWe4}sYLkjm;c+y+v1J2!zG4fSF2{Hczc`IZF;@-`E&AptnNs;bRTO=&;&#|c-=$eN
z%(wjxl}f2y+a32CDaOZZ$sVi9{vZmZ>mW2Gp+SM6fx=6B{
zENf_fh2V>CtWw(cM+UbacQ%O#r)}M=+gz(-Ad#Uv?sjLGV@!r#ocOvfMp2+UgE)%y
zv;?Yk*`U*PbDf??aA0O)N!w$C`jf8zsB-(cp2n<`FFZR@5<
zZ-ApOCS#BTka-nqL*MoT8H4M<5$WgcYd)XKKD$npI`+f)_0raX(AHt<%Z7SW1ephp
z5g5HVNM4}o?jW^EuYhZYS-3C=Pqj02Nxu%ZI&Q$IZBeK#%V2fYy_d7n9fn0-%re$^
zQq^t7&7Ot<{}jmWbK92cQh7_aSg6tAg?Q5feXdPSl>uHl*MZ%mMy};q)xmoZ?GC$_
z>8I`qhHu9yW*jH6i1EH=At;Z~Y$FMOjCm_o#Z~Bp_ioo9f6!@`-F@Oy(;{%-Yjnms
zo2<;s*W9JgtXS8<=vOYB)>heRx>Y^a@4
z3++ZCk>*ZZc;z-hpp!$dU)Sud85G|4tY)~9t~@CZ-WPzn$!jQF79G%Sw$9e6yFO$<
zem`vQfQ8e^^$9{-;PG_J3tPutGhh_Cb?-<;r3?Rt0ldl6{gUy^QamOYibb
zj(?FP*t50_j9Tt8B70T(HJo2N`>BIqTUR;CCL6=yQl8gYd7?ZM{>BgWRS3Ta+J|B3
z8*rLlACalxKux#@MfSLII|X%U!NCPVT=L!(fr67O?M;Ieg@w4bK*scs^Lu9ny1Hmr
zw-!S(O1Asie>Xbd>p05dX>KI4-fe4WPaYSITS
zQP0jEWXt?KzB_=uI9sr_Ra(Gv{MZ|qldm+D@V+b3xl3M_?@<>r><#ZGO$iq!ldZqi
zu^1d+;&$XF$!gVeG;;|uYhN~OMcJfFXx|>lk*&V!-E3%JI{?4zt2ro0gY-ZO@z=p8
zl-naZU{9^IDA!G=T#*LacGZPs6vg`x7DP}
zfg&;w_HvTEUkV!3JkD>3pPv)dRZS%tVFkFdf-lqXyk)t@mSr_iHrRfnh9}e0`tf`&
z$QAfG#T*wV%3NS}Ax3$)Xk41{Rah38I667ITm^lphN)(ks#U>~*K{=9z>w@6G?9Ef
zJ-4RD(Ah-UdU=D6w$(>}sf2mMQjcNq8NK
z=8ZD)tU;Vk(hwcbB%H5allN2>N+CnSccfshL4LH(b;CNsWUf@-BzP;xhV|X
z5KpbgIw7*TMzjw1IC^$yvEI4=Xk^7@J*)a?f--bA`#&DiWwE_;Frb@j4dhVLHuuIEd%b8VajOZ{cV`)7hjP6z3{
zbalwP8RpAhW|{_<{*r@N5}EW*EHy~Q9q<#=jTYQ!$u8h?7vSDKUBT+BAj|A*qo>mA
zucmZ8KGMY@Z@QSA_&#d=b&ZA&2KAMbB=xPB^-%Tbku%hTp%MnW9=E-X91gQqVr4+v
z={bzXdQX4MRZ1%)6s!(O3&2h5M2XeM2Dbkkw1M7d!7QpTELb&X~Q1xrZspDqs9Y=jl%3C5oGIF-m1icYe`r(s|
zwtbQz9pko7%A^E(qIED`3DOfuS5lVJ=aExcuB+Lu?3oV`$kwqbO;Po%)hW!d<%FLs
z(`Rz&QWA2i2e_ov`Bs=jVOJrFS=Y*YDQG>|mZo!Kl@RIKZZ_i_>AY}#hHH-M3{Ebw
zoXK&*iT1?R9YmK0;?W{b&;^M8Y?yb`8)LOg}w#2L{XL$nLsS2S>Nxlx4KN
z8S!~>X~1`QwT6)IRKKaIz`_*mb<1*q$8e9#m!pJ5^lh=kl)U>TZ*vu)lp$+rRM|BI
z-cko*+;F3OT=73tKF_SMt(?UfVvAkrs(c;Ccqj(C-JtwYuavdy-?3xlTBaXApYfih
z3YO_zM8notz^^)wHb!pP=>5ye6z|Q=L6h+Op=rq>0n;YLU@er*nisAwtfg0;PyE^*
zfFn6eaA?ImaIMOS_p(~kD>JPKo~KP`7+`!jgRue;mti8j#V8|Q;@)uU#!uV-)NE_}
zBYJ{`mA3$hj$4wb))dx67$n_axZKDvEDt>`W3xHbt-Lv|WDV7=4Z=1@CUsO(&K)KA
zjA19ilK{*>(~Ree7fM14JI+B9-eys_-T-p>z{F#%&$+1H;=w#U{A7QPblyZcYfhSqq$#&GS8-DCJ=#xd*d_5R@5snmCp=%H;=}E<
z22Mz0JnPClTqnJlCB&UUxGPs*NcL~EYhOnYG6{!S>(6&o&~UZ4OfX9N24z
z-Rtz6Qu$1U_|Q#KTj^Y#oKa?6^gC5U7j4ofGexuT_~g>cz?0xLm!tbYr9H2WXY|*=8*0xBB94K`~`6iFM
zzBDh#j~(3#jp#_-B8p$-+_D(%cOn(1qMOf>CTrD=I#Mpu>ixyU<&#?4f%_JV7iy`~
z>*1dsMijq;l73oWV)$z3vZGb^P@S=bXut4_WMbhoZR^;C8iU1#S1(_2#)dhS4Ne)B
zJ!0g_#2yi;OR6RIRI5IYY~O0b<~jPsv2oX;a2TfFAv_zbiJ!_mXA2redEMrP2%G_%y1Ci?AV
z+%9@V9WL#(9VwCKk(J6%7~E?o+Yi6v89{>^xls>-c1oVp5K39nqDfiYB2H44|{
zc?;W=Onu=5>%{(h4wGz(64!`zi=z(C
z9IfLuVcXI7&%$6V;^t@88vT+nMAZI)Fa(MnRTlND6R$n7Q
z==u3g_w}>k{&>`Yx9Bu+sAhbgwpUhSMODl2^}PqL$)-cHK|v*!r&f^Fn_hsE(QzVe
zG}yrBI;*UY!r4ft2O&b%hSA2bD!%h=JJlp1TynAm(`ivCrWh$M7LMxoFacOo1c9pv
zltzN%l)^*AXZ?I_v=;#Wduv}qKPD>JxjqV&S$pUo^dSYxCcI4DdvCc%}DI$^yUQ{b}-!t{s~>}+Mm
z=EiC~z~VDH??c54@q#uu+E$3U+%v#*RV$@Rn&D>)wrxie0wgDm@bk7A27aE`W(K%B
zBeLLc(7D#bc5IiNmZpzMq|ImQ1fl%}dkaPVCDoq(Vtv5oUA#(KjU6wMguwYxs4fB^
zW@LmIEzby)Yv>RIH1td+e3`_Anb~XkV8T8eAOT-i0f*a~y&Yoyd;lsEyLbpI7l#(R
zk+293Wbyv9Hf-x4)xL;J!a}73j?AVT%WJQc#oJ@MASnjLv{2tg==lV9*wd3L?7*Nh
zKXV)oM=H^q=iG6BN%h5<;MgNi07*%s4855@9su95pqwGT&jyLNH|hX^>TExas!2zN
z$>_WI2sy{eOpO8=Se0$g8?K*KYI_$mk0v;yXnoVg0WfUe3uQhMXO$zuXkbn=8MBq_
z@zm;?r#SNG8kXaiv!hXSe3eO=En41cB9j?v5gy1|q2U-tWEXcn$lgXDk#knGw%ar+
zuIi?!e)@y6nIyf>j8_a7=7XvWjC(hrI>kmo6(=TUH-%tSNp8P<+EVFrDppUaW$XS@
zk7Y)bhOX_cyrB?8LxmqJ@d~XwlY{Yny{B2JgTgvpv^yQ0*8YQ`m+nMr#ovio}kiE(olzDyLrKfza9|fzLw>vca^NDS5dxz}FGhsM&p#8g#H=yctEjm9|
zadvi&mgN=%B5r=z=?7KF-TE>|Vz;uo-y|v_3OKt*kK;b?-0^v+kYx}y|MItA0Ts+g
zz^@*l2s!h;vi#pOHc3gMG<>aEy9C
zBsQ@(%H-0|rf=(Zl48K`&(j&@?=-@H7xjG)|DM!$IduCge&3P@(!V;Kh=f|b3^Q1Q&S^FCpa>1m#_kgL0g=H#XY}-so
zCWHJdvDtF`!teX?P%;3-qqk0Qm~De{Kbw_=01#xWmn5hE{Eypd&8;Jp_**6!83Er7
z@sHp*N*x5*T8FZ0p<2wZ-`>0qg6!D(2KDd3&5wt1(*m{I`+Qx(TeaI?Zl`h@1la*H
z^4dFt?E9wyc6DM3q@i)`=|%#Kqj{^dRb26)qeL`+Wh_xw*-m&Cz#esr4yv&rrP0M}
z?7T5QEnWN2`ndJt8IY9$j2$~ydQ>?ky-r-j`#4XWRCnR}q{S%ctdnzHABQ!9KJ5n3
z$lY)z)bu6P;FM8%MBe6{V--hsj67%Vzcs$uAmd=FrL
z7$~wPnWzOG0;qGnlES=F5@v(C8|`~p!^W|?ARk`-a>||IrH}Z^2t!x5!+7#21dF)8
z1?{DBMqySmCj`uOgcsTj8oA3EUdi|{yjBul{>lpw6`A(`DUlL!>u^VA_qaHQh&ww7
z&y*f*Y|*yp9^fj97oUGO7t7_$W(GQCO+aVVH3-{@2uFfmQ`-axWQYN|xsY^4cCGMu
z%*;S}ywqVaUg>KnP*mcrT*%ake#E$QQ#Hz*`?sLE4sUq}BW3F2_f
z$GiaA>CM9P5>JFdnNWI9i(cm@iH6MxucJ6gW~99Ub0m}U<`lB9ioJFUG~#$)g5VK6
z%rp&mqTDlFP(A5xXX^uL-R&aoFS0#<48mA0m25yT8EA$P&4)SxLHp*dfg`vpwARD5
zW(@3h&ki$3^q2IA%Xh63W|o22f0btMmxK_t&Oab(vA`Di
zmN1du3#&uEpa!6DJ+X!i^g!tIK<^8^Z<)*+&>IjNAK`G`EUVoxR|$GH
zw?94`oz+sGyX$EO24A-pE3~W*1dKp9BGeJc>%20DeKgUiED_$Ln!VJIHVOov#kv7-
z#72`q$8W01NqcYLta=g$lZW?WyDqZZmQCFs(jGM|Goj16PBB`>TMks0^|e52!igM)_wr#qHF;pn`JcaT;X^3s#$K#Qge}7Z3piE
z`6ICF`YK?a`f=rW|4%plei)VHWd93(D`aA*Hayg@E~48eX0>}b($(dS|9AnP&rT>P
zBeAH$Zc@{AmCt_ms}0_MIQDD=iY456q1~i9m|K_A>SstL63Q;WLn`fWCLVFN_Vxc?
zqbkESp{;|o`VBGHN4g;7;}
zoTlzOvXCe{5|E%lU9?bwYSZs=HZD0EpH~ih$exnJk_@^lMqfx#Tpv$LS2_WPn1sQQ
zsoE1)fi6p_XgqlAoDcv1Xi3vN@5+o129;z7x?JtEbXCp4M5Q9w4;{~TyEKlG2RLV^
zog3Pu7PUaY(sRR0on&2Fl5Xc#LldpB6QIGR4P|O~IcWSr`jLI0^F`}z;Q4I34`-O;|rB~S9C{H)DADNB_1T@FK_Nb6&H_Yw#P+1P3m5oCh(Yo=Y9
z1Zx>Ir1&nK|A}#v90Y8wT0@(&YkwKc>q;u!wK@2PG-Uh!`cWjl
zhv!Jfj-FJxwQF+|^PV-n8$1|Y9toJxxMM2g%M>mT8YAR&<;v4QhtVZw7<7&5pTd@J
zda?x`u3YSbW{WxJzrIqoV_W}*W|aQV&k3e`oav^Zz7B8DwbX4t9Bu+mRlelep{mR{
z#n3=#a5@9@#|{$6^K_U);>dowvD7vF_&WT>CtA^L$uvvrCfZpmfm5;%B@dCxFt{xB
z!8}|zF%uv8M$B6|%M4OqomE!iF|57@^{YVm8-(9Etc=DJF%wW5hz=Xx2%s0Ov6`xO
zqp?9szM`|&gu%#aBba4waNEZeOmq9L-(|MeOq|cR{g%?}C6pgpK6AgfcmLYLAm2Vh
ze~ReWJrQ9AlP@fy_fkX@Z3@gJKSo+vwsp=_1X4l`TH3p^vurm%fmb1m!S6
zZs{-3+-@u)CHIUsgU}^hl`({1VEaw2-1g|Eu*9vc_e3OQ!kDCiB=37$1y>8ODPS$Ciz)NQNDnaeFEQgN3Cb^Hc-i&I;PiJ5hp!l!wiRi6VAdNkmceRM^z$)CvK=;S{zqf)m=I;jn5ShPX@t^7c
zD;9sn;;*^gMe@JeiActlV89IjsculPgF0JH@L2n1#yuS0rYnAOqbI+37gd=19Lkk~
z+CPQ+o*Zph=(LCg)Fzm&0x)#Q%jmi`!$yK_11vq!Hl^HlEegJ`b8wOL+x>GO;M9})g%RuEB8x>23EQ})glRmrF^k^sPwQ^F6To
zua+MbPWns-mE9o69t%3>FX6`0pkcHJ4{0xhiM`~YXNOZu)e0u(R{zuuO|Gh6@e~PG
zDNQjk1(75{aW5*e8;oH_25Q}Zhdn8ML2d@jvD%(`nalS>On!WDYau(BJI$GwU%`Tg
z$Q^h$MZtuyP!akh0VFyV5{b!KS`@QcT@R`l#xkE(>i%if>iXB7A!|rMz5Xu5M6_W)
zkybu?0UPXr?0ZTZ2Nr)We}IutK`8G8lL?K0duV9r{q`i-ui4;DE&U32WKEtyxsM_k
zEw$({iga#pUhEEfj0KhK)7{{s{T(z!o*`7B4Fddp=G5c0;y;%1{e$G`J?E+M)Wsn2
zkRK@bt&?D0Z7Xj8P2YY!zO+2EDS*f(qxw=+46Co`rR21-6VlW>>d$UZStx~MU|IIW
zAzL;;Z51@w>H$@Zb!+Dri=YZ>zY!S7n6PMmdc);nC+4K?KKl5VeY!lAp`f>YYic@j
zIKq*$8?4t}2A_00{Ry&0<@Y7KRqij<`p3`e!t=>}5=)mo_gtw1-4eX_n-ca|eZHJu
zrk{npoJVoKSb|HheR>M&@!#Th0t7P={m#f4b1b((Sxh(*FSL1(KWuzQ2lo4aKY&K{
zubI2wQ+7Q?Gulh
zg>)0Zsl-LGytAv?_{cfE%Pls>*9hv#`H!Cp-7UcgSr5fN(V^zXG}jAlxII
z_^Me0Cg!|c1yh33-!GG3Bv;HVvsrz)E!AZ{(FPhrKdK~n%GDQvd-CqEQ}1rJGcw(P
zm&61b!h02uU&Sxl|5+mA=ES!Qyjo4#z^G&g?RSquoL%_}lNk$^iDZCYuqL
z*-r#R2$hRIPp`vV*XNI+U%0F^Mk+gPS%sV^~P}2Z34X*@kwYBzJC(+5=i`l2>
z@#{0buGOD(75uzlAB`gH&*-B1o{pZCSibJi*@+J<0IX4Q{ZD-%oCO-e^^`Rc0G{CK
z=qUd8#0yZ5J(p&PQ+WMys$g}BAws%>`siz@d=B~sLXUmAW!f08tPEi%4uHDpgqa6&
zcpXqY89VtRpf-Tz(K2Y*01On4?t6k0`qc(Yy&j>VN-V8
zC?*>_$gzAjg>iBjj8*%?{Tfl-S_&(k`j<$`(+tY_dkWGd0LPdOFd;)4>5PCbXY`Fb
zQ)R196cI3DIh+u8LPeVwsiy{0uStcd{{hq
z^~hy?Q=;Q(tqZ&}pOsxMnE@0e*GW{%5inZ~9e+yIi?eG~6o{S7>P)HM2v$VR)yodI
zJ8`R}VmL?&Z>irt?L5R2`T2OGNY8R@#@cMv@L4eeP*Ksu4;Y7J!K`U`$?_bhVTUxT
z6$^32Esx)j=V*2kjL-ACBzps~BTdgpmlP#A(Wk4dUCj$U!h;Ha;E5wV2M1d^`maFV&a?c!K}+Xtqws(&_OlWSkz?`nkwkR|h8q~8(RI#yaH?mfI&L${GQp`GSfnCvQ9vl=C}@@Z(g$-d?x
zS$n1Fj88UM2K-b#$|)1Wfq%6K&Airx3Gql2bOG+Y{{dKD}_)Wh(e9UeU)x(I+@K`fS#1Cv8a&_q4o
ze{-fFCn5{BxzZ{`iAE0KijPnQ^X>C=Hj^bah+OR&Zh&UVc%n1~Ss!IBVu!`Vx*ZD2
z4O;X?FRc}Bt`@Sb97%7r-jLCYq|H3n
z(bZ}6^*TUp;d)JPvmcO;cfB}7fENLthct1_)jWE&Q)WBt)ti4QeWNHAXb30_M5l2f
z9VI-If|;t!_OhG=Bwz^NY~L*BNd!zDiU(Xabwm%)Ct{~S-(7c$N4Z*^&~O;`<9MmZ
zQ8la@7v7H+t$|(bCe)(67cv=V^a{v!A-k-~GeGb%7+_%#*Cja{4o!{M<%!HUsS!zz
zaih6h`kn1&A__FIZ!upBL-6ZSn`;q
zG>8K3myI1ePuZtQe0wy!kd_m~wY6y8(xh|?rvZ9gAHRAHbT)K;4;Zr6SN#g
z;NCKFlg}7QtlriW%Qmh9R1uxSx4ontY37DMxGH&9&k%q`%#TW)boh2WZVm@@c#&6t?GJPH0Iak<-u8^3~i952Z8_eXf`ADk>f-C_0(mWkumAvExGKq#TA?w*I)HRbPoQz7CFFVTJ;W
zGUX>J2evioWvVefP^Xx;ejQ~uO2qONJ`gQ#VNcfYFf1o8y1JpVyTBB(#O5RF^Hc2yxs(5N)r)SL
zPqVTEjQ82iKh<`GiX$_P6rGUvF5`o37XcL{w=TG{J>QGqu^h0_*vaf3@j~7YjC&=S
zcQ{#6vbldRf}Js*1`U21ZuI{Fw`v2HBLD)LJB*cS||=4!OZ@&f3Qb3aH8t7v5%#hop%;+C`T@+
zs5r?ndnx&rpc9+1Y_nSfkyGDX5?hrI&R%=B(h+&QLEC>Nyj;QBK?
zh@2J7roVcOLDhxth|NK-AR{S=xdcoaVz4hKpdsEeZ~7nzR+s~kLqRL|aZsBB6i}HC
z90ULU;VIvfK@OD3&l$v>vzRH6zc{ypLlo%Kg+=-Qp&s$12uL4=#M<;R_NoOVZ7Ur0
zs+!L29mNEQl}x|l84?Q4Ax2|&-iWe4td>r}t?#kDRqOYz{-1$@C@d&qMB1fUmO&mE
z+6O&EZMcX46iMKWEVO@a7X5i)9cua&;`|~_Iq{&hRSOIo#D2>ck_F6fyt2#eE0fQs
zgG?FFmIO@Cx_KUOUyUHQe@UZjQ=b8_h&W#$D<(_Rn?V7f<$Iv`kMr<=UA*K)-D{q+
zTg}RVerwb^a#cqQIx1juLTdqwkwyNa-LgxpX0_I&gHeduh
zE^_VbSrag$JZiwas##b$|Hj1g=jCrZvW&E%&CmlaW#J6Qt$_avO4#gx@NAJhL#Z<8
zJ3a%dvJNJoq1L+!VibmGIY)s)RS#>dZ?52@o;=lEo50=nU_g%5*)qYxbzW-?3L0nqay;yU=V
z^lF~w?-V2Bm!NhfW8`m#J>86QuXHpH@{}IgES=$GOGb1v9LmycNRSbiB9-Rr4f)@bpR{d
z0ObHsLOGY2>dXO68vyJMWTo=3OY;0QGZJtWyhr}+4dDrGTVm*fzxy~~Cu)jlZf0DAB=RpF*%l!2a
zvpV(Ab5@_FE5#V&^5x;k$c=f}CLdISUCy)}Zy5zXSy{|sF2Tg`i8a*}hqk8y6sExV
zvhW{UXSTTFezCt%Ci`#RMbV0+(?mCUPCf6|mIW!KkMLN+9LS<`1;fA`Mf4U6G=xl!
zLU~!uOy>F-8Il4(+-rYKH&rjcArjERV(;LfKv=dDw;p)m_DdQrJ#1GpTGtTWTGpaH
zbtTcNXmj?%31g-0lS7=pXr{>3>jZ7Ux#)+R8@I~z64&_4FBE~k2XTv-+_>a$ZUY(5
zLZ}N~k!x_x_MD1epRNKAM_kA=926P&&Os&~qK{yVSaM}BxZ5eQNt75q^smFh#O>kL
z%$ZYJcopl&3pC#w%1
zsl9!eB)08Ce~my-^)CG7eT+A`RG-{Wvnq96D|c;LT@PV$TAL|vY>1U_Y&VJoB%nEX
zU?GEi0AxD{K!X<3t5khD3f|!ot}fx)N}&rqn?%Rq+Hm4bSxcfd)lNT*IB8jN$~{I+
zNl4lRSp?lAuV*)Z-611CG5S_C}3O@&3V
z#Mf|kHbJP+yW8o8qhK24IzUUz$ME@%iUDLTGG26kpflw5QJ-d~+(3Nk2}i0TT!+Ks
zeTQooed`|nUlne%r5
z_ohb?0Qg=40(pN5!QO{9Ao?19?Fmtis}b<|jeu@AWFK?0OH;{V2~jXVqqqD8av-9J
z83^`_9MDpWQ@9S1%|oV}c;t?5p3QZsX9usR+1z&Cf|Bw8l--bBFrU0N2BP8dNojM*
zcQd$PHXs!;$fmKA34}Z!z6&az(@=C?CE*D!#I+6>o-5Su8jP7Fou-xeNH^IMuN(=X
z5dv#5i0K*t+JwS=mZN>eLx!Kx26?IwVqPi9;VLkwb%@K(96M8H10a>J@3I(0?6yc-
z!kL{7#;F%)*rUEfR=yU
zH0d~E7?-yp?SX(eVT>3Zr*e%}I$8??0p6I)P-_P6xa=U^-ERxDN?}Hq6g4B>QoA~z
z>KYzIjb4l4o;;T_m}x~4OGfBdWnuF%iHE4i*B1eHvtl{492)mcLo
zBpg}vofEu*)oe@w14Vq}J4XHOu(t~g#l6q#EvP;w
zE17g=ndu$4uyEWsp;Xx3ue@~VO&Z$lAnLtti;T#9SSni~S4{;bIFS+Ync6y?b-&MY
zvnt$W0RXMx5IT-^yDC1y{Clt^dGu%wWX)C=CL6(mF&)ZG^eUwtwxEz=^0;*gaC`?r
zUQcxVB7gDon)CPfc_N}258<&M&Z?e%NOD?Eg;toWa|qx~Kf!CPqUXrj(EWA-Q2g1i
zV}M7camVh6;6wb2ppG4S3#=bhbP0RKJJiQ&?Q!U$=aFk*
zdiw*vovLKiOHyIIjRsnLSQ{@9!rb#67nMNRP>HC=DH@d2M2I=^qc-UnY@y~JU;;SJ
zfN~32c<7n{=f31n=TURf9F%>qZX>OQ8}r8yW4IIcY4$jC%w!-kQa9YL$&qJYx+GgM
z2Jo^Dl?rA_nkSU{p0-2n9Kva4p|qEsR6HBFt|K}OyxR>@6g02cs$;EaC3uKI@S?8e
zr#;Ko&ckKTsN=&P$ZZ*_<(Xxu7wIvkNgNR7+fO$EJEsLSO<9Z&M4r;4;Gt|Oc4@Tu
zgp}Dgo^t~pAzTEhL{4+z8n-`BOP+St)iHYT&V}r!Gaqf8cZAFS()uG`-UunMcVH%l
z`T_kc87=6IQ?-Gz$re)7P
zt909uBvzBiX(wya{Qg$nXk6%xe?Mo+du3t3#9L$aYaX>im-YLugTE`CWK=@WO|NAIhBr|ATUa#h#`;hr>2LC8v#p
zQf#OMY$59evDMR=Y4`&m{uK0%1CxoiG~B5j&L3!z92ey2pa#qL6JOp)5mVB^J3$N>
zmo!&XG*b20WQN&(j~Ku&y_W_X+zp|^6?tt|S#KJE`Q&xoSbJ7r7xrI%{ar^TM@i+V
z@U~N3LL8bOPU7a;S1S8)XrdNM7h{)9K$Pz=kECS&H=q*)Q5h73HGrazKNt~K+b1m3
zxz(Qtes~9Bc-sP^+aGTCdXHRMr|Ec0GEoZ&6-}TXLN#{^M(8OUaI~`1wJ@!msn5WIT7{o_5p#Q>un6$DCSIOO01Idwyz*Z<4`JsO-E1-Qt4
z;AcX>D^nZ*RMrR<5upbvTsENS8zR?P>QclM^!ui&)Ib-42E!j?Hr7|;fwMkK;McaP
z1O$7HAf0^`0p3WW15on?wu0FmAr0W0YJ$wh6v%$7DxgwWcrPbKmPz9osLlBu*iDnQ
zrJ2~NgWi8=vQW{6B!Sdgl^^iqb(p2v_kh$7i|++{+?QZ1Sk}85>QQ17r2`C1;7G+Z6@2)e!f{l
zZLOITB0ui{_V+&XY{Y-}{{A$QCXk}cPqg!d14o$Xl?VDgQfGyfe#fnWq^Ph#tL(_O
zh=iu^<+vLu{$vNQMjfM9=lz!((6{s2O|)&{0yd)!&)y5|Xc#>gTLdM*P=PeFVc|HB
zVGN*9MkebZbalT%Q~%KTe{1vP`C0K;I{R$PzG53_Bp&o+NE|xBdrnFT2qrGXj;dGM
zL-E41L-c_m0$jFCuOo31znKrod9p50v-EZd2D$Z}TnF$zCKJ#Lyz-!2W4LHb7D1(G
zt2(Tntd(4Qx}{PGB2_c%%u)olO?z}6YDs3XF|CX}c3s0%lPY?AF9m~UqXy_J&@U&vkiBxPNq;-
zy=1ii>Ng6;$CWJd=heqRa$2iRAv#?o+{z|?K`X;Jc5xXnaues_FK#svT2o<6W)Kt^
z2XDDso!|sj{6H5|sFK9`oYOKuUAe{9rc2o3D$9srHVxNtW}$NkAmrDc3IM#{2Gru?
zDHw%gKr+My8O1_hJeqk3)OHXqUW$3LV!wl*Dw!l{8=U}F4u{liD+|js?-n-8>3g
zNm3-;9=hFGaAZ3ft3hJ}T>ujBdbTu~yte=*M0yyMrp}&CnYV3vxNG-~m^|)$^&PhA
zX1ZimAcwVJ%NHJTP>vV{x?I<2V9=gM9ROY|mvANr?LZYKJ+d&7UN`jGrzTVY+iK#x
z=&=IcbEHVI3BB$JD{$GXMfA~7LX^VJrO
z0SMGl1$t7np<<495mTK7&a2Pf^NtR%`-+G1`nvCM9saVt&|Ai+9zleuiQOY0gT9dZ
zhIaKZ?@e`^$lwhJ0KtCsKFe~=tL7s7dIsHf4VcHf4AuUE%2|?I+_UD(yyg5L2to&}*Z(V2aM*kH8jUcgd&;l4o&hLfCxrf-=k~(g==&GNW1`Vt!@{oiQwYL
z&|SKFZ43ZK_!@qhCa496Z_)$|#yEf#+yGRgv*tPLEAv&MukfHSZJ*wtxe7UId8k=1
zTB^cXQho){|KCYJfcau%Svpf4EsJ=pm!_~YoPEi;H>5UKvXITsc
z6njoj0TEGVc3rcA21TrwS~C%?*l{ybheOGPAg(sj4U+|c*>QOfPjqHm97XB)Ui${9
zXzn9%y`M#4-cJ*7{-WthD|@C%MUiV~#x5{WPjK)U}@lC+L!X_E-q8Dl-!MoX-
z+LsCz*5M(h48FF+x23~N1$N>6Cz?03c$#w*4hw^d&>VQVUmU>E2AQWmnh|;mT{{5U
z79=*o^SfJ$@+YaqQ-F
zG&Csf1}rPDH%22j*q~%)lpVG#m;Zrk8b?#IGbQ`S?LH-Rec%_tyKagiLHpmD2J;4R
zz9CAYGo>p954?U~04S4fr6}`b&FoO*#g3co%qGZF88|7B`--+-neb)d939~GVHAL!ouCpiFxR{sfJD(Cjt;&X0YWEg5!fR=
zCAWI~M=vxqQcB9E4Tsxf5Fy}BDapooorV;1u-SbY+pY{ry%mXw2$K(eK0cAXP4~JL
z=)zG_K#oAYs93Px$$qE*q@Th@9#|j9f%Dn3nQ1?}zDrLKYV4t!ryo-86MVWkNvPgit^GhRFo3%2Zd(d+}vR2On_qOfsSAQoA@HFUP^|ijVP^;6aK^WWUzyMh+q?pY4Fe
zQyI-Ff|4mD?0{^4Q~@352;y5{TCv}J4*afOP`z`-@<;vh;jQGv3i8iM9UG@e7_ryW
ze{m6=FA0Z%z=V=wwJPdSw4Mkd7d~HlFD$_ZuIVr#6O{@R^3QaEK|9OzR6dAR>mKY@
z95_^rW^Ezn=9MAHNmNitxucqHa&B@Ex{HV5t``xaGoI>%$&mLDG1VUK_`V5*Mtp^9
zKOvN-1x_uL9DD2YZf_3aL`c;fF;^8q*ZDxynCPX0;XDS+hnz2Yumz5BMgl@pu{rm$
zb2eG#_QI8l#qz}w5;Yy#l92-Y0dNy`{rV-#d8{*R1Ip;k7UyUBfr?)~*o=RG5i+S%
zT9}(wMHnk`1|tpC1zEy<6nCz)C8ZUHkpu(i)F4~^eqeN;L>w9KQPt;%(1nYJ{-R-1
z>bvmwxk}>c$GUjR(11Y}V5+UrhqF^X@L$)LuS&By4
z4a%7^?tYVx<{IC2N`K!6q`RGCh#L@2BJDpxeb3=OY4&bnqx*2Tv!qc`|EKUQkl;*`a*t&7sfn5lWl@r~i*`2pWoO55t#J_Ot4xti4pLLjp>r%TC-ifvF5D
zabTU#B~ZyEUHLQ%5Wb2>LJ8l#ke9~hUZvt3zsd#k$lVwB6l*kT=kklD-_bXX$uh0s
zSnGm%%2AxWcfC|$*2Ra%SBIgX1KV9D|pE<+Udo!7`Zu
z%1V|LxzA0dBnQ`3(5)TWHpZ|7$w
zCZeA~0dO$av<5T+8Npm*;)QAY2`_IE90b&qJo)9qnK$qmfJVTD`U@Zs4{kd}Lf{ZF
z2Oj1XL{ft^qt$`}rfIsK3c+9Lz54F2^$&Sko(9g^V?M?*`s=alW4`Ts$t%p$mkoLH
zb>5t#g+m$T13@hNjbsp^RDD
zTqBHOq2AjYi&?*&bSZ7Uj}S50gj3&p2LUYU!&o|hy7|K
zwplq=M<3}2@I_HEWYPU`4{A}^m>dFl()`QTs^5wBuf{n02DpMB?>~1ml1I}1OSL_W
z9*hH3P`b)A9^(x?WCcM9RZ1V358YyD!pZRl_sJwftLg&C#<_E(G%2JcfY-yu0{$2Y
z9txGxH9U)Rw)M^)O?J|X@;4^WMlR5!oDxU?9}~|c0qa#P4q;c0!@qtN>f!6*>HhgGk)u-b7MHh`Xu
z0}AYNKAhoLn4VFGu-iS*L1pU%5`qHoq!i)ssK8}uDAh|2R6^H*LoIBS{}lkkj}Tf*
z41wk~Cgdzx=!DWJ8*jvVGe^Qm6VnH+pqi$l*G<7x>v0W?Z^h-(7m
zey!uLAB
zGSvyfH&cYx&7#u*$9}#4j~`5*q7MUyJe$P5;CKCw!E14Rlmy?`!MQSuwZc}kt^m&2
zkH6oWMwbgLG2WCIs^wQT9HI=A8CtX#x&!`xy$q8WLB2^=HF(Q#izYuCIf)3=vzsUu
zGv=f=cNU|7K{&#e7QdB9$3uM*i*QPSz~cakjz4mJO&kOVG1NgdmngnYcI`mpLC!fB
z9wM%82sED|Zpp_3cA)yrZ1__iLiSXV=dCN!P2FTP0De?fJ~@5ts?4_4u&0y(c9pwC
zfIg@_nz{nm?ni_)Nw&fpBfHc04sc0Eg^f_?evr0yvI`UtBNw{rR3uYWE-|ic$ufJ0
z<|loG4KEBp*n#PrIh5)Zl-}`Q%i{vxfNexEBO6c-f(ck%$R{b}O0WR6C@!=BQLPR&
zv_UO(R^S`TufPNNA)@9G<_fNpuL&>1OVE_mA{dHZYj&xfAF5Tjq)cu)Adn4}-wgbE
zFW7jsrBW-2Q}yU=Ja=a@Iy39_pwy+L)OX@)L8ICjVm5U$L{Uz
z&8kQQCp86BZ^9Kqu8pB&b%QC{K}p{1b&hkh`A4fX>E65Y^}0a{(Bde2>`|PI4+^4g
z27Y6DhB+yRKxxY?0!dK|6bdb^zHl@P3a(%=Ir*(S&wiRiScpWIuh96oiChmgaffq<
z7b#nV?bH3%HU(kXh$bbMEs+Ll-pl!rjN7$M6pXkFK;~-gP$(dE?1eMJ@Jas8$g&5r
zqY6V*cpxiTxoi~RKE^4A=p{UHYtS%IMfft1O)QYSs_aIXP
zh)s1Od+pJb;kQ*#a4rlMEm|;(m}?-AvQWvLvjuU?ihM5d1t0a91ynw&ZVihiDN2U5
z09&K0A4Zp+MB}_8mGdBdw+CDz0cDQ}+k6fiU&O&j3|O62UPd>p1!Xgzj1IRiEwrm!
zUe15N=kdpFHH<=HG2ws5QsGi9i?0c??Y;6u0sRiJGD
zj8w_G=G>DhswkIg@`ek=wvYO$MJ$mYK<20#)1T~u-6MY}BhxJ`t2Y$7Go>O-s!8UG>
zK4Ra&m@TIImU8B(BB2F~_Q
z34EWn<4~XUl1nonArrHg(|cQ>Vh?^>)R{k7kONn4;alFr40TosAiqp_(~!!#^Sq@w
ztzsO0)u+a6+S>nLWn^(*{0MaHbd~!X|m)*;8PxF^ooe@7Vhu(lWx1g2S>|&(LkHc!
zC*Wh=Fyfw)=6ov)cz{N!SM5Ngm}s)8(l#J(d1n(5Jx@s3ziOo5z1*U<{Bs5dYEx5CWI3yC}z3y-tLPsLZ7GF=fO7
znqQTJ4RTktZa4{gTSK^17EE!J+bueJ=Rz~4yB+M+YXM@Nm}~qLBPcnM`lZ=o4jVN6
zrMa-nTu&fpa-nExdZ}0cB*z&)T1Wim?5Q42(bx>f)_NDVh;0+4B>`-PLgNA+L)mqo
zzI<(@-+j6*G;=$*Q*17Y%|MfuKB<`yQMr7f6OXgYKg8QZa}Lo(B{okjjCe{T@kZI%
zcYv}z_CGXUinEcCU7_JC>~rKKt)6?$?u#lYV{tK3Cj#GkuJ}Zew%Z6WKWul*Fvd(E
zyES{*AKgZRRB%<4-o+@x5MN`RF%(F8uDzd4rFBtBKPPu(2|A8@(pE5?!w43@g(e&Z;E1&WpHrL;`YfpX
z-WE6BI;cRAOdXc>3M4DRZ*u@Ua1_7&yRFvYbL4pXjI8Wyt$z=Ak3+)1=aiD|!k+4h
zMhYL=E81!bNoquSi6tIrBciG^d~1yHCtjg(1L$%wgCcsPlq_)rp01Oc&$!DQV8Px#
z1oRMj{9M_*^esDRIal9w^5aO-eIDw_yn!nCHNEacj$h$;ss5pEcjl3|-@v%nfZD+?c!p3%{tD=`(vk;PLVF
zv{&%Huc=48xw8bDQ@PTU%)7VQRy6kjrCO&S3iiRYFYcC$mms(7i>m@jEq6hAaOi!e
z3(yX8DD-}kUJKfbM9G
zx@J4^a4MaUN1t|x)Qka}``1(6ulVFE>0j%+`!RtVdL-laiFk{U6PCsmg)imzu{Slk
zW~Y5#PP$W5@fr+p!DKV9oOmMh?Ob8KoK|GyM_@@S3@0+DZuWOz13Z92FRdG
z_t_7te78(uW`~5T4m|{D?7rBIFHppIKaUqw+#mnA_-hU7@dM`Q&b#pgMvK6dMYlWS
z0T(S*F|!@*4u5AgN{aI;(VMp{dFvSiP%R
zGWO%}O#$=Vrf;;z@5-@v-KJ?dP_kJlht(R;RpqUitv=s2%m1sIqK|ok=NjYmt!;G8
z8)shJYKA@f{Yp&M^(q{kavUag73euSiab-={qJx;tk=Y7=&W*14V=a5S~Bl6vp!^^|-fLOnOZ(qJkh{KC-pLaUZ+kMAFai!PwoVUgF5T^JzC#0cOg$
zqQbo3Zo9MZvm|{?z%{Phtd~z9UWx}B(Qh1dS5id{i+dZoB_WlWaL2f0h4wRf%H0j$
zow`-Bqe092FpW3iStgLtyG`yCtPQU4?R4>`y>m(|e%tZ8{rFRza|aoAUR>pwEjCt4
z&(jfgaY=;P(kv^c*0VdEXtPh7iQ7iD$EVp!RDNELYWwq1fMG6QVq99`{UlzHSzt>W
zmmr-mgVub4=WK$6vTvYxj+9h??8EWS2YxA9eH=+Mub0NOl@BJ6dJtYBG+!jGT0{=E
zJioxmB)Two!E+VSaHW@RjDY_2%m^JvFT*P)Gta#)c*Y;dE~>Tj6R17lXyGT)i;+3y
z{#jkg*ssQN%$<0NKR%&&jHBAS3jRgH@I2PX;&|{DxAj@(^@)}2&pYQX7{)ASRBhw@
zf(h_yKB6C_f=pJ?syZpGm4&%t?@Q#`%d+{c>XeDJ5kyh^Tz_15>clGuJS>NKGZ
zbUSK=Pz&Kz2G!ymA%jCIjn|7QMbqtKN5-_@Hor-}l?+V^a3hLOUf?S?81(tZdPML1
zVL!g|HBPn$#QV4%{Aev~Bd*n0KCB7@uC4
zr@2!(bpKBLy?Q49StL>+;4rks&~@n;e=EN=PRxxyv!NNHPL?_Gi*|7XXkjV>ec{K>&B}`u|QdvVuxkoz$51K!H8N
zN%*e#hw@?8)Ap^5*)5iq8ni1qA$xu#mU2hm#F)osC@cd6Bn`gQzRxoS6>LBZ;=^Qfgb
z(~w@>h2$57h@aN~m>PT7PYafSM3CE#O@E&@BtC1s$ioqkY!~KAx6*xu{mKNED
z6l!%U^vbCmAM2M#@5Y9=UQ}#2XOWlZ`O>;7`-)r$r%W{W20Cm-FhEcM>g;%(ld;Js
z!rhxYl{X2S-(J#C4%uKuosrLd`$>J?h5{cy9`DKVfuyY^%(`h$Cbs|hYdmT&Q^G4E
zV>oOVPS>d+$a(K){oPY#`4$gHty|Axw|d31tKD#d>=DsgdgN16(o~uORZ^c%Nfyr9
zIFZqZBwu|q6ee#jAaN3=$r|-tkf)}%*8hOv0L`SMWY!i*E;mchUkVeo(phA!(}V^~
zr2oOrJILWPuD3$*k(}nBO}QO;2Qv8yYCs}%7pC%Zz@mVIi@rG_RUh?&5H}XF6(`ov
zrpF}x2)2Ks6wx|p8=|p5Bv;K_bSPg(JXAkV%Ws!Z+Y8M}A;L7N?u>lz;_Z)Hedka9(|Sp}za>_*zGx
z9l&(h?83C|p(m{Xbdn>0D?}V-tJ&4*2x@l;(Rm)
zI*?m^K&A@BsBBTdNHo}*Rv9Ao=fn6>o}rexX!0Eg_|~l>@d!aBNz9Qc6slyrJBAT(
zgQQ>0sKp4SpH63LwLJxl%mLvxau3)3%XAMJ_8`kHgtUBxDkCm~3(#0qMVTq=rOM0g6r!O_bTSEA
z^ut0;vNr;Hg3nzhdLCav#G(pbL_f}$y6#9}^|e)uW_DTT@eD4#f-2pPGY3d&t}JyR
zT_I@!fZXC*81);B|o2t*u1>9gg4@^t^2I
z<#IlCBxaOwLee(qF)NbB4FRC0eygNLe)(>Y!LQQ;#fTZ0Vw?bojhZBu803<5pje3H(DP9v{zS1(KNhuOK9u&Y6A>eTwy)|6*g+js2*I0k&Fgs#
zyTDLK5uag(ti~W{=-cXeOCat9%CHa-*4$q#NDMj^Ph|nYzuMw_JFV_G}?cC7UQq*LvchBDlaXLEJY&V#2(7mo~_=8HzV#1BBb}k)pi;n!z>c^
z{kE{kFmJX!hzIB6$BlY}QoyvG=OlGwHp?}$Y;ViBP(CmssQQ!E_G^o3ul8zISJV2O
z)sq(+dFwn2Bl2~2eZ0+B|h>#w{39t6gF2uXzdWH$pr-3r7?$mA@!Kjeg~
zapU<9cl~Fo$huXa9iTPG_lCmyugk|^N{Yp_FN&8Ob(2k;~0G`l3gN`xI6U9+YgKN-vQRke5*59
z9n>P~RO-u4Z@O(K0+~K!0lOd;Ip5n1y#U*h?g~!LsUg~L_&bHv!`_Hk+~d&iUB&C>
zmvac9D1d|<6Cb_NZ5PKsdkyu%4Szw50M&agRJ}(si80bU!j!_({|K;ZR00W7Pa%{x=sxr@P9W);q=e5$Gh_oT4Gxnq9ztD3)+ZpFjKW2Ob4q
z>iL=gk3ebpdt%VT>`anKyFXzGh^|Npc*?bRJIopYElk+x)zz@B`o(ycZ9DdRgr@KR
zj9`DHd`fsP*gOoE$cMLkjZevwWq8n@{gdF3^n>7V0)@y(N9M;`^B_akNj0!#zm~~`
z1mw1+K?Yqo5Q!g13z#liBrGX_FwUTVCVi*8@03r4U_&gOm%i_;g+d(NXZ?8^jAZ8t
zP0pGEK<6d`y1~g%WvR<^K7h`Lp*XO)(Lj4S@I|fRgCwBiS+xKq2nldERNEmwqm2&j
zwz6+yU3S@xqZ|r|3!S`^0Ih{96`k5R50Z1WH
z38nI|^Ey(jxsPH)pELz3aK~53--b%){qWEJ=N!lwq{?*HZ3aRy{*xv7lQN@%)PB;v{M2Nx7>aZ
zrY~P*$YfXxG_Yadp&&MX&+gJcSP{M~OP!2GrIK|d8eE#^g2f_la*UsCz^p=YIpbq<
zUt}w9S^%7<{i?V9OuUs(#(d1ZrGH3OX`6pfEyqhYpf*hSXDeIPdDp^~e1GgMD*$x3
ziVfR}-}sV;Eaugi{uk7v2+m8*>kSJ#&U)~YQ6vuwprOy`vDNZ-{q}K``W#U?1=sIG
z(kRU^=vZAagAD_shV5`i^#e7lQV6`>1_4j4)a9twJ=L&sofb+4FrbRAqZ@dp_!I^4Th+MhW|-_T1}So*=vHUY(y
zO_0>nlArX|WMeOB5#16od#u711S%_!AGnOxMuc4Abs|{i(H0;h|15tj1H5uy~BW5g|ZYtPc9yszCDw}V6pHBD5LmI
zw_#T1@y&F`9ZxkB7X{3_KQ%
zd5hI9vX1c+HK#KM75DhZW)QfFCKf7C%ADENYOoa~0h)iNA2$>fW=bLsWY;8!O6Ae}
zqIxJ)Vh-fiIW?iS{$yJK6ofjfctmkXUwqn9r>3zMZV_ZyERvJ|(`oI`DiAp8@UA&l
zE%D#fDg064GhW`UFP=VkywgXf%LZNzHTB5)b(D0uJW7BVoZJ3XoWeIoQCL>ir
z(Q*@}2lFJ$3X_}QT$S0$j^o`$uGWWf2K(XtZaUoQrLeiUU_j-~8|34HS5VRKVaFxC
z*i^&1yaIu%{w8=c-5aGO1bqYVN8hkBjGQ|n6AcqI>9-hA+B~7~es3g>*-?1DbYK;9
z^bI+3^pDs2tuUEc`?l$(KUeGfJ9wcHpC_Ej2R*Z^orCvVKS)zScBTDYtUtHM-^Kdf
zWB+@y{>bkCo~+;T@NXFWeR=(#ac61c2{RLY2>>t)J8NE<&MjK7y6Mo_UEE+XDqr{u
zd-?UlGaavuiBsEtXhP15_c_V}JR5;)gwem|=Gbl}KMfX-p7z>#vPNyekE$FDuTq
zYU)}AA!B8GWO)i@Of2$?A=p?JNH9*58)HPjUpMd0rTx(D>lx1uq<2IZBN4O+NK{^~
z-+@f0Am>q$=m}J>MV^vK%W4nK)A69p;3Lgk08n@)9C^U4p)m1Gn0v+NRv!Cl_z*#8
zcsY1%+0?r=gbEs;26|g9a#QG=Td{IYZ0H`AC;HIwp=f`$DlGh}S*G96IA|v0kVpWP
z9nZljWHNFRYCu3SCE}Dtn_?@c;lEWxbuph}))mk)cTnZsaX^`1pl*uD(ZE~k@yaxJ+XAMqK0^HkGda;3>q
z`P+eK;@@+zr?K0!#-`CI2;2V8%9XK;Q81~P1NZ%GN79#yxE?G2RD+=13n3w{Fz8p`pmKP6>_$Bnc}9wrd}A?xb_3+eL^vWU-_r?T4I5s
z6?m@^Cdu>DYT?yk2;@-gsv&x3noD18Oy*b=ZH!)=7b3OxFuU5kfd`ZFg}LxYWxSa`o^|B^JQ`<+_M1TD}K;eWQ;wPVfym%Oyz-`sz&FsSj
z9?x&tW6qO)xFq-1#uuQWrq3=)S}07PG>__9&f|czzK+JUO?XG0It95KR}|#NSKQW>qJ+E=4Zk&-igTwlrtu7nX-pd5H04a;
zw9&(9%N@xg_u+~zgBW?H?e&fT@`H#&CtxZfnEV82!(Yg}!5&
z4}0^vVA||Ej(NP)-t1iYE7$E*_c4k;K-Dj2vWo9RbolVZD6gh&)K&*uXXNW~C^FVCJ?u(1}=4
zSweh6YLUew4b)5f@5rr!!OH0Ou&^DAze!H>j$+$4?ctPP7Xy%Q^S=cygE@!LI
zu+#8I<2Gz=q;QK8>DAh@#Uy#jwCgl~m*=X?|8{wD?+jhMc(DushH}6y7B8m_64D4Q
zn$w<+gHBj!$y@E@iNyK!Uk{Y%G(AteMg*&xeaO=x?{bd<2#sIAz6^BH0}>JvBj-Uw
zY3Bk4%;i7_(u96(NCtFg$6<6=Fo>x$l69w#Yc-EJPHY-p@kh}9o(#w&tO|5;f42bd
z9tixH1Xc4m8_3GaPF5BH3-;3yMCduNf4>@PN$2$?vTb5LsFoP;UNcVL0Uo=nu_yUc
zx7U0nITFmY02Ggb!$|?fm2L6y@nz5+D+9#gVpOA_|J{H7*;;t=*b$Ay5fH)}v>O&)
z$txUj!n&+I+j;%{`}ezt&BXqb`)T`L_4MSEx9G`j1-4rm+eg}U!ZPTu(7dTn(kcha
zhvBW;x68qXug_mC$WDyGsb0V&Y7TInL903V-mfTr@2gI2d^@KGu)~Q-mB=1>B9&cN
zKPYFGAID;osr4wL06r2+KxSacV%6KzABO-P@aowBHcorXrSEY5Xj-If868Q}#9v5X
zrNh|~;pF2x00NFg0V!M9UKxOYxwy3haWBqQtIaQWU~V|ErK7{hy?w-SvUu@l&-!=!
z<4f|@ackNdPY}ZQfYDwL(5(1?Pg8pBaMI<}S<@k)NA)fM7*d$TX49IV{r!=RktMY<
z(ROIhaHgfw%)uC$U{Gua1NUVp-tCN5Pznqwk&==cnKr2m=RRZW1fyX;R!w7Dao3&y
zON&K2yjpxky9?oXx1q<(1#yP~jcv@#JV5N_H#Ro5b4!7(>+A2|5O7>xz6^x(r;xx1
z?Ulr&51Mg?XL`58zV=9Me$h_sRq3PvMykNQGka$N3=SqG2S6OFMjGbkros5+S=&h`
z@KXxh$RZjDBRfNY!ucfpkW0pg4<7=df0_w?TU#fjF1En2ROyCenX>ie*QomqDNWb3
z)Qm=oG)Ij#{h<$+(Sj?-*E98ZTVgtdi{--e=m!_*X#0R@9$;t|Mq3^<>rTT|5EwUF)=Zj
zcIWRicUTp_ct)YO*U;&jOuG5hwFQTF9;TP4pPF_i7=>sY=wJIfQS%$$Ra3`@%EU%=t7ADRJsv2eTAK(1J&0lY@H%QQ_d?=*6I5HYw}N1n$EpNb~DlXEzy
zjLIWK`=0@)$pPEjP+bE5;0$uG=J&NBQ%C*dCAA7Sk-9lHsO|ifD>ziE3_*?0D(!)T
zNku|&gux)B$It`wuQ=5{3cwH_07EH9F4+_r$maX_InU
zBSgS3wd$o=UHod3)JVIYrq%mWJTMr{)B3^OZ$0aj_-vfqa`igc_za7B1XPVOzKtx6
zuWBinmUha5Y1KtaUJK=)+J{NouVc-Mp4N@*p3`q1J$f`t2POfAmlDCuIcT6tp>00u
zcF;%reaq{pR|D&lE!DH~Eo^$4L~Yvi(&h&0lQuLM9(Drx51(_}R`QMAN{2o-8XN8A
zUJR3{_8pvp02L09+(%i4`iymn}H*4(Tp&KuWq(1TKEx
zfB*lx>)yN9I{WPNzR&aKUVEJ#rKO=rfJ=i5000P-mB2a=Z{3GS6C3kkPA|D$0RV8z
z?d9aOl;z}@v|ORK_Kpw$Kq)FU4NFhgn5O^G7ucpn66r1r4RJ?R`dolL*{Pru6hgHt@JE#x4K)nPf`>ssvEvw@dhh^5Q+
z4DwlpB+WxP@fCKn))XP6}7+K12DYAxd`AP7T12J3N9?+@E(30b*N01f||`C9i2
zfO>qxFbDkZ_VS)4y0u4*2cX3{h|{X(EH=n7?zkD$Qe)EQ_7M$FQ0b%D|WE#YJ
zEb5bK${}i**;2X*4)ZDC#t4%6;nMRJkf=B=#-EiHyQ9U)X^QKE$~<_g?YVIxDv@%k
zm7A4|@O!tbC8Tl1k+a_Z>hXYpXtoWt<{{)MHZnv_o5pVA-iPj9d~%A7-(jmz`A5uc
z_qaBpWL@+0Mlc`6V{YvCmMGBIcVwsRcS-!iBWKZBmJI#kE^paCCNc02KN^$b8n99v
zuJ-oHP&3b{XHqK38%Tp$m1th!bKv+b@MjMtMCSf*d_EmQJ*q}Pl%2E2UJ=7?S(}^O
zgQ%4(u^YYU+Ze7&?M*n!+hi5oBC~YKD_6$P-ncw
z==fGw1f`%(tf2N3rGN?BsEAS3f@u7^E&Ha8y3j7%?28V!(xx4+ye%2
z94Oh`NCx#p2B!@5Sw2>5u;^lrqzmRj2Nrq|F)@l&r%nfkUm{_T1;zl{uFNA&6w?ku
zEu4#x+k8SglztgJ5rWZB)fJj846hDWCXCP(aw-hQ4iWU{-jTQy%=${Sd_luZ4v`p5
zvQk>aWSG6O$69=BVQg9qUl^VS59X`9V$>tL#mxyBl{3tj+CrHoB9Ma?070m_7VJi(
zLSa8Ux#!Uc!&q0?UHGz5es+Z)J#Iv;3MT3vIr6!p@xw~%`n-?Az1=blj^jw!;y|kqd(rqD};Df$^D7BDtcnqOc;JdT4u|uZk!q*??V{xpK6O0P8SK3tLfJ3$Lox0SLsL_!QmZ`?GsQX@3fgHi`Z$if)c>Q7KfZQAr-8PX(5%=`+sg%~X~@E7zO`y)Jo;
zH)Bw?uia86R9IDf@M%;ZXdqp3r-e2Pn!%nj`cPwDWNNLZt2(8rTim328nPKlAvg4b
zOWvVn*0|Ersky$QUdFfOLUcb}4N`)|A7|XTXA{5kYU^rO$^BycY%6w`W?Ny0VoPXS
zYJzpU=Iq^B{jSGW+>XO8*6z=3;Vo$aCYoyeD@<{MW_&3c8fpbvXOJVWpJlOCkI7dIX0C?DGc3ht@2rZw$DAqO=KihTWE}7L~aB(Zi5TK
zH%$zUm+K1_uNFVS?cqMw4z^jZTKX>#^xt{rokL$ld>8h`@~!bNx~&dH$hFGByCu^|
zxKi{7oA)9;&fLv*y%&$`lG}9Crg%%Gb4GG>bBILSGoS*}u)E-EG@fQ2x^#aY9m5ib
z*4?ox9btOmc+wJ;
z-$o(@Z+Pw4Mc>}QO=AH?}F?b1gwk28Z)WClFY
zIN-_^hl)c*CfIAZVVqytKXPx&*Q%b>uUjH$+q0!vj!5)yk;PY~d+OI2H1FPkJXoHI
zRX)i{WXKCpQ6eqD6;F3~HfD_E;3FlEDyG(;7Uxsw4PIST<8)KDbx0$5?b^)V_l}Y6
zcA;uPe<9BRTq%-Ul)*Z@{nEbKb#1V~YI<*7j@tZBE4RP4&Yi+D!>_~9q_1wrwb%^Vc$ynJeY%m1ywbP<
zdke4XU~_$ky{)Si>}l*9?B=RX9}EL)e|=mnjZ#<6dL#4=imbzEkZ;^LFleasfJ8%@
zAZXu08U&$s&Oqc{Kz}X0;h@vd(L%oiV@j^fAliQ7ddmeom-7e=Jv=ho>&v_;x
z4&%98GHNOFU-vt?4vvS=C-C%`HGXfZuKQ`V(mRyy2Yj)0vL)uVuyL}@rD3S?0`kJC
z$u_XE>08y!x<|_{hwq+mCRAkU)xO7`({9$X*G0*mjne
z;VSn`>hLZG%bo}+F&rRr$9d0t0XrrQ=h)B`%$@!1eBzrt{qjx8a!dP-@l~B7+ETD#
zpv~Q}NA;2DxzBath1MsMp|jOX(1e=Tht@cgthzYt;%>px;33)5c^cLzxpBXun%
zIjAdyNsvc?2gD+U%f!Sa;c8^7yaQ&lI4}VyNehQ=;h_bozhwWy
zO91~=>K~Q+yDfi7ANnGND*^m>kEL)2us-8F++$Rf!O!))QTB5TBkA?2`t6c4kTJ@R
z775XavN8*G7OEZ7lBm9XD>?btp6E9AzG-#g
zsJpGAoD(>~BeSiMPZPnUqIKeN!P;|St_|V10)*r9Cf1MpGd{p0?8~auYHHR|N6X}Wj
zB}g{=KXLlbzL|&9>eb+Uj$E!Exw%*l#6#ni1>}J&g1k;Tf{{;N1C||MKh0Q<*?qa(
zy5Q?SL;(#K`OGc51UUQD8S3wn)m!%=G|IzQlkRG|FAmAE+GjiU3bq$6_tu-T4EFMI
zD(2(rwp#n-%P)(-)q#VOyUdP-)oJSPw>~$@b7{{%1YMVcy=R*}kP(v+`b9~rqoxY6
zN27EC1J~2pAx)}Nz6RMM&~8kqYVUW$*qLnYqE;B8{4#Y0*9Kw<;aPbJ!)W4-$B6j4
zIz}ftnY9_IniJHdH0x8})7-YYM1{3OjY_H&)2tibi9TT3o3tS+1|x2~{Vfu8+d5Hn
zyOKYVix+%d>(|%PlT<0I_$1l{^EI#N=g(4>t-
z?4@}I&QvAOYp6PNgk0B)oX}$3@N0LRfh~TP&c_*nUbwQGnwH3;R*YA21l`!@LY!dq!mOy6*LTsX*3dDa)XOf
z7At|C2Ud3DfVM`uBYY`|=ywt{m72k%U1F=A+FyCKgBX~rANHjTISo%#Z%ZulW$Lso
z=4mp?1q?qi=u3J~3%KK@jvW4H6btE@MkVwnu*yroB|vb{GMYI1@LigH)m{rBwmZ#N
zR7enxFsc=qy1_XH!KzeWL^8!kcnsc(Ne6}zU{qzx$o*L5eEZ!%CdyXLt+q}M+29vl
zHjl|@^3l`Ot)U7%KnMEU%@u(l!JQ6o$~}KYNEdF^rMFz+q^BlT6Y%Px>{v=x5J9>h(Nb)Wn8
zQ}oTXa-7Vp)orisf)&OTY>lKyM%H*q1JYPs4DIfYj|dfFG{2HrHQ94+25H1lA~OhT
zD5IISz>d*Wglzc1LjT0Vc?$NvOhiOT{$scex6+F_d4
zWT>Z;fp^DJ=~PYmoW$4o<9@Zh$z$SDmG^jah1T}T`kaXo4skbdy^b_Xt@rDAYkeNP
zk<6g6UpLUhpZHBJzoJPs3Om#qzqga2Pa^`MQ55;82lj%yQ1b+FbIzG_8Ju#5VE4_a
zw6icXR`ZYjBjv$kYaLN&i+4+RJa3~H^FOl-j$zYbdw`7Ntlu%Oy`d)Sd5ZqnW4&qs
zlXc$ih=%D`&@o=J~M3(#lLsdL?yMfP=){o
zSDkhIMpykf%#Ldr6>x*Z6qV^tsiB
z0J03ZpO3oEDxw#ACoPY~yc4-iMor_VDQBjLL7f=OWmEO7KOeW|bCX1%R&TARlN}|m
zUH;v#@F6C5i^P>Kx0J!c=LiO}(p3(g6dv$zW)Wa?qe**L8~kP`Z~KjC#de0ei#jvN
zxWinVA9%G8%109EL&AK}chcp9pdnUt#W&HI(xm669bl@4Gs;`NLTs+T65n&DA~~hi
zM?HOeW=!1!w3k(k_aR}3Y(SwL9g)=@pXnT%d_E|t`k}ecgoF~+4N>n&DYA%Ee;)&d
z`LD6YbBnv98>Pz-k~ffQERvy;3R~H}CGct?rTpnq$tV@MXjS&I|8wKM&SJ>TYy)`{_?uQVRjdOPKx!uoyqGQD;SP#+K^_u1T+k!&@p
zG_0fICRL+BnY>E7S&O;tDbs?^G=x&wcyo`#<2wUj?NzC)hl@Y6pD~5r$S{N6<7*6xgmR`+uM#UVzz;b+U(NmPWW%F;>M%J97}sa&+w92erc>?NgK
z&h-*%6%x{}Cblq%icv=!GZG?a
zLH{%Em+#0EREELPqA!TunlVYuiE`$Ww~3u9z$jlcyHMPmKImfD+GQ4S0GIcdd|G7b
zdPBaNqIvsvIPZXiT6?c?GI~OkDbpR2+p@y~f1>+NQb+9-a|Duhu6JI1Us^bJ>rVA-
z(<38gdpLuuh`mlSvyd8wPyI7`Qdg3rNjxNli`SV=>0f;khUP05>4CO`sHTyO8oOU+
zs+Nni8h7tro#FBae>JpoXlIQZDT>%y$a~54ahRsi7Be~agd1fsE7DNi%%H+^wDw@w
zVsc?S`ZI7eU%VFI?A%w08VTI|il&w8dwXvF8F24?YgMTR4mj0Qv^hMqF@`#Wa5fod
zO$`VQVi%*s3Vf7ytxZ{g8<@!`^Jt7l6*Oxp1;$(3#iBd3gSnvh+mNz%5
zn`Kr?rk#EeHwkvF|~N_@%9n`87eL&)24^ms-5bEG5153Ib;v6Q9+SA7uO
zsSW|W1-6_))}hvyt+5RqCoF#D@lW!dJX2=fK?G%VK1F~Tht{jyQk%fkfVc{h`gXg#
zL#`u2oh?N~kXN0ezRCP$x(~9_Lg85~F8-Y==AHQ4bFtF+oN~+DRme?PG(qh>DLRXp
k5qmjZhCV9Cq1heQhr^_O>+l-dKeq{Gc@1!ttVPIw0Z+glQ2+n{

diff --git a/priv/zstd/doc/zstd_compression_format.md b/priv/zstd/doc/zstd_compression_format.md
deleted file mode 100644
index 86a7ace..0000000
--- a/priv/zstd/doc/zstd_compression_format.md
+++ /dev/null
@@ -1,1535 +0,0 @@
-Zstandard Compression Format
-============================
-
-### Notices
-
-Copyright (c) 2016-present Yann Collet, Facebook, Inc.
-
-Permission is granted to copy and distribute this document
-for any purpose and without charge,
-including translations into other languages
-and incorporation into compilations,
-provided that the copyright notice and this notice are preserved,
-and that any substantive changes or deletions from the original
-are clearly marked.
-Distribution of this document is unlimited.
-
-### Version
-
-0.2.6 (19/08/17)
-
-
-Introduction
-------------
-
-The purpose of this document is to define a lossless compressed data format,
-that is independent of CPU type, operating system,
-file system and character set, suitable for
-file compression, pipe and streaming compression,
-using the [Zstandard algorithm](http://www.zstandard.org).
-
-The data can be produced or consumed,
-even for an arbitrarily long sequentially presented input data stream,
-using only an a priori bounded amount of intermediate storage,
-and hence can be used in data communications.
-The format uses the Zstandard compression method,
-and optional [xxHash-64 checksum method](http://www.xxhash.org),
-for detection of data corruption.
-
-The data format defined by this specification
-does not attempt to allow random access to compressed data.
-
-This specification is intended for use by implementers of software
-to compress data into Zstandard format and/or decompress data from Zstandard format.
-The text of the specification assumes a basic background in programming
-at the level of bits and other primitive data representations.
-
-Unless otherwise indicated below,
-a compliant compressor must produce data sets
-that conform to the specifications presented here.
-It doesn’t need to support all options though.
-
-A compliant decompressor must be able to decompress
-at least one working set of parameters
-that conforms to the specifications presented here.
-It may also ignore informative fields, such as checksum.
-Whenever it does not support a parameter defined in the compressed stream,
-it must produce a non-ambiguous error code and associated error message
-explaining which parameter is unsupported.
-
-### Overall conventions
-In this document:
-- square brackets i.e. `[` and `]` are used to indicate optional fields or parameters.
-- the naming convention for identifiers is `Mixed_Case_With_Underscores`
-
-### Definitions
-Content compressed by Zstandard is transformed into a Zstandard __frame__.
-Multiple frames can be appended into a single file or stream.
-A frame is completely independent, has a defined beginning and end,
-and a set of parameters which tells the decoder how to decompress it.
-
-A frame encapsulates one or multiple __blocks__.
-Each block can be compressed or not,
-and has a guaranteed maximum content size, which depends on frame parameters.
-Unlike frames, each block depends on previous blocks for proper decoding.
-However, each block can be decompressed without waiting for its successor,
-allowing streaming operations.
-
-Overview
----------
-- [Frames](#frames)
-  - [Zstandard frames](#zstandard-frames)
-    - [Blocks](#blocks)
-      - [Literals Section](#literals-section)
-      - [Sequences Section](#sequences-section)
-      - [Sequence Execution](#sequence-execution)
-  - [Skippable frames](#skippable-frames)
-- [Entropy Encoding](#entropy-encoding)
-  - [FSE](#fse)
-  - [Huffman Coding](#huffman-coding)
-- [Dictionary Format](#dictionary-format)
-
-Frames
-------
-Zstandard compressed data is made of one or more __frames__.
-Each frame is independent and can be decompressed indepedently of other frames.
-The decompressed content of multiple concatenated frames is the concatenation of
-each frame decompressed content.
-
-There are two frame formats defined by Zstandard:
-  Zstandard frames and Skippable frames.
-Zstandard frames contain compressed data, while
-skippable frames contain no data and can be used for metadata.
-
-## Zstandard frames
-The structure of a single Zstandard frame is following:
-
-| `Magic_Number` | `Frame_Header` |`Data_Block`| [More data blocks] | [`Content_Checksum`] |
-|:--------------:|:--------------:|:----------:| ------------------ |:--------------------:|
-|  4 bytes       |  2-14 bytes    |  n bytes   |                    |     0-4 bytes        |
-
-__`Magic_Number`__
-
-4 Bytes, __little-endian__ format.
-Value : 0xFD2FB528
-
-__`Frame_Header`__
-
-2 to 14 Bytes, detailed in [`Frame_Header`](#frame_header).
-
-__`Data_Block`__
-
-Detailed in [`Blocks`](#blocks).
-That’s where compressed data is stored.
-
-__`Content_Checksum`__
-
-An optional 32-bit checksum, only present if `Content_Checksum_flag` is set.
-The content checksum is the result
-of [xxh64() hash function](http://www.xxhash.org)
-digesting the original (decoded) data as input, and a seed of zero.
-The low 4 bytes of the checksum are stored in __little-endian__ format.
-
-### `Frame_Header`
-
-The `Frame_Header` has a variable size, with a minimum of 2 bytes,
-and up to 14 bytes depending on optional parameters.
-The structure of `Frame_Header` is following:
-
-| `Frame_Header_Descriptor` | [`Window_Descriptor`] | [`Dictionary_ID`] | [`Frame_Content_Size`] |
-| ------------------------- | --------------------- | ----------------- | ---------------------- |
-| 1 byte                    | 0-1 byte              | 0-4 bytes         | 0-8 bytes              |
-
-#### `Frame_Header_Descriptor`
-
-The first header's byte is called the `Frame_Header_Descriptor`.
-It describes which other fields are present.
-Decoding this byte is enough to tell the size of `Frame_Header`.
-
-| Bit number | Field name                |
-| ---------- | ----------                |
-| 7-6        | `Frame_Content_Size_flag` |
-| 5          | `Single_Segment_flag`     |
-| 4          | `Unused_bit`              |
-| 3          | `Reserved_bit`            |
-| 2          | `Content_Checksum_flag`   |
-| 1-0        | `Dictionary_ID_flag`      |
-
-In this table, bit 7 is the highest bit, while bit 0 is the lowest one.
-
-__`Frame_Content_Size_flag`__
-
-This is a 2-bits flag (`= Frame_Header_Descriptor >> 6`),
-specifying if `Frame_Content_Size` (the decompressed data size)
-is provided within the header.
-`Flag_Value` provides `FCS_Field_Size`,
-which is the number of bytes used by `Frame_Content_Size`
-according to the following table:
-
-|  `Flag_Value`  |    0   |  1  |  2  |  3  |
-| -------------- | ------ | --- | --- | --- |
-|`FCS_Field_Size`| 0 or 1 |  2  |  4  |  8  |
-
-When `Flag_Value` is `0`, `FCS_Field_Size` depends on `Single_Segment_flag` :
-if `Single_Segment_flag` is set, `Field_Size` is 1.
-Otherwise, `Field_Size` is 0 : `Frame_Content_Size` is not provided.
-
-__`Single_Segment_flag`__
-
-If this flag is set,
-data must be regenerated within a single continuous memory segment.
-
-In this case, `Window_Descriptor` byte is skipped,
-but `Frame_Content_Size` is necessarily present.
-As a consequence, the decoder must allocate a memory segment
-of size equal or larger than `Frame_Content_Size`.
-
-In order to preserve the decoder from unreasonable memory requirements,
-a decoder is allowed to reject a compressed frame
-which requests a memory size beyond decoder's authorized range.
-
-For broader compatibility, decoders are recommended to support
-memory sizes of at least 8 MB.
-This is only a recommendation,
-each decoder is free to support higher or lower limits,
-depending on local limitations.
-
-__`Unused_bit`__
-
-The value of this bit should be set to zero.
-A decoder compliant with this specification version shall not interpret it.
-It might be used in a future version,
-to signal a property which is not mandatory to properly decode the frame.
-
-__`Reserved_bit`__
-
-This bit is reserved for some future feature.
-Its value _must be zero_.
-A decoder compliant with this specification version must ensure it is not set.
-This bit may be used in a future revision,
-to signal a feature that must be interpreted to decode the frame correctly.
-
-__`Content_Checksum_flag`__
-
-If this flag is set, a 32-bits `Content_Checksum` will be present at frame's end.
-See `Content_Checksum` paragraph.
-
-__`Dictionary_ID_flag`__
-
-This is a 2-bits flag (`= FHD & 3`),
-telling if a dictionary ID is provided within the header.
-It also specifies the size of this field as `Field_Size`.
-
-|`Flag_Value`|  0  |  1  |  2  |  3  |
-| ---------- | --- | --- | --- | --- |
-|`Field_Size`|  0  |  1  |  2  |  4  |
-
-#### `Window_Descriptor`
-
-Provides guarantees on minimum memory buffer required to decompress a frame.
-This information is important for decoders to allocate enough memory.
-
-The `Window_Descriptor` byte is optional.
-When `Single_Segment_flag` is set, `Window_Descriptor` is not present.
-In this case, `Window_Size` is `Frame_Content_Size`,
-which can be any value from 0 to 2^64-1 bytes (16 ExaBytes).
-
-| Bit numbers |     7-3    |     2-0    |
-| ----------- | ---------- | ---------- |
-| Field name  | `Exponent` | `Mantissa` |
-
-The minimum memory buffer size is called `Window_Size`.
-It is described by the following formulas :
-```
-windowLog = 10 + Exponent;
-windowBase = 1 << windowLog;
-windowAdd = (windowBase / 8) * Mantissa;
-Window_Size = windowBase + windowAdd;
-```
-The minimum `Window_Size` is 1 KB.
-The maximum `Window_Size` is `(1<<41) + 7*(1<<38)` bytes, which is 3.75 TB.
-
-To properly decode compressed data,
-a decoder will need to allocate a buffer of at least `Window_Size` bytes.
-
-In order to preserve decoder from unreasonable memory requirements,
-a decoder is allowed to reject a compressed frame
-which requests a memory size beyond decoder's authorized range.
-
-For improved interoperability,
-decoders are recommended to be compatible with `Window_Size >= 8 MB`,
-and encoders are recommended to not request more than 8 MB.
-It's merely a recommendation though,
-decoders are free to support larger or lower limits,
-depending on local limitations.
-
-#### `Dictionary_ID`
-
-This is a variable size field, which contains
-the ID of the dictionary required to properly decode the frame.
-`Dictionary_ID` field is optional. When it's not present,
-it's up to the decoder to make sure it uses the correct dictionary.
-
-Field size depends on `Dictionary_ID_flag`.
-1 byte can represent an ID 0-255.
-2 bytes can represent an ID 0-65535.
-4 bytes can represent an ID 0-4294967295.
-Format is __little-endian__.
-
-It's allowed to represent a small ID (for example `13`)
-with a large 4-bytes dictionary ID, even if it is less efficient.
-
-_Reserved ranges :_
-If the frame is going to be distributed in a private environment,
-any dictionary ID can be used.
-However, for public distribution of compressed frames using a dictionary,
-the following ranges are reserved and shall not be used :
-- low range  : `<= 32767`
-- high range : `>= (1 << 31)`
-
-#### `Frame_Content_Size`
-
-This is the original (uncompressed) size. This information is optional.
-`Frame_Content_Size` uses a variable number of bytes, provided by `FCS_Field_Size`.
-`FCS_Field_Size` is provided by the value of `Frame_Content_Size_flag`.
-`FCS_Field_Size` can be equal to 0 (not present), 1, 2, 4 or 8 bytes.
-
-| `FCS_Field_Size` |    Range   |
-| ---------------- | ---------- |
-|        0         |   unknown  |
-|        1         |   0 - 255  |
-|        2         | 256 - 65791|
-|        4         | 0 - 2^32-1 |
-|        8         | 0 - 2^64-1 |
-
-`Frame_Content_Size` format is __little-endian__.
-When `FCS_Field_Size` is 1, 4 or 8 bytes, the value is read directly.
-When `FCS_Field_Size` is 2, _the offset of 256 is added_.
-It's allowed to represent a small size (for example `18`) using any compatible variant.
-
-
-Blocks
--------
-
-After `Magic_Number` and `Frame_Header`, there are some number of blocks.
-Each frame must have at least one block,
-but there is no upper limit on the number of blocks per frame.
-
-The structure of a block is as follows:
-
-| `Block_Header` | `Block_Content` |
-|:--------------:|:---------------:|
-|    3 bytes     |     n bytes     |
-
-`Block_Header` uses 3 bytes, written using __little-endian__ convention.
-It contains 3 fields :
-
-| `Last_Block` | `Block_Type` | `Block_Size` |
-|:------------:|:------------:|:------------:|
-|    bit 0     |  bits 1-2    |  bits 3-23   |
-
-__`Last_Block`__
-
-The lowest bit signals if this block is the last one.
-The frame will end after this last block.
-It may be followed by an optional `Content_Checksum`
-(see [Zstandard Frames](#zstandard-frames)).
-
-__`Block_Type`__
-
-The next 2 bits represent the `Block_Type`.
-There are 4 block types :
-
-|    Value     |      0      |      1      |         2          |     3     |
-| ------------ | ----------- | ----------- | ------------------ | --------- |
-| `Block_Type` | `Raw_Block` | `RLE_Block` | `Compressed_Block` | `Reserved`|
-
-- `Raw_Block` - this is an uncompressed block.
-  `Block_Content` contains `Block_Size` bytes.
-
-- `RLE_Block` - this is a single byte, repeated `Block_Size` times.
-  `Block_Content` consists of a single byte.
-  On the decompression side, this byte must be repeated `Block_Size` times.
-
-- `Compressed_Block` - this is a [Zstandard compressed block](#compressed-blocks),
-  explained later on.
-  `Block_Size` is the length of `Block_Content`, the compressed data.
-  The decompressed size is not known,
-  but its maximum possible value is guaranteed (see below)
-
-- `Reserved` - this is not a block.
-  This value cannot be used with current version of this specification.
-
-__`Block_Size`__
-
-The upper 21 bits of `Block_Header` represent the `Block_Size`.
-
-Block sizes must respect a few rules :
-- For `Compressed_Block`, `Block_Size` is always strictly less than decompressed size.
-- Block decompressed size is always <= `Window_Size`
-- Block decompressed size is always <= 128 KB.
-
-A block can contain any number of bytes (even empty),
-up to `Block_Maximum_Decompressed_Size`, which is the smallest of :
-- `Window_Size`
-- 128 KB
-
-
-Compressed Blocks
------------------
-To decompress a compressed block, the compressed size must be provided
-from `Block_Size` field within `Block_Header`.
-
-A compressed block consists of 2 sections :
-- [Literals Section](#literals-section)
-- [Sequences Section](#sequences-section)
-
-The results of the two sections are then combined to produce the decompressed
-data in [Sequence Execution](#sequence-execution)
-
-#### Prerequisites
-To decode a compressed block, the following elements are necessary :
-- Previous decoded data, up to a distance of `Window_Size`,
-  or all previously decoded data when `Single_Segment_flag` is set.
-- List of "recent offsets" from previous `Compressed_Block`.
-- Decoding tables of previous `Compressed_Block` for each symbol type
-  (literals, literals lengths, match lengths, offsets).
-
-Literals Section
-----------------
-All literals are regrouped in the first part of the block.
-They can be decoded first, and then copied during [Sequence Execution],
-or they can be decoded on the flow during [Sequence Execution].
-
-Literals can be stored uncompressed or compressed using Huffman prefix codes.
-When compressed, an optional tree description can be present,
-followed by 1 or 4 streams.
-
-| `Literals_Section_Header` | [`Huffman_Tree_Description`] | Stream1 | [Stream2] | [Stream3] | [Stream4] |
-| ------------------------- | ---------------------------- | ------- | --------- | --------- | --------- |
-
-
-#### `Literals_Section_Header`
-
-Header is in charge of describing how literals are packed.
-It's a byte-aligned variable-size bitfield, ranging from 1 to 5 bytes,
-using __little-endian__ convention.
-
-| `Literals_Block_Type` | `Size_Format` | `Regenerated_Size` | [`Compressed_Size`] |
-| --------------------- | ------------- | ------------------ | ------------------- |
-|       2 bits          |  1 - 2 bits   |    5 - 20 bits     |     0 - 18 bits     |
-
-In this representation, bits on the left are the lowest bits.
-
-__`Literals_Block_Type`__
-
-This field uses 2 lowest bits of first byte, describing 4 different block types :
-
-| `Literals_Block_Type`       | Value |
-| --------------------------- | ----- |
-| `Raw_Literals_Block`        |   0   |
-| `RLE_Literals_Block`        |   1   |
-| `Compressed_Literals_Block` |   2   |
-| `Treeless_Literals_Block`   |   3   |
-
-- `Raw_Literals_Block` - Literals are stored uncompressed.
-- `RLE_Literals_Block` - Literals consist of a single byte value
-        repeated `Regenerated_Size` times.
-- `Compressed_Literals_Block` - This is a standard Huffman-compressed block,
-        starting with a Huffman tree description.
-        See details below.
-- `Treeless_Literals_Block` - This is a Huffman-compressed block,
-        using Huffman tree _from previous Huffman-compressed literals block_.
-        `Huffman_Tree_Description` will be skipped.
-        Note: If this mode is triggered without any previous Huffman-table in the frame
-        (or [dictionary](#dictionary-format)), this should be treated as data corruption.
-
-__`Size_Format`__
-
-`Size_Format` is divided into 2 families :
-
-- For `Raw_Literals_Block` and `RLE_Literals_Block`,
-  it's only necessary to decode `Regenerated_Size`.
-  There is no `Compressed_Size` field.
-- For `Compressed_Block` and `Treeless_Literals_Block`,
-  it's required to decode both `Compressed_Size`
-  and `Regenerated_Size` (the decompressed size).
-  It's also necessary to decode the number of streams (1 or 4).
-
-For values spanning several bytes, convention is __little-endian__.
-
-__`Size_Format` for `Raw_Literals_Block` and `RLE_Literals_Block`__ :
-
-- Value ?0 : `Size_Format` uses 1 bit.
-               `Regenerated_Size` uses 5 bits (0-31).
-               `Literals_Section_Header` has 1 byte.
-               `Regenerated_Size = Header[0]>>3`
-- Value 01 : `Size_Format` uses 2 bits.
-               `Regenerated_Size` uses 12 bits (0-4095).
-               `Literals_Section_Header` has 2 bytes.
-               `Regenerated_Size = (Header[0]>>4) + (Header[1]<<4)`
-- Value 11 : `Size_Format` uses 2 bits.
-               `Regenerated_Size` uses 20 bits (0-1048575).
-               `Literals_Section_Header` has 3 bytes.
-               `Regenerated_Size = (Header[0]>>4) + (Header[1]<<4) + (Header[2]<<12)`
-
-Only Stream1 is present for these cases.
-Note : it's allowed to represent a short value (for example `13`)
-using a long format, even if it's less efficient.
-
-__`Size_Format` for `Compressed_Literals_Block` and `Treeless_Literals_Block`__ :
-
-- Value 00 : _A single stream_.
-               Both `Regenerated_Size` and `Compressed_Size` use 10 bits (0-1023).
-               `Literals_Section_Header` has 3 bytes.
-- Value 01 : 4 streams.
-               Both `Regenerated_Size` and `Compressed_Size` use 10 bits (0-1023).
-               `Literals_Section_Header` has 3 bytes.
-- Value 10 : 4 streams.
-               Both `Regenerated_Size` and `Compressed_Size` use 14 bits (0-16383).
-               `Literals_Section_Header` has 4 bytes.
-- Value 11 : 4 streams.
-               Both `Regenerated_Size` and `Compressed_Size` use 18 bits (0-262143).
-               `Literals_Section_Header` has 5 bytes.
-
-Both `Compressed_Size` and `Regenerated_Size` fields follow __little-endian__ convention.
-Note: `Compressed_Size` __includes__ the size of the Huffman Tree description
-_when_ it is present.
-
-### Raw Literals Block
-The data in Stream1 is `Regenerated_Size` bytes long,
-it contains the raw literals data to be used during [Sequence Execution].
-
-### RLE Literals Block
-Stream1 consists of a single byte which should be repeated `Regenerated_Size` times
-to generate the decoded literals.
-
-### Compressed Literals Block and Treeless Literals Block
-Both of these modes contain Huffman encoded data.
-`Treeless_Literals_Block` does not have a `Huffman_Tree_Description`.
-
-#### `Huffman_Tree_Description`
-This section is only present when `Literals_Block_Type` type is `Compressed_Literals_Block` (`2`).
-The format of the Huffman tree description can be found at [Huffman Tree description](#huffman-tree-description).
-The size of `Huffman_Tree_Description` is determined during decoding process,
-it must be used to determine where streams begin.
-`Total_Streams_Size = Compressed_Size - Huffman_Tree_Description_Size`.
-
-For `Treeless_Literals_Block`,
-the Huffman table comes from previously compressed literals block.
-
-Huffman compressed data consists of either 1 or 4 Huffman-coded streams.
-
-If only one stream is present, it is a single bitstream occupying the entire
-remaining portion of the literals block, encoded as described within
-[Huffman-Coded Streams](#huffman-coded-streams).
-
-If there are four streams, the literals section header only provides enough
-information to know the decompressed and compressed sizes of all four streams _combined_.
-The decompressed size of each stream is equal to `(Regenerated_Size+3)/4`,
-except for the last stream which may be up to 3 bytes smaller,
-to reach a total decompressed size as specified in `Regenerated_Size`.
-
-The compressed size of each stream is provided explicitly:
-the first 6 bytes of the compressed data consist of three 2-byte __little-endian__ fields,
-describing the compressed sizes of the first three streams.
-`Stream4_Size` is computed from total `Total_Streams_Size` minus sizes of other streams.
-
-`Stream4_Size = Total_Streams_Size - 6 - Stream1_Size - Stream2_Size - Stream3_Size`.
-
-Note: remember that `Total_Streams_Size` can be smaller than `Compressed_Size` in header,
-because `Compressed_Size` also contains `Huffman_Tree_Description_Size` when it is present.
-
-Each of these 4 bitstreams is then decoded independently as a Huffman-Coded stream,
-as described at [Huffman-Coded Streams](#huffman-coded-streams)
-
-
-Sequences Section
------------------
-A compressed block is a succession of _sequences_ .
-A sequence is a literal copy command, followed by a match copy command.
-A literal copy command specifies a length.
-It is the number of bytes to be copied (or extracted) from the Literals Section.
-A match copy command specifies an offset and a length.
-
-When all _sequences_ are decoded,
-if there are literals left in the _literal section_,
-these bytes are added at the end of the block.
-
-This is described in more detail in [Sequence Execution](#sequence-execution)
-
-The `Sequences_Section` regroup all symbols required to decode commands.
-There are 3 symbol types : literals lengths, offsets and match lengths.
-They are encoded together, interleaved, in a single _bitstream_.
-
-The `Sequences_Section` starts by a header,
-followed by optional probability tables for each symbol type,
-followed by the bitstream.
-
-| `Sequences_Section_Header` | [`Literals_Length_Table`] | [`Offset_Table`] | [`Match_Length_Table`] | bitStream |
-| -------------------------- | ------------------------- | ---------------- | ---------------------- | --------- |
-
-To decode the `Sequences_Section`, it's required to know its size.
-This size is deduced from `Block_Size - Literals_Section_Size`.
-
-
-#### `Sequences_Section_Header`
-
-Consists of 2 items:
-- `Number_of_Sequences`
-- Symbol compression modes
-
-__`Number_of_Sequences`__
-
-This is a variable size field using between 1 and 3 bytes.
-Let's call its first byte `byte0`.
-- `if (byte0 == 0)` : there are no sequences.
-            The sequence section stops there.
-            Decompressed content is defined entirely as Literals Section content.
-- `if (byte0 < 128)` : `Number_of_Sequences = byte0` . Uses 1 byte.
-- `if (byte0 < 255)` : `Number_of_Sequences = ((byte0-128) << 8) + byte1` . Uses 2 bytes.
-- `if (byte0 == 255)`: `Number_of_Sequences = byte1 + (byte2<<8) + 0x7F00` . Uses 3 bytes.
-
-__Symbol compression modes__
-
-This is a single byte, defining the compression mode of each symbol type.
-
-|Bit number|          7-6            |      5-4       |        3-2           |     1-0    |
-| -------- | ----------------------- | -------------- | -------------------- | ---------- |
-|Field name| `Literals_Lengths_Mode` | `Offsets_Mode` | `Match_Lengths_Mode` | `Reserved` |
-
-The last field, `Reserved`, must be all-zeroes.
-
-`Literals_Lengths_Mode`, `Offsets_Mode` and `Match_Lengths_Mode` define the `Compression_Mode` of
-literals lengths, offsets, and match lengths symbols respectively.
-
-They follow the same enumeration :
-
-|        Value       |         0         |      1     |           2           |       3       |
-| ------------------ | ----------------- | ---------- | --------------------- | ------------- |
-| `Compression_Mode` | `Predefined_Mode` | `RLE_Mode` | `FSE_Compressed_Mode` | `Repeat_Mode` |
-
-- `Predefined_Mode` : A predefined FSE distribution table is used, defined in
-          [default distributions](#default-distributions).
-          No distribution table will be present.
-- `RLE_Mode` : The table description consists of a single byte.
-          This code will be repeated for all sequences.
-- `Repeat_Mode` : The table used in the previous compressed block will be used again.
-          No distribution table will be present.
-          Note: this includes RLE mode, so if `Repeat_Mode` follows `RLE_Mode`, the same symbol will be repeated.
-          If this mode is used without any previous sequence table in the frame
-          (or [dictionary](#dictionary-format)) to repeat, this should be treated as corruption.
-- `FSE_Compressed_Mode` : standard FSE compression.
-          A distribution table will be present.
-          The format of this distribution table is described in [FSE Table Description](#fse-table-description).
-          Note that the maximum allowed accuracy log for literals length and match length tables is 9,
-          and the maximum accuracy log for the offsets table is 8.
-
-#### The codes for literals lengths, match lengths, and offsets.
-
-Each symbol is a _code_ in its own context,
-which specifies `Baseline` and `Number_of_Bits` to add.
-_Codes_ are FSE compressed,
-and interleaved with raw additional bits in the same bitstream.
-
-##### Literals length codes
-
-Literals length codes are values ranging from `0` to `35` included.
-They define lengths from 0 to 131071 bytes.
-The literals length is equal to the decoded `Baseline` plus
-the result of reading `Number_of_Bits` bits from the bitstream,
-as a __little-endian__ value.
-
-| `Literals_Length_Code` |         0-15           |
-| ---------------------- | ---------------------- |
-| length                 | `Literals_Length_Code` |
-| `Number_of_Bits`       |          0             |
-
-| `Literals_Length_Code` |  16  |  17  |  18  |  19  |  20  |  21  |  22  |  23  |
-| ---------------------- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- |
-| `Baseline`             |  16  |  18  |  20  |  22  |  24  |  28  |  32  |  40  |
-| `Number_of_Bits`       |   1  |   1  |   1  |   1  |   2  |   2  |   3  |   3  |
-
-| `Literals_Length_Code` |  24  |  25  |  26  |  27  |  28  |  29  |  30  |  31  |
-| ---------------------- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- |
-| `Baseline`             |  48  |  64  |  128 |  256 |  512 | 1024 | 2048 | 4096 |
-| `Number_of_Bits`       |   4  |   6  |   7  |   8  |   9  |  10  |  11  |  12  |
-
-| `Literals_Length_Code` |  32  |  33  |  34  |  35  |
-| ---------------------- | ---- | ---- | ---- | ---- |
-| `Baseline`             | 8192 |16384 |32768 |65536 |
-| `Number_of_Bits`       |  13  |  14  |  15  |  16  |
-
-
-##### Match length codes
-
-Match length codes are values ranging from `0` to `52` included.
-They define lengths from 3 to 131074 bytes.
-The match length is equal to the decoded `Baseline` plus
-the result of reading `Number_of_Bits` bits from the bitstream,
-as a __little-endian__ value.
-
-| `Match_Length_Code` |         0-31            |
-| ------------------- | ----------------------- |
-| value               | `Match_Length_Code` + 3 |
-| `Number_of_Bits`    |          0              |
-
-| `Match_Length_Code` |  32  |  33  |  34  |  35  |  36  |  37  |  38  |  39  |
-| ------------------- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- |
-| `Baseline`          |  35  |  37  |  39  |  41  |  43  |  47  |  51  |  59  |
-| `Number_of_Bits`    |   1  |   1  |   1  |   1  |   2  |   2  |   3  |   3  |
-
-| `Match_Length_Code` |  40  |  41  |  42  |  43  |  44  |  45  |  46  |  47  |
-| ------------------- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- |
-| `Baseline`          |  67  |  83  |  99  |  131 |  259 |  515 | 1027 | 2051 |
-| `Number_of_Bits`    |   4  |   4  |   5  |   7  |   8  |   9  |  10  |  11  |
-
-| `Match_Length_Code` |  48  |  49  |  50  |  51  |  52  |
-| ------------------- | ---- | ---- | ---- | ---- | ---- |
-| `Baseline`          | 4099 | 8195 |16387 |32771 |65539 |
-| `Number_of_Bits`    |  12  |  13  |  14  |  15  |  16  |
-
-##### Offset codes
-
-Offset codes are values ranging from `0` to `N`.
-
-A decoder is free to limit its maximum `N` supported.
-Recommendation is to support at least up to `22`.
-For information, at the time of this writing.
-the reference decoder supports a maximum `N` value of `28` in 64-bits mode.
-
-An offset code is also the number of additional bits to read in __little-endian__ fashion,
-and can be translated into an `Offset_Value` using the following formulas :
-
-```
-Offset_Value = (1 << offsetCode) + readNBits(offsetCode);
-if (Offset_Value > 3) offset = Offset_Value - 3;
-```
-It means that maximum `Offset_Value` is `(2^(N+1))-1` and it supports back-reference distance up to `(2^(N+1))-4`
-but is limited by [maximum back-reference distance](#window_descriptor).
-
-`Offset_Value` from 1 to 3 are special : they define "repeat codes".
-This is described in more detail in [Repeat Offsets](#repeat-offsets).
-
-#### Decoding Sequences
-FSE bitstreams are read in reverse direction than written. In zstd,
-the compressor writes bits forward into a block and the decompressor
-must read the bitstream _backwards_.
-
-To find the start of the bitstream it is therefore necessary to
-know the offset of the last byte of the block which can be found
-by counting `Block_Size` bytes after the block header.
-
-After writing the last bit containing information, the compressor
-writes a single `1`-bit and then fills the byte with 0-7 `0` bits of
-padding. The last byte of the compressed bitstream cannot be `0` for
-that reason.
-
-When decompressing, the last byte containing the padding is the first
-byte to read. The decompressor needs to skip 0-7 initial `0`-bits and
-the first `1`-bit it occurs. Afterwards, the useful part of the bitstream
-begins.
-
-FSE decoding requires a 'state' to be carried from symbol to symbol.
-For more explanation on FSE decoding, see the [FSE section](#fse).
-
-For sequence decoding, a separate state keeps track of each
-literal lengths, offsets, and match lengths symbols.
-Some FSE primitives are also used.
-For more details on the operation of these primitives, see the [FSE section](#fse).
-
-##### Starting states
-The bitstream starts with initial FSE state values,
-each using the required number of bits in their respective _accuracy_,
-decoded previously from their normalized distribution.
-
-It starts by `Literals_Length_State`,
-followed by `Offset_State`,
-and finally `Match_Length_State`.
-
-Reminder : always keep in mind that all values are read _backward_,
-so the 'start' of the bitstream is at the highest position in memory,
-immediately before the last `1`-bit for padding.
-
-After decoding the starting states, a single sequence is decoded
-`Number_Of_Sequences` times.
-These sequences are decoded in order from first to last.
-Since the compressor writes the bitstream in the forward direction,
-this means the compressor must encode the sequences starting with the last
-one and ending with the first.
-
-##### Decoding a sequence
-For each of the symbol types, the FSE state can be used to determine the appropriate code.
-The code then defines the baseline and number of bits to read for each type.
-See the [description of the codes] for how to determine these values.
-
-[description of the codes]: #the-codes-for-literals-lengths-match-lengths-and-offsets
-
-Decoding starts by reading the `Number_of_Bits` required to decode `Offset`.
-It then does the same for `Match_Length`, and then for `Literals_Length`.
-This sequence is then used for [sequence execution](#sequence-execution).
-
-If it is not the last sequence in the block,
-the next operation is to update states.
-Using the rules pre-calculated in the decoding tables,
-`Literals_Length_State` is updated,
-followed by `Match_Length_State`,
-and then `Offset_State`.
-See the [FSE section](#fse) for details on how to update states from the bitstream.
-
-This operation will be repeated `Number_of_Sequences` times.
-At the end, the bitstream shall be entirely consumed,
-otherwise the bitstream is considered corrupted.
-
-#### Default Distributions
-If `Predefined_Mode` is selected for a symbol type,
-its FSE decoding table is generated from a predefined distribution table defined here.
-For details on how to convert this distribution into a decoding table, see the [FSE section].
-
-[FSE section]: #from-normalized-distribution-to-decoding-tables
-
-##### Literals Length
-The decoding table uses an accuracy log of 6 bits (64 states).
-```
-short literalsLength_defaultDistribution[36] =
-        { 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1,
-          2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 1, 1, 1, 1, 1,
-         -1,-1,-1,-1 };
-```
-
-##### Match Length
-The decoding table uses an accuracy log of 6 bits (64 states).
-```
-short matchLengths_defaultDistribution[53] =
-        { 1, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1,
-          1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-          1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,-1,-1,
-         -1,-1,-1,-1,-1 };
-```
-
-##### Offset Codes
-The decoding table uses an accuracy log of 5 bits (32 states),
-and supports a maximum `N` value of 28, allowing offset values up to 536,870,908 .
-
-If any sequence in the compressed block requires a larger offset than this,
-it's not possible to use the default distribution to represent it.
-```
-short offsetCodes_defaultDistribution[29] =
-        { 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1,
-          1, 1, 1, 1, 1, 1, 1, 1,-1,-1,-1,-1,-1 };
-```
-
-
-Sequence Execution
-------------------
-Once literals and sequences have been decoded,
-they are combined to produce the decoded content of a block.
-
-Each sequence consists of a tuple of (`literals_length`, `offset_value`, `match_length`),
-decoded as described in the [Sequences Section](#sequences-section).
-To execute a sequence, first copy `literals_length` bytes from the literals section
-to the output.
-
-Then `match_length` bytes are copied from previous decoded data.
-The offset to copy from is determined by `offset_value`:
-if `offset_value > 3`, then the offset is `offset_value - 3`.
-If `offset_value` is from 1-3, the offset is a special repeat offset value.
-See the [repeat offset](#repeat-offsets) section for how the offset is determined
-in this case.
-
-The offset is defined as from the current position, so an offset of 6
-and a match length of 3 means that 3 bytes should be copied from 6 bytes back.
-Note that all offsets leading to previously decoded data
-must be smaller than `Window_Size` defined in `Frame_Header_Descriptor`.
-
-#### Repeat offsets
-As seen in [Sequence Execution](#sequence-execution),
-the first 3 values define a repeated offset and we will call them
-`Repeated_Offset1`, `Repeated_Offset2`, and `Repeated_Offset3`.
-They are sorted in recency order, with `Repeated_Offset1` meaning "most recent one".
-
-If `offset_value == 1`, then the offset used is `Repeated_Offset1`, etc.
-
-There is an exception though, when current sequence's `literals_length = 0`.
-In this case, repeated offsets are shifted by one,
-so an `offset_value` of 1 means `Repeated_Offset2`,
-an `offset_value` of 2 means `Repeated_Offset3`,
-and an `offset_value` of 3 means `Repeated_Offset1 - 1_byte`.
-
-For the first block, the starting offset history is populated with the following values : 1, 4 and 8 (in order).
-
-Then each block gets its starting offset history from the ending values of the most recent `Compressed_Block`.
-Note that blocks which are not `Compressed_Block` are skipped, they do not contribute to offset history.
-
-[Offset Codes]: #offset-codes
-
-###### Offset updates rules
-
-The newest offset takes the lead in offset history,
-shifting others back (up to its previous place if it was already present).
-
-This means that when `Repeated_Offset1` (most recent) is used, history is unmodified.
-When `Repeated_Offset2` is used, it's swapped with `Repeated_Offset1`.
-If any other offset is used, it becomes `Repeated_Offset1` and the rest are shift back by one.
-
-
-Skippable Frames
-----------------
-
-| `Magic_Number` | `Frame_Size` | `User_Data` |
-|:--------------:|:------------:|:-----------:|
-|   4 bytes      |  4 bytes     |   n bytes   |
-
-Skippable frames allow the insertion of user-defined data
-into a flow of concatenated frames.
-Its design is pretty straightforward,
-with the sole objective to allow the decoder to quickly skip
-over user-defined data and continue decoding.
-
-Skippable frames defined in this specification are compatible with [LZ4] ones.
-
-[LZ4]:http://www.lz4.org
-
-__`Magic_Number`__
-
-4 Bytes, __little-endian__ format.
-Value : 0x184D2A5?, which means any value from 0x184D2A50 to 0x184D2A5F.
-All 16 values are valid to identify a skippable frame.
-
-__`Frame_Size`__
-
-This is the size, in bytes, of the following `User_Data`
-(without including the magic number nor the size field itself).
-This field is represented using 4 Bytes, __little-endian__ format, unsigned 32-bits.
-This means `User_Data` can’t be bigger than (2^32-1) bytes.
-
-__`User_Data`__
-
-The `User_Data` can be anything. Data will just be skipped by the decoder.
-
-
-Entropy Encoding
-----------------
-Two types of entropy encoding are used by the Zstandard format:
-FSE, and Huffman coding.
-
-FSE
----
-FSE, short for Finite State Entropy, is an entropy codec based on [ANS].
-FSE encoding/decoding involves a state that is carried over between symbols,
-so decoding must be done in the opposite direction as encoding.
-Therefore, all FSE bitstreams are read from end to beginning.
-
-For additional details on FSE, see [Finite State Entropy].
-
-[Finite State Entropy]:https://github.com/Cyan4973/FiniteStateEntropy/
-
-FSE decoding involves a decoding table which has a power of 2 size, and contain three elements:
-`Symbol`, `Num_Bits`, and `Baseline`.
-The `log2` of the table size is its `Accuracy_Log`.
-The FSE state represents an index in this table.
-
-To obtain the initial state value, consume `Accuracy_Log` bits from the stream as a __little-endian__ value.
-The next symbol in the stream is the `Symbol` indicated in the table for that state.
-To obtain the next state value,
-the decoder should consume `Num_Bits` bits from the stream as a __little-endian__ value and add it to `Baseline`.
-
-[ANS]: https://en.wikipedia.org/wiki/Asymmetric_Numeral_Systems
-
-### FSE Table Description
-To decode FSE streams, it is necessary to construct the decoding table.
-The Zstandard format encodes FSE table descriptions as follows:
-
-An FSE distribution table describes the probabilities of all symbols
-from `0` to the last present one (included)
-on a normalized scale of `1 << Accuracy_Log` .
-
-It's a bitstream which is read forward, in __little-endian__ fashion.
-It's not necessary to know its exact size,
-since it will be discovered and reported by the decoding process.
-
-The bitstream starts by reporting on which scale it operates.
-`Accuracy_Log = low4bits + 5`.
-
-Then follows each symbol value, from `0` to last present one.
-The number of bits used by each field is variable.
-It depends on :
-
-- Remaining probabilities + 1 :
-  __example__ :
-  Presuming an `Accuracy_Log` of 8,
-  and presuming 100 probabilities points have already been distributed,
-  the decoder may read any value from `0` to `255 - 100 + 1 == 156` (inclusive).
-  Therefore, it must read `log2sup(156) == 8` bits.
-
-- Value decoded : small values use 1 less bit :
-  __example__ :
-  Presuming values from 0 to 156 (inclusive) are possible,
-  255-156 = 99 values are remaining in an 8-bits field.
-  They are used this way :
-  first 99 values (hence from 0 to 98) use only 7 bits,
-  values from 99 to 156 use 8 bits.
-  This is achieved through this scheme :
-
-  | Value read | Value decoded | Number of bits used |
-  | ---------- | ------------- | ------------------- |
-  |   0 -  98  |   0 -  98     |  7                  |
-  |  99 - 127  |  99 - 127     |  8                  |
-  | 128 - 226  |   0 -  98     |  7                  |
-  | 227 - 255  | 128 - 156     |  8                  |
-
-Symbols probabilities are read one by one, in order.
-
-Probability is obtained from Value decoded by following formula :
-`Proba = value - 1`
-
-It means value `0` becomes negative probability `-1`.
-`-1` is a special probability, which means "less than 1".
-Its effect on distribution table is described in the [next section].
-For the purpose of calculating total allocated probability points, it counts as one.
-
-[next section]:#from-normalized-distribution-to-decoding-tables
-
-When a symbol has a __probability__ of `zero`,
-it is followed by a 2-bits repeat flag.
-This repeat flag tells how many probabilities of zeroes follow the current one.
-It provides a number ranging from 0 to 3.
-If it is a 3, another 2-bits repeat flag follows, and so on.
-
-When last symbol reaches cumulated total of `1 << Accuracy_Log`,
-decoding is complete.
-If the last symbol makes cumulated total go above `1 << Accuracy_Log`,
-distribution is considered corrupted.
-
-Then the decoder can tell how many bytes were used in this process,
-and how many symbols are present.
-The bitstream consumes a round number of bytes.
-Any remaining bit within the last byte is just unused.
-
-##### From normalized distribution to decoding tables
-
-The distribution of normalized probabilities is enough
-to create a unique decoding table.
-
-It follows the following build rule :
-
-The table has a size of `Table_Size = 1 << Accuracy_Log`.
-Each cell describes the symbol decoded,
-and instructions to get the next state.
-
-Symbols are scanned in their natural order for "less than 1" probabilities.
-Symbols with this probability are being attributed a single cell,
-starting from the end of the table.
-These symbols define a full state reset, reading `Accuracy_Log` bits.
-
-All remaining symbols are sorted in their natural order.
-Starting from symbol `0` and table position `0`,
-each symbol gets attributed as many cells as its probability.
-Cell allocation is spreaded, not linear :
-each successor position follow this rule :
-
-```
-position += (tableSize>>1) + (tableSize>>3) + 3;
-position &= tableSize-1;
-```
-
-A position is skipped if already occupied by a "less than 1" probability symbol.
-`position` does not reset between symbols, it simply iterates through
-each position in the table, switching to the next symbol when enough
-states have been allocated to the current one.
-
-The result is a list of state values.
-Each state will decode the current symbol.
-
-To get the `Number_of_Bits` and `Baseline` required for next state,
-it's first necessary to sort all states in their natural order.
-The lower states will need 1 more bit than higher ones.
-
-__Example__ :
-Presuming a symbol has a probability of 5.
-It receives 5 state values. States are sorted in natural order.
-
-Next power of 2 is 8.
-Space of probabilities is divided into 8 equal parts.
-Presuming the `Accuracy_Log` is 7, it defines 128 states.
-Divided by 8, each share is 16 large.
-
-In order to reach 8, 8-5=3 lowest states will count "double",
-taking shares twice larger,
-requiring one more bit in the process.
-
-Numbering starts from higher states using less bits.
-
-| state order      |   0   |   1   |    2   |   3  |   4   |
-| ---------------- | ----- | ----- | ------ | ---- | ----- |
-| width            |  32   |  32   |   32   |  16  |  16   |
-| `Number_of_Bits` |   5   |   5   |    5   |   4  |   4   |
-| range number     |   2   |   4   |    6   |   0  |   1   |
-| `Baseline`       |  32   |  64   |   96   |   0  |  16   |
-| range            | 32-63 | 64-95 | 96-127 | 0-15 | 16-31 |
-
-The next state is determined from current state
-by reading the required `Number_of_Bits`, and adding the specified `Baseline`.
-
-See [Appendix A] for the results of this process applied to the default distributions.
-
-[Appendix A]: #appendix-a---decoding-tables-for-predefined-codes
-
-Huffman Coding
---------------
-Zstandard Huffman-coded streams are read backwards,
-similar to the FSE bitstreams.
-Therefore, to find the start of the bitstream, it is therefore to
-know the offset of the last byte of the Huffman-coded stream.
-
-After writing the last bit containing information, the compressor
-writes a single `1`-bit and then fills the byte with 0-7 `0` bits of
-padding. The last byte of the compressed bitstream cannot be `0` for
-that reason.
-
-When decompressing, the last byte containing the padding is the first
-byte to read. The decompressor needs to skip 0-7 initial `0`-bits and
-the first `1`-bit it occurs. Afterwards, the useful part of the bitstream
-begins.
-
-The bitstream contains Huffman-coded symbols in __little-endian__ order,
-with the codes defined by the method below.
-
-### Huffman Tree Description
-Prefix coding represents symbols from an a priori known alphabet
-by bit sequences (codewords), one codeword for each symbol,
-in a manner such that different symbols may be represented
-by bit sequences of different lengths,
-but a parser can always parse an encoded string
-unambiguously symbol-by-symbol.
-
-Given an alphabet with known symbol frequencies,
-the Huffman algorithm allows the construction of an optimal prefix code
-using the fewest bits of any possible prefix codes for that alphabet.
-
-Prefix code must not exceed a maximum code length.
-More bits improve accuracy but cost more header size,
-and require more memory or more complex decoding operations.
-This specification limits maximum code length to 11 bits.
-
-
-##### Representation
-
-All literal values from zero (included) to last present one (excluded)
-are represented by `Weight` with values from `0` to `Max_Number_of_Bits`.
-Transformation from `Weight` to `Number_of_Bits` follows this formula :
-```
-Number_of_Bits = Weight ? (Max_Number_of_Bits + 1 - Weight) : 0
-```
-The last symbol's `Weight` is deduced from previously decoded ones,
-by completing to the nearest power of 2.
-This power of 2 gives `Max_Number_of_Bits`, the depth of the current tree.
-
-__Example__ :
-Let's presume the following Huffman tree must be described :
-
-|     literal      |  0  |  1  |  2  |  3  |  4  |  5  |
-| ---------------- | --- | --- | --- | --- | --- | --- |
-| `Number_of_Bits` |  1  |  2  |  3  |  0  |  4  |  4  |
-
-The tree depth is 4, since its smallest element uses 4 bits.
-Value `5` will not be listed as it can be determined from the values for 0-4,
-nor will values above `5` as they are all 0.
-Values from `0` to `4` will be listed using `Weight` instead of `Number_of_Bits`.
-Weight formula is :
-```
-Weight = Number_of_Bits ? (Max_Number_of_Bits + 1 - Number_of_Bits) : 0
-```
-It gives the following series of weights :
-
-| literal  |  0  |  1  |  2  |  3  |  4  |
-| -------- | --- | --- | --- | --- | --- |
-| `Weight` |  4  |  3  |  2  |  0  |  1  |
-
-The decoder will do the inverse operation :
-having collected weights of literals from `0` to `4`,
-it knows the last literal, `5`, is present with a non-zero weight.
-The weight of `5` can be determined by advancing to the next power of 2.
-The sum of `2^(Weight-1)` (excluding 0's) is :
-`8 + 4 + 2 + 0 + 1 = 15`.
-Nearest power of 2 is 16.
-Therefore, `Max_Number_of_Bits = 4` and `Weight[5] = 1`.
-
-##### Huffman Tree header
-
-This is a single byte value (0-255),
-which describes how to decode the list of weights.
-
-- if `headerByte` >= 128 : this is a direct representation,
-  where each `Weight` is written directly as a 4 bits field (0-15).
-  They are encoded forward, 2 weights to a byte with the first weight taking
-  the top four bits and the second taking the bottom four (e.g. the following
-  operations could be used to read the weights:
-  `Weight[0] = (Byte[0] >> 4), Weight[1] = (Byte[0] & 0xf)`, etc.).
-  The full representation occupies `((Number_of_Symbols+1)/2)` bytes,
-  meaning it uses a last full byte even if `Number_of_Symbols` is odd.
-  `Number_of_Symbols = headerByte - 127`.
-  Note that maximum `Number_of_Symbols` is 255-127 = 128.
-  A larger series must necessarily use FSE compression.
-
-- if `headerByte` < 128 :
-  the series of weights is compressed by FSE.
-  The length of the FSE-compressed series is equal to `headerByte` (0-127).
-
-##### Finite State Entropy (FSE) compression of Huffman weights
-
-In this case, the series of Huffman weights is compressed using FSE compression.
-It's a single bitstream with 2 interleaved states,
-sharing a single distribution table.
-
-To decode an FSE bitstream, it is necessary to know its compressed size.
-Compressed size is provided by `headerByte`.
-It's also necessary to know its _maximum possible_ decompressed size,
-which is `255`, since literal values span from `0` to `255`,
-and last symbol's weight is not represented.
-
-An FSE bitstream starts by a header, describing probabilities distribution.
-It will create a Decoding Table.
-For a list of Huffman weights, the maximum accuracy log is 7 bits.
-For more description see the [FSE header description](#fse-table-description)
-
-The Huffman header compression uses 2 states,
-which share the same FSE distribution table.
-The first state (`State1`) encodes the even indexed symbols,
-and the second (`State2`) encodes the odd indexes.
-`State1` is initialized first, and then `State2`, and they take turns
-decoding a single symbol and updating their state.
-For more details on these FSE operations, see the [FSE section](#fse).
-
-The number of symbols to decode is determined
-by tracking bitStream overflow condition:
-If updating state after decoding a symbol would require more bits than
-remain in the stream, it is assumed that extra bits are 0.  Then,
-the symbols for each of the final states are decoded and the process is complete.
-
-##### Conversion from weights to Huffman prefix codes
-
-All present symbols shall now have a `Weight` value.
-It is possible to transform weights into Number_of_Bits, using this formula:
-```
-Number_of_Bits = Number_of_Bits ? Max_Number_of_Bits + 1 - Weight : 0
-```
-Symbols are sorted by `Weight`. Within same `Weight`, symbols keep natural order.
-Symbols with a `Weight` of zero are removed.
-Then, starting from lowest weight, prefix codes are distributed in order.
-
-__Example__ :
-Let's presume the following list of weights has been decoded :
-
-| Literal  |  0  |  1  |  2  |  3  |  4  |  5  |
-| -------- | --- | --- | --- | --- | --- | --- |
-| `Weight` |  4  |  3  |  2  |  0  |  1  |  1  |
-
-Sorted by weight and then natural order,
-it gives the following distribution :
-
-| Literal          |  3  |  4  |  5  |  2  |  1  |   0  |
-| ---------------- | --- | --- | --- | --- | --- | ---- |
-| `Weight`         |  0  |  1  |  1  |  2  |  3  |   4  |
-| `Number_of_Bits` |  0  |  4  |  4  |  3  |  2  |   1  |
-| prefix codes     | N/A | 0000| 0001| 001 | 01  |   1  |
-
-### Huffman-coded Streams
-Given a Huffman decoding table,
-it's possible to decode a Huffman-coded stream.
-
-Each bitstream must be read _backward_,
-that is starting from the end down to the beginning.
-Therefore it's necessary to know the size of each bitstream.
-
-It's also necessary to know exactly which _bit_ is the latest.
-This is detected by a final bit flag :
-the highest bit of latest byte is a final-bit-flag.
-Consequently, a last byte of `0` is not possible.
-And the final-bit-flag itself is not part of the useful bitstream.
-Hence, the last byte contains between 0 and 7 useful bits.
-
-Starting from the end,
-it's possible to read the bitstream in a __little-endian__ fashion,
-keeping track of already used bits. Since the bitstream is encoded in reverse
-order, starting from the end read symbols in forward order.
-
-For example, if the literal sequence "0145" was encoded using above prefix code,
-it would be encoded (in reverse order) as:
-
-|Symbol  |   5  |   4  |  1 | 0 | Padding |
-|--------|------|------|----|---|---------|
-|Encoding|`0000`|`0001`|`01`|`1`| `00001` |
-
-Resulting in following 2-bytes bitstream :
-```
-00010000 00001101
-```
-
-Here is an alternative representation with the symbol codes separated by underscore:
-```
-0001_0000 00001_1_01
-```
-
-Reading highest `Max_Number_of_Bits` bits,
-it's possible to compare extracted value to decoding table,
-determining the symbol to decode and number of bits to discard.
-
-The process continues up to reading the required number of symbols per stream.
-If a bitstream is not entirely and exactly consumed,
-hence reaching exactly its beginning position with _all_ bits consumed,
-the decoding process is considered faulty.
-
-
-Dictionary Format
------------------
-
-Zstandard is compatible with "raw content" dictionaries,
-free of any format restriction, except that they must be at least 8 bytes.
-These dictionaries function as if they were just the `Content` part
-of a formatted dictionary.
-
-But dictionaries created by `zstd --train` follow a format, described here.
-
-__Pre-requisites__ : a dictionary has a size,
-                     defined either by a buffer limit, or a file size.
-
-| `Magic_Number` | `Dictionary_ID` | `Entropy_Tables` | `Content` |
-| -------------- | --------------- | ---------------- | --------- |
-
-__`Magic_Number`__ : 4 bytes ID, value 0xEC30A437, __little-endian__ format
-
-__`Dictionary_ID`__ : 4 bytes, stored in __little-endian__ format.
-              `Dictionary_ID` can be any value, except 0 (which means no `Dictionary_ID`).
-              It's used by decoders to check if they use the correct dictionary.
-
-_Reserved ranges :_
-              If the frame is going to be distributed in a private environment,
-              any `Dictionary_ID` can be used.
-              However, for public distribution of compressed frames,
-              the following ranges are reserved and shall not be used :
-
-              - low range  : <= 32767
-              - high range : >= (2^31)
-
-__`Entropy_Tables`__ : following the same format as the tables in compressed blocks.
-              See the relevant [FSE](#fse-table-description)
-              and [Huffman](#huffman-tree-description) sections for how to decode these tables.
-              They are stored in following order :
-              Huffman tables for literals, FSE table for offsets,
-              FSE table for match lengths, and FSE table for literals lengths.
-              These tables populate the Repeat Stats literals mode and
-              Repeat distribution mode for sequence decoding.
-              It's finally followed by 3 offset values, populating recent offsets (instead of using `{1,4,8}`),
-              stored in order, 4-bytes __little-endian__ each, for a total of 12 bytes.
-              Each recent offset must have a value < dictionary size.
-
-__`Content`__ : The rest of the dictionary is its content.
-              The content act as a "past" in front of data to compress or decompress,
-              so it can be referenced in sequence commands.
-              As long as the amount of data decoded from this frame is less than or
-              equal to `Window_Size`, sequence commands may specify offsets longer
-              than the total length of decoded output so far to reference back to the
-              dictionary.  After the total output has surpassed `Window_Size` however,
-              this is no longer allowed and the dictionary is no longer accessible.
-
-[compressed blocks]: #the-format-of-compressed_block
-
-
-Appendix A - Decoding tables for predefined codes
--------------------------------------------------
-
-This appendix contains FSE decoding tables
-for the predefined literal length, match length, and offset codes.
-The tables have been constructed using the algorithm as given above in chapter
-"from normalized distribution to decoding tables".
-The tables here can be used as examples
-to crosscheck that an implementation build its decoding tables correctly.
-
-#### Literal Length Code:
-
-| State | Symbol | Number_Of_Bits | Base |
-| ----- | ------ | -------------- | ---- |
-|     0 |      0 |              4 |    0 |
-|     1 |      0 |              4 |   16 |
-|     2 |      1 |              5 |   32 |
-|     3 |      3 |              5 |    0 |
-|     4 |      4 |              5 |    0 |
-|     5 |      6 |              5 |    0 |
-|     6 |      7 |              5 |    0 |
-|     7 |      9 |              5 |    0 |
-|     8 |     10 |              5 |    0 |
-|     9 |     12 |              5 |    0 |
-|    10 |     14 |              6 |    0 |
-|    11 |     16 |              5 |    0 |
-|    12 |     18 |              5 |    0 |
-|    13 |     19 |              5 |    0 |
-|    14 |     21 |              5 |    0 |
-|    15 |     22 |              5 |    0 |
-|    16 |     24 |              5 |    0 |
-|    17 |     25 |              5 |   32 |
-|    18 |     26 |              5 |    0 |
-|    19 |     27 |              6 |    0 |
-|    20 |     29 |              6 |    0 |
-|    21 |     31 |              6 |    0 |
-|    22 |      0 |              4 |   32 |
-|    23 |      1 |              4 |    0 |
-|    24 |      2 |              5 |    0 |
-|    25 |      4 |              5 |   32 |
-|    26 |      5 |              5 |    0 |
-|    27 |      7 |              5 |   32 |
-|    28 |      8 |              5 |    0 |
-|    29 |     10 |              5 |   32 |
-|    30 |     11 |              5 |    0 |
-|    31 |     13 |              6 |    0 |
-|    32 |     16 |              5 |   32 |
-|    33 |     17 |              5 |    0 |
-|    34 |     19 |              5 |   32 |
-|    35 |     20 |              5 |    0 |
-|    36 |     22 |              5 |   32 |
-|    37 |     23 |              5 |    0 |
-|    38 |     25 |              4 |    0 |
-|    39 |     25 |              4 |   16 |
-|    40 |     26 |              5 |   32 |
-|    41 |     28 |              6 |    0 |
-|    42 |     30 |              6 |    0 |
-|    43 |      0 |              4 |   48 |
-|    44 |      1 |              4 |   16 |
-|    45 |      2 |              5 |   32 |
-|    46 |      3 |              5 |   32 |
-|    47 |      5 |              5 |   32 |
-|    48 |      6 |              5 |   32 |
-|    49 |      8 |              5 |   32 |
-|    50 |      9 |              5 |   32 |
-|    51 |     11 |              5 |   32 |
-|    52 |     12 |              5 |   32 |
-|    53 |     15 |              6 |    0 |
-|    54 |     17 |              5 |   32 |
-|    55 |     18 |              5 |   32 |
-|    56 |     20 |              5 |   32 |
-|    57 |     21 |              5 |   32 |
-|    58 |     23 |              5 |   32 |
-|    59 |     24 |              5 |   32 |
-|    60 |     35 |              6 |    0 |
-|    61 |     34 |              6 |    0 |
-|    62 |     33 |              6 |    0 |
-|    63 |     32 |              6 |    0 |
-
-#### Match Length Code:
-
-| State | Symbol | Number_Of_Bits | Base |
-| ----- | ------ | -------------- | ---- |
-|     0 |      0 |              6 |    0 |
-|     1 |      1 |              4 |    0 |
-|     2 |      2 |              5 |   32 |
-|     3 |      3 |              5 |    0 |
-|     4 |      5 |              5 |    0 |
-|     5 |      6 |              5 |    0 |
-|     6 |      8 |              5 |    0 |
-|     7 |     10 |              6 |    0 |
-|     8 |     13 |              6 |    0 |
-|     9 |     16 |              6 |    0 |
-|    10 |     19 |              6 |    0 |
-|    11 |     22 |              6 |    0 |
-|    12 |     25 |              6 |    0 |
-|    13 |     28 |              6 |    0 |
-|    14 |     31 |              6 |    0 |
-|    15 |     33 |              6 |    0 |
-|    16 |     35 |              6 |    0 |
-|    17 |     37 |              6 |    0 |
-|    18 |     39 |              6 |    0 |
-|    19 |     41 |              6 |    0 |
-|    20 |     43 |              6 |    0 |
-|    21 |     45 |              6 |    0 |
-|    22 |      1 |              4 |   16 |
-|    23 |      2 |              4 |    0 |
-|    24 |      3 |              5 |   32 |
-|    25 |      4 |              5 |    0 |
-|    26 |      6 |              5 |   32 |
-|    27 |      7 |              5 |    0 |
-|    28 |      9 |              6 |    0 |
-|    29 |     12 |              6 |    0 |
-|    30 |     15 |              6 |    0 |
-|    31 |     18 |              6 |    0 |
-|    32 |     21 |              6 |    0 |
-|    33 |     24 |              6 |    0 |
-|    34 |     27 |              6 |    0 |
-|    35 |     30 |              6 |    0 |
-|    36 |     32 |              6 |    0 |
-|    37 |     34 |              6 |    0 |
-|    38 |     36 |              6 |    0 |
-|    39 |     38 |              6 |    0 |
-|    40 |     40 |              6 |    0 |
-|    41 |     42 |              6 |    0 |
-|    42 |     44 |              6 |    0 |
-|    43 |      1 |              4 |   32 |
-|    44 |      1 |              4 |   48 |
-|    45 |      2 |              4 |   16 |
-|    46 |      4 |              5 |   32 |
-|    47 |      5 |              5 |   32 |
-|    48 |      7 |              5 |   32 |
-|    49 |      8 |              5 |   32 |
-|    50 |     11 |              6 |    0 |
-|    51 |     14 |              6 |    0 |
-|    52 |     17 |              6 |    0 |
-|    53 |     20 |              6 |    0 |
-|    54 |     23 |              6 |    0 |
-|    55 |     26 |              6 |    0 |
-|    56 |     29 |              6 |    0 |
-|    57 |     52 |              6 |    0 |
-|    58 |     51 |              6 |    0 |
-|    59 |     50 |              6 |    0 |
-|    60 |     49 |              6 |    0 |
-|    61 |     48 |              6 |    0 |
-|    62 |     47 |              6 |    0 |
-|    63 |     46 |              6 |    0 |
-
-#### Offset Code:
-
-| State | Symbol | Number_Of_Bits | Base |
-| ----- | ------ | -------------- | ---- |
-|     0 |      0 |              5 |    0 |
-|     1 |      6 |              4 |    0 |
-|     2 |      9 |              5 |    0 |
-|     3 |     15 |              5 |    0 |
-|     4 |     21 |              5 |    0 |
-|     5 |      3 |              5 |    0 |
-|     6 |      7 |              4 |    0 |
-|     7 |     12 |              5 |    0 |
-|     8 |     18 |              5 |    0 |
-|     9 |     23 |              5 |    0 |
-|    10 |      5 |              5 |    0 |
-|    11 |      8 |              4 |    0 |
-|    12 |     14 |              5 |    0 |
-|    13 |     20 |              5 |    0 |
-|    14 |      2 |              5 |    0 |
-|    15 |      7 |              4 |   16 |
-|    16 |     11 |              5 |    0 |
-|    17 |     17 |              5 |    0 |
-|    18 |     22 |              5 |    0 |
-|    19 |      4 |              5 |    0 |
-|    20 |      8 |              4 |   16 |
-|    21 |     13 |              5 |    0 |
-|    22 |     19 |              5 |    0 |
-|    23 |      1 |              5 |    0 |
-|    24 |      6 |              4 |   16 |
-|    25 |     10 |              5 |    0 |
-|    26 |     16 |              5 |    0 |
-|    27 |     28 |              5 |    0 |
-|    28 |     27 |              5 |    0 |
-|    29 |     26 |              5 |    0 |
-|    30 |     25 |              5 |    0 |
-|    31 |     24 |              5 |    0 |
-
-Version changes
----------------
-- 0.2.6 : fixed an error in huffman example, by Ulrich Kunitz
-- 0.2.5 : minor typos and clarifications
-- 0.2.4 : section restructuring, by Sean Purcell
-- 0.2.3 : clarified several details, by Sean Purcell
-- 0.2.2 : added predefined codes, by Johannes Rudolph
-- 0.2.1 : clarify field names, by Przemyslaw Skibinski
-- 0.2.0 : numerous format adjustments for zstd v0.8+
-- 0.1.2 : limit Huffman tree depth to 11 bits
-- 0.1.1 : reserved dictID ranges
-- 0.1.0 : initial release
diff --git a/priv/zstd/doc/zstd_manual.html b/priv/zstd/doc/zstd_manual.html
deleted file mode 100644
index da11ddb..0000000
--- a/priv/zstd/doc/zstd_manual.html
+++ /dev/null
@@ -1,1212 +0,0 @@
-
-
-
-zstd 1.3.3 Manual
-
-
-
zstd 1.3.3 Manual

-

-
Contents

-
    
-
  1. Introduction
    2. 
-
  2. Version
    3. 
-
  3. Simple API
    4. 
-
  4. Explicit memory management
    5. 
-
  5. Simple dictionary API
    6. 
-
  6. Bulk processing dictionary API
    7. 
-
  7. Streaming
    8. 
-
  8. Streaming compression - HowTo
    9. 
-
  9. Streaming decompression - HowTo
    10. 
-
  10. START OF ADVANCED AND EXPERIMENTAL FUNCTIONS
    11. 
-
  11. Advanced types
    12. 
-
  12. Custom memory allocation functions
    13. 
-
  13. Frame size functions
    14. 
-
  14. Context memory usage
    15. 
-
  15. Advanced compression functions
    16. 
-
  16. Advanced decompression functions
    17. 
-
  17. Advanced streaming functions
    18. 
-
  18. Buffer-less and synchronous inner streaming functions
    19. 
-
  19. Buffer-less streaming compression (synchronous mode)
    20. 
-
  20. Buffer-less streaming decompression (synchronous mode)
    21. 
-
  21. New advanced API (experimental)
    22. 
-
  22. Block level API
    23. 
-

-

-
Introduction
-  zstd, short for Zstandard, is a fast lossless compression algorithm,
-  targeting real-time compression scenarios at zlib-level and better compression ratios.
-  The zstd compression library provides in-memory compression and decompression functions.
-  The library supports compression levels from 1 up to ZSTD_maxCLevel() which is currently 22.
-  Levels >= 20, labeled `--ultra`, should be used with caution, as they require more memory.
-  Compression can be done in:
-    - a single step (described as Simple API)
-    - a single step, reusing a context (described as Explicit memory management)
-    - unbounded multiple steps (described as Streaming compression)
-  The compression ratio achievable on small data can be highly improved using a dictionary in:
-    - a single step (described as Simple dictionary API)
-    - a single step, reusing a dictionary (described as Fast dictionary API)
-
-  Advanced experimental functions can be accessed using #define ZSTD_STATIC_LINKING_ONLY before including zstd.h.
-  Advanced experimental APIs shall never be used with a dynamic library.
-  They are not "stable", their definition may change in the future. Only static linking is allowed.
-

-
-
Version

-
-
unsigned ZSTD_versionNumber(void);   /**< useful to check dll version */
-


-
Simple API

-
-
size_t ZSTD_compress( void* dst, size_t dstCapacity,
-                const void* src, size_t srcSize,
-                      int compressionLevel);
-
  Compresses `src` content as a single zstd compressed frame into already allocated `dst`.
-  Hint : compression runs faster if `dstCapacity` >=  `ZSTD_compressBound(srcSize)`.
-  @return : compressed size written into `dst` (<= `dstCapacity),
-            or an error code if it fails (which can be tested using ZSTD_isError()). 
-


-
-
size_t ZSTD_decompress( void* dst, size_t dstCapacity,
-                  const void* src, size_t compressedSize);
-
  `compressedSize` : must be the _exact_ size of some number of compressed and/or skippable frames.
-  `dstCapacity` is an upper bound of originalSize to regenerate.
-  If user cannot imply a maximum upper bound, it's better to use streaming mode to decompress data.
-  @return : the number of bytes decompressed into `dst` (<= `dstCapacity`),
-            or an errorCode if it fails (which can be tested using ZSTD_isError()). 
-


-
-
#define ZSTD_CONTENTSIZE_UNKNOWN (0ULL - 1)
-#define ZSTD_CONTENTSIZE_ERROR   (0ULL - 2)
-unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize);
-
  `src` should point to the start of a ZSTD encoded frame.
-  `srcSize` must be at least as large as the frame header.
-            hint : any size >= `ZSTD_frameHeaderSize_max` is large enough.
-  @return : - decompressed size of the frame in `src`, if known
-            - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
-            - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small)
-   note 1 : a 0 return value means the frame is valid but "empty".
-   note 2 : decompressed size is an optional field, it may not be present, typically in streaming mode.
-            When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.
-            In which case, it's necessary to use streaming mode to decompress data.
-            Optionally, application can rely on some implicit limit,
-            as ZSTD_decompress() only needs an upper bound of decompressed size.
-            (For example, data could be necessarily cut into blocks <= 16 KB).
-   note 3 : decompressed size is always present when compression is done with ZSTD_compress()
-   note 4 : decompressed size can be very large (64-bits value),
-            potentially larger than what local system can handle as a single memory segment.
-            In which case, it's necessary to use streaming mode to decompress data.
-   note 5 : If source is untrusted, decompressed size could be wrong or intentionally modified.
-            Always ensure return value fits within application's authorized limits.
-            Each application can set its own limits.
-   note 6 : This function replaces ZSTD_getDecompressedSize() 
-


-
-
unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize);
-
  NOTE: This function is now obsolete, in favor of ZSTD_getFrameContentSize().
-  Both functions work the same way,
-  but ZSTD_getDecompressedSize() blends
-  "empty", "unknown" and "error" results in the same return value (0),
-  while ZSTD_getFrameContentSize() distinguishes them.
-
-  'src' is the start of a zstd compressed frame.
-  @return : content size to be decompressed, as a 64-bits value _if known and not empty_, 0 otherwise. 
-


-
-
Helper functions
#define ZSTD_COMPRESSBOUND(srcSize)   ((srcSize) + ((srcSize)>>8) + (((srcSize) < (128<<10)) ? (((128<<10) - (srcSize)) >> 11) /* margin, from 64 to 0 */ : 0))  /* this formula ensures that bound(A) + bound(B) <= bound(A+B) as long as A and B >= 128 KB */
-size_t      ZSTD_compressBound(size_t srcSize); /*!< maximum compressed size in worst case scenario */
-unsigned    ZSTD_isError(size_t code);          /*!< tells if a `size_t` function result is an error code */
-const char* ZSTD_getErrorName(size_t code);     /*!< provides readable string from an error code */
-int         ZSTD_maxCLevel(void);               /*!< maximum compression level available */
-


-
Explicit memory management

-
-
Compression context
  When compressing many times,
-  it is recommended to allocate a context just once, and re-use it for each successive compression operation.
-  This will make workload friendlier for system's memory.
-  Use one context per thread for parallel execution in multi-threaded environments. 
-
typedef struct ZSTD_CCtx_s ZSTD_CCtx;
-ZSTD_CCtx* ZSTD_createCCtx(void);
-size_t     ZSTD_freeCCtx(ZSTD_CCtx* cctx);
-


-
size_t ZSTD_compressCCtx(ZSTD_CCtx* ctx,
-                         void* dst, size_t dstCapacity,
-                   const void* src, size_t srcSize,
-                         int compressionLevel);
-
  Same as ZSTD_compress(), requires an allocated ZSTD_CCtx (see ZSTD_createCCtx()). 
-


-
-
Decompression context
  When decompressing many times,
-  it is recommended to allocate a context only once,
-  and re-use it for each successive compression operation.
-  This will make workload friendlier for system's memory.
-  Use one context per thread for parallel execution. 
-
typedef struct ZSTD_DCtx_s ZSTD_DCtx;
-ZSTD_DCtx* ZSTD_createDCtx(void);
-size_t     ZSTD_freeDCtx(ZSTD_DCtx* dctx);
-


-
size_t ZSTD_decompressDCtx(ZSTD_DCtx* ctx,
-                           void* dst, size_t dstCapacity,
-                     const void* src, size_t srcSize);
-
  Same as ZSTD_decompress(), requires an allocated ZSTD_DCtx (see ZSTD_createDCtx()) 
-


-
-
Simple dictionary API

-
-
size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const void* dict,size_t dictSize,
-                               int compressionLevel);
-
  Compression using a predefined Dictionary (see dictBuilder/zdict.h).
-  Note : This function loads the dictionary, resulting in significant startup delay.
-  Note : When `dict == NULL || dictSize < 8` no dictionary is used. 
-


-
-
size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
-                                 void* dst, size_t dstCapacity,
-                           const void* src, size_t srcSize,
-                           const void* dict,size_t dictSize);
-
  Decompression using a predefined Dictionary (see dictBuilder/zdict.h).
-  Dictionary must be identical to the one used during compression.
-  Note : This function loads the dictionary, resulting in significant startup delay.
-  Note : When `dict == NULL || dictSize < 8` no dictionary is used. 
-


-
-
Bulk processing dictionary API

-
-
ZSTD_CDict* ZSTD_createCDict(const void* dictBuffer, size_t dictSize,
-                             int compressionLevel);
-
  When compressing multiple messages / blocks with the same dictionary, it's recommended to load it just once.
-  ZSTD_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
-  ZSTD_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only.
-  `dictBuffer` can be released after ZSTD_CDict creation, since its content is copied within CDict 
-


-
-
size_t      ZSTD_freeCDict(ZSTD_CDict* CDict);
-
  Function frees memory allocated by ZSTD_createCDict(). 
-


-
-
size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
-                                void* dst, size_t dstCapacity,
-                          const void* src, size_t srcSize,
-                          const ZSTD_CDict* cdict);
-
  Compression using a digested Dictionary.
-  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
-  Note that compression level is decided during dictionary creation.
-  Frame parameters are hardcoded (dictID=yes, contentSize=yes, checksum=no) 
-


-
-
ZSTD_DDict* ZSTD_createDDict(const void* dictBuffer, size_t dictSize);
-
  Create a digested dictionary, ready to start decompression operation without startup delay.
-  dictBuffer can be released after DDict creation, as its content is copied inside DDict 
-


-
-
size_t      ZSTD_freeDDict(ZSTD_DDict* ddict);
-
  Function frees memory allocated with ZSTD_createDDict() 
-


-
-
size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
-                                  void* dst, size_t dstCapacity,
-                            const void* src, size_t srcSize,
-                            const ZSTD_DDict* ddict);
-
  Decompression using a digested Dictionary.
-  Faster startup than ZSTD_decompress_usingDict(), recommended when same dictionary is used multiple times. 
-


-
-
Streaming

-
-
typedef struct ZSTD_inBuffer_s {
-  const void* src;    /**< start of input buffer */
-  size_t size;        /**< size of input buffer */
-  size_t pos;         /**< position where reading stopped. Will be updated. Necessarily 0 <= pos <= size */
-} ZSTD_inBuffer;
-


-
typedef struct ZSTD_outBuffer_s {
-  void*  dst;         /**< start of output buffer */
-  size_t size;        /**< size of output buffer */
-  size_t pos;         /**< position where writing stopped. Will be updated. Necessarily 0 <= pos <= size */
-} ZSTD_outBuffer;
-


-
Streaming compression - HowTo
-  A ZSTD_CStream object is required to track streaming operation.
-  Use ZSTD_createCStream() and ZSTD_freeCStream() to create/release resources.
-  ZSTD_CStream objects can be reused multiple times on consecutive compression operations.
-  It is recommended to re-use ZSTD_CStream in situations where many streaming operations will be achieved consecutively,
-  since it will play nicer with system's memory, by re-using already allocated memory.
-  Use one separate ZSTD_CStream per thread for parallel execution.
-
-  Start a new compression by initializing ZSTD_CStream.
-  Use ZSTD_initCStream() to start a new compression operation.
-  Use ZSTD_initCStream_usingDict() or ZSTD_initCStream_usingCDict() for a compression which requires a dictionary (experimental section)
-
-  Use ZSTD_compressStream() repetitively to consume input stream.
-  The function will automatically update both `pos` fields.
-  Note that it may not consume the entire input, in which case `pos < size`,
-  and it's up to the caller to present again remaining data.
-  @return : a size hint, preferred nb of bytes to use as input for next function call
-            or an error code, which can be tested using ZSTD_isError().
-            Note 1 : it's just a hint, to help latency a little, any other value will work fine.
-            Note 2 : size hint is guaranteed to be <= ZSTD_CStreamInSize()
-
-  At any moment, it's possible to flush whatever data remains within internal buffer, using ZSTD_flushStream().
-  `output->pos` will be updated.
-  Note that some content might still be left within internal buffer if `output->size` is too small.
-  @return : nb of bytes still present within internal buffer (0 if it's empty)
-            or an error code, which can be tested using ZSTD_isError().
-
-  ZSTD_endStream() instructs to finish a frame.
-  It will perform a flush and write frame epilogue.
-  The epilogue is required for decoders to consider a frame completed.
-  ZSTD_endStream() may not be able to flush full data if `output->size` is too small.
-  In which case, call again ZSTD_endStream() to complete the flush.
-  @return : 0 if frame fully completed and fully flushed,
-             or >0 if some data is still present within internal buffer
-                  (value is minimum size estimation for remaining data to flush, but it could be more)
-            or an error code, which can be tested using ZSTD_isError().
-
- 
-

-
-
typedef ZSTD_CCtx ZSTD_CStream;  /**< CCtx and CStream are now effectively same object (>= v1.3.0) */
-


-
ZSTD_CStream management functions
ZSTD_CStream* ZSTD_createCStream(void);
-size_t ZSTD_freeCStream(ZSTD_CStream* zcs);
-


-
Streaming compression functions
size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel);
-size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
-size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
-size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output);
-


-
size_t ZSTD_CStreamInSize(void);    /**< recommended size for input buffer */
-


-
size_t ZSTD_CStreamOutSize(void);   /**< recommended size for output buffer. Guarantee to successfully flush at least one complete compressed block in all circumstances. */
-


-
Streaming decompression - HowTo
-  A ZSTD_DStream object is required to track streaming operations.
-  Use ZSTD_createDStream() and ZSTD_freeDStream() to create/release resources.
-  ZSTD_DStream objects can be re-used multiple times.
-
-  Use ZSTD_initDStream() to start a new decompression operation,
-   or ZSTD_initDStream_usingDict() if decompression requires a dictionary.
-   @return : recommended first input size
-
-  Use ZSTD_decompressStream() repetitively to consume your input.
-  The function will update both `pos` fields.
-  If `input.pos < input.size`, some input has not been consumed.
-  It's up to the caller to present again remaining data.
-  If `output.pos < output.size`, decoder has flushed everything it could.
-  @return : 0 when a frame is completely decoded and fully flushed,
-            an error code, which can be tested using ZSTD_isError(),
-            any other value > 0, which means there is still some decoding to do to complete current frame.
-            The return value is a suggested next input size (a hint to improve latency) that will never load more than the current frame.
- 
-

-
-
typedef ZSTD_DCtx ZSTD_DStream;  /**< DCtx and DStream are now effectively same object (>= v1.3.0) */
-


-
ZSTD_DStream management functions
ZSTD_DStream* ZSTD_createDStream(void);
-size_t ZSTD_freeDStream(ZSTD_DStream* zds);
-


-
Streaming decompression functions
size_t ZSTD_initDStream(ZSTD_DStream* zds);
-size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
-


-
size_t ZSTD_DStreamInSize(void);    /*!< recommended size for input buffer */
-


-
size_t ZSTD_DStreamOutSize(void);   /*!< recommended size for output buffer. Guarantee to successfully flush at least one complete block in all circumstances. */
-


-
START OF ADVANCED AND EXPERIMENTAL FUNCTIONS
 The definitions in this section are considered experimental.
- They should never be used with a dynamic library, as prototypes may change in the future.
- They are provided for advanced scenarios.
- Use them only in association with static linking.
- 
-

-
-
Advanced types

-
-
typedef enum { ZSTD_fast=1, ZSTD_dfast, ZSTD_greedy, ZSTD_lazy, ZSTD_lazy2,
-               ZSTD_btlazy2, ZSTD_btopt, ZSTD_btultra } ZSTD_strategy;   /* from faster to stronger */
-


-
typedef struct {
-    unsigned windowLog;      /**< largest match distance : larger == more compression, more memory needed during decompression */
-    unsigned chainLog;       /**< fully searched segment : larger == more compression, slower, more memory (useless for fast) */
-    unsigned hashLog;        /**< dispatch table : larger == faster, more memory */
-    unsigned searchLog;      /**< nb of searches : larger == more compression, slower */
-    unsigned searchLength;   /**< match length searched : larger == faster decompression, sometimes less compression */
-    unsigned targetLength;   /**< acceptable match size for optimal parser (only) : larger == more compression, slower */
-    ZSTD_strategy strategy;
-} ZSTD_compressionParameters;
-


-
typedef struct {
-    unsigned contentSizeFlag; /**< 1: content size will be in frame header (when known) */
-    unsigned checksumFlag;    /**< 1: generate a 32-bits checksum at end of frame, for error detection */
-    unsigned noDictIDFlag;    /**< 1: no dictID will be saved into frame header (if dictionary compression) */
-} ZSTD_frameParameters;
-


-
typedef struct {
-    ZSTD_compressionParameters cParams;
-    ZSTD_frameParameters fParams;
-} ZSTD_parameters;
-


-
Custom memory allocation functions

-
-
typedef struct { ZSTD_allocFunction customAlloc; ZSTD_freeFunction customFree; void* opaque; } ZSTD_customMem;
-


-
Frame size functions

-
-
size_t ZSTD_findFrameCompressedSize(const void* src, size_t srcSize);
-
  `src` should point to the start of a ZSTD encoded frame or skippable frame
-  `srcSize` must be >= first frame size
-  @return : the compressed size of the first frame starting at `src`,
-            suitable to pass to `ZSTD_decompress` or similar,
-            or an error code if input is invalid 
-


-
-
unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize);
-
  `src` should point the start of a series of ZSTD encoded and/or skippable frames
-  `srcSize` must be the _exact_ size of this series
-       (i.e. there should be a frame boundary exactly at `srcSize` bytes after `src`)
-  @return : - decompressed size of all data in all successive frames
-            - if the decompressed size cannot be determined: ZSTD_CONTENTSIZE_UNKNOWN
-            - if an error occurred: ZSTD_CONTENTSIZE_ERROR
-
-   note 1 : decompressed size is an optional field, that may not be present, especially in streaming mode.
-            When `return==ZSTD_CONTENTSIZE_UNKNOWN`, data to decompress could be any size.
-            In which case, it's necessary to use streaming mode to decompress data.
-   note 2 : decompressed size is always present when compression is done with ZSTD_compress()
-   note 3 : decompressed size can be very large (64-bits value),
-            potentially larger than what local system can handle as a single memory segment.
-            In which case, it's necessary to use streaming mode to decompress data.
-   note 4 : If source is untrusted, decompressed size could be wrong or intentionally modified.
-            Always ensure result fits within application's authorized limits.
-            Each application can set its own limits.
-   note 5 : ZSTD_findDecompressedSize handles multiple frames, and so it must traverse the input to
-            read each contained frame header.  This is fast as most of the data is skipped,
-            however it does mean that all frame data must be present and valid. 
-


-
-
size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize);
-
   `src` should point to the start of a ZSTD frame
-   `srcSize` must be >= ZSTD_frameHeaderSize_prefix.
-   @return : size of the Frame Header 
-


-
-
Context memory usage

-
-
size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx);
-size_t ZSTD_sizeof_DCtx(const ZSTD_DCtx* dctx);
-size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs);
-size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds);
-size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict);
-size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict);
-
  These functions give the current memory usage of selected object.
-  Object memory usage can evolve when re-used multiple times. 
-


-
-
size_t ZSTD_estimateCCtxSize(int compressionLevel);
-size_t ZSTD_estimateCCtxSize_usingCParams(ZSTD_compressionParameters cParams);
-size_t ZSTD_estimateCCtxSize_usingCCtxParams(const ZSTD_CCtx_params* params);
-size_t ZSTD_estimateDCtxSize(void);
-
  These functions make it possible to estimate memory usage
-  of a future {D,C}Ctx, before its creation.
-  ZSTD_estimateCCtxSize() will provide a budget large enough for any compression level up to selected one.
-  It will also consider src size to be arbitrarily "large", which is worst case.
-  If srcSize is known to always be small, ZSTD_estimateCCtxSize_usingCParams() can provide a tighter estimation.
-  ZSTD_estimateCCtxSize_usingCParams() can be used in tandem with ZSTD_getCParams() to create cParams from compressionLevel.
-  ZSTD_estimateCCtxSize_usingCCtxParams() can be used in tandem with ZSTD_CCtxParam_setParameter(). Only single-threaded compression is supported. This function will return an error code if ZSTD_p_nbThreads is > 1.
-  Note : CCtx estimation is only correct for single-threaded compression 
-


-
-
size_t ZSTD_estimateCStreamSize(int compressionLevel);
-size_t ZSTD_estimateCStreamSize_usingCParams(ZSTD_compressionParameters cParams);
-size_t ZSTD_estimateCStreamSize_usingCCtxParams(const ZSTD_CCtx_params* params);
-size_t ZSTD_estimateDStreamSize(size_t windowSize);
-size_t ZSTD_estimateDStreamSize_fromFrame(const void* src, size_t srcSize);
-
  ZSTD_estimateCStreamSize() will provide a budget large enough for any compression level up to selected one.
-  It will also consider src size to be arbitrarily "large", which is worst case.
-  If srcSize is known to always be small, ZSTD_estimateCStreamSize_usingCParams() can provide a tighter estimation.
-  ZSTD_estimateCStreamSize_usingCParams() can be used in tandem with ZSTD_getCParams() to create cParams from compressionLevel.
-  ZSTD_estimateCStreamSize_usingCCtxParams() can be used in tandem with ZSTD_CCtxParam_setParameter(). Only single-threaded compression is supported. This function will return an error code if ZSTD_p_nbThreads is set to a value > 1.
-  Note : CStream estimation is only correct for single-threaded compression.
-  ZSTD_DStream memory budget depends on window Size.
-  This information can be passed manually, using ZSTD_estimateDStreamSize,
-  or deducted from a valid frame Header, using ZSTD_estimateDStreamSize_fromFrame();
-  Note : if streaming is init with function ZSTD_init?Stream_usingDict(),
-         an internal ?Dict will be created, which additional size is not estimated here.
-         In this case, get total size by adding ZSTD_estimate?DictSize 
-


-
-
typedef enum {
-    ZSTD_dlm_byCopy = 0,     /**< Copy dictionary content internally */
-    ZSTD_dlm_byRef,          /**< Reference dictionary content -- the dictionary buffer must outlive its users. */
-} ZSTD_dictLoadMethod_e;
-


-
size_t ZSTD_estimateCDictSize(size_t dictSize, int compressionLevel);
-size_t ZSTD_estimateCDictSize_advanced(size_t dictSize, ZSTD_compressionParameters cParams, ZSTD_dictLoadMethod_e dictLoadMethod);
-size_t ZSTD_estimateDDictSize(size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod);
-
  ZSTD_estimateCDictSize() will bet that src size is relatively "small", and content is copied, like ZSTD_createCDict().
-  ZSTD_estimateCStreamSize_advanced_usingCParams() makes it possible to control precisely compression parameters, like ZSTD_createCDict_advanced().
-  Note : dictionary created by reference using ZSTD_dlm_byRef are smaller
- 
-


-
-
Advanced compression functions

-
-
ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem);
-
  Create a ZSTD compression context using external alloc and free functions 
-


-
-
ZSTD_CCtx* ZSTD_initStaticCCtx(void* workspace, size_t workspaceSize);
-
  workspace: The memory area to emplace the context into.
-             Provided pointer must 8-bytes aligned.
-             It must outlive context usage.
-  workspaceSize: Use ZSTD_estimateCCtxSize() or ZSTD_estimateCStreamSize()
-                 to determine how large workspace must be to support scenario.
- @return : pointer to ZSTD_CCtx* (same address as workspace, but different type),
-           or NULL if error (typically size too small)
-  Note : zstd will never resize nor malloc() when using a static cctx.
-         If it needs more memory than available, it will simply error out.
-  Note 2 : there is no corresponding "free" function.
-           Since workspace was allocated externally, it must be freed externally too.
-  Limitation 1 : currently not compatible with internal CDict creation, such as
-                 ZSTD_CCtx_loadDictionary() or ZSTD_initCStream_usingDict().
-  Limitation 2 : currently not compatible with multi-threading
- 
-


-
-
ZSTD_CDict* ZSTD_createCDict_byReference(const void* dictBuffer, size_t dictSize, int compressionLevel);
-
  Create a digested dictionary for compression
-  Dictionary content is simply referenced, and therefore stays in dictBuffer.
-  It is important that dictBuffer outlives CDict, it must remain read accessible throughout the lifetime of CDict 
-


-
-
typedef enum { ZSTD_dm_auto=0,        /* dictionary is "full" if it starts with ZSTD_MAGIC_DICTIONARY, otherwise it is "rawContent" */
-               ZSTD_dm_rawContent,    /* ensures dictionary is always loaded as rawContent, even if it starts with ZSTD_MAGIC_DICTIONARY */
-               ZSTD_dm_fullDict       /* refuses to load a dictionary if it does not respect Zstandard's specification */
-} ZSTD_dictMode_e;
-


-
ZSTD_CDict* ZSTD_createCDict_advanced(const void* dict, size_t dictSize,
-                                      ZSTD_dictLoadMethod_e dictLoadMethod,
-                                      ZSTD_dictMode_e dictMode,
-                                      ZSTD_compressionParameters cParams,
-                                      ZSTD_customMem customMem);
-
  Create a ZSTD_CDict using external alloc and free, and customized compression parameters 
-


-
-
ZSTD_CDict* ZSTD_initStaticCDict(
-                void* workspace, size_t workspaceSize,
-          const void* dict, size_t dictSize,
-                ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictMode_e dictMode,
-                ZSTD_compressionParameters cParams);
-
  Generate a digested dictionary in provided memory area.
-  workspace: The memory area to emplace the dictionary into.
-             Provided pointer must 8-bytes aligned.
-             It must outlive dictionary usage.
-  workspaceSize: Use ZSTD_estimateCDictSize()
-                 to determine how large workspace must be.
-  cParams : use ZSTD_getCParams() to transform a compression level
-            into its relevants cParams.
- @return : pointer to ZSTD_CDict* (same address as workspace, but different type),
-           or NULL if error (typically, size too small).
-  Note : there is no corresponding "free" function.
-         Since workspace was allocated externally, it must be freed externally.
- 
-


-
-
ZSTD_compressionParameters ZSTD_getCParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
-
   @return ZSTD_compressionParameters structure for a selected compression level and estimated srcSize.
-   `estimatedSrcSize` value is optional, select 0 if not known 
-


-
-
ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long estimatedSrcSize, size_t dictSize);
-
   same as ZSTD_getCParams(), but @return a full `ZSTD_parameters` object instead of sub-component `ZSTD_compressionParameters`.
-   All fields of `ZSTD_frameParameters` are set to default : contentSize=1, checksum=0, noDictID=0 
-


-
-
size_t ZSTD_checkCParams(ZSTD_compressionParameters params);
-
   Ensure param values remain within authorized range 
-


-
-
ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize);
-
  optimize params for a given `srcSize` and `dictSize`.
-  both values are optional, select `0` if unknown. 
-


-
-
size_t ZSTD_compress_advanced (ZSTD_CCtx* cctx,
-                      void* dst, size_t dstCapacity,
-                const void* src, size_t srcSize,
-                const void* dict,size_t dictSize,
-                      ZSTD_parameters params);
-
   Same as ZSTD_compress_usingDict(), with fine-tune control over each compression parameter 
-


-
-
size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
-                      void* dst, size_t dstCapacity,
-                const void* src, size_t srcSize,
-                const ZSTD_CDict* cdict, ZSTD_frameParameters fParams);
-
   Same as ZSTD_compress_usingCDict(), with fine-tune control over frame parameters 
-


-
-
Advanced decompression functions

-
-
unsigned ZSTD_isFrame(const void* buffer, size_t size);
-
  Tells if the content of `buffer` starts with a valid Frame Identifier.
-  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
-  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
-  Note 3 : Skippable Frame Identifiers are considered valid. 
-


-
-
ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem);
-
  Create a ZSTD decompression context using external alloc and free functions 
-


-
-
ZSTD_DCtx* ZSTD_initStaticDCtx(void* workspace, size_t workspaceSize);
-
  workspace: The memory area to emplace the context into.
-             Provided pointer must 8-bytes aligned.
-             It must outlive context usage.
-  workspaceSize: Use ZSTD_estimateDCtxSize() or ZSTD_estimateDStreamSize()
-                 to determine how large workspace must be to support scenario.
- @return : pointer to ZSTD_DCtx* (same address as workspace, but different type),
-           or NULL if error (typically size too small)
-  Note : zstd will never resize nor malloc() when using a static dctx.
-         If it needs more memory than available, it will simply error out.
-  Note 2 : static dctx is incompatible with legacy support
-  Note 3 : there is no corresponding "free" function.
-           Since workspace was allocated externally, it must be freed externally.
-  Limitation : currently not compatible with internal DDict creation,
-               such as ZSTD_initDStream_usingDict().
- 
-


-
-
ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize);
-
  Create a digested dictionary, ready to start decompression operation without startup delay.
-  Dictionary content is referenced, and therefore stays in dictBuffer.
-  It is important that dictBuffer outlives DDict,
-  it must remain read accessible throughout the lifetime of DDict 
-


-
-
ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize,
-                                      ZSTD_dictLoadMethod_e dictLoadMethod,
-                                      ZSTD_customMem customMem);
-
  Create a ZSTD_DDict using external alloc and free, optionally by reference 
-


-
-
ZSTD_DDict* ZSTD_initStaticDDict(void* workspace, size_t workspaceSize,
-                                 const void* dict, size_t dictSize,
-                                 ZSTD_dictLoadMethod_e dictLoadMethod);
-
  Generate a digested dictionary in provided memory area.
-  workspace: The memory area to emplace the dictionary into.
-             Provided pointer must 8-bytes aligned.
-             It must outlive dictionary usage.
-  workspaceSize: Use ZSTD_estimateDDictSize()
-                 to determine how large workspace must be.
- @return : pointer to ZSTD_DDict*, or NULL if error (size too small)
-  Note : there is no corresponding "free" function.
-         Since workspace was allocated externally, it must be freed externally.
- 
-


-
-
unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize);
-
  Provides the dictID stored within dictionary.
-  if @return == 0, the dictionary is not conformant with Zstandard specification.
-  It can still be loaded, but as a content-only dictionary. 
-


-
-
unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict);
-
  Provides the dictID of the dictionary loaded into `ddict`.
-  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
-  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. 
-


-
-
unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize);
-
  Provides the dictID required to decompressed the frame stored within `src`.
-  If @return == 0, the dictID could not be decoded.
-  This could for one of the following reasons :
-  - The frame does not require a dictionary to be decoded (most common case).
-  - The frame was built with dictID intentionally removed. Whatever dictionary is necessary is a hidden information.
-    Note : this use case also happens when using a non-conformant dictionary.
-  - `srcSize` is too small, and as a result, the frame header could not be decoded (only possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`).
-  - This is not a Zstandard frame.
-  When identifying the exact failure cause, it's possible to use ZSTD_getFrameHeader(), which will provide a more precise error code. 
-


-
-
Advanced streaming functions

-
-
Advanced Streaming compression functions
ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem);
-ZSTD_CStream* ZSTD_initStaticCStream(void* workspace, size_t workspaceSize);    /**< same as ZSTD_initStaticCCtx() */
-size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pledgedSrcSize);   /**< pledgedSrcSize must be correct. If it is not known at init time, use ZSTD_CONTENTSIZE_UNKNOWN. Note that, for compatibility with older programs, "0" also disables frame content size field. It may be enabled in the future. */
-size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel); /**< creates of an internal CDict (incompatible with static CCtx), except if dict == NULL or dictSize < 8, in which case no dict is used. Note: dict is loaded with ZSTD_dm_auto (treated as a full zstd dictionary if it begins with ZSTD_MAGIC_DICTIONARY, else as raw content) and ZSTD_dlm_byCopy.*/
-size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs, const void* dict, size_t dictSize,
-                                             ZSTD_parameters params, unsigned long long pledgedSrcSize);  /**< pledgedSrcSize must be correct. If srcSize is not known at init time, use value ZSTD_CONTENTSIZE_UNKNOWN. dict is loaded with ZSTD_dm_auto and ZSTD_dlm_byCopy. */
-size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict);  /**< note : cdict will just be referenced, and must outlive compression session */
-size_t ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs, const ZSTD_CDict* cdict, ZSTD_frameParameters fParams, unsigned long long pledgedSrcSize);  /**< same as ZSTD_initCStream_usingCDict(), with control over frame parameters. pledgedSrcSize must be correct. If srcSize is not known at init time, use value ZSTD_CONTENTSIZE_UNKNOWN. */
-


-
size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize);
-
  start a new compression job, using same parameters from previous job.
-  This is typically useful to skip dictionary loading stage, since it will re-use it in-place..
-  Note that zcs must be init at least once before using ZSTD_resetCStream().
-  If pledgedSrcSize is not known at reset time, use macro ZSTD_CONTENTSIZE_UNKNOWN.
-  If pledgedSrcSize > 0, its value must be correct, as it will be written in header, and controlled at the end.
-  For the time being, pledgedSrcSize==0 is interpreted as "srcSize unknown" for compatibility with older programs,
-  but it may change to mean "empty" in some future version, so prefer using macro ZSTD_CONTENTSIZE_UNKNOWN.
- @return : 0, or an error code (which can be tested using ZSTD_isError()) 
-


-
-
Advanced Streaming decompression functions
ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem);
-ZSTD_DStream* ZSTD_initStaticDStream(void* workspace, size_t workspaceSize);    /**< same as ZSTD_initStaticDCtx() */
-typedef enum { DStream_p_maxWindowSize } ZSTD_DStreamParameter_e;
-size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds, ZSTD_DStreamParameter_e paramType, unsigned paramValue);   /* obsolete : this API will be removed in a future version */
-size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize); /**< note: no dictionary will be used if dict == NULL or dictSize < 8 */
-size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict);  /**< note : ddict is referenced, it must outlive decompression session */
-size_t ZSTD_resetDStream(ZSTD_DStream* zds);  /**< re-use decompression parameters from previous init; saves dictionary loading */
-


-
Buffer-less and synchronous inner streaming functions
-  This is an advanced API, giving full control over buffer management, for users which need direct control over memory.
-  But it's also a complex one, with several restrictions, documented below.
-  Prefer normal streaming API for an easier experience.
- 
-

-
-
Buffer-less streaming compression (synchronous mode)
-  A ZSTD_CCtx object is required to track streaming operations.
-  Use ZSTD_createCCtx() / ZSTD_freeCCtx() to manage resource.
-  ZSTD_CCtx object can be re-used multiple times within successive compression operations.
-
-  Start by initializing a context.
-  Use ZSTD_compressBegin(), or ZSTD_compressBegin_usingDict() for dictionary compression,
-  or ZSTD_compressBegin_advanced(), for finer parameter control.
-  It's also possible to duplicate a reference context which has already been initialized, using ZSTD_copyCCtx()
-
-  Then, consume your input using ZSTD_compressContinue().
-  There are some important considerations to keep in mind when using this advanced function :
-  - ZSTD_compressContinue() has no internal buffer. It uses externally provided buffers only.
-  - Interface is synchronous : input is consumed entirely and produces 1+ compressed blocks.
-  - Caller must ensure there is enough space in `dst` to store compressed data under worst case scenario.
-    Worst case evaluation is provided by ZSTD_compressBound().
-    ZSTD_compressContinue() doesn't guarantee recover after a failed compression.
-  - ZSTD_compressContinue() presumes prior input ***is still accessible and unmodified*** (up to maximum distance size, see WindowLog).
-    It remembers all previous contiguous blocks, plus one separated memory segment (which can itself consists of multiple contiguous blocks)
-  - ZSTD_compressContinue() detects that prior input has been overwritten when `src` buffer overlaps.
-    In which case, it will "discard" the relevant memory section from its history.
-
-  Finish a frame with ZSTD_compressEnd(), which will write the last block(s) and optional checksum.
-  It's possible to use srcSize==0, in which case, it will write a final empty block to end the frame.
-  Without last block mark, frames are considered unfinished (hence corrupted) by compliant decoders.
-
-  `ZSTD_CCtx` object can be re-used (ZSTD_compressBegin()) to compress again.
-

-
-
Buffer-less streaming compression functions
size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel);
-size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
-size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_parameters params, unsigned long long pledgedSrcSize); /**< pledgedSrcSize : If srcSize is not known at init time, use ZSTD_CONTENTSIZE_UNKNOWN */
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict); /**< note: fails if cdict==NULL */
-size_t ZSTD_compressBegin_usingCDict_advanced(ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict, ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize);   /* compression parameters are already set within cdict. pledgedSrcSize must be correct. If srcSize is not known, use macro ZSTD_CONTENTSIZE_UNKNOWN */
-size_t ZSTD_copyCCtx(ZSTD_CCtx* cctx, const ZSTD_CCtx* preparedCCtx, unsigned long long pledgedSrcSize); /**<  note: if pledgedSrcSize is not known, use ZSTD_CONTENTSIZE_UNKNOWN */
-


-
Buffer-less streaming decompression (synchronous mode)
-  A ZSTD_DCtx object is required to track streaming operations.
-  Use ZSTD_createDCtx() / ZSTD_freeDCtx() to manage it.
-  A ZSTD_DCtx object can be re-used multiple times.
-
-  First typical operation is to retrieve frame parameters, using ZSTD_getFrameHeader().
-  Frame header is extracted from the beginning of compressed frame, so providing only the frame's beginning is enough.
-  Data fragment must be large enough to ensure successful decoding.
- `ZSTD_frameHeaderSize_max` bytes is guaranteed to always be large enough.
-  @result : 0 : successful decoding, the `ZSTD_frameHeader` structure is correctly filled.
-           >0 : `srcSize` is too small, please provide at least @result bytes on next attempt.
-           errorCode, which can be tested using ZSTD_isError().
-
-  It fills a ZSTD_frameHeader structure with important information to correctly decode the frame,
-  such as the dictionary ID, content size, or maximum back-reference distance (`windowSize`).
-  Note that these values could be wrong, either because of data corruption, or because a 3rd party deliberately spoofs false information.
-  As a consequence, check that values remain within valid application range.
-  For example, do not allocate memory blindly, check that `windowSize` is within expectation.
-  Each application can set its own limits, depending on local restrictions.
-  For extended interoperability, it is recommended to support `windowSize` of at least 8 MB.
-
-  ZSTD_decompressContinue() needs previous data blocks during decompression, up to `windowSize` bytes.
-  ZSTD_decompressContinue() is very sensitive to contiguity,
-  if 2 blocks don't follow each other, make sure that either the compressor breaks contiguity at the same place,
-  or that previous contiguous segment is large enough to properly handle maximum back-reference distance.
-  There are multiple ways to guarantee this condition.
-
-  The most memory efficient way is to use a round buffer of sufficient size.
-  Sufficient size is determined by invoking ZSTD_decodingBufferSize_min(),
-  which can @return an error code if required value is too large for current system (in 32-bits mode).
-  In a round buffer methodology, ZSTD_decompressContinue() decompresses each block next to previous one,
-  up to the moment there is not enough room left in the buffer to guarantee decoding another full block,
-  which maximum size is provided in `ZSTD_frameHeader` structure, field `blockSizeMax`.
-  At which point, decoding can resume from the beginning of the buffer.
-  Note that already decoded data stored in the buffer should be flushed before being overwritten.
-
-  There are alternatives possible, for example using two or more buffers of size `windowSize` each, though they consume more memory.
-
-  Finally, if you control the compression process, you can also ignore all buffer size rules,
-  as long as the encoder and decoder progress in "lock-step",
-  aka use exactly the same buffer sizes, break contiguity at the same place, etc.
-
-  Once buffers are setup, start decompression, with ZSTD_decompressBegin().
-  If decompression requires a dictionary, use ZSTD_decompressBegin_usingDict() or ZSTD_decompressBegin_usingDDict().
-
-  Then use ZSTD_nextSrcSizeToDecompress() and ZSTD_decompressContinue() alternatively.
-  ZSTD_nextSrcSizeToDecompress() tells how many bytes to provide as 'srcSize' to ZSTD_decompressContinue().
-  ZSTD_decompressContinue() requires this _exact_ amount of bytes, or it will fail.
-
- @result of ZSTD_decompressContinue() is the number of bytes regenerated within 'dst' (necessarily <= dstCapacity).
-  It can be zero : it just means ZSTD_decompressContinue() has decoded some metadata item.
-  It can also be an error code, which can be tested with ZSTD_isError().
-
-  A frame is fully decoded when ZSTD_nextSrcSizeToDecompress() returns zero.
-  Context can then be reset to start a new decompression.
-
-  Note : it's possible to know if next input to present is a header or a block, using ZSTD_nextInputType().
-  This information is not required to properly decode a frame.
-
-  == Special case : skippable frames 
-
-  Skippable frames allow integration of user-defined data into a flow of concatenated frames.
-  Skippable frames will be ignored (skipped) by decompressor.
-  The format of skippable frames is as follows :
-  a) Skippable frame ID - 4 Bytes, Little endian format, any value from 0x184D2A50 to 0x184D2A5F
-  b) Frame Size - 4 Bytes, Little endian format, unsigned 32-bits
-  c) Frame Content - any content (User Data) of length equal to Frame Size
-  For skippable frames ZSTD_getFrameHeader() returns zfhPtr->frameType==ZSTD_skippableFrame.
-  For skippable frames ZSTD_decompressContinue() always returns 0 : it only skips the content.
-

-
-
Buffer-less streaming decompression functions
typedef enum { ZSTD_frame, ZSTD_skippableFrame } ZSTD_frameType_e;
-typedef struct {
-    unsigned long long frameContentSize; /* if == ZSTD_CONTENTSIZE_UNKNOWN, it means this field is not available. 0 means "empty" */
-    unsigned long long windowSize;       /* can be very large, up to <= frameContentSize */
-    unsigned blockSizeMax;
-    ZSTD_frameType_e frameType;          /* if == ZSTD_skippableFrame, frameContentSize is the size of skippable content */
-    unsigned headerSize;
-    unsigned dictID;
-    unsigned checksumFlag;
-} ZSTD_frameHeader;
-size_t ZSTD_getFrameHeader(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize);   /**< doesn't consume input */
-size_t ZSTD_decodingBufferSize_min(unsigned long long windowSize, unsigned long long frameContentSize);  /**< when frame content size is not known, pass in frameContentSize == ZSTD_CONTENTSIZE_UNKNOWN */
-


-
typedef enum { ZSTDnit_frameHeader, ZSTDnit_blockHeader, ZSTDnit_block, ZSTDnit_lastBlock, ZSTDnit_checksum, ZSTDnit_skippableFrame } ZSTD_nextInputType_e;
-


-
New advanced API (experimental)

-
-
typedef enum {
-    /* Question : should we have a format ZSTD_f_auto ?
-     * For the time being, it would mean exactly the same as ZSTD_f_zstd1.
-     * But, in the future, should several formats be supported,
-     * on the compression side, it would mean "default format".
-     * On the decompression side, it would mean "multi format",
-     * and ZSTD_f_zstd1 could be reserved to mean "accept *only* zstd frames".
-     * Since meaning is a little different, another option could be to define different enums for compression and decompression.
-     * This question could be kept for later, when there are actually multiple formats to support,
-     * but there is also the question of pinning enum values, and pinning value `0` is especially important */
-    ZSTD_f_zstd1 = 0,        /* zstd frame format, specified in zstd_compression_format.md (default) */
-    ZSTD_f_zstd1_magicless,  /* Variant of zstd frame format, without initial 4-bytes magic number.
-                              * Useful to save 4 bytes per generated frame.
-                              * Decoder cannot recognise automatically this format, requiring instructions. */
-} ZSTD_format_e;
-


-
typedef enum {
-    /* compression format */
-    ZSTD_p_format = 10,      /* See ZSTD_format_e enum definition.
-                              * Cast selected format as unsigned for ZSTD_CCtx_setParameter() compatibility. */
-
-    /* compression parameters */
-    ZSTD_p_compressionLevel=100, /* Update all compression parameters according to pre-defined cLevel table
-                              * Default level is ZSTD_CLEVEL_DEFAULT==3.
-                              * Special: value 0 means "do not change cLevel". */
-    ZSTD_p_windowLog,        /* Maximum allowed back-reference distance, expressed as power of 2.
-                              * Must be clamped between ZSTD_WINDOWLOG_MIN and ZSTD_WINDOWLOG_MAX.
-                              * Special: value 0 means "do not change windowLog".
-                              * Note: Using a window size greater than ZSTD_MAXWINDOWSIZE_DEFAULT (default: 2^27)
-                              * requires setting the maximum window size at least as large during decompression. */
-    ZSTD_p_hashLog,          /* Size of the probe table, as a power of 2.
-                              * Resulting table size is (1 << (hashLog+2)).
-                              * Must be clamped between ZSTD_HASHLOG_MIN and ZSTD_HASHLOG_MAX.
-                              * Larger tables improve compression ratio of strategies <= dFast,
-                              * and improve speed of strategies > dFast.
-                              * Special: value 0 means "do not change hashLog". */
-    ZSTD_p_chainLog,         /* Size of the full-search table, as a power of 2.
-                              * Resulting table size is (1 << (chainLog+2)).
-                              * Larger tables result in better and slower compression.
-                              * This parameter is useless when using "fast" strategy.
-                              * Special: value 0 means "do not change chainLog". */
-    ZSTD_p_searchLog,        /* Number of search attempts, as a power of 2.
-                              * More attempts result in better and slower compression.
-                              * This parameter is useless when using "fast" and "dFast" strategies.
-                              * Special: value 0 means "do not change searchLog". */
-    ZSTD_p_minMatch,         /* Minimum size of searched matches (note : repCode matches can be smaller).
-                              * Larger values make faster compression and decompression, but decrease ratio.
-                              * Must be clamped between ZSTD_SEARCHLENGTH_MIN and ZSTD_SEARCHLENGTH_MAX.
-                              * Note that currently, for all strategies < btopt, effective minimum is 4.
-                              * Note that currently, for all strategies > fast, effective maximum is 6.
-                              * Special: value 0 means "do not change minMatchLength". */
-    ZSTD_p_targetLength,     /* Only useful for strategies >= btopt.
-                              * Length of Match considered "good enough" to stop search.
-                              * Larger values make compression stronger and slower.
-                              * Special: value 0 means "do not change targetLength". */
-    ZSTD_p_compressionStrategy, /* See ZSTD_strategy enum definition.
-                              * Cast selected strategy as unsigned for ZSTD_CCtx_setParameter() compatibility.
-                              * The higher the value of selected strategy, the more complex it is,
-                              * resulting in stronger and slower compression.
-                              * Special: value 0 means "do not change strategy". */
-
-    /* frame parameters */
-    ZSTD_p_contentSizeFlag=200, /* Content size will be written into frame header _whenever known_ (default:1)
-                              * Content size must be known at the beginning of compression,
-                              * it is provided using ZSTD_CCtx_setPledgedSrcSize() */
-    ZSTD_p_checksumFlag,     /* A 32-bits checksum of content is written at end of frame (default:0) */
-    ZSTD_p_dictIDFlag,       /* When applicable, dictionary's ID is written into frame header (default:1) */
-
-    /* multi-threading parameters */
-    ZSTD_p_nbThreads=400,    /* Select how many threads a compression job can spawn (default:1)
-                              * More threads improve speed, but also increase memory usage.
-                              * Can only receive a value > 1 if ZSTD_MULTITHREAD is enabled.
-                              * Special: value 0 means "do not change nbThreads" */
-    ZSTD_p_jobSize,          /* Size of a compression job. This value is only enforced in streaming (non-blocking) mode.
-                              * Each compression job is completed in parallel, so indirectly controls the nb of active threads.
-                              * 0 means default, which is dynamically determined based on compression parameters.
-                              * Job size must be a minimum of overlapSize, or 1 KB, whichever is largest
-                              * The minimum size is automatically and transparently enforced */
-    ZSTD_p_overlapSizeLog,   /* Size of previous input reloaded at the beginning of each job.
-                              * 0 => no overlap, 6(default) => use 1/8th of windowSize, >=9 => use full windowSize */
-
-    /* advanced parameters - may not remain available after API update */
-    ZSTD_p_forceMaxWindow=1100, /* Force back-reference distances to remain < windowSize,
-                              * even when referencing into Dictionary content (default:0) */
-    ZSTD_p_enableLongDistanceMatching=1200,  /* Enable long distance matching.
-                                         * This parameter is designed to improve the compression
-                                         * ratio for large inputs with long distance matches.
-                                         * This increases the memory usage as well as window size.
-                                         * Note: setting this parameter sets all the LDM parameters
-                                         * as well as ZSTD_p_windowLog. It should be set after
-                                         * ZSTD_p_compressionLevel and before ZSTD_p_windowLog and
-                                         * other LDM parameters. Setting the compression level
-                                         * after this parameter overrides the window log, though LDM
-                                         * will remain enabled until explicitly disabled. */
-    ZSTD_p_ldmHashLog,   /* Size of the table for long distance matching, as a power of 2.
-                          * Larger values increase memory usage and compression ratio, but decrease
-                          * compression speed.
-                          * Must be clamped between ZSTD_HASHLOG_MIN and ZSTD_HASHLOG_MAX
-                          * (default: windowlog - 7). */
-    ZSTD_p_ldmMinMatch,  /* Minimum size of searched matches for long distance matcher.
-                          * Larger/too small values usually decrease compression ratio.
-                          * Must be clamped between ZSTD_LDM_MINMATCH_MIN
-                          * and ZSTD_LDM_MINMATCH_MAX (default: 64). */
-    ZSTD_p_ldmBucketSizeLog,  /* Log size of each bucket in the LDM hash table for collision resolution.
-                               * Larger values usually improve collision resolution but may decrease
-                               * compression speed.
-                               * The maximum value is ZSTD_LDM_BUCKETSIZELOG_MAX (default: 3). */
-    ZSTD_p_ldmHashEveryLog,  /* Frequency of inserting/looking up entries in the LDM hash table.
-                              * The default is MAX(0, (windowLog - ldmHashLog)) to
-                              * optimize hash table usage.
-                              * Larger values improve compression speed. Deviating far from the
-                              * default value will likely result in a decrease in compression ratio.
-                              * Must be clamped between 0 and ZSTD_WINDOWLOG_MAX - ZSTD_HASHLOG_MIN. */
-
-} ZSTD_cParameter;
-


-
size_t ZSTD_CCtx_setParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, unsigned value);
-
  Set one compression parameter, selected by enum ZSTD_cParameter.
-  Note : when `value` is an enum, cast it to unsigned for proper type checking.
-  @result : informational value (typically, the one being set, possibly corrected),
-            or an error code (which can be tested with ZSTD_isError()). 
-


-
-
size_t ZSTD_CCtx_setPledgedSrcSize(ZSTD_CCtx* cctx, unsigned long long pledgedSrcSize);
-
  Total input data size to be compressed as a single frame.
-  This value will be controlled at the end, and result in error if not respected.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Note 1 : 0 means zero, empty.
-           In order to mean "unknown content size", pass constant ZSTD_CONTENTSIZE_UNKNOWN.
-           ZSTD_CONTENTSIZE_UNKNOWN is default value for any new compression job.
-  Note 2 : If all data is provided and consumed in a single round,
-           this value is overriden by srcSize instead. 
-


-
-
size_t ZSTD_CCtx_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize);
-size_t ZSTD_CCtx_loadDictionary_byReference(ZSTD_CCtx* cctx, const void* dict, size_t dictSize);
-size_t ZSTD_CCtx_loadDictionary_advanced(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictMode_e dictMode);
-
  Create an internal CDict from dict buffer.
-  Decompression will have to use same buffer.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Special : Adding a NULL (or 0-size) dictionary invalidates any previous dictionary,
-            meaning "return to no-dictionary mode".
-  Note 1 : `dict` content will be copied internally. Use
-            ZSTD_CCtx_loadDictionary_byReference() to reference dictionary
-            content instead. The dictionary buffer must then outlive its
-            users.
-  Note 2 : Loading a dictionary involves building tables, which are dependent on compression parameters.
-           For this reason, compression parameters cannot be changed anymore after loading a dictionary.
-           It's also a CPU-heavy operation, with non-negligible impact on latency.
-  Note 3 : Dictionary will be used for all future compression jobs.
-           To return to "no-dictionary" situation, load a NULL dictionary
-  Note 5 : Use ZSTD_CCtx_loadDictionary_advanced() to select how dictionary
-           content will be interpreted.
- 
-


-
-
size_t ZSTD_CCtx_refCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict);
-
  Reference a prepared dictionary, to be used for all next compression jobs.
-  Note that compression parameters are enforced from within CDict,
-  and supercede any compression parameter previously set within CCtx.
-  The dictionary will remain valid for future compression jobs using same CCtx.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Special : adding a NULL CDict means "return to no-dictionary mode".
-  Note 1 : Currently, only one dictionary can be managed.
-           Adding a new dictionary effectively "discards" any previous one.
-  Note 2 : CDict is just referenced, its lifetime must outlive CCtx.
- 
-


-
-
size_t ZSTD_CCtx_refPrefix(ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize);
-size_t ZSTD_CCtx_refPrefix_advanced(ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize, ZSTD_dictMode_e dictMode);
-
  Reference a prefix (single-usage dictionary) for next compression job.
-  Decompression need same prefix to properly regenerate data.
-  Prefix is **only used once**. Tables are discarded at end of compression job.
-  Subsequent compression jobs will be done without prefix (if none is explicitly referenced).
-  If there is a need to use same prefix multiple times, consider embedding it into a ZSTD_CDict instead.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Special : Adding any prefix (including NULL) invalidates any previous prefix or dictionary
-  Note 1 : Prefix buffer is referenced. It must outlive compression job.
-  Note 2 : Referencing a prefix involves building tables, which are dependent on compression parameters.
-           It's a CPU-heavy operation, with non-negligible impact on latency.
-  Note 3 : By default, the prefix is treated as raw content
-           (ZSTD_dm_rawContent). Use ZSTD_CCtx_refPrefix_advanced() to alter
-           dictMode. 
-


-
-
typedef enum {
-    ZSTD_e_continue=0, /* collect more data, encoder transparently decides when to output result, for optimal conditions */
-    ZSTD_e_flush,      /* flush any data provided so far - frame will continue, future data can still reference previous data for better compression */
-    ZSTD_e_end         /* flush any remaining data and close current frame. Any additional data starts a new frame. */
-} ZSTD_EndDirective;
-


-
size_t ZSTD_compress_generic (ZSTD_CCtx* cctx,
-                              ZSTD_outBuffer* output,
-                              ZSTD_inBuffer* input,
-                              ZSTD_EndDirective endOp);
-
  Behave about the same as ZSTD_compressStream. To note :
-  - Compression parameters are pushed into CCtx before starting compression, using ZSTD_CCtx_setParameter()
-  - Compression parameters cannot be changed once compression is started.
-  - outpot->pos must be <= dstCapacity, input->pos must be <= srcSize
-  - outpot->pos and input->pos will be updated. They are guaranteed to remain below their respective limit.
-  - In single-thread mode (default), function is blocking : it completed its job before returning to caller.
-  - In multi-thread mode, function is non-blocking : it just acquires a copy of input, and distribute job to internal worker threads,
-                                                     and then immediately returns, just indicating that there is some data remaining to be flushed.
-                                                     The function nonetheless guarantees forward progress : it will return only after it reads or write at least 1+ byte.
-  - Exception : in multi-threading mode, if the first call requests a ZSTD_e_end directive, it is blocking : it will complete compression before giving back control to caller.
-  - @return provides the minimum amount of data remaining to be flushed from internal buffers
-            or an error code, which can be tested using ZSTD_isError().
-            if @return != 0, flush is not fully completed, there is still some data left within internal buffers.
-            This is useful to determine if a ZSTD_e_flush or ZSTD_e_end directive is completed.
-  - after a ZSTD_e_end directive, if internal buffer is not fully flushed (@return != 0),
-            only ZSTD_e_end or ZSTD_e_flush operations are allowed.
-            Before starting a new compression job, or changing compression parameters,
-            it is required to fully flush internal buffers.
- 
-


-
-
void ZSTD_CCtx_reset(ZSTD_CCtx* cctx);   /* Not ready yet ! */
-
  Return a CCtx to clean state.
-  Useful after an error, or to interrupt an ongoing compression job and start a new one.
-  Any internal data not yet flushed is cancelled.
-  Dictionary (if any) is dropped.
-  All parameters are back to default values.
-  It's possible to modify compression parameters after a reset.
- 
-


-
-
size_t ZSTD_compress_generic_simpleArgs (
-                ZSTD_CCtx* cctx,
-                void* dst, size_t dstCapacity, size_t* dstPos,
-          const void* src, size_t srcSize, size_t* srcPos,
-                ZSTD_EndDirective endOp);
-
  Same as ZSTD_compress_generic(),
-  but using only integral types as arguments.
-  Argument list is larger than ZSTD_{in,out}Buffer,
-  but can be helpful for binders from dynamic languages
-  which have troubles handling structures containing memory pointers.
- 
-


-
-
ZSTD_CCtx_params* ZSTD_createCCtxParams(void);
-
  Quick howto :
-  - ZSTD_createCCtxParams() : Create a ZSTD_CCtx_params structure
-  - ZSTD_CCtxParam_setParameter() : Push parameters one by one into
-                                    an existing ZSTD_CCtx_params structure.
-                                    This is similar to
-                                    ZSTD_CCtx_setParameter().
-  - ZSTD_CCtx_setParametersUsingCCtxParams() : Apply parameters to
-                                    an existing CCtx.
-                                    These parameters will be applied to
-                                    all subsequent compression jobs.
-  - ZSTD_compress_generic() : Do compression using the CCtx.
-  - ZSTD_freeCCtxParams() : Free the memory.
-
-  This can be used with ZSTD_estimateCCtxSize_advanced_usingCCtxParams()
-  for static allocation for single-threaded compression.
- 
-


-
-
size_t ZSTD_resetCCtxParams(ZSTD_CCtx_params* params);
-
  Reset params to default, with the default compression level.
- 
-


-
-
size_t ZSTD_initCCtxParams(ZSTD_CCtx_params* cctxParams, int compressionLevel);
-
  Initializes the compression parameters of cctxParams according to
-  compression level. All other parameters are reset to their default values.
- 
-


-
-
size_t ZSTD_initCCtxParams_advanced(ZSTD_CCtx_params* cctxParams, ZSTD_parameters params);
-
  Initializes the compression and frame parameters of cctxParams according to
-  params. All other parameters are reset to their default values.
- 
-


-
-
size_t ZSTD_CCtxParam_setParameter(ZSTD_CCtx_params* params, ZSTD_cParameter param, unsigned value);
-
  Similar to ZSTD_CCtx_setParameter.
-  Set one compression parameter, selected by enum ZSTD_cParameter.
-  Parameters must be applied to a ZSTD_CCtx using ZSTD_CCtx_setParametersUsingCCtxParams().
-  Note : when `value` is an enum, cast it to unsigned for proper type checking.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
- 
-


-
-
size_t ZSTD_CCtx_setParametersUsingCCtxParams(
-        ZSTD_CCtx* cctx, const ZSTD_CCtx_params* params);
-
  Apply a set of ZSTD_CCtx_params to the compression context.
-  This must be done before the dictionary is loaded.
-  The pledgedSrcSize is treated as unknown.
-  Multithreading parameters are applied only if nbThreads > 1.
- 
-


-
-
Advanced parameters for decompression API


-
size_t ZSTD_DCtx_loadDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);   /* not implemented */
-size_t ZSTD_DCtx_loadDictionary_byReference(ZSTD_DCtx* dctx, const void* dict, size_t dictSize);   /* not implemented */
-size_t ZSTD_DCtx_loadDictionary_advanced(ZSTD_DCtx* dctx, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictMode_e dictMode);   /* not implemented */
-
  Create an internal DDict from dict buffer,
-  to be used to decompress next frames.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Special : Adding a NULL (or 0-size) dictionary invalidates any previous dictionary,
-            meaning "return to no-dictionary mode".
-  Note 1 : `dict` content will be copied internally.
-            Use ZSTD_DCtx_loadDictionary_byReference()
-            to reference dictionary content instead.
-            In which case, the dictionary buffer must outlive its users.
-  Note 2 : Loading a dictionary involves building tables,
-           which has a non-negligible impact on CPU usage and latency.
-  Note 3 : Use ZSTD_DCtx_loadDictionary_advanced() to select
-           how dictionary content will be interpreted and loaded.
- 
-


-
-
size_t ZSTD_DCtx_refDDict(ZSTD_DCtx* dctx, const ZSTD_DDict* ddict);   /* not implemented */
-
  Reference a prepared dictionary, to be used to decompress next frames.
-  The dictionary remains active for decompression of future frames using same DCtx.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Note 1 : Currently, only one dictionary can be managed.
-           Referencing a new dictionary effectively "discards" any previous one.
-  Special : adding a NULL DDict means "return to no-dictionary mode".
-  Note 2 : DDict is just referenced, its lifetime must outlive its usage from DCtx.
- 
-


-
-
size_t ZSTD_DCtx_refPrefix(ZSTD_DCtx* dctx, const void* prefix, size_t prefixSize);   /* not implemented */
-size_t ZSTD_DCtx_refPrefix_advanced(ZSTD_DCtx* dctx, const void* prefix, size_t prefixSize, ZSTD_dictMode_e dictMode);   /* not implemented */
-
  Reference a prefix (single-usage dictionary) for next compression job.
-  Prefix is **only used once**. It must be explicitly referenced before each frame.
-  If there is a need to use same prefix multiple times, consider embedding it into a ZSTD_DDict instead.
- @result : 0, or an error code (which can be tested with ZSTD_isError()).
-  Note 1 : Adding any prefix (including NULL) invalidates any previously set prefix or dictionary
-  Note 2 : Prefix buffer is referenced. It must outlive compression job.
-  Note 3 : By default, the prefix is treated as raw content (ZSTD_dm_rawContent).
-           Use ZSTD_CCtx_refPrefix_advanced() to alter dictMode.
-  Note 4 : Referencing a raw content prefix has almost no cpu nor memory cost.
- 
-


-
-
size_t ZSTD_DCtx_setMaxWindowSize(ZSTD_DCtx* dctx, size_t maxWindowSize);
-
  Refuses allocating internal buffers for frames requiring a window size larger than provided limit.
-  This is useful to prevent a decoder context from reserving too much memory for itself (potential attack scenario).
-  This parameter is only useful in streaming mode, since no internal buffer is allocated in direct mode.
-  By default, a decompression context accepts all window sizes <= (1 << ZSTD_WINDOWLOG_MAX)
- @return : 0, or an error code (which can be tested using ZSTD_isError()).
- 
-


-
-
size_t ZSTD_DCtx_setFormat(ZSTD_DCtx* dctx, ZSTD_format_e format);
-
  Instruct the decoder context about what kind of data to decode next.
-  This instruction is mandatory to decode data without a fully-formed header,
-  such ZSTD_f_zstd1_magicless for example.
- @return : 0, or an error code (which can be tested using ZSTD_isError()).
- 
-


-
-
size_t ZSTD_decompress_generic(ZSTD_DCtx* dctx,
-                               ZSTD_outBuffer* output,
-                               ZSTD_inBuffer* input);
-
  Behave the same as ZSTD_decompressStream.
-  Decompression parameters cannot be changed once decompression is started.
- @return : an error code, which can be tested using ZSTD_isError()
-           if >0, a hint, nb of expected input bytes for next invocation.
-           `0` means : a frame has just been fully decoded and flushed.
- 
-


-
-
size_t ZSTD_decompress_generic_simpleArgs (
-                ZSTD_DCtx* dctx,
-                void* dst, size_t dstCapacity, size_t* dstPos,
-          const void* src, size_t srcSize, size_t* srcPos);
-
  Same as ZSTD_decompress_generic(),
-  but using only integral types as arguments.
-  Argument list is larger than ZSTD_{in,out}Buffer,
-  but can be helpful for binders from dynamic languages
-  which have troubles handling structures containing memory pointers.
- 
-


-
-
void ZSTD_DCtx_reset(ZSTD_DCtx* dctx);
-
  Return a DCtx to clean state.
-  If a decompression was ongoing, any internal data not yet flushed is cancelled.
-  All parameters are back to default values, including sticky ones.
-  Dictionary (if any) is dropped.
-  Parameters can be modified again after a reset.
- 
-


-
-
Block level API

-
-
    Frame metadata cost is typically ~18 bytes, which can be non-negligible for very small blocks (< 100 bytes).
-    User will have to take in charge required information to regenerate data, such as compressed and content sizes.
-
-    A few rules to respect :
-    - Compressing and decompressing require a context structure
-      + Use ZSTD_createCCtx() and ZSTD_createDCtx()
-    - It is necessary to init context before starting
-      + compression : any ZSTD_compressBegin*() variant, including with dictionary
-      + decompression : any ZSTD_decompressBegin*() variant, including with dictionary
-      + copyCCtx() and copyDCtx() can be used too
-    - Block size is limited, it must be <= ZSTD_getBlockSize() <= ZSTD_BLOCKSIZE_MAX == 128 KB
-      + If input is larger than a block size, it's necessary to split input data into multiple blocks
-      + For inputs larger than a single block size, consider using the regular ZSTD_compress() instead.
-        Frame metadata is not that costly, and quickly becomes negligible as source size grows larger.
-    - When a block is considered not compressible enough, ZSTD_compressBlock() result will be zero.
-      In which case, nothing is produced into `dst`.
-      + User must test for such outcome and deal directly with uncompressed data
-      + ZSTD_decompressBlock() doesn't accept uncompressed data as input !!!
-      + In case of multiple successive blocks, should some of them be uncompressed,
-        decoder must be informed of their existence in order to follow proper history.
-        Use ZSTD_insertBlock() for such a case.
-


-
-
Raw zstd block functions
size_t ZSTD_getBlockSize   (const ZSTD_CCtx* cctx);
-size_t ZSTD_compressBlock  (ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize);
-size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize);  /**< insert uncompressed block into `dctx` history. Useful for multi-blocks decompression */
-


-
-
diff --git a/priv/zstd/examples/.gitignore b/priv/zstd/examples/.gitignore
deleted file mode 100644
index 280feb3..0000000
--- a/priv/zstd/examples/.gitignore
+++ /dev/null
@@ -1,14 +0,0 @@
-#build
-simple_compression
-simple_decompression
-dictionary_compression
-dictionary_decompression
-streaming_compression
-streaming_decompression
-multiple_streaming_compression
-streaming_memory_usage
-
-#test artefact
-tmp*
-test*
-*.zst
diff --git a/priv/zstd/examples/Makefile b/priv/zstd/examples/Makefile
deleted file mode 100644
index 52470f5..0000000
--- a/priv/zstd/examples/Makefile
+++ /dev/null
@@ -1,83 +0,0 @@
-# ################################################################
-# Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-# All rights reserved.
-#
-# This source code is licensed under both the BSD-style license (found in the
-# LICENSE file in the root directory of this source tree) and the GPLv2 (found
-# in the COPYING file in the root directory of this source tree).
-# ################################################################
-
-# This Makefile presumes libzstd is installed, using `sudo make install`
-
-LIB = ../lib/libzstd.a
-
-.PHONY: default all clean test
-
-default: all
-
-all: simple_compression simple_decompression \
-	dictionary_compression dictionary_decompression \
-	streaming_compression streaming_decompression \
-	multiple_streaming_compression streaming_memory_usage
-
-$(LIB) :
-	make -C ../lib libzstd.a
-
-simple_compression : simple_compression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-simple_decompression : simple_decompression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-dictionary_compression : dictionary_compression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-dictionary_decompression : dictionary_decompression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-streaming_compression : streaming_compression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-multiple_streaming_compression : multiple_streaming_compression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-streaming_decompression : streaming_decompression.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-streaming_memory_usage : streaming_memory_usage.c $(LIB)
-	$(CC) $(CPPFLAGS) $(CFLAGS) $^ $(LDFLAGS) -o $@
-
-clean:
-	@rm -f core *.o tmp* result* *.zst \
-        simple_compression simple_decompression \
-        dictionary_compression dictionary_decompression \
-        streaming_compression streaming_decompression \
-        multiple_streaming_compression streaming_memory_usage
-	@echo Cleaning completed
-
-test: all
-	cp README.md tmp
-	cp Makefile tmp2
-	@echo -- Simple compression tests
-	./simple_compression tmp
-	./simple_decompression tmp.zst
-	./streaming_decompression tmp.zst > /dev/null
-	@echo -- Streaming memory usage
-	./streaming_memory_usage
-	@echo -- Streaming compression tests
-	./streaming_compression tmp
-	./streaming_decompression tmp.zst > /dev/null
-	@echo -- Edge cases detection
-	! ./streaming_decompression tmp    # invalid input, must fail
-	! ./simple_decompression tmp       # invalid input, must fail
-	! ./simple_decompression tmp.zst   # unknown input size, must fail
-	touch tmpNull                      # create 0-size file
-	./simple_compression tmpNull
-	./simple_decompression tmpNull.zst # 0-size frame : must work
-	@echo -- Multiple streaming tests
-	./multiple_streaming_compression *.c
-	@echo -- Dictionary compression tests
-	./dictionary_compression tmp2 tmp README.md
-	./dictionary_decompression tmp2.zst tmp.zst README.md
-	$(RM) tmp* *.zst
-	@echo tests completed
diff --git a/priv/zstd/examples/README.md b/priv/zstd/examples/README.md
deleted file mode 100644
index eba50c9..0000000
--- a/priv/zstd/examples/README.md
+++ /dev/null
@@ -1,40 +0,0 @@
-Zstandard library : usage examples
-==================================
-
-- [Simple compression](simple_compression.c) :
-  Compress a single file.
-  Introduces usage of : `ZSTD_compress()`
-
-- [Simple decompression](simple_decompression.c) :
-  Decompress a single file.
-  Only compatible with simple compression.
-  Result remains in memory.
-  Introduces usage of : `ZSTD_decompress()`
-
-- [Streaming memory usage](streaming_memory_usage.c) :
-  Provides amount of memory used by streaming context
-  Introduces usage of : `ZSTD_sizeof_CStream()`
-
-- [Streaming compression](streaming_compression.c) :
-  Compress a single file.
-  Introduces usage of : `ZSTD_compressStream()`
-
-- [Multiple Streaming compression](multiple_streaming_compression.c) :
-  Compress multiple files in a single command line.
-  Introduces memory usage preservation technique,
-  reducing impact of malloc()/free() and memset() by re-using existing resources.
-
-- [Streaming decompression](streaming_decompression.c) :
-  Decompress a single file compressed by zstd.
-  Compatible with both simple and streaming compression.
-  Result is sent to stdout.
-  Introduces usage of : `ZSTD_decompressStream()`
-
-- [Dictionary compression](dictionary_compression.c) :
-  Compress multiple files using the same dictionary.
-  Introduces usage of : `ZSTD_createCDict()` and `ZSTD_compress_usingCDict()`
-
-- [Dictionary decompression](dictionary_decompression.c) :
-  Decompress multiple files using the same dictionary.
-  Result remains in memory.
-  Introduces usage of : `ZSTD_createDDict()` and `ZSTD_decompress_usingDDict()`
diff --git a/priv/zstd/examples/multiple_streaming_compression.c b/priv/zstd/examples/multiple_streaming_compression.c
deleted file mode 100644
index e395aef..0000000
--- a/priv/zstd/examples/multiple_streaming_compression.c
+++ /dev/null
@@ -1,165 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/* The objective of this example is to show of to compress multiple successive files
-*  while preserving memory management.
-*  All structures and buffers will be created only once,
-*  and shared across all compression operations */
-
-#include     // malloc, exit
-#include      // fprintf, perror, feof
-#include     // strerror
-#include      // errno
-#define ZSTD_STATIC_LINKING_ONLY  // streaming API defined as "experimental" for the time being
-#include       // presumes zstd library is installed
-
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc:");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-
-typedef struct {
-    void* buffIn;
-    void* buffOut;
-    size_t buffInSize;
-    size_t buffOutSize;
-    ZSTD_CStream* cstream;
-} resources ;
-
-static resources createResources_orDie()
-{
-    resources ress;
-    ress.buffInSize = ZSTD_CStreamInSize();   /* can always read one full block */
-    ress.buffOutSize= ZSTD_CStreamOutSize();  /* can always flush a full block */
-    ress.buffIn = malloc_orDie(ress.buffInSize);
-    ress.buffOut= malloc_orDie(ress.buffOutSize);
-    ress.cstream = ZSTD_createCStream();
-    if (ress.cstream==NULL) { fprintf(stderr, "ZSTD_createCStream() error \n"); exit(10); }
-    return ress;
-}
-
-static void freeResources(resources ress)
-{
-    ZSTD_freeCStream(ress.cstream);
-    free(ress.buffIn);
-    free(ress.buffOut);
-}
-
-
-static void compressFile_orDie(resources ress, const char* fname, const char* outName, int cLevel)
-{
-    FILE* const fin  = fopen_orDie(fname, "rb");
-    FILE* const fout = fopen_orDie(outName, "wb");
-
-    size_t const initResult = ZSTD_initCStream(ress.cstream, cLevel);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_initCStream() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-
-    size_t read, toRead = ress.buffInSize;
-    while( (read = fread_orDie(ress.buffIn, toRead, fin)) ) {
-        ZSTD_inBuffer input = { ress.buffIn, read, 0 };
-        while (input.pos < input.size) {
-            ZSTD_outBuffer output = { ress.buffOut, ress.buffOutSize, 0 };
-            toRead = ZSTD_compressStream(ress.cstream, &output , &input);   /* toRead is guaranteed to be <= ZSTD_CStreamInSize() */
-            if (ZSTD_isError(toRead)) { fprintf(stderr, "ZSTD_compressStream() error : %s \n", ZSTD_getErrorName(toRead)); exit(12); }
-            if (toRead > ress.buffInSize) toRead = ress.buffInSize;   /* Safely handle when `buffInSize` is manually changed to a smaller value */
-            fwrite_orDie(ress.buffOut, output.pos, fout);
-        }
-    }
-
-    ZSTD_outBuffer output = { ress.buffOut, ress.buffOutSize, 0 };
-    size_t const remainingToFlush = ZSTD_endStream(ress.cstream, &output);   /* close frame */
-    if (remainingToFlush) { fprintf(stderr, "not fully flushed"); exit(13); }
-    fwrite_orDie(ress.buffOut, output.pos, fout);
-
-    fclose_orDie(fout);
-    fclose_orDie(fin);
-}
-
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc<2) {
-        printf("wrong arguments\n");
-        printf("usage:\n");
-        printf("%s FILE(s)\n", exeName);
-        return 1;
-    }
-
-    resources const ress = createResources_orDie();
-    void* ofnBuffer = NULL;
-    size_t ofnbSize = 0;
-
-    int argNb;
-    for (argNb = 1; argNb < argc; argNb++) {
-        const char* const ifn = argv[argNb];
-        size_t const ifnSize = strlen(ifn);
-        size_t const ofnSize = ifnSize + 5;
-        if (ofnbSize <= ofnSize) {
-            ofnbSize = ofnSize + 16;
-            free(ofnBuffer);
-            ofnBuffer = malloc_orDie(ofnbSize);
-        }
-        memset(ofnBuffer, 0, ofnSize);
-        strcat(ofnBuffer, ifn);
-        strcat(ofnBuffer, ".zst");
-        compressFile_orDie(ress, ifn, ofnBuffer, 7);
-    }
-
-    freeResources(ress);
-    /* success */
-    printf("compressed %i files \n", argc-1);
-
-    return 0;
-}
diff --git a/priv/zstd/examples/simple_compression.c b/priv/zstd/examples/simple_compression.c
deleted file mode 100644
index 9ade424..0000000
--- a/priv/zstd/examples/simple_compression.c
+++ /dev/null
@@ -1,135 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-
-#include     // malloc, free, exit
-#include      // fprintf, perror, fopen, etc.
-#include     // strlen, strcat, memset, strerror
-#include      // errno
-#include   // stat
-#include       // presumes zstd library is installed
-
-
-static off_t fsize_orDie(const char *filename)
-{
-    struct stat st;
-    if (stat(filename, &st) == 0) return st.st_size;
-    /* error */
-    perror(filename);
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(2);
-}
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror(NULL);
-    exit(3);
-}
-
-static void* loadFile_orDie(const char* fileName, size_t* size)
-{
-    off_t const fileSize = fsize_orDie(fileName);
-    size_t const buffSize = (size_t)fileSize;
-    if ((off_t)buffSize < fileSize) {   /* narrowcast overflow */
-        fprintf(stderr, "%s : filesize too large \n", fileName);
-        exit(4);
-    }
-    FILE* const inFile = fopen_orDie(fileName, "rb");
-    void* const buffer = malloc_orDie(buffSize);
-    size_t const readSize = fread(buffer, 1, buffSize, inFile);
-    if (readSize != (size_t)buffSize) {
-        fprintf(stderr, "fread: %s : %s \n", fileName, strerror(errno));
-        exit(5);
-    }
-    fclose(inFile);  /* can't fail, read only */
-    *size = buffSize;
-    return buffer;
-}
-
-
-static void saveFile_orDie(const char* fileName, const void* buff, size_t buffSize)
-{
-    FILE* const oFile = fopen_orDie(fileName, "wb");
-    size_t const wSize = fwrite(buff, 1, buffSize, oFile);
-    if (wSize != (size_t)buffSize) {
-        fprintf(stderr, "fwrite: %s : %s \n", fileName, strerror(errno));
-        exit(6);
-    }
-    if (fclose(oFile)) {
-        perror(fileName);
-        exit(7);
-    }
-}
-
-
-static void compress_orDie(const char* fname, const char* oname)
-{
-    size_t fSize;
-    void* const fBuff = loadFile_orDie(fname, &fSize);
-    size_t const cBuffSize = ZSTD_compressBound(fSize);
-    void* const cBuff = malloc_orDie(cBuffSize);
-
-    size_t const cSize = ZSTD_compress(cBuff, cBuffSize, fBuff, fSize, 1);
-    if (ZSTD_isError(cSize)) {
-        fprintf(stderr, "error compressing %s : %s \n", fname, ZSTD_getErrorName(cSize));
-        exit(8);
-    }
-
-    saveFile_orDie(oname, cBuff, cSize);
-
-    /* success */
-    printf("%25s : %6u -> %7u - %s \n", fname, (unsigned)fSize, (unsigned)cSize, oname);
-
-    free(fBuff);
-    free(cBuff);
-}
-
-
-static char* createOutFilename_orDie(const char* filename)
-{
-    size_t const inL = strlen(filename);
-    size_t const outL = inL + 5;
-    void* const outSpace = malloc_orDie(outL);
-    memset(outSpace, 0, outL);
-    strcat(outSpace, filename);
-    strcat(outSpace, ".zst");
-    return (char*)outSpace;
-}
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc!=2) {
-        printf("wrong arguments\n");
-        printf("usage:\n");
-        printf("%s FILE\n", exeName);
-        return 1;
-    }
-
-    const char* const inFilename = argv[1];
-
-    char* const outFilename = createOutFilename_orDie(inFilename);
-    compress_orDie(inFilename, outFilename);
-    free(outFilename);
-    return 0;
-}
diff --git a/priv/zstd/examples/simple_decompression.c b/priv/zstd/examples/simple_decompression.c
deleted file mode 100644
index c1818a9..0000000
--- a/priv/zstd/examples/simple_decompression.c
+++ /dev/null
@@ -1,110 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#include     // malloc, exit
-#include      // printf
-#include     // strerror
-#include      // errno
-#include   // stat
-#define ZSTD_STATIC_LINKING_ONLY   // ZSTD_findDecompressedSize
-#include       // presumes zstd library is installed
-
-
-static off_t fsize_orDie(const char *filename)
-{
-    struct stat st;
-    if (stat(filename, &st) == 0) return st.st_size;
-    /* error */
-    fprintf(stderr, "stat: %s : %s \n", filename, strerror(errno));
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    fprintf(stderr, "fopen: %s : %s \n", filename, strerror(errno));
-    exit(2);
-}
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size + !size);   /* avoid allocating size of 0 : may return NULL (implementation dependent) */
-    if (buff) return buff;
-    /* error */
-    fprintf(stderr, "malloc: %s \n", strerror(errno));
-    exit(3);
-}
-
-static void* loadFile_orDie(const char* fileName, size_t* size)
-{
-    off_t const buffSize = fsize_orDie(fileName);
-    FILE* const inFile = fopen_orDie(fileName, "rb");
-    void* const buffer = malloc_orDie(buffSize);
-    size_t const readSize = fread(buffer, 1, buffSize, inFile);
-    if (readSize != (size_t)buffSize) {
-        fprintf(stderr, "fread: %s : %s \n", fileName, strerror(errno));
-        exit(4);
-    }
-    fclose(inFile);   /* can't fail (read only) */
-    *size = buffSize;
-    return buffer;
-}
-
-
-static void decompress(const char* fname)
-{
-    size_t cSize;
-    void* const cBuff = loadFile_orDie(fname, &cSize);
-    unsigned long long const rSize = ZSTD_findDecompressedSize(cBuff, cSize);
-    if (rSize==ZSTD_CONTENTSIZE_ERROR) {
-        fprintf(stderr, "%s : it was not compressed by zstd.\n", fname);
-        exit(5);
-    } else if (rSize==ZSTD_CONTENTSIZE_UNKNOWN) {
-        fprintf(stderr,
-                "%s : original size unknown. Use streaming decompression instead.\n", fname);
-        exit(6);
-    }
-
-    void* const rBuff = malloc_orDie((size_t)rSize);
-
-    size_t const dSize = ZSTD_decompress(rBuff, rSize, cBuff, cSize);
-
-    if (dSize != rSize) {
-        fprintf(stderr, "error decoding %s : %s \n", fname, ZSTD_getErrorName(dSize));
-        exit(7);
-    }
-
-    /* success */
-    printf("%25s : %6u -> %7u \n", fname, (unsigned)cSize, (unsigned)rSize);
-
-    free(rBuff);
-    free(cBuff);
-}
-
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc!=2) {
-        printf("wrong arguments\n");
-        printf("usage:\n");
-        printf("%s FILE\n", exeName);
-        return 1;
-    }
-
-    decompress(argv[1]);
-
-    printf("%s correctly decoded (in memory). \n", argv[1]);
-
-    return 0;
-}
diff --git a/priv/zstd/examples/streaming_compression.c b/priv/zstd/examples/streaming_compression.c
deleted file mode 100644
index f76364d..0000000
--- a/priv/zstd/examples/streaming_compression.c
+++ /dev/null
@@ -1,131 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-#include     // malloc, free, exit
-#include      // fprintf, perror, feof, fopen, etc.
-#include     // strlen, memset, strcat
-#include       // presumes zstd library is installed
-
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc:");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-
-static void compressFile_orDie(const char* fname, const char* outName, int cLevel)
-{
-    FILE* const fin  = fopen_orDie(fname, "rb");
-    FILE* const fout = fopen_orDie(outName, "wb");
-    size_t const buffInSize = ZSTD_CStreamInSize();    /* can always read one full block */
-    void*  const buffIn  = malloc_orDie(buffInSize);
-    size_t const buffOutSize = ZSTD_CStreamOutSize();  /* can always flush a full block */
-    void*  const buffOut = malloc_orDie(buffOutSize);
-
-    ZSTD_CStream* const cstream = ZSTD_createCStream();
-    if (cstream==NULL) { fprintf(stderr, "ZSTD_createCStream() error \n"); exit(10); }
-    size_t const initResult = ZSTD_initCStream(cstream, cLevel);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_initCStream() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-
-    size_t read, toRead = buffInSize;
-    while( (read = fread_orDie(buffIn, toRead, fin)) ) {
-        ZSTD_inBuffer input = { buffIn, read, 0 };
-        while (input.pos < input.size) {
-            ZSTD_outBuffer output = { buffOut, buffOutSize, 0 };
-            toRead = ZSTD_compressStream(cstream, &output , &input);   /* toRead is guaranteed to be <= ZSTD_CStreamInSize() */
-            if (ZSTD_isError(toRead)) { fprintf(stderr, "ZSTD_compressStream() error : %s \n", ZSTD_getErrorName(toRead)); exit(12); }
-            if (toRead > buffInSize) toRead = buffInSize;   /* Safely handle case when `buffInSize` is manually changed to a value < ZSTD_CStreamInSize()*/
-            fwrite_orDie(buffOut, output.pos, fout);
-        }
-    }
-
-    ZSTD_outBuffer output = { buffOut, buffOutSize, 0 };
-    size_t const remainingToFlush = ZSTD_endStream(cstream, &output);   /* close frame */
-    if (remainingToFlush) { fprintf(stderr, "not fully flushed"); exit(13); }
-    fwrite_orDie(buffOut, output.pos, fout);
-
-    ZSTD_freeCStream(cstream);
-    fclose_orDie(fout);
-    fclose_orDie(fin);
-    free(buffIn);
-    free(buffOut);
-}
-
-
-static const char* createOutFilename_orDie(const char* filename)
-{
-    size_t const inL = strlen(filename);
-    size_t const outL = inL + 5;
-    void* outSpace = malloc_orDie(outL);
-    memset(outSpace, 0, outL);
-    strcat(outSpace, filename);
-    strcat(outSpace, ".zst");
-    return (const char*)outSpace;
-}
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc!=2) {
-        printf("wrong arguments\n");
-        printf("usage:\n");
-        printf("%s FILE\n", exeName);
-        return 1;
-    }
-
-    const char* const inFilename = argv[1];
-
-    const char* const outFilename = createOutFilename_orDie(inFilename);
-    compressFile_orDie(inFilename, outFilename, 1);
-
-    return 0;
-}
diff --git a/priv/zstd/examples/streaming_decompression.c b/priv/zstd/examples/streaming_decompression.c
deleted file mode 100644
index 504a5e3..0000000
--- a/priv/zstd/examples/streaming_decompression.c
+++ /dev/null
@@ -1,116 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-#include     // malloc, exit
-#include      // fprintf, perror, feof
-#include     // strerror
-#include      // errno
-#include       // presumes zstd library is installed
-
-
-static void* malloc_orDie(size_t size)
-{
-    void* const buff = malloc(size);
-    if (buff) return buff;
-    /* error */
-    perror("malloc:");
-    exit(1);
-}
-
-static FILE* fopen_orDie(const char *filename, const char *instruction)
-{
-    FILE* const inFile = fopen(filename, instruction);
-    if (inFile) return inFile;
-    /* error */
-    perror(filename);
-    exit(3);
-}
-
-static size_t fread_orDie(void* buffer, size_t sizeToRead, FILE* file)
-{
-    size_t const readSize = fread(buffer, 1, sizeToRead, file);
-    if (readSize == sizeToRead) return readSize;   /* good */
-    if (feof(file)) return readSize;   /* good, reached end of file */
-    /* error */
-    perror("fread");
-    exit(4);
-}
-
-static size_t fwrite_orDie(const void* buffer, size_t sizeToWrite, FILE* file)
-{
-    size_t const writtenSize = fwrite(buffer, 1, sizeToWrite, file);
-    if (writtenSize == sizeToWrite) return sizeToWrite;   /* good */
-    /* error */
-    perror("fwrite");
-    exit(5);
-}
-
-static size_t fclose_orDie(FILE* file)
-{
-    if (!fclose(file)) return 0;
-    /* error */
-    perror("fclose");
-    exit(6);
-}
-
-
-static void decompressFile_orDie(const char* fname)
-{
-    FILE* const fin  = fopen_orDie(fname, "rb");
-    size_t const buffInSize = ZSTD_DStreamInSize();
-    void*  const buffIn  = malloc_orDie(buffInSize);
-    FILE* const fout = stdout;
-    size_t const buffOutSize = ZSTD_DStreamOutSize();  /* Guarantee to successfully flush at least one complete compressed block in all circumstances. */
-    void*  const buffOut = malloc_orDie(buffOutSize);
-
-    ZSTD_DStream* const dstream = ZSTD_createDStream();
-    if (dstream==NULL) { fprintf(stderr, "ZSTD_createDStream() error \n"); exit(10); }
-
-    /* In more complex scenarios, a file may consist of multiple appended frames (ex : pzstd).
-    *  The following example decompresses only the first frame.
-    *  It is compatible with other provided streaming examples */
-    size_t const initResult = ZSTD_initDStream(dstream);
-    if (ZSTD_isError(initResult)) { fprintf(stderr, "ZSTD_initDStream() error : %s \n", ZSTD_getErrorName(initResult)); exit(11); }
-    size_t read, toRead = initResult;
-    while ( (read = fread_orDie(buffIn, toRead, fin)) ) {
-        ZSTD_inBuffer input = { buffIn, read, 0 };
-        while (input.pos < input.size) {
-            ZSTD_outBuffer output = { buffOut, buffOutSize, 0 };
-            toRead = ZSTD_decompressStream(dstream, &output , &input);  /* toRead : size of next compressed block */
-            if (ZSTD_isError(toRead)) { fprintf(stderr, "ZSTD_decompressStream() error : %s \n", ZSTD_getErrorName(toRead)); exit(12); }
-            fwrite_orDie(buffOut, output.pos, fout);
-        }
-    }
-
-    ZSTD_freeDStream(dstream);
-    fclose_orDie(fin);
-    fclose_orDie(fout);
-    free(buffIn);
-    free(buffOut);
-}
-
-
-int main(int argc, const char** argv)
-{
-    const char* const exeName = argv[0];
-
-    if (argc!=2) {
-        fprintf(stderr, "wrong arguments\n");
-        fprintf(stderr, "usage:\n");
-        fprintf(stderr, "%s FILE\n", exeName);
-        return 1;
-    }
-
-    const char* const inFilename = argv[1];
-
-    decompressFile_orDie(inFilename);
-    return 0;
-}
diff --git a/priv/zstd/examples/streaming_memory_usage.c b/priv/zstd/examples/streaming_memory_usage.c
deleted file mode 100644
index b056c2a..0000000
--- a/priv/zstd/examples/streaming_memory_usage.c
+++ /dev/null
@@ -1,149 +0,0 @@
-/*
- * Copyright (c) 2017-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/*===   Tuning parameter   ===*/
-#ifndef MAX_TESTED_LEVEL
-#define MAX_TESTED_LEVEL 12
-#endif
-
-
-/*===   Dependencies   ===*/
-#include    /* printf */
-#define ZSTD_STATIC_LINKING_ONLY
-#include "zstd.h"
-
-
-/*===   functions   ===*/
-
-/*! readU32FromChar() :
-    @return : unsigned integer value read from input in `char` format
-    allows and interprets K, KB, KiB, M, MB and MiB suffix.
-    Will also modify `*stringPtr`, advancing it to position where it stopped reading.
-    Note : function result can overflow if digit string > MAX_UINT */
-static unsigned readU32FromChar(const char** stringPtr)
-{
-    unsigned result = 0;
-    while ((**stringPtr >='0') && (**stringPtr <='9'))
-        result *= 10, result += **stringPtr - '0', (*stringPtr)++ ;
-    if ((**stringPtr=='K') || (**stringPtr=='M')) {
-        result <<= 10;
-        if (**stringPtr=='M') result <<= 10;
-        (*stringPtr)++ ;
-        if (**stringPtr=='i') (*stringPtr)++;
-        if (**stringPtr=='B') (*stringPtr)++;
-    }
-    return result;
-}
-
-
-int main(int argc, char const *argv[]) {
-
-    printf("\n Zstandard (v%u) memory usage for streaming contexts : \n\n", ZSTD_versionNumber());
-
-    unsigned wLog = 0;
-    if (argc > 1) {
-        const char* valStr = argv[1];
-        wLog = readU32FromChar(&valStr);
-    }
-
-    int compressionLevel;
-    for (compressionLevel = 1; compressionLevel <= MAX_TESTED_LEVEL; compressionLevel++) {
-#define INPUT_SIZE 5
-#define COMPRESSED_SIZE 128
-        char const dataToCompress[INPUT_SIZE] = "abcde";
-        char compressedData[COMPRESSED_SIZE];
-        char decompressedData[INPUT_SIZE];
-        ZSTD_CStream* const cstream = ZSTD_createCStream();
-        if (cstream==NULL) {
-            printf("Level %i : ZSTD_CStream Memory allocation failure \n", compressionLevel);
-            return 1;
-        }
-
-        /* forces compressor to use maximum memory size for given compression level,
-         * by not providing any information on input size */
-        ZSTD_parameters params = ZSTD_getParams(compressionLevel, 0, 0);
-        if (wLog) { /* special mode : specific wLog */
-            printf("Using custom compression parameter : level 1 + wLog=%u \n", wLog);
-            params = ZSTD_getParams(1, 1 << wLog, 0);
-            size_t const error = ZSTD_initCStream_advanced(cstream, NULL, 0, params, 0);
-            if (ZSTD_isError(error)) {
-                printf("ZSTD_initCStream_advanced error : %s \n", ZSTD_getErrorName(error));
-                return 1;
-            }
-        } else {
-            size_t const error = ZSTD_initCStream(cstream, compressionLevel);
-            if (ZSTD_isError(error)) {
-                printf("ZSTD_initCStream error : %s \n", ZSTD_getErrorName(error));
-                return 1;
-            }
-        }
-
-        size_t compressedSize;
-        {   ZSTD_inBuffer inBuff = { dataToCompress, sizeof(dataToCompress), 0 };
-            ZSTD_outBuffer outBuff = { compressedData, sizeof(compressedData), 0 };
-            size_t const cError = ZSTD_compressStream(cstream, &outBuff, &inBuff);
-            if (ZSTD_isError(cError)) {
-                printf("ZSTD_compressStream error : %s \n", ZSTD_getErrorName(cError));
-                return 1;
-            }
-            size_t const fError = ZSTD_endStream(cstream, &outBuff);
-            if (ZSTD_isError(fError)) {
-                printf("ZSTD_endStream error : %s \n", ZSTD_getErrorName(fError));
-                return 1;
-            }
-            compressedSize = outBuff.pos;
-        }
-
-        ZSTD_DStream* dstream = ZSTD_createDStream();
-        if (dstream==NULL) {
-            printf("Level %i : ZSTD_DStream Memory allocation failure \n", compressionLevel);
-            return 1;
-        }
-        {   size_t const error = ZSTD_initDStream(dstream);
-            if (ZSTD_isError(error)) {
-                printf("ZSTD_initDStream error : %s \n", ZSTD_getErrorName(error));
-                return 1;
-            }
-        }
-        /* forces decompressor to use maximum memory size, as decompressed size is not known */
-        {   ZSTD_inBuffer inBuff = { compressedData, compressedSize, 0 };
-            ZSTD_outBuffer outBuff = { decompressedData, sizeof(decompressedData), 0 };
-            size_t const dResult = ZSTD_decompressStream(dstream, &outBuff, &inBuff);
-            if (ZSTD_isError(dResult)) {
-                printf("ZSTD_decompressStream error : %s \n", ZSTD_getErrorName(dResult));
-                return 1;
-            }
-            if (dResult != 0) {
-                printf("ZSTD_decompressStream error : unfinished decompression \n");
-                return 1;
-            }
-            if (outBuff.pos != sizeof(dataToCompress)) {
-                printf("ZSTD_decompressStream error : incorrect decompression \n");
-                return 1;
-            }
-        }
-
-        size_t const cstreamSize = ZSTD_sizeof_CStream(cstream);
-        size_t const cstreamEstimatedSize = wLog ?
-                ZSTD_estimateCStreamSize_usingCParams(params.cParams) :
-                ZSTD_estimateCStreamSize(compressionLevel);
-        size_t const dstreamSize = ZSTD_sizeof_DStream(dstream);
-
-        printf("Level %2i : Compression Mem = %5u KB (estimated : %5u KB) ; Decompression Mem = %4u KB \n",
-                compressionLevel,
-                (unsigned)(cstreamSize>>10), (unsigned)(cstreamEstimatedSize>>10), (unsigned)(dstreamSize>>10));
-
-        ZSTD_freeDStream(dstream);
-        ZSTD_freeCStream(cstream);
-        if (wLog) break;  /* single test */
-    }
-    return 0;
-}
diff --git a/priv/zstd/lib/.gitignore b/priv/zstd/lib/.gitignore
deleted file mode 100644
index 4cd50ac..0000000
--- a/priv/zstd/lib/.gitignore
+++ /dev/null
@@ -1,3 +0,0 @@
-# make install artefact
-libzstd.pc
-libzstd-nomt
diff --git a/priv/zstd/lib/BUCK b/priv/zstd/lib/BUCK
deleted file mode 100644
index 9e01468..0000000
--- a/priv/zstd/lib/BUCK
+++ /dev/null
@@ -1,207 +0,0 @@
-cxx_library(
-    name='zstd',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    deps=[
-        ':common',
-        ':compress',
-        ':decompress',
-        ':deprecated',
-    ],
-)
-
-cxx_library(
-    name='compress',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('compress', 'zstd*.h'),
-    ]),
-    srcs=glob(['compress/zstd*.c']),
-    deps=[':common'],
-)
-
-cxx_library(
-    name='decompress',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    srcs=glob(['decompress/zstd*.c']),
-    deps=[
-        ':common',
-        ':legacy',
-    ],
-)
-
-cxx_library(
-    name='deprecated',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('decprecated', '*.h'),
-    ]),
-    srcs=glob(['deprecated/*.c']),
-    deps=[':common'],
-)
-
-cxx_library(
-    name='legacy',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('legacy', '*.h'),
-    ]),
-    srcs=glob(['legacy/*.c']),
-    deps=[':common'],
-    exported_preprocessor_flags=[
-        '-DZSTD_LEGACY_SUPPORT=4',
-    ],
-)
-
-cxx_library(
-    name='zdict',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('dictBuilder', 'zdict.h'),
-    ]),
-    headers=subdir_glob([
-        ('dictBuilder', 'divsufsort.h'),
-    ]),
-    srcs=glob(['dictBuilder/*.c']),
-    deps=[':common'],
-)
-
-cxx_library(
-    name='compiler',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'compiler.h'),
-    ]),
-)
-
-cxx_library(
-    name='bitstream',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'bitstream.h'),
-    ]),
-)
-
-cxx_library(
-    name='entropy',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'fse.h'),
-        ('common', 'huf.h'),
-    ]),
-    srcs=[
-        'common/entropy_common.c',
-        'common/fse_decompress.c',
-        'compress/fse_compress.c',
-        'compress/huf_compress.c',
-        'decompress/huf_decompress.c',
-    ],
-    deps=[
-        ':bitstream',
-        ':compiler',
-        ':errors',
-        ':mem',
-    ],
-)
-
-cxx_library(
-    name='errors',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'error_private.h'),
-        ('common', 'zstd_errors.h'),
-    ]),
-    srcs=['common/error_private.c'],
-)
-
-cxx_library(
-    name='mem',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'mem.h'),
-    ]),
-)
-
-cxx_library(
-    name='pool',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'pool.h'),
-    ]),
-    srcs=['common/pool.c'],
-    deps=[
-        ':threading',
-        ':zstd_common',
-    ],
-)
-
-cxx_library(
-    name='threading',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'threading.h'),
-    ]),
-    srcs=['common/threading.c'],
-    exported_preprocessor_flags=[
-        '-DZSTD_MULTITHREAD',
-    ],
-    exported_linker_flags=[
-        '-pthread',
-    ],
-)
-
-cxx_library(
-    name='xxhash',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('common', 'xxhash.h'),
-    ]),
-    srcs=['common/xxhash.c'],
-    exported_preprocessor_flags=[
-        '-DXXH_NAMESPACE=ZSTD_',
-    ],
-)
-
-cxx_library(
-    name='zstd_common',
-    header_namespace='',
-    visibility=['PUBLIC'],
-    exported_headers=subdir_glob([
-        ('', 'zstd.h'),
-        ('common', 'zstd_internal.h'),
-    ]),
-    srcs=['common/zstd_common.c'],
-    deps=[
-        ':compiler',
-        ':errors',
-        ':mem',
-    ],
-)
-
-cxx_library(
-    name='common',
-    deps=[
-        ':bitstream',
-        ':compiler',
-        ':entropy',
-        ':errors',
-        ':mem',
-        ':pool',
-        ':threading',
-        ':xxhash',
-        ':zstd_common',
-    ]
-)
diff --git a/priv/zstd/lib/Makefile b/priv/zstd/lib/Makefile
deleted file mode 100644
index cdfdc5c..0000000
--- a/priv/zstd/lib/Makefile
+++ /dev/null
@@ -1,189 +0,0 @@
-# ################################################################
-# Copyright (c) 2015-present, Yann Collet, Facebook, Inc.
-# All rights reserved.
-#
-# This source code is licensed under both the BSD-style license (found in the
-# LICENSE file in the root directory of this source tree) and the GPLv2 (found
-# in the COPYING file in the root directory of this source tree).
-# ################################################################
-
-# Version numbers
-LIBVER_MAJOR_SCRIPT:=`sed -n '/define ZSTD_VERSION_MAJOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < ./zstd.h`
-LIBVER_MINOR_SCRIPT:=`sed -n '/define ZSTD_VERSION_MINOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < ./zstd.h`
-LIBVER_PATCH_SCRIPT:=`sed -n '/define ZSTD_VERSION_RELEASE/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < ./zstd.h`
-LIBVER_SCRIPT:= $(LIBVER_MAJOR_SCRIPT).$(LIBVER_MINOR_SCRIPT).$(LIBVER_PATCH_SCRIPT)
-LIBVER_MAJOR := $(shell echo $(LIBVER_MAJOR_SCRIPT))
-LIBVER_MINOR := $(shell echo $(LIBVER_MINOR_SCRIPT))
-LIBVER_PATCH := $(shell echo $(LIBVER_PATCH_SCRIPT))
-LIBVER := $(shell echo $(LIBVER_SCRIPT))
-VERSION?= $(LIBVER)
-
-CPPFLAGS+= -I. -I./common -DXXH_NAMESPACE=ZSTD_
-CFLAGS  ?= -O3
-DEBUGFLAGS = -Wall -Wextra -Wcast-qual -Wcast-align -Wshadow \
-            -Wstrict-aliasing=1 -Wswitch-enum -Wdeclaration-after-statement \
-            -Wstrict-prototypes -Wundef -Wpointer-arith -Wformat-security \
-            -Wvla -Wformat=2 -Winit-self -Wfloat-equal -Wwrite-strings \
-            -Wredundant-decls
-CFLAGS  += $(DEBUGFLAGS) $(MOREFLAGS)
-FLAGS    = $(CPPFLAGS) $(CFLAGS)
-
-
-ZSTD_FILES := $(sort $(wildcard common/*.c compress/*.c decompress/*.c dictBuilder/*.c deprecated/*.c))
-
-ZSTD_LEGACY_SUPPORT ?= 4
-
-ifneq ($(ZSTD_LEGACY_SUPPORT), 0)
-ifeq ($(shell test $(ZSTD_LEGACY_SUPPORT) -lt 8; echo $$?), 0)
-	ZSTD_FILES += $(shell ls legacy/*.c | grep 'v0[$(ZSTD_LEGACY_SUPPORT)-7]')
-endif
-	CPPFLAGS += -I./legacy
-endif
-CPPFLAGS  += -DZSTD_LEGACY_SUPPORT=$(ZSTD_LEGACY_SUPPORT)
-
-ZSTD_OBJ   := $(patsubst %.c,%.o,$(ZSTD_FILES))
-
-# OS X linker doesn't support -soname, and use different extension
-# see : https://developer.apple.com/library/mac/documentation/DeveloperTools/Conceptual/DynamicLibraries/100-Articles/DynamicLibraryDesignGuidelines.html
-ifeq ($(shell uname), Darwin)
-	SHARED_EXT = dylib
-	SHARED_EXT_MAJOR = $(LIBVER_MAJOR).$(SHARED_EXT)
-	SHARED_EXT_VER = $(LIBVER).$(SHARED_EXT)
-	SONAME_FLAGS = -install_name $(LIBDIR)/libzstd.$(SHARED_EXT_MAJOR) -compatibility_version $(LIBVER_MAJOR) -current_version $(LIBVER)
-else
-	SONAME_FLAGS = -Wl,-soname=libzstd.$(SHARED_EXT).$(LIBVER_MAJOR)
-	SHARED_EXT = so
-	SHARED_EXT_MAJOR = $(SHARED_EXT).$(LIBVER_MAJOR)
-	SHARED_EXT_VER = $(SHARED_EXT).$(LIBVER)
-endif
-
-LIBZSTD = libzstd.$(SHARED_EXT_VER)
-
-
-.PHONY: default all clean install uninstall
-
-default: lib-release
-
-all: lib
-
-libzstd.a: ARFLAGS = rcs
-libzstd.a: $(ZSTD_OBJ)
-	@echo compiling static library
-	@$(AR) $(ARFLAGS) $@ $^
-
-libzstd.a-mt: CPPFLAGS += -DZSTD_MULTITHREAD
-libzstd.a-mt: libzstd.a
-
-$(LIBZSTD): LDFLAGS += -shared -fPIC -fvisibility=hidden
-$(LIBZSTD): $(ZSTD_FILES)
-	@echo compiling dynamic library $(LIBVER)
-ifneq (,$(filter Windows%,$(OS)))
-	@$(CC) $(FLAGS) -DZSTD_DLL_EXPORT=1 -shared $^ -o dll\libzstd.dll
-	dlltool -D dll\libzstd.dll -d dll\libzstd.def -l dll\libzstd.lib
-else
-	@$(CC) $(FLAGS) $^ $(LDFLAGS) $(SONAME_FLAGS) -o $@
-	@echo creating versioned links
-	@ln -sf $@ libzstd.$(SHARED_EXT_MAJOR)
-	@ln -sf $@ libzstd.$(SHARED_EXT)
-endif
-
-libzstd : $(LIBZSTD)
-
-libzstd-mt : CPPFLAGS += -DZSTD_MULTITHREAD
-libzstd-mt : libzstd
-
-lib: libzstd.a libzstd
-
-lib-mt: CPPFLAGS += -DZSTD_MULTITHREAD
-lib-mt: lib
-
-lib-release lib-release-mt: DEBUGFLAGS :=
-lib-release: lib
-lib-release-mt: lib-mt
-
-# Special case : building library in single-thread mode _and_ without zstdmt_compress.c
-ZSTDMT_FILES = compress/zstdmt_compress.c
-ZSTD_NOMT_FILES = $(filter-out $(ZSTDMT_FILES),$(ZSTD_FILES))
-libzstd-nomt: LDFLAGS += -shared -fPIC -fvisibility=hidden
-libzstd-nomt: $(ZSTD_NOMT_FILES)
-	@echo compiling single-thread dynamic library $(LIBVER)
-	@echo files : $(ZSTD_NOMT_FILES)
-	@$(CC) $(FLAGS) $^ $(LDFLAGS) $(SONAME_FLAGS) -o $@
-
-clean:
-	@$(RM) -r *.dSYM   # Mac OS-X specific
-	@$(RM) core *.o *.a *.gcda *.$(SHARED_EXT) *.$(SHARED_EXT).* libzstd.pc
-	@$(RM) dll/libzstd.dll dll/libzstd.lib libzstd-nomt*
-	@$(RM) common/*.o compress/*.o decompress/*.o dictBuilder/*.o legacy/*.o deprecated/*.o
-	@echo Cleaning library completed
-
-#-----------------------------------------------------------------------------
-# make install is validated only for Linux, OSX, BSD, Hurd and Solaris targets
-#-----------------------------------------------------------------------------
-ifneq (,$(filter $(shell uname),Linux Darwin GNU/kFreeBSD GNU OpenBSD FreeBSD NetBSD DragonFly SunOS))
-
-DESTDIR     ?=
-# directory variables : GNU conventions prefer lowercase
-# see https://www.gnu.org/prep/standards/html_node/Makefile-Conventions.html
-# support both lower and uppercase (BSD), use uppercase in script
-prefix      ?= /usr/local
-PREFIX      ?= $(prefix)
-exec_prefix ?= $(PREFIX)
-libdir      ?= $(exec_prefix)/lib
-LIBDIR      ?= $(libdir)
-includedir  ?= $(PREFIX)/include
-INCLUDEDIR  ?= $(includedir)
-
-ifneq (,$(filter $(shell uname),OpenBSD FreeBSD NetBSD DragonFly))
-PKGCONFIGDIR ?= $(PREFIX)/libdata/pkgconfig
-else
-PKGCONFIGDIR ?= $(LIBDIR)/pkgconfig
-endif
-
-ifneq (,$(filter $(shell uname),SunOS))
-INSTALL ?= ginstall
-else
-INSTALL ?= install
-endif
-
-INSTALL_PROGRAM ?= $(INSTALL)
-INSTALL_DATA    ?= $(INSTALL) -m 644
-
-
-libzstd.pc:
-libzstd.pc: libzstd.pc.in
-	@echo creating pkgconfig
-	@sed -e 's|@PREFIX@|$(PREFIX)|' \
-             -e 's|@LIBDIR@|$(LIBDIR)|' \
-             -e 's|@INCLUDEDIR@|$(INCLUDEDIR)|' \
-             -e 's|@VERSION@|$(VERSION)|' \
-             $< >$@
-
-install: libzstd.a libzstd libzstd.pc
-	@$(INSTALL) -d -m 755 $(DESTDIR)$(PKGCONFIGDIR)/ $(DESTDIR)$(INCLUDEDIR)/
-	@$(INSTALL_DATA) libzstd.pc $(DESTDIR)$(PKGCONFIGDIR)/
-	@echo Installing libraries
-	@$(INSTALL_DATA) libzstd.a $(DESTDIR)$(LIBDIR)
-	@$(INSTALL_PROGRAM) $(LIBZSTD) $(DESTDIR)$(LIBDIR)
-	@ln -sf $(LIBZSTD) $(DESTDIR)$(LIBDIR)/libzstd.$(SHARED_EXT_MAJOR)
-	@ln -sf $(LIBZSTD) $(DESTDIR)$(LIBDIR)/libzstd.$(SHARED_EXT)
-	@echo Installing includes
-	@$(INSTALL_DATA) zstd.h $(DESTDIR)$(INCLUDEDIR)
-	@$(INSTALL_DATA) common/zstd_errors.h $(DESTDIR)$(INCLUDEDIR)
-	@$(INSTALL_DATA) deprecated/zbuff.h $(DESTDIR)$(INCLUDEDIR)     # prototypes generate deprecation warnings
-	@$(INSTALL_DATA) dictBuilder/zdict.h $(DESTDIR)$(INCLUDEDIR)
-	@echo zstd static and shared library installed
-
-uninstall:
-	@$(RM) $(DESTDIR)$(LIBDIR)/libzstd.a
-	@$(RM) $(DESTDIR)$(LIBDIR)/libzstd.$(SHARED_EXT)
-	@$(RM) $(DESTDIR)$(LIBDIR)/libzstd.$(SHARED_EXT_MAJOR)
-	@$(RM) $(DESTDIR)$(LIBDIR)/$(LIBZSTD)
-	@$(RM) $(DESTDIR)$(PKGCONFIGDIR)/libzstd.pc
-	@$(RM) $(DESTDIR)$(INCLUDEDIR)/zstd.h
-	@$(RM) $(DESTDIR)$(INCLUDEDIR)/zstd_errors.h
-	@$(RM) $(DESTDIR)$(INCLUDEDIR)/zbuff.h   # Deprecated streaming functions
-	@$(RM) $(DESTDIR)$(INCLUDEDIR)/zdict.h
-	@echo zstd libraries successfully uninstalled
-
-endif
diff --git a/priv/zstd/lib/README.md b/priv/zstd/lib/README.md
deleted file mode 100644
index df136c4..0000000
--- a/priv/zstd/lib/README.md
+++ /dev/null
@@ -1,108 +0,0 @@
-Zstandard library files
-================================
-
-The __lib__ directory is split into several sub-directories,
-in order to make it easier to select or exclude specific features.
-
-
-#### Building
-
-`Makefile` script is provided, supporting the standard set of commands,
-directories, and variables (see https://www.gnu.org/prep/standards/html_node/Command-Variables.html).
-- `make` : generates both static and dynamic libraries
-- `make install` : install libraries in default system directories
-
-
-#### API
-
-Zstandard's stable API is exposed within [lib/zstd.h](zstd.h).
-
-
-#### Advanced API
-
-Optional advanced features are exposed via :
-
-- `lib/common/zstd_errors.h` : translates `size_t` function results
-                              into an `ZSTD_ErrorCode`, for accurate error handling.
-- `ZSTD_STATIC_LINKING_ONLY` : if this macro is defined _before_ including `zstd.h`,
-                          it unlocks access to advanced experimental API,
-                          exposed in second part of `zstd.h`.
-                          These APIs shall ___never be used with dynamic library___ !
-                          They are not "stable", their definition may change in the future.
-                          Only static linking is allowed.
-
-
-#### Modular build
-
-- Directory `lib/common` is always required, for all variants.
-- Compression source code lies in `lib/compress`
-- Decompression source code lies in `lib/decompress`
-- It's possible to include only `compress` or only `decompress`, they don't depend on each other.
-- `lib/dictBuilder` : makes it possible to generate dictionaries from a set of samples.
-    The API is exposed in `lib/dictBuilder/zdict.h`.
-    This module depends on both `lib/common` and `lib/compress` .
-- `lib/legacy` : source code to decompress older zstd formats, starting from `v0.1`.
-              This module depends on `lib/common` and `lib/decompress`.
-              To enable this feature, it's necessary to define `ZSTD_LEGACY_SUPPORT = 1` during compilation.
-              Typically, with `gcc`, add argument `-DZSTD_LEGACY_SUPPORT=1`.
-              Using higher number limits the number of version supported.
-              For example, `ZSTD_LEGACY_SUPPORT=2` means : "support legacy formats starting from v0.2+".
-              The API is exposed in `lib/legacy/zstd_legacy.h`.
-              Each version also provides a (dedicated) set of advanced API.
-              For example, advanced API for version `v0.4` is exposed in `lib/legacy/zstd_v04.h` .
-
-
-#### Multithreading support
-
-Multithreading is disabled by default when building with `make`.
-Enabling multithreading requires 2 conditions :
-- set macro `ZSTD_MULTITHREAD`
-- on POSIX systems : compile with pthread (`-pthread` compilation flag for `gcc` for example)
-
-Both conditions are automatically triggered by invoking `make lib-mt` target.
-Note that, when linking a POSIX program with a multithreaded version of `libzstd`,
-it's necessary to trigger `-pthread` flag during link stage.
-
-Multithreading capabilities are exposed via :
-- private API `lib/compress/zstdmt_compress.h`.
-  Symbols defined in this header are currently exposed in `libzstd`, hence usable.
-  Note however that this API is planned to be locked and remain strictly internal in the future.
-- advanced API `ZSTD_compress_generic()`, defined in `lib/zstd.h`, experimental section.
-  This API is still considered experimental, but is designed to be labelled "stable" at some point in the future.
-  It's the recommended entry point for multi-threading operations.
-
-
-#### Windows : using MinGW+MSYS to create DLL
-
-DLL can be created using MinGW+MSYS with the `make libzstd` command.
-This command creates `dll\libzstd.dll` and the import library `dll\libzstd.lib`.
-The import library is only required with Visual C++.
-The header file `zstd.h` and the dynamic library `dll\libzstd.dll` are required to
-compile a project using gcc/MinGW.
-The dynamic library has to be added to linking options.
-It means that if a project that uses ZSTD consists of a single `test-dll.c`
-file it should be linked with `dll\libzstd.dll`. For example:
-```
-    gcc $(CFLAGS) -Iinclude/ test-dll.c -o test-dll dll\libzstd.dll
-```
-The compiled executable will require ZSTD DLL which is available at `dll\libzstd.dll`.
-
-
-#### Deprecated API
-
-Obsolete API on their way out are stored in directory `lib/deprecated`.
-At this stage, it contains older streaming prototypes, in `lib/deprecated/zbuff.h`.
-Presence in this directory is temporary.
-These prototypes will be removed in some future version.
-Consider migrating code towards supported streaming API exposed in `zstd.h`.
-
-
-#### Miscellaneous
-
-The other files are not source code. There are :
-
- - `LICENSE` : contains the BSD license text
- - `Makefile` : `make` script to build and install zstd library (static and dynamic)
- - `BUCK` : support for `buck` build system (https://buckbuild.com/)
- - `libzstd.pc.in` : for `pkg-config` (used in `make install`)
- - `README.md` : this file
diff --git a/priv/zstd/lib/common/bitstream.h b/priv/zstd/lib/common/bitstream.h
deleted file mode 100644
index fcf3843..0000000
--- a/priv/zstd/lib/common/bitstream.h
+++ /dev/null
@@ -1,471 +0,0 @@
-/* ******************************************************************
-   bitstream
-   Part of FSE library
-   header file (to include)
-   Copyright (C) 2013-2017, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-****************************************************************** */
-#ifndef BITSTREAM_H_MODULE
-#define BITSTREAM_H_MODULE
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/*
-*  This API consists of small unitary functions, which must be inlined for best performance.
-*  Since link-time-optimization is not available for all compilers,
-*  these functions are defined into a .h to be included.
-*/
-
-/*-****************************************
-*  Dependencies
-******************************************/
-#include "mem.h"            /* unaligned access routines */
-#include "error_private.h"  /* error codes and messages */
-
-
-/*-*************************************
-*  Debug
-***************************************/
-#if defined(BIT_DEBUG) && (BIT_DEBUG>=1)
-#  include 
-#else
-#  ifndef assert
-#    define assert(condition) ((void)0)
-#  endif
-#endif
-
-
-/*=========================================
-*  Target specific
-=========================================*/
-#if defined(__BMI__) && defined(__GNUC__)
-#  include    /* support for bextr (experimental) */
-#endif
-
-#define STREAM_ACCUMULATOR_MIN_32  25
-#define STREAM_ACCUMULATOR_MIN_64  57
-#define STREAM_ACCUMULATOR_MIN    ((U32)(MEM_32bits() ? STREAM_ACCUMULATOR_MIN_32 : STREAM_ACCUMULATOR_MIN_64))
-
-
-/*-******************************************
-*  bitStream encoding API (write forward)
-********************************************/
-/* bitStream can mix input from multiple sources.
- * A critical property of these streams is that they encode and decode in **reverse** direction.
- * So the first bit sequence you add will be the last to be read, like a LIFO stack.
- */
-typedef struct
-{
-    size_t bitContainer;
-    unsigned bitPos;
-    char*  startPtr;
-    char*  ptr;
-    char*  endPtr;
-} BIT_CStream_t;
-
-MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC, void* dstBuffer, size_t dstCapacity);
-MEM_STATIC void   BIT_addBits(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
-MEM_STATIC void   BIT_flushBits(BIT_CStream_t* bitC);
-MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC);
-
-/* Start with initCStream, providing the size of buffer to write into.
-*  bitStream will never write outside of this buffer.
-*  `dstCapacity` must be >= sizeof(bitD->bitContainer), otherwise @return will be an error code.
-*
-*  bits are first added to a local register.
-*  Local register is size_t, hence 64-bits on 64-bits systems, or 32-bits on 32-bits systems.
-*  Writing data into memory is an explicit operation, performed by the flushBits function.
-*  Hence keep track how many bits are potentially stored into local register to avoid register overflow.
-*  After a flushBits, a maximum of 7 bits might still be stored into local register.
-*
-*  Avoid storing elements of more than 24 bits if you want compatibility with 32-bits bitstream readers.
-*
-*  Last operation is to close the bitStream.
-*  The function returns the final size of CStream in bytes.
-*  If data couldn't fit into `dstBuffer`, it will return a 0 ( == not storable)
-*/
-
-
-/*-********************************************
-*  bitStream decoding API (read backward)
-**********************************************/
-typedef struct
-{
-    size_t   bitContainer;
-    unsigned bitsConsumed;
-    const char* ptr;
-    const char* start;
-    const char* limitPtr;
-} BIT_DStream_t;
-
-typedef enum { BIT_DStream_unfinished = 0,
-               BIT_DStream_endOfBuffer = 1,
-               BIT_DStream_completed = 2,
-               BIT_DStream_overflow = 3 } BIT_DStream_status;  /* result of BIT_reloadDStream() */
-               /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
-
-MEM_STATIC size_t   BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
-MEM_STATIC size_t   BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
-MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);
-MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);
-
-
-/* Start by invoking BIT_initDStream().
-*  A chunk of the bitStream is then stored into a local register.
-*  Local register size is 64-bits on 64-bits systems, 32-bits on 32-bits systems (size_t).
-*  You can then retrieve bitFields stored into the local register, **in reverse order**.
-*  Local register is explicitly reloaded from memory by the BIT_reloadDStream() method.
-*  A reload guarantee a minimum of ((8*sizeof(bitD->bitContainer))-7) bits when its result is BIT_DStream_unfinished.
-*  Otherwise, it can be less than that, so proceed accordingly.
-*  Checking if DStream has reached its end can be performed with BIT_endOfDStream().
-*/
-
-
-/*-****************************************
-*  unsafe API
-******************************************/
-MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC, size_t value, unsigned nbBits);
-/* faster, but works only if value is "clean", meaning all high bits above nbBits are 0 */
-
-MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC);
-/* unsafe version; does not check buffer overflow */
-
-MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
-/* faster, but works only if nbBits >= 1 */
-
-
-
-/*-**************************************************************
-*  Internal functions
-****************************************************************/
-MEM_STATIC unsigned BIT_highbit32 (U32 val)
-{
-    assert(val != 0);
-    {
-#   if defined(_MSC_VER)   /* Visual */
-        unsigned long r=0;
-        _BitScanReverse ( &r, val );
-        return (unsigned) r;
-#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* Use GCC Intrinsic */
-        return 31 - __builtin_clz (val);
-#   else   /* Software version */
-        static const unsigned DeBruijnClz[32] = { 0,  9,  1, 10, 13, 21,  2, 29,
-                                                 11, 14, 16, 18, 22, 25,  3, 30,
-                                                  8, 12, 20, 28, 15, 17, 24,  7,
-                                                 19, 27, 23,  6, 26,  5,  4, 31 };
-        U32 v = val;
-        v |= v >> 1;
-        v |= v >> 2;
-        v |= v >> 4;
-        v |= v >> 8;
-        v |= v >> 16;
-        return DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
-#   endif
-    }
-}
-
-/*=====    Local Constants   =====*/
-static const unsigned BIT_mask[] = {
-    0,          1,         3,         7,         0xF,       0x1F,
-    0x3F,       0x7F,      0xFF,      0x1FF,     0x3FF,     0x7FF,
-    0xFFF,      0x1FFF,    0x3FFF,    0x7FFF,    0xFFFF,    0x1FFFF,
-    0x3FFFF,    0x7FFFF,   0xFFFFF,   0x1FFFFF,  0x3FFFFF,  0x7FFFFF,
-    0xFFFFFF,   0x1FFFFFF, 0x3FFFFFF, 0x7FFFFFF, 0xFFFFFFF, 0x1FFFFFFF,
-    0x3FFFFFFF, 0x7FFFFFFF}; /* up to 31 bits */
-#define BIT_MASK_SIZE (sizeof(BIT_mask) / sizeof(BIT_mask[0]))
-
-/*-**************************************************************
-*  bitStream encoding
-****************************************************************/
-/*! BIT_initCStream() :
- *  `dstCapacity` must be > sizeof(size_t)
- *  @return : 0 if success,
- *            otherwise an error code (can be tested using ERR_isError()) */
-MEM_STATIC size_t BIT_initCStream(BIT_CStream_t* bitC,
-                                  void* startPtr, size_t dstCapacity)
-{
-    bitC->bitContainer = 0;
-    bitC->bitPos = 0;
-    bitC->startPtr = (char*)startPtr;
-    bitC->ptr = bitC->startPtr;
-    bitC->endPtr = bitC->startPtr + dstCapacity - sizeof(bitC->bitContainer);
-    if (dstCapacity <= sizeof(bitC->bitContainer)) return ERROR(dstSize_tooSmall);
-    return 0;
-}
-
-/*! BIT_addBits() :
- *  can add up to 31 bits into `bitC`.
- *  Note : does not check for register overflow ! */
-MEM_STATIC void BIT_addBits(BIT_CStream_t* bitC,
-                            size_t value, unsigned nbBits)
-{
-    MEM_STATIC_ASSERT(BIT_MASK_SIZE == 32);
-    assert(nbBits < BIT_MASK_SIZE);
-    assert(nbBits + bitC->bitPos < sizeof(bitC->bitContainer) * 8);
-    bitC->bitContainer |= (value & BIT_mask[nbBits]) << bitC->bitPos;
-    bitC->bitPos += nbBits;
-}
-
-/*! BIT_addBitsFast() :
- *  works only if `value` is _clean_, meaning all high bits above nbBits are 0 */
-MEM_STATIC void BIT_addBitsFast(BIT_CStream_t* bitC,
-                                size_t value, unsigned nbBits)
-{
-    assert((value>>nbBits) == 0);
-    assert(nbBits + bitC->bitPos < sizeof(bitC->bitContainer) * 8);
-    bitC->bitContainer |= value << bitC->bitPos;
-    bitC->bitPos += nbBits;
-}
-
-/*! BIT_flushBitsFast() :
- *  assumption : bitContainer has not overflowed
- *  unsafe version; does not check buffer overflow */
-MEM_STATIC void BIT_flushBitsFast(BIT_CStream_t* bitC)
-{
-    size_t const nbBytes = bitC->bitPos >> 3;
-    assert(bitC->bitPos < sizeof(bitC->bitContainer) * 8);
-    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
-    bitC->ptr += nbBytes;
-    assert(bitC->ptr <= bitC->endPtr);
-    bitC->bitPos &= 7;
-    bitC->bitContainer >>= nbBytes*8;
-}
-
-/*! BIT_flushBits() :
- *  assumption : bitContainer has not overflowed
- *  safe version; check for buffer overflow, and prevents it.
- *  note : does not signal buffer overflow.
- *  overflow will be revealed later on using BIT_closeCStream() */
-MEM_STATIC void BIT_flushBits(BIT_CStream_t* bitC)
-{
-    size_t const nbBytes = bitC->bitPos >> 3;
-    assert(bitC->bitPos < sizeof(bitC->bitContainer) * 8);
-    MEM_writeLEST(bitC->ptr, bitC->bitContainer);
-    bitC->ptr += nbBytes;
-    if (bitC->ptr > bitC->endPtr) bitC->ptr = bitC->endPtr;
-    bitC->bitPos &= 7;
-    bitC->bitContainer >>= nbBytes*8;
-}
-
-/*! BIT_closeCStream() :
- *  @return : size of CStream, in bytes,
- *            or 0 if it could not fit into dstBuffer */
-MEM_STATIC size_t BIT_closeCStream(BIT_CStream_t* bitC)
-{
-    BIT_addBitsFast(bitC, 1, 1);   /* endMark */
-    BIT_flushBits(bitC);
-    if (bitC->ptr >= bitC->endPtr) return 0; /* overflow detected */
-    return (bitC->ptr - bitC->startPtr) + (bitC->bitPos > 0);
-}
-
-
-/*-********************************************************
-*  bitStream decoding
-**********************************************************/
-/*! BIT_initDStream() :
- *  Initialize a BIT_DStream_t.
- * `bitD` : a pointer to an already allocated BIT_DStream_t structure.
- * `srcSize` must be the *exact* size of the bitStream, in bytes.
- * @return : size of stream (== srcSize), or an errorCode if a problem is detected
- */
-MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
-{
-    if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
-
-    bitD->start = (const char*)srcBuffer;
-    bitD->limitPtr = bitD->start + sizeof(bitD->bitContainer);
-
-    if (srcSize >=  sizeof(bitD->bitContainer)) {  /* normal case */
-        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(bitD->bitContainer);
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);
-        { BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
-          bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;  /* ensures bitsConsumed is always set */
-          if (lastByte == 0) return ERROR(GENERIC); /* endMark not present */ }
-    } else {
-        bitD->ptr   = bitD->start;
-        bitD->bitContainer = *(const BYTE*)(bitD->start);
-        switch(srcSize)
-        {
-        case 7: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[6]) << (sizeof(bitD->bitContainer)*8 - 16);
-                /* fall-through */
-
-        case 6: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[5]) << (sizeof(bitD->bitContainer)*8 - 24);
-                /* fall-through */
-
-        case 5: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[4]) << (sizeof(bitD->bitContainer)*8 - 32);
-                /* fall-through */
-
-        case 4: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[3]) << 24;
-                /* fall-through */
-
-        case 3: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[2]) << 16;
-                /* fall-through */
-
-        case 2: bitD->bitContainer += (size_t)(((const BYTE*)(srcBuffer))[1]) <<  8;
-                /* fall-through */
-
-        default: break;
-        }
-        {   BYTE const lastByte = ((const BYTE*)srcBuffer)[srcSize-1];
-            bitD->bitsConsumed = lastByte ? 8 - BIT_highbit32(lastByte) : 0;
-            if (lastByte == 0) return ERROR(corruption_detected);  /* endMark not present */
-        }
-        bitD->bitsConsumed += (U32)(sizeof(bitD->bitContainer) - srcSize)*8;
-    }
-
-    return srcSize;
-}
-
-MEM_STATIC size_t BIT_getUpperBits(size_t bitContainer, U32 const start)
-{
-    return bitContainer >> start;
-}
-
-MEM_STATIC size_t BIT_getMiddleBits(size_t bitContainer, U32 const start, U32 const nbBits)
-{
-#if defined(__BMI__) && defined(__GNUC__) && __GNUC__*1000+__GNUC_MINOR__ >= 4008  /* experimental */
-#  if defined(__x86_64__)
-    if (sizeof(bitContainer)==8)
-        return _bextr_u64(bitContainer, start, nbBits);
-    else
-#  endif
-        return _bextr_u32(bitContainer, start, nbBits);
-#else
-    assert(nbBits < BIT_MASK_SIZE);
-    return (bitContainer >> start) & BIT_mask[nbBits];
-#endif
-}
-
-MEM_STATIC size_t BIT_getLowerBits(size_t bitContainer, U32 const nbBits)
-{
-    assert(nbBits < BIT_MASK_SIZE);
-    return bitContainer & BIT_mask[nbBits];
-}
-
-/*! BIT_lookBits() :
- *  Provides next n bits from local register.
- *  local register is not modified.
- *  On 32-bits, maxNbBits==24.
- *  On 64-bits, maxNbBits==56.
- * @return : value extracted */
-MEM_STATIC size_t BIT_lookBits(const BIT_DStream_t* bitD, U32 nbBits)
-{
-#if defined(__BMI__) && defined(__GNUC__)   /* experimental; fails if bitD->bitsConsumed + nbBits > sizeof(bitD->bitContainer)*8 */
-    return BIT_getMiddleBits(bitD->bitContainer, (sizeof(bitD->bitContainer)*8) - bitD->bitsConsumed - nbBits, nbBits);
-#else
-    U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
-    return ((bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> 1) >> ((regMask-nbBits) & regMask);
-#endif
-}
-
-/*! BIT_lookBitsFast() :
- *  unsafe version; only works if nbBits >= 1 */
-MEM_STATIC size_t BIT_lookBitsFast(const BIT_DStream_t* bitD, U32 nbBits)
-{
-    U32 const regMask = sizeof(bitD->bitContainer)*8 - 1;
-    assert(nbBits >= 1);
-    return (bitD->bitContainer << (bitD->bitsConsumed & regMask)) >> (((regMask+1)-nbBits) & regMask);
-}
-
-MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
-{
-    bitD->bitsConsumed += nbBits;
-}
-
-/*! BIT_readBits() :
- *  Read (consume) next n bits from local register and update.
- *  Pay attention to not read more than nbBits contained into local register.
- * @return : extracted value. */
-MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
-{
-    size_t const value = BIT_lookBits(bitD, nbBits);
-    BIT_skipBits(bitD, nbBits);
-    return value;
-}
-
-/*! BIT_readBitsFast() :
- *  unsafe version; only works only if nbBits >= 1 */
-MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
-{
-    size_t const value = BIT_lookBitsFast(bitD, nbBits);
-    assert(nbBits >= 1);
-    BIT_skipBits(bitD, nbBits);
-    return value;
-}
-
-/*! BIT_reloadDStream() :
- *  Refill `bitD` from buffer previously set in BIT_initDStream() .
- *  This function is safe, it guarantees it will not read beyond src buffer.
- * @return : status of `BIT_DStream_t` internal register.
- *           when status == BIT_DStream_unfinished, internal register is filled with at least 25 or 57 bits */
-MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
-{
-    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* overflow detected, like end of stream */
-        return BIT_DStream_overflow;
-
-    if (bitD->ptr >= bitD->limitPtr) {
-        bitD->ptr -= bitD->bitsConsumed >> 3;
-        bitD->bitsConsumed &= 7;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);
-        return BIT_DStream_unfinished;
-    }
-    if (bitD->ptr == bitD->start) {
-        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
-        return BIT_DStream_completed;
-    }
-    /* start < ptr < limitPtr */
-    {   U32 nbBytes = bitD->bitsConsumed >> 3;
-        BIT_DStream_status result = BIT_DStream_unfinished;
-        if (bitD->ptr - nbBytes < bitD->start) {
-            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
-            result = BIT_DStream_endOfBuffer;
-        }
-        bitD->ptr -= nbBytes;
-        bitD->bitsConsumed -= nbBytes*8;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD->bitContainer), otherwise bitD->ptr == bitD->start */
-        return result;
-    }
-}
-
-/*! BIT_endOfDStream() :
- * @return : 1 if DStream has _exactly_ reached its end (all bits consumed).
- */
-MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
-{
-    return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
-}
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* BITSTREAM_H_MODULE */
diff --git a/priv/zstd/lib/common/compiler.h b/priv/zstd/lib/common/compiler.h
deleted file mode 100644
index 3a7553c..0000000
--- a/priv/zstd/lib/common/compiler.h
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_COMPILER_H
-#define ZSTD_COMPILER_H
-
-/*-*******************************************************
-*  Compiler specifics
-*********************************************************/
-/* force inlining */
-#if defined (__GNUC__) || defined(__cplusplus) || defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#  define INLINE_KEYWORD inline
-#else
-#  define INLINE_KEYWORD
-#endif
-
-#if defined(__GNUC__)
-#  define FORCE_INLINE_ATTR __attribute__((always_inline))
-#elif defined(_MSC_VER)
-#  define FORCE_INLINE_ATTR __forceinline
-#else
-#  define FORCE_INLINE_ATTR
-#endif
-
-/**
- * FORCE_INLINE_TEMPLATE is used to define C "templates", which take constant
- * parameters. They must be inlined for the compiler to elimininate the constant
- * branches.
- */
-#define FORCE_INLINE_TEMPLATE static INLINE_KEYWORD FORCE_INLINE_ATTR
-/**
- * HINT_INLINE is used to help the compiler generate better code. It is *not*
- * used for "templates", so it can be tweaked based on the compilers
- * performance.
- *
- * gcc-4.8 and gcc-4.9 have been shown to benefit from leaving off the
- * always_inline attribute.
- *
- * clang up to 5.0.0 (trunk) benefit tremendously from the always_inline
- * attribute.
- */
-#if !defined(__clang__) && defined(__GNUC__) && __GNUC__ >= 4 && __GNUC_MINOR__ >= 8 && __GNUC__ < 5
-#  define HINT_INLINE static INLINE_KEYWORD
-#else
-#  define HINT_INLINE static INLINE_KEYWORD FORCE_INLINE_ATTR
-#endif
-
-/* force no inlining */
-#ifdef _MSC_VER
-#  define FORCE_NOINLINE static __declspec(noinline)
-#else
-#  ifdef __GNUC__
-#    define FORCE_NOINLINE static __attribute__((__noinline__))
-#  else
-#    define FORCE_NOINLINE static
-#  endif
-#endif
-
-/* prefetch */
-#if defined(_MSC_VER) && (defined(_M_X64) || defined(_M_I86))  /* _mm_prefetch() is not defined outside of x86/x64 */
-#  include    /* https://msdn.microsoft.com/fr-fr/library/84szxsww(v=vs.90).aspx */
-#  define PREFETCH(ptr)   _mm_prefetch((const char*)ptr, _MM_HINT_T0)
-#elif defined(__GNUC__)
-#  define PREFETCH(ptr)   __builtin_prefetch(ptr, 0, 0)
-#else
-#  define PREFETCH(ptr)   /* disabled */
-#endif
-
-/* disable warnings */
-#ifdef _MSC_VER    /* Visual Studio */
-#  include                     /* For Visual 2005 */
-#  pragma warning(disable : 4100)        /* disable: C4100: unreferenced formal parameter */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4204)        /* disable: C4204: non-constant aggregate initializer */
-#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
-#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
-#endif
-
-#endif /* ZSTD_COMPILER_H */
diff --git a/priv/zstd/lib/common/entropy_common.c b/priv/zstd/lib/common/entropy_common.c
deleted file mode 100644
index b37a082..0000000
--- a/priv/zstd/lib/common/entropy_common.c
+++ /dev/null
@@ -1,221 +0,0 @@
-/*
-   Common functions of New Generation Entropy library
-   Copyright (C) 2016, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-*************************************************************************** */
-
-/* *************************************
-*  Dependencies
-***************************************/
-#include "mem.h"
-#include "error_private.h"       /* ERR_*, ERROR */
-#define FSE_STATIC_LINKING_ONLY  /* FSE_MIN_TABLELOG */
-#include "fse.h"
-#define HUF_STATIC_LINKING_ONLY  /* HUF_TABLELOG_ABSOLUTEMAX */
-#include "huf.h"
-
-
-/*===   Version   ===*/
-unsigned FSE_versionNumber(void) { return FSE_VERSION_NUMBER; }
-
-
-/*===   Error Management   ===*/
-unsigned FSE_isError(size_t code) { return ERR_isError(code); }
-const char* FSE_getErrorName(size_t code) { return ERR_getErrorName(code); }
-
-unsigned HUF_isError(size_t code) { return ERR_isError(code); }
-const char* HUF_getErrorName(size_t code) { return ERR_getErrorName(code); }
-
-
-/*-**************************************************************
-*  FSE NCount encoding-decoding
-****************************************************************/
-size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,
-                 const void* headerBuffer, size_t hbSize)
-{
-    const BYTE* const istart = (const BYTE*) headerBuffer;
-    const BYTE* const iend = istart + hbSize;
-    const BYTE* ip = istart;
-    int nbBits;
-    int remaining;
-    int threshold;
-    U32 bitStream;
-    int bitCount;
-    unsigned charnum = 0;
-    int previous0 = 0;
-
-    if (hbSize < 4) return ERROR(srcSize_wrong);
-    bitStream = MEM_readLE32(ip);
-    nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
-    if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);
-    bitStream >>= 4;
-    bitCount = 4;
-    *tableLogPtr = nbBits;
-    remaining = (1<1) & (charnum<=*maxSVPtr)) {
-        if (previous0) {
-            unsigned n0 = charnum;
-            while ((bitStream & 0xFFFF) == 0xFFFF) {
-                n0 += 24;
-                if (ip < iend-5) {
-                    ip += 2;
-                    bitStream = MEM_readLE32(ip) >> bitCount;
-                } else {
-                    bitStream >>= 16;
-                    bitCount   += 16;
-            }   }
-            while ((bitStream & 3) == 3) {
-                n0 += 3;
-                bitStream >>= 2;
-                bitCount += 2;
-            }
-            n0 += bitStream & 3;
-            bitCount += 2;
-            if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);
-            while (charnum < n0) normalizedCounter[charnum++] = 0;
-            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
-                ip += bitCount>>3;
-                bitCount &= 7;
-                bitStream = MEM_readLE32(ip) >> bitCount;
-            } else {
-                bitStream >>= 2;
-        }   }
-        {   int const max = (2*threshold-1) - remaining;
-            int count;
-
-            if ((bitStream & (threshold-1)) < (U32)max) {
-                count = bitStream & (threshold-1);
-                bitCount += nbBits-1;
-            } else {
-                count = bitStream & (2*threshold-1);
-                if (count >= threshold) count -= max;
-                bitCount += nbBits;
-            }
-
-            count--;   /* extra accuracy */
-            remaining -= count < 0 ? -count : count;   /* -1 means +1 */
-            normalizedCounter[charnum++] = (short)count;
-            previous0 = !count;
-            while (remaining < threshold) {
-                nbBits--;
-                threshold >>= 1;
-            }
-
-            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4)) {
-                ip += bitCount>>3;
-                bitCount &= 7;
-            } else {
-                bitCount -= (int)(8 * (iend - 4 - ip));
-                ip = iend - 4;
-            }
-            bitStream = MEM_readLE32(ip) >> (bitCount & 31);
-    }   }   /* while ((remaining>1) & (charnum<=*maxSVPtr)) */
-    if (remaining != 1) return ERROR(corruption_detected);
-    if (bitCount > 32) return ERROR(corruption_detected);
-    *maxSVPtr = charnum-1;
-
-    ip += (bitCount+7)>>3;
-    return ip-istart;
-}
-
-
-/*! HUF_readStats() :
-    Read compact Huffman tree, saved by HUF_writeCTable().
-    `huffWeight` is destination buffer.
-    `rankStats` is assumed to be a table of at least HUF_TABLELOG_MAX U32.
-    @return : size read from `src` , or an error Code .
-    Note : Needed by HUF_readCTable() and HUF_readDTableX?() .
-*/
-size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
-                     U32* nbSymbolsPtr, U32* tableLogPtr,
-                     const void* src, size_t srcSize)
-{
-    U32 weightTotal;
-    const BYTE* ip = (const BYTE*) src;
-    size_t iSize;
-    size_t oSize;
-
-    if (!srcSize) return ERROR(srcSize_wrong);
-    iSize = ip[0];
-    /* memset(huffWeight, 0, hwSize);   *//* is not necessary, even though some analyzer complain ... */
-
-    if (iSize >= 128) {  /* special header */
-        oSize = iSize - 127;
-        iSize = ((oSize+1)/2);
-        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
-        if (oSize >= hwSize) return ERROR(corruption_detected);
-        ip += 1;
-        {   U32 n;
-            for (n=0; n> 4;
-                huffWeight[n+1] = ip[n/2] & 15;
-    }   }   }
-    else  {   /* header compressed with FSE (normal case) */
-        FSE_DTable fseWorkspace[FSE_DTABLE_SIZE_U32(6)];  /* 6 is max possible tableLog for HUF header (maybe even 5, to be tested) */
-        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
-        oSize = FSE_decompress_wksp(huffWeight, hwSize-1, ip+1, iSize, fseWorkspace, 6);   /* max (hwSize-1) values decoded, as last one is implied */
-        if (FSE_isError(oSize)) return oSize;
-    }
-
-    /* collect weight stats */
-    memset(rankStats, 0, (HUF_TABLELOG_MAX + 1) * sizeof(U32));
-    weightTotal = 0;
-    {   U32 n; for (n=0; n= HUF_TABLELOG_MAX) return ERROR(corruption_detected);
-            rankStats[huffWeight[n]]++;
-            weightTotal += (1 << huffWeight[n]) >> 1;
-    }   }
-    if (weightTotal == 0) return ERROR(corruption_detected);
-
-    /* get last non-null symbol weight (implied, total must be 2^n) */
-    {   U32 const tableLog = BIT_highbit32(weightTotal) + 1;
-        if (tableLog > HUF_TABLELOG_MAX) return ERROR(corruption_detected);
-        *tableLogPtr = tableLog;
-        /* determine last weight */
-        {   U32 const total = 1 << tableLog;
-            U32 const rest = total - weightTotal;
-            U32 const verif = 1 << BIT_highbit32(rest);
-            U32 const lastWeight = BIT_highbit32(rest) + 1;
-            if (verif != rest) return ERROR(corruption_detected);    /* last value must be a clean power of 2 */
-            huffWeight[oSize] = (BYTE)lastWeight;
-            rankStats[lastWeight]++;
-    }   }
-
-    /* check tree construction validity */
-    if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected);   /* by construction : at least 2 elts of rank 1, must be even */
-
-    /* results */
-    *nbSymbolsPtr = (U32)(oSize+1);
-    return iSize+1;
-}
diff --git a/priv/zstd/lib/common/error_private.c b/priv/zstd/lib/common/error_private.c
deleted file mode 100644
index 11f7cda..0000000
--- a/priv/zstd/lib/common/error_private.c
+++ /dev/null
@@ -1,47 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/* The purpose of this file is to have a single list of error strings embedded in binary */
-
-#include "error_private.h"
-
-const char* ERR_getErrorString(ERR_enum code)
-{
-    static const char* const notErrorCode = "Unspecified error code";
-    switch( code )
-    {
-    case PREFIX(no_error): return "No error detected";
-    case PREFIX(GENERIC):  return "Error (generic)";
-    case PREFIX(prefix_unknown): return "Unknown frame descriptor";
-    case PREFIX(version_unsupported): return "Version not supported";
-    case PREFIX(frameParameter_unsupported): return "Unsupported frame parameter";
-    case PREFIX(frameParameter_windowTooLarge): return "Frame requires too much memory for decoding";
-    case PREFIX(corruption_detected): return "Corrupted block detected";
-    case PREFIX(checksum_wrong): return "Restored data doesn't match checksum";
-    case PREFIX(parameter_unsupported): return "Unsupported parameter";
-    case PREFIX(parameter_outOfBound): return "Parameter is out of bound";
-    case PREFIX(init_missing): return "Context should be init first";
-    case PREFIX(memory_allocation): return "Allocation error : not enough memory";
-    case PREFIX(stage_wrong): return "Operation not authorized at current processing stage";
-    case PREFIX(tableLog_tooLarge): return "tableLog requires too much memory : unsupported";
-    case PREFIX(maxSymbolValue_tooLarge): return "Unsupported max Symbol Value : too large";
-    case PREFIX(maxSymbolValue_tooSmall): return "Specified maxSymbolValue is too small";
-    case PREFIX(dictionary_corrupted): return "Dictionary is corrupted";
-    case PREFIX(dictionary_wrong): return "Dictionary mismatch";
-    case PREFIX(dictionaryCreation_failed): return "Cannot create Dictionary from provided samples";
-    case PREFIX(dstSize_tooSmall): return "Destination buffer is too small";
-    case PREFIX(srcSize_wrong): return "Src size is incorrect";
-        /* following error codes are not stable and may be removed or changed in a future version */
-    case PREFIX(frameIndex_tooLarge): return "Frame index is too large";
-    case PREFIX(seekableIO): return "An I/O error occurred when reading/seeking";
-    case PREFIX(maxCode):
-    default: return notErrorCode;
-    }
-}
diff --git a/priv/zstd/lib/common/error_private.h b/priv/zstd/lib/common/error_private.h
deleted file mode 100644
index 0d2fa7e..0000000
--- a/priv/zstd/lib/common/error_private.h
+++ /dev/null
@@ -1,76 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/* Note : this module is expected to remain private, do not expose it */
-
-#ifndef ERROR_H_MODULE
-#define ERROR_H_MODULE
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-/* ****************************************
-*  Dependencies
-******************************************/
-#include         /* size_t */
-#include "zstd_errors.h"  /* enum list */
-
-
-/* ****************************************
-*  Compiler-specific
-******************************************/
-#if defined(__GNUC__)
-#  define ERR_STATIC static __attribute__((unused))
-#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#  define ERR_STATIC static inline
-#elif defined(_MSC_VER)
-#  define ERR_STATIC static __inline
-#else
-#  define ERR_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
-#endif
-
-
-/*-****************************************
-*  Customization (error_public.h)
-******************************************/
-typedef ZSTD_ErrorCode ERR_enum;
-#define PREFIX(name) ZSTD_error_##name
-
-
-/*-****************************************
-*  Error codes handling
-******************************************/
-#undef ERROR   /* reported already defined on VS 2015 (Rich Geldreich) */
-#define ERROR(name) ZSTD_ERROR(name)
-#define ZSTD_ERROR(name) ((size_t)-PREFIX(name))
-
-ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
-
-ERR_STATIC ERR_enum ERR_getErrorCode(size_t code) { if (!ERR_isError(code)) return (ERR_enum)0; return (ERR_enum) (0-code); }
-
-
-/*-****************************************
-*  Error Strings
-******************************************/
-
-const char* ERR_getErrorString(ERR_enum code);   /* error_private.c */
-
-ERR_STATIC const char* ERR_getErrorName(size_t code)
-{
-    return ERR_getErrorString(ERR_getErrorCode(code));
-}
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ERROR_H_MODULE */
diff --git a/priv/zstd/lib/common/fse.h b/priv/zstd/lib/common/fse.h
deleted file mode 100644
index afd7801..0000000
--- a/priv/zstd/lib/common/fse.h
+++ /dev/null
@@ -1,704 +0,0 @@
-/* ******************************************************************
-   FSE : Finite State Entropy codec
-   Public Prototypes declaration
-   Copyright (C) 2013-2016, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-****************************************************************** */
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#ifndef FSE_H
-#define FSE_H
-
-
-/*-*****************************************
-*  Dependencies
-******************************************/
-#include     /* size_t, ptrdiff_t */
-
-
-/*-*****************************************
-*  FSE_PUBLIC_API : control library symbols visibility
-******************************************/
-#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
-#  define FSE_PUBLIC_API __attribute__ ((visibility ("default")))
-#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
-#  define FSE_PUBLIC_API __declspec(dllexport)
-#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
-#  define FSE_PUBLIC_API __declspec(dllimport) /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
-#else
-#  define FSE_PUBLIC_API
-#endif
-
-/*------   Version   ------*/
-#define FSE_VERSION_MAJOR    0
-#define FSE_VERSION_MINOR    9
-#define FSE_VERSION_RELEASE  0
-
-#define FSE_LIB_VERSION FSE_VERSION_MAJOR.FSE_VERSION_MINOR.FSE_VERSION_RELEASE
-#define FSE_QUOTE(str) #str
-#define FSE_EXPAND_AND_QUOTE(str) FSE_QUOTE(str)
-#define FSE_VERSION_STRING FSE_EXPAND_AND_QUOTE(FSE_LIB_VERSION)
-
-#define FSE_VERSION_NUMBER  (FSE_VERSION_MAJOR *100*100 + FSE_VERSION_MINOR *100 + FSE_VERSION_RELEASE)
-FSE_PUBLIC_API unsigned FSE_versionNumber(void);   /**< library version number; to be used when checking dll version */
-
-/*-****************************************
-*  FSE simple functions
-******************************************/
-/*! FSE_compress() :
-    Compress content of buffer 'src', of size 'srcSize', into destination buffer 'dst'.
-    'dst' buffer must be already allocated. Compression runs faster is dstCapacity >= FSE_compressBound(srcSize).
-    @return : size of compressed data (<= dstCapacity).
-    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
-                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression instead.
-                     if FSE_isError(return), compression failed (more details using FSE_getErrorName())
-*/
-FSE_PUBLIC_API size_t FSE_compress(void* dst, size_t dstCapacity,
-                             const void* src, size_t srcSize);
-
-/*! FSE_decompress():
-    Decompress FSE data from buffer 'cSrc', of size 'cSrcSize',
-    into already allocated destination buffer 'dst', of size 'dstCapacity'.
-    @return : size of regenerated data (<= maxDstSize),
-              or an error code, which can be tested using FSE_isError() .
-
-    ** Important ** : FSE_decompress() does not decompress non-compressible nor RLE data !!!
-    Why ? : making this distinction requires a header.
-    Header management is intentionally delegated to the user layer, which can better manage special cases.
-*/
-FSE_PUBLIC_API size_t FSE_decompress(void* dst,  size_t dstCapacity,
-                               const void* cSrc, size_t cSrcSize);
-
-
-/*-*****************************************
-*  Tool functions
-******************************************/
-FSE_PUBLIC_API size_t FSE_compressBound(size_t size);       /* maximum compressed size */
-
-/* Error Management */
-FSE_PUBLIC_API unsigned    FSE_isError(size_t code);        /* tells if a return value is an error code */
-FSE_PUBLIC_API const char* FSE_getErrorName(size_t code);   /* provides error code string (useful for debugging) */
-
-
-/*-*****************************************
-*  FSE advanced functions
-******************************************/
-/*! FSE_compress2() :
-    Same as FSE_compress(), but allows the selection of 'maxSymbolValue' and 'tableLog'
-    Both parameters can be defined as '0' to mean : use default value
-    @return : size of compressed data
-    Special values : if return == 0, srcData is not compressible => Nothing is stored within cSrc !!!
-                     if return == 1, srcData is a single byte symbol * srcSize times. Use RLE compression.
-                     if FSE_isError(return), it's an error code.
-*/
-FSE_PUBLIC_API size_t FSE_compress2 (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
-
-
-/*-*****************************************
-*  FSE detailed API
-******************************************/
-/*!
-FSE_compress() does the following:
-1. count symbol occurrence from source[] into table count[]
-2. normalize counters so that sum(count[]) == Power_of_2 (2^tableLog)
-3. save normalized counters to memory buffer using writeNCount()
-4. build encoding table 'CTable' from normalized counters
-5. encode the data stream using encoding table 'CTable'
-
-FSE_decompress() does the following:
-1. read normalized counters with readNCount()
-2. build decoding table 'DTable' from normalized counters
-3. decode the data stream using decoding table 'DTable'
-
-The following API allows targeting specific sub-functions for advanced tasks.
-For example, it's possible to compress several blocks using the same 'CTable',
-or to save and provide normalized distribution using external method.
-*/
-
-/* *** COMPRESSION *** */
-
-/*! FSE_count():
-    Provides the precise count of each byte within a table 'count'.
-    'count' is a table of unsigned int, of minimum size (*maxSymbolValuePtr+1).
-    *maxSymbolValuePtr will be updated if detected smaller than initial value.
-    @return : the count of the most frequent symbol (which is not identified).
-              if return == srcSize, there is only one symbol.
-              Can also return an error code, which can be tested with FSE_isError(). */
-FSE_PUBLIC_API size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
-
-/*! FSE_optimalTableLog():
-    dynamically downsize 'tableLog' when conditions are met.
-    It saves CPU time, by using smaller tables, while preserving or even improving compression ratio.
-    @return : recommended tableLog (necessarily <= 'maxTableLog') */
-FSE_PUBLIC_API unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
-
-/*! FSE_normalizeCount():
-    normalize counts so that sum(count[]) == Power_of_2 (2^tableLog)
-    'normalizedCounter' is a table of short, of minimum size (maxSymbolValue+1).
-    @return : tableLog,
-              or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_normalizeCount(short* normalizedCounter, unsigned tableLog, const unsigned* count, size_t srcSize, unsigned maxSymbolValue);
-
-/*! FSE_NCountWriteBound():
-    Provides the maximum possible size of an FSE normalized table, given 'maxSymbolValue' and 'tableLog'.
-    Typically useful for allocation purpose. */
-FSE_PUBLIC_API size_t FSE_NCountWriteBound(unsigned maxSymbolValue, unsigned tableLog);
-
-/*! FSE_writeNCount():
-    Compactly save 'normalizedCounter' into 'buffer'.
-    @return : size of the compressed table,
-              or an errorCode, which can be tested using FSE_isError(). */
-FSE_PUBLIC_API size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
-
-
-/*! Constructor and Destructor of FSE_CTable.
-    Note that FSE_CTable size depends on 'tableLog' and 'maxSymbolValue' */
-typedef unsigned FSE_CTable;   /* don't allocate that. It's only meant to be more restrictive than void* */
-FSE_PUBLIC_API FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog);
-FSE_PUBLIC_API void        FSE_freeCTable (FSE_CTable* ct);
-
-/*! FSE_buildCTable():
-    Builds `ct`, which must be already allocated, using FSE_createCTable().
-    @return : 0, or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_buildCTable(FSE_CTable* ct, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
-
-/*! FSE_compress_usingCTable():
-    Compress `src` using `ct` into `dst` which must be already allocated.
-    @return : size of compressed data (<= `dstCapacity`),
-              or 0 if compressed data could not fit into `dst`,
-              or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_compress_usingCTable (void* dst, size_t dstCapacity, const void* src, size_t srcSize, const FSE_CTable* ct);
-
-/*!
-Tutorial :
-----------
-The first step is to count all symbols. FSE_count() does this job very fast.
-Result will be saved into 'count', a table of unsigned int, which must be already allocated, and have 'maxSymbolValuePtr[0]+1' cells.
-'src' is a table of bytes of size 'srcSize'. All values within 'src' MUST be <= maxSymbolValuePtr[0]
-maxSymbolValuePtr[0] will be updated, with its real value (necessarily <= original value)
-FSE_count() will return the number of occurrence of the most frequent symbol.
-This can be used to know if there is a single symbol within 'src', and to quickly evaluate its compressibility.
-If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
-
-The next step is to normalize the frequencies.
-FSE_normalizeCount() will ensure that sum of frequencies is == 2 ^'tableLog'.
-It also guarantees a minimum of 1 to any Symbol with frequency >= 1.
-You can use 'tableLog'==0 to mean "use default tableLog value".
-If you are unsure of which tableLog value to use, you can ask FSE_optimalTableLog(),
-which will provide the optimal valid tableLog given sourceSize, maxSymbolValue, and a user-defined maximum (0 means "default").
-
-The result of FSE_normalizeCount() will be saved into a table,
-called 'normalizedCounter', which is a table of signed short.
-'normalizedCounter' must be already allocated, and have at least 'maxSymbolValue+1' cells.
-The return value is tableLog if everything proceeded as expected.
-It is 0 if there is a single symbol within distribution.
-If there is an error (ex: invalid tableLog value), the function will return an ErrorCode (which can be tested using FSE_isError()).
-
-'normalizedCounter' can be saved in a compact manner to a memory area using FSE_writeNCount().
-'buffer' must be already allocated.
-For guaranteed success, buffer size must be at least FSE_headerBound().
-The result of the function is the number of bytes written into 'buffer'.
-If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError(); ex : buffer size too small).
-
-'normalizedCounter' can then be used to create the compression table 'CTable'.
-The space required by 'CTable' must be already allocated, using FSE_createCTable().
-You can then use FSE_buildCTable() to fill 'CTable'.
-If there is an error, both functions will return an ErrorCode (which can be tested using FSE_isError()).
-
-'CTable' can then be used to compress 'src', with FSE_compress_usingCTable().
-Similar to FSE_count(), the convention is that 'src' is assumed to be a table of char of size 'srcSize'
-The function returns the size of compressed data (without header), necessarily <= `dstCapacity`.
-If it returns '0', compressed data could not fit into 'dst'.
-If there is an error, the function will return an ErrorCode (which can be tested using FSE_isError()).
-*/
-
-
-/* *** DECOMPRESSION *** */
-
-/*! FSE_readNCount():
-    Read compactly saved 'normalizedCounter' from 'rBuffer'.
-    @return : size read from 'rBuffer',
-              or an errorCode, which can be tested using FSE_isError().
-              maxSymbolValuePtr[0] and tableLogPtr[0] will also be updated with their respective values */
-FSE_PUBLIC_API size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSymbolValuePtr, unsigned* tableLogPtr, const void* rBuffer, size_t rBuffSize);
-
-/*! Constructor and Destructor of FSE_DTable.
-    Note that its size depends on 'tableLog' */
-typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
-FSE_PUBLIC_API FSE_DTable* FSE_createDTable(unsigned tableLog);
-FSE_PUBLIC_API void        FSE_freeDTable(FSE_DTable* dt);
-
-/*! FSE_buildDTable():
-    Builds 'dt', which must be already allocated, using FSE_createDTable().
-    return : 0, or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_buildDTable (FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog);
-
-/*! FSE_decompress_usingDTable():
-    Decompress compressed source `cSrc` of size `cSrcSize` using `dt`
-    into `dst` which must be already allocated.
-    @return : size of regenerated data (necessarily <= `dstCapacity`),
-              or an errorCode, which can be tested using FSE_isError() */
-FSE_PUBLIC_API size_t FSE_decompress_usingDTable(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, const FSE_DTable* dt);
-
-/*!
-Tutorial :
-----------
-(Note : these functions only decompress FSE-compressed blocks.
- If block is uncompressed, use memcpy() instead
- If block is a single repeated byte, use memset() instead )
-
-The first step is to obtain the normalized frequencies of symbols.
-This can be performed by FSE_readNCount() if it was saved using FSE_writeNCount().
-'normalizedCounter' must be already allocated, and have at least 'maxSymbolValuePtr[0]+1' cells of signed short.
-In practice, that means it's necessary to know 'maxSymbolValue' beforehand,
-or size the table to handle worst case situations (typically 256).
-FSE_readNCount() will provide 'tableLog' and 'maxSymbolValue'.
-The result of FSE_readNCount() is the number of bytes read from 'rBuffer'.
-Note that 'rBufferSize' must be at least 4 bytes, even if useful information is less than that.
-If there is an error, the function will return an error code, which can be tested using FSE_isError().
-
-The next step is to build the decompression tables 'FSE_DTable' from 'normalizedCounter'.
-This is performed by the function FSE_buildDTable().
-The space required by 'FSE_DTable' must be already allocated using FSE_createDTable().
-If there is an error, the function will return an error code, which can be tested using FSE_isError().
-
-`FSE_DTable` can then be used to decompress `cSrc`, with FSE_decompress_usingDTable().
-`cSrcSize` must be strictly correct, otherwise decompression will fail.
-FSE_decompress_usingDTable() result will tell how many bytes were regenerated (<=`dstCapacity`).
-If there is an error, the function will return an error code, which can be tested using FSE_isError(). (ex: dst buffer too small)
-*/
-
-#endif  /* FSE_H */
-
-#if defined(FSE_STATIC_LINKING_ONLY) && !defined(FSE_H_FSE_STATIC_LINKING_ONLY)
-#define FSE_H_FSE_STATIC_LINKING_ONLY
-
-/* *** Dependency *** */
-#include "bitstream.h"
-
-
-/* *****************************************
-*  Static allocation
-*******************************************/
-/* FSE buffer bounds */
-#define FSE_NCOUNTBOUND 512
-#define FSE_BLOCKBOUND(size) (size + (size>>7))
-#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
-
-/* It is possible to statically allocate FSE CTable/DTable as a table of FSE_CTable/FSE_DTable using below macros */
-#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue)   (1 + (1<<(maxTableLog-1)) + ((maxSymbolValue+1)*2))
-#define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<= `1024` unsigned
- */
-size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
-                 const void* source, size_t sourceSize, unsigned* workSpace);
-
-/** FSE_countFast() :
- *  same as FSE_count(), but blindly trusts that all byte values within src are <= *maxSymbolValuePtr
- */
-size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
-
-/* FSE_countFast_wksp() :
- * Same as FSE_countFast(), but using an externally provided scratch buffer.
- * `workSpace` must be a table of minimum `1024` unsigned
- */
-size_t FSE_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize, unsigned* workSpace);
-
-/*! FSE_count_simple
- * Same as FSE_countFast(), but does not use any additional memory (not even on stack).
- * This function is unsafe, and will segfault if any value within `src` is `> *maxSymbolValuePtr` (presuming it's also the size of `count`).
-*/
-size_t FSE_count_simple(unsigned* count, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
-
-
-
-unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus);
-/**< same as FSE_optimalTableLog(), which used `minus==2` */
-
-/* FSE_compress_wksp() :
- * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
- * FSE_WKSP_SIZE_U32() provides the minimum size required for `workSpace` as a table of FSE_CTable.
- */
-#define FSE_WKSP_SIZE_U32(maxTableLog, maxSymbolValue)   ( FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue) + ((maxTableLog > 12) ? (1 << (maxTableLog - 2)) : 1024) )
-size_t FSE_compress_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
-
-size_t FSE_buildCTable_raw (FSE_CTable* ct, unsigned nbBits);
-/**< build a fake FSE_CTable, designed for a flat distribution, where each symbol uses nbBits */
-
-size_t FSE_buildCTable_rle (FSE_CTable* ct, unsigned char symbolValue);
-/**< build a fake FSE_CTable, designed to compress always the same symbolValue */
-
-/* FSE_buildCTable_wksp() :
- * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
- * `wkspSize` must be >= `(1<= BIT_DStream_completed
-
-When it's done, verify decompression is fully completed, by checking both DStream and the relevant states.
-Checking if DStream has reached its end is performed by :
-    BIT_endOfDStream(&DStream);
-Check also the states. There might be some symbols left there, if some high probability ones (>50%) are possible.
-    FSE_endOfDState(&DState);
-*/
-
-
-/* *****************************************
-*  FSE unsafe API
-*******************************************/
-static unsigned char FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD);
-/* faster, but works only if nbBits is always >= 1 (otherwise, result will be corrupted) */
-
-
-/* *****************************************
-*  Implementation of inlined functions
-*******************************************/
-typedef struct {
-    int deltaFindState;
-    U32 deltaNbBits;
-} FSE_symbolCompressionTransform; /* total 8 bytes */
-
-MEM_STATIC void FSE_initCState(FSE_CState_t* statePtr, const FSE_CTable* ct)
-{
-    const void* ptr = ct;
-    const U16* u16ptr = (const U16*) ptr;
-    const U32 tableLog = MEM_read16(ptr);
-    statePtr->value = (ptrdiff_t)1<stateTable = u16ptr+2;
-    statePtr->symbolTT = ((const U32*)ct + 1 + (tableLog ? (1<<(tableLog-1)) : 1));
-    statePtr->stateLog = tableLog;
-}
-
-
-/*! FSE_initCState2() :
-*   Same as FSE_initCState(), but the first symbol to include (which will be the last to be read)
-*   uses the smallest state value possible, saving the cost of this symbol */
-MEM_STATIC void FSE_initCState2(FSE_CState_t* statePtr, const FSE_CTable* ct, U32 symbol)
-{
-    FSE_initCState(statePtr, ct);
-    {   const FSE_symbolCompressionTransform symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
-        const U16* stateTable = (const U16*)(statePtr->stateTable);
-        U32 nbBitsOut  = (U32)((symbolTT.deltaNbBits + (1<<15)) >> 16);
-        statePtr->value = (nbBitsOut << 16) - symbolTT.deltaNbBits;
-        statePtr->value = stateTable[(statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-    }
-}
-
-MEM_STATIC void FSE_encodeSymbol(BIT_CStream_t* bitC, FSE_CState_t* statePtr, U32 symbol)
-{
-    FSE_symbolCompressionTransform const symbolTT = ((const FSE_symbolCompressionTransform*)(statePtr->symbolTT))[symbol];
-    const U16* const stateTable = (const U16*)(statePtr->stateTable);
-    U32 const nbBitsOut  = (U32)((statePtr->value + symbolTT.deltaNbBits) >> 16);
-    BIT_addBits(bitC, statePtr->value, nbBitsOut);
-    statePtr->value = stateTable[ (statePtr->value >> nbBitsOut) + symbolTT.deltaFindState];
-}
-
-MEM_STATIC void FSE_flushCState(BIT_CStream_t* bitC, const FSE_CState_t* statePtr)
-{
-    BIT_addBits(bitC, statePtr->value, statePtr->stateLog);
-    BIT_flushBits(bitC);
-}
-
-
-/* ======    Decompression    ====== */
-
-typedef struct {
-    U16 tableLog;
-    U16 fastMode;
-} FSE_DTableHeader;   /* sizeof U32 */
-
-typedef struct
-{
-    unsigned short newState;
-    unsigned char  symbol;
-    unsigned char  nbBits;
-} FSE_decode_t;   /* size == U32 */
-
-MEM_STATIC void FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt)
-{
-    const void* ptr = dt;
-    const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
-    DStatePtr->state = BIT_readBits(bitD, DTableH->tableLog);
-    BIT_reloadDStream(bitD);
-    DStatePtr->table = dt + 1;
-}
-
-MEM_STATIC BYTE FSE_peekSymbol(const FSE_DState_t* DStatePtr)
-{
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    return DInfo.symbol;
-}
-
-MEM_STATIC void FSE_updateState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
-{
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    U32 const nbBits = DInfo.nbBits;
-    size_t const lowBits = BIT_readBits(bitD, nbBits);
-    DStatePtr->state = DInfo.newState + lowBits;
-}
-
-MEM_STATIC BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
-{
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    U32 const nbBits = DInfo.nbBits;
-    BYTE const symbol = DInfo.symbol;
-    size_t const lowBits = BIT_readBits(bitD, nbBits);
-
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
-}
-
-/*! FSE_decodeSymbolFast() :
-    unsafe, only works if no symbol has a probability > 50% */
-MEM_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
-{
-    FSE_decode_t const DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    U32 const nbBits = DInfo.nbBits;
-    BYTE const symbol = DInfo.symbol;
-    size_t const lowBits = BIT_readBitsFast(bitD, nbBits);
-
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
-}
-
-MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
-{
-    return DStatePtr->state == 0;
-}
-
-
-
-#ifndef FSE_COMMONDEFS_ONLY
-
-/* **************************************************************
-*  Tuning parameters
-****************************************************************/
-/*!MEMORY_USAGE :
-*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
-*  Increasing memory usage improves compression ratio
-*  Reduced memory usage can improve speed, due to cache effect
-*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
-#ifndef FSE_MAX_MEMORY_USAGE
-#  define FSE_MAX_MEMORY_USAGE 14
-#endif
-#ifndef FSE_DEFAULT_MEMORY_USAGE
-#  define FSE_DEFAULT_MEMORY_USAGE 13
-#endif
-
-/*!FSE_MAX_SYMBOL_VALUE :
-*  Maximum symbol value authorized.
-*  Required for proper stack allocation */
-#ifndef FSE_MAX_SYMBOL_VALUE
-#  define FSE_MAX_SYMBOL_VALUE 255
-#endif
-
-/* **************************************************************
-*  template functions type & suffix
-****************************************************************/
-#define FSE_FUNCTION_TYPE BYTE
-#define FSE_FUNCTION_EXTENSION
-#define FSE_DECODE_TYPE FSE_decode_t
-
-
-#endif   /* !FSE_COMMONDEFS_ONLY */
-
-
-/* ***************************************************************
-*  Constants
-*****************************************************************/
-#define FSE_MAX_TABLELOG  (FSE_MAX_MEMORY_USAGE-2)
-#define FSE_MAX_TABLESIZE (1U< FSE_TABLELOG_ABSOLUTE_MAX
-#  error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
-#endif
-
-#define FSE_TABLESTEP(tableSize) ((tableSize>>1) + (tableSize>>3) + 3)
-
-
-#endif /* FSE_STATIC_LINKING_ONLY */
-
-
-#if defined (__cplusplus)
-}
-#endif
diff --git a/priv/zstd/lib/common/fse_decompress.c b/priv/zstd/lib/common/fse_decompress.c
deleted file mode 100644
index 8e3f003..0000000
--- a/priv/zstd/lib/common/fse_decompress.c
+++ /dev/null
@@ -1,309 +0,0 @@
-/* ******************************************************************
-   FSE : Finite State Entropy decoder
-   Copyright (C) 2013-2015, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-
-/* **************************************************************
-*  Includes
-****************************************************************/
-#include      /* malloc, free, qsort */
-#include      /* memcpy, memset */
-#include "bitstream.h"
-#include "compiler.h"
-#define FSE_STATIC_LINKING_ONLY
-#include "fse.h"
-#include "error_private.h"
-
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define FSE_isError ERR_isError
-#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-
-/* check and forward error code */
-#define CHECK_F(f) { size_t const e = f; if (FSE_isError(e)) return e; }
-
-
-/* **************************************************************
-*  Templates
-****************************************************************/
-/*
-  designed to be included
-  for type-specific functions (template emulation in C)
-  Objective is to write these functions only once, for improved maintenance
-*/
-
-/* safety checks */
-#ifndef FSE_FUNCTION_EXTENSION
-#  error "FSE_FUNCTION_EXTENSION must be defined"
-#endif
-#ifndef FSE_FUNCTION_TYPE
-#  error "FSE_FUNCTION_TYPE must be defined"
-#endif
-
-/* Function names */
-#define FSE_CAT(X,Y) X##Y
-#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
-#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
-
-
-/* Function templates */
-FSE_DTable* FSE_createDTable (unsigned tableLog)
-{
-    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
-    return (FSE_DTable*)malloc( FSE_DTABLE_SIZE_U32(tableLog) * sizeof (U32) );
-}
-
-void FSE_freeDTable (FSE_DTable* dt)
-{
-    free(dt);
-}
-
-size_t FSE_buildDTable(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-{
-    void* const tdPtr = dt+1;   /* because *dt is unsigned, 32-bits aligned on 32-bits */
-    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*) (tdPtr);
-    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
-
-    U32 const maxSV1 = maxSymbolValue + 1;
-    U32 const tableSize = 1 << tableLog;
-    U32 highThreshold = tableSize-1;
-
-    /* Sanity Checks */
-    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-
-    /* Init, lay down lowprob symbols */
-    {   FSE_DTableHeader DTableH;
-        DTableH.tableLog = (U16)tableLog;
-        DTableH.fastMode = 1;
-        {   S16 const largeLimit= (S16)(1 << (tableLog-1));
-            U32 s;
-            for (s=0; s= largeLimit) DTableH.fastMode=0;
-                    symbolNext[s] = normalizedCounter[s];
-        }   }   }
-        memcpy(dt, &DTableH, sizeof(DTableH));
-    }
-
-    /* Spread symbols */
-    {   U32 const tableMask = tableSize-1;
-        U32 const step = FSE_TABLESTEP(tableSize);
-        U32 s, position = 0;
-        for (s=0; s highThreshold) position = (position + step) & tableMask;   /* lowprob area */
-        }   }
-        if (position!=0) return ERROR(GENERIC);   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
-    }
-
-    /* Build Decoding table */
-    {   U32 u;
-        for (u=0; utableLog = 0;
-    DTableH->fastMode = 0;
-
-    cell->newState = 0;
-    cell->symbol = symbolValue;
-    cell->nbBits = 0;
-
-    return 0;
-}
-
-
-size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
-{
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    void* dPtr = dt + 1;
-    FSE_decode_t* const dinfo = (FSE_decode_t*)dPtr;
-    const unsigned tableSize = 1 << nbBits;
-    const unsigned tableMask = tableSize - 1;
-    const unsigned maxSV1 = tableMask+1;
-    unsigned s;
-
-    /* Sanity checks */
-    if (nbBits < 1) return ERROR(GENERIC);         /* min size */
-
-    /* Build Decoding Table */
-    DTableH->tableLog = (U16)nbBits;
-    DTableH->fastMode = 1;
-    for (s=0; s sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            BIT_reloadDStream(&bitD);
-
-        op[1] = FSE_GETSYMBOL(&state2);
-
-        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            { if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }
-
-        op[2] = FSE_GETSYMBOL(&state1);
-
-        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            BIT_reloadDStream(&bitD);
-
-        op[3] = FSE_GETSYMBOL(&state2);
-    }
-
-    /* tail */
-    /* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
-    while (1) {
-        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
-        *op++ = FSE_GETSYMBOL(&state1);
-        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
-            *op++ = FSE_GETSYMBOL(&state2);
-            break;
-        }
-
-        if (op>(omax-2)) return ERROR(dstSize_tooSmall);
-        *op++ = FSE_GETSYMBOL(&state2);
-        if (BIT_reloadDStream(&bitD)==BIT_DStream_overflow) {
-            *op++ = FSE_GETSYMBOL(&state1);
-            break;
-    }   }
-
-    return op-ostart;
-}
-
-
-size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
-                            const void* cSrc, size_t cSrcSize,
-                            const FSE_DTable* dt)
-{
-    const void* ptr = dt;
-    const FSE_DTableHeader* DTableH = (const FSE_DTableHeader*)ptr;
-    const U32 fastMode = DTableH->fastMode;
-
-    /* select fast mode (static) */
-    if (fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
-    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
-}
-
-
-size_t FSE_decompress_wksp(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize, FSE_DTable* workSpace, unsigned maxLog)
-{
-    const BYTE* const istart = (const BYTE*)cSrc;
-    const BYTE* ip = istart;
-    short counting[FSE_MAX_SYMBOL_VALUE+1];
-    unsigned tableLog;
-    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
-
-    /* normal FSE decoding mode */
-    size_t const NCountLength = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
-    if (FSE_isError(NCountLength)) return NCountLength;
-    //if (NCountLength >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size; supposed to be already checked in NCountLength, only remaining case : NCountLength==cSrcSize */
-    if (tableLog > maxLog) return ERROR(tableLog_tooLarge);
-    ip += NCountLength;
-    cSrcSize -= NCountLength;
-
-    CHECK_F( FSE_buildDTable (workSpace, counting, maxSymbolValue, tableLog) );
-
-    return FSE_decompress_usingDTable (dst, dstCapacity, ip, cSrcSize, workSpace);   /* always return, even if it is an error code */
-}
-
-
-typedef FSE_DTable DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
-
-size_t FSE_decompress(void* dst, size_t dstCapacity, const void* cSrc, size_t cSrcSize)
-{
-    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
-    return FSE_decompress_wksp(dst, dstCapacity, cSrc, cSrcSize, dt, FSE_MAX_TABLELOG);
-}
-
-
-
-#endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/priv/zstd/lib/common/huf.h b/priv/zstd/lib/common/huf.h
deleted file mode 100644
index 522bf9b..0000000
--- a/priv/zstd/lib/common/huf.h
+++ /dev/null
@@ -1,302 +0,0 @@
-/* ******************************************************************
-   Huffman coder, part of New Generation Entropy library
-   header file
-   Copyright (C) 2013-2016, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-****************************************************************** */
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#ifndef HUF_H_298734234
-#define HUF_H_298734234
-
-/* *** Dependencies *** */
-#include     /* size_t */
-
-
-/* *** library symbols visibility *** */
-/* Note : when linking with -fvisibility=hidden on gcc, or by default on Visual,
- *        HUF symbols remain "private" (internal symbols for library only).
- *        Set macro FSE_DLL_EXPORT to 1 if you want HUF symbols visible on DLL interface */
-#if defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1) && defined(__GNUC__) && (__GNUC__ >= 4)
-#  define HUF_PUBLIC_API __attribute__ ((visibility ("default")))
-#elif defined(FSE_DLL_EXPORT) && (FSE_DLL_EXPORT==1)   /* Visual expected */
-#  define HUF_PUBLIC_API __declspec(dllexport)
-#elif defined(FSE_DLL_IMPORT) && (FSE_DLL_IMPORT==1)
-#  define HUF_PUBLIC_API __declspec(dllimport)  /* not required, just to generate faster code (saves a function pointer load from IAT and an indirect jump) */
-#else
-#  define HUF_PUBLIC_API
-#endif
-
-
-/* *** simple functions *** */
-/**
-HUF_compress() :
-    Compress content from buffer 'src', of size 'srcSize', into buffer 'dst'.
-    'dst' buffer must be already allocated.
-    Compression runs faster if `dstCapacity` >= HUF_compressBound(srcSize).
-    `srcSize` must be <= `HUF_BLOCKSIZE_MAX` == 128 KB.
-    @return : size of compressed data (<= `dstCapacity`).
-    Special values : if return == 0, srcData is not compressible => Nothing is stored within dst !!!
-                     if return == 1, srcData is a single repeated byte symbol (RLE compression).
-                     if HUF_isError(return), compression failed (more details using HUF_getErrorName())
-*/
-HUF_PUBLIC_API size_t HUF_compress(void* dst, size_t dstCapacity,
-                             const void* src, size_t srcSize);
-
-/**
-HUF_decompress() :
-    Decompress HUF data from buffer 'cSrc', of size 'cSrcSize',
-    into already allocated buffer 'dst', of minimum size 'dstSize'.
-    `originalSize` : **must** be the ***exact*** size of original (uncompressed) data.
-    Note : in contrast with FSE, HUF_decompress can regenerate
-           RLE (cSrcSize==1) and uncompressed (cSrcSize==dstSize) data,
-           because it knows size to regenerate.
-    @return : size of regenerated data (== originalSize),
-              or an error code, which can be tested using HUF_isError()
-*/
-HUF_PUBLIC_API size_t HUF_decompress(void* dst,  size_t originalSize,
-                               const void* cSrc, size_t cSrcSize);
-
-
-/* ***   Tool functions *** */
-#define HUF_BLOCKSIZE_MAX (128 * 1024)                  /**< maximum input size for a single block compressed with HUF_compress */
-HUF_PUBLIC_API size_t HUF_compressBound(size_t size);   /**< maximum compressed size (worst case) */
-
-/* Error Management */
-HUF_PUBLIC_API unsigned    HUF_isError(size_t code);       /**< tells if a return value is an error code */
-HUF_PUBLIC_API const char* HUF_getErrorName(size_t code);  /**< provides error code string (useful for debugging) */
-
-
-/* ***   Advanced function   *** */
-
-/** HUF_compress2() :
- *  Same as HUF_compress(), but offers direct control over `maxSymbolValue` and `tableLog`.
- *  `tableLog` must be `<= HUF_TABLELOG_MAX` . */
-HUF_PUBLIC_API size_t HUF_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
-
-/** HUF_compress4X_wksp() :
- *  Same as HUF_compress2(), but uses externally allocated `workSpace`.
- *  `workspace` must have minimum alignment of 4, and be at least as large as following macro */
-#define HUF_WORKSPACE_SIZE (6 << 10)
-#define HUF_WORKSPACE_SIZE_U32 (HUF_WORKSPACE_SIZE / sizeof(U32))
-HUF_PUBLIC_API size_t HUF_compress4X_wksp (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);
-
-/**
- *  The minimum workspace size for the `workSpace` used in
- *  HUF_readDTableX2_wksp() and HUF_readDTableX4_wksp().
- *
- *  The space used depends on HUF_TABLELOG_MAX, ranging from ~1500 bytes when
- *  HUF_TABLE_LOG_MAX=12 to ~1850 bytes when HUF_TABLE_LOG_MAX=15.
- *  Buffer overflow errors may potentially occur if code modifications result in
- *  a required workspace size greater than that specified in the following
- *  macro.
- */
-#define HUF_DECOMPRESS_WORKSPACE_SIZE (2 << 10)
-#define HUF_DECOMPRESS_WORKSPACE_SIZE_U32 (HUF_DECOMPRESS_WORKSPACE_SIZE / sizeof(U32))
-
-#endif   /* HUF_H_298734234 */
-
-/* ******************************************************************
- *  WARNING !!
- *  The following section contains advanced and experimental definitions
- *  which shall never be used in the context of dll
- *  because they are not guaranteed to remain stable in the future.
- *  Only consider them in association with static linking.
- *******************************************************************/
-#if defined(HUF_STATIC_LINKING_ONLY) && !defined(HUF_H_HUF_STATIC_LINKING_ONLY)
-#define HUF_H_HUF_STATIC_LINKING_ONLY
-
-/* *** Dependencies *** */
-#include "mem.h"   /* U32 */
-
-
-/* *** Constants *** */
-#define HUF_TABLELOG_MAX      12       /* max configured tableLog (for static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */
-#define HUF_TABLELOG_DEFAULT  11       /* tableLog by default, when not specified */
-#define HUF_SYMBOLVALUE_MAX  255
-
-#define HUF_TABLELOG_ABSOLUTEMAX  15   /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
-#if (HUF_TABLELOG_MAX > HUF_TABLELOG_ABSOLUTEMAX)
-#  error "HUF_TABLELOG_MAX is too large !"
-#endif
-
-
-/* ****************************************
-*  Static allocation
-******************************************/
-/* HUF buffer bounds */
-#define HUF_CTABLEBOUND 129
-#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8)   /* only true when incompressible is pre-filtered with fast heuristic */
-#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
-
-/* static allocation of HUF's Compression Table */
-#define HUF_CTABLE_SIZE_U32(maxSymbolValue)   ((maxSymbolValue)+1)   /* Use tables of U32, for proper alignment */
-#define HUF_CTABLE_SIZE(maxSymbolValue)       (HUF_CTABLE_SIZE_U32(maxSymbolValue) * sizeof(U32))
-#define HUF_CREATE_STATIC_CTABLE(name, maxSymbolValue) \
-    U32 name##hb[HUF_CTABLE_SIZE_U32(maxSymbolValue)]; \
-    void* name##hv = &(name##hb); \
-    HUF_CElt* name = (HUF_CElt*)(name##hv)   /* no final ; */
-
-/* static allocation of HUF's DTable */
-typedef U32 HUF_DTable;
-#define HUF_DTABLE_SIZE(maxTableLog)   (1 + (1<<(maxTableLog)))
-#define HUF_CREATE_STATIC_DTABLEX2(DTable, maxTableLog) \
-        HUF_DTable DTable[HUF_DTABLE_SIZE((maxTableLog)-1)] = { ((U32)((maxTableLog)-1) * 0x01000001) }
-#define HUF_CREATE_STATIC_DTABLEX4(DTable, maxTableLog) \
-        HUF_DTable DTable[HUF_DTABLE_SIZE(maxTableLog)] = { ((U32)(maxTableLog) * 0x01000001) }
-
-
-/* ****************************************
-*  Advanced decompression functions
-******************************************/
-size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
-size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
-
-size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< decodes RLE and uncompressed */
-size_t HUF_decompress4X_hufOnly(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize); /**< considers RLE and uncompressed as errors */
-size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize); /**< considers RLE and uncompressed as errors */
-size_t HUF_decompress4X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
-size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< single-symbol decoder */
-size_t HUF_decompress4X4_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
-size_t HUF_decompress4X4_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< double-symbols decoder */
-
-
-/* ****************************************
-*  HUF detailed API
-******************************************/
-/*!
-HUF_compress() does the following:
-1. count symbol occurrence from source[] into table count[] using FSE_count()
-2. (optional) refine tableLog using HUF_optimalTableLog()
-3. build Huffman table from count using HUF_buildCTable()
-4. save Huffman table to memory buffer using HUF_writeCTable()
-5. encode the data stream using HUF_compress4X_usingCTable()
-
-The following API allows targeting specific sub-functions for advanced tasks.
-For example, it's possible to compress several blocks using the same 'CTable',
-or to save and regenerate 'CTable' using external methods.
-*/
-/* FSE_count() : find it within "fse.h" */
-unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue);
-typedef struct HUF_CElt_s HUF_CElt;   /* incomplete type */
-size_t HUF_buildCTable (HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue, unsigned maxNbBits);
-size_t HUF_writeCTable (void* dst, size_t maxDstSize, const HUF_CElt* CTable, unsigned maxSymbolValue, unsigned huffLog);
-size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
-
-typedef enum {
-   HUF_repeat_none,  /**< Cannot use the previous table */
-   HUF_repeat_check, /**< Can use the previous table but it must be checked. Note : The previous table must have been constructed by HUF_compress{1, 4}X_repeat */
-   HUF_repeat_valid  /**< Can use the previous table and it is asumed to be valid */
- } HUF_repeat;
-/** HUF_compress4X_repeat() :
-*   Same as HUF_compress4X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
-*   If it uses hufTable it does not modify hufTable or repeat.
-*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
-*   If preferRepeat then the old table will always be used if valid. */
-size_t HUF_compress4X_repeat(void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize, HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
-
-/** HUF_buildCTable_wksp() :
- *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
- *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
- */
-size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize);
-
-/*! HUF_readStats() :
-    Read compact Huffman tree, saved by HUF_writeCTable().
-    `huffWeight` is destination buffer.
-    @return : size read from `src` , or an error Code .
-    Note : Needed by HUF_readCTable() and HUF_readDTableXn() . */
-size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
-                     U32* nbSymbolsPtr, U32* tableLogPtr,
-                     const void* src, size_t srcSize);
-
-/** HUF_readCTable() :
-*   Loading a CTable saved with HUF_writeCTable() */
-size_t HUF_readCTable (HUF_CElt* CTable, unsigned* maxSymbolValuePtr, const void* src, size_t srcSize);
-
-
-/*
-HUF_decompress() does the following:
-1. select the decompression algorithm (X2, X4) based on pre-computed heuristics
-2. build Huffman table from save, using HUF_readDTableXn()
-3. decode 1 or 4 segments in parallel using HUF_decompressSXn_usingDTable
-*/
-
-/** HUF_selectDecoder() :
-*   Tells which decoder is likely to decode faster,
-*   based on a set of pre-determined metrics.
-*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
-*   Assumption : 0 < cSrcSize < dstSize <= 128 KB */
-U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize);
-
-size_t HUF_readDTableX2 (HUF_DTable* DTable, const void* src, size_t srcSize);
-size_t HUF_readDTableX2_wksp (HUF_DTable* DTable, const void* src, size_t srcSize, void* workSpace, size_t wkspSize);
-size_t HUF_readDTableX4 (HUF_DTable* DTable, const void* src, size_t srcSize);
-size_t HUF_readDTableX4_wksp (HUF_DTable* DTable, const void* src, size_t srcSize, void* workSpace, size_t wkspSize);
-
-size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
-size_t HUF_decompress4X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
-size_t HUF_decompress4X4_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
-
-
-/* single stream variants */
-
-size_t HUF_compress1X (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog);
-size_t HUF_compress1X_wksp (void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
-size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable);
-/** HUF_compress1X_repeat() :
-*   Same as HUF_compress1X_wksp(), but considers using hufTable if *repeat != HUF_repeat_none.
-*   If it uses hufTable it does not modify hufTable or repeat.
-*   If it doesn't, it sets *repeat = HUF_repeat_none, and it sets hufTable to the table used.
-*   If preferRepeat then the old table will always be used if valid. */
-size_t HUF_compress1X_repeat(void* dst, size_t dstSize, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog, void* workSpace, size_t wkspSize, HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat);  /**< `workSpace` must be a table of at least HUF_WORKSPACE_SIZE_U32 unsigned */
-
-size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* single-symbol decoder */
-size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /* double-symbol decoder */
-
-size_t HUF_decompress1X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
-size_t HUF_decompress1X_DCtx_wksp (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);
-size_t HUF_decompress1X2_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< single-symbol decoder */
-size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< single-symbol decoder */
-size_t HUF_decompress1X4_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);   /**< double-symbols decoder */
-size_t HUF_decompress1X4_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize, void* workSpace, size_t wkspSize);   /**< double-symbols decoder */
-
-size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);   /**< automatic selection of sing or double symbol decoder, based on DTable */
-size_t HUF_decompress1X2_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
-size_t HUF_decompress1X4_usingDTable(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize, const HUF_DTable* DTable);
-
-#endif /* HUF_STATIC_LINKING_ONLY */
-
-#if defined (__cplusplus)
-}
-#endif
diff --git a/priv/zstd/lib/common/mem.h b/priv/zstd/lib/common/mem.h
deleted file mode 100644
index 47d2300..0000000
--- a/priv/zstd/lib/common/mem.h
+++ /dev/null
@@ -1,362 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef MEM_H_MODULE
-#define MEM_H_MODULE
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/*-****************************************
-*  Dependencies
-******************************************/
-#include      /* size_t, ptrdiff_t */
-#include      /* memcpy */
-
-
-/*-****************************************
-*  Compiler specifics
-******************************************/
-#if defined(_MSC_VER)   /* Visual Studio */
-#   include   /* _byteswap_ulong */
-#   include   /* _byteswap_* */
-#endif
-#if defined(__GNUC__)
-#  define MEM_STATIC static __inline __attribute__((unused))
-#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#  define MEM_STATIC static inline
-#elif defined(_MSC_VER)
-#  define MEM_STATIC static __inline
-#else
-#  define MEM_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
-#endif
-
-/* code only tested on 32 and 64 bits systems */
-#define MEM_STATIC_ASSERT(c)   { enum { MEM_static_assert = 1/(int)(!!(c)) }; }
-MEM_STATIC void MEM_check(void) { MEM_STATIC_ASSERT((sizeof(size_t)==4) || (sizeof(size_t)==8)); }
-
-
-/*-**************************************************************
-*  Basic Types
-*****************************************************************/
-#if  !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
-# include 
-  typedef   uint8_t BYTE;
-  typedef  uint16_t U16;
-  typedef   int16_t S16;
-  typedef  uint32_t U32;
-  typedef   int32_t S32;
-  typedef  uint64_t U64;
-  typedef   int64_t S64;
-#else
-  typedef unsigned char      BYTE;
-  typedef unsigned short      U16;
-  typedef   signed short      S16;
-  typedef unsigned int        U32;
-  typedef   signed int        S32;
-  typedef unsigned long long  U64;
-  typedef   signed long long  S64;
-#endif
-
-
-/*-**************************************************************
-*  Memory I/O
-*****************************************************************/
-/* MEM_FORCE_MEMORY_ACCESS :
- * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
- * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
- * The below switch allow to select different access method for improved performance.
- * Method 0 (default) : use `memcpy()`. Safe and portable.
- * Method 1 : `__packed` statement. It depends on compiler extension (i.e., not portable).
- *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
- * Method 2 : direct access. This method is portable but violate C standard.
- *            It can generate buggy code on targets depending on alignment.
- *            In some circumstances, it's the only known way to get the most performance (i.e. GCC + ARMv6)
- * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
- * Prefer these methods in priority order (0 > 1 > 2)
- */
-#ifndef MEM_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
-#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
-#    define MEM_FORCE_MEMORY_ACCESS 2
-#  elif defined(__INTEL_COMPILER) || defined(__GNUC__)
-#    define MEM_FORCE_MEMORY_ACCESS 1
-#  endif
-#endif
-
-MEM_STATIC unsigned MEM_32bits(void) { return sizeof(size_t)==4; }
-MEM_STATIC unsigned MEM_64bits(void) { return sizeof(size_t)==8; }
-
-MEM_STATIC unsigned MEM_isLittleEndian(void)
-{
-    const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
-    return one.c[0];
-}
-
-#if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)
-
-/* violates C standard, by lying on structure alignment.
-Only use if no other choice to achieve best performance on target platform */
-MEM_STATIC U16 MEM_read16(const void* memPtr) { return *(const U16*) memPtr; }
-MEM_STATIC U32 MEM_read32(const void* memPtr) { return *(const U32*) memPtr; }
-MEM_STATIC U64 MEM_read64(const void* memPtr) { return *(const U64*) memPtr; }
-MEM_STATIC size_t MEM_readST(const void* memPtr) { return *(const size_t*) memPtr; }
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }
-MEM_STATIC void MEM_write32(void* memPtr, U32 value) { *(U32*)memPtr = value; }
-MEM_STATIC void MEM_write64(void* memPtr, U64 value) { *(U64*)memPtr = value; }
-
-#elif defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==1)
-
-/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
-/* currently only defined for gcc and icc */
-#if defined(_MSC_VER) || (defined(__INTEL_COMPILER) && defined(WIN32))
-    __pragma( pack(push, 1) )
-    typedef struct { U16 v; } unalign16;
-    typedef struct { U32 v; } unalign32;
-    typedef struct { U64 v; } unalign64;
-    typedef struct { size_t v; } unalignArch;
-    __pragma( pack(pop) )
-#else
-    typedef struct { U16 v; } __attribute__((packed)) unalign16;
-    typedef struct { U32 v; } __attribute__((packed)) unalign32;
-    typedef struct { U64 v; } __attribute__((packed)) unalign64;
-    typedef struct { size_t v; } __attribute__((packed)) unalignArch;
-#endif
-
-MEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign16*)ptr)->v; }
-MEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign32*)ptr)->v; }
-MEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign64*)ptr)->v; }
-MEM_STATIC size_t MEM_readST(const void* ptr) { return ((const unalignArch*)ptr)->v; }
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign16*)memPtr)->v = value; }
-MEM_STATIC void MEM_write32(void* memPtr, U32 value) { ((unalign32*)memPtr)->v = value; }
-MEM_STATIC void MEM_write64(void* memPtr, U64 value) { ((unalign64*)memPtr)->v = value; }
-
-#else
-
-/* default method, safe and standard.
-   can sometimes prove slower */
-
-MEM_STATIC U16 MEM_read16(const void* memPtr)
-{
-    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC U32 MEM_read32(const void* memPtr)
-{
-    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC U64 MEM_read64(const void* memPtr)
-{
-    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC size_t MEM_readST(const void* memPtr)
-{
-    size_t val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value)
-{
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-MEM_STATIC void MEM_write32(void* memPtr, U32 value)
-{
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-MEM_STATIC void MEM_write64(void* memPtr, U64 value)
-{
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-#endif /* MEM_FORCE_MEMORY_ACCESS */
-
-MEM_STATIC U32 MEM_swap32(U32 in)
-{
-#if defined(_MSC_VER)     /* Visual Studio */
-    return _byteswap_ulong(in);
-#elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
-    return __builtin_bswap32(in);
-#else
-    return  ((in << 24) & 0xff000000 ) |
-            ((in <<  8) & 0x00ff0000 ) |
-            ((in >>  8) & 0x0000ff00 ) |
-            ((in >> 24) & 0x000000ff );
-#endif
-}
-
-MEM_STATIC U64 MEM_swap64(U64 in)
-{
-#if defined(_MSC_VER)     /* Visual Studio */
-    return _byteswap_uint64(in);
-#elif defined (__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ >= 403)
-    return __builtin_bswap64(in);
-#else
-    return  ((in << 56) & 0xff00000000000000ULL) |
-            ((in << 40) & 0x00ff000000000000ULL) |
-            ((in << 24) & 0x0000ff0000000000ULL) |
-            ((in << 8)  & 0x000000ff00000000ULL) |
-            ((in >> 8)  & 0x00000000ff000000ULL) |
-            ((in >> 24) & 0x0000000000ff0000ULL) |
-            ((in >> 40) & 0x000000000000ff00ULL) |
-            ((in >> 56) & 0x00000000000000ffULL);
-#endif
-}
-
-MEM_STATIC size_t MEM_swapST(size_t in)
-{
-    if (MEM_32bits())
-        return (size_t)MEM_swap32((U32)in);
-    else
-        return (size_t)MEM_swap64((U64)in);
-}
-
-/*=== Little endian r/w ===*/
-
-MEM_STATIC U16 MEM_readLE16(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_read16(memPtr);
-    else {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U16)(p[0] + (p[1]<<8));
-    }
-}
-
-MEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)
-{
-    if (MEM_isLittleEndian()) {
-        MEM_write16(memPtr, val);
-    } else {
-        BYTE* p = (BYTE*)memPtr;
-        p[0] = (BYTE)val;
-        p[1] = (BYTE)(val>>8);
-    }
-}
-
-MEM_STATIC U32 MEM_readLE24(const void* memPtr)
-{
-    return MEM_readLE16(memPtr) + (((const BYTE*)memPtr)[2] << 16);
-}
-
-MEM_STATIC void MEM_writeLE24(void* memPtr, U32 val)
-{
-    MEM_writeLE16(memPtr, (U16)val);
-    ((BYTE*)memPtr)[2] = (BYTE)(val>>16);
-}
-
-MEM_STATIC U32 MEM_readLE32(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_read32(memPtr);
-    else
-        return MEM_swap32(MEM_read32(memPtr));
-}
-
-MEM_STATIC void MEM_writeLE32(void* memPtr, U32 val32)
-{
-    if (MEM_isLittleEndian())
-        MEM_write32(memPtr, val32);
-    else
-        MEM_write32(memPtr, MEM_swap32(val32));
-}
-
-MEM_STATIC U64 MEM_readLE64(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_read64(memPtr);
-    else
-        return MEM_swap64(MEM_read64(memPtr));
-}
-
-MEM_STATIC void MEM_writeLE64(void* memPtr, U64 val64)
-{
-    if (MEM_isLittleEndian())
-        MEM_write64(memPtr, val64);
-    else
-        MEM_write64(memPtr, MEM_swap64(val64));
-}
-
-MEM_STATIC size_t MEM_readLEST(const void* memPtr)
-{
-    if (MEM_32bits())
-        return (size_t)MEM_readLE32(memPtr);
-    else
-        return (size_t)MEM_readLE64(memPtr);
-}
-
-MEM_STATIC void MEM_writeLEST(void* memPtr, size_t val)
-{
-    if (MEM_32bits())
-        MEM_writeLE32(memPtr, (U32)val);
-    else
-        MEM_writeLE64(memPtr, (U64)val);
-}
-
-/*=== Big endian r/w ===*/
-
-MEM_STATIC U32 MEM_readBE32(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_swap32(MEM_read32(memPtr));
-    else
-        return MEM_read32(memPtr);
-}
-
-MEM_STATIC void MEM_writeBE32(void* memPtr, U32 val32)
-{
-    if (MEM_isLittleEndian())
-        MEM_write32(memPtr, MEM_swap32(val32));
-    else
-        MEM_write32(memPtr, val32);
-}
-
-MEM_STATIC U64 MEM_readBE64(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_swap64(MEM_read64(memPtr));
-    else
-        return MEM_read64(memPtr);
-}
-
-MEM_STATIC void MEM_writeBE64(void* memPtr, U64 val64)
-{
-    if (MEM_isLittleEndian())
-        MEM_write64(memPtr, MEM_swap64(val64));
-    else
-        MEM_write64(memPtr, val64);
-}
-
-MEM_STATIC size_t MEM_readBEST(const void* memPtr)
-{
-    if (MEM_32bits())
-        return (size_t)MEM_readBE32(memPtr);
-    else
-        return (size_t)MEM_readBE64(memPtr);
-}
-
-MEM_STATIC void MEM_writeBEST(void* memPtr, size_t val)
-{
-    if (MEM_32bits())
-        MEM_writeBE32(memPtr, (U32)val);
-    else
-        MEM_writeBE64(memPtr, (U64)val);
-}
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* MEM_H_MODULE */
diff --git a/priv/zstd/lib/common/pool.c b/priv/zstd/lib/common/pool.c
deleted file mode 100644
index 98b109e..0000000
--- a/priv/zstd/lib/common/pool.c
+++ /dev/null
@@ -1,254 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/* ======   Dependencies   ======= */
-#include   /* size_t */
-#include "pool.h"
-
-/* ======   Compiler specifics   ====== */
-#if defined(_MSC_VER)
-#  pragma warning(disable : 4204)        /* disable: C4204: non-constant aggregate initializer */
-#endif
-
-
-#ifdef ZSTD_MULTITHREAD
-
-#include "threading.h"   /* pthread adaptation */
-
-/* A job is a function and an opaque argument */
-typedef struct POOL_job_s {
-    POOL_function function;
-    void *opaque;
-} POOL_job;
-
-struct POOL_ctx_s {
-    ZSTD_customMem customMem;
-    /* Keep track of the threads */
-    ZSTD_pthread_t *threads;
-    size_t numThreads;
-
-    /* The queue is a circular buffer */
-    POOL_job *queue;
-    size_t queueHead;
-    size_t queueTail;
-    size_t queueSize;
-
-    /* The number of threads working on jobs */
-    size_t numThreadsBusy;
-    /* Indicates if the queue is empty */
-    int queueEmpty;
-
-    /* The mutex protects the queue */
-    ZSTD_pthread_mutex_t queueMutex;
-    /* Condition variable for pushers to wait on when the queue is full */
-    ZSTD_pthread_cond_t queuePushCond;
-    /* Condition variables for poppers to wait on when the queue is empty */
-    ZSTD_pthread_cond_t queuePopCond;
-    /* Indicates if the queue is shutting down */
-    int shutdown;
-};
-
-/* POOL_thread() :
-   Work thread for the thread pool.
-   Waits for jobs and executes them.
-   @returns : NULL on failure else non-null.
-*/
-static void* POOL_thread(void* opaque) {
-    POOL_ctx* const ctx = (POOL_ctx*)opaque;
-    if (!ctx) { return NULL; }
-    for (;;) {
-        /* Lock the mutex and wait for a non-empty queue or until shutdown */
-        ZSTD_pthread_mutex_lock(&ctx->queueMutex);
-
-        while (ctx->queueEmpty && !ctx->shutdown) {
-            ZSTD_pthread_cond_wait(&ctx->queuePopCond, &ctx->queueMutex);
-        }
-        /* empty => shutting down: so stop */
-        if (ctx->queueEmpty) {
-            ZSTD_pthread_mutex_unlock(&ctx->queueMutex);
-            return opaque;
-        }
-        /* Pop a job off the queue */
-        {   POOL_job const job = ctx->queue[ctx->queueHead];
-            ctx->queueHead = (ctx->queueHead + 1) % ctx->queueSize;
-            ctx->numThreadsBusy++;
-            ctx->queueEmpty = ctx->queueHead == ctx->queueTail;
-            /* Unlock the mutex, signal a pusher, and run the job */
-            ZSTD_pthread_mutex_unlock(&ctx->queueMutex);
-            ZSTD_pthread_cond_signal(&ctx->queuePushCond);
-
-            job.function(job.opaque);
-
-            /* If the intended queue size was 0, signal after finishing job */
-            if (ctx->queueSize == 1) {
-                ZSTD_pthread_mutex_lock(&ctx->queueMutex);
-                ctx->numThreadsBusy--;
-                ZSTD_pthread_mutex_unlock(&ctx->queueMutex);
-                ZSTD_pthread_cond_signal(&ctx->queuePushCond);
-        }   }
-    }  /* for (;;) */
-    /* Unreachable */
-}
-
-POOL_ctx* POOL_create(size_t numThreads, size_t queueSize) {
-    return POOL_create_advanced(numThreads, queueSize, ZSTD_defaultCMem);
-}
-
-POOL_ctx* POOL_create_advanced(size_t numThreads, size_t queueSize, ZSTD_customMem customMem) {
-    POOL_ctx* ctx;
-    /* Check the parameters */
-    if (!numThreads) { return NULL; }
-    /* Allocate the context and zero initialize */
-    ctx = (POOL_ctx*)ZSTD_calloc(sizeof(POOL_ctx), customMem);
-    if (!ctx) { return NULL; }
-    /* Initialize the job queue.
-     * It needs one extra space since one space is wasted to differentiate empty
-     * and full queues.
-     */
-    ctx->queueSize = queueSize + 1;
-    ctx->queue = (POOL_job*)ZSTD_malloc(ctx->queueSize * sizeof(POOL_job), customMem);
-    ctx->queueHead = 0;
-    ctx->queueTail = 0;
-    ctx->numThreadsBusy = 0;
-    ctx->queueEmpty = 1;
-    (void)ZSTD_pthread_mutex_init(&ctx->queueMutex, NULL);
-    (void)ZSTD_pthread_cond_init(&ctx->queuePushCond, NULL);
-    (void)ZSTD_pthread_cond_init(&ctx->queuePopCond, NULL);
-    ctx->shutdown = 0;
-    /* Allocate space for the thread handles */
-    ctx->threads = (ZSTD_pthread_t*)ZSTD_malloc(numThreads * sizeof(ZSTD_pthread_t), customMem);
-    ctx->numThreads = 0;
-    ctx->customMem = customMem;
-    /* Check for errors */
-    if (!ctx->threads || !ctx->queue) { POOL_free(ctx); return NULL; }
-    /* Initialize the threads */
-    {   size_t i;
-        for (i = 0; i < numThreads; ++i) {
-            if (ZSTD_pthread_create(&ctx->threads[i], NULL, &POOL_thread, ctx)) {
-                ctx->numThreads = i;
-                POOL_free(ctx);
-                return NULL;
-        }   }
-        ctx->numThreads = numThreads;
-    }
-    return ctx;
-}
-
-/*! POOL_join() :
-    Shutdown the queue, wake any sleeping threads, and join all of the threads.
-*/
-static void POOL_join(POOL_ctx* ctx) {
-    /* Shut down the queue */
-    ZSTD_pthread_mutex_lock(&ctx->queueMutex);
-    ctx->shutdown = 1;
-    ZSTD_pthread_mutex_unlock(&ctx->queueMutex);
-    /* Wake up sleeping threads */
-    ZSTD_pthread_cond_broadcast(&ctx->queuePushCond);
-    ZSTD_pthread_cond_broadcast(&ctx->queuePopCond);
-    /* Join all of the threads */
-    {   size_t i;
-        for (i = 0; i < ctx->numThreads; ++i) {
-            ZSTD_pthread_join(ctx->threads[i], NULL);
-    }   }
-}
-
-void POOL_free(POOL_ctx *ctx) {
-    if (!ctx) { return; }
-    POOL_join(ctx);
-    ZSTD_pthread_mutex_destroy(&ctx->queueMutex);
-    ZSTD_pthread_cond_destroy(&ctx->queuePushCond);
-    ZSTD_pthread_cond_destroy(&ctx->queuePopCond);
-    ZSTD_free(ctx->queue, ctx->customMem);
-    ZSTD_free(ctx->threads, ctx->customMem);
-    ZSTD_free(ctx, ctx->customMem);
-}
-
-size_t POOL_sizeof(POOL_ctx *ctx) {
-    if (ctx==NULL) return 0;  /* supports sizeof NULL */
-    return sizeof(*ctx)
-        + ctx->queueSize * sizeof(POOL_job)
-        + ctx->numThreads * sizeof(ZSTD_pthread_t);
-}
-
-/**
- * Returns 1 if the queue is full and 0 otherwise.
- *
- * If the queueSize is 1 (the pool was created with an intended queueSize of 0),
- * then a queue is empty if there is a thread free and no job is waiting.
- */
-static int isQueueFull(POOL_ctx const* ctx) {
-    if (ctx->queueSize > 1) {
-        return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize);
-    } else {
-        return ctx->numThreadsBusy == ctx->numThreads ||
-               !ctx->queueEmpty;
-    }
-}
-
-void POOL_add(void* ctxVoid, POOL_function function, void *opaque) {
-    POOL_ctx* const ctx = (POOL_ctx*)ctxVoid;
-    if (!ctx) { return; }
-
-    ZSTD_pthread_mutex_lock(&ctx->queueMutex);
-    {   POOL_job const job = {function, opaque};
-
-        /* Wait until there is space in the queue for the new job */
-        while (isQueueFull(ctx) && !ctx->shutdown) {
-          ZSTD_pthread_cond_wait(&ctx->queuePushCond, &ctx->queueMutex);
-        }
-        /* The queue is still going => there is space */
-        if (!ctx->shutdown) {
-            ctx->queueEmpty = 0;
-            ctx->queue[ctx->queueTail] = job;
-            ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize;
-        }
-    }
-    ZSTD_pthread_mutex_unlock(&ctx->queueMutex);
-    ZSTD_pthread_cond_signal(&ctx->queuePopCond);
-}
-
-#else  /* ZSTD_MULTITHREAD  not defined */
-/* No multi-threading support */
-
-/* We don't need any data, but if it is empty malloc() might return NULL. */
-struct POOL_ctx_s {
-    int dummy;
-};
-static POOL_ctx g_ctx;
-
-POOL_ctx* POOL_create(size_t numThreads, size_t queueSize) {
-    return POOL_create_advanced(numThreads, queueSize, ZSTD_defaultCMem);
-}
-
-POOL_ctx* POOL_create_advanced(size_t numThreads, size_t queueSize, ZSTD_customMem customMem) {
-    (void)numThreads;
-    (void)queueSize;
-    (void)customMem;
-    return &g_ctx;
-}
-
-void POOL_free(POOL_ctx* ctx) {
-    assert(!ctx || ctx == &g_ctx);
-    (void)ctx;
-}
-
-void POOL_add(void* ctx, POOL_function function, void* opaque) {
-    (void)ctx;
-    function(opaque);
-}
-
-size_t POOL_sizeof(POOL_ctx* ctx) {
-    if (ctx==NULL) return 0;  /* supports sizeof NULL */
-    assert(ctx == &g_ctx);
-    return sizeof(*ctx);
-}
-
-#endif  /* ZSTD_MULTITHREAD */
diff --git a/priv/zstd/lib/common/pool.h b/priv/zstd/lib/common/pool.h
deleted file mode 100644
index 08c6371..0000000
--- a/priv/zstd/lib/common/pool.h
+++ /dev/null
@@ -1,65 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef POOL_H
-#define POOL_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-#include    /* size_t */
-#include "zstd_internal.h"   /* ZSTD_customMem */
-
-typedef struct POOL_ctx_s POOL_ctx;
-
-/*! POOL_create() :
- *  Create a thread pool with at most `numThreads` threads.
- * `numThreads` must be at least 1.
- *  The maximum number of queued jobs before blocking is `queueSize`.
- * @return : POOL_ctx pointer on success, else NULL.
-*/
-POOL_ctx *POOL_create(size_t numThreads, size_t queueSize);
-
-POOL_ctx *POOL_create_advanced(size_t numThreads, size_t queueSize, ZSTD_customMem customMem);
-
-/*! POOL_free() :
-    Free a thread pool returned by POOL_create().
-*/
-void POOL_free(POOL_ctx *ctx);
-
-/*! POOL_sizeof() :
-    return memory usage of pool returned by POOL_create().
-*/
-size_t POOL_sizeof(POOL_ctx *ctx);
-
-/*! POOL_function :
-    The function type that can be added to a thread pool.
-*/
-typedef void (*POOL_function)(void *);
-/*! POOL_add_function :
-    The function type for a generic thread pool add function.
-*/
-typedef void (*POOL_add_function)(void *, POOL_function, void *);
-
-/*! POOL_add() :
-    Add the job `function(opaque)` to the thread pool.
-    Possibly blocks until there is room in the queue.
-    Note : The function may be executed asynchronously, so `opaque` must live until the function has been completed.
-*/
-void POOL_add(void *ctx, POOL_function function, void *opaque);
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif
diff --git a/priv/zstd/lib/common/threading.c b/priv/zstd/lib/common/threading.c
deleted file mode 100644
index 8be8c8d..0000000
--- a/priv/zstd/lib/common/threading.c
+++ /dev/null
@@ -1,75 +0,0 @@
-/**
- * Copyright (c) 2016 Tino Reichardt
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- *
- * You can contact the author at:
- * - zstdmt source repository: https://github.com/mcmilk/zstdmt
- */
-
-/**
- * This file will hold wrapper for systems, which do not support pthreads
- */
-
-/* create fake symbol to avoid empty trnaslation unit warning */
-int g_ZSTD_threading_useles_symbol;
-
-#if defined(ZSTD_MULTITHREAD) && defined(_WIN32)
-
-/**
- * Windows minimalist Pthread Wrapper, based on :
- * http://www.cse.wustl.edu/~schmidt/win32-cv-1.html
- */
-
-
-/* ===  Dependencies  === */
-#include 
-#include 
-#include "threading.h"
-
-
-/* ===  Implementation  === */
-
-static unsigned __stdcall worker(void *arg)
-{
-    ZSTD_pthread_t* const thread = (ZSTD_pthread_t*) arg;
-    thread->arg = thread->start_routine(thread->arg);
-    return 0;
-}
-
-int ZSTD_pthread_create(ZSTD_pthread_t* thread, const void* unused,
-            void* (*start_routine) (void*), void* arg)
-{
-    (void)unused;
-    thread->arg = arg;
-    thread->start_routine = start_routine;
-    thread->handle = (HANDLE) _beginthreadex(NULL, 0, worker, thread, 0, NULL);
-
-    if (!thread->handle)
-        return errno;
-    else
-        return 0;
-}
-
-int ZSTD_pthread_join(ZSTD_pthread_t thread, void **value_ptr)
-{
-    DWORD result;
-
-    if (!thread.handle) return 0;
-
-    result = WaitForSingleObject(thread.handle, INFINITE);
-    switch (result) {
-    case WAIT_OBJECT_0:
-        if (value_ptr) *value_ptr = thread.arg;
-        return 0;
-    case WAIT_ABANDONED:
-        return EINVAL;
-    default:
-        return GetLastError();
-    }
-}
-
-#endif   /* ZSTD_MULTITHREAD */
diff --git a/priv/zstd/lib/common/threading.h b/priv/zstd/lib/common/threading.h
deleted file mode 100644
index 197770d..0000000
--- a/priv/zstd/lib/common/threading.h
+++ /dev/null
@@ -1,123 +0,0 @@
-/**
- * Copyright (c) 2016 Tino Reichardt
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- *
- * You can contact the author at:
- * - zstdmt source repository: https://github.com/mcmilk/zstdmt
- */
-
-#ifndef THREADING_H_938743
-#define THREADING_H_938743
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#if defined(ZSTD_MULTITHREAD) && defined(_WIN32)
-
-/**
- * Windows minimalist Pthread Wrapper, based on :
- * http://www.cse.wustl.edu/~schmidt/win32-cv-1.html
- */
-#ifdef WINVER
-#  undef WINVER
-#endif
-#define WINVER       0x0600
-
-#ifdef _WIN32_WINNT
-#  undef _WIN32_WINNT
-#endif
-#define _WIN32_WINNT 0x0600
-
-#ifndef WIN32_LEAN_AND_MEAN
-#  define WIN32_LEAN_AND_MEAN
-#endif
-
-#undef ERROR   /* reported already defined on VS 2015 (Rich Geldreich) */
-#include 
-#undef ERROR
-#define ERROR(name) ZSTD_ERROR(name)
-
-
-/* mutex */
-#define ZSTD_pthread_mutex_t           CRITICAL_SECTION
-#define ZSTD_pthread_mutex_init(a, b)  (InitializeCriticalSection((a)), 0)
-#define ZSTD_pthread_mutex_destroy(a)  DeleteCriticalSection((a))
-#define ZSTD_pthread_mutex_lock(a)     EnterCriticalSection((a))
-#define ZSTD_pthread_mutex_unlock(a)   LeaveCriticalSection((a))
-
-/* condition variable */
-#define ZSTD_pthread_cond_t             CONDITION_VARIABLE
-#define ZSTD_pthread_cond_init(a, b)    (InitializeConditionVariable((a)), 0)
-#define ZSTD_pthread_cond_destroy(a)    /* No delete */
-#define ZSTD_pthread_cond_wait(a, b)    SleepConditionVariableCS((a), (b), INFINITE)
-#define ZSTD_pthread_cond_signal(a)     WakeConditionVariable((a))
-#define ZSTD_pthread_cond_broadcast(a)  WakeAllConditionVariable((a))
-
-/* ZSTD_pthread_create() and ZSTD_pthread_join() */
-typedef struct {
-    HANDLE handle;
-    void* (*start_routine)(void*);
-    void* arg;
-} ZSTD_pthread_t;
-
-int ZSTD_pthread_create(ZSTD_pthread_t* thread, const void* unused,
-                   void* (*start_routine) (void*), void* arg);
-
-int ZSTD_pthread_join(ZSTD_pthread_t thread, void** value_ptr);
-
-/**
- * add here more wrappers as required
- */
-
-
-#elif defined(ZSTD_MULTITHREAD)   /* posix assumed ; need a better detection method */
-/* ===   POSIX Systems   === */
-#  include 
-
-#define ZSTD_pthread_mutex_t            pthread_mutex_t
-#define ZSTD_pthread_mutex_init(a, b)   pthread_mutex_init((a), (b))
-#define ZSTD_pthread_mutex_destroy(a)   pthread_mutex_destroy((a))
-#define ZSTD_pthread_mutex_lock(a)      pthread_mutex_lock((a))
-#define ZSTD_pthread_mutex_unlock(a)    pthread_mutex_unlock((a))
-
-#define ZSTD_pthread_cond_t             pthread_cond_t
-#define ZSTD_pthread_cond_init(a, b)    pthread_cond_init((a), (b))
-#define ZSTD_pthread_cond_destroy(a)    pthread_cond_destroy((a))
-#define ZSTD_pthread_cond_wait(a, b)    pthread_cond_wait((a), (b))
-#define ZSTD_pthread_cond_signal(a)     pthread_cond_signal((a))
-#define ZSTD_pthread_cond_broadcast(a)  pthread_cond_broadcast((a))
-
-#define ZSTD_pthread_t                  pthread_t
-#define ZSTD_pthread_create(a, b, c, d) pthread_create((a), (b), (c), (d))
-#define ZSTD_pthread_join(a, b)         pthread_join((a),(b))
-
-#else  /* ZSTD_MULTITHREAD not defined */
-/* No multithreading support */
-
-typedef int ZSTD_pthread_mutex_t;
-#define ZSTD_pthread_mutex_init(a, b)   ((void)a, 0)
-#define ZSTD_pthread_mutex_destroy(a)
-#define ZSTD_pthread_mutex_lock(a)
-#define ZSTD_pthread_mutex_unlock(a)
-
-typedef int ZSTD_pthread_cond_t;
-#define ZSTD_pthread_cond_init(a, b)    ((void)a, 0)
-#define ZSTD_pthread_cond_destroy(a)
-#define ZSTD_pthread_cond_wait(a, b)
-#define ZSTD_pthread_cond_signal(a)
-#define ZSTD_pthread_cond_broadcast(a)
-
-/* do not use ZSTD_pthread_t */
-
-#endif /* ZSTD_MULTITHREAD */
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* THREADING_H_938743 */
diff --git a/priv/zstd/lib/common/xxhash.c b/priv/zstd/lib/common/xxhash.c
deleted file mode 100644
index 9d9c0e9..0000000
--- a/priv/zstd/lib/common/xxhash.c
+++ /dev/null
@@ -1,875 +0,0 @@
-/*
-*  xxHash - Fast Hash algorithm
-*  Copyright (C) 2012-2016, Yann Collet
-*
-*  BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-*
-*  Redistribution and use in source and binary forms, with or without
-*  modification, are permitted provided that the following conditions are
-*  met:
-*
-*  * Redistributions of source code must retain the above copyright
-*  notice, this list of conditions and the following disclaimer.
-*  * Redistributions in binary form must reproduce the above
-*  copyright notice, this list of conditions and the following disclaimer
-*  in the documentation and/or other materials provided with the
-*  distribution.
-*
-*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-*  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-*  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-*  OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-*  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-*  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-*  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-*  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-*  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-*  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*
-*  You can contact the author at :
-*  - xxHash homepage: http://www.xxhash.com
-*  - xxHash source repository : https://github.com/Cyan4973/xxHash
-*/
-
-
-/* *************************************
-*  Tuning parameters
-***************************************/
-/*!XXH_FORCE_MEMORY_ACCESS :
- * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
- * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
- * The below switch allow to select different access method for improved performance.
- * Method 0 (default) : use `memcpy()`. Safe and portable.
- * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
- *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
- * Method 2 : direct access. This method doesn't depend on compiler but violate C standard.
- *            It can generate buggy code on targets which do not support unaligned memory accesses.
- *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
- * See http://stackoverflow.com/a/32095106/646947 for details.
- * Prefer these methods in priority order (0 > 1 > 2)
- */
-#ifndef XXH_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
-#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
-#    define XXH_FORCE_MEMORY_ACCESS 2
-#  elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \
-  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
-#    define XXH_FORCE_MEMORY_ACCESS 1
-#  endif
-#endif
-
-/*!XXH_ACCEPT_NULL_INPUT_POINTER :
- * If the input pointer is a null pointer, xxHash default behavior is to trigger a memory access error, since it is a bad pointer.
- * When this option is enabled, xxHash output for null input pointers will be the same as a null-length input.
- * By default, this option is disabled. To enable it, uncomment below define :
- */
-/* #define XXH_ACCEPT_NULL_INPUT_POINTER 1 */
-
-/*!XXH_FORCE_NATIVE_FORMAT :
- * By default, xxHash library provides endian-independant Hash values, based on little-endian convention.
- * Results are therefore identical for little-endian and big-endian CPU.
- * This comes at a performance cost for big-endian CPU, since some swapping is required to emulate little-endian format.
- * Should endian-independance be of no importance for your application, you may set the #define below to 1,
- * to improve speed for Big-endian CPU.
- * This option has no impact on Little_Endian CPU.
- */
-#ifndef XXH_FORCE_NATIVE_FORMAT   /* can be defined externally */
-#  define XXH_FORCE_NATIVE_FORMAT 0
-#endif
-
-/*!XXH_FORCE_ALIGN_CHECK :
- * This is a minor performance trick, only useful with lots of very small keys.
- * It means : check for aligned/unaligned input.
- * The check costs one initial branch per hash; set to 0 when the input data
- * is guaranteed to be aligned.
- */
-#ifndef XXH_FORCE_ALIGN_CHECK /* can be defined externally */
-#  if defined(__i386) || defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64)
-#    define XXH_FORCE_ALIGN_CHECK 0
-#  else
-#    define XXH_FORCE_ALIGN_CHECK 1
-#  endif
-#endif
-
-
-/* *************************************
-*  Includes & Memory related functions
-***************************************/
-/* Modify the local functions below should you wish to use some other memory routines */
-/* for malloc(), free() */
-#include 
-static void* XXH_malloc(size_t s) { return malloc(s); }
-static void  XXH_free  (void* p)  { free(p); }
-/* for memcpy() */
-#include 
-static void* XXH_memcpy(void* dest, const void* src, size_t size) { return memcpy(dest,src,size); }
-
-#ifndef XXH_STATIC_LINKING_ONLY
-#  define XXH_STATIC_LINKING_ONLY
-#endif
-#include "xxhash.h"
-
-
-/* *************************************
-*  Compiler Specific Options
-***************************************/
-#if defined (__GNUC__) || defined(__cplusplus) || defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#  define INLINE_KEYWORD inline
-#else
-#  define INLINE_KEYWORD
-#endif
-
-#if defined(__GNUC__)
-#  define FORCE_INLINE_ATTR __attribute__((always_inline))
-#elif defined(_MSC_VER)
-#  define FORCE_INLINE_ATTR __forceinline
-#else
-#  define FORCE_INLINE_ATTR
-#endif
-
-#define FORCE_INLINE_TEMPLATE static INLINE_KEYWORD FORCE_INLINE_ATTR
-
-
-#ifdef _MSC_VER
-#  pragma warning(disable : 4127)      /* disable: C4127: conditional expression is constant */
-#endif
-
-
-/* *************************************
-*  Basic Types
-***************************************/
-#ifndef MEM_MODULE
-# define MEM_MODULE
-# if !defined (__VMS) && (defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
-#   include 
-    typedef uint8_t  BYTE;
-    typedef uint16_t U16;
-    typedef uint32_t U32;
-    typedef  int32_t S32;
-    typedef uint64_t U64;
-#  else
-    typedef unsigned char      BYTE;
-    typedef unsigned short     U16;
-    typedef unsigned int       U32;
-    typedef   signed int       S32;
-    typedef unsigned long long U64;   /* if your compiler doesn't support unsigned long long, replace by another 64-bit type here. Note that xxhash.h will also need to be updated. */
-#  endif
-#endif
-
-
-#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))
-
-/* Force direct memory access. Only works on CPU which support unaligned memory access in hardware */
-static U32 XXH_read32(const void* memPtr) { return *(const U32*) memPtr; }
-static U64 XXH_read64(const void* memPtr) { return *(const U64*) memPtr; }
-
-#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))
-
-/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
-/* currently only defined for gcc and icc */
-typedef union { U32 u32; U64 u64; } __attribute__((packed)) unalign;
-
-static U32 XXH_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
-static U64 XXH_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
-
-#else
-
-/* portable and safe solution. Generally efficient.
- * see : http://stackoverflow.com/a/32095106/646947
- */
-
-static U32 XXH_read32(const void* memPtr)
-{
-    U32 val;
-    memcpy(&val, memPtr, sizeof(val));
-    return val;
-}
-
-static U64 XXH_read64(const void* memPtr)
-{
-    U64 val;
-    memcpy(&val, memPtr, sizeof(val));
-    return val;
-}
-
-#endif   /* XXH_FORCE_DIRECT_MEMORY_ACCESS */
-
-
-/* ****************************************
-*  Compiler-specific Functions and Macros
-******************************************/
-#define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
-
-/* Note : although _rotl exists for minGW (GCC under windows), performance seems poor */
-#if defined(_MSC_VER)
-#  define XXH_rotl32(x,r) _rotl(x,r)
-#  define XXH_rotl64(x,r) _rotl64(x,r)
-#else
-#  define XXH_rotl32(x,r) ((x << r) | (x >> (32 - r)))
-#  define XXH_rotl64(x,r) ((x << r) | (x >> (64 - r)))
-#endif
-
-#if defined(_MSC_VER)     /* Visual Studio */
-#  define XXH_swap32 _byteswap_ulong
-#  define XXH_swap64 _byteswap_uint64
-#elif GCC_VERSION >= 403
-#  define XXH_swap32 __builtin_bswap32
-#  define XXH_swap64 __builtin_bswap64
-#else
-static U32 XXH_swap32 (U32 x)
-{
-    return  ((x << 24) & 0xff000000 ) |
-            ((x <<  8) & 0x00ff0000 ) |
-            ((x >>  8) & 0x0000ff00 ) |
-            ((x >> 24) & 0x000000ff );
-}
-static U64 XXH_swap64 (U64 x)
-{
-    return  ((x << 56) & 0xff00000000000000ULL) |
-            ((x << 40) & 0x00ff000000000000ULL) |
-            ((x << 24) & 0x0000ff0000000000ULL) |
-            ((x << 8)  & 0x000000ff00000000ULL) |
-            ((x >> 8)  & 0x00000000ff000000ULL) |
-            ((x >> 24) & 0x0000000000ff0000ULL) |
-            ((x >> 40) & 0x000000000000ff00ULL) |
-            ((x >> 56) & 0x00000000000000ffULL);
-}
-#endif
-
-
-/* *************************************
-*  Architecture Macros
-***************************************/
-typedef enum { XXH_bigEndian=0, XXH_littleEndian=1 } XXH_endianess;
-
-/* XXH_CPU_LITTLE_ENDIAN can be defined externally, for example on the compiler command line */
-#ifndef XXH_CPU_LITTLE_ENDIAN
-    static const int g_one = 1;
-#   define XXH_CPU_LITTLE_ENDIAN   (*(const char*)(&g_one))
-#endif
-
-
-/* ***************************
-*  Memory reads
-*****************************/
-typedef enum { XXH_aligned, XXH_unaligned } XXH_alignment;
-
-FORCE_INLINE_TEMPLATE U32 XXH_readLE32_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
-{
-    if (align==XXH_unaligned)
-        return endian==XXH_littleEndian ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));
-    else
-        return endian==XXH_littleEndian ? *(const U32*)ptr : XXH_swap32(*(const U32*)ptr);
-}
-
-FORCE_INLINE_TEMPLATE U32 XXH_readLE32(const void* ptr, XXH_endianess endian)
-{
-    return XXH_readLE32_align(ptr, endian, XXH_unaligned);
-}
-
-static U32 XXH_readBE32(const void* ptr)
-{
-    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);
-}
-
-FORCE_INLINE_TEMPLATE U64 XXH_readLE64_align(const void* ptr, XXH_endianess endian, XXH_alignment align)
-{
-    if (align==XXH_unaligned)
-        return endian==XXH_littleEndian ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));
-    else
-        return endian==XXH_littleEndian ? *(const U64*)ptr : XXH_swap64(*(const U64*)ptr);
-}
-
-FORCE_INLINE_TEMPLATE U64 XXH_readLE64(const void* ptr, XXH_endianess endian)
-{
-    return XXH_readLE64_align(ptr, endian, XXH_unaligned);
-}
-
-static U64 XXH_readBE64(const void* ptr)
-{
-    return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);
-}
-
-
-/* *************************************
-*  Macros
-***************************************/
-#define XXH_STATIC_ASSERT(c)   { enum { XXH_static_assert = 1/(int)(!!(c)) }; }    /* use only *after* variable declarations */
-
-
-/* *************************************
-*  Constants
-***************************************/
-static const U32 PRIME32_1 = 2654435761U;
-static const U32 PRIME32_2 = 2246822519U;
-static const U32 PRIME32_3 = 3266489917U;
-static const U32 PRIME32_4 =  668265263U;
-static const U32 PRIME32_5 =  374761393U;
-
-static const U64 PRIME64_1 = 11400714785074694791ULL;
-static const U64 PRIME64_2 = 14029467366897019727ULL;
-static const U64 PRIME64_3 =  1609587929392839161ULL;
-static const U64 PRIME64_4 =  9650029242287828579ULL;
-static const U64 PRIME64_5 =  2870177450012600261ULL;
-
-XXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }
-
-
-/* **************************
-*  Utils
-****************************/
-XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dstState, const XXH32_state_t* restrict srcState)
-{
-    memcpy(dstState, srcState, sizeof(*dstState));
-}
-
-XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dstState, const XXH64_state_t* restrict srcState)
-{
-    memcpy(dstState, srcState, sizeof(*dstState));
-}
-
-
-/* ***************************
-*  Simple Hash Functions
-*****************************/
-
-static U32 XXH32_round(U32 seed, U32 input)
-{
-    seed += input * PRIME32_2;
-    seed  = XXH_rotl32(seed, 13);
-    seed *= PRIME32_1;
-    return seed;
-}
-
-FORCE_INLINE_TEMPLATE U32 XXH32_endian_align(const void* input, size_t len, U32 seed, XXH_endianess endian, XXH_alignment align)
-{
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* bEnd = p + len;
-    U32 h32;
-#define XXH_get32bits(p) XXH_readLE32_align(p, endian, align)
-
-#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (p==NULL) {
-        len=0;
-        bEnd=p=(const BYTE*)(size_t)16;
-    }
-#endif
-
-    if (len>=16) {
-        const BYTE* const limit = bEnd - 16;
-        U32 v1 = seed + PRIME32_1 + PRIME32_2;
-        U32 v2 = seed + PRIME32_2;
-        U32 v3 = seed + 0;
-        U32 v4 = seed - PRIME32_1;
-
-        do {
-            v1 = XXH32_round(v1, XXH_get32bits(p)); p+=4;
-            v2 = XXH32_round(v2, XXH_get32bits(p)); p+=4;
-            v3 = XXH32_round(v3, XXH_get32bits(p)); p+=4;
-            v4 = XXH32_round(v4, XXH_get32bits(p)); p+=4;
-        } while (p<=limit);
-
-        h32 = XXH_rotl32(v1, 1) + XXH_rotl32(v2, 7) + XXH_rotl32(v3, 12) + XXH_rotl32(v4, 18);
-    } else {
-        h32  = seed + PRIME32_5;
-    }
-
-    h32 += (U32) len;
-
-    while (p+4<=bEnd) {
-        h32 += XXH_get32bits(p) * PRIME32_3;
-        h32  = XXH_rotl32(h32, 17) * PRIME32_4 ;
-        p+=4;
-    }
-
-    while (p> 15;
-    h32 *= PRIME32_2;
-    h32 ^= h32 >> 13;
-    h32 *= PRIME32_3;
-    h32 ^= h32 >> 16;
-
-    return h32;
-}
-
-
-XXH_PUBLIC_API unsigned int XXH32 (const void* input, size_t len, unsigned int seed)
-{
-#if 0
-    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
-    XXH32_CREATESTATE_STATIC(state);
-    XXH32_reset(state, seed);
-    XXH32_update(state, input, len);
-    return XXH32_digest(state);
-#else
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
-
-    if (XXH_FORCE_ALIGN_CHECK) {
-        if ((((size_t)input) & 3) == 0) {   /* Input is 4-bytes aligned, leverage the speed benefit */
-            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-                return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
-            else
-                return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
-    }   }
-
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH32_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
-    else
-        return XXH32_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
-#endif
-}
-
-
-static U64 XXH64_round(U64 acc, U64 input)
-{
-    acc += input * PRIME64_2;
-    acc  = XXH_rotl64(acc, 31);
-    acc *= PRIME64_1;
-    return acc;
-}
-
-static U64 XXH64_mergeRound(U64 acc, U64 val)
-{
-    val  = XXH64_round(0, val);
-    acc ^= val;
-    acc  = acc * PRIME64_1 + PRIME64_4;
-    return acc;
-}
-
-FORCE_INLINE_TEMPLATE U64 XXH64_endian_align(const void* input, size_t len, U64 seed, XXH_endianess endian, XXH_alignment align)
-{
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* const bEnd = p + len;
-    U64 h64;
-#define XXH_get64bits(p) XXH_readLE64_align(p, endian, align)
-
-#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (p==NULL) {
-        len=0;
-        bEnd=p=(const BYTE*)(size_t)32;
-    }
-#endif
-
-    if (len>=32) {
-        const BYTE* const limit = bEnd - 32;
-        U64 v1 = seed + PRIME64_1 + PRIME64_2;
-        U64 v2 = seed + PRIME64_2;
-        U64 v3 = seed + 0;
-        U64 v4 = seed - PRIME64_1;
-
-        do {
-            v1 = XXH64_round(v1, XXH_get64bits(p)); p+=8;
-            v2 = XXH64_round(v2, XXH_get64bits(p)); p+=8;
-            v3 = XXH64_round(v3, XXH_get64bits(p)); p+=8;
-            v4 = XXH64_round(v4, XXH_get64bits(p)); p+=8;
-        } while (p<=limit);
-
-        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
-        h64 = XXH64_mergeRound(h64, v1);
-        h64 = XXH64_mergeRound(h64, v2);
-        h64 = XXH64_mergeRound(h64, v3);
-        h64 = XXH64_mergeRound(h64, v4);
-
-    } else {
-        h64  = seed + PRIME64_5;
-    }
-
-    h64 += (U64) len;
-
-    while (p+8<=bEnd) {
-        U64 const k1 = XXH64_round(0, XXH_get64bits(p));
-        h64 ^= k1;
-        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
-        p+=8;
-    }
-
-    if (p+4<=bEnd) {
-        h64 ^= (U64)(XXH_get32bits(p)) * PRIME64_1;
-        h64 = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-        p+=4;
-    }
-
-    while (p> 33;
-    h64 *= PRIME64_2;
-    h64 ^= h64 >> 29;
-    h64 *= PRIME64_3;
-    h64 ^= h64 >> 32;
-
-    return h64;
-}
-
-
-XXH_PUBLIC_API unsigned long long XXH64 (const void* input, size_t len, unsigned long long seed)
-{
-#if 0
-    /* Simple version, good for code maintenance, but unfortunately slow for small inputs */
-    XXH64_CREATESTATE_STATIC(state);
-    XXH64_reset(state, seed);
-    XXH64_update(state, input, len);
-    return XXH64_digest(state);
-#else
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
-
-    if (XXH_FORCE_ALIGN_CHECK) {
-        if ((((size_t)input) & 7)==0) {  /* Input is aligned, let's leverage the speed advantage */
-            if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-                return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_aligned);
-            else
-                return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_aligned);
-    }   }
-
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH64_endian_align(input, len, seed, XXH_littleEndian, XXH_unaligned);
-    else
-        return XXH64_endian_align(input, len, seed, XXH_bigEndian, XXH_unaligned);
-#endif
-}
-
-
-/* **************************************************
-*  Advanced Hash Functions
-****************************************************/
-
-XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)
-{
-    return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));
-}
-XXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)
-{
-    XXH_free(statePtr);
-    return XXH_OK;
-}
-
-XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)
-{
-    return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));
-}
-XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)
-{
-    XXH_free(statePtr);
-    return XXH_OK;
-}
-
-
-/*** Hash feed ***/
-
-XXH_PUBLIC_API XXH_errorcode XXH32_reset(XXH32_state_t* statePtr, unsigned int seed)
-{
-    XXH32_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
-    memset(&state, 0, sizeof(state)-4);   /* do not write into reserved, for future removal */
-    state.v1 = seed + PRIME32_1 + PRIME32_2;
-    state.v2 = seed + PRIME32_2;
-    state.v3 = seed + 0;
-    state.v4 = seed - PRIME32_1;
-    memcpy(statePtr, &state, sizeof(state));
-    return XXH_OK;
-}
-
-
-XXH_PUBLIC_API XXH_errorcode XXH64_reset(XXH64_state_t* statePtr, unsigned long long seed)
-{
-    XXH64_state_t state;   /* using a local state to memcpy() in order to avoid strict-aliasing warnings */
-    memset(&state, 0, sizeof(state)-8);   /* do not write into reserved, for future removal */
-    state.v1 = seed + PRIME64_1 + PRIME64_2;
-    state.v2 = seed + PRIME64_2;
-    state.v3 = seed + 0;
-    state.v4 = seed - PRIME64_1;
-    memcpy(statePtr, &state, sizeof(state));
-    return XXH_OK;
-}
-
-
-FORCE_INLINE_TEMPLATE XXH_errorcode XXH32_update_endian (XXH32_state_t* state, const void* input, size_t len, XXH_endianess endian)
-{
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* const bEnd = p + len;
-
-#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (input==NULL) return XXH_ERROR;
-#endif
-
-    state->total_len_32 += (unsigned)len;
-    state->large_len |= (len>=16) | (state->total_len_32>=16);
-
-    if (state->memsize + len < 16)  {   /* fill in tmp buffer */
-        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, len);
-        state->memsize += (unsigned)len;
-        return XXH_OK;
-    }
-
-    if (state->memsize) {   /* some data left from previous update */
-        XXH_memcpy((BYTE*)(state->mem32) + state->memsize, input, 16-state->memsize);
-        {   const U32* p32 = state->mem32;
-            state->v1 = XXH32_round(state->v1, XXH_readLE32(p32, endian)); p32++;
-            state->v2 = XXH32_round(state->v2, XXH_readLE32(p32, endian)); p32++;
-            state->v3 = XXH32_round(state->v3, XXH_readLE32(p32, endian)); p32++;
-            state->v4 = XXH32_round(state->v4, XXH_readLE32(p32, endian)); p32++;
-        }
-        p += 16-state->memsize;
-        state->memsize = 0;
-    }
-
-    if (p <= bEnd-16) {
-        const BYTE* const limit = bEnd - 16;
-        U32 v1 = state->v1;
-        U32 v2 = state->v2;
-        U32 v3 = state->v3;
-        U32 v4 = state->v4;
-
-        do {
-            v1 = XXH32_round(v1, XXH_readLE32(p, endian)); p+=4;
-            v2 = XXH32_round(v2, XXH_readLE32(p, endian)); p+=4;
-            v3 = XXH32_round(v3, XXH_readLE32(p, endian)); p+=4;
-            v4 = XXH32_round(v4, XXH_readLE32(p, endian)); p+=4;
-        } while (p<=limit);
-
-        state->v1 = v1;
-        state->v2 = v2;
-        state->v3 = v3;
-        state->v4 = v4;
-    }
-
-    if (p < bEnd) {
-        XXH_memcpy(state->mem32, p, (size_t)(bEnd-p));
-        state->memsize = (unsigned)(bEnd-p);
-    }
-
-    return XXH_OK;
-}
-
-XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* state_in, const void* input, size_t len)
-{
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
-
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH32_update_endian(state_in, input, len, XXH_littleEndian);
-    else
-        return XXH32_update_endian(state_in, input, len, XXH_bigEndian);
-}
-
-
-
-FORCE_INLINE_TEMPLATE U32 XXH32_digest_endian (const XXH32_state_t* state, XXH_endianess endian)
-{
-    const BYTE * p = (const BYTE*)state->mem32;
-    const BYTE* const bEnd = (const BYTE*)(state->mem32) + state->memsize;
-    U32 h32;
-
-    if (state->large_len) {
-        h32 = XXH_rotl32(state->v1, 1) + XXH_rotl32(state->v2, 7) + XXH_rotl32(state->v3, 12) + XXH_rotl32(state->v4, 18);
-    } else {
-        h32 = state->v3 /* == seed */ + PRIME32_5;
-    }
-
-    h32 += state->total_len_32;
-
-    while (p+4<=bEnd) {
-        h32 += XXH_readLE32(p, endian) * PRIME32_3;
-        h32  = XXH_rotl32(h32, 17) * PRIME32_4;
-        p+=4;
-    }
-
-    while (p> 15;
-    h32 *= PRIME32_2;
-    h32 ^= h32 >> 13;
-    h32 *= PRIME32_3;
-    h32 ^= h32 >> 16;
-
-    return h32;
-}
-
-
-XXH_PUBLIC_API unsigned int XXH32_digest (const XXH32_state_t* state_in)
-{
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
-
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH32_digest_endian(state_in, XXH_littleEndian);
-    else
-        return XXH32_digest_endian(state_in, XXH_bigEndian);
-}
-
-
-
-/* **** XXH64 **** */
-
-FORCE_INLINE_TEMPLATE XXH_errorcode XXH64_update_endian (XXH64_state_t* state, const void* input, size_t len, XXH_endianess endian)
-{
-    const BYTE* p = (const BYTE*)input;
-    const BYTE* const bEnd = p + len;
-
-#ifdef XXH_ACCEPT_NULL_INPUT_POINTER
-    if (input==NULL) return XXH_ERROR;
-#endif
-
-    state->total_len += len;
-
-    if (state->memsize + len < 32) {  /* fill in tmp buffer */
-        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, len);
-        state->memsize += (U32)len;
-        return XXH_OK;
-    }
-
-    if (state->memsize) {   /* tmp buffer is full */
-        XXH_memcpy(((BYTE*)state->mem64) + state->memsize, input, 32-state->memsize);
-        state->v1 = XXH64_round(state->v1, XXH_readLE64(state->mem64+0, endian));
-        state->v2 = XXH64_round(state->v2, XXH_readLE64(state->mem64+1, endian));
-        state->v3 = XXH64_round(state->v3, XXH_readLE64(state->mem64+2, endian));
-        state->v4 = XXH64_round(state->v4, XXH_readLE64(state->mem64+3, endian));
-        p += 32-state->memsize;
-        state->memsize = 0;
-    }
-
-    if (p+32 <= bEnd) {
-        const BYTE* const limit = bEnd - 32;
-        U64 v1 = state->v1;
-        U64 v2 = state->v2;
-        U64 v3 = state->v3;
-        U64 v4 = state->v4;
-
-        do {
-            v1 = XXH64_round(v1, XXH_readLE64(p, endian)); p+=8;
-            v2 = XXH64_round(v2, XXH_readLE64(p, endian)); p+=8;
-            v3 = XXH64_round(v3, XXH_readLE64(p, endian)); p+=8;
-            v4 = XXH64_round(v4, XXH_readLE64(p, endian)); p+=8;
-        } while (p<=limit);
-
-        state->v1 = v1;
-        state->v2 = v2;
-        state->v3 = v3;
-        state->v4 = v4;
-    }
-
-    if (p < bEnd) {
-        XXH_memcpy(state->mem64, p, (size_t)(bEnd-p));
-        state->memsize = (unsigned)(bEnd-p);
-    }
-
-    return XXH_OK;
-}
-
-XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* state_in, const void* input, size_t len)
-{
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
-
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH64_update_endian(state_in, input, len, XXH_littleEndian);
-    else
-        return XXH64_update_endian(state_in, input, len, XXH_bigEndian);
-}
-
-
-
-FORCE_INLINE_TEMPLATE U64 XXH64_digest_endian (const XXH64_state_t* state, XXH_endianess endian)
-{
-    const BYTE * p = (const BYTE*)state->mem64;
-    const BYTE* const bEnd = (const BYTE*)state->mem64 + state->memsize;
-    U64 h64;
-
-    if (state->total_len >= 32) {
-        U64 const v1 = state->v1;
-        U64 const v2 = state->v2;
-        U64 const v3 = state->v3;
-        U64 const v4 = state->v4;
-
-        h64 = XXH_rotl64(v1, 1) + XXH_rotl64(v2, 7) + XXH_rotl64(v3, 12) + XXH_rotl64(v4, 18);
-        h64 = XXH64_mergeRound(h64, v1);
-        h64 = XXH64_mergeRound(h64, v2);
-        h64 = XXH64_mergeRound(h64, v3);
-        h64 = XXH64_mergeRound(h64, v4);
-    } else {
-        h64  = state->v3 + PRIME64_5;
-    }
-
-    h64 += (U64) state->total_len;
-
-    while (p+8<=bEnd) {
-        U64 const k1 = XXH64_round(0, XXH_readLE64(p, endian));
-        h64 ^= k1;
-        h64  = XXH_rotl64(h64,27) * PRIME64_1 + PRIME64_4;
-        p+=8;
-    }
-
-    if (p+4<=bEnd) {
-        h64 ^= (U64)(XXH_readLE32(p, endian)) * PRIME64_1;
-        h64  = XXH_rotl64(h64, 23) * PRIME64_2 + PRIME64_3;
-        p+=4;
-    }
-
-    while (p> 33;
-    h64 *= PRIME64_2;
-    h64 ^= h64 >> 29;
-    h64 *= PRIME64_3;
-    h64 ^= h64 >> 32;
-
-    return h64;
-}
-
-
-XXH_PUBLIC_API unsigned long long XXH64_digest (const XXH64_state_t* state_in)
-{
-    XXH_endianess endian_detected = (XXH_endianess)XXH_CPU_LITTLE_ENDIAN;
-
-    if ((endian_detected==XXH_littleEndian) || XXH_FORCE_NATIVE_FORMAT)
-        return XXH64_digest_endian(state_in, XXH_littleEndian);
-    else
-        return XXH64_digest_endian(state_in, XXH_bigEndian);
-}
-
-
-/* **************************
-*  Canonical representation
-****************************/
-
-/*! Default XXH result types are basic unsigned 32 and 64 bits.
-*   The canonical representation follows human-readable write convention, aka big-endian (large digits first).
-*   These functions allow transformation of hash result into and from its canonical format.
-*   This way, hash values can be written into a file or buffer, and remain comparable across different systems and programs.
-*/
-
-XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)
-{
-    XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));
-    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);
-    memcpy(dst, &hash, sizeof(*dst));
-}
-
-XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash)
-{
-    XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));
-    if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);
-    memcpy(dst, &hash, sizeof(*dst));
-}
-
-XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)
-{
-    return XXH_readBE32(src);
-}
-
-XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src)
-{
-    return XXH_readBE64(src);
-}
diff --git a/priv/zstd/lib/common/xxhash.h b/priv/zstd/lib/common/xxhash.h
deleted file mode 100644
index 9bad1f5..0000000
--- a/priv/zstd/lib/common/xxhash.h
+++ /dev/null
@@ -1,305 +0,0 @@
-/*
-   xxHash - Extremely Fast Hash algorithm
-   Header File
-   Copyright (C) 2012-2016, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - xxHash source repository : https://github.com/Cyan4973/xxHash
-*/
-
-/* Notice extracted from xxHash homepage :
-
-xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
-It also successfully passes all tests from the SMHasher suite.
-
-Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz)
-
-Name            Speed       Q.Score   Author
-xxHash          5.4 GB/s     10
-CrapWow         3.2 GB/s      2       Andrew
-MumurHash 3a    2.7 GB/s     10       Austin Appleby
-SpookyHash      2.0 GB/s     10       Bob Jenkins
-SBox            1.4 GB/s      9       Bret Mulvey
-Lookup3         1.2 GB/s      9       Bob Jenkins
-SuperFastHash   1.2 GB/s      1       Paul Hsieh
-CityHash64      1.05 GB/s    10       Pike & Alakuijala
-FNV             0.55 GB/s     5       Fowler, Noll, Vo
-CRC32           0.43 GB/s     9
-MD5-32          0.33 GB/s    10       Ronald L. Rivest
-SHA1-32         0.28 GB/s    10
-
-Q.Score is a measure of quality of the hash function.
-It depends on successfully passing SMHasher test set.
-10 is a perfect score.
-
-A 64-bits version, named XXH64, is available since r35.
-It offers much better speed, but for 64-bits applications only.
-Name     Speed on 64 bits    Speed on 32 bits
-XXH64       13.8 GB/s            1.9 GB/s
-XXH32        6.8 GB/s            6.0 GB/s
-*/
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#ifndef XXHASH_H_5627135585666179
-#define XXHASH_H_5627135585666179 1
-
-
-/* ****************************
-*  Definitions
-******************************/
-#include    /* size_t */
-typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
-
-
-/* ****************************
-*  API modifier
-******************************/
-/** XXH_PRIVATE_API
-*   This is useful if you want to include xxhash functions in `static` mode
-*   in order to inline them, and remove their symbol from the public list.
-*   Methodology :
-*     #define XXH_PRIVATE_API
-*     #include "xxhash.h"
-*   `xxhash.c` is automatically included.
-*   It's not useful to compile and link it as a separate module anymore.
-*/
-#ifdef XXH_PRIVATE_API
-#  ifndef XXH_STATIC_LINKING_ONLY
-#    define XXH_STATIC_LINKING_ONLY
-#  endif
-#  if defined(__GNUC__)
-#    define XXH_PUBLIC_API static __inline __attribute__((unused))
-#  elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#    define XXH_PUBLIC_API static inline
-#  elif defined(_MSC_VER)
-#    define XXH_PUBLIC_API static __inline
-#  else
-#    define XXH_PUBLIC_API static   /* this version may generate warnings for unused static functions; disable the relevant warning */
-#  endif
-#else
-#  define XXH_PUBLIC_API   /* do nothing */
-#endif /* XXH_PRIVATE_API */
-
-/*!XXH_NAMESPACE, aka Namespace Emulation :
-
-If you want to include _and expose_ xxHash functions from within your own library,
-but also want to avoid symbol collisions with another library which also includes xxHash,
-
-you can use XXH_NAMESPACE, to automatically prefix any public symbol from xxhash library
-with the value of XXH_NAMESPACE (so avoid to keep it NULL and avoid numeric values).
-
-Note that no change is required within the calling program as long as it includes `xxhash.h` :
-regular symbol name will be automatically translated by this header.
-*/
-#ifdef XXH_NAMESPACE
-#  define XXH_CAT(A,B) A##B
-#  define XXH_NAME2(A,B) XXH_CAT(A,B)
-#  define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)
-#  define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)
-#  define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)
-#  define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)
-#  define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)
-#  define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)
-#  define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)
-#  define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)
-#  define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)
-#  define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)
-#  define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)
-#  define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)
-#  define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)
-#  define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)
-#  define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)
-#  define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)
-#  define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)
-#  define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)
-#  define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)
-#endif
-
-
-/* *************************************
-*  Version
-***************************************/
-#define XXH_VERSION_MAJOR    0
-#define XXH_VERSION_MINOR    6
-#define XXH_VERSION_RELEASE  2
-#define XXH_VERSION_NUMBER  (XXH_VERSION_MAJOR *100*100 + XXH_VERSION_MINOR *100 + XXH_VERSION_RELEASE)
-XXH_PUBLIC_API unsigned XXH_versionNumber (void);
-
-
-/* ****************************
-*  Simple Hash Functions
-******************************/
-typedef unsigned int       XXH32_hash_t;
-typedef unsigned long long XXH64_hash_t;
-
-XXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t length, unsigned int seed);
-XXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t length, unsigned long long seed);
-
-/*!
-XXH32() :
-    Calculate the 32-bits hash of sequence "length" bytes stored at memory address "input".
-    The memory between input & input+length must be valid (allocated and read-accessible).
-    "seed" can be used to alter the result predictably.
-    Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s
-XXH64() :
-    Calculate the 64-bits hash of sequence of length "len" stored at memory address "input".
-    "seed" can be used to alter the result predictably.
-    This function runs 2x faster on 64-bits systems, but slower on 32-bits systems (see benchmark).
-*/
-
-
-/* ****************************
-*  Streaming Hash Functions
-******************************/
-typedef struct XXH32_state_s XXH32_state_t;   /* incomplete type */
-typedef struct XXH64_state_s XXH64_state_t;   /* incomplete type */
-
-/*! State allocation, compatible with dynamic libraries */
-
-XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void);
-XXH_PUBLIC_API XXH_errorcode  XXH32_freeState(XXH32_state_t* statePtr);
-
-XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void);
-XXH_PUBLIC_API XXH_errorcode  XXH64_freeState(XXH64_state_t* statePtr);
-
-
-/* hash streaming */
-
-XXH_PUBLIC_API XXH_errorcode XXH32_reset  (XXH32_state_t* statePtr, unsigned int seed);
-XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);
-XXH_PUBLIC_API XXH32_hash_t  XXH32_digest (const XXH32_state_t* statePtr);
-
-XXH_PUBLIC_API XXH_errorcode XXH64_reset  (XXH64_state_t* statePtr, unsigned long long seed);
-XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length);
-XXH_PUBLIC_API XXH64_hash_t  XXH64_digest (const XXH64_state_t* statePtr);
-
-/*
-These functions generate the xxHash of an input provided in multiple segments.
-Note that, for small input, they are slower than single-call functions, due to state management.
-For small input, prefer `XXH32()` and `XXH64()` .
-
-XXH state must first be allocated, using XXH*_createState() .
-
-Start a new hash by initializing state with a seed, using XXH*_reset().
-
-Then, feed the hash state by calling XXH*_update() as many times as necessary.
-Obviously, input must be allocated and read accessible.
-The function returns an error code, with 0 meaning OK, and any other value meaning there is an error.
-
-Finally, a hash value can be produced anytime, by using XXH*_digest().
-This function returns the nn-bits hash as an int or long long.
-
-It's still possible to continue inserting input into the hash state after a digest,
-and generate some new hashes later on, by calling again XXH*_digest().
-
-When done, free XXH state space if it was allocated dynamically.
-*/
-
-
-/* **************************
-*  Utils
-****************************/
-#if !(defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L))   /* ! C99 */
-#  define restrict   /* disable restrict */
-#endif
-
-XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* restrict dst_state, const XXH32_state_t* restrict src_state);
-XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* restrict dst_state, const XXH64_state_t* restrict src_state);
-
-
-/* **************************
-*  Canonical representation
-****************************/
-/* Default result type for XXH functions are primitive unsigned 32 and 64 bits.
-*  The canonical representation uses human-readable write convention, aka big-endian (large digits first).
-*  These functions allow transformation of hash result into and from its canonical format.
-*  This way, hash values can be written into a file / memory, and remain comparable on different systems and programs.
-*/
-typedef struct { unsigned char digest[4]; } XXH32_canonical_t;
-typedef struct { unsigned char digest[8]; } XXH64_canonical_t;
-
-XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);
-XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);
-
-XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);
-XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src);
-
-#endif /* XXHASH_H_5627135585666179 */
-
-
-
-/* ================================================================================================
-   This section contains definitions which are not guaranteed to remain stable.
-   They may change in future versions, becoming incompatible with a different version of the library.
-   They shall only be used with static linking.
-   Never use these definitions in association with dynamic linking !
-=================================================================================================== */
-#if defined(XXH_STATIC_LINKING_ONLY) && !defined(XXH_STATIC_H_3543687687345)
-#define XXH_STATIC_H_3543687687345
-
-/* These definitions are only meant to allow allocation of XXH state
-   statically, on stack, or in a struct for example.
-   Do not use members directly. */
-
-   struct XXH32_state_s {
-       unsigned total_len_32;
-       unsigned large_len;
-       unsigned v1;
-       unsigned v2;
-       unsigned v3;
-       unsigned v4;
-       unsigned mem32[4];   /* buffer defined as U32 for alignment */
-       unsigned memsize;
-       unsigned reserved;   /* never read nor write, will be removed in a future version */
-   };   /* typedef'd to XXH32_state_t */
-
-   struct XXH64_state_s {
-       unsigned long long total_len;
-       unsigned long long v1;
-       unsigned long long v2;
-       unsigned long long v3;
-       unsigned long long v4;
-       unsigned long long mem64[4];   /* buffer defined as U64 for alignment */
-       unsigned memsize;
-       unsigned reserved[2];          /* never read nor write, will be removed in a future version */
-   };   /* typedef'd to XXH64_state_t */
-
-
-#  ifdef XXH_PRIVATE_API
-#    include "xxhash.c"   /* include xxhash functions as `static`, for inlining */
-#  endif
-
-#endif /* XXH_STATIC_LINKING_ONLY && XXH_STATIC_H_3543687687345 */
-
-
-#if defined (__cplusplus)
-}
-#endif
diff --git a/priv/zstd/lib/common/zstd_common.c b/priv/zstd/lib/common/zstd_common.c
deleted file mode 100644
index bccc948..0000000
--- a/priv/zstd/lib/common/zstd_common.c
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include       /* malloc, calloc, free */
-#include       /* memset */
-#include "error_private.h"
-#include "zstd_internal.h"
-
-
-/*-****************************************
-*  Version
-******************************************/
-unsigned ZSTD_versionNumber(void) { return ZSTD_VERSION_NUMBER; }
-
-const char* ZSTD_versionString(void) { return ZSTD_VERSION_STRING; }
-
-
-/*-****************************************
-*  ZSTD Error Management
-******************************************/
-/*! ZSTD_isError() :
- *  tells if a return value is an error code */
-unsigned ZSTD_isError(size_t code) { return ERR_isError(code); }
-
-/*! ZSTD_getErrorName() :
- *  provides error code string from function result (useful for debugging) */
-const char* ZSTD_getErrorName(size_t code) { return ERR_getErrorName(code); }
-
-/*! ZSTD_getError() :
- *  convert a `size_t` function result into a proper ZSTD_errorCode enum */
-ZSTD_ErrorCode ZSTD_getErrorCode(size_t code) { return ERR_getErrorCode(code); }
-
-/*! ZSTD_getErrorString() :
- *  provides error code string from enum */
-const char* ZSTD_getErrorString(ZSTD_ErrorCode code) { return ERR_getErrorString(code); }
-
-/*! g_debuglog_enable :
- *  turn on/off debug traces (global switch) */
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG >= 2)
-int g_debuglog_enable = 1;
-#endif
-
-
-/*=**************************************************************
-*  Custom allocator
-****************************************************************/
-void* ZSTD_malloc(size_t size, ZSTD_customMem customMem)
-{
-    if (customMem.customAlloc)
-        return customMem.customAlloc(customMem.opaque, size);
-    return malloc(size);
-}
-
-void* ZSTD_calloc(size_t size, ZSTD_customMem customMem)
-{
-    if (customMem.customAlloc) {
-        /* calloc implemented as malloc+memset;
-         * not as efficient as calloc, but next best guess for custom malloc */
-        void* const ptr = customMem.customAlloc(customMem.opaque, size);
-        memset(ptr, 0, size);
-        return ptr;
-    }
-    return calloc(1, size);
-}
-
-void ZSTD_free(void* ptr, ZSTD_customMem customMem)
-{
-    if (ptr!=NULL) {
-        if (customMem.customFree)
-            customMem.customFree(customMem.opaque, ptr);
-        else
-            free(ptr);
-    }
-}
diff --git a/priv/zstd/lib/common/zstd_errors.h b/priv/zstd/lib/common/zstd_errors.h
deleted file mode 100644
index 4bcb776..0000000
--- a/priv/zstd/lib/common/zstd_errors.h
+++ /dev/null
@@ -1,83 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_ERRORS_H_398273423
-#define ZSTD_ERRORS_H_398273423
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/*===== dependency =====*/
-#include    /* size_t */
-
-
-/* =====   ZSTDERRORLIB_API : control library symbols visibility   ===== */
-#ifndef ZSTDERRORLIB_VISIBILITY
-#  if defined(__GNUC__) && (__GNUC__ >= 4)
-#    define ZSTDERRORLIB_VISIBILITY __attribute__ ((visibility ("default")))
-#  else
-#    define ZSTDERRORLIB_VISIBILITY
-#  endif
-#endif
-#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
-#  define ZSTDERRORLIB_API __declspec(dllexport) ZSTDERRORLIB_VISIBILITY
-#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
-#  define ZSTDERRORLIB_API __declspec(dllimport) ZSTDERRORLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
-#else
-#  define ZSTDERRORLIB_API ZSTDERRORLIB_VISIBILITY
-#endif
-
-/*-****************************************
- *  error codes list
- *  note : this API is still considered unstable
- *         and shall not be used with a dynamic library.
- *         only static linking is allowed
- ******************************************/
-typedef enum {
-  ZSTD_error_no_error = 0,
-  ZSTD_error_GENERIC  = 1,
-  ZSTD_error_prefix_unknown                = 10,
-  ZSTD_error_version_unsupported           = 12,
-  ZSTD_error_frameParameter_unsupported    = 14,
-  ZSTD_error_frameParameter_windowTooLarge = 16,
-  ZSTD_error_corruption_detected = 20,
-  ZSTD_error_checksum_wrong      = 22,
-  ZSTD_error_dictionary_corrupted      = 30,
-  ZSTD_error_dictionary_wrong          = 32,
-  ZSTD_error_dictionaryCreation_failed = 34,
-  ZSTD_error_parameter_unsupported   = 40,
-  ZSTD_error_parameter_outOfBound    = 42,
-  ZSTD_error_tableLog_tooLarge       = 44,
-  ZSTD_error_maxSymbolValue_tooLarge = 46,
-  ZSTD_error_maxSymbolValue_tooSmall = 48,
-  ZSTD_error_stage_wrong       = 60,
-  ZSTD_error_init_missing      = 62,
-  ZSTD_error_memory_allocation = 64,
-  ZSTD_error_dstSize_tooSmall = 70,
-  ZSTD_error_srcSize_wrong    = 72,
-  /* following error codes are not stable and may be removed or changed in a future version */
-  ZSTD_error_frameIndex_tooLarge = 100,
-  ZSTD_error_seekableIO          = 102,
-  ZSTD_error_maxCode = 120  /* never EVER use this value directly, it can change in future versions! Use ZSTD_isError() instead */
-} ZSTD_ErrorCode;
-
-/*! ZSTD_getErrorCode() :
-    convert a `size_t` function result into a `ZSTD_ErrorCode` enum type,
-    which can be used to compare with enum list published above */
-ZSTDERRORLIB_API ZSTD_ErrorCode ZSTD_getErrorCode(size_t functionResult);
-ZSTDERRORLIB_API const char* ZSTD_getErrorString(ZSTD_ErrorCode code);   /**< Same as ZSTD_getErrorName, but using a `ZSTD_ErrorCode` enum argument */
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_ERRORS_H_398273423 */
diff --git a/priv/zstd/lib/common/zstd_internal.h b/priv/zstd/lib/common/zstd_internal.h
deleted file mode 100644
index 5d2900e..0000000
--- a/priv/zstd/lib/common/zstd_internal.h
+++ /dev/null
@@ -1,291 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_CCOMMON_H_MODULE
-#define ZSTD_CCOMMON_H_MODULE
-
-/* this module contains definitions which must be identical
- * across compression, decompression and dictBuilder.
- * It also contains a few functions useful to at least 2 of them
- * and which benefit from being inlined */
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include "compiler.h"
-#include "mem.h"
-#include "error_private.h"
-#define ZSTD_STATIC_LINKING_ONLY
-#include "zstd.h"
-#define FSE_STATIC_LINKING_ONLY
-#include "fse.h"
-#define HUF_STATIC_LINKING_ONLY
-#include "huf.h"
-#ifndef XXH_STATIC_LINKING_ONLY
-#  define XXH_STATIC_LINKING_ONLY  /* XXH64_state_t */
-#endif
-#include "xxhash.h"                /* XXH_reset, update, digest */
-
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-/*-*************************************
-*  Debug
-***************************************/
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG>=1)
-#  include 
-#else
-#  ifndef assert
-#    define assert(condition) ((void)0)
-#  endif
-#endif
-
-#define ZSTD_STATIC_ASSERT(c) { enum { ZSTD_static_assert = 1/(int)(!!(c)) }; }
-
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG>=2)
-#  include 
-extern int g_debuglog_enable;
-/* recommended values for ZSTD_DEBUG display levels :
- * 1 : no display, enables assert() only
- * 2 : reserved for currently active debug path
- * 3 : events once per object lifetime (CCtx, CDict, etc.)
- * 4 : events once per frame
- * 5 : events once per block
- * 6 : events once per sequence (*very* verbose) */
-#  define RAWLOG(l, ...) {                                      \
-                if ((g_debuglog_enable) & (l<=ZSTD_DEBUG)) {    \
-                    fprintf(stderr, __VA_ARGS__);               \
-            }   }
-#  define DEBUGLOG(l, ...) {                                    \
-                if ((g_debuglog_enable) & (l<=ZSTD_DEBUG)) {    \
-                    fprintf(stderr, __FILE__ ": " __VA_ARGS__); \
-                    fprintf(stderr, " \n");                     \
-            }   }
-#else
-#  define RAWLOG(l, ...)      {}    /* disabled */
-#  define DEBUGLOG(l, ...)    {}    /* disabled */
-#endif
-
-
-/*-*************************************
-*  shared macros
-***************************************/
-#undef MIN
-#undef MAX
-#define MIN(a,b) ((a)<(b) ? (a) : (b))
-#define MAX(a,b) ((a)>(b) ? (a) : (b))
-#define CHECK_F(f) { size_t const errcod = f; if (ERR_isError(errcod)) return errcod; }  /* check and Forward error code */
-#define CHECK_E(f, e) { size_t const errcod = f; if (ERR_isError(errcod)) return ERROR(e); }  /* check and send Error code */
-
-
-/*-*************************************
-*  Common constants
-***************************************/
-#define ZSTD_OPT_NUM    (1<<12)
-
-#define ZSTD_REP_NUM      3                 /* number of repcodes */
-#define ZSTD_REP_MOVE     (ZSTD_REP_NUM-1)
-static const U32 repStartValue[ZSTD_REP_NUM] = { 1, 4, 8 };
-
-#define KB *(1 <<10)
-#define MB *(1 <<20)
-#define GB *(1U<<30)
-
-#define BIT7 128
-#define BIT6  64
-#define BIT5  32
-#define BIT4  16
-#define BIT1   2
-#define BIT0   1
-
-#define ZSTD_WINDOWLOG_ABSOLUTEMIN 10
-#define ZSTD_WINDOWLOG_DEFAULTMAX 27 /* Default maximum allowed window log */
-static const size_t ZSTD_fcs_fieldSize[4] = { 0, 2, 4, 8 };
-static const size_t ZSTD_did_fieldSize[4] = { 0, 1, 2, 4 };
-
-#define ZSTD_FRAMEIDSIZE 4
-static const size_t ZSTD_frameIdSize = ZSTD_FRAMEIDSIZE;  /* magic number size */
-
-#define ZSTD_BLOCKHEADERSIZE 3   /* C standard doesn't allow `static const` variable to be init using another `static const` variable */
-static const size_t ZSTD_blockHeaderSize = ZSTD_BLOCKHEADERSIZE;
-typedef enum { bt_raw, bt_rle, bt_compressed, bt_reserved } blockType_e;
-
-#define MIN_SEQUENCES_SIZE 1 /* nbSeq==0 */
-#define MIN_CBLOCK_SIZE (1 /*litCSize*/ + 1 /* RLE or RAW */ + MIN_SEQUENCES_SIZE /* nbSeq==0 */)   /* for a non-null block */
-
-#define HufLog 12
-typedef enum { set_basic, set_rle, set_compressed, set_repeat } symbolEncodingType_e;
-
-#define LONGNBSEQ 0x7F00
-
-#define MINMATCH 3
-
-#define Litbits  8
-#define MaxLit ((1<= 3)   /* GCC Intrinsic */
-        return 31 - __builtin_clz(val);
-#   else   /* Software version */
-        static const U32 DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
-        U32 v = val;
-        v |= v >> 1;
-        v |= v >> 2;
-        v |= v >> 4;
-        v |= v >> 8;
-        v |= v >> 16;
-        return DeBruijnClz[(v * 0x07C4ACDDU) >> 27];
-#   endif
-    }
-}
-
-
-/* ZSTD_invalidateRepCodes() :
- * ensures next compression will not use repcodes from previous block.
- * Note : only works with regular variant;
- *        do not use with extDict variant ! */
-void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx);   /* zstdmt, adaptive_compression (shouldn't get this definition from here) */
-
-
-typedef struct {
-    blockType_e blockType;
-    U32 lastBlock;
-    U32 origSize;
-} blockProperties_t;
-
-/*! ZSTD_getcBlockSize() :
- *  Provides the size of compressed block from block header `src` */
-/* Used by: decompress, fullbench (does not get its definition from here) */
-size_t ZSTD_getcBlockSize(const void* src, size_t srcSize,
-                          blockProperties_t* bpPtr);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif   /* ZSTD_CCOMMON_H_MODULE */
diff --git a/priv/zstd/lib/compress/fse_compress.c b/priv/zstd/lib/compress/fse_compress.c
deleted file mode 100644
index 549c115..0000000
--- a/priv/zstd/lib/compress/fse_compress.c
+++ /dev/null
@@ -1,841 +0,0 @@
-/* ******************************************************************
-   FSE : Finite State Entropy encoder
-   Copyright (C) 2013-2015, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-/* **************************************************************
-*  Includes
-****************************************************************/
-#include      /* malloc, free, qsort */
-#include      /* memcpy, memset */
-#include       /* printf (debug) */
-#include "bitstream.h"
-#include "compiler.h"
-#define FSE_STATIC_LINKING_ONLY
-#include "fse.h"
-#include "error_private.h"
-
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define FSE_isError ERR_isError
-#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-
-
-/* **************************************************************
-*  Templates
-****************************************************************/
-/*
-  designed to be included
-  for type-specific functions (template emulation in C)
-  Objective is to write these functions only once, for improved maintenance
-*/
-
-/* safety checks */
-#ifndef FSE_FUNCTION_EXTENSION
-#  error "FSE_FUNCTION_EXTENSION must be defined"
-#endif
-#ifndef FSE_FUNCTION_TYPE
-#  error "FSE_FUNCTION_TYPE must be defined"
-#endif
-
-/* Function names */
-#define FSE_CAT(X,Y) X##Y
-#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
-#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
-
-
-/* Function templates */
-
-/* FSE_buildCTable_wksp() :
- * Same as FSE_buildCTable(), but using an externally allocated scratch buffer (`workSpace`).
- * wkspSize should be sized to handle worst case situation, which is `1<>1 : 1) ;
-    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
-    U32 const step = FSE_TABLESTEP(tableSize);
-    U32 cumul[FSE_MAX_SYMBOL_VALUE+2];
-
-    FSE_FUNCTION_TYPE* const tableSymbol = (FSE_FUNCTION_TYPE*)workSpace;
-    U32 highThreshold = tableSize-1;
-
-    /* CTable header */
-    if (((size_t)1 << tableLog) * sizeof(FSE_FUNCTION_TYPE) > wkspSize) return ERROR(tableLog_tooLarge);
-    tableU16[-2] = (U16) tableLog;
-    tableU16[-1] = (U16) maxSymbolValue;
-
-    /* For explanations on how to distribute symbol values over the table :
-    *  http://fastcompression.blogspot.fr/2014/02/fse-distributing-symbol-values.html */
-
-    /* symbol start positions */
-    {   U32 u;
-        cumul[0] = 0;
-        for (u=1; u<=maxSymbolValue+1; u++) {
-            if (normalizedCounter[u-1]==-1) {  /* Low proba symbol */
-                cumul[u] = cumul[u-1] + 1;
-                tableSymbol[highThreshold--] = (FSE_FUNCTION_TYPE)(u-1);
-            } else {
-                cumul[u] = cumul[u-1] + normalizedCounter[u-1];
-        }   }
-        cumul[maxSymbolValue+1] = tableSize+1;
-    }
-
-    /* Spread symbols */
-    {   U32 position = 0;
-        U32 symbol;
-        for (symbol=0; symbol<=maxSymbolValue; symbol++) {
-            int nbOccurences;
-            for (nbOccurences=0; nbOccurences highThreshold) position = (position + step) & tableMask;   /* Low proba area */
-        }   }
-
-        if (position!=0) return ERROR(GENERIC);   /* Must have gone through all positions */
-    }
-
-    /* Build table */
-    {   U32 u; for (u=0; u> 3) + 3;
-    return maxSymbolValue ? maxHeaderSize : FSE_NCOUNTBOUND;  /* maxSymbolValue==0 ? use default */
-}
-
-static size_t FSE_writeNCount_generic (void* header, size_t headerBufferSize,
-                                       const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog,
-                                       unsigned writeIsSafe)
-{
-    BYTE* const ostart = (BYTE*) header;
-    BYTE* out = ostart;
-    BYTE* const oend = ostart + headerBufferSize;
-    int nbBits;
-    const int tableSize = 1 << tableLog;
-    int remaining;
-    int threshold;
-    U32 bitStream;
-    int bitCount;
-    unsigned charnum = 0;
-    int previous0 = 0;
-
-    bitStream = 0;
-    bitCount  = 0;
-    /* Table Size */
-    bitStream += (tableLog-FSE_MIN_TABLELOG) << bitCount;
-    bitCount  += 4;
-
-    /* Init */
-    remaining = tableSize+1;   /* +1 for extra accuracy */
-    threshold = tableSize;
-    nbBits = tableLog+1;
-
-    while (remaining>1) {  /* stops at 1 */
-        if (previous0) {
-            unsigned start = charnum;
-            while (!normalizedCounter[charnum]) charnum++;
-            while (charnum >= start+24) {
-                start+=24;
-                bitStream += 0xFFFFU << bitCount;
-                if ((!writeIsSafe) && (out > oend-2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-                out[0] = (BYTE) bitStream;
-                out[1] = (BYTE)(bitStream>>8);
-                out+=2;
-                bitStream>>=16;
-            }
-            while (charnum >= start+3) {
-                start+=3;
-                bitStream += 3 << bitCount;
-                bitCount += 2;
-            }
-            bitStream += (charnum-start) << bitCount;
-            bitCount += 2;
-            if (bitCount>16) {
-                if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-                out[0] = (BYTE)bitStream;
-                out[1] = (BYTE)(bitStream>>8);
-                out += 2;
-                bitStream >>= 16;
-                bitCount -= 16;
-        }   }
-        {   int count = normalizedCounter[charnum++];
-            int const max = (2*threshold-1)-remaining;
-            remaining -= count < 0 ? -count : count;
-            count++;   /* +1 for extra accuracy */
-            if (count>=threshold) count += max;   /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */
-            bitStream += count << bitCount;
-            bitCount  += nbBits;
-            bitCount  -= (count>=1;
-        }
-        if (bitCount>16) {
-            if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-            out[0] = (BYTE)bitStream;
-            out[1] = (BYTE)(bitStream>>8);
-            out += 2;
-            bitStream >>= 16;
-            bitCount -= 16;
-    }   }
-
-    /* flush remaining bitStream */
-    if ((!writeIsSafe) && (out > oend - 2)) return ERROR(dstSize_tooSmall);   /* Buffer overflow */
-    out[0] = (BYTE)bitStream;
-    out[1] = (BYTE)(bitStream>>8);
-    out+= (bitCount+7) /8;
-
-    if (charnum > maxSymbolValue + 1) return ERROR(GENERIC);
-
-    return (out-ostart);
-}
-
-
-size_t FSE_writeNCount (void* buffer, size_t bufferSize, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-{
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported */
-    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported */
-
-    if (bufferSize < FSE_NCountWriteBound(maxSymbolValue, tableLog))
-        return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 0);
-
-    return FSE_writeNCount_generic(buffer, bufferSize, normalizedCounter, maxSymbolValue, tableLog, 1);
-}
-
-
-
-/*-**************************************************************
-*  Counting histogram
-****************************************************************/
-/*! FSE_count_simple
-    This function counts byte values within `src`, and store the histogram into table `count`.
-    It doesn't use any additional memory.
-    But this function is unsafe : it doesn't check that all values within `src` can fit into `count`.
-    For this reason, prefer using a table `count` with 256 elements.
-    @return : count of most numerous element
-*/
-size_t FSE_count_simple(unsigned* count, unsigned* maxSymbolValuePtr,
-                        const void* src, size_t srcSize)
-{
-    const BYTE* ip = (const BYTE*)src;
-    const BYTE* const end = ip + srcSize;
-    unsigned maxSymbolValue = *maxSymbolValuePtr;
-    unsigned max=0;
-
-    memset(count, 0, (maxSymbolValue+1)*sizeof(*count));
-    if (srcSize==0) { *maxSymbolValuePtr = 0; return 0; }
-
-    while (ip max) max = count[s]; }
-
-    return (size_t)max;
-}
-
-
-/* FSE_count_parallel_wksp() :
- * Same as FSE_count_parallel(), but using an externally provided scratch buffer.
- * `workSpace` size must be a minimum of `1024 * sizeof(unsigned)`` */
-static size_t FSE_count_parallel_wksp(
-                                unsigned* count, unsigned* maxSymbolValuePtr,
-                                const void* source, size_t sourceSize,
-                                unsigned checkMax, unsigned* const workSpace)
-{
-    const BYTE* ip = (const BYTE*)source;
-    const BYTE* const iend = ip+sourceSize;
-    unsigned maxSymbolValue = *maxSymbolValuePtr;
-    unsigned max=0;
-    U32* const Counting1 = workSpace;
-    U32* const Counting2 = Counting1 + 256;
-    U32* const Counting3 = Counting2 + 256;
-    U32* const Counting4 = Counting3 + 256;
-
-    memset(Counting1, 0, 4*256*sizeof(unsigned));
-
-    /* safety checks */
-    if (!sourceSize) {
-        memset(count, 0, maxSymbolValue + 1);
-        *maxSymbolValuePtr = 0;
-        return 0;
-    }
-    if (!maxSymbolValue) maxSymbolValue = 255;            /* 0 == default */
-
-    /* by stripes of 16 bytes */
-    {   U32 cached = MEM_read32(ip); ip += 4;
-        while (ip < iend-15) {
-            U32 c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-            c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-            c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-            c = cached; cached = MEM_read32(ip); ip += 4;
-            Counting1[(BYTE) c     ]++;
-            Counting2[(BYTE)(c>>8) ]++;
-            Counting3[(BYTE)(c>>16)]++;
-            Counting4[       c>>24 ]++;
-        }
-        ip-=4;
-    }
-
-    /* finish last symbols */
-    while (ipmaxSymbolValue; s--) {
-            Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s];
-            if (Counting1[s]) return ERROR(maxSymbolValue_tooSmall);
-    }   }
-
-    {   U32 s; for (s=0; s<=maxSymbolValue; s++) {
-            count[s] = Counting1[s] + Counting2[s] + Counting3[s] + Counting4[s];
-            if (count[s] > max) max = count[s];
-    }   }
-
-    while (!count[maxSymbolValue]) maxSymbolValue--;
-    *maxSymbolValuePtr = maxSymbolValue;
-    return (size_t)max;
-}
-
-/* FSE_countFast_wksp() :
- * Same as FSE_countFast(), but using an externally provided scratch buffer.
- * `workSpace` size must be table of >= `1024` unsigned */
-size_t FSE_countFast_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
-                     const void* source, size_t sourceSize, unsigned* workSpace)
-{
-    if (sourceSize < 1500) return FSE_count_simple(count, maxSymbolValuePtr, source, sourceSize);
-    return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 0, workSpace);
-}
-
-/* fast variant (unsafe : won't check if src contains values beyond count[] limit) */
-size_t FSE_countFast(unsigned* count, unsigned* maxSymbolValuePtr,
-                     const void* source, size_t sourceSize)
-{
-    unsigned tmpCounters[1024];
-    return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, tmpCounters);
-}
-
-/* FSE_count_wksp() :
- * Same as FSE_count(), but using an externally provided scratch buffer.
- * `workSpace` size must be table of >= `1024` unsigned */
-size_t FSE_count_wksp(unsigned* count, unsigned* maxSymbolValuePtr,
-                 const void* source, size_t sourceSize, unsigned* workSpace)
-{
-    if (*maxSymbolValuePtr < 255)
-        return FSE_count_parallel_wksp(count, maxSymbolValuePtr, source, sourceSize, 1, workSpace);
-    *maxSymbolValuePtr = 255;
-    return FSE_countFast_wksp(count, maxSymbolValuePtr, source, sourceSize, workSpace);
-}
-
-size_t FSE_count(unsigned* count, unsigned* maxSymbolValuePtr,
-                 const void* src, size_t srcSize)
-{
-    unsigned tmpCounters[1024];
-    return FSE_count_wksp(count, maxSymbolValuePtr, src, srcSize, tmpCounters);
-}
-
-
-
-/*-**************************************************************
-*  FSE Compression Code
-****************************************************************/
-/*! FSE_sizeof_CTable() :
-    FSE_CTable is a variable size structure which contains :
-    `U16 tableLog;`
-    `U16 maxSymbolValue;`
-    `U16 nextStateNumber[1 << tableLog];`                         // This size is variable
-    `FSE_symbolCompressionTransform symbolTT[maxSymbolValue+1];`  // This size is variable
-Allocation is manual (C standard does not support variable-size structures).
-*/
-size_t FSE_sizeof_CTable (unsigned maxSymbolValue, unsigned tableLog)
-{
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-    return FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
-}
-
-FSE_CTable* FSE_createCTable (unsigned maxSymbolValue, unsigned tableLog)
-{
-    size_t size;
-    if (tableLog > FSE_TABLELOG_ABSOLUTE_MAX) tableLog = FSE_TABLELOG_ABSOLUTE_MAX;
-    size = FSE_CTABLE_SIZE_U32 (tableLog, maxSymbolValue) * sizeof(U32);
-    return (FSE_CTable*)malloc(size);
-}
-
-void FSE_freeCTable (FSE_CTable* ct) { free(ct); }
-
-/* provides the minimum logSize to safely represent a distribution */
-static unsigned FSE_minTableLog(size_t srcSize, unsigned maxSymbolValue)
-{
-    U32 minBitsSrc = BIT_highbit32((U32)(srcSize - 1)) + 1;
-    U32 minBitsSymbols = BIT_highbit32(maxSymbolValue) + 2;
-    U32 minBits = minBitsSrc < minBitsSymbols ? minBitsSrc : minBitsSymbols;
-    assert(srcSize > 1); /* Not supported, RLE should be used instead */
-    return minBits;
-}
-
-unsigned FSE_optimalTableLog_internal(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue, unsigned minus)
-{
-    U32 maxBitsSrc = BIT_highbit32((U32)(srcSize - 1)) - minus;
-    U32 tableLog = maxTableLog;
-    U32 minBits = FSE_minTableLog(srcSize, maxSymbolValue);
-    assert(srcSize > 1); /* Not supported, RLE should be used instead */
-    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
-    if (maxBitsSrc < tableLog) tableLog = maxBitsSrc;   /* Accuracy can be reduced */
-    if (minBits > tableLog) tableLog = minBits;   /* Need a minimum to safely represent all symbol values */
-    if (tableLog < FSE_MIN_TABLELOG) tableLog = FSE_MIN_TABLELOG;
-    if (tableLog > FSE_MAX_TABLELOG) tableLog = FSE_MAX_TABLELOG;
-    return tableLog;
-}
-
-unsigned FSE_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
-{
-    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 2);
-}
-
-
-/* Secondary normalization method.
-   To be used when primary method fails. */
-
-static size_t FSE_normalizeM2(short* norm, U32 tableLog, const unsigned* count, size_t total, U32 maxSymbolValue)
-{
-    short const NOT_YET_ASSIGNED = -2;
-    U32 s;
-    U32 distributed = 0;
-    U32 ToDistribute;
-
-    /* Init */
-    U32 const lowThreshold = (U32)(total >> tableLog);
-    U32 lowOne = (U32)((total * 3) >> (tableLog + 1));
-
-    for (s=0; s<=maxSymbolValue; s++) {
-        if (count[s] == 0) {
-            norm[s]=0;
-            continue;
-        }
-        if (count[s] <= lowThreshold) {
-            norm[s] = -1;
-            distributed++;
-            total -= count[s];
-            continue;
-        }
-        if (count[s] <= lowOne) {
-            norm[s] = 1;
-            distributed++;
-            total -= count[s];
-            continue;
-        }
-
-        norm[s]=NOT_YET_ASSIGNED;
-    }
-    ToDistribute = (1 << tableLog) - distributed;
-
-    if ((total / ToDistribute) > lowOne) {
-        /* risk of rounding to zero */
-        lowOne = (U32)((total * 3) / (ToDistribute * 2));
-        for (s=0; s<=maxSymbolValue; s++) {
-            if ((norm[s] == NOT_YET_ASSIGNED) && (count[s] <= lowOne)) {
-                norm[s] = 1;
-                distributed++;
-                total -= count[s];
-                continue;
-        }   }
-        ToDistribute = (1 << tableLog) - distributed;
-    }
-
-    if (distributed == maxSymbolValue+1) {
-        /* all values are pretty poor;
-           probably incompressible data (should have already been detected);
-           find max, then give all remaining points to max */
-        U32 maxV = 0, maxC = 0;
-        for (s=0; s<=maxSymbolValue; s++)
-            if (count[s] > maxC) maxV=s, maxC=count[s];
-        norm[maxV] += (short)ToDistribute;
-        return 0;
-    }
-
-    if (total == 0) {
-        /* all of the symbols were low enough for the lowOne or lowThreshold */
-        for (s=0; ToDistribute > 0; s = (s+1)%(maxSymbolValue+1))
-            if (norm[s] > 0) ToDistribute--, norm[s]++;
-        return 0;
-    }
-
-    {   U64 const vStepLog = 62 - tableLog;
-        U64 const mid = (1ULL << (vStepLog-1)) - 1;
-        U64 const rStep = ((((U64)1<> vStepLog);
-                U32 const sEnd = (U32)(end >> vStepLog);
-                U32 const weight = sEnd - sStart;
-                if (weight < 1)
-                    return ERROR(GENERIC);
-                norm[s] = (short)weight;
-                tmpTotal = end;
-    }   }   }
-
-    return 0;
-}
-
-
-size_t FSE_normalizeCount (short* normalizedCounter, unsigned tableLog,
-                           const unsigned* count, size_t total,
-                           unsigned maxSymbolValue)
-{
-    /* Sanity checks */
-    if (tableLog==0) tableLog = FSE_DEFAULT_TABLELOG;
-    if (tableLog < FSE_MIN_TABLELOG) return ERROR(GENERIC);   /* Unsupported size */
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);   /* Unsupported size */
-    if (tableLog < FSE_minTableLog(total, maxSymbolValue)) return ERROR(GENERIC);   /* Too small tableLog, compression potentially impossible */
-
-    {   static U32 const rtbTable[] = {     0, 473195, 504333, 520860, 550000, 700000, 750000, 830000 };
-        U64 const scale = 62 - tableLog;
-        U64 const step = ((U64)1<<62) / total;   /* <== here, one division ! */
-        U64 const vStep = 1ULL<<(scale-20);
-        int stillToDistribute = 1<> tableLog);
-
-        for (s=0; s<=maxSymbolValue; s++) {
-            if (count[s] == total) return 0;   /* rle special case */
-            if (count[s] == 0) { normalizedCounter[s]=0; continue; }
-            if (count[s] <= lowThreshold) {
-                normalizedCounter[s] = -1;
-                stillToDistribute--;
-            } else {
-                short proba = (short)((count[s]*step) >> scale);
-                if (proba<8) {
-                    U64 restToBeat = vStep * rtbTable[proba];
-                    proba += (count[s]*step) - ((U64)proba< restToBeat;
-                }
-                if (proba > largestP) largestP=proba, largest=s;
-                normalizedCounter[s] = proba;
-                stillToDistribute -= proba;
-        }   }
-        if (-stillToDistribute >= (normalizedCounter[largest] >> 1)) {
-            /* corner case, need another normalization method */
-            size_t const errorCode = FSE_normalizeM2(normalizedCounter, tableLog, count, total, maxSymbolValue);
-            if (FSE_isError(errorCode)) return errorCode;
-        }
-        else normalizedCounter[largest] += (short)stillToDistribute;
-    }
-
-#if 0
-    {   /* Print Table (debug) */
-        U32 s;
-        U32 nTotal = 0;
-        for (s=0; s<=maxSymbolValue; s++)
-            printf("%3i: %4i \n", s, normalizedCounter[s]);
-        for (s=0; s<=maxSymbolValue; s++)
-            nTotal += abs(normalizedCounter[s]);
-        if (nTotal != (1U<>1);   /* assumption : tableLog >= 1 */
-    FSE_symbolCompressionTransform* const symbolTT = (FSE_symbolCompressionTransform*) (FSCT);
-    unsigned s;
-
-    /* Sanity checks */
-    if (nbBits < 1) return ERROR(GENERIC);             /* min size */
-
-    /* header */
-    tableU16[-2] = (U16) nbBits;
-    tableU16[-1] = (U16) maxSymbolValue;
-
-    /* Build table */
-    for (s=0; s FSE_MAX_TABLELOG*4+7 ) && (srcSize & 2)) {  /* test bit 2 */
-        FSE_encodeSymbol(&bitC, &CState2, *--ip);
-        FSE_encodeSymbol(&bitC, &CState1, *--ip);
-        FSE_FLUSHBITS(&bitC);
-    }
-
-    /* 2 or 4 encoding per loop */
-    while ( ip>istart ) {
-
-        FSE_encodeSymbol(&bitC, &CState2, *--ip);
-
-        if (sizeof(bitC.bitContainer)*8 < FSE_MAX_TABLELOG*2+7 )   /* this test must be static */
-            FSE_FLUSHBITS(&bitC);
-
-        FSE_encodeSymbol(&bitC, &CState1, *--ip);
-
-        if (sizeof(bitC.bitContainer)*8 > FSE_MAX_TABLELOG*4+7 ) {  /* this test must be static */
-            FSE_encodeSymbol(&bitC, &CState2, *--ip);
-            FSE_encodeSymbol(&bitC, &CState1, *--ip);
-        }
-
-        FSE_FLUSHBITS(&bitC);
-    }
-
-    FSE_flushCState(&bitC, &CState2);
-    FSE_flushCState(&bitC, &CState1);
-    return BIT_closeCStream(&bitC);
-}
-
-size_t FSE_compress_usingCTable (void* dst, size_t dstSize,
-                           const void* src, size_t srcSize,
-                           const FSE_CTable* ct)
-{
-    unsigned const fast = (dstSize >= FSE_BLOCKBOUND(srcSize));
-
-    if (fast)
-        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 1);
-    else
-        return FSE_compress_usingCTable_generic(dst, dstSize, src, srcSize, ct, 0);
-}
-
-
-size_t FSE_compressBound(size_t size) { return FSE_COMPRESSBOUND(size); }
-
-#define CHECK_V_F(e, f) size_t const e = f; if (ERR_isError(e)) return e
-#define CHECK_F(f)   { CHECK_V_F(_var_err__, f); }
-
-/* FSE_compress_wksp() :
- * Same as FSE_compress2(), but using an externally allocated scratch buffer (`workSpace`).
- * `wkspSize` size must be `(1< not compressible */
-        if (maxCount < (srcSize >> 7)) return 0;   /* Heuristic : not compressible enough */
-    }
-
-    tableLog = FSE_optimalTableLog(tableLog, srcSize, maxSymbolValue);
-    CHECK_F( FSE_normalizeCount(norm, tableLog, count, srcSize, maxSymbolValue) );
-
-    /* Write table description header */
-    {   CHECK_V_F(nc_err, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
-        op += nc_err;
-    }
-
-    /* Compress */
-    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, scratchBufferSize) );
-    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, src, srcSize, CTable) );
-        if (cSize == 0) return 0;   /* not enough space for compressed data */
-        op += cSize;
-    }
-
-    /* check compressibility */
-    if ( (size_t)(op-ostart) >= srcSize-1 ) return 0;
-
-    return op-ostart;
-}
-
-typedef struct {
-    FSE_CTable CTable_max[FSE_CTABLE_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE)];
-    BYTE scratchBuffer[1 << FSE_MAX_TABLELOG];
-} fseWkspMax_t;
-
-size_t FSE_compress2 (void* dst, size_t dstCapacity, const void* src, size_t srcSize, unsigned maxSymbolValue, unsigned tableLog)
-{
-    fseWkspMax_t scratchBuffer;
-    FSE_STATIC_ASSERT(sizeof(scratchBuffer) >= FSE_WKSP_SIZE_U32(FSE_MAX_TABLELOG, FSE_MAX_SYMBOL_VALUE));   /* compilation failures here means scratchBuffer is not large enough */
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-    return FSE_compress_wksp(dst, dstCapacity, src, srcSize, maxSymbolValue, tableLog, &scratchBuffer, sizeof(scratchBuffer));
-}
-
-size_t FSE_compress (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    return FSE_compress2(dst, dstCapacity, src, srcSize, FSE_MAX_SYMBOL_VALUE, FSE_DEFAULT_TABLELOG);
-}
-
-
-#endif   /* FSE_COMMONDEFS_ONLY */
diff --git a/priv/zstd/lib/compress/huf_compress.c b/priv/zstd/lib/compress/huf_compress.c
deleted file mode 100644
index 5692d56..0000000
--- a/priv/zstd/lib/compress/huf_compress.c
+++ /dev/null
@@ -1,690 +0,0 @@
-/* ******************************************************************
-   Huffman encoder, part of New Generation Entropy library
-   Copyright (C) 2013-2016, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-/* **************************************************************
-*  Compiler specifics
-****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#endif
-
-
-/* **************************************************************
-*  Includes
-****************************************************************/
-#include      /* memcpy, memset */
-#include       /* printf (debug) */
-#include "bitstream.h"
-#define FSE_STATIC_LINKING_ONLY   /* FSE_optimalTableLog_internal */
-#include "fse.h"        /* header compression */
-#define HUF_STATIC_LINKING_ONLY
-#include "huf.h"
-#include "error_private.h"
-
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define HUF_isError ERR_isError
-#define HUF_STATIC_ASSERT(c) { enum { HUF_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-#define CHECK_V_F(e, f) size_t const e = f; if (ERR_isError(e)) return e
-#define CHECK_F(f)   { CHECK_V_F(_var_err__, f); }
-
-
-/* **************************************************************
-*  Utils
-****************************************************************/
-unsigned HUF_optimalTableLog(unsigned maxTableLog, size_t srcSize, unsigned maxSymbolValue)
-{
-    return FSE_optimalTableLog_internal(maxTableLog, srcSize, maxSymbolValue, 1);
-}
-
-
-/* *******************************************************
-*  HUF : Huffman block compression
-*********************************************************/
-/* HUF_compressWeights() :
- * Same as FSE_compress(), but dedicated to huff0's weights compression.
- * The use case needs much less stack memory.
- * Note : all elements within weightTable are supposed to be <= HUF_TABLELOG_MAX.
- */
-#define MAX_FSE_TABLELOG_FOR_HUFF_HEADER 6
-size_t HUF_compressWeights (void* dst, size_t dstSize, const void* weightTable, size_t wtSize)
-{
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const oend = ostart + dstSize;
-
-    U32 maxSymbolValue = HUF_TABLELOG_MAX;
-    U32 tableLog = MAX_FSE_TABLELOG_FOR_HUFF_HEADER;
-
-    FSE_CTable CTable[FSE_CTABLE_SIZE_U32(MAX_FSE_TABLELOG_FOR_HUFF_HEADER, HUF_TABLELOG_MAX)];
-    BYTE scratchBuffer[1< not compressible */
-    }
-
-    tableLog = FSE_optimalTableLog(tableLog, wtSize, maxSymbolValue);
-    CHECK_F( FSE_normalizeCount(norm, tableLog, count, wtSize, maxSymbolValue) );
-
-    /* Write table description header */
-    {   CHECK_V_F(hSize, FSE_writeNCount(op, oend-op, norm, maxSymbolValue, tableLog) );
-        op += hSize;
-    }
-
-    /* Compress */
-    CHECK_F( FSE_buildCTable_wksp(CTable, norm, maxSymbolValue, tableLog, scratchBuffer, sizeof(scratchBuffer)) );
-    {   CHECK_V_F(cSize, FSE_compress_usingCTable(op, oend - op, weightTable, wtSize, CTable) );
-        if (cSize == 0) return 0;   /* not enough space for compressed data */
-        op += cSize;
-    }
-
-    return op-ostart;
-}
-
-
-struct HUF_CElt_s {
-  U16  val;
-  BYTE nbBits;
-};   /* typedef'd to HUF_CElt within "huf.h" */
-
-/*! HUF_writeCTable() :
-    `CTable` : Huffman tree to save, using huf representation.
-    @return : size of saved CTable */
-size_t HUF_writeCTable (void* dst, size_t maxDstSize,
-                        const HUF_CElt* CTable, U32 maxSymbolValue, U32 huffLog)
-{
-    BYTE bitsToWeight[HUF_TABLELOG_MAX + 1];   /* precomputed conversion table */
-    BYTE huffWeight[HUF_SYMBOLVALUE_MAX];
-    BYTE* op = (BYTE*)dst;
-    U32 n;
-
-     /* check conditions */
-    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(maxSymbolValue_tooLarge);
-
-    /* convert to weight */
-    bitsToWeight[0] = 0;
-    for (n=1; n1) & (hSize < maxSymbolValue/2)) {   /* FSE compressed */
-            op[0] = (BYTE)hSize;
-            return hSize+1;
-    }   }
-
-    /* write raw values as 4-bits (max : 15) */
-    if (maxSymbolValue > (256-128)) return ERROR(GENERIC);   /* should not happen : likely means source cannot be compressed */
-    if (((maxSymbolValue+1)/2) + 1 > maxDstSize) return ERROR(dstSize_tooSmall);   /* not enough space within dst buffer */
-    op[0] = (BYTE)(128 /*special case*/ + (maxSymbolValue-1));
-    huffWeight[maxSymbolValue] = 0;   /* to be sure it doesn't cause msan issue in final combination */
-    for (n=0; n HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
-    if (nbSymbols > *maxSymbolValuePtr+1) return ERROR(maxSymbolValue_tooSmall);
-
-    /* Prepare base value per rank */
-    {   U32 n, nextRankStart = 0;
-        for (n=1; n<=tableLog; n++) {
-            U32 current = nextRankStart;
-            nextRankStart += (rankVal[n] << (n-1));
-            rankVal[n] = current;
-    }   }
-
-    /* fill nbBits */
-    {   U32 n; for (n=0; nn=tableLog+1 */
-        U16 valPerRank[HUF_TABLELOG_MAX+2] = {0};
-        { U32 n; for (n=0; n0; n--) {  /* start at n=tablelog <-> w=1 */
-                valPerRank[n] = min;     /* get starting value within each rank */
-                min += nbPerRank[n];
-                min >>= 1;
-        }   }
-        /* assign value within rank, symbol order */
-        { U32 n; for (n=0; n maxNbBits */
-
-    /* there are several too large elements (at least >= 2) */
-    {   int totalCost = 0;
-        const U32 baseCost = 1 << (largestBits - maxNbBits);
-        U32 n = lastNonNull;
-
-        while (huffNode[n].nbBits > maxNbBits) {
-            totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits));
-            huffNode[n].nbBits = (BYTE)maxNbBits;
-            n --;
-        }  /* n stops at huffNode[n].nbBits <= maxNbBits */
-        while (huffNode[n].nbBits == maxNbBits) n--;   /* n end at index of smallest symbol using < maxNbBits */
-
-        /* renorm totalCost */
-        totalCost >>= (largestBits - maxNbBits);  /* note : totalCost is necessarily a multiple of baseCost */
-
-        /* repay normalized cost */
-        {   U32 const noSymbol = 0xF0F0F0F0;
-            U32 rankLast[HUF_TABLELOG_MAX+2];
-            int pos;
-
-            /* Get pos of last (smallest) symbol per rank */
-            memset(rankLast, 0xF0, sizeof(rankLast));
-            {   U32 currentNbBits = maxNbBits;
-                for (pos=n ; pos >= 0; pos--) {
-                    if (huffNode[pos].nbBits >= currentNbBits) continue;
-                    currentNbBits = huffNode[pos].nbBits;   /* < maxNbBits */
-                    rankLast[maxNbBits-currentNbBits] = pos;
-            }   }
-
-            while (totalCost > 0) {
-                U32 nBitsToDecrease = BIT_highbit32(totalCost) + 1;
-                for ( ; nBitsToDecrease > 1; nBitsToDecrease--) {
-                    U32 highPos = rankLast[nBitsToDecrease];
-                    U32 lowPos = rankLast[nBitsToDecrease-1];
-                    if (highPos == noSymbol) continue;
-                    if (lowPos == noSymbol) break;
-                    {   U32 const highTotal = huffNode[highPos].count;
-                        U32 const lowTotal = 2 * huffNode[lowPos].count;
-                        if (highTotal <= lowTotal) break;
-                }   }
-                /* only triggered when no more rank 1 symbol left => find closest one (note : there is necessarily at least one !) */
-                /* HUF_MAX_TABLELOG test just to please gcc 5+; but it should not be necessary */
-                while ((nBitsToDecrease<=HUF_TABLELOG_MAX) && (rankLast[nBitsToDecrease] == noSymbol))
-                    nBitsToDecrease ++;
-                totalCost -= 1 << (nBitsToDecrease-1);
-                if (rankLast[nBitsToDecrease-1] == noSymbol)
-                    rankLast[nBitsToDecrease-1] = rankLast[nBitsToDecrease];   /* this rank is no longer empty */
-                huffNode[rankLast[nBitsToDecrease]].nbBits ++;
-                if (rankLast[nBitsToDecrease] == 0)    /* special case, reached largest symbol */
-                    rankLast[nBitsToDecrease] = noSymbol;
-                else {
-                    rankLast[nBitsToDecrease]--;
-                    if (huffNode[rankLast[nBitsToDecrease]].nbBits != maxNbBits-nBitsToDecrease)
-                        rankLast[nBitsToDecrease] = noSymbol;   /* this rank is now empty */
-            }   }   /* while (totalCost > 0) */
-
-            while (totalCost < 0) {  /* Sometimes, cost correction overshoot */
-                if (rankLast[1] == noSymbol) {  /* special case : no rank 1 symbol (using maxNbBits-1); let's create one from largest rank 0 (using maxNbBits) */
-                    while (huffNode[n].nbBits == maxNbBits) n--;
-                    huffNode[n+1].nbBits--;
-                    rankLast[1] = n+1;
-                    totalCost++;
-                    continue;
-                }
-                huffNode[ rankLast[1] + 1 ].nbBits--;
-                rankLast[1]++;
-                totalCost ++;
-    }   }   }   /* there are several too large elements (at least >= 2) */
-
-    return maxNbBits;
-}
-
-
-typedef struct {
-    U32 base;
-    U32 current;
-} rankPos;
-
-static void HUF_sort(nodeElt* huffNode, const U32* count, U32 maxSymbolValue)
-{
-    rankPos rank[32];
-    U32 n;
-
-    memset(rank, 0, sizeof(rank));
-    for (n=0; n<=maxSymbolValue; n++) {
-        U32 r = BIT_highbit32(count[n] + 1);
-        rank[r].base ++;
-    }
-    for (n=30; n>0; n--) rank[n-1].base += rank[n].base;
-    for (n=0; n<32; n++) rank[n].current = rank[n].base;
-    for (n=0; n<=maxSymbolValue; n++) {
-        U32 const c = count[n];
-        U32 const r = BIT_highbit32(c+1) + 1;
-        U32 pos = rank[r].current++;
-        while ((pos > rank[r].base) && (c > huffNode[pos-1].count)) huffNode[pos]=huffNode[pos-1], pos--;
-        huffNode[pos].count = c;
-        huffNode[pos].byte  = (BYTE)n;
-    }
-}
-
-
-/** HUF_buildCTable_wksp() :
- *  Same as HUF_buildCTable(), but using externally allocated scratch buffer.
- *  `workSpace` must be aligned on 4-bytes boundaries, and be at least as large as a table of 1024 unsigned.
- */
-#define STARTNODE (HUF_SYMBOLVALUE_MAX+1)
-typedef nodeElt huffNodeTable[2*HUF_SYMBOLVALUE_MAX+1 +1];
-size_t HUF_buildCTable_wksp (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits, void* workSpace, size_t wkspSize)
-{
-    nodeElt* const huffNode0 = (nodeElt*)workSpace;
-    nodeElt* const huffNode = huffNode0+1;
-    U32 n, nonNullRank;
-    int lowS, lowN;
-    U16 nodeNb = STARTNODE;
-    U32 nodeRoot;
-
-    /* safety checks */
-    if (wkspSize < sizeof(huffNodeTable)) return ERROR(GENERIC);   /* workSpace is not large enough */
-    if (maxNbBits == 0) maxNbBits = HUF_TABLELOG_DEFAULT;
-    if (maxSymbolValue > HUF_SYMBOLVALUE_MAX) return ERROR(GENERIC);
-    memset(huffNode0, 0, sizeof(huffNodeTable));
-
-    /* sort, decreasing order */
-    HUF_sort(huffNode, count, maxSymbolValue);
-
-    /* init for parents */
-    nonNullRank = maxSymbolValue;
-    while(huffNode[nonNullRank].count == 0) nonNullRank--;
-    lowS = nonNullRank; nodeRoot = nodeNb + lowS - 1; lowN = nodeNb;
-    huffNode[nodeNb].count = huffNode[lowS].count + huffNode[lowS-1].count;
-    huffNode[lowS].parent = huffNode[lowS-1].parent = nodeNb;
-    nodeNb++; lowS-=2;
-    for (n=nodeNb; n<=nodeRoot; n++) huffNode[n].count = (U32)(1U<<30);
-    huffNode0[0].count = (U32)(1U<<31);  /* fake entry, strong barrier */
-
-    /* create parents */
-    while (nodeNb <= nodeRoot) {
-        U32 n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-        U32 n2 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++;
-        huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count;
-        huffNode[n1].parent = huffNode[n2].parent = nodeNb;
-        nodeNb++;
-    }
-
-    /* distribute weights (unlimited tree height) */
-    huffNode[nodeRoot].nbBits = 0;
-    for (n=nodeRoot-1; n>=STARTNODE; n--)
-        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
-    for (n=0; n<=nonNullRank; n++)
-        huffNode[n].nbBits = huffNode[ huffNode[n].parent ].nbBits + 1;
-
-    /* enforce maxTableLog */
-    maxNbBits = HUF_setMaxHeight(huffNode, nonNullRank, maxNbBits);
-
-    /* fill result into tree (val, nbBits) */
-    {   U16 nbPerRank[HUF_TABLELOG_MAX+1] = {0};
-        U16 valPerRank[HUF_TABLELOG_MAX+1] = {0};
-        if (maxNbBits > HUF_TABLELOG_MAX) return ERROR(GENERIC);   /* check fit into table */
-        for (n=0; n<=nonNullRank; n++)
-            nbPerRank[huffNode[n].nbBits]++;
-        /* determine stating value per rank */
-        {   U16 min = 0;
-            for (n=maxNbBits; n>0; n--) {
-                valPerRank[n] = min;      /* get starting value within each rank */
-                min += nbPerRank[n];
-                min >>= 1;
-        }   }
-        for (n=0; n<=maxSymbolValue; n++)
-            tree[huffNode[n].byte].nbBits = huffNode[n].nbBits;   /* push nbBits per symbol, symbol order */
-        for (n=0; n<=maxSymbolValue; n++)
-            tree[n].val = valPerRank[tree[n].nbBits]++;   /* assign value within rank, symbol order */
-    }
-
-    return maxNbBits;
-}
-
-/** HUF_buildCTable() :
- *  Note : count is used before tree is written, so they can safely overlap
- */
-size_t HUF_buildCTable (HUF_CElt* tree, const U32* count, U32 maxSymbolValue, U32 maxNbBits)
-{
-    huffNodeTable nodeTable;
-    return HUF_buildCTable_wksp(tree, count, maxSymbolValue, maxNbBits, nodeTable, sizeof(nodeTable));
-}
-
-static size_t HUF_estimateCompressedSize(HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue)
-{
-    size_t nbBits = 0;
-    int s;
-    for (s = 0; s <= (int)maxSymbolValue; ++s) {
-        nbBits += CTable[s].nbBits * count[s];
-    }
-    return nbBits >> 3;
-}
-
-static int HUF_validateCTable(const HUF_CElt* CTable, const unsigned* count, unsigned maxSymbolValue) {
-  int bad = 0;
-  int s;
-  for (s = 0; s <= (int)maxSymbolValue; ++s) {
-    bad |= (count[s] != 0) & (CTable[s].nbBits == 0);
-  }
-  return !bad;
-}
-
-static void HUF_encodeSymbol(BIT_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable)
-{
-    BIT_addBitsFast(bitCPtr, CTable[symbol].val, CTable[symbol].nbBits);
-}
-
-size_t HUF_compressBound(size_t size) { return HUF_COMPRESSBOUND(size); }
-
-#define HUF_FLUSHBITS(s)  BIT_flushBits(s)
-
-#define HUF_FLUSHBITS_1(stream) \
-    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*2+7) HUF_FLUSHBITS(stream)
-
-#define HUF_FLUSHBITS_2(stream) \
-    if (sizeof((stream)->bitContainer)*8 < HUF_TABLELOG_MAX*4+7) HUF_FLUSHBITS(stream)
-
-size_t HUF_compress1X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
-{
-    const BYTE* ip = (const BYTE*) src;
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* const oend = ostart + dstSize;
-    BYTE* op = ostart;
-    size_t n;
-    BIT_CStream_t bitC;
-
-    /* init */
-    if (dstSize < 8) return 0;   /* not enough space to compress */
-    { size_t const initErr = BIT_initCStream(&bitC, op, oend-op);
-      if (HUF_isError(initErr)) return 0; }
-
-    n = srcSize & ~3;  /* join to mod 4 */
-    switch (srcSize & 3)
-    {
-        case 3 : HUF_encodeSymbol(&bitC, ip[n+ 2], CTable);
-                 HUF_FLUSHBITS_2(&bitC);
-		 /* fall-through */
-        case 2 : HUF_encodeSymbol(&bitC, ip[n+ 1], CTable);
-                 HUF_FLUSHBITS_1(&bitC);
-		 /* fall-through */
-        case 1 : HUF_encodeSymbol(&bitC, ip[n+ 0], CTable);
-                 HUF_FLUSHBITS(&bitC);
-		 /* fall-through */
-        case 0 : /* fall-through */
-        default: break;
-    }
-
-    for (; n>0; n-=4) {  /* note : n&3==0 at this stage */
-        HUF_encodeSymbol(&bitC, ip[n- 1], CTable);
-        HUF_FLUSHBITS_1(&bitC);
-        HUF_encodeSymbol(&bitC, ip[n- 2], CTable);
-        HUF_FLUSHBITS_2(&bitC);
-        HUF_encodeSymbol(&bitC, ip[n- 3], CTable);
-        HUF_FLUSHBITS_1(&bitC);
-        HUF_encodeSymbol(&bitC, ip[n- 4], CTable);
-        HUF_FLUSHBITS(&bitC);
-    }
-
-    return BIT_closeCStream(&bitC);
-}
-
-
-size_t HUF_compress4X_usingCTable(void* dst, size_t dstSize, const void* src, size_t srcSize, const HUF_CElt* CTable)
-{
-    size_t const segmentSize = (srcSize+3)/4;   /* first 3 segments */
-    const BYTE* ip = (const BYTE*) src;
-    const BYTE* const iend = ip + srcSize;
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* const oend = ostart + dstSize;
-    BYTE* op = ostart;
-
-    if (dstSize < 6 + 1 + 1 + 1 + 8) return 0;   /* minimum space to compress successfully */
-    if (srcSize < 12) return 0;   /* no saving possible : too small input */
-    op += 6;   /* jumpTable */
-
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
-        if (cSize==0) return 0;
-        MEM_writeLE16(ostart, (U16)cSize);
-        op += cSize;
-    }
-
-    ip += segmentSize;
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
-        if (cSize==0) return 0;
-        MEM_writeLE16(ostart+2, (U16)cSize);
-        op += cSize;
-    }
-
-    ip += segmentSize;
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, segmentSize, CTable) );
-        if (cSize==0) return 0;
-        MEM_writeLE16(ostart+4, (U16)cSize);
-        op += cSize;
-    }
-
-    ip += segmentSize;
-    {   CHECK_V_F(cSize, HUF_compress1X_usingCTable(op, oend-op, ip, iend-ip, CTable) );
-        if (cSize==0) return 0;
-        op += cSize;
-    }
-
-    return op-ostart;
-}
-
-
-static size_t HUF_compressCTable_internal(
-                BYTE* const ostart, BYTE* op, BYTE* const oend,
-                const void* src, size_t srcSize,
-                unsigned singleStream, const HUF_CElt* CTable)
-{
-    size_t const cSize = singleStream ?
-                         HUF_compress1X_usingCTable(op, oend - op, src, srcSize, CTable) :
-                         HUF_compress4X_usingCTable(op, oend - op, src, srcSize, CTable);
-    if (HUF_isError(cSize)) { return cSize; }
-    if (cSize==0) { return 0; }   /* uncompressible */
-    op += cSize;
-    /* check compressibility */
-    if ((size_t)(op-ostart) >= srcSize-1) { return 0; }
-    return op-ostart;
-}
-
-
-/* `workSpace` must a table of at least 1024 unsigned */
-static size_t HUF_compress_internal (
-                void* dst, size_t dstSize,
-                const void* src, size_t srcSize,
-                unsigned maxSymbolValue, unsigned huffLog,
-                unsigned singleStream,
-                void* workSpace, size_t wkspSize,
-                HUF_CElt* oldHufTable, HUF_repeat* repeat, int preferRepeat)
-{
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* const oend = ostart + dstSize;
-    BYTE* op = ostart;
-
-    U32* count;
-    size_t const countSize = sizeof(U32) * (HUF_SYMBOLVALUE_MAX + 1);
-    HUF_CElt* CTable;
-    size_t const CTableSize = sizeof(HUF_CElt) * (HUF_SYMBOLVALUE_MAX + 1);
-
-    /* checks & inits */
-    if (wkspSize < sizeof(huffNodeTable) + countSize + CTableSize) return ERROR(GENERIC);
-    if (!srcSize) return 0;  /* Uncompressed (note : 1 means rle, so first byte must be correct) */
-    if (!dstSize) return 0;  /* cannot fit within dst budget */
-    if (srcSize > HUF_BLOCKSIZE_MAX) return ERROR(srcSize_wrong);   /* current block size limit */
-    if (huffLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
-    if (!maxSymbolValue) maxSymbolValue = HUF_SYMBOLVALUE_MAX;
-    if (!huffLog) huffLog = HUF_TABLELOG_DEFAULT;
-
-    count = (U32*)workSpace;
-    workSpace = (BYTE*)workSpace + countSize;
-    wkspSize -= countSize;
-    CTable = (HUF_CElt*)workSpace;
-    workSpace = (BYTE*)workSpace + CTableSize;
-    wkspSize -= CTableSize;
-
-    /* Heuristic : If we don't need to check the validity of the old table use the old table for small inputs */
-    if (preferRepeat && repeat && *repeat == HUF_repeat_valid) {
-        return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-    }
-
-    /* Scan input and build symbol stats */
-    {   CHECK_V_F(largest, FSE_count_wksp (count, &maxSymbolValue, (const BYTE*)src, srcSize, (U32*)workSpace) );
-        if (largest == srcSize) { *ostart = ((const BYTE*)src)[0]; return 1; }   /* single symbol, rle */
-        if (largest <= (srcSize >> 7)+1) return 0;   /* Fast heuristic : not compressible enough */
-    }
-
-    /* Check validity of previous table */
-    if (repeat && *repeat == HUF_repeat_check && !HUF_validateCTable(oldHufTable, count, maxSymbolValue)) {
-        *repeat = HUF_repeat_none;
-    }
-    /* Heuristic : use existing table for small inputs */
-    if (preferRepeat && repeat && *repeat != HUF_repeat_none) {
-        return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-    }
-
-    /* Build Huffman Tree */
-    huffLog = HUF_optimalTableLog(huffLog, srcSize, maxSymbolValue);
-    {   CHECK_V_F(maxBits, HUF_buildCTable_wksp (CTable, count, maxSymbolValue, huffLog, workSpace, wkspSize) );
-        huffLog = (U32)maxBits;
-        /* Zero the unused symbols so we can check it for validity */
-        memset(CTable + maxSymbolValue + 1, 0, CTableSize - (maxSymbolValue + 1) * sizeof(HUF_CElt));
-    }
-
-    /* Write table description header */
-    {   CHECK_V_F(hSize, HUF_writeCTable (op, dstSize, CTable, maxSymbolValue, huffLog) );
-        /* Check if using the previous table will be beneficial */
-        if (repeat && *repeat != HUF_repeat_none) {
-            size_t const oldSize = HUF_estimateCompressedSize(oldHufTable, count, maxSymbolValue);
-            size_t const newSize = HUF_estimateCompressedSize(CTable, count, maxSymbolValue);
-            if (oldSize <= hSize + newSize || hSize + 12 >= srcSize) {
-                return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, oldHufTable);
-            }
-        }
-        /* Use the new table */
-        if (hSize + 12ul >= srcSize) { return 0; }
-        op += hSize;
-        if (repeat) { *repeat = HUF_repeat_none; }
-        if (oldHufTable) { memcpy(oldHufTable, CTable, CTableSize); } /* Save the new table */
-    }
-    return HUF_compressCTable_internal(ostart, op, oend, src, srcSize, singleStream, CTable);
-}
-
-
-size_t HUF_compress1X_wksp (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize)
-{
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, NULL, NULL, 0);
-}
-
-size_t HUF_compress1X_repeat (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize,
-                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
-{
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 1 /* single stream */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
-}
-
-size_t HUF_compress1X (void* dst, size_t dstSize,
-                 const void* src, size_t srcSize,
-                 unsigned maxSymbolValue, unsigned huffLog)
-{
-    unsigned workSpace[1024];
-    return HUF_compress1X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
-}
-
-size_t HUF_compress4X_wksp (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize)
-{
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, NULL, NULL, 0);
-}
-
-size_t HUF_compress4X_repeat (void* dst, size_t dstSize,
-                      const void* src, size_t srcSize,
-                      unsigned maxSymbolValue, unsigned huffLog,
-                      void* workSpace, size_t wkspSize,
-                      HUF_CElt* hufTable, HUF_repeat* repeat, int preferRepeat)
-{
-    return HUF_compress_internal(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, 0 /* 4 streams */, workSpace, wkspSize, hufTable, repeat, preferRepeat);
-}
-
-size_t HUF_compress2 (void* dst, size_t dstSize,
-                const void* src, size_t srcSize,
-                unsigned maxSymbolValue, unsigned huffLog)
-{
-    unsigned workSpace[1024];
-    return HUF_compress4X_wksp(dst, dstSize, src, srcSize, maxSymbolValue, huffLog, workSpace, sizeof(workSpace));
-}
-
-size_t HUF_compress (void* dst, size_t maxDstSize, const void* src, size_t srcSize)
-{
-    return HUF_compress2(dst, maxDstSize, src, (U32)srcSize, 255, HUF_TABLELOG_DEFAULT);
-}
diff --git a/priv/zstd/lib/compress/zstd_compress.c b/priv/zstd/lib/compress/zstd_compress.c
deleted file mode 100644
index 8d16292..0000000
--- a/priv/zstd/lib/compress/zstd_compress.c
+++ /dev/null
@@ -1,3120 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/*-*************************************
-*  Tuning parameters
-***************************************/
-#ifndef ZSTD_CLEVEL_DEFAULT
-#  define ZSTD_CLEVEL_DEFAULT 3
-#endif
-
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include          /* memset */
-#include "mem.h"
-#define FSE_STATIC_LINKING_ONLY   /* FSE_encodeSymbol */
-#include "fse.h"
-#define HUF_STATIC_LINKING_ONLY
-#include "huf.h"
-#include "zstd_compress_internal.h"
-#include "zstd_fast.h"
-#include "zstd_double_fast.h"
-#include "zstd_lazy.h"
-#include "zstd_opt.h"
-#include "zstd_ldm.h"
-
-
-/*-*************************************
-*  Helper functions
-***************************************/
-size_t ZSTD_compressBound(size_t srcSize) {
-    return ZSTD_COMPRESSBOUND(srcSize);
-}
-
-
-/*-*************************************
-*  Context memory management
-***************************************/
-struct ZSTD_CDict_s {
-    void* dictBuffer;
-    const void* dictContent;
-    size_t dictContentSize;
-    ZSTD_CCtx* refContext;
-};  /* typedef'd to ZSTD_CDict within "zstd.h" */
-
-ZSTD_CCtx* ZSTD_createCCtx(void)
-{
-    return ZSTD_createCCtx_advanced(ZSTD_defaultCMem);
-}
-
-ZSTD_CCtx* ZSTD_createCCtx_advanced(ZSTD_customMem customMem)
-{
-    ZSTD_CCtx* cctx;
-
-    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
-
-    cctx = (ZSTD_CCtx*) ZSTD_calloc(sizeof(ZSTD_CCtx), customMem);
-    if (!cctx) return NULL;
-    cctx->customMem = customMem;
-    cctx->requestedParams.compressionLevel = ZSTD_CLEVEL_DEFAULT;
-    cctx->requestedParams.fParams.contentSizeFlag = 1;
-    ZSTD_STATIC_ASSERT(zcss_init==0);
-    ZSTD_STATIC_ASSERT(ZSTD_CONTENTSIZE_UNKNOWN==(0ULL - 1));
-    return cctx;
-}
-
-ZSTD_CCtx* ZSTD_initStaticCCtx(void *workspace, size_t workspaceSize)
-{
-    ZSTD_CCtx* const cctx = (ZSTD_CCtx*) workspace;
-    if (workspaceSize <= sizeof(ZSTD_CCtx)) return NULL;  /* minimum size */
-    if ((size_t)workspace & 7) return NULL;  /* must be 8-aligned */
-    memset(workspace, 0, workspaceSize);   /* may be a bit generous, could memset be smaller ? */
-    cctx->staticSize = workspaceSize;
-    cctx->workSpace = (void*)(cctx+1);
-    cctx->workSpaceSize = workspaceSize - sizeof(ZSTD_CCtx);
-
-    /* entropy space (never moves) */
-    if (cctx->workSpaceSize < sizeof(ZSTD_entropyCTables_t)) return NULL;
-    assert(((size_t)cctx->workSpace & (sizeof(void*)-1)) == 0);   /* ensure correct alignment */
-    cctx->entropy = (ZSTD_entropyCTables_t*)cctx->workSpace;
-
-    return cctx;
-}
-
-size_t ZSTD_freeCCtx(ZSTD_CCtx* cctx)
-{
-    if (cctx==NULL) return 0;   /* support free on NULL */
-    if (cctx->staticSize) return ERROR(memory_allocation);   /* not compatible with static CCtx */
-    ZSTD_free(cctx->workSpace, cctx->customMem);
-    cctx->workSpace = NULL;
-    ZSTD_freeCDict(cctx->cdictLocal);
-    cctx->cdictLocal = NULL;
-#ifdef ZSTD_MULTITHREAD
-    ZSTDMT_freeCCtx(cctx->mtctx);
-    cctx->mtctx = NULL;
-#endif
-    ZSTD_free(cctx, cctx->customMem);
-    return 0;   /* reserved as a potential error code in the future */
-}
-
-
-static size_t ZSTD_sizeof_mtctx(const ZSTD_CCtx* cctx)
-{
-#ifdef ZSTD_MULTITHREAD
-    return ZSTDMT_sizeof_CCtx(cctx->mtctx);
-#else
-    (void) cctx;
-    return 0;
-#endif
-}
-
-
-size_t ZSTD_sizeof_CCtx(const ZSTD_CCtx* cctx)
-{
-    if (cctx==NULL) return 0;   /* support sizeof on NULL */
-    DEBUGLOG(3, "sizeof(*cctx) : %u", (U32)sizeof(*cctx));
-    DEBUGLOG(3, "workSpaceSize (including streaming buffers): %u", (U32)cctx->workSpaceSize);
-    DEBUGLOG(3, "inner cdict : %u", (U32)ZSTD_sizeof_CDict(cctx->cdictLocal));
-    DEBUGLOG(3, "inner MTCTX : %u", (U32)ZSTD_sizeof_mtctx(cctx));
-    return sizeof(*cctx) + cctx->workSpaceSize
-           + ZSTD_sizeof_CDict(cctx->cdictLocal)
-           + ZSTD_sizeof_mtctx(cctx);
-}
-
-size_t ZSTD_sizeof_CStream(const ZSTD_CStream* zcs)
-{
-    return ZSTD_sizeof_CCtx(zcs);  /* same object */
-}
-
-/* private API call, for dictBuilder only */
-const seqStore_t* ZSTD_getSeqStore(const ZSTD_CCtx* ctx) { return &(ctx->seqStore); }
-
-#define ZSTD_CLEVEL_CUSTOM 999
-
-static ZSTD_compressionParameters ZSTD_getCParamsFromCCtxParams(
-        ZSTD_CCtx_params CCtxParams, U64 srcSizeHint, size_t dictSize)
-{
-    DEBUGLOG(4, "ZSTD_getCParamsFromCCtxParams: srcSize = %u, dictSize = %u",
-                (U32)srcSizeHint, (U32)dictSize);
-    return (CCtxParams.compressionLevel == ZSTD_CLEVEL_CUSTOM) ?
-                CCtxParams.cParams :
-                ZSTD_getCParams(CCtxParams.compressionLevel, srcSizeHint, dictSize);
-}
-
-static void ZSTD_cLevelToCCtxParams_srcSize(ZSTD_CCtx_params* CCtxParams, U64 srcSize)
-{
-    DEBUGLOG(4, "ZSTD_cLevelToCCtxParams_srcSize: srcSize = %u",
-                (U32)srcSize);
-    CCtxParams->cParams = ZSTD_getCParamsFromCCtxParams(*CCtxParams, srcSize, 0);
-    CCtxParams->compressionLevel = ZSTD_CLEVEL_CUSTOM;
-}
-
-static void ZSTD_cLevelToCParams(ZSTD_CCtx* cctx)
-{
-    DEBUGLOG(4, "ZSTD_cLevelToCParams: level=%i", cctx->requestedParams.compressionLevel);
-    ZSTD_cLevelToCCtxParams_srcSize(
-            &cctx->requestedParams, cctx->pledgedSrcSizePlusOne-1);
-}
-
-static void ZSTD_cLevelToCCtxParams(ZSTD_CCtx_params* CCtxParams)
-{
-    DEBUGLOG(4, "ZSTD_cLevelToCCtxParams");
-    ZSTD_cLevelToCCtxParams_srcSize(CCtxParams, ZSTD_CONTENTSIZE_UNKNOWN);
-}
-
-static ZSTD_CCtx_params ZSTD_makeCCtxParamsFromCParams(
-        ZSTD_compressionParameters cParams)
-{
-    ZSTD_CCtx_params cctxParams;
-    memset(&cctxParams, 0, sizeof(cctxParams));
-    cctxParams.cParams = cParams;
-    cctxParams.compressionLevel = ZSTD_CLEVEL_CUSTOM;
-    return cctxParams;
-}
-
-static ZSTD_CCtx_params* ZSTD_createCCtxParams_advanced(
-        ZSTD_customMem customMem)
-{
-    ZSTD_CCtx_params* params;
-    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
-    params = (ZSTD_CCtx_params*)ZSTD_calloc(
-            sizeof(ZSTD_CCtx_params), customMem);
-    if (!params) { return NULL; }
-    params->customMem = customMem;
-    params->compressionLevel = ZSTD_CLEVEL_DEFAULT;
-    return params;
-}
-
-ZSTD_CCtx_params* ZSTD_createCCtxParams(void)
-{
-    return ZSTD_createCCtxParams_advanced(ZSTD_defaultCMem);
-}
-
-size_t ZSTD_freeCCtxParams(ZSTD_CCtx_params* params)
-{
-    if (params == NULL) { return 0; }
-    ZSTD_free(params, params->customMem);
-    return 0;
-}
-
-size_t ZSTD_resetCCtxParams(ZSTD_CCtx_params* params)
-{
-    return ZSTD_initCCtxParams(params, ZSTD_CLEVEL_DEFAULT);
-}
-
-size_t ZSTD_initCCtxParams(ZSTD_CCtx_params* cctxParams, int compressionLevel) {
-    if (!cctxParams) { return ERROR(GENERIC); }
-    memset(cctxParams, 0, sizeof(*cctxParams));
-    cctxParams->compressionLevel = compressionLevel;
-    return 0;
-}
-
-size_t ZSTD_initCCtxParams_advanced(ZSTD_CCtx_params* cctxParams, ZSTD_parameters params)
-{
-    if (!cctxParams) { return ERROR(GENERIC); }
-    CHECK_F( ZSTD_checkCParams(params.cParams) );
-    memset(cctxParams, 0, sizeof(*cctxParams));
-    cctxParams->cParams = params.cParams;
-    cctxParams->fParams = params.fParams;
-    cctxParams->compressionLevel = ZSTD_CLEVEL_CUSTOM;
-    return 0;
-}
-
-static ZSTD_CCtx_params ZSTD_assignParamsToCCtxParams(
-        ZSTD_CCtx_params cctxParams, ZSTD_parameters params)
-{
-    ZSTD_CCtx_params ret = cctxParams;
-    ret.cParams = params.cParams;
-    ret.fParams = params.fParams;
-    ret.compressionLevel = ZSTD_CLEVEL_CUSTOM;
-    return ret;
-}
-
-#define CLAMPCHECK(val,min,max) {            \
-    if (((val)<(min)) | ((val)>(max))) {     \
-        return ERROR(parameter_outOfBound);  \
-}   }
-
-size_t ZSTD_CCtx_setParameter(ZSTD_CCtx* cctx, ZSTD_cParameter param, unsigned value)
-{
-    DEBUGLOG(4, "ZSTD_CCtx_setParameter (%u, %u)", (U32)param, value);
-    if (cctx->streamStage != zcss_init) return ERROR(stage_wrong);
-
-    switch(param)
-    {
-    case ZSTD_p_format :
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_compressionLevel:
-        if (cctx->cdict) return ERROR(stage_wrong);
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_windowLog:
-    case ZSTD_p_hashLog:
-    case ZSTD_p_chainLog:
-    case ZSTD_p_searchLog:
-    case ZSTD_p_minMatch:
-    case ZSTD_p_targetLength:
-    case ZSTD_p_compressionStrategy:
-        if (cctx->cdict) return ERROR(stage_wrong);
-        if (value>0) ZSTD_cLevelToCParams(cctx);  /* Can optimize if srcSize is known */
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_contentSizeFlag:
-    case ZSTD_p_checksumFlag:
-    case ZSTD_p_dictIDFlag:
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_forceMaxWindow :  /* Force back-references to remain < windowSize,
-                                   * even when referencing into Dictionary content.
-                                   * default : 0 when using a CDict, 1 when using a Prefix */
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_nbThreads:
-        if ((value > 1) && cctx->staticSize) {
-            return ERROR(parameter_unsupported);  /* MT not compatible with static alloc */
-        }
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_jobSize:
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_overlapSizeLog:
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_enableLongDistanceMatching:
-        if (cctx->cdict) return ERROR(stage_wrong);
-        if (value>0) ZSTD_cLevelToCParams(cctx);
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    case ZSTD_p_ldmHashLog:
-    case ZSTD_p_ldmMinMatch:
-    case ZSTD_p_ldmBucketSizeLog:
-    case ZSTD_p_ldmHashEveryLog:
-        if (cctx->cdict) return ERROR(stage_wrong);
-        return ZSTD_CCtxParam_setParameter(&cctx->requestedParams, param, value);
-
-    default: return ERROR(parameter_unsupported);
-    }
-}
-
-size_t ZSTD_CCtxParam_setParameter(
-        ZSTD_CCtx_params* CCtxParams, ZSTD_cParameter param, unsigned value)
-{
-    DEBUGLOG(4, "ZSTD_CCtxParam_setParameter (%u, %u)", (U32)param, value);
-    switch(param)
-    {
-    case ZSTD_p_format :
-        if (value > (unsigned)ZSTD_f_zstd1_magicless)
-            return ERROR(parameter_unsupported);
-        CCtxParams->format = (ZSTD_format_e)value;
-        return (size_t)CCtxParams->format;
-
-    case ZSTD_p_compressionLevel :
-        if ((int)value > ZSTD_maxCLevel()) value = ZSTD_maxCLevel();
-        if (value)  /* 0 : does not change current level */
-            CCtxParams->compressionLevel = value;
-        return CCtxParams->compressionLevel;
-
-    case ZSTD_p_windowLog :
-        DEBUGLOG(4, "ZSTD_CCtxParam_setParameter: set windowLog=%u", value);
-        if (value) {  /* 0 : does not change current windowLog */
-            CLAMPCHECK(value, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.windowLog = value;
-        }
-        return CCtxParams->cParams.windowLog;
-
-    case ZSTD_p_hashLog :
-        if (value) { /* 0 : does not change current hashLog */
-            CLAMPCHECK(value, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.hashLog = value;
-        }
-        return CCtxParams->cParams.hashLog;
-
-    case ZSTD_p_chainLog :
-        if (value) { /* 0 : does not change current chainLog */
-            CLAMPCHECK(value, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.chainLog = value;
-        }
-        return CCtxParams->cParams.chainLog;
-
-    case ZSTD_p_searchLog :
-        if (value) { /* 0 : does not change current searchLog */
-            CLAMPCHECK(value, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.searchLog = value;
-        }
-        return value;
-
-    case ZSTD_p_minMatch :
-        if (value) { /* 0 : does not change current minMatch length */
-            CLAMPCHECK(value, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.searchLength = value;
-        }
-        return CCtxParams->cParams.searchLength;
-
-    case ZSTD_p_targetLength :
-        if (value) { /* 0 : does not change current sufficient_len */
-            CLAMPCHECK(value, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.targetLength = value;
-        }
-        return CCtxParams->cParams.targetLength;
-
-    case ZSTD_p_compressionStrategy :
-        if (value) { /* 0 : does not change currentstrategy */
-            CLAMPCHECK(value, (unsigned)ZSTD_fast, (unsigned)ZSTD_btultra);
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.strategy = (ZSTD_strategy)value;
-        }
-        return (size_t)CCtxParams->cParams.strategy;
-
-    case ZSTD_p_contentSizeFlag :
-        /* Content size written in frame header _when known_ (default:1) */
-        DEBUGLOG(4, "set content size flag = %u", (value>0));
-        CCtxParams->fParams.contentSizeFlag = value > 0;
-        return CCtxParams->fParams.contentSizeFlag;
-
-    case ZSTD_p_checksumFlag :
-        /* A 32-bits content checksum will be calculated and written at end of frame (default:0) */
-        CCtxParams->fParams.checksumFlag = value > 0;
-        return CCtxParams->fParams.checksumFlag;
-
-    case ZSTD_p_dictIDFlag : /* When applicable, dictionary's dictID is provided in frame header (default:1) */
-        DEBUGLOG(4, "set dictIDFlag = %u", (value>0));
-        CCtxParams->fParams.noDictIDFlag = (value == 0);
-        return !CCtxParams->fParams.noDictIDFlag;
-
-    case ZSTD_p_forceMaxWindow :
-        CCtxParams->forceWindow = (value > 0);
-        return CCtxParams->forceWindow;
-
-    case ZSTD_p_nbThreads :
-        if (value == 0) return CCtxParams->nbThreads;
-#ifndef ZSTD_MULTITHREAD
-        if (value > 1) return ERROR(parameter_unsupported);
-        return 1;
-#else
-        return ZSTDMT_CCtxParam_setNbThreads(CCtxParams, value);
-#endif
-
-    case ZSTD_p_jobSize :
-#ifndef ZSTD_MULTITHREAD
-        return ERROR(parameter_unsupported);
-#else
-        if (CCtxParams->nbThreads <= 1) return ERROR(parameter_unsupported);
-        return ZSTDMT_CCtxParam_setMTCtxParameter(CCtxParams, ZSTDMT_p_jobSize, value);
-#endif
-
-    case ZSTD_p_overlapSizeLog :
-#ifndef ZSTD_MULTITHREAD
-        return ERROR(parameter_unsupported);
-#else
-        if (CCtxParams->nbThreads <= 1) return ERROR(parameter_unsupported);
-        return ZSTDMT_CCtxParam_setMTCtxParameter(CCtxParams, ZSTDMT_p_overlapSectionLog, value);
-#endif
-
-    case ZSTD_p_enableLongDistanceMatching :
-        if (value) {
-            ZSTD_cLevelToCCtxParams(CCtxParams);
-            CCtxParams->cParams.windowLog = ZSTD_LDM_DEFAULT_WINDOW_LOG;
-        }
-        return ZSTD_ldm_initializeParameters(&CCtxParams->ldmParams, value);
-
-    case ZSTD_p_ldmHashLog :
-        if (value) { /* 0 : does not change current ldmHashLog */
-            CLAMPCHECK(value, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-            CCtxParams->ldmParams.hashLog = value;
-        }
-        return CCtxParams->ldmParams.hashLog;
-
-    case ZSTD_p_ldmMinMatch :
-        if (value) { /* 0 : does not change current ldmMinMatch */
-            CLAMPCHECK(value, ZSTD_LDM_MINMATCH_MIN, ZSTD_LDM_MINMATCH_MAX);
-            CCtxParams->ldmParams.minMatchLength = value;
-        }
-        return CCtxParams->ldmParams.minMatchLength;
-
-    case ZSTD_p_ldmBucketSizeLog :
-        if (value > ZSTD_LDM_BUCKETSIZELOG_MAX) {
-            return ERROR(parameter_outOfBound);
-        }
-        CCtxParams->ldmParams.bucketSizeLog = value;
-        return value;
-
-    case ZSTD_p_ldmHashEveryLog :
-        if (value > ZSTD_WINDOWLOG_MAX - ZSTD_HASHLOG_MIN) {
-            return ERROR(parameter_outOfBound);
-        }
-        CCtxParams->ldmParams.hashEveryLog = value;
-        return value;
-
-    default: return ERROR(parameter_unsupported);
-    }
-}
-
-/** ZSTD_CCtx_setParametersUsingCCtxParams() :
- *  just applies `params` into `cctx`
- *  no action is performed, parameters are merely stored.
- */
-size_t ZSTD_CCtx_setParametersUsingCCtxParams(
-        ZSTD_CCtx* cctx, const ZSTD_CCtx_params* params)
-{
-    if (cctx->streamStage != zcss_init) return ERROR(stage_wrong);
-    if (cctx->cdict) return ERROR(stage_wrong);
-
-    cctx->requestedParams = *params;
-
-    return 0;
-}
-
-ZSTDLIB_API size_t ZSTD_CCtx_setPledgedSrcSize(ZSTD_CCtx* cctx, unsigned long long pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_CCtx_setPledgedSrcSize to %u bytes", (U32)pledgedSrcSize);
-    if (cctx->streamStage != zcss_init) return ERROR(stage_wrong);
-    cctx->pledgedSrcSizePlusOne = pledgedSrcSize+1;
-    return 0;
-}
-
-size_t ZSTD_CCtx_loadDictionary_advanced(
-        ZSTD_CCtx* cctx, const void* dict, size_t dictSize,
-        ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_dictMode_e dictMode)
-{
-    if (cctx->streamStage != zcss_init) return ERROR(stage_wrong);
-    if (cctx->staticSize) return ERROR(memory_allocation);  /* no malloc for static CCtx */
-    DEBUGLOG(4, "ZSTD_CCtx_loadDictionary_advanced (size: %u)", (U32)dictSize);
-    ZSTD_freeCDict(cctx->cdictLocal);  /* in case one already exists */
-    if (dict==NULL || dictSize==0) {   /* no dictionary mode */
-        cctx->cdictLocal = NULL;
-        cctx->cdict = NULL;
-    } else {
-        ZSTD_compressionParameters const cParams =
-                ZSTD_getCParamsFromCCtxParams(cctx->requestedParams, cctx->pledgedSrcSizePlusOne-1, dictSize);
-        cctx->cdictLocal = ZSTD_createCDict_advanced(
-                                dict, dictSize,
-                                dictLoadMethod, dictMode,
-                                cParams, cctx->customMem);
-        cctx->cdict = cctx->cdictLocal;
-        if (cctx->cdictLocal == NULL)
-            return ERROR(memory_allocation);
-    }
-    return 0;
-}
-
-ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary_byReference(
-      ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
-{
-    return ZSTD_CCtx_loadDictionary_advanced(
-            cctx, dict, dictSize, ZSTD_dlm_byRef, ZSTD_dm_auto);
-}
-
-ZSTDLIB_API size_t ZSTD_CCtx_loadDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
-{
-    return ZSTD_CCtx_loadDictionary_advanced(
-            cctx, dict, dictSize, ZSTD_dlm_byCopy, ZSTD_dm_auto);
-}
-
-
-size_t ZSTD_CCtx_refCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
-{
-    if (cctx->streamStage != zcss_init) return ERROR(stage_wrong);
-    cctx->cdict = cdict;
-    memset(&cctx->prefixDict, 0, sizeof(cctx->prefixDict));  /* exclusive */
-    return 0;
-}
-
-size_t ZSTD_CCtx_refPrefix(ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize)
-{
-    return ZSTD_CCtx_refPrefix_advanced(cctx, prefix, prefixSize, ZSTD_dm_rawContent);
-}
-
-size_t ZSTD_CCtx_refPrefix_advanced(
-        ZSTD_CCtx* cctx, const void* prefix, size_t prefixSize, ZSTD_dictMode_e dictMode)
-{
-    if (cctx->streamStage != zcss_init) return ERROR(stage_wrong);
-    cctx->cdict = NULL;   /* prefix discards any prior cdict */
-    cctx->prefixDict.dict = prefix;
-    cctx->prefixDict.dictSize = prefixSize;
-    cctx->prefixDict.dictMode = dictMode;
-    return 0;
-}
-
-static void ZSTD_startNewCompression(ZSTD_CCtx* cctx)
-{
-    cctx->streamStage = zcss_init;
-    cctx->pledgedSrcSizePlusOne = 0;
-}
-
-/*! ZSTD_CCtx_reset() :
- *  Also dumps dictionary */
-void ZSTD_CCtx_reset(ZSTD_CCtx* cctx)
-{
-    ZSTD_startNewCompression(cctx);
-    cctx->cdict = NULL;
-}
-
-/** ZSTD_checkCParams() :
-    control CParam values remain within authorized range.
-    @return : 0, or an error code if one value is beyond authorized range */
-size_t ZSTD_checkCParams(ZSTD_compressionParameters cParams)
-{
-    CLAMPCHECK(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
-    CLAMPCHECK(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
-    CLAMPCHECK(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-    CLAMPCHECK(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-    CLAMPCHECK(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
-    CLAMPCHECK(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
-    if ((U32)(cParams.strategy) > (U32)ZSTD_btultra)
-        return ERROR(parameter_unsupported);
-    return 0;
-}
-
-/** ZSTD_clampCParams() :
- *  make CParam values within valid range.
- *  @return : valid CParams */
-static ZSTD_compressionParameters ZSTD_clampCParams(ZSTD_compressionParameters cParams)
-{
-#   define CLAMP(val,min,max) {      \
-        if (valmax) val=max;   \
-    }
-    CLAMP(cParams.windowLog, ZSTD_WINDOWLOG_MIN, ZSTD_WINDOWLOG_MAX);
-    CLAMP(cParams.chainLog, ZSTD_CHAINLOG_MIN, ZSTD_CHAINLOG_MAX);
-    CLAMP(cParams.hashLog, ZSTD_HASHLOG_MIN, ZSTD_HASHLOG_MAX);
-    CLAMP(cParams.searchLog, ZSTD_SEARCHLOG_MIN, ZSTD_SEARCHLOG_MAX);
-    CLAMP(cParams.searchLength, ZSTD_SEARCHLENGTH_MIN, ZSTD_SEARCHLENGTH_MAX);
-    CLAMP(cParams.targetLength, ZSTD_TARGETLENGTH_MIN, ZSTD_TARGETLENGTH_MAX);
-    if ((U32)(cParams.strategy) > (U32)ZSTD_btultra) cParams.strategy = ZSTD_btultra;
-    return cParams;
-}
-
-/** ZSTD_cycleLog() :
- *  condition for correct operation : hashLog > 1 */
-static U32 ZSTD_cycleLog(U32 hashLog, ZSTD_strategy strat)
-{
-    U32 const btScale = ((U32)strat >= (U32)ZSTD_btlazy2);
-    return hashLog - btScale;
-}
-
-/** ZSTD_adjustCParams_internal() :
-    optimize `cPar` for a given input (`srcSize` and `dictSize`).
-    mostly downsizing to reduce memory consumption and initialization latency.
-    Both `srcSize` and `dictSize` are optional (use 0 if unknown).
-    Note : cPar is considered validated at this stage. Use ZSTD_checkCParams() to ensure that condition. */
-ZSTD_compressionParameters ZSTD_adjustCParams_internal(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize)
-{
-    static const U64 minSrcSize = 513; /* (1<<9) + 1 */
-    static const U64 maxWindowResize = 1ULL << (ZSTD_WINDOWLOG_MAX-1);
-    assert(ZSTD_checkCParams(cPar)==0);
-
-    if (dictSize && (srcSize+1<2) /* srcSize unknown */ )
-        srcSize = minSrcSize;  /* presumed small when there is a dictionary */
-    else if (srcSize == 0)
-        srcSize = ZSTD_CONTENTSIZE_UNKNOWN;  /* 0 == unknown : presumed large */
-
-    /* resize windowLog if input is small enough, to use less memory */
-    if ( (srcSize < maxWindowResize)
-      && (dictSize < maxWindowResize) )  {
-        U32 const tSize = (U32)(srcSize + dictSize);
-        static U32 const hashSizeMin = 1 << ZSTD_HASHLOG_MIN;
-        U32 const srcLog = (tSize < hashSizeMin) ? ZSTD_HASHLOG_MIN :
-                            ZSTD_highbit32(tSize-1) + 1;
-        if (cPar.windowLog > srcLog) cPar.windowLog = srcLog;
-    }
-    if (cPar.hashLog > cPar.windowLog) cPar.hashLog = cPar.windowLog;
-    {   U32 const cycleLog = ZSTD_cycleLog(cPar.chainLog, cPar.strategy);
-        if (cycleLog > cPar.windowLog)
-            cPar.chainLog -= (cycleLog - cPar.windowLog);
-    }
-
-    if (cPar.windowLog < ZSTD_WINDOWLOG_ABSOLUTEMIN)
-        cPar.windowLog = ZSTD_WINDOWLOG_ABSOLUTEMIN;  /* required for frame header */
-
-    return cPar;
-}
-
-ZSTD_compressionParameters ZSTD_adjustCParams(ZSTD_compressionParameters cPar, unsigned long long srcSize, size_t dictSize)
-{
-    cPar = ZSTD_clampCParams(cPar);
-    return ZSTD_adjustCParams_internal(cPar, srcSize, dictSize);
-}
-
-size_t ZSTD_estimateCCtxSize_usingCCtxParams(const ZSTD_CCtx_params* params)
-{
-    /* Estimate CCtx size is supported for single-threaded compression only. */
-    if (params->nbThreads > 1) { return ERROR(GENERIC); }
-    {   ZSTD_compressionParameters const cParams =
-                ZSTD_getCParamsFromCCtxParams(*params, 0, 0);
-        size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, (size_t)1 << cParams.windowLog);
-        U32    const divider = (cParams.searchLength==3) ? 3 : 4;
-        size_t const maxNbSeq = blockSize / divider;
-        size_t const tokenSpace = blockSize + 11*maxNbSeq;
-        size_t const chainSize =
-                (cParams.strategy == ZSTD_fast) ? 0 : ((size_t)1 << cParams.chainLog);
-        size_t const hSize = ((size_t)1) << cParams.hashLog;
-        U32    const hashLog3 = (cParams.searchLength>3) ?
-                                0 : MIN(ZSTD_HASHLOG3_MAX, cParams.windowLog);
-        size_t const h3Size = ((size_t)1) << hashLog3;
-        size_t const entropySpace = sizeof(ZSTD_entropyCTables_t);
-        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-
-        size_t const optBudget =
-                ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<ldmParams.enableLdm ?
-            ZSTD_ldm_getTableSize(params->ldmParams.hashLog,
-                                  params->ldmParams.bucketSizeLog) : 0;
-
-        size_t const neededSpace = entropySpace + tableSpace + tokenSpace +
-                                   optSpace + ldmSpace;
-
-        DEBUGLOG(5, "sizeof(ZSTD_CCtx) : %u", (U32)sizeof(ZSTD_CCtx));
-        DEBUGLOG(5, "estimate workSpace : %u", (U32)neededSpace);
-        return sizeof(ZSTD_CCtx) + neededSpace;
-    }
-}
-
-size_t ZSTD_estimateCCtxSize_usingCParams(ZSTD_compressionParameters cParams)
-{
-    ZSTD_CCtx_params const params = ZSTD_makeCCtxParamsFromCParams(cParams);
-    return ZSTD_estimateCCtxSize_usingCCtxParams(¶ms);
-}
-
-size_t ZSTD_estimateCCtxSize(int compressionLevel)
-{
-    ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, 0, 0);
-    return ZSTD_estimateCCtxSize_usingCParams(cParams);
-}
-
-size_t ZSTD_estimateCStreamSize_usingCCtxParams(const ZSTD_CCtx_params* params)
-{
-    if (params->nbThreads > 1) { return ERROR(GENERIC); }
-    {   size_t const CCtxSize = ZSTD_estimateCCtxSize_usingCCtxParams(params);
-        size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, (size_t)1 << params->cParams.windowLog);
-        size_t const inBuffSize = ((size_t)1 << params->cParams.windowLog) + blockSize;
-        size_t const outBuffSize = ZSTD_compressBound(blockSize) + 1;
-        size_t const streamingSize = inBuffSize + outBuffSize;
-
-        return CCtxSize + streamingSize;
-    }
-}
-
-size_t ZSTD_estimateCStreamSize_usingCParams(ZSTD_compressionParameters cParams)
-{
-    ZSTD_CCtx_params const params = ZSTD_makeCCtxParamsFromCParams(cParams);
-    return ZSTD_estimateCStreamSize_usingCCtxParams(¶ms);
-}
-
-size_t ZSTD_estimateCStreamSize(int compressionLevel) {
-    ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, 0, 0);
-    return ZSTD_estimateCStreamSize_usingCParams(cParams);
-}
-
-static U32 ZSTD_equivalentCParams(ZSTD_compressionParameters cParams1,
-                                  ZSTD_compressionParameters cParams2)
-{
-    return (cParams1.hashLog  == cParams2.hashLog)
-         & (cParams1.chainLog == cParams2.chainLog)
-         & (cParams1.strategy == cParams2.strategy)   /* opt parser space */
-         & ((cParams1.searchLength==3) == (cParams2.searchLength==3));  /* hashlog3 space */
-}
-
-/** The parameters are equivalent if ldm is not enabled in both sets or
- *  all the parameters are equivalent. */
-static U32 ZSTD_equivalentLdmParams(ldmParams_t ldmParams1,
-                                    ldmParams_t ldmParams2)
-{
-    return (!ldmParams1.enableLdm && !ldmParams2.enableLdm) ||
-           (ldmParams1.enableLdm == ldmParams2.enableLdm &&
-            ldmParams1.hashLog == ldmParams2.hashLog &&
-            ldmParams1.bucketSizeLog == ldmParams2.bucketSizeLog &&
-            ldmParams1.minMatchLength == ldmParams2.minMatchLength &&
-            ldmParams1.hashEveryLog == ldmParams2.hashEveryLog);
-}
-
-typedef enum { ZSTDb_not_buffered, ZSTDb_buffered } ZSTD_buffered_policy_e;
-
-/* ZSTD_sufficientBuff() :
- * check internal buffers exist for streaming if buffPol == ZSTDb_buffered .
- * Note : they are assumed to be correctly sized if ZSTD_equivalentCParams()==1 */
-static U32 ZSTD_sufficientBuff(size_t bufferSize1, size_t blockSize1,
-                            ZSTD_buffered_policy_e buffPol2,
-                            ZSTD_compressionParameters cParams2,
-                            U64 pledgedSrcSize)
-{
-    size_t const windowSize2 = MAX(1, (size_t)MIN(((U64)1 << cParams2.windowLog), pledgedSrcSize));
-    size_t const blockSize2 = MIN(ZSTD_BLOCKSIZE_MAX, windowSize2);
-    size_t const neededBufferSize2 = (buffPol2==ZSTDb_buffered) ? windowSize2 + blockSize2 : 0;
-    DEBUGLOG(4, "ZSTD_sufficientBuff: windowSize2=%u from wlog=%u",
-                (U32)windowSize2, cParams2.windowLog);
-    DEBUGLOG(4, "ZSTD_sufficientBuff: blockSize2 %u <=? blockSize1 %u",
-                (U32)blockSize2, (U32)blockSize1);
-    return (blockSize2 <= blockSize1) /* seqStore space depends on blockSize */
-         & (neededBufferSize2 <= bufferSize1);
-}
-
-/** Equivalence for resetCCtx purposes */
-static U32 ZSTD_equivalentParams(ZSTD_CCtx_params params1,
-                                 ZSTD_CCtx_params params2,
-                                 size_t buffSize1, size_t blockSize1,
-                                 ZSTD_buffered_policy_e buffPol2,
-                                 U64 pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_equivalentParams: pledgedSrcSize=%u", (U32)pledgedSrcSize);
-    return ZSTD_equivalentCParams(params1.cParams, params2.cParams) &&
-           ZSTD_equivalentLdmParams(params1.ldmParams, params2.ldmParams) &&
-           ZSTD_sufficientBuff(buffSize1, blockSize1, buffPol2, params2.cParams, pledgedSrcSize);
-}
-
-/*! ZSTD_continueCCtx() :
- *  reuse CCtx without reset (note : requires no dictionary) */
-static size_t ZSTD_continueCCtx(ZSTD_CCtx* cctx, ZSTD_CCtx_params params, U64 pledgedSrcSize)
-{
-    U32 const end = (U32)(cctx->nextSrc - cctx->base);
-    size_t const windowSize = MAX(1, (size_t)MIN(((U64)1 << params.cParams.windowLog), pledgedSrcSize));
-    size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, windowSize);
-    DEBUGLOG(4, "ZSTD_continueCCtx");
-
-    cctx->blockSize = blockSize;   /* previous block size could be different even for same windowLog, due to pledgedSrcSize */
-    cctx->appliedParams = params;
-    cctx->pledgedSrcSizePlusOne = pledgedSrcSize+1;
-    cctx->consumedSrcSize = 0;
-    if (pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN)
-        cctx->appliedParams.fParams.contentSizeFlag = 0;
-    DEBUGLOG(4, "pledged content size : %u ; flag : %u",
-        (U32)pledgedSrcSize, cctx->appliedParams.fParams.contentSizeFlag);
-    cctx->lowLimit = end;
-    cctx->dictLimit = end;
-    cctx->nextToUpdate = end+1;
-    cctx->stage = ZSTDcs_init;
-    cctx->dictID = 0;
-    cctx->loadedDictEnd = 0;
-    { int i; for (i=0; iseqStore.rep[i] = repStartValue[i]; }
-    cctx->optState.litLengthSum = 0;  /* force reset of btopt stats */
-    XXH64_reset(&cctx->xxhState, 0);
-    return 0;
-}
-
-typedef enum { ZSTDcrp_continue, ZSTDcrp_noMemset } ZSTD_compResetPolicy_e;
-
-/*! ZSTD_resetCCtx_internal() :
-    note : `params` are assumed fully validated at this stage */
-static size_t ZSTD_resetCCtx_internal(ZSTD_CCtx* zc,
-                                      ZSTD_CCtx_params params, U64 pledgedSrcSize,
-                                      ZSTD_compResetPolicy_e const crp,
-                                      ZSTD_buffered_policy_e const zbuff)
-{
-    DEBUGLOG(4, "ZSTD_resetCCtx_internal: pledgedSrcSize=%u, wlog=%u",
-                (U32)pledgedSrcSize, params.cParams.windowLog);
-    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
-
-    if (crp == ZSTDcrp_continue) {
-        if (ZSTD_equivalentParams(zc->appliedParams, params,
-                                zc->inBuffSize, zc->blockSize,
-                                zbuff, pledgedSrcSize)) {
-            DEBUGLOG(4, "ZSTD_equivalentParams()==1 -> continue mode (wLog1=%u, blockSize1=%u)",
-                        zc->appliedParams.cParams.windowLog, (U32)zc->blockSize);
-            assert(!(params.ldmParams.enableLdm &&
-                     params.ldmParams.hashEveryLog == ZSTD_LDM_HASHEVERYLOG_NOTSET));
-            zc->entropy->hufCTable_repeatMode = HUF_repeat_none;
-            zc->entropy->offcode_repeatMode = FSE_repeat_none;
-            zc->entropy->matchlength_repeatMode = FSE_repeat_none;
-            zc->entropy->litlength_repeatMode = FSE_repeat_none;
-            return ZSTD_continueCCtx(zc, params, pledgedSrcSize);
-    }   }
-    DEBUGLOG(4, "ZSTD_equivalentParams()==0 -> reset CCtx");
-
-    if (params.ldmParams.enableLdm) {
-        /* Adjust long distance matching parameters */
-        ZSTD_ldm_adjustParameters(¶ms.ldmParams, params.cParams.windowLog);
-        assert(params.ldmParams.hashLog >= params.ldmParams.bucketSizeLog);
-        assert(params.ldmParams.hashEveryLog < 32);
-        zc->ldmState.hashPower =
-                ZSTD_ldm_getHashPower(params.ldmParams.minMatchLength);
-    }
-
-    {   size_t const windowSize = MAX(1, (size_t)MIN(((U64)1 << params.cParams.windowLog), pledgedSrcSize));
-        size_t const blockSize = MIN(ZSTD_BLOCKSIZE_MAX, windowSize);
-        U32    const divider = (params.cParams.searchLength==3) ? 3 : 4;
-        size_t const maxNbSeq = blockSize / divider;
-        size_t const tokenSpace = blockSize + 11*maxNbSeq;
-        size_t const chainSize = (params.cParams.strategy == ZSTD_fast) ?
-                                0 : ((size_t)1 << params.cParams.chainLog);
-        size_t const hSize = ((size_t)1) << params.cParams.hashLog;
-        U32    const hashLog3 = (params.cParams.searchLength>3) ?
-                                0 : MIN(ZSTD_HASHLOG3_MAX, params.cParams.windowLog);
-        size_t const h3Size = ((size_t)1) << hashLog3;
-        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-        size_t const buffOutSize = (zbuff==ZSTDb_buffered) ? ZSTD_compressBound(blockSize)+1 : 0;
-        size_t const buffInSize = (zbuff==ZSTDb_buffered) ? windowSize + blockSize : 0;
-        void* ptr;
-
-        /* Check if workSpace is large enough, alloc a new one if needed */
-        {   size_t const entropySpace = sizeof(ZSTD_entropyCTables_t);
-            size_t const optPotentialSpace = ((MaxML+1) + (MaxLL+1) + (MaxOff+1) + (1<>10), (U32)(tableSpace>>10), (U32)(bufferSpace>>10));
-            DEBUGLOG(4, "chainSize: %u - hSize: %u - h3Size: %u - windowSize: %u - blockSize: %u",
-                        (U32)chainSize, (U32)hSize, (U32)h3Size, (U32)windowSize, (U32)blockSize);
-
-            if (zc->workSpaceSize < neededSpace) {  /* too small : resize */
-                DEBUGLOG(4, "Need to update workSpaceSize from %uK to %uK",
-                            (unsigned)(zc->workSpaceSize>>10),
-                            (unsigned)(neededSpace>>10));
-                /* static cctx : no resize, error out */
-                if (zc->staticSize) return ERROR(memory_allocation);
-
-                zc->workSpaceSize = 0;
-                ZSTD_free(zc->workSpace, zc->customMem);
-                zc->workSpace = ZSTD_malloc(neededSpace, zc->customMem);
-                if (zc->workSpace == NULL) return ERROR(memory_allocation);
-                zc->workSpaceSize = neededSpace;
-                ptr = zc->workSpace;
-
-                /* entropy space */
-                assert(((size_t)zc->workSpace & 3) == 0);   /* ensure correct alignment */
-                assert(zc->workSpaceSize >= sizeof(ZSTD_entropyCTables_t));
-                zc->entropy = (ZSTD_entropyCTables_t*)zc->workSpace;
-        }   }
-
-        /* init params */
-        zc->appliedParams = params;
-        zc->pledgedSrcSizePlusOne = pledgedSrcSize+1;
-        zc->consumedSrcSize = 0;
-        if (pledgedSrcSize == ZSTD_CONTENTSIZE_UNKNOWN)
-            zc->appliedParams.fParams.contentSizeFlag = 0;
-        DEBUGLOG(4, "pledged content size : %u ; flag : %u",
-            (U32)pledgedSrcSize, zc->appliedParams.fParams.contentSizeFlag);
-        zc->blockSize = blockSize;
-
-        XXH64_reset(&zc->xxhState, 0);
-        zc->stage = ZSTDcs_init;
-        zc->dictID = 0;
-        zc->loadedDictEnd = 0;
-        zc->entropy->hufCTable_repeatMode = HUF_repeat_none;
-        zc->entropy->offcode_repeatMode = FSE_repeat_none;
-        zc->entropy->matchlength_repeatMode = FSE_repeat_none;
-        zc->entropy->litlength_repeatMode = FSE_repeat_none;
-        zc->nextToUpdate = 1;
-        zc->nextSrc = NULL;
-        zc->base = NULL;
-        zc->dictBase = NULL;
-        zc->dictLimit = 0;
-        zc->lowLimit = 0;
-        { int i; for (i=0; iseqStore.rep[i] = repStartValue[i]; }
-        zc->hashLog3 = hashLog3;
-        zc->optState.litLengthSum = 0;
-
-        ptr = zc->entropy + 1;
-
-        /* opt parser space */
-        if ((params.cParams.strategy == ZSTD_btopt) || (params.cParams.strategy == ZSTD_btultra)) {
-            DEBUGLOG(4, "reserving optimal parser space");
-            assert(((size_t)ptr & 3) == 0);  /* ensure ptr is properly aligned */
-            zc->optState.litFreq = (U32*)ptr;
-            zc->optState.litLengthFreq = zc->optState.litFreq + (1<optState.matchLengthFreq = zc->optState.litLengthFreq + (MaxLL+1);
-            zc->optState.offCodeFreq = zc->optState.matchLengthFreq + (MaxML+1);
-            ptr = zc->optState.offCodeFreq + (MaxOff+1);
-            zc->optState.matchTable = (ZSTD_match_t*)ptr;
-            ptr = zc->optState.matchTable + ZSTD_OPT_NUM+1;
-            zc->optState.priceTable = (ZSTD_optimal_t*)ptr;
-            ptr = zc->optState.priceTable + ZSTD_OPT_NUM+1;
-        }
-
-        /* ldm hash table */
-        /* initialize bucketOffsets table later for pointer alignment */
-        if (params.ldmParams.enableLdm) {
-            size_t const ldmHSize = ((size_t)1) << params.ldmParams.hashLog;
-            memset(ptr, 0, ldmHSize * sizeof(ldmEntry_t));
-            assert(((size_t)ptr & 3) == 0); /* ensure ptr is properly aligned */
-            zc->ldmState.hashTable = (ldmEntry_t*)ptr;
-            ptr = zc->ldmState.hashTable + ldmHSize;
-        }
-
-        /* table Space */
-        DEBUGLOG(4, "reset table : %u", crp!=ZSTDcrp_noMemset);
-        if (crp!=ZSTDcrp_noMemset) memset(ptr, 0, tableSpace);   /* reset tables only */
-        assert(((size_t)ptr & 3) == 0);  /* ensure ptr is properly aligned */
-        zc->hashTable = (U32*)(ptr);
-        zc->chainTable = zc->hashTable + hSize;
-        zc->hashTable3 = zc->chainTable + chainSize;
-        ptr = zc->hashTable3 + h3Size;
-
-        /* sequences storage */
-        zc->seqStore.sequencesStart = (seqDef*)ptr;
-        ptr = zc->seqStore.sequencesStart + maxNbSeq;
-        zc->seqStore.llCode = (BYTE*) ptr;
-        zc->seqStore.mlCode = zc->seqStore.llCode + maxNbSeq;
-        zc->seqStore.ofCode = zc->seqStore.mlCode + maxNbSeq;
-        zc->seqStore.litStart = zc->seqStore.ofCode + maxNbSeq;
-        ptr = zc->seqStore.litStart + blockSize;
-
-        /* ldm bucketOffsets table */
-        if (params.ldmParams.enableLdm) {
-            size_t const ldmBucketSize =
-                  ((size_t)1) << (params.ldmParams.hashLog -
-                                  params.ldmParams.bucketSizeLog);
-            memset(ptr, 0, ldmBucketSize);
-            zc->ldmState.bucketOffsets = (BYTE*)ptr;
-            ptr = zc->ldmState.bucketOffsets + ldmBucketSize;
-        }
-
-        /* buffers */
-        zc->inBuffSize = buffInSize;
-        zc->inBuff = (char*)ptr;
-        zc->outBuffSize = buffOutSize;
-        zc->outBuff = zc->inBuff + buffInSize;
-
-        return 0;
-    }
-}
-
-/* ZSTD_invalidateRepCodes() :
- * ensures next compression will not use repcodes from previous block.
- * Note : only works with regular variant;
- *        do not use with extDict variant ! */
-void ZSTD_invalidateRepCodes(ZSTD_CCtx* cctx) {
-    int i;
-    for (i=0; iseqStore.rep[i] = 0;
-}
-
-
-/*! ZSTD_copyCCtx_internal() :
- *  Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
- *  Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
- *  The "context", in this case, refers to the hash and chain tables,
- *  entropy tables, and dictionary references.
- * `windowLog` value is enforced if != 0, otherwise value is copied from srcCCtx.
- * @return : 0, or an error code */
-static size_t ZSTD_copyCCtx_internal(ZSTD_CCtx* dstCCtx,
-                            const ZSTD_CCtx* srcCCtx,
-                            unsigned windowLog,
-                            ZSTD_frameParameters fParams,
-                            U64 pledgedSrcSize,
-                            ZSTD_buffered_policy_e zbuff)
-{
-    DEBUGLOG(5, "ZSTD_copyCCtx_internal");
-    if (srcCCtx->stage!=ZSTDcs_init) return ERROR(stage_wrong);
-
-    memcpy(&dstCCtx->customMem, &srcCCtx->customMem, sizeof(ZSTD_customMem));
-    {   ZSTD_CCtx_params params = dstCCtx->requestedParams;
-        /* Copy only compression parameters related to tables. */
-        params.cParams = srcCCtx->appliedParams.cParams;
-        if (windowLog) params.cParams.windowLog = windowLog;
-        params.fParams = fParams;
-        ZSTD_resetCCtx_internal(dstCCtx, params, pledgedSrcSize,
-                                ZSTDcrp_noMemset, zbuff);
-    }
-
-    /* copy tables */
-    {   size_t const chainSize = (srcCCtx->appliedParams.cParams.strategy == ZSTD_fast) ? 0 : ((size_t)1 << srcCCtx->appliedParams.cParams.chainLog);
-        size_t const hSize =  (size_t)1 << srcCCtx->appliedParams.cParams.hashLog;
-        size_t const h3Size = (size_t)1 << srcCCtx->hashLog3;
-        size_t const tableSpace = (chainSize + hSize + h3Size) * sizeof(U32);
-        assert((U32*)dstCCtx->chainTable == (U32*)dstCCtx->hashTable + hSize);  /* chainTable must follow hashTable */
-        assert((U32*)dstCCtx->hashTable3 == (U32*)dstCCtx->chainTable + chainSize);
-        memcpy(dstCCtx->hashTable, srcCCtx->hashTable, tableSpace);   /* presumes all tables follow each other */
-    }
-
-    /* copy dictionary offsets */
-    dstCCtx->nextToUpdate = srcCCtx->nextToUpdate;
-    dstCCtx->nextToUpdate3= srcCCtx->nextToUpdate3;
-    dstCCtx->nextSrc      = srcCCtx->nextSrc;
-    dstCCtx->base         = srcCCtx->base;
-    dstCCtx->dictBase     = srcCCtx->dictBase;
-    dstCCtx->dictLimit    = srcCCtx->dictLimit;
-    dstCCtx->lowLimit     = srcCCtx->lowLimit;
-    dstCCtx->loadedDictEnd= srcCCtx->loadedDictEnd;
-    dstCCtx->dictID       = srcCCtx->dictID;
-
-    /* copy entropy tables */
-    memcpy(dstCCtx->entropy, srcCCtx->entropy, sizeof(ZSTD_entropyCTables_t));
-    /* copy repcodes */
-    {
-        int i;
-        for (i = 0; i < ZSTD_REP_NUM; ++i)
-            dstCCtx->seqStore.rep[i] = srcCCtx->seqStore.rep[i];
-    }
-
-    return 0;
-}
-
-/*! ZSTD_copyCCtx() :
- *  Duplicate an existing context `srcCCtx` into another one `dstCCtx`.
- *  Only works during stage ZSTDcs_init (i.e. after creation, but before first call to ZSTD_compressContinue()).
- *  pledgedSrcSize==0 means "unknown".
-*   @return : 0, or an error code */
-size_t ZSTD_copyCCtx(ZSTD_CCtx* dstCCtx, const ZSTD_CCtx* srcCCtx, unsigned long long pledgedSrcSize)
-{
-    ZSTD_frameParameters fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
-    ZSTD_buffered_policy_e const zbuff = (ZSTD_buffered_policy_e)(srcCCtx->inBuffSize>0);
-    ZSTD_STATIC_ASSERT((U32)ZSTDb_buffered==1);
-    if (pledgedSrcSize==0) pledgedSrcSize = ZSTD_CONTENTSIZE_UNKNOWN;
-    fParams.contentSizeFlag = (pledgedSrcSize != ZSTD_CONTENTSIZE_UNKNOWN);
-
-    return ZSTD_copyCCtx_internal(dstCCtx, srcCCtx,
-                                0 /*windowLog from srcCCtx*/, fParams, pledgedSrcSize,
-                                zbuff);
-}
-
-
-/*! ZSTD_reduceTable() :
- *  reduce table indexes by `reducerValue` */
-static void ZSTD_reduceTable (U32* const table, U32 const size, U32 const reducerValue)
-{
-    U32 u;
-    for (u=0 ; u < size ; u++) {
-        if (table[u] < reducerValue) table[u] = 0;
-        else table[u] -= reducerValue;
-    }
-}
-
-/*! ZSTD_ldm_reduceTable() :
- *  reduce table indexes by `reducerValue` */
-static void ZSTD_ldm_reduceTable(ldmEntry_t* const table, U32 const size,
-                                 U32 const reducerValue)
-{
-    U32 u;
-    for (u = 0; u < size; u++) {
-        if (table[u].offset < reducerValue) table[u].offset = 0;
-        else table[u].offset -= reducerValue;
-    }
-}
-
-/*! ZSTD_reduceIndex() :
-*   rescale all indexes to avoid future overflow (indexes are U32) */
-static void ZSTD_reduceIndex (ZSTD_CCtx* zc, const U32 reducerValue)
-{
-    { U32 const hSize = (U32)1 << zc->appliedParams.cParams.hashLog;
-      ZSTD_reduceTable(zc->hashTable, hSize, reducerValue); }
-
-    { U32 const chainSize = (zc->appliedParams.cParams.strategy == ZSTD_fast) ? 0 : ((U32)1 << zc->appliedParams.cParams.chainLog);
-      ZSTD_reduceTable(zc->chainTable, chainSize, reducerValue); }
-
-    { U32 const h3Size = (zc->hashLog3) ? (U32)1 << zc->hashLog3 : 0;
-      ZSTD_reduceTable(zc->hashTable3, h3Size, reducerValue); }
-
-    { if (zc->appliedParams.ldmParams.enableLdm) {
-          U32 const ldmHSize = (U32)1 << zc->appliedParams.ldmParams.hashLog;
-          ZSTD_ldm_reduceTable(zc->ldmState.hashTable, ldmHSize, reducerValue);
-      }
-    }
-}
-
-
-/*-*******************************************************
-*  Block entropic compression
-*********************************************************/
-
-/* See doc/zstd_compression_format.md for detailed format description */
-
-size_t ZSTD_noCompressBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    if (srcSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
-    memcpy((BYTE*)dst + ZSTD_blockHeaderSize, src, srcSize);
-    MEM_writeLE24(dst, (U32)(srcSize << 2) + (U32)bt_raw);
-    return ZSTD_blockHeaderSize+srcSize;
-}
-
-
-static size_t ZSTD_noCompressLiterals (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    BYTE* const ostart = (BYTE* const)dst;
-    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
-
-    if (srcSize + flSize > dstCapacity) return ERROR(dstSize_tooSmall);
-
-    switch(flSize)
-    {
-        case 1: /* 2 - 1 - 5 */
-            ostart[0] = (BYTE)((U32)set_basic + (srcSize<<3));
-            break;
-        case 2: /* 2 - 2 - 12 */
-            MEM_writeLE16(ostart, (U16)((U32)set_basic + (1<<2) + (srcSize<<4)));
-            break;
-        case 3: /* 2 - 2 - 20 */
-            MEM_writeLE32(ostart, (U32)((U32)set_basic + (3<<2) + (srcSize<<4)));
-            break;
-        default:   /* not necessary : flSize is {1,2,3} */
-            assert(0);
-    }
-
-    memcpy(ostart + flSize, src, srcSize);
-    return srcSize + flSize;
-}
-
-static size_t ZSTD_compressRleLiteralsBlock (void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    BYTE* const ostart = (BYTE* const)dst;
-    U32   const flSize = 1 + (srcSize>31) + (srcSize>4095);
-
-    (void)dstCapacity;  /* dstCapacity already guaranteed to be >=4, hence large enough */
-
-    switch(flSize)
-    {
-        case 1: /* 2 - 1 - 5 */
-            ostart[0] = (BYTE)((U32)set_rle + (srcSize<<3));
-            break;
-        case 2: /* 2 - 2 - 12 */
-            MEM_writeLE16(ostart, (U16)((U32)set_rle + (1<<2) + (srcSize<<4)));
-            break;
-        case 3: /* 2 - 2 - 20 */
-            MEM_writeLE32(ostart, (U32)((U32)set_rle + (3<<2) + (srcSize<<4)));
-            break;
-        default:   /* not necessary : flSize is {1,2,3} */
-            assert(0);
-    }
-
-    ostart[flSize] = *(const BYTE*)src;
-    return flSize+1;
-}
-
-
-static size_t ZSTD_minGain(size_t srcSize) { return (srcSize >> 6) + 2; }
-
-static size_t ZSTD_compressLiterals (ZSTD_entropyCTables_t * entropy,
-                                     ZSTD_strategy strategy,
-                                     void* dst, size_t dstCapacity,
-                               const void* src, size_t srcSize)
-{
-    size_t const minGain = ZSTD_minGain(srcSize);
-    size_t const lhSize = 3 + (srcSize >= 1 KB) + (srcSize >= 16 KB);
-    BYTE*  const ostart = (BYTE*)dst;
-    U32 singleStream = srcSize < 256;
-    symbolEncodingType_e hType = set_compressed;
-    size_t cLitSize;
-
-
-    /* small ? don't even attempt compression (speed opt) */
-#   define LITERAL_NOENTROPY 63
-    {   size_t const minLitSize = entropy->hufCTable_repeatMode == HUF_repeat_valid ? 6 : LITERAL_NOENTROPY;
-        if (srcSize <= minLitSize) return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-    }
-
-    if (dstCapacity < lhSize+1) return ERROR(dstSize_tooSmall);   /* not enough space for compression */
-    {   HUF_repeat repeat = entropy->hufCTable_repeatMode;
-        int const preferRepeat = strategy < ZSTD_lazy ? srcSize <= 1024 : 0;
-        if (repeat == HUF_repeat_valid && lhSize == 3) singleStream = 1;
-        cLitSize = singleStream ? HUF_compress1X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      entropy->workspace, sizeof(entropy->workspace), (HUF_CElt*)entropy->hufCTable, &repeat, preferRepeat)
-                                : HUF_compress4X_repeat(ostart+lhSize, dstCapacity-lhSize, src, srcSize, 255, 11,
-                                      entropy->workspace, sizeof(entropy->workspace), (HUF_CElt*)entropy->hufCTable, &repeat, preferRepeat);
-        if (repeat != HUF_repeat_none) { hType = set_repeat; }    /* reused the existing table */
-        else { entropy->hufCTable_repeatMode = HUF_repeat_check; }       /* now have a table to reuse */
-    }
-
-    if ((cLitSize==0) | (cLitSize >= srcSize - minGain) | ERR_isError(cLitSize)) {
-        entropy->hufCTable_repeatMode = HUF_repeat_none;
-        return ZSTD_noCompressLiterals(dst, dstCapacity, src, srcSize);
-    }
-    if (cLitSize==1) {
-        entropy->hufCTable_repeatMode = HUF_repeat_none;
-        return ZSTD_compressRleLiteralsBlock(dst, dstCapacity, src, srcSize);
-    }
-
-    /* Build header */
-    switch(lhSize)
-    {
-    case 3: /* 2 - 2 - 10 - 10 */
-        {   U32 const lhc = hType + ((!singleStream) << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<14);
-            MEM_writeLE24(ostart, lhc);
-            break;
-        }
-    case 4: /* 2 - 2 - 14 - 14 */
-        {   U32 const lhc = hType + (2 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<18);
-            MEM_writeLE32(ostart, lhc);
-            break;
-        }
-    case 5: /* 2 - 2 - 18 - 18 */
-        {   U32 const lhc = hType + (3 << 2) + ((U32)srcSize<<4) + ((U32)cLitSize<<22);
-            MEM_writeLE32(ostart, lhc);
-            ostart[4] = (BYTE)(cLitSize >> 10);
-            break;
-        }
-    default:  /* not possible : lhSize is {3,4,5} */
-        assert(0);
-    }
-    return lhSize+cLitSize;
-}
-
-
-void ZSTD_seqToCodes(const seqStore_t* seqStorePtr)
-{
-    const seqDef* const sequences = seqStorePtr->sequencesStart;
-    BYTE* const llCodeTable = seqStorePtr->llCode;
-    BYTE* const ofCodeTable = seqStorePtr->ofCode;
-    BYTE* const mlCodeTable = seqStorePtr->mlCode;
-    U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-    U32 u;
-    for (u=0; ulongLengthID==1)
-        llCodeTable[seqStorePtr->longLengthPos] = MaxLL;
-    if (seqStorePtr->longLengthID==2)
-        mlCodeTable[seqStorePtr->longLengthPos] = MaxML;
-}
-
-typedef enum {
-    ZSTD_defaultDisallowed = 0,
-    ZSTD_defaultAllowed = 1
-} ZSTD_defaultPolicy_e;
-
-MEM_STATIC
-symbolEncodingType_e ZSTD_selectEncodingType(
-        FSE_repeat* repeatMode, size_t const mostFrequent, size_t nbSeq,
-        U32 defaultNormLog, ZSTD_defaultPolicy_e const isDefaultAllowed)
-{
-#define MIN_SEQ_FOR_DYNAMIC_FSE   64
-#define MAX_SEQ_FOR_STATIC_FSE  1000
-    ZSTD_STATIC_ASSERT(ZSTD_defaultDisallowed == 0 && ZSTD_defaultAllowed != 0);
-    if ((mostFrequent == nbSeq) && (!isDefaultAllowed || nbSeq > 2)) {
-        DEBUGLOG(5, "Selected set_rle");
-        /* Prefer set_basic over set_rle when there are 2 or less symbols,
-         * since RLE uses 1 byte, but set_basic uses 5-6 bits per symbol.
-         * If basic encoding isn't possible, always choose RLE.
-         */
-        *repeatMode = FSE_repeat_check;
-        return set_rle;
-    }
-    if ( isDefaultAllowed
-      && (*repeatMode == FSE_repeat_valid) && (nbSeq < MAX_SEQ_FOR_STATIC_FSE)) {
-        DEBUGLOG(5, "Selected set_repeat");
-        return set_repeat;
-    }
-    if ( isDefaultAllowed
-      && ((nbSeq < MIN_SEQ_FOR_DYNAMIC_FSE) || (mostFrequent < (nbSeq >> (defaultNormLog-1)))) ) {
-        DEBUGLOG(5, "Selected set_basic");
-        /* The format allows default tables to be repeated, but it isn't useful.
-         * When using simple heuristics to select encoding type, we don't want
-         * to confuse these tables with dictionaries. When running more careful
-         * analysis, we don't need to waste time checking both repeating tables
-         * and default tables.
-         */
-        *repeatMode = FSE_repeat_none;
-        return set_basic;
-    }
-    DEBUGLOG(5, "Selected set_compressed");
-    *repeatMode = FSE_repeat_check;
-    return set_compressed;
-}
-
-MEM_STATIC
-size_t ZSTD_buildCTable(void* dst, size_t dstCapacity,
-        FSE_CTable* CTable, U32 FSELog, symbolEncodingType_e type,
-        U32* count, U32 max,
-        BYTE const* codeTable, size_t nbSeq,
-        S16 const* defaultNorm, U32 defaultNormLog, U32 defaultMax,
-        void* workspace, size_t workspaceSize)
-{
-    BYTE* op = (BYTE*)dst;
-    BYTE const* const oend = op + dstCapacity;
-
-    switch (type) {
-    case set_rle:
-        *op = codeTable[0];
-        CHECK_F(FSE_buildCTable_rle(CTable, (BYTE)max));
-        return 1;
-    case set_repeat:
-        return 0;
-    case set_basic:
-        CHECK_F(FSE_buildCTable_wksp(CTable, defaultNorm, defaultMax, defaultNormLog, workspace, workspaceSize));  /* note : could be pre-calculated */
-        return 0;
-    case set_compressed: {
-        S16 norm[MaxSeq + 1];
-        size_t nbSeq_1 = nbSeq;
-        const U32 tableLog = FSE_optimalTableLog(FSELog, nbSeq, max);
-        if (count[codeTable[nbSeq-1]] > 1) {
-            count[codeTable[nbSeq-1]]--;
-            nbSeq_1--;
-        }
-        assert(nbSeq_1 > 1);
-        CHECK_F(FSE_normalizeCount(norm, tableLog, count, nbSeq_1, max));
-        {   size_t const NCountSize = FSE_writeNCount(op, oend - op, norm, max, tableLog);   /* overflow protected */
-            if (FSE_isError(NCountSize)) return NCountSize;
-            CHECK_F(FSE_buildCTable_wksp(CTable, norm, max, tableLog, workspace, workspaceSize));
-            return NCountSize;
-        }
-    }
-    default: return assert(0), ERROR(GENERIC);
-    }
-}
-
-MEM_STATIC
-size_t ZSTD_encodeSequences(
-            void* dst, size_t dstCapacity,
-            FSE_CTable const* CTable_MatchLength, BYTE const* mlCodeTable,
-            FSE_CTable const* CTable_OffsetBits, BYTE const* ofCodeTable,
-            FSE_CTable const* CTable_LitLength, BYTE const* llCodeTable,
-            seqDef const* sequences, size_t nbSeq, int longOffsets)
-{
-    BIT_CStream_t blockStream;
-    FSE_CState_t  stateMatchLength;
-    FSE_CState_t  stateOffsetBits;
-    FSE_CState_t  stateLitLength;
-
-    CHECK_E(BIT_initCStream(&blockStream, dst, dstCapacity), dstSize_tooSmall); /* not enough space remaining */
-
-    /* first symbols */
-    FSE_initCState2(&stateMatchLength, CTable_MatchLength, mlCodeTable[nbSeq-1]);
-    FSE_initCState2(&stateOffsetBits,  CTable_OffsetBits,  ofCodeTable[nbSeq-1]);
-    FSE_initCState2(&stateLitLength,   CTable_LitLength,   llCodeTable[nbSeq-1]);
-    BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
-    if (MEM_32bits()) BIT_flushBits(&blockStream);
-    BIT_addBits(&blockStream, sequences[nbSeq-1].matchLength, ML_bits[mlCodeTable[nbSeq-1]]);
-    if (MEM_32bits()) BIT_flushBits(&blockStream);
-    if (longOffsets) {
-        U32 const ofBits = ofCodeTable[nbSeq-1];
-        int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
-        if (extraBits) {
-            BIT_addBits(&blockStream, sequences[nbSeq-1].offset, extraBits);
-            BIT_flushBits(&blockStream);
-        }
-        BIT_addBits(&blockStream, sequences[nbSeq-1].offset >> extraBits,
-                    ofBits - extraBits);
-    } else {
-        BIT_addBits(&blockStream, sequences[nbSeq-1].offset, ofCodeTable[nbSeq-1]);
-    }
-    BIT_flushBits(&blockStream);
-
-    {   size_t n;
-        for (n=nbSeq-2 ; n= 64-7-(LLFSELog+MLFSELog+OffFSELog)))
-                BIT_flushBits(&blockStream);                                /* (7)*/
-            BIT_addBits(&blockStream, sequences[n].litLength, llBits);
-            if (MEM_32bits() && ((llBits+mlBits)>24)) BIT_flushBits(&blockStream);
-            BIT_addBits(&blockStream, sequences[n].matchLength, mlBits);
-            if (MEM_32bits() || (ofBits+mlBits+llBits > 56)) BIT_flushBits(&blockStream);
-            if (longOffsets) {
-                int const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN-1);
-                if (extraBits) {
-                    BIT_addBits(&blockStream, sequences[n].offset, extraBits);
-                    BIT_flushBits(&blockStream);                            /* (7)*/
-                }
-                BIT_addBits(&blockStream, sequences[n].offset >> extraBits,
-                            ofBits - extraBits);                            /* 31 */
-            } else {
-                BIT_addBits(&blockStream, sequences[n].offset, ofBits);     /* 31 */
-            }
-            BIT_flushBits(&blockStream);                                    /* (7)*/
-    }   }
-
-    FSE_flushCState(&blockStream, &stateMatchLength);
-    FSE_flushCState(&blockStream, &stateOffsetBits);
-    FSE_flushCState(&blockStream, &stateLitLength);
-
-    {   size_t const streamSize = BIT_closeCStream(&blockStream);
-        if (streamSize==0) return ERROR(dstSize_tooSmall);   /* not enough space */
-        return streamSize;
-    }
-}
-
-MEM_STATIC size_t ZSTD_compressSequences_internal(seqStore_t* seqStorePtr,
-                              ZSTD_entropyCTables_t* entropy,
-                              ZSTD_compressionParameters const* cParams,
-                              void* dst, size_t dstCapacity)
-{
-    const int longOffsets = cParams->windowLog > STREAM_ACCUMULATOR_MIN;
-    U32 count[MaxSeq+1];
-    FSE_CTable* CTable_LitLength = entropy->litlengthCTable;
-    FSE_CTable* CTable_OffsetBits = entropy->offcodeCTable;
-    FSE_CTable* CTable_MatchLength = entropy->matchlengthCTable;
-    U32 LLtype, Offtype, MLtype;   /* compressed, raw or rle */
-    const seqDef* const sequences = seqStorePtr->sequencesStart;
-    const BYTE* const ofCodeTable = seqStorePtr->ofCode;
-    const BYTE* const llCodeTable = seqStorePtr->llCode;
-    const BYTE* const mlCodeTable = seqStorePtr->mlCode;
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* const oend = ostart + dstCapacity;
-    BYTE* op = ostart;
-    size_t const nbSeq = seqStorePtr->sequences - seqStorePtr->sequencesStart;
-    BYTE* seqHead;
-
-    ZSTD_STATIC_ASSERT(sizeof(entropy->workspace) >= (1<litStart;
-        size_t const litSize = seqStorePtr->lit - literals;
-        size_t const cSize = ZSTD_compressLiterals(
-                entropy, cParams->strategy, op, dstCapacity, literals, litSize);
-        if (ZSTD_isError(cSize))
-          return cSize;
-        assert(cSize <= dstCapacity);
-        op += cSize;
-    }
-
-    /* Sequences Header */
-    if ((oend-op) < 3 /*max nbSeq Size*/ + 1 /*seqHead*/) return ERROR(dstSize_tooSmall);
-    if (nbSeq < 0x7F)
-        *op++ = (BYTE)nbSeq;
-    else if (nbSeq < LONGNBSEQ)
-        op[0] = (BYTE)((nbSeq>>8) + 0x80), op[1] = (BYTE)nbSeq, op+=2;
-    else
-        op[0]=0xFF, MEM_writeLE16(op+1, (U16)(nbSeq - LONGNBSEQ)), op+=3;
-    if (nbSeq==0) return op - ostart;
-
-    /* seqHead : flags for FSE encoding type */
-    seqHead = op++;
-
-    /* convert length/distances into codes */
-    ZSTD_seqToCodes(seqStorePtr);
-    /* build CTable for Literal Lengths */
-    {   U32 max = MaxLL;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, llCodeTable, nbSeq, entropy->workspace);
-        DEBUGLOG(5, "Building LL table");
-        LLtype = ZSTD_selectEncodingType(&entropy->litlength_repeatMode, mostFrequent, nbSeq, LL_defaultNormLog, ZSTD_defaultAllowed);
-        {   size_t const countSize = ZSTD_buildCTable(op, oend - op, CTable_LitLength, LLFSELog, (symbolEncodingType_e)LLtype,
-                    count, max, llCodeTable, nbSeq, LL_defaultNorm, LL_defaultNormLog, MaxLL,
-                    entropy->workspace, sizeof(entropy->workspace));
-            if (ZSTD_isError(countSize)) return countSize;
-            op += countSize;
-    }   }
-    /* build CTable for Offsets */
-    {   U32 max = MaxOff;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, ofCodeTable, nbSeq, entropy->workspace);
-        /* We can only use the basic table if max <= DefaultMaxOff, otherwise the offsets are too large */
-        ZSTD_defaultPolicy_e const defaultPolicy = (max <= DefaultMaxOff) ? ZSTD_defaultAllowed : ZSTD_defaultDisallowed;
-        DEBUGLOG(5, "Building OF table");
-        Offtype = ZSTD_selectEncodingType(&entropy->offcode_repeatMode, mostFrequent, nbSeq, OF_defaultNormLog, defaultPolicy);
-        {   size_t const countSize = ZSTD_buildCTable(op, oend - op, CTable_OffsetBits, OffFSELog, (symbolEncodingType_e)Offtype,
-                    count, max, ofCodeTable, nbSeq, OF_defaultNorm, OF_defaultNormLog, DefaultMaxOff,
-                    entropy->workspace, sizeof(entropy->workspace));
-            if (ZSTD_isError(countSize)) return countSize;
-            op += countSize;
-    }   }
-    /* build CTable for MatchLengths */
-    {   U32 max = MaxML;
-        size_t const mostFrequent = FSE_countFast_wksp(count, &max, mlCodeTable, nbSeq, entropy->workspace);
-        DEBUGLOG(5, "Building ML table");
-        MLtype = ZSTD_selectEncodingType(&entropy->matchlength_repeatMode, mostFrequent, nbSeq, ML_defaultNormLog, ZSTD_defaultAllowed);
-        {   size_t const countSize = ZSTD_buildCTable(op, oend - op, CTable_MatchLength, MLFSELog, (symbolEncodingType_e)MLtype,
-                    count, max, mlCodeTable, nbSeq, ML_defaultNorm, ML_defaultNormLog, MaxML,
-                    entropy->workspace, sizeof(entropy->workspace));
-            if (ZSTD_isError(countSize)) return countSize;
-            op += countSize;
-    }   }
-
-    *seqHead = (BYTE)((LLtype<<6) + (Offtype<<4) + (MLtype<<2));
-
-    {   size_t const bitstreamSize = ZSTD_encodeSequences(
-                                        op, oend - op,
-                                        CTable_MatchLength, mlCodeTable,
-                                        CTable_OffsetBits, ofCodeTable,
-                                        CTable_LitLength, llCodeTable,
-                                        sequences, nbSeq,
-                                        longOffsets);
-        if (ZSTD_isError(bitstreamSize)) return bitstreamSize;
-        op += bitstreamSize;
-    }
-
-    return op - ostart;
-}
-
-MEM_STATIC size_t ZSTD_compressSequences(seqStore_t* seqStorePtr,
-                              ZSTD_entropyCTables_t* entropy,
-                              ZSTD_compressionParameters const* cParams,
-                              void* dst, size_t dstCapacity,
-                              size_t srcSize)
-{
-    size_t const cSize = ZSTD_compressSequences_internal(seqStorePtr, entropy, cParams,
-                                                         dst, dstCapacity);
-    /* If the srcSize <= dstCapacity, then there is enough space to write a
-     * raw uncompressed block. Since we ran out of space, the block must not
-     * be compressible, so fall back to a raw uncompressed block.
-     */
-    int const uncompressibleError = (cSize == ERROR(dstSize_tooSmall)) && (srcSize <= dstCapacity);
-    if (ZSTD_isError(cSize) && !uncompressibleError)
-        return cSize;
-    /* We check that dictionaries have offset codes available for the first
-     * block. After the first block, the offcode table might not have large
-     * enough codes to represent the offsets in the data.
-     */
-    if (entropy->offcode_repeatMode == FSE_repeat_valid)
-        entropy->offcode_repeatMode = FSE_repeat_check;
-
-    /* Check compressibility */
-    {   size_t const minGain = ZSTD_minGain(srcSize);  /* note : fixed formula, maybe should depend on compression level, or strategy */
-        size_t const maxCSize = srcSize - minGain;
-        if (cSize >= maxCSize || uncompressibleError) {
-            entropy->hufCTable_repeatMode = HUF_repeat_none;
-            entropy->offcode_repeatMode = FSE_repeat_none;
-            entropy->matchlength_repeatMode = FSE_repeat_none;
-            entropy->litlength_repeatMode = FSE_repeat_none;
-            return 0;  /* block not compressed */
-    }   }
-    assert(!ZSTD_isError(cSize));
-
-    /* block is compressed => confirm repcodes in history */
-    { int i; for (i=0; irep[i] = seqStorePtr->repToConfirm[i]; }
-    return cSize;
-}
-
-/* ZSTD_selectBlockCompressor() :
- * Not static, but internal use only (used by long distance matcher)
- * assumption : strat is a valid strategy */
-typedef size_t (*ZSTD_blockCompressor) (ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict)
-{
-    static const ZSTD_blockCompressor blockCompressor[2][(unsigned)ZSTD_btultra+1] = {
-        { ZSTD_compressBlock_fast  /* default for 0 */,
-          ZSTD_compressBlock_fast, ZSTD_compressBlock_doubleFast, ZSTD_compressBlock_greedy,
-          ZSTD_compressBlock_lazy, ZSTD_compressBlock_lazy2, ZSTD_compressBlock_btlazy2,
-          ZSTD_compressBlock_btopt, ZSTD_compressBlock_btultra },
-        { ZSTD_compressBlock_fast_extDict  /* default for 0 */,
-          ZSTD_compressBlock_fast_extDict, ZSTD_compressBlock_doubleFast_extDict, ZSTD_compressBlock_greedy_extDict,
-          ZSTD_compressBlock_lazy_extDict,ZSTD_compressBlock_lazy2_extDict, ZSTD_compressBlock_btlazy2_extDict,
-          ZSTD_compressBlock_btopt_extDict, ZSTD_compressBlock_btultra_extDict }
-    };
-    ZSTD_STATIC_ASSERT((unsigned)ZSTD_fast == 1);
-
-    assert((U32)strat >= (U32)ZSTD_fast);
-    assert((U32)strat <= (U32)ZSTD_btultra);
-    return blockCompressor[extDict!=0][(U32)strat];
-}
-
-static void ZSTD_storeLastLiterals(seqStore_t* seqStorePtr,
-                                   const BYTE* anchor, size_t lastLLSize)
-{
-    memcpy(seqStorePtr->lit, anchor, lastLLSize);
-    seqStorePtr->lit += lastLLSize;
-}
-
-static void ZSTD_resetSeqStore(seqStore_t* ssPtr)
-{
-    ssPtr->lit = ssPtr->litStart;
-    ssPtr->sequences = ssPtr->sequencesStart;
-    ssPtr->longLengthID = 0;
-}
-
-static size_t ZSTD_compressBlock_internal(ZSTD_CCtx* zc, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    DEBUGLOG(5, "ZSTD_compressBlock_internal : dstCapacity = %u", (U32)dstCapacity);
-    if (srcSize < MIN_CBLOCK_SIZE+ZSTD_blockHeaderSize+1)
-        return 0;   /* don't even attempt compression below a certain srcSize */
-    ZSTD_resetSeqStore(&(zc->seqStore));
-
-    /* limited update after a very long match */
-    {   const BYTE* const base = zc->base;
-        const BYTE* const istart = (const BYTE*)src;
-        const U32 current = (U32)(istart-base);
-        if (current > zc->nextToUpdate + 384)
-            zc->nextToUpdate = current - MIN(192, (U32)(current - zc->nextToUpdate - 384));
-    }
-    /* find and store sequences */
-    {   U32 const extDict = zc->lowLimit < zc->dictLimit;
-        const ZSTD_blockCompressor blockCompressor =
-            zc->appliedParams.ldmParams.enableLdm
-                ? (extDict ? ZSTD_compressBlock_ldm_extDict : ZSTD_compressBlock_ldm)
-                : ZSTD_selectBlockCompressor(zc->appliedParams.cParams.strategy, extDict);
-        size_t const lastLLSize = blockCompressor(zc, src, srcSize);
-        const BYTE* const anchor = (const BYTE*)src + srcSize - lastLLSize;
-        ZSTD_storeLastLiterals(&zc->seqStore, anchor, lastLLSize);
-    }
-    /* encode */
-    return ZSTD_compressSequences(&zc->seqStore, zc->entropy, &zc->appliedParams.cParams, dst, dstCapacity, srcSize);
-}
-
-
-/*! ZSTD_compress_frameChunk() :
-*   Compress a chunk of data into one or multiple blocks.
-*   All blocks will be terminated, all input will be consumed.
-*   Function will issue an error if there is not enough `dstCapacity` to hold the compressed content.
-*   Frame is supposed already started (header already produced)
-*   @return : compressed size, or an error code
-*/
-static size_t ZSTD_compress_frameChunk (ZSTD_CCtx* cctx,
-                                     void* dst, size_t dstCapacity,
-                               const void* src, size_t srcSize,
-                                     U32 lastFrameChunk)
-{
-    size_t blockSize = cctx->blockSize;
-    size_t remaining = srcSize;
-    const BYTE* ip = (const BYTE*)src;
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* op = ostart;
-    U32 const maxDist = (U32)1 << cctx->appliedParams.cParams.windowLog;
-    assert(cctx->appliedParams.cParams.windowLog <= 31);
-
-    DEBUGLOG(5, "ZSTD_compress_frameChunk (blockSize=%u)", (U32)blockSize);
-    if (cctx->appliedParams.fParams.checksumFlag && srcSize)
-        XXH64_update(&cctx->xxhState, src, srcSize);
-
-    while (remaining) {
-        U32 const lastBlock = lastFrameChunk & (blockSize >= remaining);
-
-        if (dstCapacity < ZSTD_blockHeaderSize + MIN_CBLOCK_SIZE)
-            return ERROR(dstSize_tooSmall);   /* not enough space to store compressed block */
-        if (remaining < blockSize) blockSize = remaining;
-
-        /* preemptive overflow correction:
-         * 1. correction is large enough:
-         *    lowLimit > (3<<29) ==> current > 3<<29 + 1< (3<<29 + 1< (3<<29 - blockSize) - (1< (3<<29 - blockSize) - (1<<30)             (NOTE: chainLog <= 30)
-         *    > 1<<29 - 1<<17
-         *
-         * 2. (ip+blockSize - cctx->base) doesn't overflow:
-         *    In 32 bit mode we limit windowLog to 30 so we don't get
-         *    differences larger than 1<<31-1.
-         * 3. cctx->lowLimit < 1<<32:
-         *    windowLog <= 31 ==> 3<<29 + 1<lowLimit > (3U<<29)) {
-            U32 const cycleMask = ((U32)1 << ZSTD_cycleLog(cctx->appliedParams.cParams.chainLog, cctx->appliedParams.cParams.strategy)) - 1;
-            U32 const current = (U32)(ip - cctx->base);
-            U32 const newCurrent = (current & cycleMask) + ((U32)1 << cctx->appliedParams.cParams.windowLog);
-            U32 const correction = current - newCurrent;
-            ZSTD_STATIC_ASSERT(ZSTD_CHAINLOG_MAX <= 30);
-            ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX_32 <= 30);
-            ZSTD_STATIC_ASSERT(ZSTD_WINDOWLOG_MAX <= 31);
-            assert(current > newCurrent);
-            assert(correction > 1<<28); /* Loose bound, should be about 1<<29 */
-            ZSTD_reduceIndex(cctx, correction);
-            cctx->base += correction;
-            cctx->dictBase += correction;
-            cctx->lowLimit -= correction;
-            cctx->dictLimit -= correction;
-            if (cctx->nextToUpdate < correction) cctx->nextToUpdate = 0;
-            else cctx->nextToUpdate -= correction;
-            DEBUGLOG(4, "Correction of 0x%x bytes to lowLimit=0x%x\n", correction, cctx->lowLimit);
-        }
-        /* enforce maxDist */
-        if ((U32)(ip+blockSize - cctx->base) > cctx->loadedDictEnd + maxDist) {
-            U32 const newLowLimit = (U32)(ip+blockSize - cctx->base) - maxDist;
-            if (cctx->lowLimit < newLowLimit) cctx->lowLimit = newLowLimit;
-            if (cctx->dictLimit < cctx->lowLimit) cctx->dictLimit = cctx->lowLimit;
-        }
-
-        {   size_t cSize = ZSTD_compressBlock_internal(cctx,
-                                op+ZSTD_blockHeaderSize, dstCapacity-ZSTD_blockHeaderSize,
-                                ip, blockSize);
-            if (ZSTD_isError(cSize)) return cSize;
-
-            if (cSize == 0) {  /* block is not compressible */
-                U32 const cBlockHeader24 = lastBlock + (((U32)bt_raw)<<1) + (U32)(blockSize << 3);
-                if (blockSize + ZSTD_blockHeaderSize > dstCapacity) return ERROR(dstSize_tooSmall);
-                MEM_writeLE32(op, cBlockHeader24);   /* 4th byte will be overwritten */
-                memcpy(op + ZSTD_blockHeaderSize, ip, blockSize);
-                cSize = ZSTD_blockHeaderSize + blockSize;
-            } else {
-                U32 const cBlockHeader24 = lastBlock + (((U32)bt_compressed)<<1) + (U32)(cSize << 3);
-                MEM_writeLE24(op, cBlockHeader24);
-                cSize += ZSTD_blockHeaderSize;
-            }
-
-            ip += blockSize;
-            assert(remaining >= blockSize);
-            remaining -= blockSize;
-            op += cSize;
-            assert(dstCapacity >= cSize);
-            dstCapacity -= cSize;
-            DEBUGLOG(5, "ZSTD_compress_frameChunk: adding a block of size %u",
-                        (U32)cSize);
-    }   }
-
-    if (lastFrameChunk && (op>ostart)) cctx->stage = ZSTDcs_ending;
-    return op-ostart;
-}
-
-
-static size_t ZSTD_writeFrameHeader(void* dst, size_t dstCapacity,
-                                    ZSTD_CCtx_params params, U64 pledgedSrcSize, U32 dictID)
-{   BYTE* const op = (BYTE*)dst;
-    U32   const dictIDSizeCodeLength = (dictID>0) + (dictID>=256) + (dictID>=65536);   /* 0-3 */
-    U32   const dictIDSizeCode = params.fParams.noDictIDFlag ? 0 : dictIDSizeCodeLength;   /* 0-3 */
-    U32   const checksumFlag = params.fParams.checksumFlag>0;
-    U32   const windowSize = (U32)1 << params.cParams.windowLog;
-    U32   const singleSegment = params.fParams.contentSizeFlag && (windowSize >= pledgedSrcSize);
-    BYTE  const windowLogByte = (BYTE)((params.cParams.windowLog - ZSTD_WINDOWLOG_ABSOLUTEMIN) << 3);
-    U32   const fcsCode = params.fParams.contentSizeFlag ?
-                     (pledgedSrcSize>=256) + (pledgedSrcSize>=65536+256) + (pledgedSrcSize>=0xFFFFFFFFU) : 0;  /* 0-3 */
-    BYTE  const frameHeaderDecriptionByte = (BYTE)(dictIDSizeCode + (checksumFlag<<2) + (singleSegment<<5) + (fcsCode<<6) );
-    size_t pos=0;
-
-    if (dstCapacity < ZSTD_frameHeaderSize_max) return ERROR(dstSize_tooSmall);
-    DEBUGLOG(4, "ZSTD_writeFrameHeader : dictIDFlag : %u ; dictID : %u ; dictIDSizeCode : %u",
-                !params.fParams.noDictIDFlag, dictID,  dictIDSizeCode);
-
-    if (params.format == ZSTD_f_zstd1) {
-        MEM_writeLE32(dst, ZSTD_MAGICNUMBER);
-        pos = 4;
-    }
-    op[pos++] = frameHeaderDecriptionByte;
-    if (!singleSegment) op[pos++] = windowLogByte;
-    switch(dictIDSizeCode)
-    {
-        default:  assert(0); /* impossible */
-        case 0 : break;
-        case 1 : op[pos] = (BYTE)(dictID); pos++; break;
-        case 2 : MEM_writeLE16(op+pos, (U16)dictID); pos+=2; break;
-        case 3 : MEM_writeLE32(op+pos, dictID); pos+=4; break;
-    }
-    switch(fcsCode)
-    {
-        default:  assert(0); /* impossible */
-        case 0 : if (singleSegment) op[pos++] = (BYTE)(pledgedSrcSize); break;
-        case 1 : MEM_writeLE16(op+pos, (U16)(pledgedSrcSize-256)); pos+=2; break;
-        case 2 : MEM_writeLE32(op+pos, (U32)(pledgedSrcSize)); pos+=4; break;
-        case 3 : MEM_writeLE64(op+pos, (U64)(pledgedSrcSize)); pos+=8; break;
-    }
-    return pos;
-}
-
-
-static size_t ZSTD_compressContinue_internal (ZSTD_CCtx* cctx,
-                              void* dst, size_t dstCapacity,
-                        const void* src, size_t srcSize,
-                               U32 frame, U32 lastFrameChunk)
-{
-    const BYTE* const ip = (const BYTE*) src;
-    size_t fhSize = 0;
-
-    DEBUGLOG(5, "ZSTD_compressContinue_internal, stage: %u", cctx->stage);
-    if (cctx->stage==ZSTDcs_created) return ERROR(stage_wrong);   /* missing init (ZSTD_compressBegin) */
-
-    if (frame && (cctx->stage==ZSTDcs_init)) {
-        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->appliedParams,
-                                       cctx->pledgedSrcSizePlusOne-1, cctx->dictID);
-        if (ZSTD_isError(fhSize)) return fhSize;
-        dstCapacity -= fhSize;
-        dst = (char*)dst + fhSize;
-        cctx->stage = ZSTDcs_ongoing;
-    }
-
-    if (!srcSize) return fhSize;  /* do not generate an empty block if no input */
-
-    /* Check if blocks follow each other */
-    if (src != cctx->nextSrc) {
-        /* not contiguous */
-        size_t const distanceFromBase = (size_t)(cctx->nextSrc - cctx->base);
-        cctx->lowLimit = cctx->dictLimit;
-        assert(distanceFromBase == (size_t)(U32)distanceFromBase);  /* should never overflow */
-        cctx->dictLimit = (U32)distanceFromBase;
-        cctx->dictBase = cctx->base;
-        cctx->base = ip - distanceFromBase;
-        cctx->nextToUpdate = cctx->dictLimit;
-        if (cctx->dictLimit - cctx->lowLimit < HASH_READ_SIZE) cctx->lowLimit = cctx->dictLimit;   /* too small extDict */
-    }
-    cctx->nextSrc = ip + srcSize;
-
-    /* if input and dictionary overlap : reduce dictionary (area presumed modified by input) */
-    if ((ip+srcSize > cctx->dictBase + cctx->lowLimit) & (ip < cctx->dictBase + cctx->dictLimit)) {
-        ptrdiff_t const highInputIdx = (ip + srcSize) - cctx->dictBase;
-        U32 const lowLimitMax = (highInputIdx > (ptrdiff_t)cctx->dictLimit) ? cctx->dictLimit : (U32)highInputIdx;
-        cctx->lowLimit = lowLimitMax;
-    }
-
-    DEBUGLOG(5, "ZSTD_compressContinue_internal (blockSize=%u)", (U32)cctx->blockSize);
-    {   size_t const cSize = frame ?
-                             ZSTD_compress_frameChunk (cctx, dst, dstCapacity, src, srcSize, lastFrameChunk) :
-                             ZSTD_compressBlock_internal (cctx, dst, dstCapacity, src, srcSize);
-        if (ZSTD_isError(cSize)) return cSize;
-        cctx->consumedSrcSize += srcSize;
-        return cSize + fhSize;
-    }
-}
-
-size_t ZSTD_compressContinue (ZSTD_CCtx* cctx,
-                              void* dst, size_t dstCapacity,
-                        const void* src, size_t srcSize)
-{
-    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 1 /* frame mode */, 0 /* last chunk */);
-}
-
-
-size_t ZSTD_getBlockSize(const ZSTD_CCtx* cctx)
-{
-    ZSTD_compressionParameters const cParams =
-            ZSTD_getCParamsFromCCtxParams(cctx->appliedParams, 0, 0);
-    return MIN (ZSTD_BLOCKSIZE_MAX, (U32)1 << cParams.windowLog);
-}
-
-size_t ZSTD_compressBlock(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    size_t const blockSizeMax = ZSTD_getBlockSize(cctx);
-    if (srcSize > blockSizeMax) return ERROR(srcSize_wrong);
-    return ZSTD_compressContinue_internal(cctx, dst, dstCapacity, src, srcSize, 0 /* frame mode */, 0 /* last chunk */);
-}
-
-/*! ZSTD_loadDictionaryContent() :
- *  @return : 0, or an error code
- */
-static size_t ZSTD_loadDictionaryContent(ZSTD_CCtx* zc, const void* src, size_t srcSize)
-{
-    const BYTE* const ip = (const BYTE*) src;
-    const BYTE* const iend = ip + srcSize;
-
-    /* input becomes current prefix */
-    zc->lowLimit = zc->dictLimit;
-    zc->dictLimit = (U32)(zc->nextSrc - zc->base);
-    zc->dictBase = zc->base;
-    zc->base = ip - zc->dictLimit;
-    zc->nextToUpdate = zc->dictLimit;
-    zc->loadedDictEnd = zc->appliedParams.forceWindow ? 0 : (U32)(iend - zc->base);
-
-    zc->nextSrc = iend;
-    if (srcSize <= HASH_READ_SIZE) return 0;
-
-    switch(zc->appliedParams.cParams.strategy)
-    {
-    case ZSTD_fast:
-        ZSTD_fillHashTable (zc, iend, zc->appliedParams.cParams.searchLength);
-        break;
-    case ZSTD_dfast:
-        ZSTD_fillDoubleHashTable (zc, iend, zc->appliedParams.cParams.searchLength);
-        break;
-
-    case ZSTD_greedy:
-    case ZSTD_lazy:
-    case ZSTD_lazy2:
-        if (srcSize >= HASH_READ_SIZE)
-            ZSTD_insertAndFindFirstIndex(zc, iend-HASH_READ_SIZE, zc->appliedParams.cParams.searchLength);
-        break;
-
-    case ZSTD_btlazy2:
-    case ZSTD_btopt:
-    case ZSTD_btultra:
-        if (srcSize >= HASH_READ_SIZE)
-            ZSTD_updateTree(zc, iend-HASH_READ_SIZE, iend, (U32)1 << zc->appliedParams.cParams.searchLog, zc->appliedParams.cParams.searchLength);
-        break;
-
-    default:
-        assert(0);  /* not possible : not a valid strategy id */
-    }
-
-    zc->nextToUpdate = (U32)(iend - zc->base);
-    return 0;
-}
-
-
-/* Dictionaries that assign zero probability to symbols that show up causes problems
-   when FSE encoding.  Refuse dictionaries that assign zero probability to symbols
-   that we may encounter during compression.
-   NOTE: This behavior is not standard and could be improved in the future. */
-static size_t ZSTD_checkDictNCount(short* normalizedCounter, unsigned dictMaxSymbolValue, unsigned maxSymbolValue) {
-    U32 s;
-    if (dictMaxSymbolValue < maxSymbolValue) return ERROR(dictionary_corrupted);
-    for (s = 0; s <= maxSymbolValue; ++s) {
-        if (normalizedCounter[s] == 0) return ERROR(dictionary_corrupted);
-    }
-    return 0;
-}
-
-
-/* Dictionary format :
- * See :
- * https://github.com/facebook/zstd/blob/master/doc/zstd_compression_format.md#dictionary-format
- */
-/*! ZSTD_loadZstdDictionary() :
- * @return : 0, or an error code
- *  assumptions : magic number supposed already checked
- *                dictSize supposed > 8
- */
-static size_t ZSTD_loadZstdDictionary(ZSTD_CCtx* cctx, const void* dict, size_t dictSize)
-{
-    const BYTE* dictPtr = (const BYTE*)dict;
-    const BYTE* const dictEnd = dictPtr + dictSize;
-    short offcodeNCount[MaxOff+1];
-    unsigned offcodeMaxValue = MaxOff;
-
-    ZSTD_STATIC_ASSERT(sizeof(cctx->entropy->workspace) >= (1<dictID = cctx->appliedParams.fParams.noDictIDFlag ? 0 :  MEM_readLE32(dictPtr);
-    dictPtr += 4;
-
-    {   unsigned maxSymbolValue = 255;
-        size_t const hufHeaderSize = HUF_readCTable((HUF_CElt*)cctx->entropy->hufCTable, &maxSymbolValue, dictPtr, dictEnd-dictPtr);
-        if (HUF_isError(hufHeaderSize)) return ERROR(dictionary_corrupted);
-        if (maxSymbolValue < 255) return ERROR(dictionary_corrupted);
-        dictPtr += hufHeaderSize;
-    }
-
-    {   unsigned offcodeLog;
-        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
-        if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
-        /* Defer checking offcodeMaxValue because we need to know the size of the dictionary content */
-        CHECK_E( FSE_buildCTable_wksp(cctx->entropy->offcodeCTable, offcodeNCount, offcodeMaxValue, offcodeLog, cctx->entropy->workspace, sizeof(cctx->entropy->workspace)),
-                 dictionary_corrupted);
-        dictPtr += offcodeHeaderSize;
-    }
-
-    {   short matchlengthNCount[MaxML+1];
-        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
-        /* Every match length code must have non-zero probability */
-        CHECK_F( ZSTD_checkDictNCount(matchlengthNCount, matchlengthMaxValue, MaxML));
-        CHECK_E( FSE_buildCTable_wksp(cctx->entropy->matchlengthCTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog, cctx->entropy->workspace, sizeof(cctx->entropy->workspace)),
-                 dictionary_corrupted);
-        dictPtr += matchlengthHeaderSize;
-    }
-
-    {   short litlengthNCount[MaxLL+1];
-        unsigned litlengthMaxValue = MaxLL, litlengthLog;
-        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
-        /* Every literal length code must have non-zero probability */
-        CHECK_F( ZSTD_checkDictNCount(litlengthNCount, litlengthMaxValue, MaxLL));
-        CHECK_E( FSE_buildCTable_wksp(cctx->entropy->litlengthCTable, litlengthNCount, litlengthMaxValue, litlengthLog, cctx->entropy->workspace, sizeof(cctx->entropy->workspace)),
-                 dictionary_corrupted);
-        dictPtr += litlengthHeaderSize;
-    }
-
-    if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
-    cctx->seqStore.rep[0] = MEM_readLE32(dictPtr+0);
-    cctx->seqStore.rep[1] = MEM_readLE32(dictPtr+4);
-    cctx->seqStore.rep[2] = MEM_readLE32(dictPtr+8);
-    dictPtr += 12;
-
-    {   size_t const dictContentSize = (size_t)(dictEnd - dictPtr);
-        U32 offcodeMax = MaxOff;
-        if (dictContentSize <= ((U32)-1) - 128 KB) {
-            U32 const maxOffset = (U32)dictContentSize + 128 KB; /* The maximum offset that must be supported */
-            offcodeMax = ZSTD_highbit32(maxOffset); /* Calculate minimum offset code required to represent maxOffset */
-        }
-        /* All offset values <= dictContentSize + 128 KB must be representable */
-        CHECK_F (ZSTD_checkDictNCount(offcodeNCount, offcodeMaxValue, MIN(offcodeMax, MaxOff)));
-        /* All repCodes must be <= dictContentSize and != 0*/
-        {   U32 u;
-            for (u=0; u<3; u++) {
-                if (cctx->seqStore.rep[u] == 0) return ERROR(dictionary_corrupted);
-                if (cctx->seqStore.rep[u] > dictContentSize) return ERROR(dictionary_corrupted);
-        }   }
-
-        cctx->entropy->hufCTable_repeatMode = HUF_repeat_valid;
-        cctx->entropy->offcode_repeatMode = FSE_repeat_valid;
-        cctx->entropy->matchlength_repeatMode = FSE_repeat_valid;
-        cctx->entropy->litlength_repeatMode = FSE_repeat_valid;
-        return ZSTD_loadDictionaryContent(cctx, dictPtr, dictContentSize);
-    }
-}
-
-/** ZSTD_compress_insertDictionary() :
-*   @return : 0, or an error code */
-static size_t ZSTD_compress_insertDictionary(ZSTD_CCtx* cctx,
-                                       const void* dict, size_t dictSize,
-                                             ZSTD_dictMode_e dictMode)
-{
-    DEBUGLOG(4, "ZSTD_compress_insertDictionary (dictSize=%u)", (U32)dictSize);
-    if ((dict==NULL) || (dictSize<=8)) return 0;
-
-    /* dict restricted modes */
-    if (dictMode==ZSTD_dm_rawContent)
-        return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
-
-    if (MEM_readLE32(dict) != ZSTD_MAGIC_DICTIONARY) {
-        if (dictMode == ZSTD_dm_auto) {
-            DEBUGLOG(4, "raw content dictionary detected");
-            return ZSTD_loadDictionaryContent(cctx, dict, dictSize);
-        }
-        if (dictMode == ZSTD_dm_fullDict)
-            return ERROR(dictionary_wrong);
-        assert(0);   /* impossible */
-    }
-
-    /* dict as full zstd dictionary */
-    return ZSTD_loadZstdDictionary(cctx, dict, dictSize);
-}
-
-/*! ZSTD_compressBegin_internal() :
- * @return : 0, or an error code */
-size_t ZSTD_compressBegin_internal(ZSTD_CCtx* cctx,
-                             const void* dict, size_t dictSize,
-                             ZSTD_dictMode_e dictMode,
-                             const ZSTD_CDict* cdict,
-                             ZSTD_CCtx_params params, U64 pledgedSrcSize,
-                             ZSTD_buffered_policy_e zbuff)
-{
-    DEBUGLOG(4, "ZSTD_compressBegin_internal: wlog=%u", params.cParams.windowLog);
-    /* params are supposed to be fully validated at this point */
-    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
-    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
-
-    if (cdict && cdict->dictContentSize>0) {
-        cctx->requestedParams = params;
-        return ZSTD_copyCCtx_internal(cctx, cdict->refContext,
-                                      params.cParams.windowLog, params.fParams, pledgedSrcSize,
-                                      zbuff);
-    }
-
-    CHECK_F( ZSTD_resetCCtx_internal(cctx, params, pledgedSrcSize,
-                                     ZSTDcrp_continue, zbuff) );
-    return ZSTD_compress_insertDictionary(cctx, dict, dictSize, dictMode);
-}
-
-size_t ZSTD_compressBegin_advanced_internal(ZSTD_CCtx* cctx,
-                                    const void* dict, size_t dictSize,
-                                    ZSTD_dictMode_e dictMode,
-                                    const ZSTD_CDict* cdict,
-                                    ZSTD_CCtx_params params,
-                                    unsigned long long pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_compressBegin_advanced_internal: wlog=%u", params.cParams.windowLog);
-    /* compression parameters verification and optimization */
-    CHECK_F( ZSTD_checkCParams(params.cParams) );
-    return ZSTD_compressBegin_internal(cctx,
-                                       dict, dictSize, dictMode,
-                                       cdict,
-                                       params, pledgedSrcSize,
-                                       ZSTDb_not_buffered);
-}
-
-/*! ZSTD_compressBegin_advanced() :
-*   @return : 0, or an error code */
-size_t ZSTD_compressBegin_advanced(ZSTD_CCtx* cctx,
-                             const void* dict, size_t dictSize,
-                                   ZSTD_parameters params, unsigned long long pledgedSrcSize)
-{
-    ZSTD_CCtx_params const cctxParams =
-            ZSTD_assignParamsToCCtxParams(cctx->requestedParams, params);
-    return ZSTD_compressBegin_advanced_internal(cctx,
-                                            dict, dictSize, ZSTD_dm_auto,
-                                            NULL /*cdict*/,
-                                            cctxParams, pledgedSrcSize);
-}
-
-size_t ZSTD_compressBegin_usingDict(ZSTD_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel)
-{
-    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    ZSTD_CCtx_params const cctxParams =
-            ZSTD_assignParamsToCCtxParams(cctx->requestedParams, params);
-    DEBUGLOG(4, "ZSTD_compressBegin_usingDict");
-    return ZSTD_compressBegin_internal(cctx, dict, dictSize, ZSTD_dm_auto, NULL,
-                                       cctxParams, ZSTD_CONTENTSIZE_UNKNOWN, ZSTDb_not_buffered);
-}
-
-size_t ZSTD_compressBegin(ZSTD_CCtx* cctx, int compressionLevel)
-{
-    return ZSTD_compressBegin_usingDict(cctx, NULL, 0, compressionLevel);
-}
-
-
-/*! ZSTD_writeEpilogue() :
-*   Ends a frame.
-*   @return : nb of bytes written into dst (or an error code) */
-static size_t ZSTD_writeEpilogue(ZSTD_CCtx* cctx, void* dst, size_t dstCapacity)
-{
-    BYTE* const ostart = (BYTE*)dst;
-    BYTE* op = ostart;
-    size_t fhSize = 0;
-
-    DEBUGLOG(5, "ZSTD_writeEpilogue");
-    if (cctx->stage == ZSTDcs_created) return ERROR(stage_wrong);  /* init missing */
-
-    /* special case : empty frame */
-    if (cctx->stage == ZSTDcs_init) {
-        fhSize = ZSTD_writeFrameHeader(dst, dstCapacity, cctx->appliedParams, 0, 0);
-        if (ZSTD_isError(fhSize)) return fhSize;
-        dstCapacity -= fhSize;
-        op += fhSize;
-        cctx->stage = ZSTDcs_ongoing;
-    }
-
-    if (cctx->stage != ZSTDcs_ending) {
-        /* write one last empty block, make it the "last" block */
-        U32 const cBlockHeader24 = 1 /* last block */ + (((U32)bt_raw)<<1) + 0;
-        if (dstCapacity<4) return ERROR(dstSize_tooSmall);
-        MEM_writeLE32(op, cBlockHeader24);
-        op += ZSTD_blockHeaderSize;
-        dstCapacity -= ZSTD_blockHeaderSize;
-    }
-
-    if (cctx->appliedParams.fParams.checksumFlag) {
-        U32 const checksum = (U32) XXH64_digest(&cctx->xxhState);
-        if (dstCapacity<4) return ERROR(dstSize_tooSmall);
-        MEM_writeLE32(op, checksum);
-        op += 4;
-    }
-
-    cctx->stage = ZSTDcs_created;  /* return to "created but no init" status */
-    return op-ostart;
-}
-
-
-size_t ZSTD_compressEnd (ZSTD_CCtx* cctx,
-                         void* dst, size_t dstCapacity,
-                   const void* src, size_t srcSize)
-{
-    size_t endResult;
-    size_t const cSize = ZSTD_compressContinue_internal(cctx,
-                                dst, dstCapacity, src, srcSize,
-                                1 /* frame mode */, 1 /* last chunk */);
-    if (ZSTD_isError(cSize)) return cSize;
-    endResult = ZSTD_writeEpilogue(cctx, (char*)dst + cSize, dstCapacity-cSize);
-    if (ZSTD_isError(endResult)) return endResult;
-    if (cctx->appliedParams.fParams.contentSizeFlag) {  /* control src size */
-        DEBUGLOG(4, "end of frame : controlling src size");
-        if (cctx->pledgedSrcSizePlusOne != cctx->consumedSrcSize+1) {
-            DEBUGLOG(4, "error : pledgedSrcSize = %u, while realSrcSize = %u",
-                (U32)cctx->pledgedSrcSizePlusOne-1, (U32)cctx->consumedSrcSize);
-            return ERROR(srcSize_wrong);
-    }   }
-    return cSize + endResult;
-}
-
-
-static size_t ZSTD_compress_internal (ZSTD_CCtx* cctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const void* dict,size_t dictSize,
-                               ZSTD_parameters params)
-{
-    ZSTD_CCtx_params const cctxParams =
-            ZSTD_assignParamsToCCtxParams(cctx->requestedParams, params);
-    DEBUGLOG(4, "ZSTD_compress_internal");
-    return ZSTD_compress_advanced_internal(cctx,
-                                          dst, dstCapacity,
-                                          src, srcSize,
-                                          dict, dictSize,
-                                          cctxParams);
-}
-
-size_t ZSTD_compress_advanced (ZSTD_CCtx* ctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const void* dict,size_t dictSize,
-                               ZSTD_parameters params)
-{
-    DEBUGLOG(4, "ZSTD_compress_advanced");
-    CHECK_F(ZSTD_checkCParams(params.cParams));
-    return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
-}
-
-/* Internal */
-size_t ZSTD_compress_advanced_internal(
-        ZSTD_CCtx* cctx,
-        void* dst, size_t dstCapacity,
-        const void* src, size_t srcSize,
-        const void* dict,size_t dictSize,
-        ZSTD_CCtx_params params)
-{
-    DEBUGLOG(4, "ZSTD_compress_advanced_internal");
-    CHECK_F( ZSTD_compressBegin_internal(cctx, dict, dictSize, ZSTD_dm_auto, NULL,
-                                         params, srcSize, ZSTDb_not_buffered) );
-    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
-}
-
-size_t ZSTD_compress_usingDict(ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize,
-                               const void* dict, size_t dictSize, int compressionLevel)
-{
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize ? srcSize : 1, dict ? dictSize : 0);
-    params.fParams.contentSizeFlag = 1;
-    DEBUGLOG(4, "ZSTD_compress_usingDict (level=%i, srcSize=%u, dictSize=%u)",
-                compressionLevel, (U32)srcSize, (U32)dictSize);
-    return ZSTD_compress_internal(ctx, dst, dstCapacity, src, srcSize, dict, dictSize, params);
-}
-
-size_t ZSTD_compressCCtx (ZSTD_CCtx* ctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
-{
-    return ZSTD_compress_usingDict(ctx, dst, dstCapacity, src, srcSize, NULL, 0, compressionLevel);
-}
-
-size_t ZSTD_compress(void* dst, size_t dstCapacity, const void* src, size_t srcSize, int compressionLevel)
-{
-    size_t result;
-    ZSTD_CCtx ctxBody;
-    memset(&ctxBody, 0, sizeof(ctxBody));
-    ctxBody.customMem = ZSTD_defaultCMem;
-    result = ZSTD_compressCCtx(&ctxBody, dst, dstCapacity, src, srcSize, compressionLevel);
-    ZSTD_free(ctxBody.workSpace, ZSTD_defaultCMem);  /* can't free ctxBody itself, as it's on stack; free only heap content */
-    return result;
-}
-
-
-/* =====  Dictionary API  ===== */
-
-/*! ZSTD_estimateCDictSize_advanced() :
- *  Estimate amount of memory that will be needed to create a dictionary with following arguments */
-size_t ZSTD_estimateCDictSize_advanced(
-        size_t dictSize, ZSTD_compressionParameters cParams,
-        ZSTD_dictLoadMethod_e dictLoadMethod)
-{
-    DEBUGLOG(5, "sizeof(ZSTD_CDict) : %u", (U32)sizeof(ZSTD_CDict));
-    DEBUGLOG(5, "CCtx estimate : %u",
-             (U32)ZSTD_estimateCCtxSize_usingCParams(cParams));
-    return sizeof(ZSTD_CDict) + ZSTD_estimateCCtxSize_usingCParams(cParams)
-           + (dictLoadMethod == ZSTD_dlm_byRef ? 0 : dictSize);
-}
-
-size_t ZSTD_estimateCDictSize(size_t dictSize, int compressionLevel)
-{
-    ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, 0, dictSize);
-    return ZSTD_estimateCDictSize_advanced(dictSize, cParams, ZSTD_dlm_byCopy);
-}
-
-size_t ZSTD_sizeof_CDict(const ZSTD_CDict* cdict)
-{
-    if (cdict==NULL) return 0;   /* support sizeof on NULL */
-    DEBUGLOG(5, "sizeof(*cdict) : %u", (U32)sizeof(*cdict));
-    DEBUGLOG(5, "ZSTD_sizeof_CCtx : %u", (U32)ZSTD_sizeof_CCtx(cdict->refContext));
-    return ZSTD_sizeof_CCtx(cdict->refContext) + (cdict->dictBuffer ? cdict->dictContentSize : 0) + sizeof(*cdict);
-}
-
-static size_t ZSTD_initCDict_internal(
-                    ZSTD_CDict* cdict,
-              const void* dictBuffer, size_t dictSize,
-                    ZSTD_dictLoadMethod_e dictLoadMethod,
-                    ZSTD_dictMode_e dictMode,
-                    ZSTD_compressionParameters cParams)
-{
-    DEBUGLOG(3, "ZSTD_initCDict_internal, mode %u", (U32)dictMode);
-    if ((dictLoadMethod == ZSTD_dlm_byRef) || (!dictBuffer) || (!dictSize)) {
-        cdict->dictBuffer = NULL;
-        cdict->dictContent = dictBuffer;
-    } else {
-        void* const internalBuffer = ZSTD_malloc(dictSize, cdict->refContext->customMem);
-        cdict->dictBuffer = internalBuffer;
-        cdict->dictContent = internalBuffer;
-        if (!internalBuffer) return ERROR(memory_allocation);
-        memcpy(internalBuffer, dictBuffer, dictSize);
-    }
-    cdict->dictContentSize = dictSize;
-
-    {   ZSTD_CCtx_params cctxParams = cdict->refContext->requestedParams;
-        cctxParams.cParams = cParams;
-        CHECK_F( ZSTD_compressBegin_internal(cdict->refContext,
-                                        cdict->dictContent, dictSize, dictMode,
-                                        NULL,
-                                        cctxParams, ZSTD_CONTENTSIZE_UNKNOWN,
-                                        ZSTDb_not_buffered) );
-    }
-
-    return 0;
-}
-
-ZSTD_CDict* ZSTD_createCDict_advanced(const void* dictBuffer, size_t dictSize,
-                                      ZSTD_dictLoadMethod_e dictLoadMethod,
-                                      ZSTD_dictMode_e dictMode,
-                                      ZSTD_compressionParameters cParams, ZSTD_customMem customMem)
-{
-    DEBUGLOG(3, "ZSTD_createCDict_advanced, mode %u", (U32)dictMode);
-    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
-
-    {   ZSTD_CDict* const cdict = (ZSTD_CDict*)ZSTD_malloc(sizeof(ZSTD_CDict), customMem);
-        ZSTD_CCtx* const cctx = ZSTD_createCCtx_advanced(customMem);
-
-        if (!cdict || !cctx) {
-            ZSTD_free(cdict, customMem);
-            ZSTD_freeCCtx(cctx);
-            return NULL;
-        }
-        cdict->refContext = cctx;
-        if (ZSTD_isError( ZSTD_initCDict_internal(cdict,
-                                        dictBuffer, dictSize,
-                                        dictLoadMethod, dictMode,
-                                        cParams) )) {
-            ZSTD_freeCDict(cdict);
-            return NULL;
-        }
-
-        return cdict;
-    }
-}
-
-ZSTD_CDict* ZSTD_createCDict(const void* dict, size_t dictSize, int compressionLevel)
-{
-    ZSTD_compressionParameters cParams = ZSTD_getCParams(compressionLevel, 0, dictSize);
-    return ZSTD_createCDict_advanced(dict, dictSize,
-                                     ZSTD_dlm_byCopy, ZSTD_dm_auto,
-                                     cParams, ZSTD_defaultCMem);
-}
-
-ZSTD_CDict* ZSTD_createCDict_byReference(const void* dict, size_t dictSize, int compressionLevel)
-{
-    ZSTD_compressionParameters cParams = ZSTD_getCParams(compressionLevel, 0, dictSize);
-    return ZSTD_createCDict_advanced(dict, dictSize,
-                                     ZSTD_dlm_byRef, ZSTD_dm_auto,
-                                     cParams, ZSTD_defaultCMem);
-}
-
-size_t ZSTD_freeCDict(ZSTD_CDict* cdict)
-{
-    if (cdict==NULL) return 0;   /* support free on NULL */
-    {   ZSTD_customMem const cMem = cdict->refContext->customMem;
-        ZSTD_freeCCtx(cdict->refContext);
-        ZSTD_free(cdict->dictBuffer, cMem);
-        ZSTD_free(cdict, cMem);
-        return 0;
-    }
-}
-
-/*! ZSTD_initStaticCDict_advanced() :
- *  Generate a digested dictionary in provided memory area.
- *  workspace: The memory area to emplace the dictionary into.
- *             Provided pointer must 8-bytes aligned.
- *             It must outlive dictionary usage.
- *  workspaceSize: Use ZSTD_estimateCDictSize()
- *                 to determine how large workspace must be.
- *  cParams : use ZSTD_getCParams() to transform a compression level
- *            into its relevants cParams.
- * @return : pointer to ZSTD_CDict*, or NULL if error (size too small)
- *  Note : there is no corresponding "free" function.
- *         Since workspace was allocated externally, it must be freed externally.
- */
-ZSTD_CDict* ZSTD_initStaticCDict(void* workspace, size_t workspaceSize,
-                           const void* dict, size_t dictSize,
-                                 ZSTD_dictLoadMethod_e dictLoadMethod,
-                                 ZSTD_dictMode_e dictMode,
-                                 ZSTD_compressionParameters cParams)
-{
-    size_t const cctxSize = ZSTD_estimateCCtxSize_usingCParams(cParams);
-    size_t const neededSize = sizeof(ZSTD_CDict) + (dictLoadMethod == ZSTD_dlm_byRef ? 0 : dictSize)
-                            + cctxSize;
-    ZSTD_CDict* const cdict = (ZSTD_CDict*) workspace;
-    void* ptr;
-    DEBUGLOG(4, "(size_t)workspace & 7 : %u", (U32)(size_t)workspace & 7);
-    if ((size_t)workspace & 7) return NULL;  /* 8-aligned */
-    DEBUGLOG(4, "(workspaceSize < neededSize) : (%u < %u) => %u",
-        (U32)workspaceSize, (U32)neededSize, (U32)(workspaceSize < neededSize));
-    if (workspaceSize < neededSize) return NULL;
-
-    if (dictLoadMethod == ZSTD_dlm_byCopy) {
-        memcpy(cdict+1, dict, dictSize);
-        dict = cdict+1;
-        ptr = (char*)workspace + sizeof(ZSTD_CDict) + dictSize;
-    } else {
-        ptr = cdict+1;
-    }
-    cdict->refContext = ZSTD_initStaticCCtx(ptr, cctxSize);
-
-    if (ZSTD_isError( ZSTD_initCDict_internal(cdict,
-                                              dict, dictSize,
-                                              ZSTD_dlm_byRef, dictMode,
-                                              cParams) ))
-        return NULL;
-
-    return cdict;
-}
-
-ZSTD_compressionParameters ZSTD_getCParamsFromCDict(const ZSTD_CDict* cdict) {
-    return cdict->refContext->appliedParams.cParams;
-}
-
-/* ZSTD_compressBegin_usingCDict_advanced() :
- * cdict must be != NULL */
-size_t ZSTD_compressBegin_usingCDict_advanced(
-    ZSTD_CCtx* const cctx, const ZSTD_CDict* const cdict,
-    ZSTD_frameParameters const fParams, unsigned long long const pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_compressBegin_usingCDict_advanced");
-    if (cdict==NULL) return ERROR(dictionary_wrong);
-    {   ZSTD_CCtx_params params = cctx->requestedParams;
-        params.cParams = ZSTD_getCParamsFromCDict(cdict);
-        params.fParams = fParams;
-        return ZSTD_compressBegin_internal(cctx,
-                                           NULL, 0, ZSTD_dm_auto,
-                                           cdict,
-                                           params, pledgedSrcSize,
-                                           ZSTDb_not_buffered);
-    }
-}
-
-/* ZSTD_compressBegin_usingCDict() :
- * pledgedSrcSize=0 means "unknown"
- * if pledgedSrcSize>0, it will enable contentSizeFlag */
-size_t ZSTD_compressBegin_usingCDict(ZSTD_CCtx* cctx, const ZSTD_CDict* cdict)
-{
-    ZSTD_frameParameters const fParams = { 0 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
-    DEBUGLOG(4, "ZSTD_compressBegin_usingCDict : dictIDFlag == %u", !fParams.noDictIDFlag);
-    return ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, 0);
-}
-
-size_t ZSTD_compress_usingCDict_advanced(ZSTD_CCtx* cctx,
-                                void* dst, size_t dstCapacity,
-                                const void* src, size_t srcSize,
-                                const ZSTD_CDict* cdict, ZSTD_frameParameters fParams)
-{
-    CHECK_F (ZSTD_compressBegin_usingCDict_advanced(cctx, cdict, fParams, srcSize));   /* will check if cdict != NULL */
-    return ZSTD_compressEnd(cctx, dst, dstCapacity, src, srcSize);
-}
-
-/*! ZSTD_compress_usingCDict() :
- *  Compression using a digested Dictionary.
- *  Faster startup than ZSTD_compress_usingDict(), recommended when same dictionary is used multiple times.
- *  Note that compression parameters are decided at CDict creation time
- *  while frame parameters are hardcoded */
-size_t ZSTD_compress_usingCDict(ZSTD_CCtx* cctx,
-                                void* dst, size_t dstCapacity,
-                                const void* src, size_t srcSize,
-                                const ZSTD_CDict* cdict)
-{
-    ZSTD_frameParameters const fParams = { 1 /*content*/, 0 /*checksum*/, 0 /*noDictID*/ };
-    return ZSTD_compress_usingCDict_advanced(cctx, dst, dstCapacity, src, srcSize, cdict, fParams);
-}
-
-
-
-/* ******************************************************************
-*  Streaming
-********************************************************************/
-
-ZSTD_CStream* ZSTD_createCStream(void)
-{
-    DEBUGLOG(3, "ZSTD_createCStream");
-    return ZSTD_createCStream_advanced(ZSTD_defaultCMem);
-}
-
-ZSTD_CStream* ZSTD_initStaticCStream(void *workspace, size_t workspaceSize)
-{
-    return ZSTD_initStaticCCtx(workspace, workspaceSize);
-}
-
-ZSTD_CStream* ZSTD_createCStream_advanced(ZSTD_customMem customMem)
-{   /* CStream and CCtx are now same object */
-    return ZSTD_createCCtx_advanced(customMem);
-}
-
-size_t ZSTD_freeCStream(ZSTD_CStream* zcs)
-{
-    return ZSTD_freeCCtx(zcs);   /* same object */
-}
-
-
-
-/*======   Initialization   ======*/
-
-size_t ZSTD_CStreamInSize(void)  { return ZSTD_BLOCKSIZE_MAX; }
-
-size_t ZSTD_CStreamOutSize(void)
-{
-    return ZSTD_compressBound(ZSTD_BLOCKSIZE_MAX) + ZSTD_blockHeaderSize + 4 /* 32-bits hash */ ;
-}
-
-static size_t ZSTD_resetCStream_internal(ZSTD_CStream* zcs,
-                    const void* const dict, size_t const dictSize, ZSTD_dictMode_e const dictMode,
-                    const ZSTD_CDict* const cdict,
-                    ZSTD_CCtx_params const params, unsigned long long const pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_resetCStream_internal");
-    /* params are supposed to be fully validated at this point */
-    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
-    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
-
-    CHECK_F( ZSTD_compressBegin_internal(zcs,
-                                         dict, dictSize, dictMode,
-                                         cdict,
-                                         params, pledgedSrcSize,
-                                         ZSTDb_buffered) );
-
-    zcs->inToCompress = 0;
-    zcs->inBuffPos = 0;
-    zcs->inBuffTarget = zcs->blockSize
-                      + (zcs->blockSize == pledgedSrcSize);   /* for small input: avoid automatic flush on reaching end of block, since it would require to add a 3-bytes null block to end frame */
-    zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-    zcs->streamStage = zcss_load;
-    zcs->frameEnded = 0;
-    return 0;   /* ready to go */
-}
-
-/* ZSTD_resetCStream():
- * pledgedSrcSize == 0 means "unknown" */
-size_t ZSTD_resetCStream(ZSTD_CStream* zcs, unsigned long long pledgedSrcSize)
-{
-    ZSTD_CCtx_params params = zcs->requestedParams;
-    DEBUGLOG(4, "ZSTD_resetCStream: pledgedSrcSize = %u", (U32)pledgedSrcSize);
-    if (pledgedSrcSize==0) pledgedSrcSize = ZSTD_CONTENTSIZE_UNKNOWN;
-    params.fParams.contentSizeFlag = 1;
-    params.cParams = ZSTD_getCParamsFromCCtxParams(params, pledgedSrcSize, 0);
-    return ZSTD_resetCStream_internal(zcs, NULL, 0, ZSTD_dm_auto, zcs->cdict, params, pledgedSrcSize);
-}
-
-/*! ZSTD_initCStream_internal() :
- *  Note : for lib/compress only. Used by zstdmt_compress.c.
- *  Assumption 1 : params are valid
- *  Assumption 2 : either dict, or cdict, is defined, not both */
-size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
-                    const void* dict, size_t dictSize, const ZSTD_CDict* cdict,
-                    ZSTD_CCtx_params params, unsigned long long pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_initCStream_internal");
-    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
-    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
-
-    if (dict && dictSize >= 8) {
-        DEBUGLOG(4, "loading dictionary of size %u", (U32)dictSize);
-        if (zcs->staticSize) {   /* static CCtx : never uses malloc */
-            /* incompatible with internal cdict creation */
-            return ERROR(memory_allocation);
-        }
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize,
-                                            ZSTD_dlm_byCopy, ZSTD_dm_auto,
-                                            params.cParams, zcs->customMem);
-        zcs->cdict = zcs->cdictLocal;
-        if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
-    } else {
-        if (cdict) {
-            params.cParams = ZSTD_getCParamsFromCDict(cdict);  /* cParams are enforced from cdict; it includes windowLog */
-        }
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = NULL;
-        zcs->cdict = cdict;
-    }
-
-    params.compressionLevel = ZSTD_CLEVEL_CUSTOM; /* enforce usage of cParams, instead of a dynamic derivation from cLevel (but does that happen ?) */
-    zcs->requestedParams = params;
-
-    return ZSTD_resetCStream_internal(zcs, NULL, 0, ZSTD_dm_auto, zcs->cdict, params, pledgedSrcSize);
-}
-
-/* ZSTD_initCStream_usingCDict_advanced() :
- * same as ZSTD_initCStream_usingCDict(), with control over frame parameters */
-size_t ZSTD_initCStream_usingCDict_advanced(ZSTD_CStream* zcs,
-                                            const ZSTD_CDict* cdict,
-                                            ZSTD_frameParameters fParams,
-                                            unsigned long long pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTD_initCStream_usingCDict_advanced");
-    if (!cdict) return ERROR(dictionary_wrong); /* cannot handle NULL cdict (does not know what to do) */
-    {   ZSTD_CCtx_params params = zcs->requestedParams;
-        params.cParams = ZSTD_getCParamsFromCDict(cdict);
-        params.fParams = fParams;
-        return ZSTD_initCStream_internal(zcs,
-                                NULL, 0, cdict,
-                                params, pledgedSrcSize);
-    }
-}
-
-/* note : cdict must outlive compression session */
-size_t ZSTD_initCStream_usingCDict(ZSTD_CStream* zcs, const ZSTD_CDict* cdict)
-{
-    ZSTD_frameParameters const fParams = { 0 /* contentSizeFlag */, 0 /* checksum */, 0 /* hideDictID */ };
-    DEBUGLOG(4, "ZSTD_initCStream_usingCDict");
-    return ZSTD_initCStream_usingCDict_advanced(zcs, cdict, fParams, ZSTD_CONTENTSIZE_UNKNOWN);  /* note : will check that cdict != NULL */
-}
-
-/* ZSTD_initCStream_advanced() :
- * pledgedSrcSize must be correct.
- * if srcSize is not known at init time, use value ZSTD_CONTENTSIZE_UNKNOWN.
- * dict is loaded with default parameters ZSTD_dm_auto and ZSTD_dlm_byCopy. */
-size_t ZSTD_initCStream_advanced(ZSTD_CStream* zcs,
-                                 const void* dict, size_t dictSize,
-                                 ZSTD_parameters params, unsigned long long pledgedSrcSize)
-{
-    ZSTD_CCtx_params const cctxParams = ZSTD_assignParamsToCCtxParams(zcs->requestedParams, params);
-    DEBUGLOG(4, "ZSTD_initCStream_advanced: pledgedSrcSize=%u, flag=%u",
-                (U32)pledgedSrcSize, params.fParams.contentSizeFlag);
-    CHECK_F( ZSTD_checkCParams(params.cParams) );
-    if ((pledgedSrcSize==0) && (params.fParams.contentSizeFlag==0)) pledgedSrcSize = ZSTD_CONTENTSIZE_UNKNOWN;  /* for compatibility with older programs relying on this behavior. Users should now specify ZSTD_CONTENTSIZE_UNKNOWN. This line will be removed in the future. */
-    return ZSTD_initCStream_internal(zcs, dict, dictSize, NULL /*cdict*/, cctxParams, pledgedSrcSize);
-}
-
-size_t ZSTD_initCStream_usingDict(ZSTD_CStream* zcs, const void* dict, size_t dictSize, int compressionLevel)
-{
-    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, dictSize);
-    ZSTD_CCtx_params const cctxParams =
-            ZSTD_assignParamsToCCtxParams(zcs->requestedParams, params);
-    return ZSTD_initCStream_internal(zcs, dict, dictSize, NULL, cctxParams, ZSTD_CONTENTSIZE_UNKNOWN);
-}
-
-size_t ZSTD_initCStream_srcSize(ZSTD_CStream* zcs, int compressionLevel, unsigned long long pss)
-{
-    U64 const pledgedSrcSize = (pss==0) ? ZSTD_CONTENTSIZE_UNKNOWN : pss;  /* temporary : 0 interpreted as "unknown" during transition period. Users willing to specify "unknown" **must** use ZSTD_CONTENTSIZE_UNKNOWN. `0` will be interpreted as "empty" in the future */
-    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, pledgedSrcSize, 0);
-    ZSTD_CCtx_params const cctxParams = ZSTD_assignParamsToCCtxParams(zcs->requestedParams, params);
-    return ZSTD_initCStream_internal(zcs, NULL, 0, NULL, cctxParams, pledgedSrcSize);
-}
-
-size_t ZSTD_initCStream(ZSTD_CStream* zcs, int compressionLevel)
-{
-    DEBUGLOG(4, "ZSTD_initCStream");
-    return ZSTD_initCStream_srcSize(zcs, compressionLevel, ZSTD_CONTENTSIZE_UNKNOWN);
-}
-
-/*======   Compression   ======*/
-
-MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity,
-                           const void* src, size_t srcSize)
-{
-    size_t const length = MIN(dstCapacity, srcSize);
-    if (length) memcpy(dst, src, length);
-    return length;
-}
-
-/** ZSTD_compressStream_generic():
- *  internal function for all *compressStream*() variants and *compress_generic()
- *  non-static, because can be called from zstdmt.c
- * @return : hint size for next input */
-size_t ZSTD_compressStream_generic(ZSTD_CStream* zcs,
-                                   ZSTD_outBuffer* output,
-                                   ZSTD_inBuffer* input,
-                                   ZSTD_EndDirective const flushMode)
-{
-    const char* const istart = (const char*)input->src;
-    const char* const iend = istart + input->size;
-    const char* ip = istart + input->pos;
-    char* const ostart = (char*)output->dst;
-    char* const oend = ostart + output->size;
-    char* op = ostart + output->pos;
-    U32 someMoreWork = 1;
-
-    /* check expectations */
-    DEBUGLOG(5, "ZSTD_compressStream_generic, flush=%u", (U32)flushMode);
-    assert(zcs->inBuff != NULL);
-    assert(zcs->inBuffSize > 0);
-    assert(zcs->outBuff !=  NULL);
-    assert(zcs->outBuffSize > 0);
-    assert(output->pos <= output->size);
-    assert(input->pos <= input->size);
-
-    while (someMoreWork) {
-        switch(zcs->streamStage)
-        {
-        case zcss_init:
-            /* call ZSTD_initCStream() first ! */
-            return ERROR(init_missing);
-
-        case zcss_load:
-            if ( (flushMode == ZSTD_e_end)
-              && ((size_t)(oend-op) >= ZSTD_compressBound(iend-ip))  /* enough dstCapacity */
-              && (zcs->inBuffPos == 0) ) {
-                /* shortcut to compression pass directly into output buffer */
-                size_t const cSize = ZSTD_compressEnd(zcs,
-                                                op, oend-op, ip, iend-ip);
-                DEBUGLOG(4, "ZSTD_compressEnd : %u", (U32)cSize);
-                if (ZSTD_isError(cSize)) return cSize;
-                ip = iend;
-                op += cSize;
-                zcs->frameEnded = 1;
-                ZSTD_startNewCompression(zcs);
-                someMoreWork = 0; break;
-            }
-            /* complete loading into inBuffer */
-            {   size_t const toLoad = zcs->inBuffTarget - zcs->inBuffPos;
-                size_t const loaded = ZSTD_limitCopy(
-                                        zcs->inBuff + zcs->inBuffPos, toLoad,
-                                        ip, iend-ip);
-                zcs->inBuffPos += loaded;
-                ip += loaded;
-                if ( (flushMode == ZSTD_e_continue)
-                  && (zcs->inBuffPos < zcs->inBuffTarget) ) {
-                    /* not enough input to fill full block : stop here */
-                    someMoreWork = 0; break;
-                }
-                if ( (flushMode == ZSTD_e_flush)
-                  && (zcs->inBuffPos == zcs->inToCompress) ) {
-                    /* empty */
-                    someMoreWork = 0; break;
-                }
-            }
-            /* compress current block (note : this stage cannot be stopped in the middle) */
-            DEBUGLOG(5, "stream compression stage (flushMode==%u)", flushMode);
-            {   void* cDst;
-                size_t cSize;
-                size_t const iSize = zcs->inBuffPos - zcs->inToCompress;
-                size_t oSize = oend-op;
-                unsigned const lastBlock = (flushMode == ZSTD_e_end) && (ip==iend);
-                if (oSize >= ZSTD_compressBound(iSize))
-                    cDst = op;   /* compress into output buffer, to skip flush stage */
-                else
-                    cDst = zcs->outBuff, oSize = zcs->outBuffSize;
-                cSize = lastBlock ?
-                        ZSTD_compressEnd(zcs, cDst, oSize,
-                                    zcs->inBuff + zcs->inToCompress, iSize) :
-                        ZSTD_compressContinue(zcs, cDst, oSize,
-                                    zcs->inBuff + zcs->inToCompress, iSize);
-                if (ZSTD_isError(cSize)) return cSize;
-                zcs->frameEnded = lastBlock;
-                /* prepare next block */
-                zcs->inBuffTarget = zcs->inBuffPos + zcs->blockSize;
-                if (zcs->inBuffTarget > zcs->inBuffSize)
-                    zcs->inBuffPos = 0, zcs->inBuffTarget = zcs->blockSize;
-                DEBUGLOG(5, "inBuffTarget:%u / inBuffSize:%u",
-                         (U32)zcs->inBuffTarget, (U32)zcs->inBuffSize);
-                if (!lastBlock)
-                    assert(zcs->inBuffTarget <= zcs->inBuffSize);
-                zcs->inToCompress = zcs->inBuffPos;
-                if (cDst == op) {  /* no need to flush */
-                    op += cSize;
-                    if (zcs->frameEnded) {
-                        DEBUGLOG(5, "Frame completed directly in outBuffer");
-                        someMoreWork = 0;
-                        ZSTD_startNewCompression(zcs);
-                    }
-                    break;
-                }
-                zcs->outBuffContentSize = cSize;
-                zcs->outBuffFlushedSize = 0;
-                zcs->streamStage = zcss_flush; /* pass-through to flush stage */
-            }
-	    /* fall-through */
-        case zcss_flush:
-            DEBUGLOG(5, "flush stage");
-            {   size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize;
-                size_t const flushed = ZSTD_limitCopy(op, oend-op,
-                            zcs->outBuff + zcs->outBuffFlushedSize, toFlush);
-                DEBUGLOG(5, "toFlush: %u into %u ==> flushed: %u",
-                            (U32)toFlush, (U32)(oend-op), (U32)flushed);
-                op += flushed;
-                zcs->outBuffFlushedSize += flushed;
-                if (toFlush!=flushed) {
-                    /* flush not fully completed, presumably because dst is too small */
-                    assert(op==oend);
-                    someMoreWork = 0;
-                    break;
-                }
-                zcs->outBuffContentSize = zcs->outBuffFlushedSize = 0;
-                if (zcs->frameEnded) {
-                    DEBUGLOG(5, "Frame completed on flush");
-                    someMoreWork = 0;
-                    ZSTD_startNewCompression(zcs);
-                    break;
-                }
-                zcs->streamStage = zcss_load;
-                break;
-            }
-
-        default: /* impossible */
-            assert(0);
-        }
-    }
-
-    input->pos = ip - istart;
-    output->pos = op - ostart;
-    if (zcs->frameEnded) return 0;
-    {   size_t hintInSize = zcs->inBuffTarget - zcs->inBuffPos;
-        if (hintInSize==0) hintInSize = zcs->blockSize;
-        return hintInSize;
-    }
-}
-
-size_t ZSTD_compressStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
-{
-    /* check conditions */
-    if (output->pos > output->size) return ERROR(GENERIC);
-    if (input->pos  > input->size)  return ERROR(GENERIC);
-
-    return ZSTD_compressStream_generic(zcs, output, input, ZSTD_e_continue);
-}
-
-
-size_t ZSTD_compress_generic (ZSTD_CCtx* cctx,
-                              ZSTD_outBuffer* output,
-                              ZSTD_inBuffer* input,
-                              ZSTD_EndDirective endOp)
-{
-    DEBUGLOG(5, "ZSTD_compress_generic, endOp=%u ", (U32)endOp);
-    /* check conditions */
-    if (output->pos > output->size) return ERROR(GENERIC);
-    if (input->pos  > input->size)  return ERROR(GENERIC);
-    assert(cctx!=NULL);
-
-    /* transparent initialization stage */
-    if (cctx->streamStage == zcss_init) {
-        ZSTD_CCtx_params params = cctx->requestedParams;
-        ZSTD_prefixDict const prefixDict = cctx->prefixDict;
-        memset(&cctx->prefixDict, 0, sizeof(cctx->prefixDict));  /* single usage */
-        assert(prefixDict.dict==NULL || cctx->cdict==NULL);   /* only one can be set */
-        DEBUGLOG(4, "ZSTD_compress_generic : transparent init stage");
-        if (endOp == ZSTD_e_end) cctx->pledgedSrcSizePlusOne = input->size + 1;  /* auto-fix pledgedSrcSize */
-        params.cParams = ZSTD_getCParamsFromCCtxParams(
-                cctx->requestedParams, cctx->pledgedSrcSizePlusOne-1, 0 /*dictSize*/);
-
-#ifdef ZSTD_MULTITHREAD
-        if ((cctx->pledgedSrcSizePlusOne-1) <= ZSTDMT_JOBSIZE_MIN)
-            params.nbThreads = 1; /* do not invoke multi-threading when src size is too small */
-        if (params.nbThreads > 1) {
-            if (cctx->mtctx == NULL || (params.nbThreads != ZSTDMT_getNbThreads(cctx->mtctx))) {
-                DEBUGLOG(4, "ZSTD_compress_generic: creating new mtctx for nbThreads=%u (previous: %u)",
-                            params.nbThreads, ZSTDMT_getNbThreads(cctx->mtctx));
-                ZSTDMT_freeCCtx(cctx->mtctx);
-                cctx->mtctx = ZSTDMT_createCCtx_advanced(params.nbThreads, cctx->customMem);
-                if (cctx->mtctx == NULL) return ERROR(memory_allocation);
-            }
-            DEBUGLOG(4, "call ZSTDMT_initCStream_internal as nbThreads=%u", params.nbThreads);
-            CHECK_F( ZSTDMT_initCStream_internal(
-                        cctx->mtctx,
-                        prefixDict.dict, prefixDict.dictSize, ZSTD_dm_rawContent,
-                        cctx->cdict, params, cctx->pledgedSrcSizePlusOne-1) );
-            cctx->streamStage = zcss_load;
-            cctx->appliedParams.nbThreads = params.nbThreads;
-        } else
-#endif
-        {   CHECK_F( ZSTD_resetCStream_internal(
-                             cctx, prefixDict.dict, prefixDict.dictSize,
-                             prefixDict.dictMode, cctx->cdict, params,
-                             cctx->pledgedSrcSizePlusOne-1) );
-            assert(cctx->streamStage == zcss_load);
-            assert(cctx->appliedParams.nbThreads <= 1);
-    }   }
-
-    /* compression stage */
-#ifdef ZSTD_MULTITHREAD
-    if (cctx->appliedParams.nbThreads > 1) {
-        size_t const flushMin = ZSTDMT_compressStream_generic(cctx->mtctx, output, input, endOp);
-        if ( ZSTD_isError(flushMin)
-          || (endOp == ZSTD_e_end && flushMin == 0) ) { /* compression completed */
-            ZSTD_startNewCompression(cctx);
-        }
-        return flushMin;
-    }
-#endif
-    CHECK_F( ZSTD_compressStream_generic(cctx, output, input, endOp) );
-    DEBUGLOG(5, "completed ZSTD_compress_generic");
-    return cctx->outBuffContentSize - cctx->outBuffFlushedSize; /* remaining to flush */
-}
-
-size_t ZSTD_compress_generic_simpleArgs (
-                            ZSTD_CCtx* cctx,
-                            void* dst, size_t dstCapacity, size_t* dstPos,
-                      const void* src, size_t srcSize, size_t* srcPos,
-                            ZSTD_EndDirective endOp)
-{
-    ZSTD_outBuffer output = { dst, dstCapacity, *dstPos };
-    ZSTD_inBuffer  input  = { src, srcSize, *srcPos };
-    /* ZSTD_compress_generic() will check validity of dstPos and srcPos */
-    size_t const cErr = ZSTD_compress_generic(cctx, &output, &input, endOp);
-    *dstPos = output.pos;
-    *srcPos = input.pos;
-    return cErr;
-}
-
-
-/*======   Finalize   ======*/
-
-/*! ZSTD_flushStream() :
-*   @return : amount of data remaining to flush */
-size_t ZSTD_flushStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
-{
-    ZSTD_inBuffer input = { NULL, 0, 0 };
-    if (output->pos > output->size) return ERROR(GENERIC);
-    CHECK_F( ZSTD_compressStream_generic(zcs, output, &input, ZSTD_e_flush) );
-    return zcs->outBuffContentSize - zcs->outBuffFlushedSize;  /* remaining to flush */
-}
-
-
-size_t ZSTD_endStream(ZSTD_CStream* zcs, ZSTD_outBuffer* output)
-{
-    ZSTD_inBuffer input = { NULL, 0, 0 };
-    if (output->pos > output->size) return ERROR(GENERIC);
-    CHECK_F( ZSTD_compressStream_generic(zcs, output, &input, ZSTD_e_end) );
-    {   size_t const lastBlockSize = zcs->frameEnded ? 0 : ZSTD_BLOCKHEADERSIZE;
-        size_t const checksumSize = zcs->frameEnded ? 0 : zcs->appliedParams.fParams.checksumFlag * 4;
-        size_t const toFlush = zcs->outBuffContentSize - zcs->outBuffFlushedSize + lastBlockSize + checksumSize;
-        DEBUGLOG(4, "ZSTD_endStream : remaining to flush : %u", (U32)toFlush);
-        return toFlush;
-    }
-}
-
-
-/*-=====  Pre-defined compression levels  =====-*/
-
-#define ZSTD_MAX_CLEVEL     22
-int ZSTD_maxCLevel(void) { return ZSTD_MAX_CLEVEL; }
-
-static const ZSTD_compressionParameters ZSTD_defaultCParameters[4][ZSTD_MAX_CLEVEL+1] = {
-{   /* "default" - guarantees a monotonically increasing memory budget */
-    /* W,  C,  H,  S,  L, TL, strat */
-    { 18, 12, 12,  1,  7, 16, ZSTD_fast    },  /* level  0 - never used */
-    { 19, 13, 14,  1,  7, 16, ZSTD_fast    },  /* level  1 */
-    { 19, 15, 16,  1,  6, 16, ZSTD_fast    },  /* level  2 */
-    { 20, 16, 17,  1,  5, 16, ZSTD_dfast   },  /* level  3 */
-    { 20, 17, 18,  1,  5, 16, ZSTD_dfast   },  /* level  4 */
-    { 20, 17, 18,  2,  5, 16, ZSTD_greedy  },  /* level  5 */
-    { 21, 17, 19,  2,  5, 16, ZSTD_lazy    },  /* level  6 */
-    { 21, 18, 19,  3,  5, 16, ZSTD_lazy    },  /* level  7 */
-    { 21, 18, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  8 */
-    { 21, 19, 20,  3,  5, 16, ZSTD_lazy2   },  /* level  9 */
-    { 21, 19, 21,  4,  5, 16, ZSTD_lazy2   },  /* level 10 */
-    { 22, 20, 22,  4,  5, 16, ZSTD_lazy2   },  /* level 11 */
-    { 22, 20, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 12 */
-    { 22, 21, 22,  5,  5, 16, ZSTD_lazy2   },  /* level 13 */
-    { 22, 21, 22,  6,  5, 16, ZSTD_lazy2   },  /* level 14 */
-    { 22, 21, 22,  4,  5, 16, ZSTD_btlazy2 },  /* level 15 */
-    { 22, 21, 22,  4,  5, 48, ZSTD_btopt   },  /* level 16 */
-    { 23, 22, 22,  4,  4, 48, ZSTD_btopt   },  /* level 17 */
-    { 23, 22, 22,  5,  3, 64, ZSTD_btopt   },  /* level 18 */
-    { 23, 23, 22,  7,  3,128, ZSTD_btopt   },  /* level 19 */
-    { 25, 25, 23,  7,  3,128, ZSTD_btultra },  /* level 20 */
-    { 26, 26, 24,  7,  3,256, ZSTD_btultra },  /* level 21 */
-    { 27, 27, 25,  9,  3,512, ZSTD_btultra },  /* level 22 */
-},
-{   /* for srcSize <= 256 KB */
-    /* W,  C,  H,  S,  L,  T, strat */
-    {  0,  0,  0,  0,  0,  0, ZSTD_fast    },  /* level  0 - not used */
-    { 18, 13, 14,  1,  6,  8, ZSTD_fast    },  /* level  1 */
-    { 18, 14, 13,  1,  5,  8, ZSTD_dfast   },  /* level  2 */
-    { 18, 16, 15,  1,  5,  8, ZSTD_dfast   },  /* level  3 */
-    { 18, 15, 17,  1,  5,  8, ZSTD_greedy  },  /* level  4.*/
-    { 18, 16, 17,  4,  5,  8, ZSTD_greedy  },  /* level  5.*/
-    { 18, 16, 17,  3,  5,  8, ZSTD_lazy    },  /* level  6.*/
-    { 18, 17, 17,  4,  4,  8, ZSTD_lazy    },  /* level  7 */
-    { 18, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
-    { 18, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
-    { 18, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
-    { 18, 18, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 11.*/
-    { 18, 18, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 12.*/
-    { 18, 19, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13 */
-    { 18, 18, 18,  4,  4, 16, ZSTD_btopt   },  /* level 14.*/
-    { 18, 18, 18,  4,  3, 16, ZSTD_btopt   },  /* level 15.*/
-    { 18, 19, 18,  6,  3, 32, ZSTD_btopt   },  /* level 16.*/
-    { 18, 19, 18,  8,  3, 64, ZSTD_btopt   },  /* level 17.*/
-    { 18, 19, 18,  9,  3,128, ZSTD_btopt   },  /* level 18.*/
-    { 18, 19, 18, 10,  3,256, ZSTD_btopt   },  /* level 19.*/
-    { 18, 19, 18, 11,  3,512, ZSTD_btultra },  /* level 20.*/
-    { 18, 19, 18, 12,  3,512, ZSTD_btultra },  /* level 21.*/
-    { 18, 19, 18, 13,  3,512, ZSTD_btultra },  /* level 22.*/
-},
-{   /* for srcSize <= 128 KB */
-    /* W,  C,  H,  S,  L,  T, strat */
-    { 17, 12, 12,  1,  7,  8, ZSTD_fast    },  /* level  0 - not used */
-    { 17, 12, 13,  1,  6,  8, ZSTD_fast    },  /* level  1 */
-    { 17, 13, 16,  1,  5,  8, ZSTD_fast    },  /* level  2 */
-    { 17, 16, 16,  2,  5,  8, ZSTD_dfast   },  /* level  3 */
-    { 17, 13, 15,  3,  4,  8, ZSTD_greedy  },  /* level  4 */
-    { 17, 15, 17,  4,  4,  8, ZSTD_greedy  },  /* level  5 */
-    { 17, 16, 17,  3,  4,  8, ZSTD_lazy    },  /* level  6 */
-    { 17, 15, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  7 */
-    { 17, 17, 17,  4,  4,  8, ZSTD_lazy2   },  /* level  8 */
-    { 17, 17, 17,  5,  4,  8, ZSTD_lazy2   },  /* level  9 */
-    { 17, 17, 17,  6,  4,  8, ZSTD_lazy2   },  /* level 10 */
-    { 17, 17, 17,  7,  4,  8, ZSTD_lazy2   },  /* level 11 */
-    { 17, 17, 17,  8,  4,  8, ZSTD_lazy2   },  /* level 12 */
-    { 17, 18, 17,  6,  4,  8, ZSTD_btlazy2 },  /* level 13.*/
-    { 17, 17, 17,  7,  3,  8, ZSTD_btopt   },  /* level 14.*/
-    { 17, 17, 17,  7,  3, 16, ZSTD_btopt   },  /* level 15.*/
-    { 17, 18, 17,  7,  3, 32, ZSTD_btopt   },  /* level 16.*/
-    { 17, 18, 17,  7,  3, 64, ZSTD_btopt   },  /* level 17.*/
-    { 17, 18, 17,  7,  3,256, ZSTD_btopt   },  /* level 18.*/
-    { 17, 18, 17,  8,  3,256, ZSTD_btopt   },  /* level 19.*/
-    { 17, 18, 17,  9,  3,256, ZSTD_btultra },  /* level 20.*/
-    { 17, 18, 17, 10,  3,256, ZSTD_btultra },  /* level 21.*/
-    { 17, 18, 17, 11,  3,512, ZSTD_btultra },  /* level 22.*/
-},
-{   /* for srcSize <= 16 KB */
-    /* W,  C,  H,  S,  L,  T, strat */
-    { 14, 12, 12,  1,  7,  6, ZSTD_fast    },  /* level  0 - not used */
-    { 14, 14, 14,  1,  6,  6, ZSTD_fast    },  /* level  1 */
-    { 14, 14, 14,  1,  4,  6, ZSTD_fast    },  /* level  2 */
-    { 14, 14, 14,  1,  4,  6, ZSTD_dfast   },  /* level  3.*/
-    { 14, 14, 14,  4,  4,  6, ZSTD_greedy  },  /* level  4.*/
-    { 14, 14, 14,  3,  4,  6, ZSTD_lazy    },  /* level  5.*/
-    { 14, 14, 14,  4,  4,  6, ZSTD_lazy2   },  /* level  6 */
-    { 14, 14, 14,  5,  4,  6, ZSTD_lazy2   },  /* level  7 */
-    { 14, 14, 14,  6,  4,  6, ZSTD_lazy2   },  /* level  8.*/
-    { 14, 15, 14,  6,  4,  6, ZSTD_btlazy2 },  /* level  9.*/
-    { 14, 15, 14,  3,  3,  6, ZSTD_btopt   },  /* level 10.*/
-    { 14, 15, 14,  6,  3,  8, ZSTD_btopt   },  /* level 11.*/
-    { 14, 15, 14,  6,  3, 16, ZSTD_btopt   },  /* level 12.*/
-    { 14, 15, 14,  6,  3, 24, ZSTD_btopt   },  /* level 13.*/
-    { 14, 15, 15,  6,  3, 48, ZSTD_btopt   },  /* level 14.*/
-    { 14, 15, 15,  6,  3, 64, ZSTD_btopt   },  /* level 15.*/
-    { 14, 15, 15,  6,  3, 96, ZSTD_btopt   },  /* level 16.*/
-    { 14, 15, 15,  6,  3,128, ZSTD_btopt   },  /* level 17.*/
-    { 14, 15, 15,  6,  3,256, ZSTD_btopt   },  /* level 18.*/
-    { 14, 15, 15,  7,  3,256, ZSTD_btopt   },  /* level 19.*/
-    { 14, 15, 15,  8,  3,256, ZSTD_btultra },  /* level 20.*/
-    { 14, 15, 15,  9,  3,256, ZSTD_btultra },  /* level 21.*/
-    { 14, 15, 15, 10,  3,256, ZSTD_btultra },  /* level 22.*/
-},
-};
-
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG>=1)
-/* This function just controls
- * the monotonic memory budget increase of ZSTD_defaultCParameters[0].
- * Run once, on first ZSTD_getCParams() usage, if ZSTD_DEBUG is enabled
- */
-MEM_STATIC void ZSTD_check_compressionLevel_monotonicIncrease_memoryBudget(void)
-{
-    int level;
-    for (level=1; level=1)
-    static int g_monotonicTest = 1;
-    if (g_monotonicTest) {
-        ZSTD_check_compressionLevel_monotonicIncrease_memoryBudget();
-        g_monotonicTest=0;
-    }
-#endif
-
-    DEBUGLOG(4, "ZSTD_getCParams: cLevel=%i, srcSize=%u, dictSize=%u => table %u",
-                compressionLevel, (U32)srcSizeHint, (U32)dictSize, tableID);
-    if (compressionLevel <= 0) compressionLevel = ZSTD_CLEVEL_DEFAULT;   /* 0 == default; no negative compressionLevel yet */
-    if (compressionLevel > ZSTD_MAX_CLEVEL) compressionLevel = ZSTD_MAX_CLEVEL;
-    { ZSTD_compressionParameters const cp = ZSTD_defaultCParameters[tableID][compressionLevel];
-      return ZSTD_adjustCParams_internal(cp, srcSizeHint, dictSize); }
-
-}
-
-/*! ZSTD_getParams() :
-*   same as ZSTD_getCParams(), but @return a `ZSTD_parameters` object (instead of `ZSTD_compressionParameters`).
-*   All fields of `ZSTD_frameParameters` are set to default (0) */
-ZSTD_parameters ZSTD_getParams(int compressionLevel, unsigned long long srcSizeHint, size_t dictSize) {
-    ZSTD_parameters params;
-    ZSTD_compressionParameters const cParams = ZSTD_getCParams(compressionLevel, srcSizeHint, dictSize);
-    memset(¶ms, 0, sizeof(params));
-    params.cParams = cParams;
-    params.fParams.contentSizeFlag = 1;
-    return params;
-}
diff --git a/priv/zstd/lib/compress/zstd_compress_internal.h b/priv/zstd/lib/compress/zstd_compress_internal.h
deleted file mode 100644
index f104fe9..0000000
--- a/priv/zstd/lib/compress/zstd_compress_internal.h
+++ /dev/null
@@ -1,462 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/* This header contains definitions
- * that shall **only** be used by modules within lib/compress.
- */
-
-#ifndef ZSTD_COMPRESS_H
-#define ZSTD_COMPRESS_H
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include "zstd_internal.h"
-#ifdef ZSTD_MULTITHREAD
-#  include "zstdmt_compress.h"
-#endif
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/*-*************************************
-*  Constants
-***************************************/
-static const U32 g_searchStrength = 8;
-#define HASH_READ_SIZE 8
-
-
-/*-*************************************
-*  Context memory management
-***************************************/
-typedef enum { ZSTDcs_created=0, ZSTDcs_init, ZSTDcs_ongoing, ZSTDcs_ending } ZSTD_compressionStage_e;
-typedef enum { zcss_init=0, zcss_load, zcss_flush } ZSTD_cStreamStage;
-
-typedef struct ZSTD_prefixDict_s {
-    const void* dict;
-    size_t dictSize;
-    ZSTD_dictMode_e dictMode;
-} ZSTD_prefixDict;
-
-typedef struct {
-    U32 hufCTable[HUF_CTABLE_SIZE_U32(255)];
-    FSE_CTable offcodeCTable[FSE_CTABLE_SIZE_U32(OffFSELog, MaxOff)];
-    FSE_CTable matchlengthCTable[FSE_CTABLE_SIZE_U32(MLFSELog, MaxML)];
-    FSE_CTable litlengthCTable[FSE_CTABLE_SIZE_U32(LLFSELog, MaxLL)];
-    U32 workspace[HUF_WORKSPACE_SIZE_U32];
-    HUF_repeat hufCTable_repeatMode;
-    FSE_repeat offcode_repeatMode;
-    FSE_repeat matchlength_repeatMode;
-    FSE_repeat litlength_repeatMode;
-} ZSTD_entropyCTables_t;
-
-typedef struct {
-    U32 off;
-    U32 len;
-} ZSTD_match_t;
-
-typedef struct {
-    int price;
-    U32 off;
-    U32 mlen;
-    U32 litlen;
-    U32 rep[ZSTD_REP_NUM];
-} ZSTD_optimal_t;
-
-typedef struct {
-    /* All tables are allocated inside cctx->workspace by ZSTD_resetCCtx_internal() */
-    U32* litFreq;               /* table of literals statistics, of size 256 */
-    U32* litLengthFreq;         /* table of litLength statistics, of size (MaxLL+1) */
-    U32* matchLengthFreq;       /* table of matchLength statistics, of size (MaxML+1) */
-    U32* offCodeFreq;           /* table of offCode statistics, of size (MaxOff+1) */
-    ZSTD_match_t* matchTable;   /* list of found matches, of size ZSTD_OPT_NUM+1 */
-    ZSTD_optimal_t* priceTable; /* All positions tracked by optimal parser, of size ZSTD_OPT_NUM+1 */
-
-    U32  litSum;                 /* nb of literals */
-    U32  litLengthSum;           /* nb of litLength codes */
-    U32  matchLengthSum;         /* nb of matchLength codes */
-    U32  offCodeSum;             /* nb of offset codes */
-    /* begin updated by ZSTD_setLog2Prices */
-    U32  log2litSum;             /* pow2 to compare log2(litfreq) to */
-    U32  log2litLengthSum;       /* pow2 to compare log2(llfreq) to */
-    U32  log2matchLengthSum;     /* pow2 to compare log2(mlfreq) to */
-    U32  log2offCodeSum;         /* pow2 to compare log2(offreq) to */
-    /* end : updated by ZSTD_setLog2Prices */
-    U32  staticPrices;           /* prices follow a pre-defined cost structure, statistics are irrelevant */
-} optState_t;
-
-typedef struct {
-    U32 offset;
-    U32 checksum;
-} ldmEntry_t;
-
-typedef struct {
-    ldmEntry_t* hashTable;
-    BYTE* bucketOffsets;    /* Next position in bucket to insert entry */
-    U64 hashPower;          /* Used to compute the rolling hash.
-                             * Depends on ldmParams.minMatchLength */
-} ldmState_t;
-
-typedef struct {
-    U32 enableLdm;          /* 1 if enable long distance matching */
-    U32 hashLog;            /* Log size of hashTable */
-    U32 bucketSizeLog;      /* Log bucket size for collision resolution, at most 8 */
-    U32 minMatchLength;     /* Minimum match length */
-    U32 hashEveryLog;       /* Log number of entries to skip */
-} ldmParams_t;
-
-struct ZSTD_CCtx_params_s {
-    ZSTD_format_e format;
-    ZSTD_compressionParameters cParams;
-    ZSTD_frameParameters fParams;
-
-    int compressionLevel;
-    U32 forceWindow;           /* force back-references to respect limit of
-                                * 1< 63) ? ZSTD_highbit32(litLength) + LL_deltaCode : LL_Code[litLength];
-}
-
-/* ZSTD_MLcode() :
- * note : mlBase = matchLength - MINMATCH;
- *        because it's the format it's stored in seqStore->sequences */
-MEM_STATIC U32 ZSTD_MLcode(U32 mlBase)
-{
-    static const BYTE ML_Code[128] = { 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
-                                      16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
-                                      32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 36, 36, 37, 37, 37, 37,
-                                      38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39,
-                                      40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,
-                                      41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41,
-                                      42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42,
-                                      42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42 };
-    static const U32 ML_deltaCode = 36;
-    return (mlBase > 127) ? ZSTD_highbit32(mlBase) + ML_deltaCode : ML_Code[mlBase];
-}
-
-/*! ZSTD_storeSeq() :
- *  Store a sequence (literal length, literals, offset code and match length code) into seqStore_t.
- *  `offsetCode` : distance to match + 3 (values 1-3 are repCodes).
- *  `mlBase` : matchLength - MINMATCH
-*/
-MEM_STATIC void ZSTD_storeSeq(seqStore_t* seqStorePtr, size_t litLength, const void* literals, U32 offsetCode, size_t mlBase)
-{
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG >= 6)
-    static const BYTE* g_start = NULL;
-    if (g_start==NULL) g_start = (const BYTE*)literals;  /* note : index only works for compression within a single segment */
-    {   U32 const pos = (U32)((const BYTE*)literals - g_start);
-        DEBUGLOG(6, "Cpos%7u :%3u literals, match%3u bytes at dist.code%7u",
-               pos, (U32)litLength, (U32)mlBase+MINMATCH, (U32)offsetCode);
-    }
-#endif
-    /* copy Literals */
-    assert(seqStorePtr->lit + litLength <= seqStorePtr->litStart + 128 KB);
-    ZSTD_wildcopy(seqStorePtr->lit, literals, litLength);
-    seqStorePtr->lit += litLength;
-
-    /* literal Length */
-    if (litLength>0xFFFF) {
-        assert(seqStorePtr->longLengthID == 0); /* there can only be a single long length */
-        seqStorePtr->longLengthID = 1;
-        seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-    }
-    seqStorePtr->sequences[0].litLength = (U16)litLength;
-
-    /* match offset */
-    seqStorePtr->sequences[0].offset = offsetCode + 1;
-
-    /* match Length */
-    if (mlBase>0xFFFF) {
-        assert(seqStorePtr->longLengthID == 0); /* there can only be a single long length */
-        seqStorePtr->longLengthID = 2;
-        seqStorePtr->longLengthPos = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-    }
-    seqStorePtr->sequences[0].matchLength = (U16)mlBase;
-
-    seqStorePtr->sequences++;
-}
-
-
-/*-*************************************
-*  Match length counter
-***************************************/
-static unsigned ZSTD_NbCommonBytes (size_t val)
-{
-    if (MEM_isLittleEndian()) {
-        if (MEM_64bits()) {
-#       if defined(_MSC_VER) && defined(_WIN64)
-            unsigned long r = 0;
-            _BitScanForward64( &r, (U64)val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 4)
-            return (__builtin_ctzll((U64)val) >> 3);
-#       else
-            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2,
-                                                     0, 3, 1, 3, 1, 4, 2, 7,
-                                                     0, 2, 3, 6, 1, 5, 3, 5,
-                                                     1, 3, 4, 4, 2, 5, 6, 7,
-                                                     7, 0, 1, 2, 3, 3, 4, 6,
-                                                     2, 6, 5, 5, 3, 4, 5, 6,
-                                                     7, 1, 2, 4, 6, 4, 4, 5,
-                                                     7, 2, 6, 5, 7, 6, 7, 7 };
-            return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
-#       endif
-        } else { /* 32 bits */
-#       if defined(_MSC_VER)
-            unsigned long r=0;
-            _BitScanForward( &r, (U32)val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_ctz((U32)val) >> 3);
-#       else
-            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0,
-                                                     3, 2, 2, 1, 3, 2, 0, 1,
-                                                     3, 3, 1, 2, 2, 2, 2, 0,
-                                                     3, 1, 2, 0, 1, 0, 1, 1 };
-            return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
-#       endif
-        }
-    } else {  /* Big Endian CPU */
-        if (MEM_64bits()) {
-#       if defined(_MSC_VER) && defined(_WIN64)
-            unsigned long r = 0;
-            _BitScanReverse64( &r, val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 4)
-            return (__builtin_clzll(val) >> 3);
-#       else
-            unsigned r;
-            const unsigned n32 = sizeof(size_t)*4;   /* calculate this way due to compiler complaining in 32-bits mode */
-            if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
-            if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
-            r += (!val);
-            return r;
-#       endif
-        } else { /* 32 bits */
-#       if defined(_MSC_VER)
-            unsigned long r = 0;
-            _BitScanReverse( &r, (unsigned long)val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_clz((U32)val) >> 3);
-#       else
-            unsigned r;
-            if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
-            r += (!val);
-            return r;
-#       endif
-    }   }
-}
-
-
-MEM_STATIC size_t ZSTD_count(const BYTE* pIn, const BYTE* pMatch, const BYTE* const pInLimit)
-{
-    const BYTE* const pStart = pIn;
-    const BYTE* const pInLoopLimit = pInLimit - (sizeof(size_t)-1);
-
-    if (pIn < pInLoopLimit) {
-        { size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
-          if (diff) return ZSTD_NbCommonBytes(diff); }
-        pIn+=sizeof(size_t); pMatch+=sizeof(size_t);
-        while (pIn < pInLoopLimit) {
-            size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
-            if (!diff) { pIn+=sizeof(size_t); pMatch+=sizeof(size_t); continue; }
-            pIn += ZSTD_NbCommonBytes(diff);
-            return (size_t)(pIn - pStart);
-    }   }
-    if (MEM_64bits() && (pIn<(pInLimit-3)) && (MEM_read32(pMatch) == MEM_read32(pIn))) { pIn+=4; pMatch+=4; }
-    if ((pIn<(pInLimit-1)) && (MEM_read16(pMatch) == MEM_read16(pIn))) { pIn+=2; pMatch+=2; }
-    if ((pIn> (32-h) ; }
-MEM_STATIC size_t ZSTD_hash3Ptr(const void* ptr, U32 h) { return ZSTD_hash3(MEM_readLE32(ptr), h); } /* only in zstd_opt.h */
-
-static const U32 prime4bytes = 2654435761U;
-static U32    ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32-h) ; }
-static size_t ZSTD_hash4Ptr(const void* ptr, U32 h) { return ZSTD_hash4(MEM_read32(ptr), h); }
-
-static const U64 prime5bytes = 889523592379ULL;
-static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u  << (64-40)) * prime5bytes) >> (64-h)) ; }
-static size_t ZSTD_hash5Ptr(const void* p, U32 h) { return ZSTD_hash5(MEM_readLE64(p), h); }
-
-static const U64 prime6bytes = 227718039650203ULL;
-static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u  << (64-48)) * prime6bytes) >> (64-h)) ; }
-static size_t ZSTD_hash6Ptr(const void* p, U32 h) { return ZSTD_hash6(MEM_readLE64(p), h); }
-
-static const U64 prime7bytes = 58295818150454627ULL;
-static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u  << (64-56)) * prime7bytes) >> (64-h)) ; }
-static size_t ZSTD_hash7Ptr(const void* p, U32 h) { return ZSTD_hash7(MEM_readLE64(p), h); }
-
-static const U64 prime8bytes = 0xCF1BBCDCB7A56463ULL;
-static size_t ZSTD_hash8(U64 u, U32 h) { return (size_t)(((u) * prime8bytes) >> (64-h)) ; }
-static size_t ZSTD_hash8Ptr(const void* p, U32 h) { return ZSTD_hash8(MEM_readLE64(p), h); }
-
-MEM_STATIC size_t ZSTD_hashPtr(const void* p, U32 hBits, U32 mls)
-{
-    switch(mls)
-    {
-    default:
-    case 4: return ZSTD_hash4Ptr(p, hBits);
-    case 5: return ZSTD_hash5Ptr(p, hBits);
-    case 6: return ZSTD_hash6Ptr(p, hBits);
-    case 7: return ZSTD_hash7Ptr(p, hBits);
-    case 8: return ZSTD_hash8Ptr(p, hBits);
-    }
-}
-
-#if defined (__cplusplus)
-}
-#endif
-
-
-/* ==============================================================
- * Private declarations
- * These prototypes shall only be called from within lib/compress
- * ============================================================== */
-
-/*! ZSTD_initCStream_internal() :
- *  Private use only. Init streaming operation.
- *  expects params to be valid.
- *  must receive dict, or cdict, or none, but not both.
- *  @return : 0, or an error code */
-size_t ZSTD_initCStream_internal(ZSTD_CStream* zcs,
-                     const void* dict, size_t dictSize,
-                     const ZSTD_CDict* cdict,
-                     ZSTD_CCtx_params  params, unsigned long long pledgedSrcSize);
-
-/*! ZSTD_compressStream_generic() :
- *  Private use only. To be called from zstdmt_compress.c in single-thread mode. */
-size_t ZSTD_compressStream_generic(ZSTD_CStream* zcs,
-                                   ZSTD_outBuffer* output,
-                                   ZSTD_inBuffer* input,
-                                   ZSTD_EndDirective const flushMode);
-
-/*! ZSTD_getCParamsFromCDict() :
- *  as the name implies */
-ZSTD_compressionParameters ZSTD_getCParamsFromCDict(const ZSTD_CDict* cdict);
-
-/* ZSTD_compressBegin_advanced_internal() :
- * Private use only. To be called from zstdmt_compress.c. */
-size_t ZSTD_compressBegin_advanced_internal(ZSTD_CCtx* cctx,
-                                    const void* dict, size_t dictSize,
-                                    ZSTD_dictMode_e dictMode,
-                                    const ZSTD_CDict* cdict,
-                                    ZSTD_CCtx_params params,
-                                    unsigned long long pledgedSrcSize);
-
-/* ZSTD_compress_advanced_internal() :
- * Private use only. To be called from zstdmt_compress.c. */
-size_t ZSTD_compress_advanced_internal(ZSTD_CCtx* cctx,
-                                       void* dst, size_t dstCapacity,
-                                 const void* src, size_t srcSize,
-                                 const void* dict,size_t dictSize,
-                                 ZSTD_CCtx_params params);
-
-#endif /* ZSTD_COMPRESS_H */
diff --git a/priv/zstd/lib/compress/zstd_double_fast.c b/priv/zstd/lib/compress/zstd_double_fast.c
deleted file mode 100644
index fee5127..0000000
--- a/priv/zstd/lib/compress/zstd_double_fast.c
+++ /dev/null
@@ -1,309 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#include "zstd_compress_internal.h"
-#include "zstd_double_fast.h"
-
-
-void ZSTD_fillDoubleHashTable(ZSTD_CCtx* cctx, const void* end, const U32 mls)
-{
-    U32* const hashLarge = cctx->hashTable;
-    U32  const hBitsL = cctx->appliedParams.cParams.hashLog;
-    U32* const hashSmall = cctx->chainTable;
-    U32  const hBitsS = cctx->appliedParams.cParams.chainLog;
-    const BYTE* const base = cctx->base;
-    const BYTE* ip = base + cctx->nextToUpdate;
-    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
-    const size_t fastHashFillStep = 3;
-
-    while(ip <= iend) {
-        hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip - base);
-        hashLarge[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip - base);
-        ip += fastHashFillStep;
-    }
-}
-
-
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_compressBlock_doubleFast_generic(ZSTD_CCtx* cctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
-{
-    U32* const hashLong = cctx->hashTable;
-    const U32 hBitsL = cctx->appliedParams.cParams.hashLog;
-    U32* const hashSmall = cctx->chainTable;
-    const U32 hBitsS = cctx->appliedParams.cParams.chainLog;
-    seqStore_t* seqStorePtr = &(cctx->seqStore);
-    const BYTE* const base = cctx->base;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32 lowestIndex = cctx->dictLimit;
-    const BYTE* const lowest = base + lowestIndex;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - HASH_READ_SIZE;
-    U32 offset_1=seqStorePtr->rep[0], offset_2=seqStorePtr->rep[1];
-    U32 offsetSaved = 0;
-
-    /* init */
-    ip += (ip==lowest);
-    {   U32 const maxRep = (U32)(ip-lowest);
-        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
-        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
-    }
-
-    /* Main Search Loop */
-    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
-        size_t mLength;
-        size_t const h2 = ZSTD_hashPtr(ip, hBitsL, 8);
-        size_t const h = ZSTD_hashPtr(ip, hBitsS, mls);
-        U32 const current = (U32)(ip-base);
-        U32 const matchIndexL = hashLong[h2];
-        U32 const matchIndexS = hashSmall[h];
-        const BYTE* matchLong = base + matchIndexL;
-        const BYTE* match = base + matchIndexS;
-        hashLong[h2] = hashSmall[h] = current;   /* update hash tables */
-
-        assert(offset_1 <= current);   /* supposed guaranteed by construction */
-        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
-            /* favor repcode */
-            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            U32 offset;
-            if ( (matchIndexL > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip)) ) {
-                mLength = ZSTD_count(ip+8, matchLong+8, iend) + 8;
-                offset = (U32)(ip-matchLong);
-                while (((ip>anchor) & (matchLong>lowest)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; } /* catch up */
-            } else if ( (matchIndexS > lowestIndex) && (MEM_read32(match) == MEM_read32(ip)) ) {
-                size_t const hl3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
-                U32 const matchIndexL3 = hashLong[hl3];
-                const BYTE* matchL3 = base + matchIndexL3;
-                hashLong[hl3] = current + 1;
-                if ( (matchIndexL3 > lowestIndex) && (MEM_read64(matchL3) == MEM_read64(ip+1)) ) {
-                    mLength = ZSTD_count(ip+9, matchL3+8, iend) + 8;
-                    ip++;
-                    offset = (U32)(ip-matchL3);
-                    while (((ip>anchor) & (matchL3>lowest)) && (ip[-1] == matchL3[-1])) { ip--; matchL3--; mLength++; } /* catch up */
-                } else {
-                    mLength = ZSTD_count(ip+4, match+4, iend) + 4;
-                    offset = (U32)(ip-match);
-                    while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
-                }
-            } else {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-            }
-
-            offset_2 = offset_1;
-            offset_1 = offset;
-
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-        }
-
-        /* match found */
-        ip += mLength;
-        anchor = ip;
-
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] =
-                hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;  /* here because current+2 could be > iend-8 */
-            hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] =
-                hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
-
-            /* check immediate repcode */
-            while ( (ip <= ilimit)
-                 && ( (offset_2>0)
-                 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
-                /* store sequence */
-                size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
-                { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; } /* swap offset_2 <=> offset_1 */
-                hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = (U32)(ip-base);
-                hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = (U32)(ip-base);
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
-                ip += rLength;
-                anchor = ip;
-                continue;   /* faster when present ... (?) */
-    }   }   }
-
-    /* save reps for next block */
-    seqStorePtr->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-    seqStorePtr->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_doubleFast(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    const U32 mls = ctx->appliedParams.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        return ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 4);
-    case 5 :
-        return ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 5);
-    case 6 :
-        return ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 6);
-    case 7 :
-        return ZSTD_compressBlock_doubleFast_generic(ctx, src, srcSize, 7);
-    }
-}
-
-
-static size_t ZSTD_compressBlock_doubleFast_extDict_generic(ZSTD_CCtx* ctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
-{
-    U32* const hashLong = ctx->hashTable;
-    U32  const hBitsL = ctx->appliedParams.cParams.hashLog;
-    U32* const hashSmall = ctx->chainTable;
-    U32  const hBitsS = ctx->appliedParams.cParams.chainLog;
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const base = ctx->base;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = ctx->lowLimit;
-    const BYTE* const dictStart = dictBase + lowestIndex;
-    const U32   dictLimit = ctx->dictLimit;
-    const BYTE* const lowPrefixPtr = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    U32 offset_1=seqStorePtr->rep[0], offset_2=seqStorePtr->rep[1];
-
-    /* Search Loop */
-    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
-        const size_t hSmall = ZSTD_hashPtr(ip, hBitsS, mls);
-        const U32 matchIndex = hashSmall[hSmall];
-        const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
-        const BYTE* match = matchBase + matchIndex;
-
-        const size_t hLong = ZSTD_hashPtr(ip, hBitsL, 8);
-        const U32 matchLongIndex = hashLong[hLong];
-        const BYTE* matchLongBase = matchLongIndex < dictLimit ? dictBase : base;
-        const BYTE* matchLong = matchLongBase + matchLongIndex;
-
-        const U32 current = (U32)(ip-base);
-        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
-        const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
-        const BYTE* repMatch = repBase + repIndex;
-        size_t mLength;
-        hashSmall[hSmall] = hashLong[hLong] = current;   /* update hash table */
-
-        if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
-           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
-            const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, lowPrefixPtr) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            if ((matchLongIndex > lowestIndex) && (MEM_read64(matchLong) == MEM_read64(ip))) {
-                const BYTE* matchEnd = matchLongIndex < dictLimit ? dictEnd : iend;
-                const BYTE* lowMatchPtr = matchLongIndex < dictLimit ? dictStart : lowPrefixPtr;
-                U32 offset;
-                mLength = ZSTD_count_2segments(ip+8, matchLong+8, iend, matchEnd, lowPrefixPtr) + 8;
-                offset = current - matchLongIndex;
-                while (((ip>anchor) & (matchLong>lowMatchPtr)) && (ip[-1] == matchLong[-1])) { ip--; matchLong--; mLength++; }   /* catch up */
-                offset_2 = offset_1;
-                offset_1 = offset;
-                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-
-            } else if ((matchIndex > lowestIndex) && (MEM_read32(match) == MEM_read32(ip))) {
-                size_t const h3 = ZSTD_hashPtr(ip+1, hBitsL, 8);
-                U32 const matchIndex3 = hashLong[h3];
-                const BYTE* const match3Base = matchIndex3 < dictLimit ? dictBase : base;
-                const BYTE* match3 = match3Base + matchIndex3;
-                U32 offset;
-                hashLong[h3] = current + 1;
-                if ( (matchIndex3 > lowestIndex) && (MEM_read64(match3) == MEM_read64(ip+1)) ) {
-                    const BYTE* matchEnd = matchIndex3 < dictLimit ? dictEnd : iend;
-                    const BYTE* lowMatchPtr = matchIndex3 < dictLimit ? dictStart : lowPrefixPtr;
-                    mLength = ZSTD_count_2segments(ip+9, match3+8, iend, matchEnd, lowPrefixPtr) + 8;
-                    ip++;
-                    offset = current+1 - matchIndex3;
-                    while (((ip>anchor) & (match3>lowMatchPtr)) && (ip[-1] == match3[-1])) { ip--; match3--; mLength++; } /* catch up */
-                } else {
-                    const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-                    const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-                    mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, lowPrefixPtr) + 4;
-                    offset = current - matchIndex;
-                    while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
-                }
-                offset_2 = offset_1;
-                offset_1 = offset;
-                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-
-            } else {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-        }   }
-
-        /* found a match : store it */
-        ip += mLength;
-        anchor = ip;
-
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashSmall[ZSTD_hashPtr(base+current+2, hBitsS, mls)] = current+2;
-            hashLong[ZSTD_hashPtr(base+current+2, hBitsL, 8)] = current+2;
-            hashSmall[ZSTD_hashPtr(ip-2, hBitsS, mls)] = (U32)(ip-2-base);
-            hashLong[ZSTD_hashPtr(ip-2, hBitsL, 8)] = (U32)(ip-2-base);
-            /* check immediate repcode */
-            while (ip <= ilimit) {
-                U32 const current2 = (U32)(ip-base);
-                U32 const repIndex2 = current2 - offset_2;
-                const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-                if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
-                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
-                    const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, lowPrefixPtr) + 4;
-                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
-                    ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
-                    hashSmall[ZSTD_hashPtr(ip, hBitsS, mls)] = current2;
-                    hashLong[ZSTD_hashPtr(ip, hBitsL, 8)] = current2;
-                    ip += repLength2;
-                    anchor = ip;
-                    continue;
-                }
-                break;
-    }   }   }
-
-    /* save reps for next block */
-    seqStorePtr->repToConfirm[0] = offset_1; seqStorePtr->repToConfirm[1] = offset_2;
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx* ctx,
-                         const void* src, size_t srcSize)
-{
-    U32 const mls = ctx->appliedParams.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        return ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 4);
-    case 5 :
-        return ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 5);
-    case 6 :
-        return ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 6);
-    case 7 :
-        return ZSTD_compressBlock_doubleFast_extDict_generic(ctx, src, srcSize, 7);
-    }
-}
diff --git a/priv/zstd/lib/compress/zstd_double_fast.h b/priv/zstd/lib/compress/zstd_double_fast.h
deleted file mode 100644
index 75e0415..0000000
--- a/priv/zstd/lib/compress/zstd_double_fast.h
+++ /dev/null
@@ -1,29 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_DOUBLE_FAST_H
-#define ZSTD_DOUBLE_FAST_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#include "mem.h"      /* U32 */
-#include "zstd.h"     /* ZSTD_CCtx, size_t */
-
-void ZSTD_fillDoubleHashTable(ZSTD_CCtx* cctx, const void* end, const U32 mls);
-size_t ZSTD_compressBlock_doubleFast(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_doubleFast_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_DOUBLE_FAST_H */
diff --git a/priv/zstd/lib/compress/zstd_fast.c b/priv/zstd/lib/compress/zstd_fast.c
deleted file mode 100644
index 7b56c3d..0000000
--- a/priv/zstd/lib/compress/zstd_fast.c
+++ /dev/null
@@ -1,243 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#include "zstd_compress_internal.h"
-#include "zstd_fast.h"
-
-
-void ZSTD_fillHashTable (ZSTD_CCtx* zc, const void* end, const U32 mls)
-{
-    U32* const hashTable = zc->hashTable;
-    U32  const hBits = zc->appliedParams.cParams.hashLog;
-    const BYTE* const base = zc->base;
-    const BYTE* ip = base + zc->nextToUpdate;
-    const BYTE* const iend = ((const BYTE*)end) - HASH_READ_SIZE;
-    const size_t fastHashFillStep = 3;
-
-    while(ip <= iend) {
-        hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip - base);
-        ip += fastHashFillStep;
-    }
-}
-
-
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_compressBlock_fast_generic(ZSTD_CCtx* cctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
-{
-    U32* const hashTable = cctx->hashTable;
-    U32  const hBits = cctx->appliedParams.cParams.hashLog;
-    seqStore_t* seqStorePtr = &(cctx->seqStore);
-    const BYTE* const base = cctx->base;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = cctx->dictLimit;
-    const BYTE* const lowest = base + lowestIndex;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - HASH_READ_SIZE;
-    U32 offset_1=seqStorePtr->rep[0], offset_2=seqStorePtr->rep[1];
-    U32 offsetSaved = 0;
-
-    /* init */
-    ip += (ip==lowest);
-    {   U32 const maxRep = (U32)(ip-lowest);
-        if (offset_2 > maxRep) offsetSaved = offset_2, offset_2 = 0;
-        if (offset_1 > maxRep) offsetSaved = offset_1, offset_1 = 0;
-    }
-
-    /* Main Search Loop */
-    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
-        size_t mLength;
-        size_t const h = ZSTD_hashPtr(ip, hBits, mls);
-        U32 const current = (U32)(ip-base);
-        U32 const matchIndex = hashTable[h];
-        const BYTE* match = base + matchIndex;
-        hashTable[h] = current;   /* update hash table */
-
-        if ((offset_1 > 0) & (MEM_read32(ip+1-offset_1) == MEM_read32(ip+1))) {
-            mLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            U32 offset;
-            if ( (matchIndex <= lowestIndex) || (MEM_read32(match) != MEM_read32(ip)) ) {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-            }
-            mLength = ZSTD_count(ip+4, match+4, iend) + 4;
-            offset = (U32)(ip-match);
-            while (((ip>anchor) & (match>lowest)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; } /* catch up */
-            offset_2 = offset_1;
-            offset_1 = offset;
-
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-        }
-
-        /* match found */
-        ip += mLength;
-        anchor = ip;
-
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;  /* here because current+2 could be > iend-8 */
-            hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
-            /* check immediate repcode */
-            while ( (ip <= ilimit)
-                 && ( (offset_2>0)
-                 & (MEM_read32(ip) == MEM_read32(ip - offset_2)) )) {
-                /* store sequence */
-                size_t const rLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
-                { U32 const tmpOff = offset_2; offset_2 = offset_1; offset_1 = tmpOff; }  /* swap offset_2 <=> offset_1 */
-                hashTable[ZSTD_hashPtr(ip, hBits, mls)] = (U32)(ip-base);
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
-                ip += rLength;
-                anchor = ip;
-                continue;   /* faster when present ... (?) */
-    }   }   }
-
-    /* save reps for next block */
-    seqStorePtr->repToConfirm[0] = offset_1 ? offset_1 : offsetSaved;
-    seqStorePtr->repToConfirm[1] = offset_2 ? offset_2 : offsetSaved;
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_fast(ZSTD_CCtx* ctx,
-                       const void* src, size_t srcSize)
-{
-    const U32 mls = ctx->appliedParams.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        return ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 4);
-    case 5 :
-        return ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 5);
-    case 6 :
-        return ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 6);
-    case 7 :
-        return ZSTD_compressBlock_fast_generic(ctx, src, srcSize, 7);
-    }
-}
-
-
-static size_t ZSTD_compressBlock_fast_extDict_generic(ZSTD_CCtx* ctx,
-                                 const void* src, size_t srcSize,
-                                 const U32 mls)
-{
-    U32* hashTable = ctx->hashTable;
-    const U32 hBits = ctx->appliedParams.cParams.hashLog;
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const base = ctx->base;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = ctx->lowLimit;
-    const BYTE* const dictStart = dictBase + lowestIndex;
-    const U32   dictLimit = ctx->dictLimit;
-    const BYTE* const lowPrefixPtr = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    U32 offset_1=seqStorePtr->rep[0], offset_2=seqStorePtr->rep[1];
-
-    /* Search Loop */
-    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
-        const size_t h = ZSTD_hashPtr(ip, hBits, mls);
-        const U32 matchIndex = hashTable[h];
-        const BYTE* matchBase = matchIndex < dictLimit ? dictBase : base;
-        const BYTE* match = matchBase + matchIndex;
-        const U32 current = (U32)(ip-base);
-        const U32 repIndex = current + 1 - offset_1;   /* offset_1 expected <= current +1 */
-        const BYTE* repBase = repIndex < dictLimit ? dictBase : base;
-        const BYTE* repMatch = repBase + repIndex;
-        size_t mLength;
-        hashTable[h] = current;   /* update hash table */
-
-        if ( (((U32)((dictLimit-1) - repIndex) >= 3) /* intentional underflow */ & (repIndex > lowestIndex))
-           && (MEM_read32(repMatch) == MEM_read32(ip+1)) ) {
-            const BYTE* repMatchEnd = repIndex < dictLimit ? dictEnd : iend;
-            mLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repMatchEnd, lowPrefixPtr) + 4;
-            ip++;
-            ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, 0, mLength-MINMATCH);
-        } else {
-            if ( (matchIndex < lowestIndex) ||
-                 (MEM_read32(match) != MEM_read32(ip)) ) {
-                ip += ((ip-anchor) >> g_searchStrength) + 1;
-                continue;
-            }
-            {   const BYTE* matchEnd = matchIndex < dictLimit ? dictEnd : iend;
-                const BYTE* lowMatchPtr = matchIndex < dictLimit ? dictStart : lowPrefixPtr;
-                U32 offset;
-                mLength = ZSTD_count_2segments(ip+4, match+4, iend, matchEnd, lowPrefixPtr) + 4;
-                while (((ip>anchor) & (match>lowMatchPtr)) && (ip[-1] == match[-1])) { ip--; match--; mLength++; }   /* catch up */
-                offset = current - matchIndex;
-                offset_2 = offset_1;
-                offset_1 = offset;
-                ZSTD_storeSeq(seqStorePtr, ip-anchor, anchor, offset + ZSTD_REP_MOVE, mLength-MINMATCH);
-        }   }
-
-        /* found a match : store it */
-        ip += mLength;
-        anchor = ip;
-
-        if (ip <= ilimit) {
-            /* Fill Table */
-            hashTable[ZSTD_hashPtr(base+current+2, hBits, mls)] = current+2;
-            hashTable[ZSTD_hashPtr(ip-2, hBits, mls)] = (U32)(ip-2-base);
-            /* check immediate repcode */
-            while (ip <= ilimit) {
-                U32 const current2 = (U32)(ip-base);
-                U32 const repIndex2 = current2 - offset_2;
-                const BYTE* repMatch2 = repIndex2 < dictLimit ? dictBase + repIndex2 : base + repIndex2;
-                if ( (((U32)((dictLimit-1) - repIndex2) >= 3) & (repIndex2 > lowestIndex))  /* intentional overflow */
-                   && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
-                    const BYTE* const repEnd2 = repIndex2 < dictLimit ? dictEnd : iend;
-                    size_t const repLength2 = ZSTD_count_2segments(ip+4, repMatch2+4, iend, repEnd2, lowPrefixPtr) + 4;
-                    U32 tmpOffset = offset_2; offset_2 = offset_1; offset_1 = tmpOffset;   /* swap offset_2 <=> offset_1 */
-                    ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
-                    hashTable[ZSTD_hashPtr(ip, hBits, mls)] = current2;
-                    ip += repLength2;
-                    anchor = ip;
-                    continue;
-                }
-                break;
-    }   }   }
-
-    /* save reps for next block */
-    seqStorePtr->repToConfirm[0] = offset_1; seqStorePtr->repToConfirm[1] = offset_2;
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_fast_extDict(ZSTD_CCtx* ctx,
-                         const void* src, size_t srcSize)
-{
-    U32 const mls = ctx->appliedParams.cParams.searchLength;
-    switch(mls)
-    {
-    default: /* includes case 3 */
-    case 4 :
-        return ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 4);
-    case 5 :
-        return ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 5);
-    case 6 :
-        return ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 6);
-    case 7 :
-        return ZSTD_compressBlock_fast_extDict_generic(ctx, src, srcSize, 7);
-    }
-}
diff --git a/priv/zstd/lib/compress/zstd_fast.h b/priv/zstd/lib/compress/zstd_fast.h
deleted file mode 100644
index d8b7771..0000000
--- a/priv/zstd/lib/compress/zstd_fast.h
+++ /dev/null
@@ -1,31 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_FAST_H
-#define ZSTD_FAST_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#include "mem.h"      /* U32 */
-#include "zstd.h"     /* ZSTD_CCtx, size_t */
-
-void ZSTD_fillHashTable(ZSTD_CCtx* zc, const void* end, const U32 mls);
-size_t ZSTD_compressBlock_fast(ZSTD_CCtx* ctx,
-                         const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_fast_extDict(ZSTD_CCtx* ctx,
-                         const void* src, size_t srcSize);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_FAST_H */
diff --git a/priv/zstd/lib/compress/zstd_lazy.c b/priv/zstd/lib/compress/zstd_lazy.c
deleted file mode 100644
index 6d48049..0000000
--- a/priv/zstd/lib/compress/zstd_lazy.c
+++ /dev/null
@@ -1,765 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#include "zstd_compress_internal.h"
-#include "zstd_lazy.h"
-
-
-/*-*************************************
-*  Binary Tree search
-***************************************/
-/** ZSTD_insertBt1() : add one or multiple positions to tree.
- *  ip : assumed <= iend-8 .
- * @return : nb of positions added */
-static U32 ZSTD_insertBt1(ZSTD_CCtx* zc,
-                const BYTE* const ip, const BYTE* const iend,
-                U32 nbCompares, U32 const mls, U32 const extDict)
-{
-    U32*   const hashTable = zc->hashTable;
-    U32    const hashLog = zc->appliedParams.cParams.hashLog;
-    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
-    U32*   const bt = zc->chainTable;
-    U32    const btLog  = zc->appliedParams.cParams.chainLog - 1;
-    U32    const btMask = (1 << btLog) - 1;
-    U32 matchIndex = hashTable[h];
-    size_t commonLengthSmaller=0, commonLengthLarger=0;
-    const BYTE* const base = zc->base;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* match;
-    const U32 current = (U32)(ip-base);
-    const U32 btLow = btMask >= current ? 0 : current - btMask;
-    U32* smallerPtr = bt + 2*(current&btMask);
-    U32* largerPtr  = smallerPtr + 1;
-    U32 dummy32;   /* to be nullified at the end */
-    U32 const windowLow = zc->lowLimit;
-    U32 matchEndIdx = current+8+1;
-    size_t bestLength = 8;
-#ifdef ZSTD_C_PREDICT
-    U32 predictedSmall = *(bt + 2*((current-1)&btMask) + 0);
-    U32 predictedLarge = *(bt + 2*((current-1)&btMask) + 1);
-    predictedSmall += (predictedSmall>0);
-    predictedLarge += (predictedLarge>0);
-#endif /* ZSTD_C_PREDICT */
-
-    DEBUGLOG(8, "ZSTD_insertBt1 (%u)", current);
-
-    assert(ip <= iend-8);   /* required for h calculation */
-    hashTable[h] = current;   /* Update Hash Table */
-
-    while (nbCompares-- && (matchIndex > windowLow)) {
-        U32* const nextPtr = bt + 2*(matchIndex & btMask);
-        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
-        assert(matchIndex < current);
-
-#ifdef ZSTD_C_PREDICT   /* note : can create issues when hlog small <= 11 */
-        const U32* predictPtr = bt + 2*((matchIndex-1) & btMask);   /* written this way, as bt is a roll buffer */
-        if (matchIndex == predictedSmall) {
-            /* no need to check length, result known */
-            *smallerPtr = matchIndex;
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
-            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
-            predictedSmall = predictPtr[1] + (predictPtr[1]>0);
-            continue;
-        }
-        if (matchIndex == predictedLarge) {
-            *largerPtr = matchIndex;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-            predictedLarge = predictPtr[0] + (predictPtr[0]>0);
-            continue;
-        }
-#endif
-
-        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
-            assert(matchIndex+matchLength >= dictLimit);   /* might be wrong if extDict is incorrectly set to 0 */
-            match = base + matchIndex;
-            matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
-        } else {
-            match = dictBase + matchIndex;
-            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
-            if (matchIndex+matchLength >= dictLimit)
-                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
-        }
-
-        if (matchLength > bestLength) {
-            bestLength = matchLength;
-            if (matchLength > matchEndIdx - matchIndex)
-                matchEndIdx = matchIndex + (U32)matchLength;
-        }
-
-        if (ip+matchLength == iend) {   /* equal : no way to know if inf or sup */
-            break;   /* drop , to guarantee consistency ; miss a bit of compression, but other solutions can corrupt tree */
-        }
-
-        if (match[matchLength] < ip[matchLength]) {  /* necessarily within buffer */
-            /* match is smaller than current */
-            *smallerPtr = matchIndex;             /* update smaller idx */
-            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
-            smallerPtr = nextPtr+1;               /* new "candidate" => larger than match, which was smaller than target */
-            matchIndex = nextPtr[1];              /* new matchIndex, larger than previous and closer to current */
-        } else {
-            /* match is larger than current */
-            *largerPtr = matchIndex;
-            commonLengthLarger = matchLength;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop searching */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-    }   }
-
-    *smallerPtr = *largerPtr = 0;
-    if (bestLength > 384) return MIN(192, (U32)(bestLength - 384));   /* speed optimization */
-    assert(matchEndIdx > current + 8);
-    return matchEndIdx - (current + 8);
-}
-
-FORCE_INLINE_TEMPLATE
-void ZSTD_updateTree_internal(ZSTD_CCtx* zc,
-                const BYTE* const ip, const BYTE* const iend,
-                const U32 nbCompares, const U32 mls, const U32 extDict)
-{
-    const BYTE* const base = zc->base;
-    U32 const target = (U32)(ip - base);
-    U32 idx = zc->nextToUpdate;
-    DEBUGLOG(7, "ZSTD_updateTree_internal, from %u to %u  (extDict:%u)",
-                idx, target, extDict);
-
-    while(idx < target)
-        idx += ZSTD_insertBt1(zc, base+idx, iend, nbCompares, mls, extDict);
-    zc->nextToUpdate = target;
-}
-
-void ZSTD_updateTree(ZSTD_CCtx* zc,
-                const BYTE* const ip, const BYTE* const iend,
-                const U32 nbCompares, const U32 mls)
-{
-    ZSTD_updateTree_internal(zc, ip, iend, nbCompares, mls, 0 /*extDict*/);
-}
-
-void ZSTD_updateTree_extDict(ZSTD_CCtx* zc,
-                const BYTE* const ip, const BYTE* const iend,
-                const U32 nbCompares, const U32 mls)
-{
-    ZSTD_updateTree_internal(zc, ip, iend, nbCompares, mls, 1 /*extDict*/);
-}
-
-
-static size_t ZSTD_insertBtAndFindBestMatch (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iend,
-                        size_t* offsetPtr,
-                        U32 nbCompares, const U32 mls,
-                        U32 extDict)
-{
-    U32*   const hashTable = zc->hashTable;
-    U32    const hashLog = zc->appliedParams.cParams.hashLog;
-    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
-    U32*   const bt = zc->chainTable;
-    U32    const btLog  = zc->appliedParams.cParams.chainLog - 1;
-    U32    const btMask = (1 << btLog) - 1;
-    U32 matchIndex  = hashTable[h];
-    size_t commonLengthSmaller=0, commonLengthLarger=0;
-    const BYTE* const base = zc->base;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const U32 current = (U32)(ip-base);
-    const U32 btLow = btMask >= current ? 0 : current - btMask;
-    const U32 windowLow = zc->lowLimit;
-    U32* smallerPtr = bt + 2*(current&btMask);
-    U32* largerPtr  = bt + 2*(current&btMask) + 1;
-    U32 matchEndIdx = current+8+1;
-    U32 dummy32;   /* to be nullified at the end */
-    size_t bestLength = 0;
-
-    assert(ip <= iend-8);   /* required for h calculation */
-    hashTable[h] = current;   /* Update Hash Table */
-
-    while (nbCompares-- && (matchIndex > windowLow)) {
-        U32* const nextPtr = bt + 2*(matchIndex & btMask);
-        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
-        const BYTE* match;
-
-        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
-            match = base + matchIndex;
-            matchLength += ZSTD_count(ip+matchLength, match+matchLength, iend);
-        } else {
-            match = dictBase + matchIndex;
-            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iend, dictEnd, prefixStart);
-            if (matchIndex+matchLength >= dictLimit)
-                match = base + matchIndex;   /* to prepare for next usage of match[matchLength] */
-        }
-
-        if (matchLength > bestLength) {
-            if (matchLength > matchEndIdx - matchIndex)
-                matchEndIdx = matchIndex + (U32)matchLength;
-            if ( (4*(int)(matchLength-bestLength)) > (int)(ZSTD_highbit32(current-matchIndex+1) - ZSTD_highbit32((U32)offsetPtr[0]+1)) )
-                bestLength = matchLength, *offsetPtr = ZSTD_REP_MOVE + current - matchIndex;
-            if (ip+matchLength == iend) {   /* equal : no way to know if inf or sup */
-                break;   /* drop, to guarantee consistency (miss a little bit of compression) */
-            }
-        }
-
-        if (match[matchLength] < ip[matchLength]) {
-            /* match is smaller than current */
-            *smallerPtr = matchIndex;             /* update smaller idx */
-            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new "smaller" => larger of match */
-            matchIndex = nextPtr[1];              /* new matchIndex larger than previous (closer to current) */
-        } else {
-            /* match is larger than current */
-            *largerPtr = matchIndex;
-            commonLengthLarger = matchLength;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-    }   }
-
-    *smallerPtr = *largerPtr = 0;
-
-    assert(matchEndIdx > current+8);
-    zc->nextToUpdate = matchEndIdx - 8;   /* skip repetitive patterns */
-    return bestLength;
-}
-
-
-/** ZSTD_BtFindBestMatch() : Tree updater, providing best match */
-static size_t ZSTD_BtFindBestMatch (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 mls)
-{
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    ZSTD_updateTree(zc, ip, iLimit, maxNbAttempts, mls);
-    return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 0);
-}
-
-
-static size_t ZSTD_BtFindBestMatch_selectMLS (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
-{
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-    case 5 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-    case 7 :
-    case 6 : return ZSTD_BtFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-    }
-}
-
-
-/** Tree updater, providing best match */
-static size_t ZSTD_BtFindBestMatch_extDict (
-                        ZSTD_CCtx* zc,
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 mls)
-{
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    ZSTD_updateTree_extDict(zc, ip, iLimit, maxNbAttempts, mls);
-    return ZSTD_insertBtAndFindBestMatch(zc, ip, iLimit, offsetPtr, maxNbAttempts, mls, 1);
-}
-
-
-static size_t ZSTD_BtFindBestMatch_selectMLS_extDict (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
-{
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4);
-    case 5 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5);
-    case 7 :
-    case 6 : return ZSTD_BtFindBestMatch_extDict(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6);
-    }
-}
-
-
-
-/* *********************************
-*  Hash Chain
-***********************************/
-#define NEXT_IN_CHAIN(d, mask)   chainTable[(d) & mask]
-
-/* Update chains up to ip (excluded)
-   Assumption : always within prefix (i.e. not within extDict) */
-U32 ZSTD_insertAndFindFirstIndex (ZSTD_CCtx* zc, const BYTE* ip, U32 mls)
-{
-    U32* const hashTable  = zc->hashTable;
-    const U32 hashLog = zc->appliedParams.cParams.hashLog;
-    U32* const chainTable = zc->chainTable;
-    const U32 chainMask = (1 << zc->appliedParams.cParams.chainLog) - 1;
-    const BYTE* const base = zc->base;
-    const U32 target = (U32)(ip - base);
-    U32 idx = zc->nextToUpdate;
-
-    while(idx < target) { /* catch up */
-        size_t const h = ZSTD_hashPtr(base+idx, hashLog, mls);
-        NEXT_IN_CHAIN(idx, chainMask) = hashTable[h];
-        hashTable[h] = idx;
-        idx++;
-    }
-
-    zc->nextToUpdate = target;
-    return hashTable[ZSTD_hashPtr(ip, hashLog, mls)];
-}
-
-
-/* inlining is important to hardwire a hot branch (template emulation) */
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_HcFindBestMatch_generic (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* const ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 mls, const U32 extDict)
-{
-    U32* const chainTable = zc->chainTable;
-    const U32 chainSize = (1 << zc->appliedParams.cParams.chainLog);
-    const U32 chainMask = chainSize-1;
-    const BYTE* const base = zc->base;
-    const BYTE* const dictBase = zc->dictBase;
-    const U32 dictLimit = zc->dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const U32 lowLimit = zc->lowLimit;
-    const U32 current = (U32)(ip-base);
-    const U32 minChain = current > chainSize ? current - chainSize : 0;
-    int nbAttempts=maxNbAttempts;
-    size_t ml=4-1;
-
-    /* HC4 match finder */
-    U32 matchIndex = ZSTD_insertAndFindFirstIndex (zc, ip, mls);
-
-    for ( ; (matchIndex>lowLimit) & (nbAttempts>0) ; nbAttempts--) {
-        size_t currentMl=0;
-        if ((!extDict) || matchIndex >= dictLimit) {
-            const BYTE* const match = base + matchIndex;
-            if (match[ml] == ip[ml])   /* potentially better */
-                currentMl = ZSTD_count(ip, match, iLimit);
-        } else {
-            const BYTE* const match = dictBase + matchIndex;
-            assert(match+4 <= dictEnd);
-            if (MEM_read32(match) == MEM_read32(ip))   /* assumption : matchIndex <= dictLimit-4 (by table construction) */
-                currentMl = ZSTD_count_2segments(ip+4, match+4, iLimit, dictEnd, prefixStart) + 4;
-        }
-
-        /* save best solution */
-        if (currentMl > ml) {
-            ml = currentMl;
-            *offsetPtr = current - matchIndex + ZSTD_REP_MOVE;
-            if (ip+currentMl == iLimit) break; /* best possible, avoids read overflow on next attempt */
-        }
-
-        if (matchIndex <= minChain) break;
-        matchIndex = NEXT_IN_CHAIN(matchIndex, chainMask);
-    }
-
-    return ml;
-}
-
-
-FORCE_INLINE_TEMPLATE size_t ZSTD_HcFindBestMatch_selectMLS (
-                        ZSTD_CCtx* zc,
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* offsetPtr,
-                        const U32 maxNbAttempts, const U32 matchLengthSearch)
-{
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 0);
-    case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 0);
-    case 7 :
-    case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 0);
-    }
-}
-
-
-FORCE_INLINE_TEMPLATE size_t ZSTD_HcFindBestMatch_extDict_selectMLS (
-                        ZSTD_CCtx* const zc,
-                        const BYTE* ip, const BYTE* const iLimit,
-                        size_t* const offsetPtr,
-                        U32 const maxNbAttempts, U32 const matchLengthSearch)
-{
-    switch(matchLengthSearch)
-    {
-    default : /* includes case 3 */
-    case 4 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 4, 1);
-    case 5 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 5, 1);
-    case 7 :
-    case 6 : return ZSTD_HcFindBestMatch_generic(zc, ip, iLimit, offsetPtr, maxNbAttempts, 6, 1);
-    }
-}
-
-
-/* *******************************
-*  Common parser - lazy strategy
-*********************************/
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_compressBlock_lazy_generic(ZSTD_CCtx* ctx,
-                                       const void* src, size_t srcSize,
-                                       const U32 searchMethod, const U32 depth)
-{
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base + ctx->dictLimit;
-
-    U32 const maxSearches = 1 << ctx->appliedParams.cParams.searchLog;
-    U32 const mls = ctx->appliedParams.cParams.searchLength;
-
-    typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
-                        size_t* offsetPtr,
-                        U32 maxNbAttempts, U32 matchLengthSearch);
-    searchMax_f const searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS : ZSTD_HcFindBestMatch_selectMLS;
-    U32 offset_1 = seqStorePtr->rep[0], offset_2 = seqStorePtr->rep[1], savedOffset=0;
-
-    /* init */
-    ip += (ip==base);
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    {   U32 const maxRep = (U32)(ip-base);
-        if (offset_2 > maxRep) savedOffset = offset_2, offset_2 = 0;
-        if (offset_1 > maxRep) savedOffset = offset_1, offset_1 = 0;
-    }
-
-    /* Match Loop */
-    while (ip < ilimit) {
-        size_t matchLength=0;
-        size_t offset=0;
-        const BYTE* start=ip+1;
-
-        /* check repCode */
-        if ((offset_1>0) & (MEM_read32(ip+1) == MEM_read32(ip+1 - offset_1))) {
-            /* repcode : we take it */
-            matchLength = ZSTD_count(ip+1+4, ip+1+4-offset_1, iend) + 4;
-            if (depth==0) goto _storeSequence;
-        }
-
-        /* first search (depth 0) */
-        {   size_t offsetFound = 99999999;
-            size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-            if (ml2 > matchLength)
-                matchLength = ml2, start = ip, offset=offsetFound;
-        }
-
-        if (matchLength < 4) {
-            ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
-            continue;
-        }
-
-        /* let's try to find a better solution */
-        if (depth>=1)
-        while (ip0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
-                size_t const mlRep = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
-                int const gain2 = (int)(mlRep * 3);
-                int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
-                if ((mlRep >= 4) && (gain2 > gain1))
-                    matchLength = mlRep, offset = 0, start = ip;
-            }
-            {   size_t offset2=99999999;
-                size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
-                if ((ml2 >= 4) && (gain2 > gain1)) {
-                    matchLength = ml2, offset = offset2, start = ip;
-                    continue;   /* search a better one */
-            }   }
-
-            /* let's find an even better one */
-            if ((depth==2) && (ip0) & (MEM_read32(ip) == MEM_read32(ip - offset_1)))) {
-                    size_t const ml2 = ZSTD_count(ip+4, ip+4-offset_1, iend) + 4;
-                    int const gain2 = (int)(ml2 * 4);
-                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
-                    if ((ml2 >= 4) && (gain2 > gain1))
-                        matchLength = ml2, offset = 0, start = ip;
-                }
-                {   size_t offset2=99999999;
-                    size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
-                    if ((ml2 >= 4) && (gain2 > gain1)) {
-                        matchLength = ml2, offset = offset2, start = ip;
-                        continue;
-            }   }   }
-            break;  /* nothing found : store previous solution */
-        }
-
-        /* NOTE:
-         * start[-offset+ZSTD_REP_MOVE-1] is undefined behavior.
-         * (-offset+ZSTD_REP_MOVE-1) is unsigned, and is added to start, which
-         * overflows the pointer, which is undefined behavior.
-         */
-        /* catch up */
-        if (offset) {
-            while ( ((start > anchor) & (start - (offset-ZSTD_REP_MOVE) > base))
-                 && (start[-1] == (start-(offset-ZSTD_REP_MOVE))[-1]) )  /* only search for offset within prefix */
-                { start--; matchLength++; }
-            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-        }
-        /* store sequence */
-_storeSequence:
-        {   size_t const litLength = start - anchor;
-            ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
-            anchor = ip = start + matchLength;
-        }
-
-        /* check immediate repcode */
-        while ( ((ip <= ilimit) & (offset_2>0))
-             && (MEM_read32(ip) == MEM_read32(ip - offset_2)) ) {
-            /* store sequence */
-            matchLength = ZSTD_count(ip+4, ip+4-offset_2, iend) + 4;
-            offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset; /* swap repcodes */
-            ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
-            ip += matchLength;
-            anchor = ip;
-            continue;   /* faster when present ... (?) */
-    }   }
-
-    /* Save reps for next block */
-    seqStorePtr->repToConfirm[0] = offset_1 ? offset_1 : savedOffset;
-    seqStorePtr->repToConfirm[1] = offset_2 ? offset_2 : savedOffset;
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_btlazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 1, 2);
-}
-
-size_t ZSTD_compressBlock_lazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 2);
-}
-
-size_t ZSTD_compressBlock_lazy(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 1);
-}
-
-size_t ZSTD_compressBlock_greedy(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_generic(ctx, src, srcSize, 0, 0);
-}
-
-
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_compressBlock_lazy_extDict_generic(ZSTD_CCtx* ctx,
-                                     const void* src, size_t srcSize,
-                                     const U32 searchMethod, const U32 depth)
-{
-    seqStore_t* seqStorePtr = &(ctx->seqStore);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base;
-    const U32 dictLimit = ctx->dictLimit;
-    const U32 lowestIndex = ctx->lowLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const dictEnd  = dictBase + dictLimit;
-    const BYTE* const dictStart  = dictBase + ctx->lowLimit;
-
-    const U32 maxSearches = 1 << ctx->appliedParams.cParams.searchLog;
-    const U32 mls = ctx->appliedParams.cParams.searchLength;
-
-    typedef size_t (*searchMax_f)(ZSTD_CCtx* zc, const BYTE* ip, const BYTE* iLimit,
-                        size_t* offsetPtr,
-                        U32 maxNbAttempts, U32 matchLengthSearch);
-    searchMax_f searchMax = searchMethod ? ZSTD_BtFindBestMatch_selectMLS_extDict : ZSTD_HcFindBestMatch_extDict_selectMLS;
-
-    U32 offset_1 = seqStorePtr->rep[0], offset_2 = seqStorePtr->rep[1];
-
-    /* init */
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    ip += (ip == prefixStart);
-
-    /* Match Loop */
-    while (ip < ilimit) {
-        size_t matchLength=0;
-        size_t offset=0;
-        const BYTE* start=ip+1;
-        U32 current = (U32)(ip-base);
-
-        /* check repCode */
-        {   const U32 repIndex = (U32)(current+1 - offset_1);
-            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-            const BYTE* const repMatch = repBase + repIndex;
-            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))   /* intentional overflow */
-            if (MEM_read32(ip+1) == MEM_read32(repMatch)) {
-                /* repcode detected we should take it */
-                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                matchLength = ZSTD_count_2segments(ip+1+4, repMatch+4, iend, repEnd, prefixStart) + 4;
-                if (depth==0) goto _storeSequence;
-        }   }
-
-        /* first search (depth 0) */
-        {   size_t offsetFound = 99999999;
-            size_t const ml2 = searchMax(ctx, ip, iend, &offsetFound, maxSearches, mls);
-            if (ml2 > matchLength)
-                matchLength = ml2, start = ip, offset=offsetFound;
-        }
-
-         if (matchLength < 4) {
-            ip += ((ip-anchor) >> g_searchStrength) + 1;   /* jump faster over incompressible sections */
-            continue;
-        }
-
-        /* let's try to find a better solution */
-        if (depth>=1)
-        while (ip= 3) & (repIndex > lowestIndex))  /* intentional overflow */
-                if (MEM_read32(ip) == MEM_read32(repMatch)) {
-                    /* repcode detected */
-                    const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                    size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
-                    int const gain2 = (int)(repLength * 3);
-                    int const gain1 = (int)(matchLength*3 - ZSTD_highbit32((U32)offset+1) + 1);
-                    if ((repLength >= 4) && (gain2 > gain1))
-                        matchLength = repLength, offset = 0, start = ip;
-            }   }
-
-            /* search match, depth 1 */
-            {   size_t offset2=99999999;
-                size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 4);
-                if ((ml2 >= 4) && (gain2 > gain1)) {
-                    matchLength = ml2, offset = offset2, start = ip;
-                    continue;   /* search a better one */
-            }   }
-
-            /* let's find an even better one */
-            if ((depth==2) && (ip= 3) & (repIndex > lowestIndex))  /* intentional overflow */
-                    if (MEM_read32(ip) == MEM_read32(repMatch)) {
-                        /* repcode detected */
-                        const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                        size_t const repLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
-                        int const gain2 = (int)(repLength * 4);
-                        int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 1);
-                        if ((repLength >= 4) && (gain2 > gain1))
-                            matchLength = repLength, offset = 0, start = ip;
-                }   }
-
-                /* search match, depth 2 */
-                {   size_t offset2=99999999;
-                    size_t const ml2 = searchMax(ctx, ip, iend, &offset2, maxSearches, mls);
-                    int const gain2 = (int)(ml2*4 - ZSTD_highbit32((U32)offset2+1));   /* raw approx */
-                    int const gain1 = (int)(matchLength*4 - ZSTD_highbit32((U32)offset+1) + 7);
-                    if ((ml2 >= 4) && (gain2 > gain1)) {
-                        matchLength = ml2, offset = offset2, start = ip;
-                        continue;
-            }   }   }
-            break;  /* nothing found : store previous solution */
-        }
-
-        /* catch up */
-        if (offset) {
-            U32 const matchIndex = (U32)((start-base) - (offset - ZSTD_REP_MOVE));
-            const BYTE* match = (matchIndex < dictLimit) ? dictBase + matchIndex : base + matchIndex;
-            const BYTE* const mStart = (matchIndex < dictLimit) ? dictStart : prefixStart;
-            while ((start>anchor) && (match>mStart) && (start[-1] == match[-1])) { start--; match--; matchLength++; }  /* catch up */
-            offset_2 = offset_1; offset_1 = (U32)(offset - ZSTD_REP_MOVE);
-        }
-
-        /* store sequence */
-_storeSequence:
-        {   size_t const litLength = start - anchor;
-            ZSTD_storeSeq(seqStorePtr, litLength, anchor, (U32)offset, matchLength-MINMATCH);
-            anchor = ip = start + matchLength;
-        }
-
-        /* check immediate repcode */
-        while (ip <= ilimit) {
-            const U32 repIndex = (U32)((ip-base) - offset_2);
-            const BYTE* const repBase = repIndex < dictLimit ? dictBase : base;
-            const BYTE* const repMatch = repBase + repIndex;
-            if (((U32)((dictLimit-1) - repIndex) >= 3) & (repIndex > lowestIndex))  /* intentional overflow */
-            if (MEM_read32(ip) == MEM_read32(repMatch)) {
-                /* repcode detected we should take it */
-                const BYTE* const repEnd = repIndex < dictLimit ? dictEnd : iend;
-                matchLength = ZSTD_count_2segments(ip+4, repMatch+4, iend, repEnd, prefixStart) + 4;
-                offset = offset_2; offset_2 = offset_1; offset_1 = (U32)offset;   /* swap offset history */
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, matchLength-MINMATCH);
-                ip += matchLength;
-                anchor = ip;
-                continue;   /* faster when present ... (?) */
-            }
-            break;
-    }   }
-
-    /* Save reps for next block */
-    seqStorePtr->repToConfirm[0] = offset_1; seqStorePtr->repToConfirm[1] = offset_2;
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_greedy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 0);
-}
-
-size_t ZSTD_compressBlock_lazy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 1);
-}
-
-size_t ZSTD_compressBlock_lazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 0, 2);
-}
-
-size_t ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_lazy_extDict_generic(ctx, src, srcSize, 1, 2);
-}
diff --git a/priv/zstd/lib/compress/zstd_lazy.h b/priv/zstd/lib/compress/zstd_lazy.h
deleted file mode 100644
index 74e1fd6..0000000
--- a/priv/zstd/lib/compress/zstd_lazy.h
+++ /dev/null
@@ -1,39 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_LAZY_H
-#define ZSTD_LAZY_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#include "mem.h"    /* U32 */
-#include "zstd.h"   /* ZSTD_CCtx, size_t */
-
-U32 ZSTD_insertAndFindFirstIndex (ZSTD_CCtx* zc, const BYTE* ip, U32 mls);
-void ZSTD_updateTree(ZSTD_CCtx* zc, const BYTE* const ip, const BYTE* const iend, const U32 nbCompares, const U32 mls);
-void ZSTD_updateTree_extDict(ZSTD_CCtx* zc, const BYTE* const ip, const BYTE* const iend, const U32 nbCompares, const U32 mls);
-
-size_t ZSTD_compressBlock_btlazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_lazy2(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_lazy(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_greedy(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-
-size_t ZSTD_compressBlock_greedy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_lazy_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_lazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_btlazy2_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_LAZY_H */
diff --git a/priv/zstd/lib/compress/zstd_ldm.c b/priv/zstd/lib/compress/zstd_ldm.c
deleted file mode 100644
index be50872..0000000
--- a/priv/zstd/lib/compress/zstd_ldm.c
+++ /dev/null
@@ -1,707 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-#include "zstd_ldm.h"
-
-#include "zstd_fast.h"          /* ZSTD_fillHashTable() */
-#include "zstd_double_fast.h"   /* ZSTD_fillDoubleHashTable() */
-
-#define LDM_BUCKET_SIZE_LOG 3
-#define LDM_MIN_MATCH_LENGTH 64
-#define LDM_HASH_RLOG 7
-#define LDM_HASH_CHAR_OFFSET 10
-
-size_t ZSTD_ldm_initializeParameters(ldmParams_t* params, U32 enableLdm)
-{
-    ZSTD_STATIC_ASSERT(LDM_BUCKET_SIZE_LOG <= ZSTD_LDM_BUCKETSIZELOG_MAX);
-    params->enableLdm = enableLdm>0;
-    params->hashLog = 0;
-    params->bucketSizeLog = LDM_BUCKET_SIZE_LOG;
-    params->minMatchLength = LDM_MIN_MATCH_LENGTH;
-    params->hashEveryLog = ZSTD_LDM_HASHEVERYLOG_NOTSET;
-    return 0;
-}
-
-void ZSTD_ldm_adjustParameters(ldmParams_t* params, U32 windowLog)
-{
-    if (params->hashLog == 0) {
-        params->hashLog = MAX(ZSTD_HASHLOG_MIN, windowLog - LDM_HASH_RLOG);
-        assert(params->hashLog <= ZSTD_HASHLOG_MAX);
-    }
-    if (params->hashEveryLog == ZSTD_LDM_HASHEVERYLOG_NOTSET) {
-        params->hashEveryLog =
-                windowLog < params->hashLog ? 0 : windowLog - params->hashLog;
-    }
-    params->bucketSizeLog = MIN(params->bucketSizeLog, params->hashLog);
-}
-
-size_t ZSTD_ldm_getTableSize(U32 hashLog, U32 bucketSizeLog) {
-    size_t const ldmHSize = ((size_t)1) << hashLog;
-    size_t const ldmBucketSizeLog = MIN(bucketSizeLog, hashLog);
-    size_t const ldmBucketSize =
-        ((size_t)1) << (hashLog - ldmBucketSizeLog);
-    return ldmBucketSize + (ldmHSize * (sizeof(ldmEntry_t)));
-}
-
-/** ZSTD_ldm_getSmallHash() :
- *  numBits should be <= 32
- *  If numBits==0, returns 0.
- *  @return : the most significant numBits of value. */
-static U32 ZSTD_ldm_getSmallHash(U64 value, U32 numBits)
-{
-    assert(numBits <= 32);
-    return numBits == 0 ? 0 : (U32)(value >> (64 - numBits));
-}
-
-/** ZSTD_ldm_getChecksum() :
- *  numBitsToDiscard should be <= 32
- *  @return : the next most significant 32 bits after numBitsToDiscard */
-static U32 ZSTD_ldm_getChecksum(U64 hash, U32 numBitsToDiscard)
-{
-    assert(numBitsToDiscard <= 32);
-    return (hash >> (64 - 32 - numBitsToDiscard)) & 0xFFFFFFFF;
-}
-
-/** ZSTD_ldm_getTag() ;
- *  Given the hash, returns the most significant numTagBits bits
- *  after (32 + hbits) bits.
- *
- *  If there are not enough bits remaining, return the last
- *  numTagBits bits. */
-static U32 ZSTD_ldm_getTag(U64 hash, U32 hbits, U32 numTagBits)
-{
-    assert(numTagBits < 32 && hbits <= 32);
-    if (32 - hbits < numTagBits) {
-        return hash & (((U32)1 << numTagBits) - 1);
-    } else {
-        return (hash >> (32 - hbits - numTagBits)) & (((U32)1 << numTagBits) - 1);
-    }
-}
-
-/** ZSTD_ldm_getBucket() :
- *  Returns a pointer to the start of the bucket associated with hash. */
-static ldmEntry_t* ZSTD_ldm_getBucket(
-        ldmState_t* ldmState, size_t hash, ldmParams_t const ldmParams)
-{
-    return ldmState->hashTable + (hash << ldmParams.bucketSizeLog);
-}
-
-/** ZSTD_ldm_insertEntry() :
- *  Insert the entry with corresponding hash into the hash table */
-static void ZSTD_ldm_insertEntry(ldmState_t* ldmState,
-                                 size_t const hash, const ldmEntry_t entry,
-                                 ldmParams_t const ldmParams)
-{
-    BYTE* const bucketOffsets = ldmState->bucketOffsets;
-    *(ZSTD_ldm_getBucket(ldmState, hash, ldmParams) + bucketOffsets[hash]) = entry;
-    bucketOffsets[hash]++;
-    bucketOffsets[hash] &= ((U32)1 << ldmParams.bucketSizeLog) - 1;
-}
-
-/** ZSTD_ldm_makeEntryAndInsertByTag() :
- *
- *  Gets the small hash, checksum, and tag from the rollingHash.
- *
- *  If the tag matches (1 << ldmParams.hashEveryLog)-1, then
- *  creates an ldmEntry from the offset, and inserts it into the hash table.
- *
- *  hBits is the length of the small hash, which is the most significant hBits
- *  of rollingHash. The checksum is the next 32 most significant bits, followed
- *  by ldmParams.hashEveryLog bits that make up the tag. */
-static void ZSTD_ldm_makeEntryAndInsertByTag(ldmState_t* ldmState,
-                                             U64 const rollingHash,
-                                             U32 const hBits,
-                                             U32 const offset,
-                                             ldmParams_t const ldmParams)
-{
-    U32 const tag = ZSTD_ldm_getTag(rollingHash, hBits, ldmParams.hashEveryLog);
-    U32 const tagMask = ((U32)1 << ldmParams.hashEveryLog) - 1;
-    if (tag == tagMask) {
-        U32 const hash = ZSTD_ldm_getSmallHash(rollingHash, hBits);
-        U32 const checksum = ZSTD_ldm_getChecksum(rollingHash, hBits);
-        ldmEntry_t entry;
-        entry.offset = offset;
-        entry.checksum = checksum;
-        ZSTD_ldm_insertEntry(ldmState, hash, entry, ldmParams);
-    }
-}
-
-/** ZSTD_ldm_getRollingHash() :
- *  Get a 64-bit hash using the first len bytes from buf.
- *
- *  Giving bytes s = s_1, s_2, ... s_k, the hash is defined to be
- *  H(s) = s_1*(a^(k-1)) + s_2*(a^(k-2)) + ... + s_k*(a^0)
- *
- *  where the constant a is defined to be prime8bytes.
- *
- *  The implementation adds an offset to each byte, so
- *  H(s) = (s_1 + HASH_CHAR_OFFSET)*(a^(k-1)) + ... */
-static U64 ZSTD_ldm_getRollingHash(const BYTE* buf, U32 len)
-{
-    U64 ret = 0;
-    U32 i;
-    for (i = 0; i < len; i++) {
-        ret *= prime8bytes;
-        ret += buf[i] + LDM_HASH_CHAR_OFFSET;
-    }
-    return ret;
-}
-
-/** ZSTD_ldm_ipow() :
- *  Return base^exp. */
-static U64 ZSTD_ldm_ipow(U64 base, U64 exp)
-{
-    U64 ret = 1;
-    while (exp) {
-        if (exp & 1) { ret *= base; }
-        exp >>= 1;
-        base *= base;
-    }
-    return ret;
-}
-
-U64 ZSTD_ldm_getHashPower(U32 minMatchLength) {
-    assert(minMatchLength >= ZSTD_LDM_MINMATCH_MIN);
-    return ZSTD_ldm_ipow(prime8bytes, minMatchLength - 1);
-}
-
-/** ZSTD_ldm_updateHash() :
- *  Updates hash by removing toRemove and adding toAdd. */
-static U64 ZSTD_ldm_updateHash(U64 hash, BYTE toRemove, BYTE toAdd, U64 hashPower)
-{
-    hash -= ((toRemove + LDM_HASH_CHAR_OFFSET) * hashPower);
-    hash *= prime8bytes;
-    hash += toAdd + LDM_HASH_CHAR_OFFSET;
-    return hash;
-}
-
-/** ZSTD_ldm_countBackwardsMatch() :
- *  Returns the number of bytes that match backwards before pIn and pMatch.
- *
- *  We count only bytes where pMatch >= pBase and pIn >= pAnchor. */
-static size_t ZSTD_ldm_countBackwardsMatch(
-            const BYTE* pIn, const BYTE* pAnchor,
-            const BYTE* pMatch, const BYTE* pBase)
-{
-    size_t matchLength = 0;
-    while (pIn > pAnchor && pMatch > pBase && pIn[-1] == pMatch[-1]) {
-        pIn--;
-        pMatch--;
-        matchLength++;
-    }
-    return matchLength;
-}
-
-/** ZSTD_ldm_fillFastTables() :
- *
- *  Fills the relevant tables for the ZSTD_fast and ZSTD_dfast strategies.
- *  This is similar to ZSTD_loadDictionaryContent.
- *
- *  The tables for the other strategies are filled within their
- *  block compressors. */
-static size_t ZSTD_ldm_fillFastTables(ZSTD_CCtx* zc, const void* end)
-{
-    const BYTE* const iend = (const BYTE*)end;
-    const U32 mls = zc->appliedParams.cParams.searchLength;
-
-    switch(zc->appliedParams.cParams.strategy)
-    {
-    case ZSTD_fast:
-        ZSTD_fillHashTable(zc, iend, mls);
-        zc->nextToUpdate = (U32)(iend - zc->base);
-        break;
-
-    case ZSTD_dfast:
-        ZSTD_fillDoubleHashTable(zc, iend, mls);
-        zc->nextToUpdate = (U32)(iend - zc->base);
-        break;
-
-    case ZSTD_greedy:
-    case ZSTD_lazy:
-    case ZSTD_lazy2:
-    case ZSTD_btlazy2:
-    case ZSTD_btopt:
-    case ZSTD_btultra:
-        break;
-    default:
-        assert(0);  /* not possible : not a valid strategy id */
-    }
-
-    return 0;
-}
-
-/** ZSTD_ldm_fillLdmHashTable() :
- *
- *  Fills hashTable from (lastHashed + 1) to iend (non-inclusive).
- *  lastHash is the rolling hash that corresponds to lastHashed.
- *
- *  Returns the rolling hash corresponding to position iend-1. */
-static U64 ZSTD_ldm_fillLdmHashTable(ldmState_t* state,
-                                     U64 lastHash, const BYTE* lastHashed,
-                                     const BYTE* iend, const BYTE* base,
-                                     U32 hBits, ldmParams_t const ldmParams)
-{
-    U64 rollingHash = lastHash;
-    const BYTE* cur = lastHashed + 1;
-
-    while (cur < iend) {
-        rollingHash = ZSTD_ldm_updateHash(rollingHash, cur[-1],
-                                          cur[ldmParams.minMatchLength-1],
-                                          state->hashPower);
-        ZSTD_ldm_makeEntryAndInsertByTag(state,
-                                         rollingHash, hBits,
-                                         (U32)(cur - base), ldmParams);
-        ++cur;
-    }
-    return rollingHash;
-}
-
-
-/** ZSTD_ldm_limitTableUpdate() :
- *
- *  Sets cctx->nextToUpdate to a position corresponding closer to anchor
- *  if it is far way
- *  (after a long match, only update tables a limited amount). */
-static void ZSTD_ldm_limitTableUpdate(ZSTD_CCtx* cctx, const BYTE* anchor)
-{
-    U32 const current = (U32)(anchor - cctx->base);
-    if (current > cctx->nextToUpdate + 1024) {
-        cctx->nextToUpdate =
-            current - MIN(512, current - cctx->nextToUpdate - 1024);
-    }
-}
-
-typedef size_t (*ZSTD_blockCompressor) (ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-/* defined in zstd_compress.c */
-ZSTD_blockCompressor ZSTD_selectBlockCompressor(ZSTD_strategy strat, int extDict);
-
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_compressBlock_ldm_generic(ZSTD_CCtx* cctx,
-                                      const void* src, size_t srcSize)
-{
-    ldmState_t* const ldmState = &(cctx->ldmState);
-    const ldmParams_t ldmParams = cctx->appliedParams.ldmParams;
-    const U64 hashPower = ldmState->hashPower;
-    const U32 hBits = ldmParams.hashLog - ldmParams.bucketSizeLog;
-    const U32 ldmBucketSize = ((U32)1 << ldmParams.bucketSizeLog);
-    const U32 ldmTagMask = ((U32)1 << ldmParams.hashEveryLog) - 1;
-    seqStore_t* const seqStorePtr = &(cctx->seqStore);
-    const BYTE* const base = cctx->base;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = cctx->dictLimit;
-    const BYTE* const lowest = base + lowestIndex;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - MAX(ldmParams.minMatchLength, HASH_READ_SIZE);
-
-    const ZSTD_blockCompressor blockCompressor =
-        ZSTD_selectBlockCompressor(cctx->appliedParams.cParams.strategy, 0);
-    U32* const repToConfirm = seqStorePtr->repToConfirm;
-    U32 savedRep[ZSTD_REP_NUM];
-    U64 rollingHash = 0;
-    const BYTE* lastHashed = NULL;
-    size_t i, lastLiterals;
-
-    /* Save seqStorePtr->rep and copy repToConfirm */
-    for (i = 0; i < ZSTD_REP_NUM; i++)
-        savedRep[i] = repToConfirm[i] = seqStorePtr->rep[i];
-
-    /* Main Search Loop */
-    while (ip < ilimit) {   /* < instead of <=, because repcode check at (ip+1) */
-        size_t mLength;
-        U32 const current = (U32)(ip - base);
-        size_t forwardMatchLength = 0, backwardMatchLength = 0;
-        ldmEntry_t* bestEntry = NULL;
-        if (ip != istart) {
-            rollingHash = ZSTD_ldm_updateHash(rollingHash, lastHashed[0],
-                                              lastHashed[ldmParams.minMatchLength],
-                                              hashPower);
-        } else {
-            rollingHash = ZSTD_ldm_getRollingHash(ip, ldmParams.minMatchLength);
-        }
-        lastHashed = ip;
-
-        /* Do not insert and do not look for a match */
-        if (ZSTD_ldm_getTag(rollingHash, hBits, ldmParams.hashEveryLog) !=
-                ldmTagMask) {
-           ip++;
-           continue;
-        }
-
-        /* Get the best entry and compute the match lengths */
-        {
-            ldmEntry_t* const bucket =
-                ZSTD_ldm_getBucket(ldmState,
-                                   ZSTD_ldm_getSmallHash(rollingHash, hBits),
-                                   ldmParams);
-            ldmEntry_t* cur;
-            size_t bestMatchLength = 0;
-            U32 const checksum = ZSTD_ldm_getChecksum(rollingHash, hBits);
-
-            for (cur = bucket; cur < bucket + ldmBucketSize; ++cur) {
-                const BYTE* const pMatch = cur->offset + base;
-                size_t curForwardMatchLength, curBackwardMatchLength,
-                       curTotalMatchLength;
-                if (cur->checksum != checksum || cur->offset <= lowestIndex) {
-                    continue;
-                }
-
-                curForwardMatchLength = ZSTD_count(ip, pMatch, iend);
-                if (curForwardMatchLength < ldmParams.minMatchLength) {
-                    continue;
-                }
-                curBackwardMatchLength = ZSTD_ldm_countBackwardsMatch(
-                                             ip, anchor, pMatch, lowest);
-                curTotalMatchLength = curForwardMatchLength +
-                                      curBackwardMatchLength;
-
-                if (curTotalMatchLength > bestMatchLength) {
-                    bestMatchLength = curTotalMatchLength;
-                    forwardMatchLength = curForwardMatchLength;
-                    backwardMatchLength = curBackwardMatchLength;
-                    bestEntry = cur;
-                }
-            }
-        }
-
-        /* No match found -- continue searching */
-        if (bestEntry == NULL) {
-            ZSTD_ldm_makeEntryAndInsertByTag(ldmState, rollingHash,
-                                             hBits, current,
-                                             ldmParams);
-            ip++;
-            continue;
-        }
-
-        /* Match found */
-        mLength = forwardMatchLength + backwardMatchLength;
-        ip -= backwardMatchLength;
-
-        /* Call the block compressor on the remaining literals */
-        {
-            U32 const matchIndex = bestEntry->offset;
-            const BYTE* const match = base + matchIndex - backwardMatchLength;
-            U32 const offset = (U32)(ip - match);
-
-            /* Overwrite rep codes */
-            for (i = 0; i < ZSTD_REP_NUM; i++)
-                seqStorePtr->rep[i] = repToConfirm[i];
-
-            /* Fill tables for block compressor */
-            ZSTD_ldm_limitTableUpdate(cctx, anchor);
-            ZSTD_ldm_fillFastTables(cctx, anchor);
-
-            /* Call block compressor and get remaining literals */
-            lastLiterals = blockCompressor(cctx, anchor, ip - anchor);
-            cctx->nextToUpdate = (U32)(ip - base);
-
-            /* Update repToConfirm with the new offset */
-            for (i = ZSTD_REP_NUM - 1; i > 0; i--)
-                repToConfirm[i] = repToConfirm[i-1];
-            repToConfirm[0] = offset;
-
-            /* Store the sequence with the leftover literals */
-            ZSTD_storeSeq(seqStorePtr, lastLiterals, ip - lastLiterals,
-                          offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-        }
-
-        /* Insert the current entry into the hash table */
-        ZSTD_ldm_makeEntryAndInsertByTag(ldmState, rollingHash, hBits,
-                                         (U32)(lastHashed - base),
-                                         ldmParams);
-
-        assert(ip + backwardMatchLength == lastHashed);
-
-        /* Fill the hash table from lastHashed+1 to ip+mLength*/
-        /* Heuristic: don't need to fill the entire table at end of block */
-        if (ip + mLength < ilimit) {
-            rollingHash = ZSTD_ldm_fillLdmHashTable(
-                              ldmState, rollingHash, lastHashed,
-                              ip + mLength, base, hBits, ldmParams);
-            lastHashed = ip + mLength - 1;
-        }
-        ip += mLength;
-        anchor = ip;
-        /* Check immediate repcode */
-        while ( (ip < ilimit)
-             && ( (repToConfirm[1] > 0) && (repToConfirm[1] <= (U32)(ip-lowest))
-             && (MEM_read32(ip) == MEM_read32(ip - repToConfirm[1])) )) {
-
-            size_t const rLength = ZSTD_count(ip+4, ip+4-repToConfirm[1],
-                                              iend) + 4;
-            /* Swap repToConfirm[1] <=> repToConfirm[0] */
-            {
-                U32 const tmpOff = repToConfirm[1];
-                repToConfirm[1] = repToConfirm[0];
-                repToConfirm[0] = tmpOff;
-            }
-
-            ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, rLength-MINMATCH);
-
-            /* Fill the  hash table from lastHashed+1 to ip+rLength*/
-            if (ip + rLength < ilimit) {
-                rollingHash = ZSTD_ldm_fillLdmHashTable(
-                                ldmState, rollingHash, lastHashed,
-                                ip + rLength, base, hBits, ldmParams);
-                lastHashed = ip + rLength - 1;
-            }
-            ip += rLength;
-            anchor = ip;
-        }
-    }
-
-    /* Overwrite rep */
-    for (i = 0; i < ZSTD_REP_NUM; i++)
-        seqStorePtr->rep[i] = repToConfirm[i];
-
-    ZSTD_ldm_limitTableUpdate(cctx, anchor);
-    ZSTD_ldm_fillFastTables(cctx, anchor);
-
-    lastLiterals = blockCompressor(cctx, anchor, iend - anchor);
-    cctx->nextToUpdate = (U32)(iend - base);
-
-    /* Restore seqStorePtr->rep */
-    for (i = 0; i < ZSTD_REP_NUM; i++)
-        seqStorePtr->rep[i] = savedRep[i];
-
-    /* Return the last literals size */
-    return lastLiterals;
-}
-
-size_t ZSTD_compressBlock_ldm(ZSTD_CCtx* ctx,
-                              const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_ldm_generic(ctx, src, srcSize);
-}
-
-static size_t ZSTD_compressBlock_ldm_extDict_generic(
-                                 ZSTD_CCtx* ctx,
-                                 const void* src, size_t srcSize)
-{
-    ldmState_t* const ldmState = &(ctx->ldmState);
-    const ldmParams_t ldmParams = ctx->appliedParams.ldmParams;
-    const U64 hashPower = ldmState->hashPower;
-    const U32 hBits = ldmParams.hashLog - ldmParams.bucketSizeLog;
-    const U32 ldmBucketSize = ((U32)1 << ldmParams.bucketSizeLog);
-    const U32 ldmTagMask = ((U32)1 << ldmParams.hashEveryLog) - 1;
-    seqStore_t* const seqStorePtr = &(ctx->seqStore);
-    const BYTE* const base = ctx->base;
-    const BYTE* const dictBase = ctx->dictBase;
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const U32   lowestIndex = ctx->lowLimit;
-    const BYTE* const dictStart = dictBase + lowestIndex;
-    const U32   dictLimit = ctx->dictLimit;
-    const BYTE* const lowPrefixPtr = base + dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - MAX(ldmParams.minMatchLength, HASH_READ_SIZE);
-
-    const ZSTD_blockCompressor blockCompressor =
-        ZSTD_selectBlockCompressor(ctx->appliedParams.cParams.strategy, 1);
-    U32* const repToConfirm = seqStorePtr->repToConfirm;
-    U32 savedRep[ZSTD_REP_NUM];
-    U64 rollingHash = 0;
-    const BYTE* lastHashed = NULL;
-    size_t i, lastLiterals;
-
-    /* Save seqStorePtr->rep and copy repToConfirm */
-    for (i = 0; i < ZSTD_REP_NUM; i++) {
-        savedRep[i] = repToConfirm[i] = seqStorePtr->rep[i];
-    }
-
-    /* Search Loop */
-    while (ip < ilimit) {  /* < instead of <=, because (ip+1) */
-        size_t mLength;
-        const U32 current = (U32)(ip-base);
-        size_t forwardMatchLength = 0, backwardMatchLength = 0;
-        ldmEntry_t* bestEntry = NULL;
-        if (ip != istart) {
-          rollingHash = ZSTD_ldm_updateHash(rollingHash, lastHashed[0],
-                                       lastHashed[ldmParams.minMatchLength],
-                                       hashPower);
-        } else {
-            rollingHash = ZSTD_ldm_getRollingHash(ip, ldmParams.minMatchLength);
-        }
-        lastHashed = ip;
-
-        if (ZSTD_ldm_getTag(rollingHash, hBits, ldmParams.hashEveryLog) !=
-                ldmTagMask) {
-            /* Don't insert and don't look for a match */
-           ip++;
-           continue;
-        }
-
-        /* Get the best entry and compute the match lengths */
-        {
-            ldmEntry_t* const bucket =
-                ZSTD_ldm_getBucket(ldmState,
-                                   ZSTD_ldm_getSmallHash(rollingHash, hBits),
-                                   ldmParams);
-            ldmEntry_t* cur;
-            size_t bestMatchLength = 0;
-            U32 const checksum = ZSTD_ldm_getChecksum(rollingHash, hBits);
-
-            for (cur = bucket; cur < bucket + ldmBucketSize; ++cur) {
-                const BYTE* const curMatchBase =
-                    cur->offset < dictLimit ? dictBase : base;
-                const BYTE* const pMatch = curMatchBase + cur->offset;
-                const BYTE* const matchEnd =
-                    cur->offset < dictLimit ? dictEnd : iend;
-                const BYTE* const lowMatchPtr =
-                    cur->offset < dictLimit ? dictStart : lowPrefixPtr;
-                size_t curForwardMatchLength, curBackwardMatchLength,
-                       curTotalMatchLength;
-
-                if (cur->checksum != checksum || cur->offset <= lowestIndex) {
-                    continue;
-                }
-
-                curForwardMatchLength = ZSTD_count_2segments(
-                                            ip, pMatch, iend,
-                                            matchEnd, lowPrefixPtr);
-                if (curForwardMatchLength < ldmParams.minMatchLength) {
-                    continue;
-                }
-                curBackwardMatchLength = ZSTD_ldm_countBackwardsMatch(
-                                             ip, anchor, pMatch, lowMatchPtr);
-                curTotalMatchLength = curForwardMatchLength +
-                                      curBackwardMatchLength;
-
-                if (curTotalMatchLength > bestMatchLength) {
-                    bestMatchLength = curTotalMatchLength;
-                    forwardMatchLength = curForwardMatchLength;
-                    backwardMatchLength = curBackwardMatchLength;
-                    bestEntry = cur;
-                }
-            }
-        }
-
-        /* No match found -- continue searching */
-        if (bestEntry == NULL) {
-            ZSTD_ldm_makeEntryAndInsertByTag(ldmState, rollingHash, hBits,
-                                             (U32)(lastHashed - base),
-                                             ldmParams);
-            ip++;
-            continue;
-        }
-
-        /* Match found */
-        mLength = forwardMatchLength + backwardMatchLength;
-        ip -= backwardMatchLength;
-
-        /* Call the block compressor on the remaining literals */
-        {
-            /* ip = current - backwardMatchLength
-             * The match is at (bestEntry->offset - backwardMatchLength) */
-            U32 const matchIndex = bestEntry->offset;
-            U32 const offset = current - matchIndex;
-
-            /* Overwrite rep codes */
-            for (i = 0; i < ZSTD_REP_NUM; i++)
-                seqStorePtr->rep[i] = repToConfirm[i];
-
-            /* Fill the hash table for the block compressor */
-            ZSTD_ldm_limitTableUpdate(ctx, anchor);
-            ZSTD_ldm_fillFastTables(ctx, anchor);
-
-            /* Call block compressor and get remaining literals  */
-            lastLiterals = blockCompressor(ctx, anchor, ip - anchor);
-            ctx->nextToUpdate = (U32)(ip - base);
-
-            /* Update repToConfirm with the new offset */
-            for (i = ZSTD_REP_NUM - 1; i > 0; i--)
-                repToConfirm[i] = repToConfirm[i-1];
-            repToConfirm[0] = offset;
-
-            /* Store the sequence with the leftover literals */
-            ZSTD_storeSeq(seqStorePtr, lastLiterals, ip - lastLiterals,
-                          offset + ZSTD_REP_MOVE, mLength - MINMATCH);
-        }
-
-        /* Insert the current entry into the hash table */
-        ZSTD_ldm_makeEntryAndInsertByTag(ldmState, rollingHash, hBits,
-                                         (U32)(lastHashed - base),
-                                         ldmParams);
-
-        /* Fill the hash table from lastHashed+1 to ip+mLength */
-        assert(ip + backwardMatchLength == lastHashed);
-        if (ip + mLength < ilimit) {
-            rollingHash = ZSTD_ldm_fillLdmHashTable(
-                              ldmState, rollingHash, lastHashed,
-                              ip + mLength, base, hBits,
-                              ldmParams);
-            lastHashed = ip + mLength - 1;
-        }
-        ip += mLength;
-        anchor = ip;
-
-        /* check immediate repcode */
-        while (ip < ilimit) {
-            U32 const current2 = (U32)(ip-base);
-            U32 const repIndex2 = current2 - repToConfirm[1];
-            const BYTE* repMatch2 = repIndex2 < dictLimit ?
-                                    dictBase + repIndex2 : base + repIndex2;
-            if ( (((U32)((dictLimit-1) - repIndex2) >= 3) &
-                        (repIndex2 > lowestIndex))  /* intentional overflow */
-               && (MEM_read32(repMatch2) == MEM_read32(ip)) ) {
-                const BYTE* const repEnd2 = repIndex2 < dictLimit ?
-                                            dictEnd : iend;
-                size_t const repLength2 =
-                        ZSTD_count_2segments(ip+4, repMatch2+4, iend,
-                                             repEnd2, lowPrefixPtr) + 4;
-
-                U32 tmpOffset = repToConfirm[1];
-                repToConfirm[1] = repToConfirm[0];
-                repToConfirm[0] = tmpOffset;
-
-                ZSTD_storeSeq(seqStorePtr, 0, anchor, 0, repLength2-MINMATCH);
-
-                /* Fill the  hash table from lastHashed+1 to ip+repLength2*/
-                if (ip + repLength2 < ilimit) {
-                    rollingHash = ZSTD_ldm_fillLdmHashTable(
-                                      ldmState, rollingHash, lastHashed,
-                                      ip + repLength2, base, hBits,
-                                      ldmParams);
-                    lastHashed = ip + repLength2 - 1;
-                }
-                ip += repLength2;
-                anchor = ip;
-                continue;
-            }
-            break;
-        }
-    }
-
-    /* Overwrite rep */
-    for (i = 0; i < ZSTD_REP_NUM; i++)
-        seqStorePtr->rep[i] = repToConfirm[i];
-
-    ZSTD_ldm_limitTableUpdate(ctx, anchor);
-    ZSTD_ldm_fillFastTables(ctx, anchor);
-
-    /* Call the block compressor one last time on the last literals */
-    lastLiterals = blockCompressor(ctx, anchor, iend - anchor);
-    ctx->nextToUpdate = (U32)(iend - base);
-
-    /* Restore seqStorePtr->rep */
-    for (i = 0; i < ZSTD_REP_NUM; i++)
-        seqStorePtr->rep[i] = savedRep[i];
-
-    /* Return the last literals size */
-    return lastLiterals;
-}
-
-size_t ZSTD_compressBlock_ldm_extDict(ZSTD_CCtx* ctx,
-                                      const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_ldm_extDict_generic(ctx, src, srcSize);
-}
diff --git a/priv/zstd/lib/compress/zstd_ldm.h b/priv/zstd/lib/compress/zstd_ldm.h
deleted file mode 100644
index 8f12c67..0000000
--- a/priv/zstd/lib/compress/zstd_ldm.h
+++ /dev/null
@@ -1,68 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-
-#ifndef ZSTD_LDM_H
-#define ZSTD_LDM_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#include "zstd_compress_internal.h"   /* ldmParams_t, U32 */
-#include "zstd.h"   /* ZSTD_CCtx, size_t */
-
-/*-*************************************
-*  Long distance matching
-***************************************/
-
-#define ZSTD_LDM_DEFAULT_WINDOW_LOG ZSTD_WINDOWLOG_DEFAULTMAX
-#define ZSTD_LDM_HASHEVERYLOG_NOTSET 9999
-
-/** ZSTD_compressBlock_ldm_generic() :
- *
- *  This is a block compressor intended for long distance matching.
- *
- *  The function searches for matches of length at least
- *  ldmParams.minMatchLength using a hash table in cctx->ldmState.
- *  Matches can be at a distance of up to cParams.windowLog.
- *
- *  Upon finding a match, the unmatched literals are compressed using a
- *  ZSTD_blockCompressor (depending on the strategy in the compression
- *  parameters), which stores the matched sequences. The "long distance"
- *  match is then stored with the remaining literals from the
- *  ZSTD_blockCompressor. */
-size_t ZSTD_compressBlock_ldm(ZSTD_CCtx* cctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_ldm_extDict(ZSTD_CCtx* ctx,
-                                      const void* src, size_t srcSize);
-
-/** ZSTD_ldm_initializeParameters() :
- *  Initialize the long distance matching parameters to their default values. */
-size_t ZSTD_ldm_initializeParameters(ldmParams_t* params, U32 enableLdm);
-
-/** ZSTD_ldm_getTableSize() :
- *  Estimate the space needed for long distance matching tables. */
-size_t ZSTD_ldm_getTableSize(U32 hashLog, U32 bucketSizeLog);
-
-/** ZSTD_ldm_getTableSize() :
- *  Return prime8bytes^(minMatchLength-1) */
-U64 ZSTD_ldm_getHashPower(U32 minMatchLength);
-
-/** ZSTD_ldm_adjustParameters() :
- *  If the params->hashEveryLog is not set, set it to its default value based on
- *  windowLog and params->hashLog.
- *
- *  Ensures that params->bucketSizeLog is <= params->hashLog (setting it to
- *  params->hashLog if it is not). */
-void ZSTD_ldm_adjustParameters(ldmParams_t* params, U32 windowLog);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_FAST_H */
diff --git a/priv/zstd/lib/compress/zstd_opt.c b/priv/zstd/lib/compress/zstd_opt.c
deleted file mode 100644
index 7171ff5..0000000
--- a/priv/zstd/lib/compress/zstd_opt.c
+++ /dev/null
@@ -1,785 +0,0 @@
-/*
- * Copyright (c) 2016-present, Przemyslaw Skibinski, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#include "zstd_compress_internal.h"
-#include "zstd_opt.h"
-#include "zstd_lazy.h"   /* ZSTD_updateTree, ZSTD_updateTree_extDict */
-
-
-#define ZSTD_LITFREQ_ADD    2   /* scaling factor for litFreq, so that frequencies adapt faster to new stats. Also used for matchSum (?) */
-#define ZSTD_FREQ_DIV       4   /* log factor when using previous stats to init next stats */
-#define ZSTD_MAX_PRICE     (1<<30)
-
-
-/*-*************************************
-*  Price functions for optimal parser
-***************************************/
-static void ZSTD_setLog2Prices(optState_t* optPtr)
-{
-    optPtr->log2litSum = ZSTD_highbit32(optPtr->litSum+1);
-    optPtr->log2litLengthSum = ZSTD_highbit32(optPtr->litLengthSum+1);
-    optPtr->log2matchLengthSum = ZSTD_highbit32(optPtr->matchLengthSum+1);
-    optPtr->log2offCodeSum = ZSTD_highbit32(optPtr->offCodeSum+1);
-}
-
-
-static void ZSTD_rescaleFreqs(optState_t* const optPtr,
-                              const BYTE* const src, size_t const srcSize)
-{
-    optPtr->staticPrices = 0;
-
-    if (optPtr->litLengthSum == 0) {  /* first init */
-        unsigned u;
-        if (srcSize <= 1024) optPtr->staticPrices = 1;
-
-        assert(optPtr->litFreq!=NULL);
-        for (u=0; u<=MaxLit; u++)
-            optPtr->litFreq[u] = 0;
-        for (u=0; ulitFreq[src[u]]++;
-        optPtr->litSum = 0;
-        for (u=0; u<=MaxLit; u++) {
-            optPtr->litFreq[u] = 1 + (optPtr->litFreq[u] >> ZSTD_FREQ_DIV);
-            optPtr->litSum += optPtr->litFreq[u];
-        }
-
-        for (u=0; u<=MaxLL; u++)
-            optPtr->litLengthFreq[u] = 1;
-        optPtr->litLengthSum = MaxLL+1;
-        for (u=0; u<=MaxML; u++)
-            optPtr->matchLengthFreq[u] = 1;
-        optPtr->matchLengthSum = MaxML+1;
-        for (u=0; u<=MaxOff; u++)
-            optPtr->offCodeFreq[u] = 1;
-        optPtr->offCodeSum = (MaxOff+1);
-
-    } else {
-        unsigned u;
-
-        optPtr->litSum = 0;
-        for (u=0; u<=MaxLit; u++) {
-            optPtr->litFreq[u] = 1 + (optPtr->litFreq[u] >> (ZSTD_FREQ_DIV+1));
-            optPtr->litSum += optPtr->litFreq[u];
-        }
-        optPtr->litLengthSum = 0;
-        for (u=0; u<=MaxLL; u++) {
-            optPtr->litLengthFreq[u] = 1 + (optPtr->litLengthFreq[u]>>(ZSTD_FREQ_DIV+1));
-            optPtr->litLengthSum += optPtr->litLengthFreq[u];
-        }
-        optPtr->matchLengthSum = 0;
-        for (u=0; u<=MaxML; u++) {
-            optPtr->matchLengthFreq[u] = 1 + (optPtr->matchLengthFreq[u]>>ZSTD_FREQ_DIV);
-            optPtr->matchLengthSum += optPtr->matchLengthFreq[u];
-        }
-        optPtr->offCodeSum = 0;
-        for (u=0; u<=MaxOff; u++) {
-            optPtr->offCodeFreq[u] = 1 + (optPtr->offCodeFreq[u]>>ZSTD_FREQ_DIV);
-            optPtr->offCodeSum += optPtr->offCodeFreq[u];
-        }
-    }
-
-    ZSTD_setLog2Prices(optPtr);
-}
-
-
-/* ZSTD_rawLiteralsCost() :
- * cost of literals (only) in given segment (which length can be null)
- * does not include cost of literalLength symbol */
-static U32 ZSTD_rawLiteralsCost(const BYTE* const literals, U32 const litLength,
-                                const optState_t* const optPtr)
-{
-    if (optPtr->staticPrices) return (litLength*6);  /* 6 bit per literal - no statistic used */
-    if (litLength == 0) return 0;
-
-    /* literals */
-    {   U32 u;
-        U32 cost = litLength * optPtr->log2litSum;
-        for (u=0; u < litLength; u++)
-            cost -= ZSTD_highbit32(optPtr->litFreq[literals[u]]+1);
-        return cost;
-    }
-}
-
-/* ZSTD_litLengthPrice() :
- * cost of literalLength symbol */
-static U32 ZSTD_litLengthPrice(U32 const litLength, const optState_t* const optPtr)
-{
-    if (optPtr->staticPrices) return ZSTD_highbit32((U32)litLength+1);
-
-    /* literal Length */
-    {   U32 const llCode = ZSTD_LLcode(litLength);
-        U32 const price = LL_bits[llCode] + optPtr->log2litLengthSum - ZSTD_highbit32(optPtr->litLengthFreq[llCode]+1);
-        return price;
-    }
-}
-
-/* ZSTD_litLengthPrice() :
- * cost of the literal part of a sequence,
- * including literals themselves, and literalLength symbol */
-static U32 ZSTD_fullLiteralsCost(const BYTE* const literals, U32 const litLength,
-                                 const optState_t* const optPtr)
-{
-    return ZSTD_rawLiteralsCost(literals, litLength, optPtr)
-         + ZSTD_litLengthPrice(litLength, optPtr);
-}
-
-/* ZSTD_litLengthContribution() :
- * @return ( cost(litlength) - cost(0) )
- * this value can then be added to rawLiteralsCost()
- * to provide a cost which is directly comparable to a match ending at same position */
-static int ZSTD_litLengthContribution(U32 const litLength, const optState_t* const optPtr)
-{
-    if (optPtr->staticPrices) return ZSTD_highbit32(litLength+1);
-
-    /* literal Length */
-    {   U32 const llCode = ZSTD_LLcode(litLength);
-        int const contribution = LL_bits[llCode]
-                        + ZSTD_highbit32(optPtr->litLengthFreq[0]+1)
-                        - ZSTD_highbit32(optPtr->litLengthFreq[llCode]+1);
-#if 1
-        return contribution;
-#else
-        return MAX(0, contribution); /* sometimes better, sometimes not ... */
-#endif
-    }
-}
-
-/* ZSTD_literalsContribution() :
- * creates a fake cost for the literals part of a sequence
- * which can be compared to the ending cost of a match
- * should a new match start at this position */
-static int ZSTD_literalsContribution(const BYTE* const literals, U32 const litLength,
-                                     const optState_t* const optPtr)
-{
-    int const contribution = ZSTD_rawLiteralsCost(literals, litLength, optPtr)
-                           + ZSTD_litLengthContribution(litLength, optPtr);
-    return contribution;
-}
-
-/* ZSTD_getMatchPrice() :
- * Provides the cost of the match part (offset + matchLength) of a sequence
- * Must be combined with ZSTD_fullLiteralsCost() to get the full cost of a sequence.
- * optLevel: when <2, favors small offset for decompression speed (improved cache efficiency) */
-FORCE_INLINE_TEMPLATE U32 ZSTD_getMatchPrice(
-                                    U32 const offset, U32 const matchLength,
-                                    const optState_t* const optPtr,
-                                    int const optLevel)
-{
-    U32 price;
-    U32 const offCode = ZSTD_highbit32(offset+1);
-    U32 const mlBase = matchLength - MINMATCH;
-    assert(matchLength >= MINMATCH);
-
-    if (optPtr->staticPrices)  /* fixed scheme, do not use statistics */
-        return ZSTD_highbit32((U32)mlBase+1) + 16 + offCode;
-
-    price = offCode + optPtr->log2offCodeSum - ZSTD_highbit32(optPtr->offCodeFreq[offCode]+1);
-    if ((optLevel<2) /*static*/ && offCode >= 20) price += (offCode-19)*2; /* handicap for long distance offsets, favor decompression speed */
-
-    /* match Length */
-    {   U32 const mlCode = ZSTD_MLcode(mlBase);
-        price += ML_bits[mlCode] + optPtr->log2matchLengthSum - ZSTD_highbit32(optPtr->matchLengthFreq[mlCode]+1);
-    }
-
-    DEBUGLOG(8, "ZSTD_getMatchPrice(ml:%u) = %u", matchLength, price);
-    return price;
-}
-
-static void ZSTD_updateStats(optState_t* const optPtr,
-                             U32 litLength, const BYTE* literals,
-                             U32 offsetCode, U32 matchLength)
-{
-    /* literals */
-    {   U32 u;
-        for (u=0; u < litLength; u++)
-            optPtr->litFreq[literals[u]] += ZSTD_LITFREQ_ADD;
-        optPtr->litSum += litLength*ZSTD_LITFREQ_ADD;
-    }
-
-    /* literal Length */
-    {   U32 const llCode = ZSTD_LLcode(litLength);
-        optPtr->litLengthFreq[llCode]++;
-        optPtr->litLengthSum++;
-    }
-
-    /* match offset code (0-2=>repCode; 3+=>offset+2) */
-    {   U32 const offCode = ZSTD_highbit32(offsetCode+1);
-        assert(offCode <= MaxOff);
-        optPtr->offCodeFreq[offCode]++;
-        optPtr->offCodeSum++;
-    }
-
-    /* match Length */
-    {   U32 const mlBase = matchLength - MINMATCH;
-        U32 const mlCode = ZSTD_MLcode(mlBase);
-        optPtr->matchLengthFreq[mlCode]++;
-        optPtr->matchLengthSum++;
-    }
-}
-
-
-/* ZSTD_readMINMATCH() :
- * function safe only for comparisons
- * assumption : memPtr must be at least 4 bytes before end of buffer */
-MEM_STATIC U32 ZSTD_readMINMATCH(const void* memPtr, U32 length)
-{
-    switch (length)
-    {
-    default :
-    case 4 : return MEM_read32(memPtr);
-    case 3 : if (MEM_isLittleEndian())
-                return MEM_read32(memPtr)<<8;
-             else
-                return MEM_read32(memPtr)>>8;
-    }
-}
-
-
-/* Update hashTable3 up to ip (excluded)
-   Assumption : always within prefix (i.e. not within extDict) */
-static U32 ZSTD_insertAndFindFirstIndexHash3 (ZSTD_CCtx* const cctx, const BYTE* const ip)
-{
-    U32* const hashTable3  = cctx->hashTable3;
-    U32 const hashLog3  = cctx->hashLog3;
-    const BYTE* const base = cctx->base;
-    U32 idx = cctx->nextToUpdate3;
-    U32 const target = cctx->nextToUpdate3 = (U32)(ip - base);
-    size_t const hash3 = ZSTD_hash3Ptr(ip, hashLog3);
-
-    while(idx < target) {
-        hashTable3[ZSTD_hash3Ptr(base+idx, hashLog3)] = idx;
-        idx++;
-    }
-
-    return hashTable3[hash3];
-}
-
-
-/*-*************************************
-*  Binary Tree search
-***************************************/
-FORCE_INLINE_TEMPLATE
-U32 ZSTD_insertBtAndGetAllMatches (
-                    ZSTD_CCtx* zc,
-                    const BYTE* const ip, const BYTE* const iLimit, int const extDict,
-                    U32 nbCompares, U32 const mls, U32 const sufficient_len,
-                    U32 rep[ZSTD_REP_NUM], U32 const ll0,
-                    ZSTD_match_t* matches, const U32 lengthToBeat)
-{
-    const BYTE* const base = zc->base;
-    U32 const current = (U32)(ip-base);
-    U32 const hashLog = zc->appliedParams.cParams.hashLog;
-    U32 const minMatch = (mls==3) ? 3 : 4;
-    U32* const hashTable = zc->hashTable;
-    size_t const h  = ZSTD_hashPtr(ip, hashLog, mls);
-    U32 matchIndex  = hashTable[h];
-    U32* const bt   = zc->chainTable;
-    U32 const btLog = zc->appliedParams.cParams.chainLog - 1;
-    U32 const btMask= (1U << btLog) - 1;
-    size_t commonLengthSmaller=0, commonLengthLarger=0;
-    const BYTE* const dictBase = zc->dictBase;
-    U32 const dictLimit = zc->dictLimit;
-    const BYTE* const dictEnd = dictBase + dictLimit;
-    const BYTE* const prefixStart = base + dictLimit;
-    U32 const btLow = btMask >= current ? 0 : current - btMask;
-    U32 const windowLow = zc->lowLimit;
-    U32* smallerPtr = bt + 2*(current&btMask);
-    U32* largerPtr  = bt + 2*(current&btMask) + 1;
-    U32 matchEndIdx = current+8+1;   /* farthest referenced position of any match => detects repetitive patterns */
-    U32 dummy32;   /* to be nullified at the end */
-    U32 mnum = 0;
-
-    size_t bestLength = lengthToBeat-1;
-    DEBUGLOG(7, "ZSTD_insertBtAndGetAllMatches");
-
-    /* check repCode */
-    {   U32 const lastR = ZSTD_REP_NUM + ll0;
-        U32 repCode;
-        for (repCode = ll0; repCode < lastR; repCode++) {
-            U32 const repOffset = (repCode==ZSTD_REP_NUM) ? (rep[0] - 1) : rep[repCode];
-            U32 const repIndex = current - repOffset;
-            U32 repLen = 0;
-            assert(current >= dictLimit);
-            if (repOffset-1 /* intentional overflow, discards 0 and -1 */ < current-dictLimit) {  /* equivalent to `current > repIndex >= dictLimit` */
-                if (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(ip - repOffset, minMatch)) {
-                    repLen = (U32)ZSTD_count(ip+minMatch, ip+minMatch-repOffset, iLimit) + minMatch;
-                }
-            } else {  /* repIndex < dictLimit || repIndex >= current */
-                const BYTE* const repMatch = dictBase + repIndex;
-                assert(current >= windowLow);
-                if ( extDict /* this case only valid in extDict mode */
-                  && ( ((repOffset-1) /*intentional overflow*/ < current - windowLow)  /* equivalent to `current > repIndex >= windowLow` */
-                     & (((U32)((dictLimit-1) - repIndex) >= 3) ) /* intentional overflow : do not test positions overlapping 2 memory segments */)
-                  && (ZSTD_readMINMATCH(ip, minMatch) == ZSTD_readMINMATCH(repMatch, minMatch)) ) {
-                    repLen = (U32)ZSTD_count_2segments(ip+minMatch, repMatch+minMatch, iLimit, dictEnd, prefixStart) + minMatch;
-            }   }
-            /* save longer solution */
-            if (repLen > bestLength) {
-                DEBUGLOG(8, "found rep-match %u of length %u",
-                            repCode - ll0, (U32)repLen);
-                bestLength = repLen;
-                matches[mnum].off = repCode - ll0;
-                matches[mnum].len = (U32)repLen;
-                mnum++;
-                if ( (repLen > sufficient_len)
-                   | (ip+repLen == iLimit) ) {  /* best possible */
-                    return mnum;
-    }   }   }   }
-
-    /* HC3 match finder */
-    if ((mls == 3) /*static*/ && (bestLength < mls)) {
-        U32 const matchIndex3 = ZSTD_insertAndFindFirstIndexHash3 (zc, ip);
-        if ((matchIndex3 > windowLow)
-          & (current - matchIndex3 < (1<<18)) /*heuristic : longer distance likely too expensive*/ ) {
-            size_t mlen;
-            if ((!extDict) /*static*/ || (matchIndex3 >= dictLimit)) {
-                const BYTE* const match = base + matchIndex3;
-                mlen = ZSTD_count(ip, match, iLimit);
-            } else {
-                const BYTE* const match = dictBase + matchIndex3;
-                mlen = ZSTD_count_2segments(ip, match, iLimit, dictEnd, prefixStart);
-            }
-
-            /* save best solution */
-            if (mlen >= mls /* == 3 > bestLength */) {
-                DEBUGLOG(8, "found small match with hlog3, of length %u",
-                            (U32)mlen);
-                bestLength = mlen;
-                assert(current > matchIndex3);
-                assert(mnum==0);  /* no prior solution */
-                matches[0].off = (current - matchIndex3) + ZSTD_REP_MOVE;
-                matches[0].len = (U32)mlen;
-                mnum = 1;
-                if ( (mlen > sufficient_len) |
-                     (ip+mlen == iLimit) ) {  /* best possible length */
-                    zc->nextToUpdate = current+1;  /* skip insertion */
-                    return 1;
-    }   }   }   }
-
-    hashTable[h] = current;   /* Update Hash Table */
-
-    while (nbCompares-- && (matchIndex > windowLow)) {
-        U32* const nextPtr = bt + 2*(matchIndex & btMask);
-        size_t matchLength = MIN(commonLengthSmaller, commonLengthLarger);   /* guaranteed minimum nb of common bytes */
-        const BYTE* match;
-        assert(current > matchIndex);
-
-        if ((!extDict) || (matchIndex+matchLength >= dictLimit)) {
-            assert(matchIndex+matchLength >= dictLimit);  /* ensure the condition is correct when !extDict */
-            match = base + matchIndex;
-            matchLength += ZSTD_count(ip+matchLength, match+matchLength, iLimit);
-        } else {
-            match = dictBase + matchIndex;
-            matchLength += ZSTD_count_2segments(ip+matchLength, match+matchLength, iLimit, dictEnd, prefixStart);
-            if (matchIndex+matchLength >= dictLimit)
-                match = base + matchIndex;   /* prepare for match[matchLength] */
-        }
-
-        if (matchLength > bestLength) {
-            DEBUGLOG(8, "found match of length %u at distance %u",
-                    (U32)matchLength, current - matchIndex);
-            assert(matchEndIdx > matchIndex);
-            if (matchLength > matchEndIdx - matchIndex)
-                matchEndIdx = matchIndex + (U32)matchLength;
-            bestLength = matchLength;
-            matches[mnum].off = (current - matchIndex) + ZSTD_REP_MOVE;
-            matches[mnum].len = (U32)matchLength;
-            mnum++;
-            if (matchLength > ZSTD_OPT_NUM) break;
-            if (ip+matchLength == iLimit) {  /* equal : no way to know if inf or sup */
-                break;   /* drop, to preserve bt consistency (miss a little bit of compression) */
-            }
-        }
-
-        if (match[matchLength] < ip[matchLength]) {
-            /* match smaller than current */
-            *smallerPtr = matchIndex;             /* update smaller idx */
-            commonLengthSmaller = matchLength;    /* all smaller will now have at least this guaranteed common length */
-            if (matchIndex <= btLow) { smallerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            smallerPtr = nextPtr+1;               /* new candidate => larger than match, which was smaller than current */
-            matchIndex = nextPtr[1];              /* new matchIndex, larger than previous, closer to current */
-        } else {
-            *largerPtr = matchIndex;
-            commonLengthLarger = matchLength;
-            if (matchIndex <= btLow) { largerPtr=&dummy32; break; }   /* beyond tree size, stop the search */
-            largerPtr = nextPtr;
-            matchIndex = nextPtr[0];
-    }   }
-
-    *smallerPtr = *largerPtr = 0;
-
-    assert(matchEndIdx > current+8);
-    zc->nextToUpdate = matchEndIdx - 8;  /* skip repetitive patterns */
-    return mnum;
-}
-
-
-FORCE_INLINE_TEMPLATE U32 ZSTD_BtGetAllMatches (
-                        ZSTD_CCtx* zc,   /* Index table will be updated */
-                        const BYTE* ip, const BYTE* const iHighLimit, int const extDict,
-                        U32 const maxNbAttempts, U32 const matchLengthSearch, U32 const sufficient_len,
-                        U32 rep[ZSTD_REP_NUM], U32 const ll0,
-                        ZSTD_match_t* matches, U32 const lengthToBeat)
-{
-    DEBUGLOG(7, "ZSTD_BtGetAllMatches");
-    if (ip < zc->base + zc->nextToUpdate) return 0;   /* skipped area */
-    if (extDict) ZSTD_updateTree_extDict(zc, ip, iHighLimit, maxNbAttempts, matchLengthSearch);
-    else ZSTD_updateTree(zc, ip, iHighLimit, maxNbAttempts, matchLengthSearch);
-    switch(matchLengthSearch)
-    {
-    case 3 : return ZSTD_insertBtAndGetAllMatches(zc, ip, iHighLimit, extDict, maxNbAttempts, 3, sufficient_len, rep, ll0, matches, lengthToBeat);
-    default :
-    case 4 : return ZSTD_insertBtAndGetAllMatches(zc, ip, iHighLimit, extDict, maxNbAttempts, 4, sufficient_len, rep, ll0, matches, lengthToBeat);
-    case 5 : return ZSTD_insertBtAndGetAllMatches(zc, ip, iHighLimit, extDict, maxNbAttempts, 5, sufficient_len, rep, ll0, matches, lengthToBeat);
-    case 7 :
-    case 6 : return ZSTD_insertBtAndGetAllMatches(zc, ip, iHighLimit, extDict, maxNbAttempts, 6, sufficient_len, rep, ll0, matches, lengthToBeat);
-    }
-}
-
-
-/*-*******************************
-*  Optimal parser
-*********************************/
-typedef struct repcodes_s {
-    U32 rep[3];
-} repcodes_t;
-
-repcodes_t ZSTD_updateRep(U32 const rep[3], U32 const offset, U32 const ll0)
-{
-    repcodes_t newReps;
-    if (offset >= ZSTD_REP_NUM) {  /* full offset */
-        newReps.rep[2] = rep[1];
-        newReps.rep[1] = rep[0];
-        newReps.rep[0] = offset - ZSTD_REP_MOVE;
-    } else {   /* repcode */
-        U32 const repCode = offset + ll0;
-        if (repCode > 0) {  /* note : if repCode==0, no change */
-            U32 const currentOffset = (repCode==ZSTD_REP_NUM) ? (rep[0] - 1) : rep[repCode];
-            newReps.rep[2] = (repCode >= 2) ? rep[1] : rep[2];
-            newReps.rep[1] = rep[0];
-            newReps.rep[0] = currentOffset;
-        } else {   /* repCode == 0 */
-            memcpy(&newReps, rep, sizeof(newReps));
-        }
-    }
-    return newReps;
-}
-
-
-typedef struct {
-    const BYTE* anchor;
-    U32 litlen;
-    U32 rawLitCost;
-} cachedLiteralPrice_t;
-
-static U32 ZSTD_rawLiteralsCost_cached(
-                            cachedLiteralPrice_t* const cachedLitPrice,
-                            const BYTE* const anchor, U32 const litlen,
-                            const optState_t* const optStatePtr)
-{
-    U32 startCost;
-    U32 remainingLength;
-    const BYTE* startPosition;
-
-    if (anchor == cachedLitPrice->anchor) {
-        startCost = cachedLitPrice->rawLitCost;
-        startPosition = anchor + cachedLitPrice->litlen;
-        assert(litlen >= cachedLitPrice->litlen);
-        remainingLength = litlen - cachedLitPrice->litlen;
-    } else {
-        startCost = 0;
-        startPosition = anchor;
-        remainingLength = litlen;
-    }
-
-    {   U32 const rawLitCost = startCost + ZSTD_rawLiteralsCost(startPosition, remainingLength, optStatePtr);
-        cachedLitPrice->anchor = anchor;
-        cachedLitPrice->litlen = litlen;
-        cachedLitPrice->rawLitCost = rawLitCost;
-        return rawLitCost;
-    }
-}
-
-static U32 ZSTD_fullLiteralsCost_cached(
-                            cachedLiteralPrice_t* const cachedLitPrice,
-                            const BYTE* const anchor, U32 const litlen,
-                            const optState_t* const optStatePtr)
-{
-    return ZSTD_rawLiteralsCost_cached(cachedLitPrice, anchor, litlen, optStatePtr)
-         + ZSTD_litLengthPrice(litlen, optStatePtr);
-}
-
-static int ZSTD_literalsContribution_cached(
-                            cachedLiteralPrice_t* const cachedLitPrice,
-                            const BYTE* const anchor, U32 const litlen,
-                            const optState_t* const optStatePtr)
-{
-    int const contribution = ZSTD_rawLiteralsCost_cached(cachedLitPrice, anchor, litlen, optStatePtr)
-                           + ZSTD_litLengthContribution(litlen, optStatePtr);
-    return contribution;
-}
-
-FORCE_INLINE_TEMPLATE
-size_t ZSTD_compressBlock_opt_generic(ZSTD_CCtx* ctx,
-                                      const void* src, size_t srcSize,
-                                      const int optLevel, const int extDict)
-{
-    seqStore_t* const seqStorePtr = &(ctx->seqStore);
-    optState_t* const optStatePtr = &(ctx->optState);
-    const BYTE* const istart = (const BYTE*)src;
-    const BYTE* ip = istart;
-    const BYTE* anchor = istart;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* const ilimit = iend - 8;
-    const BYTE* const base = ctx->base;
-    const BYTE* const prefixStart = base + ctx->dictLimit;
-
-    U32 const maxSearches = 1U << ctx->appliedParams.cParams.searchLog;
-    U32 const sufficient_len = MIN(ctx->appliedParams.cParams.targetLength, ZSTD_OPT_NUM -1);
-    U32 const mls = ctx->appliedParams.cParams.searchLength;
-    U32 const minMatch = (ctx->appliedParams.cParams.searchLength == 3) ? 3 : 4;
-
-    ZSTD_optimal_t* const opt = optStatePtr->priceTable;
-    ZSTD_match_t* const matches = optStatePtr->matchTable;
-    cachedLiteralPrice_t cachedLitPrice;
-    U32 rep[ZSTD_REP_NUM];
-
-    /* init */
-    DEBUGLOG(5, "ZSTD_compressBlock_opt_generic");
-    ctx->nextToUpdate3 = ctx->nextToUpdate;
-    ZSTD_rescaleFreqs(optStatePtr, (const BYTE*)src, srcSize);
-    ip += (ip==prefixStart);
-    { int i; for (i=0; irep[i]; }
-    memset(&cachedLitPrice, 0, sizeof(cachedLitPrice));
-
-    /* Match Loop */
-    while (ip < ilimit) {
-        U32 cur, last_pos = 0;
-        U32 best_mlen, best_off;
-
-        /* find first match */
-        {   U32 const litlen = (U32)(ip - anchor);
-            U32 const ll0 = !litlen;
-            U32 const nbMatches = ZSTD_BtGetAllMatches(ctx, ip, iend, extDict, maxSearches, mls, sufficient_len, rep, ll0, matches, minMatch);
-            if (!nbMatches) { ip++; continue; }
-
-            /* initialize opt[0] */
-            { U32 i ; for (i=0; i immediate encoding */
-            {   U32 const maxML = matches[nbMatches-1].len;
-                DEBUGLOG(7, "found %u matches of maxLength=%u and offset=%u at cPos=%u => start new serie",
-                            nbMatches, maxML, matches[nbMatches-1].off, (U32)(ip-prefixStart));
-
-                if (maxML > sufficient_len) {
-                    best_mlen = maxML;
-                    best_off = matches[nbMatches-1].off;
-                    DEBUGLOG(7, "large match (%u>%u), immediate encoding",
-                                best_mlen, sufficient_len);
-                    cur = 0;
-                    last_pos = 1;
-                    goto _shortestPath;
-            }   }
-
-            /* set prices for first matches starting position == 0 */
-            {   U32 const literalsPrice = ZSTD_fullLiteralsCost_cached(&cachedLitPrice, anchor, litlen, optStatePtr);
-                U32 pos;
-                U32 matchNb;
-                for (pos = 0; pos < minMatch; pos++) {
-                    opt[pos].mlen = 1;
-                    opt[pos].price = ZSTD_MAX_PRICE;
-                }
-                for (matchNb = 0; matchNb < nbMatches; matchNb++) {
-                    U32 const offset = matches[matchNb].off;
-                    U32 const end = matches[matchNb].len;
-                    repcodes_t const repHistory = ZSTD_updateRep(rep, offset, ll0);
-                    for ( ; pos <= end ; pos++ ) {
-                        U32 const matchPrice = literalsPrice + ZSTD_getMatchPrice(offset, pos, optStatePtr, optLevel);
-                        DEBUGLOG(7, "rPos:%u => set initial price : %u",
-                                    pos, matchPrice);
-                        opt[pos].mlen = pos;
-                        opt[pos].off = offset;
-                        opt[pos].litlen = litlen;
-                        opt[pos].price = matchPrice;
-                        memcpy(opt[pos].rep, &repHistory, sizeof(repHistory));
-                }   }
-                last_pos = pos-1;
-            }
-        }
-
-        /* check further positions */
-        for (cur = 1; cur <= last_pos; cur++) {
-            const BYTE* const inr = ip + cur;
-            assert(cur < ZSTD_OPT_NUM);
-
-            /* Fix current position with one literal if cheaper */
-            {   U32 const litlen = (opt[cur-1].mlen == 1) ? opt[cur-1].litlen + 1 : 1;
-                int price;  /* note : contribution can be negative */
-                if (cur > litlen) {
-                    price = opt[cur - litlen].price + ZSTD_literalsContribution(inr-litlen, litlen, optStatePtr);
-                } else {
-                    price = ZSTD_literalsContribution_cached(&cachedLitPrice, anchor, litlen, optStatePtr);
-                }
-                assert(price < 1000000000); /* overflow check */
-                if (price <= opt[cur].price) {
-                    DEBUGLOG(7, "rPos:%u : better price (%u<%u) using literal",
-                                cur, price, opt[cur].price);
-                    opt[cur].mlen = 1;
-                    opt[cur].off = 0;
-                    opt[cur].litlen = litlen;
-                    opt[cur].price = price;
-                    memcpy(opt[cur].rep, opt[cur-1].rep, sizeof(opt[cur].rep));
-            }   }
-
-            /* last match must start at a minimum distance of 8 from oend */
-            if (inr > ilimit) continue;
-
-            if (cur == last_pos) break;
-
-             if ( (optLevel==0) /*static*/
-               && (opt[cur+1].price <= opt[cur].price) )
-                continue;  /* skip unpromising positions; about ~+6% speed, -0.01 ratio */
-
-            {   U32 const ll0 = (opt[cur].mlen != 1);
-                U32 const litlen = (opt[cur].mlen == 1) ? opt[cur].litlen : 0;
-                U32 const previousPrice = (cur > litlen) ? opt[cur-litlen].price : 0;
-                U32 const basePrice = previousPrice + ZSTD_fullLiteralsCost(inr-litlen, litlen, optStatePtr);
-                U32 const nbMatches = ZSTD_BtGetAllMatches(ctx, inr, iend, extDict, maxSearches, mls, sufficient_len, opt[cur].rep, ll0, matches, minMatch);
-                U32 matchNb;
-                if (!nbMatches) continue;
-
-                {   U32 const maxML = matches[nbMatches-1].len;
-                    DEBUGLOG(7, "rPos:%u, found %u matches, of maxLength=%u",
-                                cur, nbMatches, maxML);
-
-                    if ( (maxML > sufficient_len)
-                       | (cur + maxML >= ZSTD_OPT_NUM) ) {
-                        best_mlen = maxML;
-                        best_off = matches[nbMatches-1].off;
-                        last_pos = cur + 1;
-                        goto _shortestPath;
-                    }
-                }
-
-                /* set prices using matches found at position == cur */
-                for (matchNb = 0; matchNb < nbMatches; matchNb++) {
-                    U32 const offset = matches[matchNb].off;
-                    repcodes_t const repHistory = ZSTD_updateRep(opt[cur].rep, offset, ll0);
-                    U32 const lastML = matches[matchNb].len;
-                    U32 const startML = (matchNb>0) ? matches[matchNb-1].len+1 : minMatch;
-                    U32 mlen;
-
-                    DEBUGLOG(7, "testing match %u => offCode=%u, mlen=%u, llen=%u",
-                                matchNb, matches[matchNb].off, lastML, litlen);
-
-                    for (mlen = lastML; mlen >= startML; mlen--) {
-                        U32 const pos = cur + mlen;
-                        int const price = basePrice + ZSTD_getMatchPrice(offset, mlen, optStatePtr, optLevel);
-
-                        if ((pos > last_pos) || (price < opt[pos].price)) {
-                            DEBUGLOG(7, "rPos:%u => new better price (%u<%u)",
-                                        pos, price, opt[pos].price);
-                            while (last_pos < pos) { opt[last_pos+1].price = ZSTD_MAX_PRICE; last_pos++; }
-                            opt[pos].mlen = mlen;
-                            opt[pos].off = offset;
-                            opt[pos].litlen = litlen;
-                            opt[pos].price = price;
-                            memcpy(opt[pos].rep, &repHistory, sizeof(repHistory));
-                        } else {
-                            if (optLevel==0) break;  /* gets ~+10% speed for about -0.01 ratio loss */
-                        }
-            }   }   }
-        }  /* for (cur = 1; cur <= last_pos; cur++) */
-
-        best_mlen = opt[last_pos].mlen;
-        best_off = opt[last_pos].off;
-        cur = last_pos - best_mlen;
-
-_shortestPath:   /* cur, last_pos, best_mlen, best_off have to be set */
-        assert(opt[0].mlen == 1);
-
-        /* reverse traversal */
-        DEBUGLOG(7, "start reverse traversal (last_pos:%u, cur:%u)",
-                    last_pos, cur);
-        {   U32 selectedMatchLength = best_mlen;
-            U32 selectedOffset = best_off;
-            U32 pos = cur;
-            while (1) {
-                U32 const mlen = opt[pos].mlen;
-                U32 const off = opt[pos].off;
-                opt[pos].mlen = selectedMatchLength;
-                opt[pos].off = selectedOffset;
-                selectedMatchLength = mlen;
-                selectedOffset = off;
-                if (mlen > pos) break;
-                pos -= mlen;
-        }   }
-
-        /* save sequences */
-        {   U32 pos;
-            for (pos=0; pos < last_pos; ) {
-                U32 const llen = (U32)(ip - anchor);
-                U32 const mlen = opt[pos].mlen;
-                U32 const offset = opt[pos].off;
-                if (mlen == 1) { ip++; pos++; continue; }  /* literal position => move on */
-                pos += mlen; ip += mlen;
-
-                /* repcodes update : like ZSTD_updateRep(), but update in place */
-                if (offset >= ZSTD_REP_NUM) {  /* full offset */
-                    rep[2] = rep[1];
-                    rep[1] = rep[0];
-                    rep[0] = offset - ZSTD_REP_MOVE;
-                } else {   /* repcode */
-                    U32 const repCode = offset + (llen==0);
-                    if (repCode) {  /* note : if repCode==0, no change */
-                        U32 const currentOffset = (repCode==ZSTD_REP_NUM) ? (rep[0] - 1) : rep[repCode];
-                        if (repCode >= 2) rep[2] = rep[1];
-                        rep[1] = rep[0];
-                        rep[0] = currentOffset;
-                    }
-                }
-
-                ZSTD_updateStats(optStatePtr, llen, anchor, offset, mlen);
-                ZSTD_storeSeq(seqStorePtr, llen, anchor, offset, mlen-MINMATCH);
-                anchor = ip;
-        }   }
-        ZSTD_setLog2Prices(optStatePtr);
-    }   /* while (ip < ilimit) */
-
-    /* Save reps for next block */
-    { int i; for (i=0; irepToConfirm[i] = rep[i]; }
-
-    /* Return the last literals size */
-    return iend - anchor;
-}
-
-
-size_t ZSTD_compressBlock_btopt(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    DEBUGLOG(5, "ZSTD_compressBlock_btopt");
-    return ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0 /*optLevel*/, 0 /*extDict*/);
-}
-
-size_t ZSTD_compressBlock_btultra(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 2 /*optLevel*/, 0 /*extDict*/);
-}
-
-size_t ZSTD_compressBlock_btopt_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 0 /*optLevel*/, 1 /*extDict*/);
-}
-
-size_t ZSTD_compressBlock_btultra_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize)
-{
-    return ZSTD_compressBlock_opt_generic(ctx, src, srcSize, 2 /*optLevel*/, 1 /*extDict*/);
-}
diff --git a/priv/zstd/lib/compress/zstd_opt.h b/priv/zstd/lib/compress/zstd_opt.h
deleted file mode 100644
index 82e810c..0000000
--- a/priv/zstd/lib/compress/zstd_opt.h
+++ /dev/null
@@ -1,30 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_OPT_H
-#define ZSTD_OPT_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#include "zstd.h"   /* ZSTD_CCtx, size_t */
-
-size_t ZSTD_compressBlock_btopt(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_btultra(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-
-size_t ZSTD_compressBlock_btopt_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-size_t ZSTD_compressBlock_btultra_extDict(ZSTD_CCtx* ctx, const void* src, size_t srcSize);
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_OPT_H */
diff --git a/priv/zstd/lib/compress/zstdmt_compress.c b/priv/zstd/lib/compress/zstdmt_compress.c
deleted file mode 100644
index e51edf1..0000000
--- a/priv/zstd/lib/compress/zstdmt_compress.c
+++ /dev/null
@@ -1,1149 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/* ======   Tuning parameters   ====== */
-#define ZSTDMT_NBTHREADS_MAX 200
-#define ZSTDMT_OVERLAPLOG_DEFAULT 6
-
-
-/* ======   Compiler specifics   ====== */
-#if defined(_MSC_VER)
-#  pragma warning(disable : 4204)   /* disable: C4204: non-constant aggregate initializer */
-#endif
-
-
-/* ======   Dependencies   ====== */
-#include       /* memcpy, memset */
-#include "pool.h"        /* threadpool */
-#include "threading.h"   /* mutex */
-#include "zstd_compress_internal.h"  /* MIN, ERROR, ZSTD_*, ZSTD_highbit32 */
-#include "zstdmt_compress.h"
-
-
-/* ======   Debug   ====== */
-#if defined(ZSTD_DEBUG) && (ZSTD_DEBUG>=2)
-
-#  include 
-#  include 
-#  include 
-#  define DEBUGLOGRAW(l, ...) if (l<=ZSTD_DEBUG) { fprintf(stderr, __VA_ARGS__); }
-
-#  define DEBUG_PRINTHEX(l,p,n) {            \
-    unsigned debug_u;                        \
-    for (debug_u=0; debug_u<(n); debug_u++)  \
-        DEBUGLOGRAW(l, "%02X ", ((const unsigned char*)(p))[debug_u]); \
-    DEBUGLOGRAW(l, " \n");                   \
-}
-
-static unsigned long long GetCurrentClockTimeMicroseconds(void)
-{
-   static clock_t _ticksPerSecond = 0;
-   if (_ticksPerSecond <= 0) _ticksPerSecond = sysconf(_SC_CLK_TCK);
-
-   { struct tms junk; clock_t newTicks = (clock_t) times(&junk);
-     return ((((unsigned long long)newTicks)*(1000000))/_ticksPerSecond); }
-}
-
-#define MUTEX_WAIT_TIME_DLEVEL 6
-#define ZSTD_PTHREAD_MUTEX_LOCK(mutex) {          \
-    if (ZSTD_DEBUG >= MUTEX_WAIT_TIME_DLEVEL) {   \
-        unsigned long long const beforeTime = GetCurrentClockTimeMicroseconds(); \
-        ZSTD_pthread_mutex_lock(mutex);           \
-        {   unsigned long long const afterTime = GetCurrentClockTimeMicroseconds(); \
-            unsigned long long const elapsedTime = (afterTime-beforeTime); \
-            if (elapsedTime > 1000) {  /* or whatever threshold you like; I'm using 1 millisecond here */ \
-                DEBUGLOG(MUTEX_WAIT_TIME_DLEVEL, "Thread took %llu microseconds to acquire mutex %s \n", \
-                   elapsedTime, #mutex);          \
-        }   }                                     \
-    } else {                                      \
-        ZSTD_pthread_mutex_lock(mutex);           \
-    }                                             \
-}
-
-#else
-
-#  define ZSTD_PTHREAD_MUTEX_LOCK(m) ZSTD_pthread_mutex_lock(m)
-#  define DEBUG_PRINTHEX(l,p,n) {}
-
-#endif
-
-
-/* =====   Buffer Pool   ===== */
-/* a single Buffer Pool can be invoked from multiple threads in parallel */
-
-typedef struct buffer_s {
-    void* start;
-    size_t size;
-} buffer_t;
-
-static const buffer_t g_nullBuffer = { NULL, 0 };
-
-typedef struct ZSTDMT_bufferPool_s {
-    ZSTD_pthread_mutex_t poolMutex;
-    size_t bufferSize;
-    unsigned totalBuffers;
-    unsigned nbBuffers;
-    ZSTD_customMem cMem;
-    buffer_t bTable[1];   /* variable size */
-} ZSTDMT_bufferPool;
-
-static ZSTDMT_bufferPool* ZSTDMT_createBufferPool(unsigned nbThreads, ZSTD_customMem cMem)
-{
-    unsigned const maxNbBuffers = 2*nbThreads + 3;
-    ZSTDMT_bufferPool* const bufPool = (ZSTDMT_bufferPool*)ZSTD_calloc(
-        sizeof(ZSTDMT_bufferPool) + (maxNbBuffers-1) * sizeof(buffer_t), cMem);
-    if (bufPool==NULL) return NULL;
-    if (ZSTD_pthread_mutex_init(&bufPool->poolMutex, NULL)) {
-        ZSTD_free(bufPool, cMem);
-        return NULL;
-    }
-    bufPool->bufferSize = 64 KB;
-    bufPool->totalBuffers = maxNbBuffers;
-    bufPool->nbBuffers = 0;
-    bufPool->cMem = cMem;
-    return bufPool;
-}
-
-static void ZSTDMT_freeBufferPool(ZSTDMT_bufferPool* bufPool)
-{
-    unsigned u;
-    DEBUGLOG(3, "ZSTDMT_freeBufferPool (address:%08X)", (U32)(size_t)bufPool);
-    if (!bufPool) return;   /* compatibility with free on NULL */
-    for (u=0; utotalBuffers; u++) {
-        DEBUGLOG(4, "free buffer %2u (address:%08X)", u, (U32)(size_t)bufPool->bTable[u].start);
-        ZSTD_free(bufPool->bTable[u].start, bufPool->cMem);
-    }
-    ZSTD_pthread_mutex_destroy(&bufPool->poolMutex);
-    ZSTD_free(bufPool, bufPool->cMem);
-}
-
-/* only works at initialization, not during compression */
-static size_t ZSTDMT_sizeof_bufferPool(ZSTDMT_bufferPool* bufPool)
-{
-    size_t const poolSize = sizeof(*bufPool)
-                            + (bufPool->totalBuffers - 1) * sizeof(buffer_t);
-    unsigned u;
-    size_t totalBufferSize = 0;
-    ZSTD_pthread_mutex_lock(&bufPool->poolMutex);
-    for (u=0; utotalBuffers; u++)
-        totalBufferSize += bufPool->bTable[u].size;
-    ZSTD_pthread_mutex_unlock(&bufPool->poolMutex);
-
-    return poolSize + totalBufferSize;
-}
-
-static void ZSTDMT_setBufferSize(ZSTDMT_bufferPool* const bufPool, size_t const bSize)
-{
-    ZSTD_pthread_mutex_lock(&bufPool->poolMutex);
-    DEBUGLOG(4, "ZSTDMT_setBufferSize: bSize = %u", (U32)bSize);
-    bufPool->bufferSize = bSize;
-    ZSTD_pthread_mutex_unlock(&bufPool->poolMutex);
-}
-
-/** ZSTDMT_getBuffer() :
- *  assumption : bufPool must be valid */
-static buffer_t ZSTDMT_getBuffer(ZSTDMT_bufferPool* bufPool)
-{
-    size_t const bSize = bufPool->bufferSize;
-    DEBUGLOG(5, "ZSTDMT_getBuffer: bSize = %u", (U32)bufPool->bufferSize);
-    ZSTD_pthread_mutex_lock(&bufPool->poolMutex);
-    if (bufPool->nbBuffers) {   /* try to use an existing buffer */
-        buffer_t const buf = bufPool->bTable[--(bufPool->nbBuffers)];
-        size_t const availBufferSize = buf.size;
-        bufPool->bTable[bufPool->nbBuffers] = g_nullBuffer;
-        if ((availBufferSize >= bSize) & ((availBufferSize>>3) <= bSize)) {
-            /* large enough, but not too much */
-            DEBUGLOG(5, "ZSTDMT_getBuffer: provide buffer %u of size %u",
-                        bufPool->nbBuffers, (U32)buf.size);
-            ZSTD_pthread_mutex_unlock(&bufPool->poolMutex);
-            return buf;
-        }
-        /* size conditions not respected : scratch this buffer, create new one */
-        DEBUGLOG(5, "ZSTDMT_getBuffer: existing buffer does not meet size conditions => freeing");
-        ZSTD_free(buf.start, bufPool->cMem);
-    }
-    ZSTD_pthread_mutex_unlock(&bufPool->poolMutex);
-    /* create new buffer */
-    DEBUGLOG(5, "ZSTDMT_getBuffer: create a new buffer");
-    {   buffer_t buffer;
-        void* const start = ZSTD_malloc(bSize, bufPool->cMem);
-        buffer.start = start;   /* note : start can be NULL if malloc fails ! */
-        buffer.size = (start==NULL) ? 0 : bSize;
-        DEBUGLOG(5, "ZSTDMT_getBuffer: created buffer of size %u", (U32)bSize);
-        return buffer;
-    }
-}
-
-/* store buffer for later re-use, up to pool capacity */
-static void ZSTDMT_releaseBuffer(ZSTDMT_bufferPool* bufPool, buffer_t buf)
-{
-    if (buf.start == NULL) return;   /* compatible with release on NULL */
-    DEBUGLOG(5, "ZSTDMT_releaseBuffer");
-    ZSTD_pthread_mutex_lock(&bufPool->poolMutex);
-    if (bufPool->nbBuffers < bufPool->totalBuffers) {
-        bufPool->bTable[bufPool->nbBuffers++] = buf;  /* stored for later use */
-        DEBUGLOG(5, "ZSTDMT_releaseBuffer: stored buffer of size %u in slot %u",
-                    (U32)buf.size, (U32)(bufPool->nbBuffers-1));
-        ZSTD_pthread_mutex_unlock(&bufPool->poolMutex);
-        return;
-    }
-    ZSTD_pthread_mutex_unlock(&bufPool->poolMutex);
-    /* Reached bufferPool capacity (should not happen) */
-    DEBUGLOG(5, "ZSTDMT_releaseBuffer: pool capacity reached => freeing ");
-    ZSTD_free(buf.start, bufPool->cMem);
-}
-
-/* Sets parameters relevant to the compression job, initializing others to
- * default values. Notably, nbThreads should probably be zero. */
-static ZSTD_CCtx_params ZSTDMT_makeJobCCtxParams(ZSTD_CCtx_params const params)
-{
-    ZSTD_CCtx_params jobParams;
-    memset(&jobParams, 0, sizeof(jobParams));
-
-    jobParams.cParams = params.cParams;
-    jobParams.fParams = params.fParams;
-    jobParams.compressionLevel = params.compressionLevel;
-
-    jobParams.ldmParams = params.ldmParams;
-    return jobParams;
-}
-
-/* =====   CCtx Pool   ===== */
-/* a single CCtx Pool can be invoked from multiple threads in parallel */
-
-typedef struct {
-    ZSTD_pthread_mutex_t poolMutex;
-    unsigned totalCCtx;
-    unsigned availCCtx;
-    ZSTD_customMem cMem;
-    ZSTD_CCtx* cctx[1];   /* variable size */
-} ZSTDMT_CCtxPool;
-
-/* note : all CCtx borrowed from the pool should be released back to the pool _before_ freeing the pool */
-static void ZSTDMT_freeCCtxPool(ZSTDMT_CCtxPool* pool)
-{
-    unsigned u;
-    for (u=0; utotalCCtx; u++)
-        ZSTD_freeCCtx(pool->cctx[u]);  /* note : compatible with free on NULL */
-    ZSTD_pthread_mutex_destroy(&pool->poolMutex);
-    ZSTD_free(pool, pool->cMem);
-}
-
-/* ZSTDMT_createCCtxPool() :
- * implies nbThreads >= 1 , checked by caller ZSTDMT_createCCtx() */
-static ZSTDMT_CCtxPool* ZSTDMT_createCCtxPool(unsigned nbThreads,
-                                              ZSTD_customMem cMem)
-{
-    ZSTDMT_CCtxPool* const cctxPool = (ZSTDMT_CCtxPool*) ZSTD_calloc(
-        sizeof(ZSTDMT_CCtxPool) + (nbThreads-1)*sizeof(ZSTD_CCtx*), cMem);
-    if (!cctxPool) return NULL;
-    if (ZSTD_pthread_mutex_init(&cctxPool->poolMutex, NULL)) {
-        ZSTD_free(cctxPool, cMem);
-        return NULL;
-    }
-    cctxPool->cMem = cMem;
-    cctxPool->totalCCtx = nbThreads;
-    cctxPool->availCCtx = 1;   /* at least one cctx for single-thread mode */
-    cctxPool->cctx[0] = ZSTD_createCCtx_advanced(cMem);
-    if (!cctxPool->cctx[0]) { ZSTDMT_freeCCtxPool(cctxPool); return NULL; }
-    DEBUGLOG(3, "cctxPool created, with %u threads", nbThreads);
-    return cctxPool;
-}
-
-/* only works during initialization phase, not during compression */
-static size_t ZSTDMT_sizeof_CCtxPool(ZSTDMT_CCtxPool* cctxPool)
-{
-    ZSTD_pthread_mutex_lock(&cctxPool->poolMutex);
-    {   unsigned const nbThreads = cctxPool->totalCCtx;
-        size_t const poolSize = sizeof(*cctxPool)
-                                + (nbThreads-1)*sizeof(ZSTD_CCtx*);
-        unsigned u;
-        size_t totalCCtxSize = 0;
-        for (u=0; ucctx[u]);
-        }
-        ZSTD_pthread_mutex_unlock(&cctxPool->poolMutex);
-        return poolSize + totalCCtxSize;
-    }
-}
-
-static ZSTD_CCtx* ZSTDMT_getCCtx(ZSTDMT_CCtxPool* cctxPool)
-{
-    DEBUGLOG(5, "ZSTDMT_getCCtx");
-    ZSTD_pthread_mutex_lock(&cctxPool->poolMutex);
-    if (cctxPool->availCCtx) {
-        cctxPool->availCCtx--;
-        {   ZSTD_CCtx* const cctx = cctxPool->cctx[cctxPool->availCCtx];
-            ZSTD_pthread_mutex_unlock(&cctxPool->poolMutex);
-            return cctx;
-    }   }
-    ZSTD_pthread_mutex_unlock(&cctxPool->poolMutex);
-    DEBUGLOG(5, "create one more CCtx");
-    return ZSTD_createCCtx_advanced(cctxPool->cMem);   /* note : can be NULL, when creation fails ! */
-}
-
-static void ZSTDMT_releaseCCtx(ZSTDMT_CCtxPool* pool, ZSTD_CCtx* cctx)
-{
-    if (cctx==NULL) return;   /* compatibility with release on NULL */
-    ZSTD_pthread_mutex_lock(&pool->poolMutex);
-    if (pool->availCCtx < pool->totalCCtx)
-        pool->cctx[pool->availCCtx++] = cctx;
-    else {
-        /* pool overflow : should not happen, since totalCCtx==nbThreads */
-        DEBUGLOG(5, "CCtx pool overflow : free cctx");
-        ZSTD_freeCCtx(cctx);
-    }
-    ZSTD_pthread_mutex_unlock(&pool->poolMutex);
-}
-
-
-/* =====   Thread worker   ===== */
-
-typedef struct {
-    buffer_t src;
-    const void* srcStart;
-    size_t   prefixSize;
-    size_t   srcSize;
-    buffer_t dstBuff;
-    size_t   cSize;
-    size_t   dstFlushed;
-    unsigned firstChunk;
-    unsigned lastChunk;
-    unsigned jobCompleted;
-    unsigned jobScanned;
-    ZSTD_pthread_mutex_t* jobCompleted_mutex;
-    ZSTD_pthread_cond_t* jobCompleted_cond;
-    ZSTD_CCtx_params params;
-    const ZSTD_CDict* cdict;
-    ZSTDMT_CCtxPool* cctxPool;
-    ZSTDMT_bufferPool* bufPool;
-    unsigned long long fullFrameSize;
-} ZSTDMT_jobDescription;
-
-/* ZSTDMT_compressChunk() : POOL_function type */
-void ZSTDMT_compressChunk(void* jobDescription)
-{
-    ZSTDMT_jobDescription* const job = (ZSTDMT_jobDescription*)jobDescription;
-    ZSTD_CCtx* const cctx = ZSTDMT_getCCtx(job->cctxPool);
-    const void* const src = (const char*)job->srcStart + job->prefixSize;
-    buffer_t dstBuff = job->dstBuff;
-    DEBUGLOG(5, "ZSTDMT_compressChunk: job (first:%u) (last:%u) : prefixSize %u, srcSize %u ",
-                 job->firstChunk, job->lastChunk, (U32)job->prefixSize, (U32)job->srcSize);
-
-    if (cctx==NULL) {
-        job->cSize = ERROR(memory_allocation);
-        goto _endJob;
-    }
-
-    if (dstBuff.start == NULL) {
-        dstBuff = ZSTDMT_getBuffer(job->bufPool);
-        if (dstBuff.start==NULL) {
-            job->cSize = ERROR(memory_allocation);
-            goto _endJob;
-        }
-        job->dstBuff = dstBuff;
-        DEBUGLOG(5, "ZSTDMT_compressChunk: received dstBuff of size %u", (U32)dstBuff.size);
-    }
-
-    if (job->cdict) {
-        size_t const initError = ZSTD_compressBegin_advanced_internal(cctx, NULL, 0, ZSTD_dm_auto, job->cdict, job->params, job->fullFrameSize);
-        DEBUGLOG(4, "ZSTDMT_compressChunk: init using CDict (windowLog=%u)", job->params.cParams.windowLog);
-        assert(job->firstChunk);  /* only allowed for first job */
-        if (ZSTD_isError(initError)) { job->cSize = initError; goto _endJob; }
-    } else {  /* srcStart points at reloaded section */
-        U64 const pledgedSrcSize = job->firstChunk ? job->fullFrameSize : ZSTD_CONTENTSIZE_UNKNOWN;
-        ZSTD_CCtx_params jobParams = job->params;   /* do not modify job->params ! copy it, modify the copy */
-        size_t const forceWindowError = ZSTD_CCtxParam_setParameter(&jobParams, ZSTD_p_forceMaxWindow, !job->firstChunk);
-        if (ZSTD_isError(forceWindowError)) {
-            DEBUGLOG(5, "ZSTD_CCtxParam_setParameter error : %s ", ZSTD_getErrorName(forceWindowError));
-            job->cSize = forceWindowError;
-            goto _endJob;
-        }
-        DEBUGLOG(5, "ZSTDMT_compressChunk: invoking ZSTD_compressBegin_advanced_internal with windowLog = %u ", jobParams.cParams.windowLog);
-        {   size_t const initError = ZSTD_compressBegin_advanced_internal(cctx,
-                                        job->srcStart, job->prefixSize, ZSTD_dm_rawContent, /* load dictionary in "content-only" mode (no header analysis) */
-                                        NULL,
-                                        jobParams, pledgedSrcSize);
-            if (ZSTD_isError(initError)) {
-                DEBUGLOG(5, "ZSTD_compressBegin_advanced_internal error : %s ", ZSTD_getErrorName(initError));
-                job->cSize = initError;
-                goto _endJob;
-        }   }
-    }
-    if (!job->firstChunk) {  /* flush and overwrite frame header when it's not first job */
-        size_t const hSize = ZSTD_compressContinue(cctx, dstBuff.start, dstBuff.size, src, 0);
-        if (ZSTD_isError(hSize)) { job->cSize = hSize; /* save error code */ goto _endJob; }
-        ZSTD_invalidateRepCodes(cctx);
-    }
-
-    DEBUGLOG(5, "Compressing into dstBuff of size %u", (U32)dstBuff.size);
-    DEBUG_PRINTHEX(6, job->srcStart, 12);
-    job->cSize = (job->lastChunk) ?
-                 ZSTD_compressEnd     (cctx, dstBuff.start, dstBuff.size, src, job->srcSize) :
-                 ZSTD_compressContinue(cctx, dstBuff.start, dstBuff.size, src, job->srcSize);
-    DEBUGLOG(5, "compressed %u bytes into %u bytes   (first:%u) (last:%u) ",
-                (unsigned)job->srcSize, (unsigned)job->cSize, job->firstChunk, job->lastChunk);
-    DEBUGLOG(5, "dstBuff.size : %u ; => %s ", (U32)dstBuff.size, ZSTD_getErrorName(job->cSize));
-
-_endJob:
-    ZSTDMT_releaseCCtx(job->cctxPool, cctx);
-    ZSTDMT_releaseBuffer(job->bufPool, job->src);
-    job->src = g_nullBuffer; job->srcStart = NULL;
-    ZSTD_PTHREAD_MUTEX_LOCK(job->jobCompleted_mutex);
-    job->jobCompleted = 1;
-    job->jobScanned = 0;
-    ZSTD_pthread_cond_signal(job->jobCompleted_cond);
-    ZSTD_pthread_mutex_unlock(job->jobCompleted_mutex);
-}
-
-
-/* ------------------------------------------ */
-/* =====   Multi-threaded compression   ===== */
-/* ------------------------------------------ */
-
-typedef struct {
-    buffer_t buffer;
-    size_t filled;
-} inBuff_t;
-
-struct ZSTDMT_CCtx_s {
-    POOL_ctx* factory;
-    ZSTDMT_jobDescription* jobs;
-    ZSTDMT_bufferPool* bufPool;
-    ZSTDMT_CCtxPool* cctxPool;
-    ZSTD_pthread_mutex_t jobCompleted_mutex;
-    ZSTD_pthread_cond_t jobCompleted_cond;
-    ZSTD_CCtx_params params;
-    size_t targetSectionSize;
-    size_t inBuffSize;
-    size_t dictSize;
-    size_t targetDictSize;
-    inBuff_t inBuff;
-    XXH64_state_t xxhState;
-    unsigned singleThreaded;
-    unsigned jobIDMask;
-    unsigned doneJobID;
-    unsigned nextJobID;
-    unsigned frameEnded;
-    unsigned allJobsCompleted;
-    unsigned long long frameContentSize;
-    ZSTD_customMem cMem;
-    ZSTD_CDict* cdictLocal;
-    const ZSTD_CDict* cdict;
-};
-
-static ZSTDMT_jobDescription* ZSTDMT_allocJobsTable(U32* nbJobsPtr, ZSTD_customMem cMem)
-{
-    U32 const nbJobsLog2 = ZSTD_highbit32(*nbJobsPtr) + 1;
-    U32 const nbJobs = 1 << nbJobsLog2;
-    *nbJobsPtr = nbJobs;
-    return (ZSTDMT_jobDescription*) ZSTD_calloc(
-                            nbJobs * sizeof(ZSTDMT_jobDescription), cMem);
-}
-
-/* ZSTDMT_CCtxParam_setNbThreads():
- * Internal use only */
-size_t ZSTDMT_CCtxParam_setNbThreads(ZSTD_CCtx_params* params, unsigned nbThreads)
-{
-    if (nbThreads > ZSTDMT_NBTHREADS_MAX) nbThreads = ZSTDMT_NBTHREADS_MAX;
-    if (nbThreads < 1) nbThreads = 1;
-    params->nbThreads = nbThreads;
-    params->overlapSizeLog = ZSTDMT_OVERLAPLOG_DEFAULT;
-    params->jobSize = 0;
-    return nbThreads;
-}
-
-/* ZSTDMT_getNbThreads():
- * @return nb threads currently active in mtctx.
- * mtctx must be valid */
-size_t ZSTDMT_getNbThreads(const ZSTDMT_CCtx* mtctx)
-{
-    assert(mtctx != NULL);
-    return mtctx->params.nbThreads;
-}
-
-ZSTDMT_CCtx* ZSTDMT_createCCtx_advanced(unsigned nbThreads, ZSTD_customMem cMem)
-{
-    ZSTDMT_CCtx* mtctx;
-    U32 nbJobs = nbThreads + 2;
-    DEBUGLOG(3, "ZSTDMT_createCCtx_advanced (nbThreads = %u)", nbThreads);
-
-    if (nbThreads < 1) return NULL;
-    nbThreads = MIN(nbThreads , ZSTDMT_NBTHREADS_MAX);
-    if ((cMem.customAlloc!=NULL) ^ (cMem.customFree!=NULL))
-        /* invalid custom allocator */
-        return NULL;
-
-    mtctx = (ZSTDMT_CCtx*) ZSTD_calloc(sizeof(ZSTDMT_CCtx), cMem);
-    if (!mtctx) return NULL;
-    ZSTDMT_CCtxParam_setNbThreads(&mtctx->params, nbThreads);
-    mtctx->cMem = cMem;
-    mtctx->allJobsCompleted = 1;
-    mtctx->factory = POOL_create_advanced(nbThreads, 0, cMem);
-    mtctx->jobs = ZSTDMT_allocJobsTable(&nbJobs, cMem);
-    mtctx->jobIDMask = nbJobs - 1;
-    mtctx->bufPool = ZSTDMT_createBufferPool(nbThreads, cMem);
-    mtctx->cctxPool = ZSTDMT_createCCtxPool(nbThreads, cMem);
-    if (!mtctx->factory | !mtctx->jobs | !mtctx->bufPool | !mtctx->cctxPool) {
-        ZSTDMT_freeCCtx(mtctx);
-        return NULL;
-    }
-    if (ZSTD_pthread_mutex_init(&mtctx->jobCompleted_mutex, NULL)) {
-        ZSTDMT_freeCCtx(mtctx);
-        return NULL;
-    }
-    if (ZSTD_pthread_cond_init(&mtctx->jobCompleted_cond, NULL)) {
-        ZSTDMT_freeCCtx(mtctx);
-        return NULL;
-    }
-    DEBUGLOG(3, "mt_cctx created, for %u threads", nbThreads);
-    return mtctx;
-}
-
-ZSTDMT_CCtx* ZSTDMT_createCCtx(unsigned nbThreads)
-{
-    return ZSTDMT_createCCtx_advanced(nbThreads, ZSTD_defaultCMem);
-}
-
-/* ZSTDMT_releaseAllJobResources() :
- * note : ensure all workers are killed first ! */
-static void ZSTDMT_releaseAllJobResources(ZSTDMT_CCtx* mtctx)
-{
-    unsigned jobID;
-    DEBUGLOG(3, "ZSTDMT_releaseAllJobResources");
-    for (jobID=0; jobID <= mtctx->jobIDMask; jobID++) {
-        DEBUGLOG(4, "job%02u: release dst address %08X", jobID, (U32)(size_t)mtctx->jobs[jobID].dstBuff.start);
-        ZSTDMT_releaseBuffer(mtctx->bufPool, mtctx->jobs[jobID].dstBuff);
-        mtctx->jobs[jobID].dstBuff = g_nullBuffer;
-        DEBUGLOG(4, "job%02u: release src address %08X", jobID, (U32)(size_t)mtctx->jobs[jobID].src.start);
-        ZSTDMT_releaseBuffer(mtctx->bufPool, mtctx->jobs[jobID].src);
-        mtctx->jobs[jobID].src = g_nullBuffer;
-    }
-    memset(mtctx->jobs, 0, (mtctx->jobIDMask+1)*sizeof(ZSTDMT_jobDescription));
-    DEBUGLOG(4, "input: release address %08X", (U32)(size_t)mtctx->inBuff.buffer.start);
-    ZSTDMT_releaseBuffer(mtctx->bufPool, mtctx->inBuff.buffer);
-    mtctx->inBuff.buffer = g_nullBuffer;
-    mtctx->allJobsCompleted = 1;
-}
-
-static void ZSTDMT_waitForAllJobsCompleted(ZSTDMT_CCtx* zcs)
-{
-    DEBUGLOG(4, "ZSTDMT_waitForAllJobsCompleted");
-    while (zcs->doneJobID < zcs->nextJobID) {
-        unsigned const jobID = zcs->doneJobID & zcs->jobIDMask;
-        ZSTD_PTHREAD_MUTEX_LOCK(&zcs->jobCompleted_mutex);
-        while (zcs->jobs[jobID].jobCompleted==0) {
-            DEBUGLOG(5, "waiting for jobCompleted signal from chunk %u", zcs->doneJobID);   /* we want to block when waiting for data to flush */
-            ZSTD_pthread_cond_wait(&zcs->jobCompleted_cond, &zcs->jobCompleted_mutex);
-        }
-        ZSTD_pthread_mutex_unlock(&zcs->jobCompleted_mutex);
-        zcs->doneJobID++;
-    }
-}
-
-size_t ZSTDMT_freeCCtx(ZSTDMT_CCtx* mtctx)
-{
-    if (mtctx==NULL) return 0;   /* compatible with free on NULL */
-    POOL_free(mtctx->factory);   /* stop and free worker threads */
-    ZSTDMT_releaseAllJobResources(mtctx);  /* release job resources into pools first */
-    ZSTD_free(mtctx->jobs, mtctx->cMem);
-    ZSTDMT_freeBufferPool(mtctx->bufPool);
-    ZSTDMT_freeCCtxPool(mtctx->cctxPool);
-    ZSTD_freeCDict(mtctx->cdictLocal);
-    ZSTD_pthread_mutex_destroy(&mtctx->jobCompleted_mutex);
-    ZSTD_pthread_cond_destroy(&mtctx->jobCompleted_cond);
-    ZSTD_free(mtctx, mtctx->cMem);
-    return 0;
-}
-
-size_t ZSTDMT_sizeof_CCtx(ZSTDMT_CCtx* mtctx)
-{
-    if (mtctx == NULL) return 0;   /* supports sizeof NULL */
-    return sizeof(*mtctx)
-            + POOL_sizeof(mtctx->factory)
-            + ZSTDMT_sizeof_bufferPool(mtctx->bufPool)
-            + (mtctx->jobIDMask+1) * sizeof(ZSTDMT_jobDescription)
-            + ZSTDMT_sizeof_CCtxPool(mtctx->cctxPool)
-            + ZSTD_sizeof_CDict(mtctx->cdictLocal);
-}
-
-/* Internal only */
-size_t ZSTDMT_CCtxParam_setMTCtxParameter(ZSTD_CCtx_params* params,
-                                ZSTDMT_parameter parameter, unsigned value) {
-    DEBUGLOG(4, "ZSTDMT_CCtxParam_setMTCtxParameter");
-    switch(parameter)
-    {
-    case ZSTDMT_p_jobSize :
-        DEBUGLOG(4, "ZSTDMT_CCtxParam_setMTCtxParameter : set jobSize to %u", value);
-        if ( (value > 0)  /* value==0 => automatic job size */
-           & (value < ZSTDMT_JOBSIZE_MIN) )
-            value = ZSTDMT_JOBSIZE_MIN;
-        params->jobSize = value;
-        return value;
-    case ZSTDMT_p_overlapSectionLog :
-        if (value > 9) value = 9;
-        DEBUGLOG(4, "ZSTDMT_p_overlapSectionLog : %u", value);
-        params->overlapSizeLog = (value >= 9) ? 9 : value;
-        return value;
-    default :
-        return ERROR(parameter_unsupported);
-    }
-}
-
-size_t ZSTDMT_setMTCtxParameter(ZSTDMT_CCtx* mtctx, ZSTDMT_parameter parameter, unsigned value)
-{
-    DEBUGLOG(4, "ZSTDMT_setMTCtxParameter");
-    switch(parameter)
-    {
-    case ZSTDMT_p_jobSize :
-        return ZSTDMT_CCtxParam_setMTCtxParameter(&mtctx->params, parameter, value);
-    case ZSTDMT_p_overlapSectionLog :
-        return ZSTDMT_CCtxParam_setMTCtxParameter(&mtctx->params, parameter, value);
-    default :
-        return ERROR(parameter_unsupported);
-    }
-}
-
-/* ------------------------------------------ */
-/* =====   Multi-threaded compression   ===== */
-/* ------------------------------------------ */
-
-static unsigned computeNbChunks(size_t srcSize, unsigned windowLog, unsigned nbThreads) {
-    size_t const chunkSizeTarget = (size_t)1 << (windowLog + 2);
-    size_t const chunkMaxSize = chunkSizeTarget << 2;
-    size_t const passSizeMax = chunkMaxSize * nbThreads;
-    unsigned const multiplier = (unsigned)(srcSize / passSizeMax) + 1;
-    unsigned const nbChunksLarge = multiplier * nbThreads;
-    unsigned const nbChunksMax = (unsigned)(srcSize / chunkSizeTarget) + 1;
-    unsigned const nbChunksSmall = MIN(nbChunksMax, nbThreads);
-    return (multiplier>1) ? nbChunksLarge : nbChunksSmall;
-}
-
-static size_t ZSTDMT_compress_advanced_internal(
-                ZSTDMT_CCtx* mtctx,
-                void* dst, size_t dstCapacity,
-          const void* src, size_t srcSize,
-          const ZSTD_CDict* cdict,
-                ZSTD_CCtx_params const params)
-{
-    ZSTD_CCtx_params const jobParams = ZSTDMT_makeJobCCtxParams(params);
-    unsigned const overlapRLog = (params.overlapSizeLog>9) ? 0 : 9-params.overlapSizeLog;
-    size_t const overlapSize = (overlapRLog>=9) ? 0 : (size_t)1 << (params.cParams.windowLog - overlapRLog);
-    unsigned nbChunks = computeNbChunks(srcSize, params.cParams.windowLog, params.nbThreads);
-    size_t const proposedChunkSize = (srcSize + (nbChunks-1)) / nbChunks;
-    size_t const avgChunkSize = (((proposedChunkSize-1) & 0x1FFFF) < 0x7FFF) ? proposedChunkSize + 0xFFFF : proposedChunkSize;   /* avoid too small last block */
-    const char* const srcStart = (const char*)src;
-    size_t remainingSrcSize = srcSize;
-    unsigned const compressWithinDst = (dstCapacity >= ZSTD_compressBound(srcSize)) ? nbChunks : (unsigned)(dstCapacity / ZSTD_compressBound(avgChunkSize));  /* presumes avgChunkSize >= 256 KB, which should be the case */
-    size_t frameStartPos = 0, dstBufferPos = 0;
-    XXH64_state_t xxh64;
-    assert(jobParams.nbThreads == 0);
-    assert(mtctx->cctxPool->totalCCtx == params.nbThreads);
-
-    DEBUGLOG(4, "ZSTDMT_compress_advanced_internal: nbChunks=%2u (rawSize=%u bytes; fixedSize=%u)  ",
-                nbChunks, (U32)proposedChunkSize, (U32)avgChunkSize);
-    if (nbChunks==1) {   /* fallback to single-thread mode */
-        ZSTD_CCtx* const cctx = mtctx->cctxPool->cctx[0];
-        if (cdict) return ZSTD_compress_usingCDict_advanced(cctx, dst, dstCapacity, src, srcSize, cdict, jobParams.fParams);
-        return ZSTD_compress_advanced_internal(cctx, dst, dstCapacity, src, srcSize, NULL, 0, jobParams);
-    }
-    assert(avgChunkSize >= 256 KB);  /* condition for ZSTD_compressBound(A) + ZSTD_compressBound(B) <= ZSTD_compressBound(A+B), which is required for compressWithinDst */
-    ZSTDMT_setBufferSize(mtctx->bufPool, ZSTD_compressBound(avgChunkSize) );
-    XXH64_reset(&xxh64, 0);
-
-    if (nbChunks > mtctx->jobIDMask+1) {  /* enlarge job table */
-        U32 nbJobs = nbChunks;
-        ZSTD_free(mtctx->jobs, mtctx->cMem);
-        mtctx->jobIDMask = 0;
-        mtctx->jobs = ZSTDMT_allocJobsTable(&nbJobs, mtctx->cMem);
-        if (mtctx->jobs==NULL) return ERROR(memory_allocation);
-        mtctx->jobIDMask = nbJobs - 1;
-    }
-
-    {   unsigned u;
-        for (u=0; ujobs[u].src = g_nullBuffer;
-            mtctx->jobs[u].srcStart = srcStart + frameStartPos - dictSize;
-            mtctx->jobs[u].prefixSize = dictSize;
-            mtctx->jobs[u].srcSize = chunkSize;
-            mtctx->jobs[u].cdict = (u==0) ? cdict : NULL;
-            mtctx->jobs[u].fullFrameSize = srcSize;
-            mtctx->jobs[u].params = jobParams;
-            /* do not calculate checksum within sections, but write it in header for first section */
-            if (u!=0) mtctx->jobs[u].params.fParams.checksumFlag = 0;
-            mtctx->jobs[u].dstBuff = dstBuffer;
-            mtctx->jobs[u].cctxPool = mtctx->cctxPool;
-            mtctx->jobs[u].bufPool = mtctx->bufPool;
-            mtctx->jobs[u].firstChunk = (u==0);
-            mtctx->jobs[u].lastChunk = (u==nbChunks-1);
-            mtctx->jobs[u].jobCompleted = 0;
-            mtctx->jobs[u].jobCompleted_mutex = &mtctx->jobCompleted_mutex;
-            mtctx->jobs[u].jobCompleted_cond = &mtctx->jobCompleted_cond;
-
-            if (params.fParams.checksumFlag) {
-                XXH64_update(&xxh64, srcStart + frameStartPos, chunkSize);
-            }
-
-            DEBUGLOG(5, "ZSTDMT_compress_advanced_internal: posting job %u  (%u bytes)", u, (U32)chunkSize);
-            DEBUG_PRINTHEX(6, mtctx->jobs[u].srcStart, 12);
-            POOL_add(mtctx->factory, ZSTDMT_compressChunk, &mtctx->jobs[u]);
-
-            frameStartPos += chunkSize;
-            dstBufferPos += dstBufferCapacity;
-            remainingSrcSize -= chunkSize;
-    }   }
-
-    /* collect result */
-    {   size_t error = 0, dstPos = 0;
-        unsigned chunkID;
-        for (chunkID=0; chunkIDjobCompleted_mutex);
-            while (mtctx->jobs[chunkID].jobCompleted==0) {
-                DEBUGLOG(5, "waiting for jobCompleted signal from chunk %u", chunkID);
-                ZSTD_pthread_cond_wait(&mtctx->jobCompleted_cond, &mtctx->jobCompleted_mutex);
-            }
-            ZSTD_pthread_mutex_unlock(&mtctx->jobCompleted_mutex);
-            DEBUGLOG(5, "ready to write chunk %u ", chunkID);
-
-            mtctx->jobs[chunkID].srcStart = NULL;
-            {   size_t const cSize = mtctx->jobs[chunkID].cSize;
-                if (ZSTD_isError(cSize)) error = cSize;
-                if ((!error) && (dstPos + cSize > dstCapacity)) error = ERROR(dstSize_tooSmall);
-                if (chunkID) {   /* note : chunk 0 is written directly at dst, which is correct position */
-                    if (!error)
-                        memmove((char*)dst + dstPos, mtctx->jobs[chunkID].dstBuff.start, cSize);  /* may overlap when chunk compressed within dst */
-                    if (chunkID >= compressWithinDst) {  /* chunk compressed into its own buffer, which must be released */
-                        DEBUGLOG(5, "releasing buffer %u>=%u", chunkID, compressWithinDst);
-                        ZSTDMT_releaseBuffer(mtctx->bufPool, mtctx->jobs[chunkID].dstBuff);
-                }   }
-                mtctx->jobs[chunkID].dstBuff = g_nullBuffer;
-                dstPos += cSize ;
-            }
-        }  /* for (chunkID=0; chunkID dstCapacity) {
-                error = ERROR(dstSize_tooSmall);
-            } else {
-                DEBUGLOG(4, "writing checksum : %08X \n", checksum);
-                MEM_writeLE32((char*)dst + dstPos, checksum);
-                dstPos += 4;
-        }   }
-
-        if (!error) DEBUGLOG(4, "compressed size : %u  ", (U32)dstPos);
-        return error ? error : dstPos;
-    }
-}
-
-size_t ZSTDMT_compress_advanced(ZSTDMT_CCtx* mtctx,
-                               void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                         const ZSTD_CDict* cdict,
-                               ZSTD_parameters const params,
-                               unsigned overlapLog)
-{
-    ZSTD_CCtx_params cctxParams = mtctx->params;
-    cctxParams.cParams = params.cParams;
-    cctxParams.fParams = params.fParams;
-    cctxParams.overlapSizeLog = overlapLog;
-    return ZSTDMT_compress_advanced_internal(mtctx,
-                                             dst, dstCapacity,
-                                             src, srcSize,
-                                             cdict, cctxParams);
-}
-
-
-size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
-                           void* dst, size_t dstCapacity,
-                     const void* src, size_t srcSize,
-                           int compressionLevel)
-{
-    U32 const overlapLog = (compressionLevel >= ZSTD_maxCLevel()) ? 9 : ZSTDMT_OVERLAPLOG_DEFAULT;
-    ZSTD_parameters params = ZSTD_getParams(compressionLevel, srcSize, 0);
-    params.fParams.contentSizeFlag = 1;
-    return ZSTDMT_compress_advanced(mtctx, dst, dstCapacity, src, srcSize, NULL, params, overlapLog);
-}
-
-
-/* ====================================== */
-/* =======      Streaming API     ======= */
-/* ====================================== */
-
-size_t ZSTDMT_initCStream_internal(
-        ZSTDMT_CCtx* zcs,
-        const void* dict, size_t dictSize, ZSTD_dictMode_e dictMode,
-        const ZSTD_CDict* cdict, ZSTD_CCtx_params params,
-        unsigned long long pledgedSrcSize)
-{
-    DEBUGLOG(4, "ZSTDMT_initCStream_internal (pledgedSrcSize=%u)", (U32)pledgedSrcSize);
-    /* params are supposed to be fully validated at this point */
-    assert(!ZSTD_isError(ZSTD_checkCParams(params.cParams)));
-    assert(!((dict) && (cdict)));  /* either dict or cdict, not both */
-    assert(zcs->cctxPool->totalCCtx == params.nbThreads);
-    zcs->singleThreaded = (params.nbThreads==1) | (pledgedSrcSize <= ZSTDMT_JOBSIZE_MIN);  /* do not trigger multi-threading when srcSize is too small */
-
-    if (zcs->singleThreaded) {
-        ZSTD_CCtx_params const singleThreadParams = ZSTDMT_makeJobCCtxParams(params);
-        DEBUGLOG(4, "single thread mode");
-        assert(singleThreadParams.nbThreads == 0);
-        return ZSTD_initCStream_internal(zcs->cctxPool->cctx[0],
-                                         dict, dictSize, cdict,
-                                         singleThreadParams, pledgedSrcSize);
-    }
-    DEBUGLOG(4, "multi-threading mode (%u threads)", params.nbThreads);
-
-    if (zcs->allJobsCompleted == 0) {   /* previous compression not correctly finished */
-        ZSTDMT_waitForAllJobsCompleted(zcs);
-        ZSTDMT_releaseAllJobResources(zcs);
-        zcs->allJobsCompleted = 1;
-    }
-
-    zcs->params = params;
-    zcs->frameContentSize = pledgedSrcSize;
-    if (dict) {
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = ZSTD_createCDict_advanced(dict, dictSize,
-                                                    ZSTD_dlm_byCopy, dictMode, /* note : a loadPrefix becomes an internal CDict */
-                                                    params.cParams, zcs->cMem);
-        zcs->cdict = zcs->cdictLocal;
-        if (zcs->cdictLocal == NULL) return ERROR(memory_allocation);
-    } else {
-        ZSTD_freeCDict(zcs->cdictLocal);
-        zcs->cdictLocal = NULL;
-        zcs->cdict = cdict;
-    }
-
-    assert(params.overlapSizeLog <= 9);
-    zcs->targetDictSize = (params.overlapSizeLog==0) ? 0 : (size_t)1 << (params.cParams.windowLog - (9 - params.overlapSizeLog));
-    DEBUGLOG(4, "overlapLog=%u => %u KB", params.overlapSizeLog, (U32)(zcs->targetDictSize>>10));
-    zcs->targetSectionSize = params.jobSize ? params.jobSize : (size_t)1 << (params.cParams.windowLog + 2);
-    if (zcs->targetSectionSize < ZSTDMT_JOBSIZE_MIN) zcs->targetSectionSize = ZSTDMT_JOBSIZE_MIN;
-    if (zcs->targetSectionSize < zcs->targetDictSize) zcs->targetSectionSize = zcs->targetDictSize;  /* job size must be >= overlap size */
-    DEBUGLOG(4, "Job Size : %u KB (note : set to %u)", (U32)(zcs->targetSectionSize>>10), params.jobSize);
-    zcs->inBuffSize = zcs->targetDictSize + zcs->targetSectionSize;
-    DEBUGLOG(4, "inBuff Size : %u KB", (U32)(zcs->inBuffSize>>10));
-    ZSTDMT_setBufferSize(zcs->bufPool, MAX(zcs->inBuffSize, ZSTD_compressBound(zcs->targetSectionSize)) );
-    zcs->inBuff.buffer = g_nullBuffer;
-    zcs->dictSize = 0;
-    zcs->doneJobID = 0;
-    zcs->nextJobID = 0;
-    zcs->frameEnded = 0;
-    zcs->allJobsCompleted = 0;
-    if (params.fParams.checksumFlag) XXH64_reset(&zcs->xxhState, 0);
-    return 0;
-}
-
-size_t ZSTDMT_initCStream_advanced(ZSTDMT_CCtx* mtctx,
-                             const void* dict, size_t dictSize,
-                                   ZSTD_parameters params,
-                                   unsigned long long pledgedSrcSize)
-{
-    ZSTD_CCtx_params cctxParams = mtctx->params;
-    DEBUGLOG(5, "ZSTDMT_initCStream_advanced (pledgedSrcSize=%u)", (U32)pledgedSrcSize);
-    cctxParams.cParams = params.cParams;
-    cctxParams.fParams = params.fParams;
-    return ZSTDMT_initCStream_internal(mtctx, dict, dictSize, ZSTD_dm_auto, NULL,
-                                       cctxParams, pledgedSrcSize);
-}
-
-size_t ZSTDMT_initCStream_usingCDict(ZSTDMT_CCtx* mtctx,
-                               const ZSTD_CDict* cdict,
-                                     ZSTD_frameParameters fParams,
-                                     unsigned long long pledgedSrcSize)
-{
-    ZSTD_CCtx_params cctxParams = mtctx->params;
-    cctxParams.cParams = ZSTD_getCParamsFromCDict(cdict);
-    cctxParams.fParams = fParams;
-    if (cdict==NULL) return ERROR(dictionary_wrong);   /* method incompatible with NULL cdict */
-    return ZSTDMT_initCStream_internal(mtctx, NULL, 0 /*dictSize*/, ZSTD_dm_auto, cdict,
-                                       cctxParams, pledgedSrcSize);
-}
-
-
-/* ZSTDMT_resetCStream() :
- * pledgedSrcSize can be zero == unknown (for the time being)
- * prefer using ZSTD_CONTENTSIZE_UNKNOWN,
- * as `0` might mean "empty" in the future */
-size_t ZSTDMT_resetCStream(ZSTDMT_CCtx* zcs, unsigned long long pledgedSrcSize)
-{
-    if (!pledgedSrcSize) pledgedSrcSize = ZSTD_CONTENTSIZE_UNKNOWN;
-    if (zcs->params.nbThreads==1)
-        return ZSTD_resetCStream(zcs->cctxPool->cctx[0], pledgedSrcSize);
-    return ZSTDMT_initCStream_internal(zcs, NULL, 0, ZSTD_dm_auto, 0, zcs->params,
-                                       pledgedSrcSize);
-}
-
-size_t ZSTDMT_initCStream(ZSTDMT_CCtx* zcs, int compressionLevel) {
-    ZSTD_parameters const params = ZSTD_getParams(compressionLevel, 0, 0);
-    ZSTD_CCtx_params cctxParams = zcs->params;
-    cctxParams.cParams = params.cParams;
-    cctxParams.fParams = params.fParams;
-    return ZSTDMT_initCStream_internal(zcs, NULL, 0, ZSTD_dm_auto, NULL, cctxParams, ZSTD_CONTENTSIZE_UNKNOWN);
-}
-
-
-static size_t ZSTDMT_createCompressionJob(ZSTDMT_CCtx* zcs, size_t srcSize, unsigned endFrame)
-{
-    unsigned const jobID = zcs->nextJobID & zcs->jobIDMask;
-
-    DEBUGLOG(5, "ZSTDMT_createCompressionJob: preparing job %u to compress %u bytes with %u preload ",
-                zcs->nextJobID, (U32)srcSize, (U32)zcs->dictSize);
-    zcs->jobs[jobID].src = zcs->inBuff.buffer;
-    zcs->jobs[jobID].srcStart = zcs->inBuff.buffer.start;
-    zcs->jobs[jobID].srcSize = srcSize;
-    zcs->jobs[jobID].prefixSize = zcs->dictSize;
-    assert(zcs->inBuff.filled >= srcSize + zcs->dictSize);
-    zcs->jobs[jobID].params = zcs->params;
-    /* do not calculate checksum within sections, but write it in header for first section */
-    if (zcs->nextJobID) zcs->jobs[jobID].params.fParams.checksumFlag = 0;
-    zcs->jobs[jobID].cdict = zcs->nextJobID==0 ? zcs->cdict : NULL;
-    zcs->jobs[jobID].fullFrameSize = zcs->frameContentSize;
-    zcs->jobs[jobID].dstBuff = g_nullBuffer;
-    zcs->jobs[jobID].cctxPool = zcs->cctxPool;
-    zcs->jobs[jobID].bufPool = zcs->bufPool;
-    zcs->jobs[jobID].firstChunk = (zcs->nextJobID==0);
-    zcs->jobs[jobID].lastChunk = endFrame;
-    zcs->jobs[jobID].jobCompleted = 0;
-    zcs->jobs[jobID].dstFlushed = 0;
-    zcs->jobs[jobID].jobCompleted_mutex = &zcs->jobCompleted_mutex;
-    zcs->jobs[jobID].jobCompleted_cond = &zcs->jobCompleted_cond;
-
-    if (zcs->params.fParams.checksumFlag)
-        XXH64_update(&zcs->xxhState, (const char*)zcs->inBuff.buffer.start + zcs->dictSize, srcSize);
-
-    /* get a new buffer for next input */
-    if (!endFrame) {
-        size_t const newDictSize = MIN(srcSize + zcs->dictSize, zcs->targetDictSize);
-        zcs->inBuff.buffer = ZSTDMT_getBuffer(zcs->bufPool);
-        if (zcs->inBuff.buffer.start == NULL) {   /* not enough memory to allocate next input buffer */
-            zcs->jobs[jobID].jobCompleted = 1;
-            zcs->nextJobID++;
-            ZSTDMT_waitForAllJobsCompleted(zcs);
-            ZSTDMT_releaseAllJobResources(zcs);
-            return ERROR(memory_allocation);
-        }
-        zcs->inBuff.filled -= srcSize + zcs->dictSize - newDictSize;
-        memmove(zcs->inBuff.buffer.start,
-            (const char*)zcs->jobs[jobID].srcStart + zcs->dictSize + srcSize - newDictSize,
-            zcs->inBuff.filled);
-        zcs->dictSize = newDictSize;
-    } else {   /* if (endFrame==1) */
-        zcs->inBuff.buffer = g_nullBuffer;
-        zcs->inBuff.filled = 0;
-        zcs->dictSize = 0;
-        zcs->frameEnded = 1;
-        if (zcs->nextJobID == 0) {
-            /* single chunk exception : checksum is calculated directly within worker thread */
-            zcs->params.fParams.checksumFlag = 0;
-    }   }
-
-    DEBUGLOG(5, "ZSTDMT_createCompressionJob: posting job %u : %u bytes  (end:%u) (note : doneJob = %u=>%u)",
-                zcs->nextJobID,
-                (U32)zcs->jobs[jobID].srcSize,
-                zcs->jobs[jobID].lastChunk,
-                zcs->doneJobID,
-                zcs->doneJobID & zcs->jobIDMask);
-    POOL_add(zcs->factory, ZSTDMT_compressChunk, &zcs->jobs[jobID]);   /* this call is blocking when thread worker pool is exhausted */
-    zcs->nextJobID++;
-    return 0;
-}
-
-
-/* ZSTDMT_flushNextJob() :
- * output : will be updated with amount of data flushed .
- * blockToFlush : if >0, the function will block and wait if there is no data available to flush .
- * @return : amount of data remaining within internal buffer, 1 if unknown but > 0, 0 if no more, or an error code */
-static size_t ZSTDMT_flushNextJob(ZSTDMT_CCtx* zcs, ZSTD_outBuffer* output, unsigned blockToFlush)
-{
-    unsigned const wJobID = zcs->doneJobID & zcs->jobIDMask;
-    DEBUGLOG(5, "ZSTDMT_flushNextJob");
-    if (zcs->doneJobID == zcs->nextJobID) return 0;   /* all flushed ! */
-    ZSTD_PTHREAD_MUTEX_LOCK(&zcs->jobCompleted_mutex);
-    while (zcs->jobs[wJobID].jobCompleted==0) {
-        DEBUGLOG(5, "waiting for jobCompleted signal from job %u", zcs->doneJobID);
-        if (!blockToFlush) { ZSTD_pthread_mutex_unlock(&zcs->jobCompleted_mutex); return 0; }  /* nothing ready to be flushed => skip */
-        ZSTD_pthread_cond_wait(&zcs->jobCompleted_cond, &zcs->jobCompleted_mutex);  /* block when nothing available to flush */
-    }
-    ZSTD_pthread_mutex_unlock(&zcs->jobCompleted_mutex);
-    /* compression job completed : output can be flushed */
-    {   ZSTDMT_jobDescription job = zcs->jobs[wJobID];
-        if (!job.jobScanned) {
-            if (ZSTD_isError(job.cSize)) {
-                DEBUGLOG(5, "job %u : compression error detected : %s",
-                            zcs->doneJobID, ZSTD_getErrorName(job.cSize));
-                ZSTDMT_waitForAllJobsCompleted(zcs);
-                ZSTDMT_releaseAllJobResources(zcs);
-                return job.cSize;
-            }
-            DEBUGLOG(5, "zcs->params.fParams.checksumFlag : %u ", zcs->params.fParams.checksumFlag);
-            if (zcs->params.fParams.checksumFlag) {
-                if (zcs->frameEnded && (zcs->doneJobID+1 == zcs->nextJobID)) {  /* write checksum at end of last section */
-                    U32 const checksum = (U32)XXH64_digest(&zcs->xxhState);
-                    DEBUGLOG(5, "writing checksum : %08X \n", checksum);
-                    MEM_writeLE32((char*)job.dstBuff.start + job.cSize, checksum);
-                    job.cSize += 4;
-                    zcs->jobs[wJobID].cSize += 4;
-            }   }
-            zcs->jobs[wJobID].jobScanned = 1;
-        }
-        {   size_t const toWrite = MIN(job.cSize - job.dstFlushed, output->size - output->pos);
-            DEBUGLOG(5, "Flushing %u bytes from job %u ", (U32)toWrite, zcs->doneJobID);
-            memcpy((char*)output->dst + output->pos, (const char*)job.dstBuff.start + job.dstFlushed, toWrite);
-            output->pos += toWrite;
-            job.dstFlushed += toWrite;
-        }
-        if (job.dstFlushed == job.cSize) {   /* output buffer fully flushed => move to next one */
-            ZSTDMT_releaseBuffer(zcs->bufPool, job.dstBuff);
-            zcs->jobs[wJobID].dstBuff = g_nullBuffer;
-            zcs->jobs[wJobID].jobCompleted = 0;
-            zcs->doneJobID++;
-        } else {
-            zcs->jobs[wJobID].dstFlushed = job.dstFlushed;
-        }
-        /* return value : how many bytes left in buffer ; fake it to 1 if unknown but >0 */
-        if (job.cSize > job.dstFlushed) return (job.cSize - job.dstFlushed);
-        if (zcs->doneJobID < zcs->nextJobID) return 1;   /* still some buffer to flush */
-        zcs->allJobsCompleted = zcs->frameEnded;   /* frame completed and entirely flushed */
-        return 0;   /* everything flushed */
-}   }
-
-
-/** ZSTDMT_compressStream_generic() :
- *  internal use only - exposed to be invoked from zstd_compress.c
- *  assumption : output and input are valid (pos <= size)
- * @return : minimum amount of data remaining to flush, 0 if none */
-size_t ZSTDMT_compressStream_generic(ZSTDMT_CCtx* mtctx,
-                                     ZSTD_outBuffer* output,
-                                     ZSTD_inBuffer* input,
-                                     ZSTD_EndDirective endOp)
-{
-    size_t const newJobThreshold = mtctx->dictSize + mtctx->targetSectionSize;
-    unsigned forwardInputProgress = 0;
-    DEBUGLOG(5, "ZSTDMT_compressStream_generic ");
-    assert(output->pos <= output->size);
-    assert(input->pos  <= input->size);
-
-    if (mtctx->singleThreaded) {  /* delegate to single-thread (synchronous) */
-        return ZSTD_compressStream_generic(mtctx->cctxPool->cctx[0], output, input, endOp);
-    }
-
-    if ((mtctx->frameEnded) && (endOp==ZSTD_e_continue)) {
-        /* current frame being ended. Only flush/end are allowed */
-        return ERROR(stage_wrong);
-    }
-
-    /* single-pass shortcut (note : synchronous-mode) */
-    if ( (mtctx->nextJobID == 0)     /* just started */
-      && (mtctx->inBuff.filled == 0) /* nothing buffered */
-      && (endOp == ZSTD_e_end)       /* end order */
-      && (output->size - output->pos >= ZSTD_compressBound(input->size - input->pos)) ) { /* enough room */
-        size_t const cSize = ZSTDMT_compress_advanced_internal(mtctx,
-                (char*)output->dst + output->pos, output->size - output->pos,
-                (const char*)input->src + input->pos, input->size - input->pos,
-                mtctx->cdict, mtctx->params);
-        if (ZSTD_isError(cSize)) return cSize;
-        input->pos = input->size;
-        output->pos += cSize;
-        ZSTDMT_releaseBuffer(mtctx->bufPool, mtctx->inBuff.buffer);  /* was allocated in initStream */
-        mtctx->allJobsCompleted = 1;
-        mtctx->frameEnded = 1;
-        return 0;
-    }
-
-    /* fill input buffer */
-    if (input->size > input->pos) {   /* support NULL input */
-        if (mtctx->inBuff.buffer.start == NULL) {
-            mtctx->inBuff.buffer = ZSTDMT_getBuffer(mtctx->bufPool);  /* note : may fail, in which case, no forward input progress */
-            mtctx->inBuff.filled = 0;
-        }
-        if (mtctx->inBuff.buffer.start) {
-            size_t const toLoad = MIN(input->size - input->pos, mtctx->inBuffSize - mtctx->inBuff.filled);
-            DEBUGLOG(5, "inBuff:%08X;  inBuffSize=%u;  ToCopy=%u", (U32)(size_t)mtctx->inBuff.buffer.start, (U32)mtctx->inBuffSize, (U32)toLoad);
-            memcpy((char*)mtctx->inBuff.buffer.start + mtctx->inBuff.filled, (const char*)input->src + input->pos, toLoad);
-            input->pos += toLoad;
-            mtctx->inBuff.filled += toLoad;
-            forwardInputProgress = toLoad>0;
-    }   }
-
-    if ( (mtctx->inBuff.filled >= newJobThreshold)  /* filled enough : let's compress */
-      && (mtctx->nextJobID <= mtctx->doneJobID + mtctx->jobIDMask) ) {   /* avoid overwriting job round buffer */
-        CHECK_F( ZSTDMT_createCompressionJob(mtctx, mtctx->targetSectionSize, 0 /* endFrame */) );
-    }
-
-    /* check for potential compressed data ready to be flushed */
-    CHECK_F( ZSTDMT_flushNextJob(mtctx, output, !forwardInputProgress /* blockToFlush */) ); /* block if there was no forward input progress */
-
-    if (input->pos < input->size)  /* input not consumed : do not flush yet */
-        endOp = ZSTD_e_continue;
-
-    switch(endOp)
-    {
-        case ZSTD_e_flush:
-            return ZSTDMT_flushStream(mtctx, output);
-        case ZSTD_e_end:
-            return ZSTDMT_endStream(mtctx, output);
-        case ZSTD_e_continue:
-            return 1;
-        default:
-            return ERROR(GENERIC);   /* invalid endDirective */
-    }
-}
-
-
-size_t ZSTDMT_compressStream(ZSTDMT_CCtx* zcs, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
-{
-    CHECK_F( ZSTDMT_compressStream_generic(zcs, output, input, ZSTD_e_continue) );
-
-    /* recommended next input size : fill current input buffer */
-    return zcs->inBuffSize - zcs->inBuff.filled;   /* note : could be zero when input buffer is fully filled and no more availability to create new job */
-}
-
-
-static size_t ZSTDMT_flushStream_internal(ZSTDMT_CCtx* mtctx, ZSTD_outBuffer* output, unsigned endFrame)
-{
-    size_t const srcSize = mtctx->inBuff.filled - mtctx->dictSize;
-    DEBUGLOG(5, "ZSTDMT_flushStream_internal");
-
-    if ( ((srcSize > 0) || (endFrame && !mtctx->frameEnded))
-       && (mtctx->nextJobID <= mtctx->doneJobID + mtctx->jobIDMask) ) {
-           DEBUGLOG(5, "ZSTDMT_flushStream_internal : create a new job");
-        CHECK_F( ZSTDMT_createCompressionJob(mtctx, srcSize, endFrame) );
-    }
-
-    /* check if there is any data available to flush */
-    return ZSTDMT_flushNextJob(mtctx, output, 1 /* blockToFlush */);
-}
-
-
-size_t ZSTDMT_flushStream(ZSTDMT_CCtx* mtctx, ZSTD_outBuffer* output)
-{
-    DEBUGLOG(5, "ZSTDMT_flushStream");
-    if (mtctx->singleThreaded)
-        return ZSTD_flushStream(mtctx->cctxPool->cctx[0], output);
-    return ZSTDMT_flushStream_internal(mtctx, output, 0 /* endFrame */);
-}
-
-size_t ZSTDMT_endStream(ZSTDMT_CCtx* mtctx, ZSTD_outBuffer* output)
-{
-    DEBUGLOG(4, "ZSTDMT_endStream");
-    if (mtctx->singleThreaded)
-        return ZSTD_endStream(mtctx->cctxPool->cctx[0], output);
-    return ZSTDMT_flushStream_internal(mtctx, output, 1 /* endFrame */);
-}
diff --git a/priv/zstd/lib/compress/zstdmt_compress.h b/priv/zstd/lib/compress/zstdmt_compress.h
deleted file mode 100644
index d12f0ad..0000000
--- a/priv/zstd/lib/compress/zstdmt_compress.h
+++ /dev/null
@@ -1,140 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
- #ifndef ZSTDMT_COMPRESS_H
- #define ZSTDMT_COMPRESS_H
-
- #if defined (__cplusplus)
- extern "C" {
- #endif
-
-
-/* Note : This is an internal API.
- *        Some methods are still exposed (ZSTDLIB_API),
- *        because it used to be the only way to invoke MT compression.
- *        Now, it's recommended to use ZSTD_compress_generic() instead.
- *        These methods will stop being exposed in a future version */
-
-/* ===   Dependencies   === */
-#include                 /* size_t */
-#define ZSTD_STATIC_LINKING_ONLY   /* ZSTD_parameters */
-#include "zstd.h"            /* ZSTD_inBuffer, ZSTD_outBuffer, ZSTDLIB_API */
-
-
-/* ===   Memory management   === */
-typedef struct ZSTDMT_CCtx_s ZSTDMT_CCtx;
-ZSTDLIB_API ZSTDMT_CCtx* ZSTDMT_createCCtx(unsigned nbThreads);
-ZSTDLIB_API ZSTDMT_CCtx* ZSTDMT_createCCtx_advanced(unsigned nbThreads,
-                                                    ZSTD_customMem cMem);
-ZSTDLIB_API size_t ZSTDMT_freeCCtx(ZSTDMT_CCtx* mtctx);
-
-ZSTDLIB_API size_t ZSTDMT_sizeof_CCtx(ZSTDMT_CCtx* mtctx);
-
-
-/* ===   Simple buffer-to-butter one-pass function   === */
-
-ZSTDLIB_API size_t ZSTDMT_compressCCtx(ZSTDMT_CCtx* mtctx,
-                                       void* dst, size_t dstCapacity,
-                                 const void* src, size_t srcSize,
-                                       int compressionLevel);
-
-
-
-/* ===   Streaming functions   === */
-
-ZSTDLIB_API size_t ZSTDMT_initCStream(ZSTDMT_CCtx* mtctx, int compressionLevel);
-ZSTDLIB_API size_t ZSTDMT_resetCStream(ZSTDMT_CCtx* mtctx, unsigned long long pledgedSrcSize);  /**< if srcSize is not known at reset time, use ZSTD_CONTENTSIZE_UNKNOWN. Note: for compatibility with older programs, 0 means the same as ZSTD_CONTENTSIZE_UNKNOWN, but it may change in the future, to mean "empty" */
-
-ZSTDLIB_API size_t ZSTDMT_compressStream(ZSTDMT_CCtx* mtctx, ZSTD_outBuffer* output, ZSTD_inBuffer* input);
-
-ZSTDLIB_API size_t ZSTDMT_flushStream(ZSTDMT_CCtx* mtctx, ZSTD_outBuffer* output);   /**< @return : 0 == all flushed; >0 : still some data to be flushed; or an error code (ZSTD_isError()) */
-ZSTDLIB_API size_t ZSTDMT_endStream(ZSTDMT_CCtx* mtctx, ZSTD_outBuffer* output);     /**< @return : 0 == all flushed; >0 : still some data to be flushed; or an error code (ZSTD_isError()) */
-
-
-/* ===   Advanced functions and parameters  === */
-
-#ifndef ZSTDMT_JOBSIZE_MIN
-#  define ZSTDMT_JOBSIZE_MIN (1U << 20)   /* 1 MB - Minimum size of each compression job */
-#endif
-
-ZSTDLIB_API size_t ZSTDMT_compress_advanced(ZSTDMT_CCtx* mtctx,
-                                           void* dst, size_t dstCapacity,
-                                     const void* src, size_t srcSize,
-                                     const ZSTD_CDict* cdict,
-                                           ZSTD_parameters const params,
-                                           unsigned overlapLog);
-
-ZSTDLIB_API size_t ZSTDMT_initCStream_advanced(ZSTDMT_CCtx* mtctx,
-                                        const void* dict, size_t dictSize,   /* dict can be released after init, a local copy is preserved within zcs */
-                                        ZSTD_parameters params,
-                                        unsigned long long pledgedSrcSize);  /* pledgedSrcSize is optional and can be zero == unknown */
-
-ZSTDLIB_API size_t ZSTDMT_initCStream_usingCDict(ZSTDMT_CCtx* mtctx,
-                                        const ZSTD_CDict* cdict,
-                                        ZSTD_frameParameters fparams,
-                                        unsigned long long pledgedSrcSize);  /* note : zero means empty */
-
-/* ZSTDMT_parameter :
- * List of parameters that can be set using ZSTDMT_setMTCtxParameter() */
-typedef enum {
-    ZSTDMT_p_jobSize,           /* Each job is compressed in parallel. By default, this value is dynamically determined depending on compression parameters. Can be set explicitly here. */
-    ZSTDMT_p_overlapSectionLog  /* Each job may reload a part of previous job to enhance compressionr ratio; 0 == no overlap, 6(default) == use 1/8th of window, >=9 == use full window */
-} ZSTDMT_parameter;
-
-/* ZSTDMT_setMTCtxParameter() :
- * allow setting individual parameters, one at a time, among a list of enums defined in ZSTDMT_parameter.
- * The function must be called typically after ZSTD_createCCtx() but __before ZSTDMT_init*() !__
- * Parameters not explicitly reset by ZSTDMT_init*() remain the same in consecutive compression sessions.
- * @return : 0, or an error code (which can be tested using ZSTD_isError()) */
-ZSTDLIB_API size_t ZSTDMT_setMTCtxParameter(ZSTDMT_CCtx* mtctx, ZSTDMT_parameter parameter, unsigned value);
-
-
-/*! ZSTDMT_compressStream_generic() :
- *  Combines ZSTDMT_compressStream() with ZSTDMT_flushStream() or ZSTDMT_endStream()
- *  depending on flush directive.
- * @return : minimum amount of data still to be flushed
- *           0 if fully flushed
- *           or an error code */
-ZSTDLIB_API size_t ZSTDMT_compressStream_generic(ZSTDMT_CCtx* mtctx,
-                                                ZSTD_outBuffer* output,
-                                                ZSTD_inBuffer* input,
-                                                ZSTD_EndDirective endOp);
-
-
-/* ===   Private definitions; never ever use directly  === */
-
-size_t ZSTDMT_CCtxParam_setMTCtxParameter(ZSTD_CCtx_params* params, ZSTDMT_parameter parameter, unsigned value);
-
-/* ZSTDMT_CCtxParam_setNbThreads()
- * Set nbThreads, and clamp it correctly,
- * also reset jobSize and overlapLog */
-size_t ZSTDMT_CCtxParam_setNbThreads(ZSTD_CCtx_params* params, unsigned nbThreads);
-
-/* ZSTDMT_getNbThreads():
- * @return nb threads currently active in mtctx.
- * mtctx must be valid */
-size_t ZSTDMT_getNbThreads(const ZSTDMT_CCtx* mtctx);
-
-/*! ZSTDMT_initCStream_internal() :
- *  Private use only. Init streaming operation.
- *  expects params to be valid.
- *  must receive dict, or cdict, or none, but not both.
- *  @return : 0, or an error code */
-size_t ZSTDMT_initCStream_internal(ZSTDMT_CCtx* zcs,
-                    const void* dict, size_t dictSize, ZSTD_dictMode_e dictMode,
-                    const ZSTD_CDict* cdict,
-                    ZSTD_CCtx_params params, unsigned long long pledgedSrcSize);
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif   /* ZSTDMT_COMPRESS_H */
diff --git a/priv/zstd/lib/decompress/huf_decompress.c b/priv/zstd/lib/decompress/huf_decompress.c
deleted file mode 100644
index 79ded96..0000000
--- a/priv/zstd/lib/decompress/huf_decompress.c
+++ /dev/null
@@ -1,996 +0,0 @@
-/* ******************************************************************
-   Huffman decoder, part of New Generation Entropy library
-   Copyright (C) 2013-2016, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE+HUF source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-/* **************************************************************
-*  Dependencies
-****************************************************************/
-#include      /* memcpy, memset */
-#include "bitstream.h"  /* BIT_* */
-#include "compiler.h"
-#include "fse.h"        /* header compression */
-#define HUF_STATIC_LINKING_ONLY
-#include "huf.h"
-#include "error_private.h"
-
-
-/* **************************************************************
-*  Error Management
-****************************************************************/
-#define HUF_isError ERR_isError
-#define HUF_STATIC_ASSERT(c) { enum { HUF_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-
-
-/* **************************************************************
-*  Byte alignment for workSpace management
-****************************************************************/
-#define HUF_ALIGN(x, a) HUF_ALIGN_MASK((x), (a) - 1)
-#define HUF_ALIGN_MASK(x, mask) (((x) + (mask)) & ~(mask))
-
-/*-***************************/
-/*  generic DTableDesc       */
-/*-***************************/
-
-typedef struct { BYTE maxTableLog; BYTE tableType; BYTE tableLog; BYTE reserved; } DTableDesc;
-
-static DTableDesc HUF_getDTableDesc(const HUF_DTable* table)
-{
-    DTableDesc dtd;
-    memcpy(&dtd, table, sizeof(dtd));
-    return dtd;
-}
-
-
-/*-***************************/
-/*  single-symbol decoding   */
-/*-***************************/
-
-typedef struct { BYTE byte; BYTE nbBits; } HUF_DEltX2;   /* single-symbol decoding */
-
-size_t HUF_readDTableX2_wksp(HUF_DTable* DTable, const void* src, size_t srcSize, void* workSpace, size_t wkspSize)
-{
-    U32 tableLog = 0;
-    U32 nbSymbols = 0;
-    size_t iSize;
-    void* const dtPtr = DTable + 1;
-    HUF_DEltX2* const dt = (HUF_DEltX2*)dtPtr;
-
-    U32* rankVal;
-    BYTE* huffWeight;
-    size_t spaceUsed32 = 0;
-
-    rankVal = (U32 *)workSpace + spaceUsed32;
-    spaceUsed32 += HUF_TABLELOG_ABSOLUTEMAX + 1;
-    huffWeight = (BYTE *)((U32 *)workSpace + spaceUsed32);
-    spaceUsed32 += HUF_ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-
-    if ((spaceUsed32 << 2) > wkspSize)
-        return ERROR(tableLog_tooLarge);
-    workSpace = (U32 *)workSpace + spaceUsed32;
-    wkspSize -= (spaceUsed32 << 2);
-
-    HUF_STATIC_ASSERT(sizeof(DTableDesc) == sizeof(HUF_DTable));
-    /* memset(huffWeight, 0, sizeof(huffWeight)); */   /* is not necessary, even though some analyzer complain ... */
-
-    iSize = HUF_readStats(huffWeight, HUF_SYMBOLVALUE_MAX + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);
-    if (HUF_isError(iSize)) return iSize;
-
-    /* Table header */
-    {   DTableDesc dtd = HUF_getDTableDesc(DTable);
-        if (tableLog > (U32)(dtd.maxTableLog+1)) return ERROR(tableLog_tooLarge);   /* DTable too small, Huffman tree cannot fit in */
-        dtd.tableType = 0;
-        dtd.tableLog = (BYTE)tableLog;
-        memcpy(DTable, &dtd, sizeof(dtd));
-    }
-
-    /* Calculate starting value for each rank */
-    {   U32 n, nextRankStart = 0;
-        for (n=1; n> 1;
-            U32 u;
-            HUF_DEltX2 D;
-            D.byte = (BYTE)n; D.nbBits = (BYTE)(tableLog + 1 - w);
-            for (u = rankVal[w]; u < rankVal[w] + length; u++)
-                dt[u] = D;
-            rankVal[w] += length;
-    }   }
-
-    return iSize;
-}
-
-size_t HUF_readDTableX2(HUF_DTable* DTable, const void* src, size_t srcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_readDTableX2_wksp(DTable, src, srcSize,
-                                 workSpace, sizeof(workSpace));
-}
-
-
-static BYTE HUF_decodeSymbolX2(BIT_DStream_t* Dstream, const HUF_DEltX2* dt, const U32 dtLog)
-{
-    size_t const val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
-    BYTE const c = dt[val].byte;
-    BIT_skipBits(Dstream, dt[val].nbBits);
-    return c;
-}
-
-#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) \
-    *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr) \
-    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
-        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-
-#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
-    if (MEM_64bits()) \
-        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-
-HINT_INLINE size_t HUF_decodeStreamX2(BYTE* p, BIT_DStream_t* const bitDPtr, BYTE* const pEnd, const HUF_DEltX2* const dt, const U32 dtLog)
-{
-    BYTE* const pStart = p;
-
-    /* up to 4 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-4)) {
-        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-    }
-
-    /* closer to the end */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-
-    /* no more data to retrieve from bitstream, hence no need to reload */
-    while (p < pEnd)
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-
-    return pEnd-pStart;
-}
-
-static size_t HUF_decompress1X2_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    BYTE* op = (BYTE*)dst;
-    BYTE* const oend = op + dstSize;
-    const void* dtPtr = DTable + 1;
-    const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
-    BIT_DStream_t bitD;
-    DTableDesc const dtd = HUF_getDTableDesc(DTable);
-    U32 const dtLog = dtd.tableLog;
-
-    { size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-      if (HUF_isError(errorCode)) return errorCode; }
-
-    HUF_decodeStreamX2(op, &bitD, oend, dt, dtLog);
-
-    /* check */
-    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
-
-    return dstSize;
-}
-
-size_t HUF_decompress1X2_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 0) return ERROR(GENERIC);
-    return HUF_decompress1X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress1X2_DCtx_wksp(HUF_DTable* DCtx, void* dst, size_t dstSize,
-                                   const void* cSrc, size_t cSrcSize,
-                                   void* workSpace, size_t wkspSize)
-{
-    const BYTE* ip = (const BYTE*) cSrc;
-
-    size_t const hSize = HUF_readDTableX2_wksp(DCtx, cSrc, cSrcSize, workSpace, wkspSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
-
-    return HUF_decompress1X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
-}
-
-
-size_t HUF_decompress1X2_DCtx(HUF_DTable* DCtx, void* dst, size_t dstSize,
-                              const void* cSrc, size_t cSrcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_decompress1X2_DCtx_wksp(DCtx, dst, dstSize, cSrc, cSrcSize,
-                                       workSpace, sizeof(workSpace));
-}
-
-size_t HUF_decompress1X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress1X2_DCtx (DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
-
-static size_t HUF_decompress4X2_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    /* Check */
-    if (cSrcSize < 10) return ERROR(corruption_detected);  /* strict minimum : jump table + 1 byte per stream */
-
-    {   const BYTE* const istart = (const BYTE*) cSrc;
-        BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-        const void* const dtPtr = DTable + 1;
-        const HUF_DEltX2* const dt = (const HUF_DEltX2*)dtPtr;
-
-        /* Init */
-        BIT_DStream_t bitD1;
-        BIT_DStream_t bitD2;
-        BIT_DStream_t bitD3;
-        BIT_DStream_t bitD4;
-        size_t const length1 = MEM_readLE16(istart);
-        size_t const length2 = MEM_readLE16(istart+2);
-        size_t const length3 = MEM_readLE16(istart+4);
-        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-        const BYTE* const istart1 = istart + 6;  /* jumpTable */
-        const BYTE* const istart2 = istart1 + length1;
-        const BYTE* const istart3 = istart2 + length2;
-        const BYTE* const istart4 = istart3 + length3;
-        const size_t segmentSize = (dstSize+3) / 4;
-        BYTE* const opStart2 = ostart + segmentSize;
-        BYTE* const opStart3 = opStart2 + segmentSize;
-        BYTE* const opStart4 = opStart3 + segmentSize;
-        BYTE* op1 = ostart;
-        BYTE* op2 = opStart2;
-        BYTE* op3 = opStart3;
-        BYTE* op4 = opStart4;
-        U32 endSignal;
-        DTableDesc const dtd = HUF_getDTableDesc(DTable);
-        U32 const dtLog = dtd.tableLog;
-
-        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
-        { size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-          if (HUF_isError(errorCode)) return errorCode; }
-
-        /* 16-32 symbols per loop (4-8 symbols per stream) */
-        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; ) {
-            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
-            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        }
-
-        /* check corruption */
-        if (op1 > opStart2) return ERROR(corruption_detected);
-        if (op2 > opStart3) return ERROR(corruption_detected);
-        if (op3 > opStart4) return ERROR(corruption_detected);
-        /* note : op4 supposed already verified within main loop */
-
-        /* finish bitStreams one by one */
-        HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
-        HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
-        HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
-        HUF_decodeStreamX2(op4, &bitD4, oend,     dt, dtLog);
-
-        /* check */
-        endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-        if (!endSignal) return ERROR(corruption_detected);
-
-        /* decoded size */
-        return dstSize;
-    }
-}
-
-
-size_t HUF_decompress4X2_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 0) return ERROR(GENERIC);
-    return HUF_decompress4X2_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-
-size_t HUF_decompress4X2_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize,
-                                   const void* cSrc, size_t cSrcSize,
-                                   void* workSpace, size_t wkspSize)
-{
-    const BYTE* ip = (const BYTE*) cSrc;
-
-    size_t const hSize = HUF_readDTableX2_wksp (dctx, cSrc, cSrcSize,
-                                                workSpace, wkspSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
-
-    return HUF_decompress4X2_usingDTable_internal (dst, dstSize, ip, cSrcSize, dctx);
-}
-
-
-size_t HUF_decompress4X2_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
-                                       workSpace, sizeof(workSpace));
-}
-size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress4X2_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
-
-/* *************************/
-/* double-symbols decoding */
-/* *************************/
-typedef struct { U16 sequence; BYTE nbBits; BYTE length; } HUF_DEltX4;  /* double-symbols decoding */
-
-typedef struct { BYTE symbol; BYTE weight; } sortedSymbol_t;
-
-/* HUF_fillDTableX4Level2() :
- * `rankValOrigin` must be a table of at least (HUF_TABLELOG_MAX + 1) U32 */
-static void HUF_fillDTableX4Level2(HUF_DEltX4* DTable, U32 sizeLog, const U32 consumed,
-                           const U32* rankValOrigin, const int minWeight,
-                           const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,
-                           U32 nbBitsBaseline, U16 baseSeq)
-{
-    HUF_DEltX4 DElt;
-    U32 rankVal[HUF_TABLELOG_MAX + 1];
-
-    /* get pre-calculated rankVal */
-    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-
-    /* fill skipped values */
-    if (minWeight>1) {
-        U32 i, skipSize = rankVal[minWeight];
-        MEM_writeLE16(&(DElt.sequence), baseSeq);
-        DElt.nbBits   = (BYTE)(consumed);
-        DElt.length   = 1;
-        for (i = 0; i < skipSize; i++)
-            DTable[i] = DElt;
-    }
-
-    /* fill DTable */
-    {   U32 s; for (s=0; s= 1 */
-
-            rankVal[weight] += length;
-    }   }
-}
-
-typedef U32 rankValCol_t[HUF_TABLELOG_MAX + 1];
-typedef rankValCol_t rankVal_t[HUF_TABLELOG_MAX];
-
-static void HUF_fillDTableX4(HUF_DEltX4* DTable, const U32 targetLog,
-                           const sortedSymbol_t* sortedList, const U32 sortedListSize,
-                           const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,
-                           const U32 nbBitsBaseline)
-{
-    U32 rankVal[HUF_TABLELOG_MAX + 1];
-    const int scaleLog = nbBitsBaseline - targetLog;   /* note : targetLog >= srcLog, hence scaleLog <= 1 */
-    const U32 minBits  = nbBitsBaseline - maxWeight;
-    U32 s;
-
-    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-
-    /* fill DTable */
-    for (s=0; s= minBits) {   /* enough room for a second symbol */
-            U32 sortedRank;
-            int minWeight = nbBits + scaleLog;
-            if (minWeight < 1) minWeight = 1;
-            sortedRank = rankStart[minWeight];
-            HUF_fillDTableX4Level2(DTable+start, targetLog-nbBits, nbBits,
-                           rankValOrigin[nbBits], minWeight,
-                           sortedList+sortedRank, sortedListSize-sortedRank,
-                           nbBitsBaseline, symbol);
-        } else {
-            HUF_DEltX4 DElt;
-            MEM_writeLE16(&(DElt.sequence), symbol);
-            DElt.nbBits = (BYTE)(nbBits);
-            DElt.length = 1;
-            {   U32 const end = start + length;
-                U32 u;
-                for (u = start; u < end; u++) DTable[u] = DElt;
-        }   }
-        rankVal[weight] += length;
-    }
-}
-
-size_t HUF_readDTableX4_wksp(HUF_DTable* DTable, const void* src,
-                             size_t srcSize, void* workSpace,
-                             size_t wkspSize)
-{
-    U32 tableLog, maxW, sizeOfSort, nbSymbols;
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    U32 const maxTableLog = dtd.maxTableLog;
-    size_t iSize;
-    void* dtPtr = DTable+1;   /* force compiler to avoid strict-aliasing */
-    HUF_DEltX4* const dt = (HUF_DEltX4*)dtPtr;
-    U32 *rankStart;
-
-    rankValCol_t* rankVal;
-    U32* rankStats;
-    U32* rankStart0;
-    sortedSymbol_t* sortedSymbol;
-    BYTE* weightList;
-    size_t spaceUsed32 = 0;
-
-    rankVal = (rankValCol_t *)((U32 *)workSpace + spaceUsed32);
-    spaceUsed32 += (sizeof(rankValCol_t) * HUF_TABLELOG_MAX) >> 2;
-    rankStats = (U32 *)workSpace + spaceUsed32;
-    spaceUsed32 += HUF_TABLELOG_MAX + 1;
-    rankStart0 = (U32 *)workSpace + spaceUsed32;
-    spaceUsed32 += HUF_TABLELOG_MAX + 2;
-    sortedSymbol = (sortedSymbol_t *)workSpace + (spaceUsed32 * sizeof(U32)) / sizeof(sortedSymbol_t);
-    spaceUsed32 += HUF_ALIGN(sizeof(sortedSymbol_t) * (HUF_SYMBOLVALUE_MAX + 1), sizeof(U32)) >> 2;
-    weightList = (BYTE *)((U32 *)workSpace + spaceUsed32);
-    spaceUsed32 += HUF_ALIGN(HUF_SYMBOLVALUE_MAX + 1, sizeof(U32)) >> 2;
-
-    if ((spaceUsed32 << 2) > wkspSize)
-        return ERROR(tableLog_tooLarge);
-    workSpace = (U32 *)workSpace + spaceUsed32;
-    wkspSize -= (spaceUsed32 << 2);
-
-    rankStart = rankStart0 + 1;
-    memset(rankStats, 0, sizeof(U32) * (2 * HUF_TABLELOG_MAX + 2 + 1));
-
-    HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(HUF_DTable));   /* if compiler fails here, assertion is wrong */
-    if (maxTableLog > HUF_TABLELOG_MAX) return ERROR(tableLog_tooLarge);
-    /* memset(weightList, 0, sizeof(weightList)); */  /* is not necessary, even though some analyzer complain ... */
-
-    iSize = HUF_readStats(weightList, HUF_SYMBOLVALUE_MAX + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);
-    if (HUF_isError(iSize)) return iSize;
-
-    /* check result */
-    if (tableLog > maxTableLog) return ERROR(tableLog_tooLarge);   /* DTable can't fit code depth */
-
-    /* find maxWeight */
-    for (maxW = tableLog; rankStats[maxW]==0; maxW--) {}  /* necessarily finds a solution before 0 */
-
-    /* Get start index of each weight */
-    {   U32 w, nextRankStart = 0;
-        for (w=1; w> consumed;
-    }   }   }   }
-
-    HUF_fillDTableX4(dt, maxTableLog,
-                   sortedSymbol, sizeOfSort,
-                   rankStart0, rankVal, maxW,
-                   tableLog+1);
-
-    dtd.tableLog = (BYTE)maxTableLog;
-    dtd.tableType = 1;
-    memcpy(DTable, &dtd, sizeof(dtd));
-    return iSize;
-}
-
-size_t HUF_readDTableX4(HUF_DTable* DTable, const void* src, size_t srcSize)
-{
-  U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-  return HUF_readDTableX4_wksp(DTable, src, srcSize,
-                               workSpace, sizeof(workSpace));
-}
-
-static U32 HUF_decodeSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
-{
-    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
-    memcpy(op, dt+val, 2);
-    BIT_skipBits(DStream, dt[val].nbBits);
-    return dt[val].length;
-}
-
-static U32 HUF_decodeLastSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
-{
-    size_t const val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
-    memcpy(op, dt+val, 1);
-    if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);
-    else {
-        if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8)) {
-            BIT_skipBits(DStream, dt[val].nbBits);
-            if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))
-                /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
-                DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8);
-    }   }
-    return 1;
-}
-
-
-#define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) \
-    ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr) \
-    if (MEM_64bits() || (HUF_TABLELOG_MAX<=12)) \
-        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \
-    if (MEM_64bits()) \
-        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-HINT_INLINE size_t HUF_decodeStreamX4(BYTE* p, BIT_DStream_t* bitDPtr, BYTE* const pEnd, const HUF_DEltX4* const dt, const U32 dtLog)
-{
-    BYTE* const pStart = p;
-
-    /* up to 8 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p < pEnd-(sizeof(bitDPtr->bitContainer)-1))) {
-        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-    }
-
-    /* closer to end : up to 2 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) & (p <= pEnd-2))
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-
-    while (p <= pEnd-2)
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);   /* no need to reload : reached the end of DStream */
-
-    if (p < pEnd)
-        p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
-
-    return p-pStart;
-}
-
-
-static size_t HUF_decompress1X4_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    BIT_DStream_t bitD;
-
-    /* Init */
-    {   size_t const errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);
-        if (HUF_isError(errorCode)) return errorCode;
-    }
-
-    /* decode */
-    {   BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-        const void* const dtPtr = DTable+1;   /* force compiler to not use strict-aliasing */
-        const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
-        DTableDesc const dtd = HUF_getDTableDesc(DTable);
-        HUF_decodeStreamX4(ostart, &bitD, oend, dt, dtd.tableLog);
-    }
-
-    /* check */
-    if (!BIT_endOfDStream(&bitD)) return ERROR(corruption_detected);
-
-    /* decoded size */
-    return dstSize;
-}
-
-size_t HUF_decompress1X4_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 1) return ERROR(GENERIC);
-    return HUF_decompress1X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress1X4_DCtx_wksp(HUF_DTable* DCtx, void* dst, size_t dstSize,
-                                   const void* cSrc, size_t cSrcSize,
-                                   void* workSpace, size_t wkspSize)
-{
-    const BYTE* ip = (const BYTE*) cSrc;
-
-    size_t const hSize = HUF_readDTableX4_wksp(DCtx, cSrc, cSrcSize,
-                                               workSpace, wkspSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
-
-    return HUF_decompress1X4_usingDTable_internal (dst, dstSize, ip, cSrcSize, DCtx);
-}
-
-
-size_t HUF_decompress1X4_DCtx(HUF_DTable* DCtx, void* dst, size_t dstSize,
-                              const void* cSrc, size_t cSrcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_decompress1X4_DCtx_wksp(DCtx, dst, dstSize, cSrc, cSrcSize,
-                                       workSpace, sizeof(workSpace));
-}
-
-size_t HUF_decompress1X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress1X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
-static size_t HUF_decompress4X4_usingDTable_internal(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
-
-    {   const BYTE* const istart = (const BYTE*) cSrc;
-        BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-        const void* const dtPtr = DTable+1;
-        const HUF_DEltX4* const dt = (const HUF_DEltX4*)dtPtr;
-
-        /* Init */
-        BIT_DStream_t bitD1;
-        BIT_DStream_t bitD2;
-        BIT_DStream_t bitD3;
-        BIT_DStream_t bitD4;
-        size_t const length1 = MEM_readLE16(istart);
-        size_t const length2 = MEM_readLE16(istart+2);
-        size_t const length3 = MEM_readLE16(istart+4);
-        size_t const length4 = cSrcSize - (length1 + length2 + length3 + 6);
-        const BYTE* const istart1 = istart + 6;  /* jumpTable */
-        const BYTE* const istart2 = istart1 + length1;
-        const BYTE* const istart3 = istart2 + length2;
-        const BYTE* const istart4 = istart3 + length3;
-        size_t const segmentSize = (dstSize+3) / 4;
-        BYTE* const opStart2 = ostart + segmentSize;
-        BYTE* const opStart3 = opStart2 + segmentSize;
-        BYTE* const opStart4 = opStart3 + segmentSize;
-        BYTE* op1 = ostart;
-        BYTE* op2 = opStart2;
-        BYTE* op3 = opStart3;
-        BYTE* op4 = opStart4;
-        U32 endSignal;
-        DTableDesc const dtd = HUF_getDTableDesc(DTable);
-        U32 const dtLog = dtd.tableLog;
-
-        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
-        { size_t const errorCode = BIT_initDStream(&bitD1, istart1, length1);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD2, istart2, length2);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD3, istart3, length3);
-          if (HUF_isError(errorCode)) return errorCode; }
-        { size_t const errorCode = BIT_initDStream(&bitD4, istart4, length4);
-          if (HUF_isError(errorCode)) return errorCode; }
-
-        /* 16-32 symbols per loop (4-8 symbols per stream) */
-        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        for ( ; (endSignal==BIT_DStream_unfinished) & (op4<(oend-(sizeof(bitD4.bitContainer)-1))) ; ) {
-            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
-
-            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        }
-
-        /* check corruption */
-        if (op1 > opStart2) return ERROR(corruption_detected);
-        if (op2 > opStart3) return ERROR(corruption_detected);
-        if (op3 > opStart4) return ERROR(corruption_detected);
-        /* note : op4 already verified within main loop */
-
-        /* finish bitStreams one by one */
-        HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
-        HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
-        HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
-        HUF_decodeStreamX4(op4, &bitD4, oend,     dt, dtLog);
-
-        /* check */
-        { U32 const endCheck = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-          if (!endCheck) return ERROR(corruption_detected); }
-
-        /* decoded size */
-        return dstSize;
-    }
-}
-
-
-size_t HUF_decompress4X4_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const HUF_DTable* DTable)
-{
-    DTableDesc dtd = HUF_getDTableDesc(DTable);
-    if (dtd.tableType != 1) return ERROR(GENERIC);
-    return HUF_decompress4X4_usingDTable_internal(dst, dstSize, cSrc, cSrcSize, DTable);
-}
-
-
-size_t HUF_decompress4X4_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize,
-                                   const void* cSrc, size_t cSrcSize,
-                                   void* workSpace, size_t wkspSize)
-{
-    const BYTE* ip = (const BYTE*) cSrc;
-
-    size_t hSize = HUF_readDTableX4_wksp(dctx, cSrc, cSrcSize,
-                                         workSpace, wkspSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize; cSrcSize -= hSize;
-
-    return HUF_decompress4X4_usingDTable_internal(dst, dstSize, ip, cSrcSize, dctx);
-}
-
-
-size_t HUF_decompress4X4_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize,
-                              const void* cSrc, size_t cSrcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_decompress4X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
-                                       workSpace, sizeof(workSpace));
-}
-
-size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_TABLELOG_MAX);
-    return HUF_decompress4X4_DCtx(DTable, dst, dstSize, cSrc, cSrcSize);
-}
-
-
-/* ********************************/
-/* Generic decompression selector */
-/* ********************************/
-
-size_t HUF_decompress1X_usingDTable(void* dst, size_t maxDstSize,
-                                    const void* cSrc, size_t cSrcSize,
-                                    const HUF_DTable* DTable)
-{
-    DTableDesc const dtd = HUF_getDTableDesc(DTable);
-    return dtd.tableType ? HUF_decompress1X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
-                           HUF_decompress1X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
-}
-
-size_t HUF_decompress4X_usingDTable(void* dst, size_t maxDstSize,
-                                    const void* cSrc, size_t cSrcSize,
-                                    const HUF_DTable* DTable)
-{
-    DTableDesc const dtd = HUF_getDTableDesc(DTable);
-    return dtd.tableType ? HUF_decompress4X4_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable) :
-                           HUF_decompress4X2_usingDTable_internal(dst, maxDstSize, cSrc, cSrcSize, DTable);
-}
-
-
-typedef struct { U32 tableTime; U32 decode256Time; } algo_time_t;
-static const algo_time_t algoTime[16 /* Quantization */][3 /* single, double, quad */] =
-{
-    /* single, double, quad */
-    {{0,0}, {1,1}, {2,2}},  /* Q==0 : impossible */
-    {{0,0}, {1,1}, {2,2}},  /* Q==1 : impossible */
-    {{  38,130}, {1313, 74}, {2151, 38}},   /* Q == 2 : 12-18% */
-    {{ 448,128}, {1353, 74}, {2238, 41}},   /* Q == 3 : 18-25% */
-    {{ 556,128}, {1353, 74}, {2238, 47}},   /* Q == 4 : 25-32% */
-    {{ 714,128}, {1418, 74}, {2436, 53}},   /* Q == 5 : 32-38% */
-    {{ 883,128}, {1437, 74}, {2464, 61}},   /* Q == 6 : 38-44% */
-    {{ 897,128}, {1515, 75}, {2622, 68}},   /* Q == 7 : 44-50% */
-    {{ 926,128}, {1613, 75}, {2730, 75}},   /* Q == 8 : 50-56% */
-    {{ 947,128}, {1729, 77}, {3359, 77}},   /* Q == 9 : 56-62% */
-    {{1107,128}, {2083, 81}, {4006, 84}},   /* Q ==10 : 62-69% */
-    {{1177,128}, {2379, 87}, {4785, 88}},   /* Q ==11 : 69-75% */
-    {{1242,128}, {2415, 93}, {5155, 84}},   /* Q ==12 : 75-81% */
-    {{1349,128}, {2644,106}, {5260,106}},   /* Q ==13 : 81-87% */
-    {{1455,128}, {2422,124}, {4174,124}},   /* Q ==14 : 87-93% */
-    {{ 722,128}, {1891,145}, {1936,146}},   /* Q ==15 : 93-99% */
-};
-
-/** HUF_selectDecoder() :
-*   Tells which decoder is likely to decode faster,
-*   based on a set of pre-determined metrics.
-*   @return : 0==HUF_decompress4X2, 1==HUF_decompress4X4 .
-*   Assumption : 0 < cSrcSize, dstSize <= 128 KB */
-U32 HUF_selectDecoder (size_t dstSize, size_t cSrcSize)
-{
-    /* decoder timing evaluation */
-    U32 const Q = cSrcSize >= dstSize ? 15 : (U32)(cSrcSize * 16 / dstSize);   /* Q < 16 */
-    U32 const D256 = (U32)(dstSize >> 8);
-    U32 const DTime0 = algoTime[Q][0].tableTime + (algoTime[Q][0].decode256Time * D256);
-    U32 DTime1 = algoTime[Q][1].tableTime + (algoTime[Q][1].decode256Time * D256);
-    DTime1 += DTime1 >> 3;  /* advantage to algorithm using less memory, for cache eviction */
-
-    return DTime1 < DTime0;
-}
-
-
-typedef size_t (*decompressionAlgo)(void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize);
-
-size_t HUF_decompress (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    static const decompressionAlgo decompress[2] = { HUF_decompress4X2, HUF_decompress4X4 };
-
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
-
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return decompress[algoNb](dst, dstSize, cSrc, cSrcSize);
-    }
-}
-
-size_t HUF_decompress4X_DCtx (HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
-
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return algoNb ? HUF_decompress4X4_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) :
-                        HUF_decompress4X2_DCtx(dctx, dst, dstSize, cSrc, cSrcSize) ;
-    }
-}
-
-size_t HUF_decompress4X_hufOnly(HUF_DTable* dctx, void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_decompress4X_hufOnly_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
-                                         workSpace, sizeof(workSpace));
-}
-
-
-size_t HUF_decompress4X_hufOnly_wksp(HUF_DTable* dctx, void* dst,
-                                     size_t dstSize, const void* cSrc,
-                                     size_t cSrcSize, void* workSpace,
-                                     size_t wkspSize)
-{
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize == 0) return ERROR(corruption_detected);
-
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return algoNb ? HUF_decompress4X4_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize):
-                        HUF_decompress4X2_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize, workSpace, wkspSize);
-    }
-}
-
-size_t HUF_decompress1X_DCtx_wksp(HUF_DTable* dctx, void* dst, size_t dstSize,
-                                  const void* cSrc, size_t cSrcSize,
-                                  void* workSpace, size_t wkspSize)
-{
-    /* validation checks */
-    if (dstSize == 0) return ERROR(dstSize_tooSmall);
-    if (cSrcSize > dstSize) return ERROR(corruption_detected);   /* invalid */
-    if (cSrcSize == dstSize) { memcpy(dst, cSrc, dstSize); return dstSize; }   /* not compressed */
-    if (cSrcSize == 1) { memset(dst, *(const BYTE*)cSrc, dstSize); return dstSize; }   /* RLE */
-
-    {   U32 const algoNb = HUF_selectDecoder(dstSize, cSrcSize);
-        return algoNb ? HUF_decompress1X4_DCtx_wksp(dctx, dst, dstSize, cSrc,
-                                cSrcSize, workSpace, wkspSize):
-                        HUF_decompress1X2_DCtx_wksp(dctx, dst, dstSize, cSrc,
-                                cSrcSize, workSpace, wkspSize);
-    }
-}
-
-size_t HUF_decompress1X_DCtx(HUF_DTable* dctx, void* dst, size_t dstSize,
-                             const void* cSrc, size_t cSrcSize)
-{
-    U32 workSpace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    return HUF_decompress1X_DCtx_wksp(dctx, dst, dstSize, cSrc, cSrcSize,
-                                      workSpace, sizeof(workSpace));
-}
diff --git a/priv/zstd/lib/decompress/zstd_decompress.c b/priv/zstd/lib/decompress/zstd_decompress.c
deleted file mode 100644
index a59d944..0000000
--- a/priv/zstd/lib/decompress/zstd_decompress.c
+++ /dev/null
@@ -1,2665 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/* ***************************************************************
-*  Tuning parameters
-*****************************************************************/
-/*!
- * HEAPMODE :
- * Select how default decompression function ZSTD_decompress() will allocate memory,
- * in memory stack (0), or in memory heap (1, requires malloc())
- */
-#ifndef ZSTD_HEAPMODE
-#  define ZSTD_HEAPMODE 1
-#endif
-
-/*!
-*  LEGACY_SUPPORT :
-*  if set to 1, ZSTD_decompress() can decode older formats (v0.1+)
-*/
-#ifndef ZSTD_LEGACY_SUPPORT
-#  define ZSTD_LEGACY_SUPPORT 0
-#endif
-
-/*!
-*  MAXWINDOWSIZE_DEFAULT :
-*  maximum window size accepted by DStream, by default.
-*  Frames requiring more memory will be rejected.
-*/
-#ifndef ZSTD_MAXWINDOWSIZE_DEFAULT
-#  define ZSTD_MAXWINDOWSIZE_DEFAULT (((U32)1 << ZSTD_WINDOWLOG_DEFAULTMAX) + 1)
-#endif
-
-
-/*-*******************************************************
-*  Dependencies
-*********************************************************/
-#include       /* memcpy, memmove, memset */
-#include "mem.h"         /* low level memory routines */
-#define FSE_STATIC_LINKING_ONLY
-#include "fse.h"
-#define HUF_STATIC_LINKING_ONLY
-#include "huf.h"
-#include "zstd_internal.h"
-
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-#  include "zstd_legacy.h"
-#endif
-
-
-/*-*************************************
-*  Errors
-***************************************/
-#define ZSTD_isError ERR_isError   /* for inlining */
-#define FSE_isError  ERR_isError
-#define HUF_isError  ERR_isError
-
-
-/*_*******************************************************
-*  Memory operations
-**********************************************************/
-static void ZSTD_copy4(void* dst, const void* src) { memcpy(dst, src, 4); }
-
-
-/*-*************************************************************
-*   Context management
-***************************************************************/
-typedef enum { ZSTDds_getFrameHeaderSize, ZSTDds_decodeFrameHeader,
-               ZSTDds_decodeBlockHeader, ZSTDds_decompressBlock,
-               ZSTDds_decompressLastBlock, ZSTDds_checkChecksum,
-               ZSTDds_decodeSkippableHeader, ZSTDds_skipFrame } ZSTD_dStage;
-
-typedef enum { zdss_init=0, zdss_loadHeader,
-               zdss_read, zdss_load, zdss_flush } ZSTD_dStreamStage;
-
-typedef struct {
-    FSE_DTable LLTable[FSE_DTABLE_SIZE_U32(LLFSELog)];
-    FSE_DTable OFTable[FSE_DTABLE_SIZE_U32(OffFSELog)];
-    FSE_DTable MLTable[FSE_DTABLE_SIZE_U32(MLFSELog)];
-    HUF_DTable hufTable[HUF_DTABLE_SIZE(HufLog)];  /* can accommodate HUF_decompress4X */
-    U32 workspace[HUF_DECOMPRESS_WORKSPACE_SIZE_U32];
-    U32 rep[ZSTD_REP_NUM];
-} ZSTD_entropyDTables_t;
-
-struct ZSTD_DCtx_s
-{
-    const FSE_DTable* LLTptr;
-    const FSE_DTable* MLTptr;
-    const FSE_DTable* OFTptr;
-    const HUF_DTable* HUFptr;
-    ZSTD_entropyDTables_t entropy;
-    const void* previousDstEnd;   /* detect continuity */
-    const void* base;             /* start of current segment */
-    const void* vBase;            /* virtual start of previous segment if it was just before current one */
-    const void* dictEnd;          /* end of previous segment */
-    size_t expected;
-    ZSTD_frameHeader fParams;
-    U64 decodedSize;
-    blockType_e bType;            /* used in ZSTD_decompressContinue(), store blockType between block header decoding and block decompression stages */
-    ZSTD_dStage stage;
-    U32 litEntropy;
-    U32 fseEntropy;
-    XXH64_state_t xxhState;
-    size_t headerSize;
-    U32 dictID;
-    ZSTD_format_e format;
-    const BYTE* litPtr;
-    ZSTD_customMem customMem;
-    size_t litSize;
-    size_t rleSize;
-    size_t staticSize;
-
-    /* streaming */
-    ZSTD_DDict* ddictLocal;
-    const ZSTD_DDict* ddict;
-    ZSTD_dStreamStage streamStage;
-    char*  inBuff;
-    size_t inBuffSize;
-    size_t inPos;
-    size_t maxWindowSize;
-    char*  outBuff;
-    size_t outBuffSize;
-    size_t outStart;
-    size_t outEnd;
-    size_t lhSize;
-    void* legacyContext;
-    U32 previousLegacyVersion;
-    U32 legacyVersion;
-    U32 hostageByte;
-
-    /* workspace */
-    BYTE litBuffer[ZSTD_BLOCKSIZE_MAX + WILDCOPY_OVERLENGTH];
-    BYTE headerBuffer[ZSTD_FRAMEHEADERSIZE_MAX];
-};  /* typedef'd to ZSTD_DCtx within "zstd.h" */
-
-size_t ZSTD_sizeof_DCtx (const ZSTD_DCtx* dctx)
-{
-    if (dctx==NULL) return 0;   /* support sizeof NULL */
-    return sizeof(*dctx)
-           + ZSTD_sizeof_DDict(dctx->ddictLocal)
-           + dctx->inBuffSize + dctx->outBuffSize;
-}
-
-size_t ZSTD_estimateDCtxSize(void) { return sizeof(ZSTD_DCtx); }
-
-
-static size_t ZSTD_startingInputLength(ZSTD_format_e format)
-{
-    size_t const startingInputLength = (format==ZSTD_f_zstd1_magicless) ?
-                    ZSTD_frameHeaderSize_prefix - ZSTD_frameIdSize :
-                    ZSTD_frameHeaderSize_prefix;
-    ZSTD_STATIC_ASSERT(ZSTD_FRAMEHEADERSIZE_PREFIX >= ZSTD_FRAMEIDSIZE);
-    /* only supports formats ZSTD_f_zstd1 and ZSTD_f_zstd1_magicless */
-    assert( (format == ZSTD_f_zstd1) || (format == ZSTD_f_zstd1_magicless) );
-    return startingInputLength;
-}
-
-static void ZSTD_initDCtx_internal(ZSTD_DCtx* dctx)
-{
-    dctx->format = ZSTD_f_zstd1;  /* ZSTD_decompressBegin() invokes ZSTD_startingInputLength() with argument dctx->format */
-    dctx->staticSize  = 0;
-    dctx->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
-    dctx->ddict       = NULL;
-    dctx->ddictLocal  = NULL;
-    dctx->inBuff      = NULL;
-    dctx->inBuffSize  = 0;
-    dctx->outBuffSize = 0;
-    dctx->streamStage = zdss_init;
-}
-
-ZSTD_DCtx* ZSTD_initStaticDCtx(void *workspace, size_t workspaceSize)
-{
-    ZSTD_DCtx* const dctx = (ZSTD_DCtx*) workspace;
-
-    if ((size_t)workspace & 7) return NULL;  /* 8-aligned */
-    if (workspaceSize < sizeof(ZSTD_DCtx)) return NULL;  /* minimum size */
-
-    ZSTD_initDCtx_internal(dctx);
-    dctx->staticSize = workspaceSize;
-    dctx->inBuff = (char*)(dctx+1);
-    return dctx;
-}
-
-ZSTD_DCtx* ZSTD_createDCtx_advanced(ZSTD_customMem customMem)
-{
-    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
-
-    {   ZSTD_DCtx* const dctx = (ZSTD_DCtx*)ZSTD_malloc(sizeof(*dctx), customMem);
-        if (!dctx) return NULL;
-        dctx->customMem = customMem;
-        dctx->legacyContext = NULL;
-        dctx->previousLegacyVersion = 0;
-        ZSTD_initDCtx_internal(dctx);
-        return dctx;
-    }
-}
-
-ZSTD_DCtx* ZSTD_createDCtx(void)
-{
-    return ZSTD_createDCtx_advanced(ZSTD_defaultCMem);
-}
-
-size_t ZSTD_freeDCtx(ZSTD_DCtx* dctx)
-{
-    if (dctx==NULL) return 0;   /* support free on NULL */
-    if (dctx->staticSize) return ERROR(memory_allocation);   /* not compatible with static DCtx */
-    {   ZSTD_customMem const cMem = dctx->customMem;
-        ZSTD_freeDDict(dctx->ddictLocal);
-        dctx->ddictLocal = NULL;
-        ZSTD_free(dctx->inBuff, cMem);
-        dctx->inBuff = NULL;
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-        if (dctx->legacyContext)
-            ZSTD_freeLegacyStreamContext(dctx->legacyContext, dctx->previousLegacyVersion);
-#endif
-        ZSTD_free(dctx, cMem);
-        return 0;
-    }
-}
-
-/* no longer useful */
-void ZSTD_copyDCtx(ZSTD_DCtx* dstDCtx, const ZSTD_DCtx* srcDCtx)
-{
-    size_t const toCopy = (size_t)((char*)(&dstDCtx->inBuff) - (char*)dstDCtx);
-    memcpy(dstDCtx, srcDCtx, toCopy);  /* no need to copy workspace */
-}
-
-
-/*-*************************************************************
-*   Decompression section
-***************************************************************/
-
-/*! ZSTD_isFrame() :
- *  Tells if the content of `buffer` starts with a valid Frame Identifier.
- *  Note : Frame Identifier is 4 bytes. If `size < 4`, @return will always be 0.
- *  Note 2 : Legacy Frame Identifiers are considered valid only if Legacy Support is enabled.
- *  Note 3 : Skippable Frame Identifiers are considered valid. */
-unsigned ZSTD_isFrame(const void* buffer, size_t size)
-{
-    if (size < ZSTD_frameIdSize) return 0;
-    {   U32 const magic = MEM_readLE32(buffer);
-        if (magic == ZSTD_MAGICNUMBER) return 1;
-        if ((magic & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) return 1;
-    }
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-    if (ZSTD_isLegacy(buffer, size)) return 1;
-#endif
-    return 0;
-}
-
-/** ZSTD_frameHeaderSize_internal() :
- *  srcSize must be large enough to reach header size fields.
- *  note : only works for formats ZSTD_f_zstd1 and ZSTD_f_zstd1_magicless
- * @return : size of the Frame Header
- *           or an error code, which can be tested with ZSTD_isError() */
-static size_t ZSTD_frameHeaderSize_internal(const void* src, size_t srcSize, ZSTD_format_e format)
-{
-    size_t const minInputSize = ZSTD_startingInputLength(format);
-    if (srcSize < minInputSize) return ERROR(srcSize_wrong);
-
-    {   BYTE const fhd = ((const BYTE*)src)[minInputSize-1];
-        U32 const dictID= fhd & 3;
-        U32 const singleSegment = (fhd >> 5) & 1;
-        U32 const fcsId = fhd >> 6;
-        return minInputSize + !singleSegment
-             + ZSTD_did_fieldSize[dictID] + ZSTD_fcs_fieldSize[fcsId]
-             + (singleSegment && !fcsId);
-    }
-}
-
-/** ZSTD_frameHeaderSize() :
- *  srcSize must be >= ZSTD_frameHeaderSize_prefix.
- * @return : size of the Frame Header */
-size_t ZSTD_frameHeaderSize(const void* src, size_t srcSize)
-{
-    return ZSTD_frameHeaderSize_internal(src, srcSize, ZSTD_f_zstd1);
-}
-
-
-/** ZSTD_getFrameHeader_internal() :
- *  decode Frame Header, or require larger `srcSize`.
- *  note : only works for formats ZSTD_f_zstd1 and ZSTD_f_zstd1_magicless
- * @return : 0, `zfhPtr` is correctly filled,
- *          >0, `srcSize` is too small, value is wanted `srcSize` amount,
- *           or an error code, which can be tested using ZSTD_isError() */
-static size_t ZSTD_getFrameHeader_internal(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize, ZSTD_format_e format)
-{
-    const BYTE* ip = (const BYTE*)src;
-    size_t const minInputSize = ZSTD_startingInputLength(format);
-
-    if (srcSize < minInputSize) return minInputSize;
-
-    if ( (format != ZSTD_f_zstd1_magicless)
-      && (MEM_readLE32(src) != ZSTD_MAGICNUMBER) ) {
-        if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-            /* skippable frame */
-            if (srcSize < ZSTD_skippableHeaderSize)
-                return ZSTD_skippableHeaderSize; /* magic number + frame length */
-            memset(zfhPtr, 0, sizeof(*zfhPtr));
-            zfhPtr->frameContentSize = MEM_readLE32((const char *)src + ZSTD_frameIdSize);
-            zfhPtr->frameType = ZSTD_skippableFrame;
-            return 0;
-        }
-        return ERROR(prefix_unknown);
-    }
-
-    /* ensure there is enough `srcSize` to fully read/decode frame header */
-    {   size_t const fhsize = ZSTD_frameHeaderSize_internal(src, srcSize, format);
-        if (srcSize < fhsize) return fhsize;
-        zfhPtr->headerSize = (U32)fhsize;
-    }
-
-    {   BYTE const fhdByte = ip[minInputSize-1];
-        size_t pos = minInputSize;
-        U32 const dictIDSizeCode = fhdByte&3;
-        U32 const checksumFlag = (fhdByte>>2)&1;
-        U32 const singleSegment = (fhdByte>>5)&1;
-        U32 const fcsID = fhdByte>>6;
-        U64 windowSize = 0;
-        U32 dictID = 0;
-        U64 frameContentSize = ZSTD_CONTENTSIZE_UNKNOWN;
-        if ((fhdByte & 0x08) != 0)
-            return ERROR(frameParameter_unsupported); /* reserved bits, must be zero */
-
-        if (!singleSegment) {
-            BYTE const wlByte = ip[pos++];
-            U32 const windowLog = (wlByte >> 3) + ZSTD_WINDOWLOG_ABSOLUTEMIN;
-            if (windowLog > ZSTD_WINDOWLOG_MAX)
-                return ERROR(frameParameter_windowTooLarge);
-            windowSize = (1ULL << windowLog);
-            windowSize += (windowSize >> 3) * (wlByte&7);
-        }
-        switch(dictIDSizeCode)
-        {
-            default: assert(0);  /* impossible */
-            case 0 : break;
-            case 1 : dictID = ip[pos]; pos++; break;
-            case 2 : dictID = MEM_readLE16(ip+pos); pos+=2; break;
-            case 3 : dictID = MEM_readLE32(ip+pos); pos+=4; break;
-        }
-        switch(fcsID)
-        {
-            default: assert(0);  /* impossible */
-            case 0 : if (singleSegment) frameContentSize = ip[pos]; break;
-            case 1 : frameContentSize = MEM_readLE16(ip+pos)+256; break;
-            case 2 : frameContentSize = MEM_readLE32(ip+pos); break;
-            case 3 : frameContentSize = MEM_readLE64(ip+pos); break;
-        }
-        if (singleSegment) windowSize = frameContentSize;
-
-        zfhPtr->frameType = ZSTD_frame;
-        zfhPtr->frameContentSize = frameContentSize;
-        zfhPtr->windowSize = windowSize;
-        zfhPtr->blockSizeMax = (unsigned) MIN(windowSize, ZSTD_BLOCKSIZE_MAX);
-        zfhPtr->dictID = dictID;
-        zfhPtr->checksumFlag = checksumFlag;
-    }
-    return 0;
-}
-
-/** ZSTD_getFrameHeader() :
- *  decode Frame Header, or require larger `srcSize`.
- *  note : this function does not consume input, it only reads it.
- * @return : 0, `zfhPtr` is correctly filled,
- *          >0, `srcSize` is too small, value is wanted `srcSize` amount,
- *           or an error code, which can be tested using ZSTD_isError() */
-size_t ZSTD_getFrameHeader(ZSTD_frameHeader* zfhPtr, const void* src, size_t srcSize)
-{
-    return ZSTD_getFrameHeader_internal(zfhPtr, src, srcSize, ZSTD_f_zstd1);
-}
-
-
-/** ZSTD_getFrameContentSize() :
- *  compatible with legacy mode
- * @return : decompressed size of the single frame pointed to be `src` if known, otherwise
- *         - ZSTD_CONTENTSIZE_UNKNOWN if the size cannot be determined
- *         - ZSTD_CONTENTSIZE_ERROR if an error occurred (e.g. invalid magic number, srcSize too small) */
-unsigned long long ZSTD_getFrameContentSize(const void *src, size_t srcSize)
-{
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-    if (ZSTD_isLegacy(src, srcSize)) {
-        unsigned long long const ret = ZSTD_getDecompressedSize_legacy(src, srcSize);
-        return ret == 0 ? ZSTD_CONTENTSIZE_UNKNOWN : ret;
-    }
-#endif
-    {   ZSTD_frameHeader zfh;
-        if (ZSTD_getFrameHeader(&zfh, src, srcSize) != 0)
-            return ZSTD_CONTENTSIZE_ERROR;
-        if (zfh.frameType == ZSTD_skippableFrame) {
-            return 0;
-        } else {
-            return zfh.frameContentSize;
-    }   }
-}
-
-/** ZSTD_findDecompressedSize() :
- *  compatible with legacy mode
- *  `srcSize` must be the exact length of some number of ZSTD compressed and/or
- *      skippable frames
- *  @return : decompressed size of the frames contained */
-unsigned long long ZSTD_findDecompressedSize(const void* src, size_t srcSize)
-{
-    unsigned long long totalDstSize = 0;
-
-    while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-        U32 const magicNumber = MEM_readLE32(src);
-
-        if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-            size_t skippableSize;
-            if (srcSize < ZSTD_skippableHeaderSize)
-                return ERROR(srcSize_wrong);
-            skippableSize = MEM_readLE32((const BYTE *)src + ZSTD_frameIdSize)
-                          + ZSTD_skippableHeaderSize;
-            if (srcSize < skippableSize) {
-                return ZSTD_CONTENTSIZE_ERROR;
-            }
-
-            src = (const BYTE *)src + skippableSize;
-            srcSize -= skippableSize;
-            continue;
-        }
-
-        {   unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-            if (ret >= ZSTD_CONTENTSIZE_ERROR) return ret;
-
-            /* check for overflow */
-            if (totalDstSize + ret < totalDstSize) return ZSTD_CONTENTSIZE_ERROR;
-            totalDstSize += ret;
-        }
-        {   size_t const frameSrcSize = ZSTD_findFrameCompressedSize(src, srcSize);
-            if (ZSTD_isError(frameSrcSize)) {
-                return ZSTD_CONTENTSIZE_ERROR;
-            }
-
-            src = (const BYTE *)src + frameSrcSize;
-            srcSize -= frameSrcSize;
-        }
-    }  /* while (srcSize >= ZSTD_frameHeaderSize_prefix) */
-
-    if (srcSize) return ZSTD_CONTENTSIZE_ERROR;
-
-    return totalDstSize;
-}
-
-/** ZSTD_getDecompressedSize() :
-*   compatible with legacy mode
-*   @return : decompressed size if known, 0 otherwise
-              note : 0 can mean any of the following :
-                   - frame content is empty
-                   - decompressed size field is not present in frame header
-                   - frame header unknown / not supported
-                   - frame header not complete (`srcSize` too small) */
-unsigned long long ZSTD_getDecompressedSize(const void* src, size_t srcSize)
-{
-    unsigned long long const ret = ZSTD_getFrameContentSize(src, srcSize);
-    ZSTD_STATIC_ASSERT(ZSTD_CONTENTSIZE_ERROR < ZSTD_CONTENTSIZE_UNKNOWN);
-    return (ret >= ZSTD_CONTENTSIZE_ERROR) ? 0 : ret;
-}
-
-
-/** ZSTD_decodeFrameHeader() :
-*   `headerSize` must be the size provided by ZSTD_frameHeaderSize().
-*   @return : 0 if success, or an error code, which can be tested using ZSTD_isError() */
-static size_t ZSTD_decodeFrameHeader(ZSTD_DCtx* dctx, const void* src, size_t headerSize)
-{
-    size_t const result = ZSTD_getFrameHeader_internal(&(dctx->fParams), src, headerSize, dctx->format);
-    if (ZSTD_isError(result)) return result;    /* invalid header */
-    if (result>0) return ERROR(srcSize_wrong);  /* headerSize too small */
-    if (dctx->fParams.dictID && (dctx->dictID != dctx->fParams.dictID))
-        return ERROR(dictionary_wrong);
-    if (dctx->fParams.checksumFlag) XXH64_reset(&dctx->xxhState, 0);
-    return 0;
-}
-
-
-/*! ZSTD_getcBlockSize() :
-*   Provides the size of compressed block from block header `src` */
-size_t ZSTD_getcBlockSize(const void* src, size_t srcSize,
-                          blockProperties_t* bpPtr)
-{
-    if (srcSize < ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
-    {   U32 const cBlockHeader = MEM_readLE24(src);
-        U32 const cSize = cBlockHeader >> 3;
-        bpPtr->lastBlock = cBlockHeader & 1;
-        bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3);
-        bpPtr->origSize = cSize;   /* only useful for RLE */
-        if (bpPtr->blockType == bt_rle) return 1;
-        if (bpPtr->blockType == bt_reserved) return ERROR(corruption_detected);
-        return cSize;
-    }
-}
-
-
-static size_t ZSTD_copyRawBlock(void* dst, size_t dstCapacity,
-                          const void* src, size_t srcSize)
-{
-    if (srcSize > dstCapacity) return ERROR(dstSize_tooSmall);
-    memcpy(dst, src, srcSize);
-    return srcSize;
-}
-
-
-static size_t ZSTD_setRleBlock(void* dst, size_t dstCapacity,
-                         const void* src, size_t srcSize,
-                               size_t regenSize)
-{
-    if (srcSize != 1) return ERROR(srcSize_wrong);
-    if (regenSize > dstCapacity) return ERROR(dstSize_tooSmall);
-    memset(dst, *(const BYTE*)src, regenSize);
-    return regenSize;
-}
-
-/*! ZSTD_decodeLiteralsBlock() :
- * @return : nb of bytes read from src (< srcSize )
- *  note : symbol not declared but exposed for fullbench */
-size_t ZSTD_decodeLiteralsBlock(ZSTD_DCtx* dctx,
-                          const void* src, size_t srcSize)   /* note : srcSize < BLOCKSIZE */
-{
-    if (srcSize < MIN_CBLOCK_SIZE) return ERROR(corruption_detected);
-
-    {   const BYTE* const istart = (const BYTE*) src;
-        symbolEncodingType_e const litEncType = (symbolEncodingType_e)(istart[0] & 3);
-
-        switch(litEncType)
-        {
-        case set_repeat:
-            if (dctx->litEntropy==0) return ERROR(dictionary_corrupted);
-            /* fall-through */
-        case set_compressed:
-            if (srcSize < 5) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need up to 5 for case 3 */
-            {   size_t lhSize, litSize, litCSize;
-                U32 singleStream=0;
-                U32 const lhlCode = (istart[0] >> 2) & 3;
-                U32 const lhc = MEM_readLE32(istart);
-                switch(lhlCode)
-                {
-                case 0: case 1: default:   /* note : default is impossible, since lhlCode into [0..3] */
-                    /* 2 - 2 - 10 - 10 */
-                    singleStream = !lhlCode;
-                    lhSize = 3;
-                    litSize  = (lhc >> 4) & 0x3FF;
-                    litCSize = (lhc >> 14) & 0x3FF;
-                    break;
-                case 2:
-                    /* 2 - 2 - 14 - 14 */
-                    lhSize = 4;
-                    litSize  = (lhc >> 4) & 0x3FFF;
-                    litCSize = lhc >> 18;
-                    break;
-                case 3:
-                    /* 2 - 2 - 18 - 18 */
-                    lhSize = 5;
-                    litSize  = (lhc >> 4) & 0x3FFFF;
-                    litCSize = (lhc >> 22) + (istart[4] << 10);
-                    break;
-                }
-                if (litSize > ZSTD_BLOCKSIZE_MAX) return ERROR(corruption_detected);
-                if (litCSize + lhSize > srcSize) return ERROR(corruption_detected);
-
-                if (HUF_isError((litEncType==set_repeat) ?
-                                    ( singleStream ?
-                                        HUF_decompress1X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) :
-                                        HUF_decompress4X_usingDTable(dctx->litBuffer, litSize, istart+lhSize, litCSize, dctx->HUFptr) ) :
-                                    ( singleStream ?
-                                        HUF_decompress1X2_DCtx_wksp(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize,
-                                                                    dctx->entropy.workspace, sizeof(dctx->entropy.workspace)) :
-                                        HUF_decompress4X_hufOnly_wksp(dctx->entropy.hufTable, dctx->litBuffer, litSize, istart+lhSize, litCSize,
-                                                                      dctx->entropy.workspace, sizeof(dctx->entropy.workspace)))))
-                    return ERROR(corruption_detected);
-
-                dctx->litPtr = dctx->litBuffer;
-                dctx->litSize = litSize;
-                dctx->litEntropy = 1;
-                if (litEncType==set_compressed) dctx->HUFptr = dctx->entropy.hufTable;
-                memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-                return litCSize + lhSize;
-            }
-
-        case set_basic:
-            {   size_t litSize, lhSize;
-                U32 const lhlCode = ((istart[0]) >> 2) & 3;
-                switch(lhlCode)
-                {
-                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
-                    lhSize = 1;
-                    litSize = istart[0] >> 3;
-                    break;
-                case 1:
-                    lhSize = 2;
-                    litSize = MEM_readLE16(istart) >> 4;
-                    break;
-                case 3:
-                    lhSize = 3;
-                    litSize = MEM_readLE24(istart) >> 4;
-                    break;
-                }
-
-                if (lhSize+litSize+WILDCOPY_OVERLENGTH > srcSize) {  /* risk reading beyond src buffer with wildcopy */
-                    if (litSize+lhSize > srcSize) return ERROR(corruption_detected);
-                    memcpy(dctx->litBuffer, istart+lhSize, litSize);
-                    dctx->litPtr = dctx->litBuffer;
-                    dctx->litSize = litSize;
-                    memset(dctx->litBuffer + dctx->litSize, 0, WILDCOPY_OVERLENGTH);
-                    return lhSize+litSize;
-                }
-                /* direct reference into compressed stream */
-                dctx->litPtr = istart+lhSize;
-                dctx->litSize = litSize;
-                return lhSize+litSize;
-            }
-
-        case set_rle:
-            {   U32 const lhlCode = ((istart[0]) >> 2) & 3;
-                size_t litSize, lhSize;
-                switch(lhlCode)
-                {
-                case 0: case 2: default:   /* note : default is impossible, since lhlCode into [0..3] */
-                    lhSize = 1;
-                    litSize = istart[0] >> 3;
-                    break;
-                case 1:
-                    lhSize = 2;
-                    litSize = MEM_readLE16(istart) >> 4;
-                    break;
-                case 3:
-                    lhSize = 3;
-                    litSize = MEM_readLE24(istart) >> 4;
-                    if (srcSize<4) return ERROR(corruption_detected);   /* srcSize >= MIN_CBLOCK_SIZE == 3; here we need lhSize+1 = 4 */
-                    break;
-                }
-                if (litSize > ZSTD_BLOCKSIZE_MAX) return ERROR(corruption_detected);
-                memset(dctx->litBuffer, istart[lhSize], litSize + WILDCOPY_OVERLENGTH);
-                dctx->litPtr = dctx->litBuffer;
-                dctx->litSize = litSize;
-                return lhSize+1;
-            }
-        default:
-            return ERROR(corruption_detected);   /* impossible */
-        }
-    }
-}
-
-
-typedef union {
-    FSE_decode_t realData;
-    U32 alignedBy4;
-} FSE_decode_t4;
-
-/* Default FSE distribution table for Literal Lengths */
-static const FSE_decode_t4 LL_defaultDTable[(1< max) return ERROR(corruption_detected);
-        FSE_buildDTable_rle(DTableSpace, *(const BYTE*)src);
-        *DTablePtr = DTableSpace;
-        return 1;
-    case set_basic :
-        *DTablePtr = (const FSE_DTable*)tmpPtr;
-        return 0;
-    case set_repeat:
-        if (!flagRepeatTable) return ERROR(corruption_detected);
-        return 0;
-    default :   /* impossible */
-    case set_compressed :
-        {   U32 tableLog;
-            S16 norm[MaxSeq+1];
-            size_t const headerSize = FSE_readNCount(norm, &max, &tableLog, src, srcSize);
-            if (FSE_isError(headerSize)) return ERROR(corruption_detected);
-            if (tableLog > maxLog) return ERROR(corruption_detected);
-            FSE_buildDTable(DTableSpace, norm, max, tableLog);
-            *DTablePtr = DTableSpace;
-            return headerSize;
-    }   }
-}
-
-size_t ZSTD_decodeSeqHeaders(ZSTD_DCtx* dctx, int* nbSeqPtr,
-                             const void* src, size_t srcSize)
-{
-    const BYTE* const istart = (const BYTE* const)src;
-    const BYTE* const iend = istart + srcSize;
-    const BYTE* ip = istart;
-    DEBUGLOG(5, "ZSTD_decodeSeqHeaders");
-
-    /* check */
-    if (srcSize < MIN_SEQUENCES_SIZE) return ERROR(srcSize_wrong);
-
-    /* SeqHead */
-    {   int nbSeq = *ip++;
-        if (!nbSeq) { *nbSeqPtr=0; return 1; }
-        if (nbSeq > 0x7F) {
-            if (nbSeq == 0xFF) {
-                if (ip+2 > iend) return ERROR(srcSize_wrong);
-                nbSeq = MEM_readLE16(ip) + LONGNBSEQ, ip+=2;
-            } else {
-                if (ip >= iend) return ERROR(srcSize_wrong);
-                nbSeq = ((nbSeq-0x80)<<8) + *ip++;
-            }
-        }
-        *nbSeqPtr = nbSeq;
-    }
-
-    /* FSE table descriptors */
-    if (ip+4 > iend) return ERROR(srcSize_wrong); /* minimum possible size */
-    {   symbolEncodingType_e const LLtype = (symbolEncodingType_e)(*ip >> 6);
-        symbolEncodingType_e const OFtype = (symbolEncodingType_e)((*ip >> 4) & 3);
-        symbolEncodingType_e const MLtype = (symbolEncodingType_e)((*ip >> 2) & 3);
-        ip++;
-
-        /* Build DTables */
-        {   size_t const llhSize = ZSTD_buildSeqTable(dctx->entropy.LLTable, &dctx->LLTptr,
-                                                      LLtype, MaxLL, LLFSELog,
-                                                      ip, iend-ip, LL_defaultDTable, dctx->fseEntropy);
-            if (ZSTD_isError(llhSize)) return ERROR(corruption_detected);
-            ip += llhSize;
-        }
-        {   size_t const ofhSize = ZSTD_buildSeqTable(dctx->entropy.OFTable, &dctx->OFTptr,
-                                                      OFtype, MaxOff, OffFSELog,
-                                                      ip, iend-ip, OF_defaultDTable, dctx->fseEntropy);
-            if (ZSTD_isError(ofhSize)) return ERROR(corruption_detected);
-            ip += ofhSize;
-        }
-        {   size_t const mlhSize = ZSTD_buildSeqTable(dctx->entropy.MLTable, &dctx->MLTptr,
-                                                      MLtype, MaxML, MLFSELog,
-                                                      ip, iend-ip, ML_defaultDTable, dctx->fseEntropy);
-            if (ZSTD_isError(mlhSize)) return ERROR(corruption_detected);
-            ip += mlhSize;
-        }
-    }
-
-    return ip-istart;
-}
-
-
-typedef struct {
-    size_t litLength;
-    size_t matchLength;
-    size_t offset;
-    const BYTE* match;
-} seq_t;
-
-typedef struct {
-    BIT_DStream_t DStream;
-    FSE_DState_t stateLL;
-    FSE_DState_t stateOffb;
-    FSE_DState_t stateML;
-    size_t prevOffset[ZSTD_REP_NUM];
-    const BYTE* prefixStart;
-    const BYTE* dictEnd;
-    size_t pos;
-} seqState_t;
-
-
-FORCE_NOINLINE
-size_t ZSTD_execSequenceLast7(BYTE* op,
-                              BYTE* const oend, seq_t sequence,
-                              const BYTE** litPtr, const BYTE* const litLimit,
-                              const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
-{
-    BYTE* const oLitEnd = op + sequence.litLength;
-    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
-    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
-    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
-    const BYTE* match = oLitEnd - sequence.offset;
-
-    /* check */
-    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
-    if (oLitEnd <= oend_w) return ERROR(GENERIC);   /* Precondition */
-
-    /* copy literals */
-    if (op < oend_w) {
-        ZSTD_wildcopy(op, *litPtr, oend_w - op);
-        *litPtr += oend_w - op;
-        op = oend_w;
-    }
-    while (op < oLitEnd) *op++ = *(*litPtr)++;
-
-    /* copy Match */
-    if (sequence.offset > (size_t)(oLitEnd - base)) {
-        /* offset beyond prefix */
-        if (sequence.offset > (size_t)(oLitEnd - vBase)) return ERROR(corruption_detected);
-        match = dictEnd - (base-match);
-        if (match + sequence.matchLength <= dictEnd) {
-            memmove(oLitEnd, match, sequence.matchLength);
-            return sequenceLength;
-        }
-        /* span extDict & currentPrefixSegment */
-        {   size_t const length1 = dictEnd - match;
-            memmove(oLitEnd, match, length1);
-            op = oLitEnd + length1;
-            sequence.matchLength -= length1;
-            match = base;
-    }   }
-    while (op < oMatchEnd) *op++ = *match++;
-    return sequenceLength;
-}
-
-
-typedef enum { ZSTD_lo_isRegularOffset, ZSTD_lo_isLongOffset=1 } ZSTD_longOffset_e;
-
-/* We need to add at most (ZSTD_WINDOWLOG_MAX_32 - 1) bits to read the maximum
- * offset bits. But we can only read at most (STREAM_ACCUMULATOR_MIN_32 - 1)
- * bits before reloading. This value is the maximum number of bytes we read
- * after reloading when we are decoding long offets.
- */
-#define LONG_OFFSETS_MAX_EXTRA_BITS_32                                         \
-    (ZSTD_WINDOWLOG_MAX_32 > STREAM_ACCUMULATOR_MIN_32                         \
-        ? ZSTD_WINDOWLOG_MAX_32 - STREAM_ACCUMULATOR_MIN_32                    \
-        : 0)
-
-static seq_t ZSTD_decodeSequence(seqState_t* seqState, const ZSTD_longOffset_e longOffsets)
-{
-    seq_t seq;
-
-    U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-    U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-    U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= MaxOff, by table construction */
-
-    U32 const llBits = LL_bits[llCode];
-    U32 const mlBits = ML_bits[mlCode];
-    U32 const ofBits = ofCode;
-    U32 const totalBits = llBits+mlBits+ofBits;
-
-    static const U32 LL_base[MaxLL+1] = {
-                             0,    1,    2,     3,     4,     5,     6,      7,
-                             8,    9,   10,    11,    12,    13,    14,     15,
-                            16,   18,   20,    22,    24,    28,    32,     40,
-                            48,   64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
-                            0x2000, 0x4000, 0x8000, 0x10000 };
-
-    static const U32 ML_base[MaxML+1] = {
-                             3,  4,  5,    6,     7,     8,     9,    10,
-                            11, 12, 13,   14,    15,    16,    17,    18,
-                            19, 20, 21,   22,    23,    24,    25,    26,
-                            27, 28, 29,   30,    31,    32,    33,    34,
-                            35, 37, 39,   41,    43,    47,    51,    59,
-                            67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
-                            0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
-
-    static const U32 OF_base[MaxOff+1] = {
-                     0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
-                     0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
-                     0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
-                     0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD, 0x1FFFFFFD, 0x3FFFFFFD, 0x7FFFFFFD };
-
-    /* sequence */
-    {   size_t offset;
-        if (!ofCode)
-            offset = 0;
-        else {
-            ZSTD_STATIC_ASSERT(ZSTD_lo_isLongOffset == 1);
-            ZSTD_STATIC_ASSERT(LONG_OFFSETS_MAX_EXTRA_BITS_32 == 5);
-            assert(ofBits <= MaxOff);
-            if (MEM_32bits() && longOffsets) {
-                U32 const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN_32-1);
-                offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
-                if (MEM_32bits() || extraBits) BIT_reloadDStream(&seqState->DStream);
-                if (extraBits) offset += BIT_readBitsFast(&seqState->DStream, extraBits);
-            } else {
-                offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-                if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
-            }
-        }
-
-        if (ofCode <= 1) {
-            offset += (llCode==0);
-            if (offset) {
-                size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-                temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
-                if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
-                seqState->prevOffset[1] = seqState->prevOffset[0];
-                seqState->prevOffset[0] = offset = temp;
-            } else {
-                offset = seqState->prevOffset[0];
-            }
-        } else {
-            seqState->prevOffset[2] = seqState->prevOffset[1];
-            seqState->prevOffset[1] = seqState->prevOffset[0];
-            seqState->prevOffset[0] = offset;
-        }
-        seq.offset = offset;
-    }
-
-    seq.matchLength = ML_base[mlCode]
-                    + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
-    if (MEM_32bits() && (mlBits+llBits >= STREAM_ACCUMULATOR_MIN_32-LONG_OFFSETS_MAX_EXTRA_BITS_32))
-        BIT_reloadDStream(&seqState->DStream);
-    if (MEM_64bits() && (totalBits >= STREAM_ACCUMULATOR_MIN_64-(LLFSELog+MLFSELog+OffFSELog)))
-        BIT_reloadDStream(&seqState->DStream);
-    /* Verify that there is enough bits to read the rest of the data in 64-bit mode. */
-    ZSTD_STATIC_ASSERT(16+LLFSELog+MLFSELog+OffFSELog < STREAM_ACCUMULATOR_MIN_64);
-
-    seq.litLength = LL_base[llCode]
-                  + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
-    if (MEM_32bits())
-        BIT_reloadDStream(&seqState->DStream);
-
-    DEBUGLOG(6, "seq: litL=%u, matchL=%u, offset=%u",
-                (U32)seq.litLength, (U32)seq.matchLength, (U32)seq.offset);
-
-    /* ANS state update */
-    FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
-    FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
-    if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
-    FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
-
-    return seq;
-}
-
-
-HINT_INLINE
-size_t ZSTD_execSequence(BYTE* op,
-                         BYTE* const oend, seq_t sequence,
-                         const BYTE** litPtr, const BYTE* const litLimit,
-                         const BYTE* const base, const BYTE* const vBase, const BYTE* const dictEnd)
-{
-    BYTE* const oLitEnd = op + sequence.litLength;
-    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
-    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
-    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
-    const BYTE* match = oLitEnd - sequence.offset;
-
-    /* check */
-    if (oMatchEnd>oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
-    if (oLitEnd>oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, base, vBase, dictEnd);
-
-    /* copy Literals */
-    ZSTD_copy8(op, *litPtr);
-    if (sequence.litLength > 8)
-        ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-    op = oLitEnd;
-    *litPtr = iLitEnd;   /* update for next sequence */
-
-    /* copy Match */
-    if (sequence.offset > (size_t)(oLitEnd - base)) {
-        /* offset beyond prefix -> go into extDict */
-        if (sequence.offset > (size_t)(oLitEnd - vBase))
-            return ERROR(corruption_detected);
-        match = dictEnd + (match - base);
-        if (match + sequence.matchLength <= dictEnd) {
-            memmove(oLitEnd, match, sequence.matchLength);
-            return sequenceLength;
-        }
-        /* span extDict & currentPrefixSegment */
-        {   size_t const length1 = dictEnd - match;
-            memmove(oLitEnd, match, length1);
-            op = oLitEnd + length1;
-            sequence.matchLength -= length1;
-            match = base;
-            if (op > oend_w || sequence.matchLength < MINMATCH) {
-              U32 i;
-              for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
-              return sequenceLength;
-            }
-    }   }
-    /* Requirement: op <= oend_w && sequence.matchLength >= MINMATCH */
-
-    /* match within prefix */
-    if (sequence.offset < 8) {
-        /* close range match, overlap */
-        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
-        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
-        int const sub2 = dec64table[sequence.offset];
-        op[0] = match[0];
-        op[1] = match[1];
-        op[2] = match[2];
-        op[3] = match[3];
-        match += dec32table[sequence.offset];
-        ZSTD_copy4(op+4, match);
-        match -= sub2;
-    } else {
-        ZSTD_copy8(op, match);
-    }
-    op += 8; match += 8;
-
-    if (oMatchEnd > oend-(16-MINMATCH)) {
-        if (op < oend_w) {
-            ZSTD_wildcopy(op, match, oend_w - op);
-            match += oend_w - op;
-            op = oend_w;
-        }
-        while (op < oMatchEnd) *op++ = *match++;
-    } else {
-        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
-    }
-    return sequenceLength;
-}
-
-
-static size_t ZSTD_decompressSequences(
-                               ZSTD_DCtx* dctx,
-                               void* dst, size_t maxDstSize,
-                         const void* seqStart, size_t seqSize,
-                         const ZSTD_longOffset_e isLongOffset)
-{
-    const BYTE* ip = (const BYTE*)seqStart;
-    const BYTE* const iend = ip + seqSize;
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + maxDstSize;
-    BYTE* op = ostart;
-    const BYTE* litPtr = dctx->litPtr;
-    const BYTE* const litEnd = litPtr + dctx->litSize;
-    const BYTE* const base = (const BYTE*) (dctx->base);
-    const BYTE* const vBase = (const BYTE*) (dctx->vBase);
-    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
-    int nbSeq;
-    DEBUGLOG(5, "ZSTD_decompressSequences");
-
-    /* Build Decoding Tables */
-    {   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-        DEBUGLOG(5, "ZSTD_decodeSeqHeaders: size=%u, nbSeq=%i",
-                    (U32)seqHSize, nbSeq);
-        if (ZSTD_isError(seqHSize)) return seqHSize;
-        ip += seqHSize;
-    }
-
-    /* Regen sequences */
-    if (nbSeq) {
-        seqState_t seqState;
-        dctx->fseEntropy = 1;
-        { U32 i; for (i=0; ientropy.rep[i]; }
-        CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
-        FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-        FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-        FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
-
-        for ( ; (BIT_reloadDStream(&(seqState.DStream)) <= BIT_DStream_completed) && nbSeq ; ) {
-            nbSeq--;
-            {   seq_t const sequence = ZSTD_decodeSequence(&seqState, isLongOffset);
-                size_t const oneSeqSize = ZSTD_execSequence(op, oend, sequence, &litPtr, litEnd, base, vBase, dictEnd);
-                DEBUGLOG(6, "regenerated sequence size : %u", (U32)oneSeqSize);
-                if (ZSTD_isError(oneSeqSize)) return oneSeqSize;
-                op += oneSeqSize;
-        }   }
-
-        /* check if reached exact end */
-        DEBUGLOG(5, "after decode loop, remaining nbSeq : %i", nbSeq);
-        if (nbSeq) return ERROR(corruption_detected);
-        /* save reps for next block */
-        { U32 i; for (i=0; ientropy.rep[i] = (U32)(seqState.prevOffset[i]); }
-    }
-
-    /* last literal segment */
-    {   size_t const lastLLSize = litEnd - litPtr;
-        if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
-        memcpy(op, litPtr, lastLLSize);
-        op += lastLLSize;
-    }
-
-    return op-ostart;
-}
-
-
-HINT_INLINE
-seq_t ZSTD_decodeSequenceLong(seqState_t* seqState, ZSTD_longOffset_e const longOffsets)
-{
-    seq_t seq;
-
-    U32 const llCode = FSE_peekSymbol(&seqState->stateLL);
-    U32 const mlCode = FSE_peekSymbol(&seqState->stateML);
-    U32 const ofCode = FSE_peekSymbol(&seqState->stateOffb);   /* <= MaxOff, by table construction */
-
-    U32 const llBits = LL_bits[llCode];
-    U32 const mlBits = ML_bits[mlCode];
-    U32 const ofBits = ofCode;
-    U32 const totalBits = llBits+mlBits+ofBits;
-
-    static const U32 LL_base[MaxLL+1] = {
-                             0,  1,    2,     3,     4,     5,     6,      7,
-                             8,  9,   10,    11,    12,    13,    14,     15,
-                            16, 18,   20,    22,    24,    28,    32,     40,
-                            48, 64, 0x80, 0x100, 0x200, 0x400, 0x800, 0x1000,
-                            0x2000, 0x4000, 0x8000, 0x10000 };
-
-    static const U32 ML_base[MaxML+1] = {
-                             3,  4,  5,    6,     7,     8,     9,    10,
-                            11, 12, 13,   14,    15,    16,    17,    18,
-                            19, 20, 21,   22,    23,    24,    25,    26,
-                            27, 28, 29,   30,    31,    32,    33,    34,
-                            35, 37, 39,   41,    43,    47,    51,    59,
-                            67, 83, 99, 0x83, 0x103, 0x203, 0x403, 0x803,
-                            0x1003, 0x2003, 0x4003, 0x8003, 0x10003 };
-
-    static const U32 OF_base[MaxOff+1] = {
-                     0,        1,       1,       5,     0xD,     0x1D,     0x3D,     0x7D,
-                     0xFD,   0x1FD,   0x3FD,   0x7FD,   0xFFD,   0x1FFD,   0x3FFD,   0x7FFD,
-                     0xFFFD, 0x1FFFD, 0x3FFFD, 0x7FFFD, 0xFFFFD, 0x1FFFFD, 0x3FFFFD, 0x7FFFFD,
-                     0xFFFFFD, 0x1FFFFFD, 0x3FFFFFD, 0x7FFFFFD, 0xFFFFFFD, 0x1FFFFFFD, 0x3FFFFFFD, 0x7FFFFFFD };
-
-    /* sequence */
-    {   size_t offset;
-        if (!ofCode)
-            offset = 0;
-        else {
-            ZSTD_STATIC_ASSERT(ZSTD_lo_isLongOffset == 1);
-            ZSTD_STATIC_ASSERT(LONG_OFFSETS_MAX_EXTRA_BITS_32 == 5);
-            assert(ofBits <= MaxOff);
-            if (MEM_32bits() && longOffsets) {
-                U32 const extraBits = ofBits - MIN(ofBits, STREAM_ACCUMULATOR_MIN_32-1);
-                offset = OF_base[ofCode] + (BIT_readBitsFast(&seqState->DStream, ofBits - extraBits) << extraBits);
-                if (MEM_32bits() || extraBits) BIT_reloadDStream(&seqState->DStream);
-                if (extraBits) offset += BIT_readBitsFast(&seqState->DStream, extraBits);
-            } else {
-                offset = OF_base[ofCode] + BIT_readBitsFast(&seqState->DStream, ofBits);   /* <=  (ZSTD_WINDOWLOG_MAX-1) bits */
-                if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);
-            }
-        }
-
-        if (ofCode <= 1) {
-            offset += (llCode==0);
-            if (offset) {
-                size_t temp = (offset==3) ? seqState->prevOffset[0] - 1 : seqState->prevOffset[offset];
-                temp += !temp;   /* 0 is not valid; input is corrupted; force offset to 1 */
-                if (offset != 1) seqState->prevOffset[2] = seqState->prevOffset[1];
-                seqState->prevOffset[1] = seqState->prevOffset[0];
-                seqState->prevOffset[0] = offset = temp;
-            } else {
-                offset = seqState->prevOffset[0];
-            }
-        } else {
-            seqState->prevOffset[2] = seqState->prevOffset[1];
-            seqState->prevOffset[1] = seqState->prevOffset[0];
-            seqState->prevOffset[0] = offset;
-        }
-        seq.offset = offset;
-    }
-
-    seq.matchLength = ML_base[mlCode] + ((mlCode>31) ? BIT_readBitsFast(&seqState->DStream, mlBits) : 0);  /* <=  16 bits */
-    if (MEM_32bits() && (mlBits+llBits >= STREAM_ACCUMULATOR_MIN_32-LONG_OFFSETS_MAX_EXTRA_BITS_32))
-        BIT_reloadDStream(&seqState->DStream);
-    if (MEM_64bits() && (totalBits >= STREAM_ACCUMULATOR_MIN_64-(LLFSELog+MLFSELog+OffFSELog)))
-        BIT_reloadDStream(&seqState->DStream);
-    /* Verify that there is enough bits to read the rest of the data in 64-bit mode. */
-    ZSTD_STATIC_ASSERT(16+LLFSELog+MLFSELog+OffFSELog < STREAM_ACCUMULATOR_MIN_64);
-
-    seq.litLength = LL_base[llCode] + ((llCode>15) ? BIT_readBitsFast(&seqState->DStream, llBits) : 0);    /* <=  16 bits */
-    if (MEM_32bits())
-        BIT_reloadDStream(&seqState->DStream);
-
-    {   size_t const pos = seqState->pos + seq.litLength;
-        const BYTE* const matchBase = (seq.offset > pos) ? seqState->dictEnd : seqState->prefixStart;
-        seq.match = matchBase + pos - seq.offset;  /* note : this operation can overflow when seq.offset is really too large, which can only happen when input is corrupted.
-                                                    * No consequence though : no memory access will occur, overly large offset will be detected in ZSTD_execSequenceLong() */
-        seqState->pos = pos + seq.matchLength;
-    }
-
-    /* ANS state update */
-    FSE_updateState(&seqState->stateLL, &seqState->DStream);    /* <=  9 bits */
-    FSE_updateState(&seqState->stateML, &seqState->DStream);    /* <=  9 bits */
-    if (MEM_32bits()) BIT_reloadDStream(&seqState->DStream);    /* <= 18 bits */
-    FSE_updateState(&seqState->stateOffb, &seqState->DStream);  /* <=  8 bits */
-
-    return seq;
-}
-
-
-HINT_INLINE
-size_t ZSTD_execSequenceLong(BYTE* op,
-                             BYTE* const oend, seq_t sequence,
-                             const BYTE** litPtr, const BYTE* const litLimit,
-                             const BYTE* const prefixStart, const BYTE* const dictStart, const BYTE* const dictEnd)
-{
-    BYTE* const oLitEnd = op + sequence.litLength;
-    size_t const sequenceLength = sequence.litLength + sequence.matchLength;
-    BYTE* const oMatchEnd = op + sequenceLength;   /* risk : address space overflow (32-bits) */
-    BYTE* const oend_w = oend - WILDCOPY_OVERLENGTH;
-    const BYTE* const iLitEnd = *litPtr + sequence.litLength;
-    const BYTE* match = sequence.match;
-
-    /* check */
-    if (oMatchEnd > oend) return ERROR(dstSize_tooSmall); /* last match must start at a minimum distance of WILDCOPY_OVERLENGTH from oend */
-    if (iLitEnd > litLimit) return ERROR(corruption_detected);   /* over-read beyond lit buffer */
-    if (oLitEnd > oend_w) return ZSTD_execSequenceLast7(op, oend, sequence, litPtr, litLimit, prefixStart, dictStart, dictEnd);
-
-    /* copy Literals */
-    ZSTD_copy8(op, *litPtr);  /* note : op <= oLitEnd <= oend_w == oend - 8 */
-    if (sequence.litLength > 8)
-        ZSTD_wildcopy(op+8, (*litPtr)+8, sequence.litLength - 8);   /* note : since oLitEnd <= oend-WILDCOPY_OVERLENGTH, no risk of overwrite beyond oend */
-    op = oLitEnd;
-    *litPtr = iLitEnd;   /* update for next sequence */
-
-    /* copy Match */
-    if (sequence.offset > (size_t)(oLitEnd - prefixStart)) {
-        /* offset beyond prefix */
-        if (sequence.offset > (size_t)(oLitEnd - dictStart)) return ERROR(corruption_detected);
-        if (match + sequence.matchLength <= dictEnd) {
-            memmove(oLitEnd, match, sequence.matchLength);
-            return sequenceLength;
-        }
-        /* span extDict & currentPrefixSegment */
-        {   size_t const length1 = dictEnd - match;
-            memmove(oLitEnd, match, length1);
-            op = oLitEnd + length1;
-            sequence.matchLength -= length1;
-            match = prefixStart;
-            if (op > oend_w || sequence.matchLength < MINMATCH) {
-              U32 i;
-              for (i = 0; i < sequence.matchLength; ++i) op[i] = match[i];
-              return sequenceLength;
-            }
-    }   }
-    assert(op <= oend_w);
-    assert(sequence.matchLength >= MINMATCH);
-
-    /* match within prefix */
-    if (sequence.offset < 8) {
-        /* close range match, overlap */
-        static const U32 dec32table[] = { 0, 1, 2, 1, 4, 4, 4, 4 };   /* added */
-        static const int dec64table[] = { 8, 8, 8, 7, 8, 9,10,11 };   /* subtracted */
-        int const sub2 = dec64table[sequence.offset];
-        op[0] = match[0];
-        op[1] = match[1];
-        op[2] = match[2];
-        op[3] = match[3];
-        match += dec32table[sequence.offset];
-        ZSTD_copy4(op+4, match);
-        match -= sub2;
-    } else {
-        ZSTD_copy8(op, match);
-    }
-    op += 8; match += 8;
-
-    if (oMatchEnd > oend-(16-MINMATCH)) {
-        if (op < oend_w) {
-            ZSTD_wildcopy(op, match, oend_w - op);
-            match += oend_w - op;
-            op = oend_w;
-        }
-        while (op < oMatchEnd) *op++ = *match++;
-    } else {
-        ZSTD_wildcopy(op, match, (ptrdiff_t)sequence.matchLength-8);   /* works even if matchLength < 8 */
-    }
-    return sequenceLength;
-}
-
-static size_t ZSTD_decompressSequencesLong(
-                               ZSTD_DCtx* dctx,
-                               void* dst, size_t maxDstSize,
-                         const void* seqStart, size_t seqSize,
-                         const ZSTD_longOffset_e isLongOffset)
-{
-    const BYTE* ip = (const BYTE*)seqStart;
-    const BYTE* const iend = ip + seqSize;
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + maxDstSize;
-    BYTE* op = ostart;
-    const BYTE* litPtr = dctx->litPtr;
-    const BYTE* const litEnd = litPtr + dctx->litSize;
-    const BYTE* const prefixStart = (const BYTE*) (dctx->base);
-    const BYTE* const dictStart = (const BYTE*) (dctx->vBase);
-    const BYTE* const dictEnd = (const BYTE*) (dctx->dictEnd);
-    int nbSeq;
-
-    /* Build Decoding Tables */
-    {   size_t const seqHSize = ZSTD_decodeSeqHeaders(dctx, &nbSeq, ip, seqSize);
-        if (ZSTD_isError(seqHSize)) return seqHSize;
-        ip += seqHSize;
-    }
-
-    /* Regen sequences */
-    if (nbSeq) {
-#define STORED_SEQS 4
-#define STOSEQ_MASK (STORED_SEQS-1)
-#define ADVANCED_SEQS 4
-        seq_t sequences[STORED_SEQS];
-        int const seqAdvance = MIN(nbSeq, ADVANCED_SEQS);
-        seqState_t seqState;
-        int seqNb;
-        dctx->fseEntropy = 1;
-        { U32 i; for (i=0; ientropy.rep[i]; }
-        seqState.prefixStart = prefixStart;
-        seqState.pos = (size_t)(op-prefixStart);
-        seqState.dictEnd = dictEnd;
-        CHECK_E(BIT_initDStream(&seqState.DStream, ip, iend-ip), corruption_detected);
-        FSE_initDState(&seqState.stateLL, &seqState.DStream, dctx->LLTptr);
-        FSE_initDState(&seqState.stateOffb, &seqState.DStream, dctx->OFTptr);
-        FSE_initDState(&seqState.stateML, &seqState.DStream, dctx->MLTptr);
-
-        /* prepare in advance */
-        for (seqNb=0; (BIT_reloadDStream(&seqState.DStream) <= BIT_DStream_completed) && seqNbentropy.rep[i] = (U32)(seqState.prevOffset[i]); }
-    }
-
-    /* last literal segment */
-    {   size_t const lastLLSize = litEnd - litPtr;
-        if (lastLLSize > (size_t)(oend-op)) return ERROR(dstSize_tooSmall);
-        memcpy(op, litPtr, lastLLSize);
-        op += lastLLSize;
-    }
-
-    return op-ostart;
-}
-
-
-static size_t ZSTD_decompressBlock_internal(ZSTD_DCtx* dctx,
-                            void* dst, size_t dstCapacity,
-                      const void* src, size_t srcSize, const int frame)
-{   /* blockType == blockCompressed */
-    const BYTE* ip = (const BYTE*)src;
-    /* isLongOffset must be true if there are long offsets.
-     * Offsets are long if they are larger than 2^STREAM_ACCUMULATOR_MIN.
-     * We don't expect that to be the case in 64-bit mode.
-     * If we are in block mode we don't know the window size, so we have to be
-     * conservative.
-     */
-    ZSTD_longOffset_e const isLongOffset = (ZSTD_longOffset_e)(MEM_32bits() && (!frame || dctx->fParams.windowSize > (1ULL << STREAM_ACCUMULATOR_MIN)));
-    /* windowSize could be any value at this point, since it is only validated
-     * in the streaming API.
-     */
-    DEBUGLOG(5, "ZSTD_decompressBlock_internal (size : %u)", (U32)srcSize);
-
-    if (srcSize >= ZSTD_BLOCKSIZE_MAX) return ERROR(srcSize_wrong);
-
-    /* Decode literals section */
-    {   size_t const litCSize = ZSTD_decodeLiteralsBlock(dctx, src, srcSize);
-        DEBUGLOG(5, "ZSTD_decodeLiteralsBlock : %u", (U32)litCSize);
-        if (ZSTD_isError(litCSize)) return litCSize;
-        ip += litCSize;
-        srcSize -= litCSize;
-    }
-    if (frame && dctx->fParams.windowSize > (1<<23))
-        return ZSTD_decompressSequencesLong(dctx, dst, dstCapacity, ip, srcSize, isLongOffset);
-    return ZSTD_decompressSequences(dctx, dst, dstCapacity, ip, srcSize, isLongOffset);
-}
-
-
-static void ZSTD_checkContinuity(ZSTD_DCtx* dctx, const void* dst)
-{
-    if (dst != dctx->previousDstEnd) {   /* not contiguous */
-        dctx->dictEnd = dctx->previousDstEnd;
-        dctx->vBase = (const char*)dst - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
-        dctx->base = dst;
-        dctx->previousDstEnd = dst;
-    }
-}
-
-size_t ZSTD_decompressBlock(ZSTD_DCtx* dctx,
-                            void* dst, size_t dstCapacity,
-                      const void* src, size_t srcSize)
-{
-    size_t dSize;
-    ZSTD_checkContinuity(dctx, dst);
-    dSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize, /* frame */ 0);
-    dctx->previousDstEnd = (char*)dst + dSize;
-    return dSize;
-}
-
-
-/** ZSTD_insertBlock() :
-    insert `src` block into `dctx` history. Useful to track uncompressed blocks. */
-ZSTDLIB_API size_t ZSTD_insertBlock(ZSTD_DCtx* dctx, const void* blockStart, size_t blockSize)
-{
-    ZSTD_checkContinuity(dctx, blockStart);
-    dctx->previousDstEnd = (const char*)blockStart + blockSize;
-    return blockSize;
-}
-
-
-static size_t ZSTD_generateNxBytes(void* dst, size_t dstCapacity, BYTE byte, size_t length)
-{
-    if (length > dstCapacity) return ERROR(dstSize_tooSmall);
-    memset(dst, byte, length);
-    return length;
-}
-
-/** ZSTD_findFrameCompressedSize() :
- *  compatible with legacy mode
- *  `src` must point to the start of a ZSTD frame, ZSTD legacy frame, or skippable frame
- *  `srcSize` must be at least as large as the frame contained
- *  @return : the compressed size of the frame starting at `src` */
-size_t ZSTD_findFrameCompressedSize(const void *src, size_t srcSize)
-{
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-    if (ZSTD_isLegacy(src, srcSize))
-        return ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
-#endif
-    if ( (srcSize >= ZSTD_skippableHeaderSize)
-      && (MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START ) {
-        return ZSTD_skippableHeaderSize + MEM_readLE32((const BYTE*)src + ZSTD_frameIdSize);
-    } else {
-        const BYTE* ip = (const BYTE*)src;
-        const BYTE* const ipstart = ip;
-        size_t remainingSize = srcSize;
-        ZSTD_frameHeader zfh;
-
-        /* Extract Frame Header */
-        {   size_t const ret = ZSTD_getFrameHeader(&zfh, src, srcSize);
-            if (ZSTD_isError(ret)) return ret;
-            if (ret > 0) return ERROR(srcSize_wrong);
-        }
-
-        ip += zfh.headerSize;
-        remainingSize -= zfh.headerSize;
-
-        /* Loop on each block */
-        while (1) {
-            blockProperties_t blockProperties;
-            size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-            if (ZSTD_isError(cBlockSize)) return cBlockSize;
-
-            if (ZSTD_blockHeaderSize + cBlockSize > remainingSize)
-                return ERROR(srcSize_wrong);
-
-            ip += ZSTD_blockHeaderSize + cBlockSize;
-            remainingSize -= ZSTD_blockHeaderSize + cBlockSize;
-
-            if (blockProperties.lastBlock) break;
-        }
-
-        if (zfh.checksumFlag) {   /* Final frame content checksum */
-            if (remainingSize < 4) return ERROR(srcSize_wrong);
-            ip += 4;
-            remainingSize -= 4;
-        }
-
-        return ip - ipstart;
-    }
-}
-
-/*! ZSTD_decompressFrame() :
-*   @dctx must be properly initialized */
-static size_t ZSTD_decompressFrame(ZSTD_DCtx* dctx,
-                                   void* dst, size_t dstCapacity,
-                             const void** srcPtr, size_t *srcSizePtr)
-{
-    const BYTE* ip = (const BYTE*)(*srcPtr);
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + dstCapacity;
-    BYTE* op = ostart;
-    size_t remainingSize = *srcSizePtr;
-
-    /* check */
-    if (remainingSize < ZSTD_frameHeaderSize_min+ZSTD_blockHeaderSize)
-        return ERROR(srcSize_wrong);
-
-    /* Frame Header */
-    {   size_t const frameHeaderSize = ZSTD_frameHeaderSize(ip, ZSTD_frameHeaderSize_prefix);
-        if (ZSTD_isError(frameHeaderSize)) return frameHeaderSize;
-        if (remainingSize < frameHeaderSize+ZSTD_blockHeaderSize)
-            return ERROR(srcSize_wrong);
-        CHECK_F( ZSTD_decodeFrameHeader(dctx, ip, frameHeaderSize) );
-        ip += frameHeaderSize; remainingSize -= frameHeaderSize;
-    }
-
-    /* Loop on each block */
-    while (1) {
-        size_t decodedSize;
-        blockProperties_t blockProperties;
-        size_t const cBlockSize = ZSTD_getcBlockSize(ip, remainingSize, &blockProperties);
-        if (ZSTD_isError(cBlockSize)) return cBlockSize;
-
-        ip += ZSTD_blockHeaderSize;
-        remainingSize -= ZSTD_blockHeaderSize;
-        if (cBlockSize > remainingSize) return ERROR(srcSize_wrong);
-
-        switch(blockProperties.blockType)
-        {
-        case bt_compressed:
-            decodedSize = ZSTD_decompressBlock_internal(dctx, op, oend-op, ip, cBlockSize, /* frame */ 1);
-            break;
-        case bt_raw :
-            decodedSize = ZSTD_copyRawBlock(op, oend-op, ip, cBlockSize);
-            break;
-        case bt_rle :
-            decodedSize = ZSTD_generateNxBytes(op, oend-op, *ip, blockProperties.origSize);
-            break;
-        case bt_reserved :
-        default:
-            return ERROR(corruption_detected);
-        }
-
-        if (ZSTD_isError(decodedSize)) return decodedSize;
-        if (dctx->fParams.checksumFlag)
-            XXH64_update(&dctx->xxhState, op, decodedSize);
-        op += decodedSize;
-        ip += cBlockSize;
-        remainingSize -= cBlockSize;
-        if (blockProperties.lastBlock) break;
-    }
-
-    if (dctx->fParams.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN) {
-        if ((U64)(op-ostart) != dctx->fParams.frameContentSize) {
-            return ERROR(corruption_detected);
-    }   }
-    if (dctx->fParams.checksumFlag) { /* Frame content checksum verification */
-        U32 const checkCalc = (U32)XXH64_digest(&dctx->xxhState);
-        U32 checkRead;
-        if (remainingSize<4) return ERROR(checksum_wrong);
-        checkRead = MEM_readLE32(ip);
-        if (checkRead != checkCalc) return ERROR(checksum_wrong);
-        ip += 4;
-        remainingSize -= 4;
-    }
-
-    /* Allow caller to get size read */
-    *srcPtr = ip;
-    *srcSizePtr = remainingSize;
-    return op-ostart;
-}
-
-static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict);
-static size_t ZSTD_DDictDictSize(const ZSTD_DDict* ddict);
-
-static size_t ZSTD_decompressMultiFrame(ZSTD_DCtx* dctx,
-                                        void* dst, size_t dstCapacity,
-                                  const void* src, size_t srcSize,
-                                  const void* dict, size_t dictSize,
-                                  const ZSTD_DDict* ddict)
-{
-    void* const dststart = dst;
-    assert(dict==NULL || ddict==NULL);  /* either dict or ddict set, not both */
-
-    if (ddict) {
-        dict = ZSTD_DDictDictContent(ddict);
-        dictSize = ZSTD_DDictDictSize(ddict);
-    }
-
-    while (srcSize >= ZSTD_frameHeaderSize_prefix) {
-        U32 magicNumber;
-
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT >= 1)
-        if (ZSTD_isLegacy(src, srcSize)) {
-            size_t decodedSize;
-            size_t const frameSize = ZSTD_findFrameCompressedSizeLegacy(src, srcSize);
-            if (ZSTD_isError(frameSize)) return frameSize;
-            /* legacy support is not compatible with static dctx */
-            if (dctx->staticSize) return ERROR(memory_allocation);
-
-            decodedSize = ZSTD_decompressLegacy(dst, dstCapacity, src, frameSize, dict, dictSize);
-
-            dst = (BYTE*)dst + decodedSize;
-            dstCapacity -= decodedSize;
-
-            src = (const BYTE*)src + frameSize;
-            srcSize -= frameSize;
-
-            continue;
-        }
-#endif
-
-        magicNumber = MEM_readLE32(src);
-        DEBUGLOG(4, "reading magic number %08X (expecting %08X)",
-                    (U32)magicNumber, (U32)ZSTD_MAGICNUMBER);
-        if (magicNumber != ZSTD_MAGICNUMBER) {
-            if ((magicNumber & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {
-                size_t skippableSize;
-                if (srcSize < ZSTD_skippableHeaderSize)
-                    return ERROR(srcSize_wrong);
-                skippableSize = MEM_readLE32((const BYTE*)src + ZSTD_frameIdSize)
-                              + ZSTD_skippableHeaderSize;
-                if (srcSize < skippableSize) return ERROR(srcSize_wrong);
-
-                src = (const BYTE *)src + skippableSize;
-                srcSize -= skippableSize;
-                continue;
-            }
-            return ERROR(prefix_unknown);
-        }
-
-        if (ddict) {
-            /* we were called from ZSTD_decompress_usingDDict */
-            CHECK_F(ZSTD_decompressBegin_usingDDict(dctx, ddict));
-        } else {
-            /* this will initialize correctly with no dict if dict == NULL, so
-             * use this in all cases but ddict */
-            CHECK_F(ZSTD_decompressBegin_usingDict(dctx, dict, dictSize));
-        }
-        ZSTD_checkContinuity(dctx, dst);
-
-        {   const size_t res = ZSTD_decompressFrame(dctx, dst, dstCapacity,
-                                                    &src, &srcSize);
-            if (ZSTD_isError(res)) return res;
-            /* no need to bound check, ZSTD_decompressFrame already has */
-            dst = (BYTE*)dst + res;
-            dstCapacity -= res;
-        }
-    }  /* while (srcSize >= ZSTD_frameHeaderSize_prefix) */
-
-    if (srcSize) return ERROR(srcSize_wrong); /* input not entirely consumed */
-
-    return (BYTE*)dst - (BYTE*)dststart;
-}
-
-size_t ZSTD_decompress_usingDict(ZSTD_DCtx* dctx,
-                                 void* dst, size_t dstCapacity,
-                           const void* src, size_t srcSize,
-                           const void* dict, size_t dictSize)
-{
-    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize, dict, dictSize, NULL);
-}
-
-
-size_t ZSTD_decompressDCtx(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    return ZSTD_decompress_usingDict(dctx, dst, dstCapacity, src, srcSize, NULL, 0);
-}
-
-
-size_t ZSTD_decompress(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-#if defined(ZSTD_HEAPMODE) && (ZSTD_HEAPMODE>=1)
-    size_t regenSize;
-    ZSTD_DCtx* const dctx = ZSTD_createDCtx();
-    if (dctx==NULL) return ERROR(memory_allocation);
-    regenSize = ZSTD_decompressDCtx(dctx, dst, dstCapacity, src, srcSize);
-    ZSTD_freeDCtx(dctx);
-    return regenSize;
-#else   /* stack mode */
-    ZSTD_DCtx dctx;
-    return ZSTD_decompressDCtx(&dctx, dst, dstCapacity, src, srcSize);
-#endif
-}
-
-
-/*-**************************************
-*   Advanced Streaming Decompression API
-*   Bufferless and synchronous
-****************************************/
-size_t ZSTD_nextSrcSizeToDecompress(ZSTD_DCtx* dctx) { return dctx->expected; }
-
-ZSTD_nextInputType_e ZSTD_nextInputType(ZSTD_DCtx* dctx) {
-    switch(dctx->stage)
-    {
-    default:   /* should not happen */
-        assert(0);
-    case ZSTDds_getFrameHeaderSize:
-    case ZSTDds_decodeFrameHeader:
-        return ZSTDnit_frameHeader;
-    case ZSTDds_decodeBlockHeader:
-        return ZSTDnit_blockHeader;
-    case ZSTDds_decompressBlock:
-        return ZSTDnit_block;
-    case ZSTDds_decompressLastBlock:
-        return ZSTDnit_lastBlock;
-    case ZSTDds_checkChecksum:
-        return ZSTDnit_checksum;
-    case ZSTDds_decodeSkippableHeader:
-    case ZSTDds_skipFrame:
-        return ZSTDnit_skippableFrame;
-    }
-}
-
-static int ZSTD_isSkipFrame(ZSTD_DCtx* dctx) { return dctx->stage == ZSTDds_skipFrame; }
-
-/** ZSTD_decompressContinue() :
- *  srcSize : must be the exact nb of bytes expected (see ZSTD_nextSrcSizeToDecompress())
- *  @return : nb of bytes generated into `dst` (necessarily <= `dstCapacity)
- *            or an error code, which can be tested using ZSTD_isError() */
-size_t ZSTD_decompressContinue(ZSTD_DCtx* dctx, void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    DEBUGLOG(5, "ZSTD_decompressContinue");
-    /* Sanity check */
-    if (srcSize != dctx->expected) return ERROR(srcSize_wrong);  /* not allowed */
-    if (dstCapacity) ZSTD_checkContinuity(dctx, dst);
-
-    switch (dctx->stage)
-    {
-    case ZSTDds_getFrameHeaderSize :
-        assert(src != NULL);
-        if (dctx->format == ZSTD_f_zstd1) {  /* allows header */
-            assert(srcSize >= ZSTD_frameIdSize);  /* to read skippable magic number */
-            if ((MEM_readLE32(src) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {        /* skippable frame */
-                memcpy(dctx->headerBuffer, src, srcSize);
-                dctx->expected = ZSTD_skippableHeaderSize - srcSize;  /* remaining to load to get full skippable frame header */
-                dctx->stage = ZSTDds_decodeSkippableHeader;
-                return 0;
-        }   }
-        dctx->headerSize = ZSTD_frameHeaderSize_internal(src, srcSize, dctx->format);
-        if (ZSTD_isError(dctx->headerSize)) return dctx->headerSize;
-        memcpy(dctx->headerBuffer, src, srcSize);
-        dctx->expected = dctx->headerSize - srcSize;
-        dctx->stage = ZSTDds_decodeFrameHeader;
-        return 0;
-
-    case ZSTDds_decodeFrameHeader:
-        assert(src != NULL);
-        memcpy(dctx->headerBuffer + (dctx->headerSize - srcSize), src, srcSize);
-        CHECK_F(ZSTD_decodeFrameHeader(dctx, dctx->headerBuffer, dctx->headerSize));
-        dctx->expected = ZSTD_blockHeaderSize;
-        dctx->stage = ZSTDds_decodeBlockHeader;
-        return 0;
-
-    case ZSTDds_decodeBlockHeader:
-        {   blockProperties_t bp;
-            size_t const cBlockSize = ZSTD_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
-            if (ZSTD_isError(cBlockSize)) return cBlockSize;
-            dctx->expected = cBlockSize;
-            dctx->bType = bp.blockType;
-            dctx->rleSize = bp.origSize;
-            if (cBlockSize) {
-                dctx->stage = bp.lastBlock ? ZSTDds_decompressLastBlock : ZSTDds_decompressBlock;
-                return 0;
-            }
-            /* empty block */
-            if (bp.lastBlock) {
-                if (dctx->fParams.checksumFlag) {
-                    dctx->expected = 4;
-                    dctx->stage = ZSTDds_checkChecksum;
-                } else {
-                    dctx->expected = 0; /* end of frame */
-                    dctx->stage = ZSTDds_getFrameHeaderSize;
-                }
-            } else {
-                dctx->expected = ZSTD_blockHeaderSize;  /* jump to next header */
-                dctx->stage = ZSTDds_decodeBlockHeader;
-            }
-            return 0;
-        }
-
-    case ZSTDds_decompressLastBlock:
-    case ZSTDds_decompressBlock:
-        DEBUGLOG(5, "case ZSTDds_decompressBlock");
-        {   size_t rSize;
-            switch(dctx->bType)
-            {
-            case bt_compressed:
-                DEBUGLOG(5, "case bt_compressed");
-                rSize = ZSTD_decompressBlock_internal(dctx, dst, dstCapacity, src, srcSize, /* frame */ 1);
-                break;
-            case bt_raw :
-                rSize = ZSTD_copyRawBlock(dst, dstCapacity, src, srcSize);
-                break;
-            case bt_rle :
-                rSize = ZSTD_setRleBlock(dst, dstCapacity, src, srcSize, dctx->rleSize);
-                break;
-            case bt_reserved :   /* should never happen */
-            default:
-                return ERROR(corruption_detected);
-            }
-            if (ZSTD_isError(rSize)) return rSize;
-            DEBUGLOG(5, "decoded size from block : %u", (U32)rSize);
-            dctx->decodedSize += rSize;
-            if (dctx->fParams.checksumFlag) XXH64_update(&dctx->xxhState, dst, rSize);
-
-            if (dctx->stage == ZSTDds_decompressLastBlock) {   /* end of frame */
-                DEBUGLOG(4, "decoded size from frame : %u", (U32)dctx->decodedSize);
-                if (dctx->fParams.frameContentSize != ZSTD_CONTENTSIZE_UNKNOWN) {
-                    if (dctx->decodedSize != dctx->fParams.frameContentSize) {
-                        return ERROR(corruption_detected);
-                }   }
-                if (dctx->fParams.checksumFlag) {  /* another round for frame checksum */
-                    dctx->expected = 4;
-                    dctx->stage = ZSTDds_checkChecksum;
-                } else {
-                    dctx->expected = 0;   /* ends here */
-                    dctx->stage = ZSTDds_getFrameHeaderSize;
-                }
-            } else {
-                dctx->stage = ZSTDds_decodeBlockHeader;
-                dctx->expected = ZSTD_blockHeaderSize;
-                dctx->previousDstEnd = (char*)dst + rSize;
-            }
-            return rSize;
-        }
-
-    case ZSTDds_checkChecksum:
-        assert(srcSize == 4);  /* guaranteed by dctx->expected */
-        {   U32 const h32 = (U32)XXH64_digest(&dctx->xxhState);
-            U32 const check32 = MEM_readLE32(src);
-            DEBUGLOG(4, "checksum : calculated %08X :: %08X read", h32, check32);
-            if (check32 != h32) return ERROR(checksum_wrong);
-            dctx->expected = 0;
-            dctx->stage = ZSTDds_getFrameHeaderSize;
-            return 0;
-        }
-
-    case ZSTDds_decodeSkippableHeader:
-        assert(src != NULL);
-        assert(srcSize <= ZSTD_skippableHeaderSize);
-        memcpy(dctx->headerBuffer + (ZSTD_skippableHeaderSize - srcSize), src, srcSize);   /* complete skippable header */
-        dctx->expected = MEM_readLE32(dctx->headerBuffer + ZSTD_frameIdSize);   /* note : dctx->expected can grow seriously large, beyond local buffer size */
-        dctx->stage = ZSTDds_skipFrame;
-        return 0;
-
-    case ZSTDds_skipFrame:
-        dctx->expected = 0;
-        dctx->stage = ZSTDds_getFrameHeaderSize;
-        return 0;
-
-    default:
-        return ERROR(GENERIC);   /* impossible */
-    }
-}
-
-
-static size_t ZSTD_refDictContent(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
-{
-    dctx->dictEnd = dctx->previousDstEnd;
-    dctx->vBase = (const char*)dict - ((const char*)(dctx->previousDstEnd) - (const char*)(dctx->base));
-    dctx->base = dict;
-    dctx->previousDstEnd = (const char*)dict + dictSize;
-    return 0;
-}
-
-/* ZSTD_loadEntropy() :
- * dict : must point at beginning of a valid zstd dictionary
- * @return : size of entropy tables read */
-static size_t ZSTD_loadEntropy(ZSTD_entropyDTables_t* entropy, const void* const dict, size_t const dictSize)
-{
-    const BYTE* dictPtr = (const BYTE*)dict;
-    const BYTE* const dictEnd = dictPtr + dictSize;
-
-    if (dictSize <= 8) return ERROR(dictionary_corrupted);
-    dictPtr += 8;   /* skip header = magic + dictID */
-
-
-    {   size_t const hSize = HUF_readDTableX4_wksp(
-            entropy->hufTable, dictPtr, dictEnd - dictPtr,
-            entropy->workspace, sizeof(entropy->workspace));
-        if (HUF_isError(hSize)) return ERROR(dictionary_corrupted);
-        dictPtr += hSize;
-    }
-
-    {   short offcodeNCount[MaxOff+1];
-        U32 offcodeMaxValue = MaxOff, offcodeLog;
-        size_t const offcodeHeaderSize = FSE_readNCount(offcodeNCount, &offcodeMaxValue, &offcodeLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(offcodeHeaderSize)) return ERROR(dictionary_corrupted);
-        if (offcodeLog > OffFSELog) return ERROR(dictionary_corrupted);
-        CHECK_E(FSE_buildDTable(entropy->OFTable, offcodeNCount, offcodeMaxValue, offcodeLog), dictionary_corrupted);
-        dictPtr += offcodeHeaderSize;
-    }
-
-    {   short matchlengthNCount[MaxML+1];
-        unsigned matchlengthMaxValue = MaxML, matchlengthLog;
-        size_t const matchlengthHeaderSize = FSE_readNCount(matchlengthNCount, &matchlengthMaxValue, &matchlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(matchlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (matchlengthLog > MLFSELog) return ERROR(dictionary_corrupted);
-        CHECK_E(FSE_buildDTable(entropy->MLTable, matchlengthNCount, matchlengthMaxValue, matchlengthLog), dictionary_corrupted);
-        dictPtr += matchlengthHeaderSize;
-    }
-
-    {   short litlengthNCount[MaxLL+1];
-        unsigned litlengthMaxValue = MaxLL, litlengthLog;
-        size_t const litlengthHeaderSize = FSE_readNCount(litlengthNCount, &litlengthMaxValue, &litlengthLog, dictPtr, dictEnd-dictPtr);
-        if (FSE_isError(litlengthHeaderSize)) return ERROR(dictionary_corrupted);
-        if (litlengthLog > LLFSELog) return ERROR(dictionary_corrupted);
-        CHECK_E(FSE_buildDTable(entropy->LLTable, litlengthNCount, litlengthMaxValue, litlengthLog), dictionary_corrupted);
-        dictPtr += litlengthHeaderSize;
-    }
-
-    if (dictPtr+12 > dictEnd) return ERROR(dictionary_corrupted);
-    {   int i;
-        size_t const dictContentSize = (size_t)(dictEnd - (dictPtr+12));
-        for (i=0; i<3; i++) {
-            U32 const rep = MEM_readLE32(dictPtr); dictPtr += 4;
-            if (rep==0 || rep >= dictContentSize) return ERROR(dictionary_corrupted);
-            entropy->rep[i] = rep;
-    }   }
-
-    return dictPtr - (const BYTE*)dict;
-}
-
-static size_t ZSTD_decompress_insertDictionary(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
-{
-    if (dictSize < 8) return ZSTD_refDictContent(dctx, dict, dictSize);
-    {   U32 const magic = MEM_readLE32(dict);
-        if (magic != ZSTD_MAGIC_DICTIONARY) {
-            return ZSTD_refDictContent(dctx, dict, dictSize);   /* pure content mode */
-    }   }
-    dctx->dictID = MEM_readLE32((const char*)dict + ZSTD_frameIdSize);
-
-    /* load entropy tables */
-    {   size_t const eSize = ZSTD_loadEntropy(&dctx->entropy, dict, dictSize);
-        if (ZSTD_isError(eSize)) return ERROR(dictionary_corrupted);
-        dict = (const char*)dict + eSize;
-        dictSize -= eSize;
-    }
-    dctx->litEntropy = dctx->fseEntropy = 1;
-
-    /* reference dictionary content */
-    return ZSTD_refDictContent(dctx, dict, dictSize);
-}
-
-/* Note : this function cannot fail */
-size_t ZSTD_decompressBegin(ZSTD_DCtx* dctx)
-{
-    assert(dctx != NULL);
-    dctx->expected = ZSTD_startingInputLength(dctx->format);  /* dctx->format must be properly set */
-    dctx->stage = ZSTDds_getFrameHeaderSize;
-    dctx->decodedSize = 0;
-    dctx->previousDstEnd = NULL;
-    dctx->base = NULL;
-    dctx->vBase = NULL;
-    dctx->dictEnd = NULL;
-    dctx->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
-    dctx->litEntropy = dctx->fseEntropy = 0;
-    dctx->dictID = 0;
-    ZSTD_STATIC_ASSERT(sizeof(dctx->entropy.rep) == sizeof(repStartValue));
-    memcpy(dctx->entropy.rep, repStartValue, sizeof(repStartValue));  /* initial repcodes */
-    dctx->LLTptr = dctx->entropy.LLTable;
-    dctx->MLTptr = dctx->entropy.MLTable;
-    dctx->OFTptr = dctx->entropy.OFTable;
-    dctx->HUFptr = dctx->entropy.hufTable;
-    return 0;
-}
-
-size_t ZSTD_decompressBegin_usingDict(ZSTD_DCtx* dctx, const void* dict, size_t dictSize)
-{
-    CHECK_F( ZSTD_decompressBegin(dctx) );
-    if (dict && dictSize)
-        CHECK_E(ZSTD_decompress_insertDictionary(dctx, dict, dictSize), dictionary_corrupted);
-    return 0;
-}
-
-
-/* ======   ZSTD_DDict   ====== */
-
-struct ZSTD_DDict_s {
-    void* dictBuffer;
-    const void* dictContent;
-    size_t dictSize;
-    ZSTD_entropyDTables_t entropy;
-    U32 dictID;
-    U32 entropyPresent;
-    ZSTD_customMem cMem;
-};  /* typedef'd to ZSTD_DDict within "zstd.h" */
-
-static const void* ZSTD_DDictDictContent(const ZSTD_DDict* ddict)
-{
-    return ddict->dictContent;
-}
-
-static size_t ZSTD_DDictDictSize(const ZSTD_DDict* ddict)
-{
-    return ddict->dictSize;
-}
-
-size_t ZSTD_decompressBegin_usingDDict(ZSTD_DCtx* dstDCtx, const ZSTD_DDict* ddict)
-{
-    CHECK_F( ZSTD_decompressBegin(dstDCtx) );
-    if (ddict) {   /* support begin on NULL */
-        dstDCtx->dictID = ddict->dictID;
-        dstDCtx->base = ddict->dictContent;
-        dstDCtx->vBase = ddict->dictContent;
-        dstDCtx->dictEnd = (const BYTE*)ddict->dictContent + ddict->dictSize;
-        dstDCtx->previousDstEnd = dstDCtx->dictEnd;
-        if (ddict->entropyPresent) {
-            dstDCtx->litEntropy = 1;
-            dstDCtx->fseEntropy = 1;
-            dstDCtx->LLTptr = ddict->entropy.LLTable;
-            dstDCtx->MLTptr = ddict->entropy.MLTable;
-            dstDCtx->OFTptr = ddict->entropy.OFTable;
-            dstDCtx->HUFptr = ddict->entropy.hufTable;
-            dstDCtx->entropy.rep[0] = ddict->entropy.rep[0];
-            dstDCtx->entropy.rep[1] = ddict->entropy.rep[1];
-            dstDCtx->entropy.rep[2] = ddict->entropy.rep[2];
-        } else {
-            dstDCtx->litEntropy = 0;
-            dstDCtx->fseEntropy = 0;
-        }
-    }
-    return 0;
-}
-
-static size_t ZSTD_loadEntropy_inDDict(ZSTD_DDict* ddict)
-{
-    ddict->dictID = 0;
-    ddict->entropyPresent = 0;
-    if (ddict->dictSize < 8) return 0;
-    {   U32 const magic = MEM_readLE32(ddict->dictContent);
-        if (magic != ZSTD_MAGIC_DICTIONARY) return 0;   /* pure content mode */
-    }
-    ddict->dictID = MEM_readLE32((const char*)ddict->dictContent + ZSTD_frameIdSize);
-
-    /* load entropy tables */
-    CHECK_E( ZSTD_loadEntropy(&ddict->entropy, ddict->dictContent, ddict->dictSize), dictionary_corrupted );
-    ddict->entropyPresent = 1;
-    return 0;
-}
-
-
-static size_t ZSTD_initDDict_internal(ZSTD_DDict* ddict, const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod)
-{
-    if ((dictLoadMethod == ZSTD_dlm_byRef) || (!dict) || (!dictSize)) {
-        ddict->dictBuffer = NULL;
-        ddict->dictContent = dict;
-    } else {
-        void* const internalBuffer = ZSTD_malloc(dictSize, ddict->cMem);
-        ddict->dictBuffer = internalBuffer;
-        ddict->dictContent = internalBuffer;
-        if (!internalBuffer) return ERROR(memory_allocation);
-        memcpy(internalBuffer, dict, dictSize);
-    }
-    ddict->dictSize = dictSize;
-    ddict->entropy.hufTable[0] = (HUF_DTable)((HufLog)*0x1000001);  /* cover both little and big endian */
-
-    /* parse dictionary content */
-    CHECK_F( ZSTD_loadEntropy_inDDict(ddict) );
-
-    return 0;
-}
-
-ZSTD_DDict* ZSTD_createDDict_advanced(const void* dict, size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod, ZSTD_customMem customMem)
-{
-    if (!customMem.customAlloc ^ !customMem.customFree) return NULL;
-
-    {   ZSTD_DDict* const ddict = (ZSTD_DDict*) ZSTD_malloc(sizeof(ZSTD_DDict), customMem);
-        if (!ddict) return NULL;
-        ddict->cMem = customMem;
-
-        if (ZSTD_isError( ZSTD_initDDict_internal(ddict, dict, dictSize, dictLoadMethod) )) {
-            ZSTD_freeDDict(ddict);
-            return NULL;
-        }
-
-        return ddict;
-    }
-}
-
-/*! ZSTD_createDDict() :
-*   Create a digested dictionary, to start decompression without startup delay.
-*   `dict` content is copied inside DDict.
-*   Consequently, `dict` can be released after `ZSTD_DDict` creation */
-ZSTD_DDict* ZSTD_createDDict(const void* dict, size_t dictSize)
-{
-    ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    return ZSTD_createDDict_advanced(dict, dictSize, ZSTD_dlm_byCopy, allocator);
-}
-
-/*! ZSTD_createDDict_byReference() :
- *  Create a digested dictionary, to start decompression without startup delay.
- *  Dictionary content is simply referenced, it will be accessed during decompression.
- *  Warning : dictBuffer must outlive DDict (DDict must be freed before dictBuffer) */
-ZSTD_DDict* ZSTD_createDDict_byReference(const void* dictBuffer, size_t dictSize)
-{
-    ZSTD_customMem const allocator = { NULL, NULL, NULL };
-    return ZSTD_createDDict_advanced(dictBuffer, dictSize, ZSTD_dlm_byRef, allocator);
-}
-
-
-ZSTD_DDict* ZSTD_initStaticDDict(void* workspace, size_t workspaceSize,
-                                 const void* dict, size_t dictSize,
-                                 ZSTD_dictLoadMethod_e dictLoadMethod)
-{
-    size_t const neededSpace =
-            sizeof(ZSTD_DDict) + (dictLoadMethod == ZSTD_dlm_byRef ? 0 : dictSize);
-    ZSTD_DDict* const ddict = (ZSTD_DDict*)workspace;
-    assert(workspace != NULL);
-    assert(dict != NULL);
-    if ((size_t)workspace & 7) return NULL;  /* 8-aligned */
-    if (workspaceSize < neededSpace) return NULL;
-    if (dictLoadMethod == ZSTD_dlm_byCopy) {
-        memcpy(ddict+1, dict, dictSize);  /* local copy */
-        dict = ddict+1;
-    }
-    if (ZSTD_isError( ZSTD_initDDict_internal(ddict, dict, dictSize, ZSTD_dlm_byRef) ))
-        return NULL;
-    return ddict;
-}
-
-
-size_t ZSTD_freeDDict(ZSTD_DDict* ddict)
-{
-    if (ddict==NULL) return 0;   /* support free on NULL */
-    {   ZSTD_customMem const cMem = ddict->cMem;
-        ZSTD_free(ddict->dictBuffer, cMem);
-        ZSTD_free(ddict, cMem);
-        return 0;
-    }
-}
-
-/*! ZSTD_estimateDDictSize() :
- *  Estimate amount of memory that will be needed to create a dictionary for decompression.
- *  Note : dictionary created by reference using ZSTD_dlm_byRef are smaller */
-size_t ZSTD_estimateDDictSize(size_t dictSize, ZSTD_dictLoadMethod_e dictLoadMethod)
-{
-    return sizeof(ZSTD_DDict) + (dictLoadMethod == ZSTD_dlm_byRef ? 0 : dictSize);
-}
-
-size_t ZSTD_sizeof_DDict(const ZSTD_DDict* ddict)
-{
-    if (ddict==NULL) return 0;   /* support sizeof on NULL */
-    return sizeof(*ddict) + (ddict->dictBuffer ? ddict->dictSize : 0) ;
-}
-
-/*! ZSTD_getDictID_fromDict() :
- *  Provides the dictID stored within dictionary.
- *  if @return == 0, the dictionary is not conformant with Zstandard specification.
- *  It can still be loaded, but as a content-only dictionary. */
-unsigned ZSTD_getDictID_fromDict(const void* dict, size_t dictSize)
-{
-    if (dictSize < 8) return 0;
-    if (MEM_readLE32(dict) != ZSTD_MAGIC_DICTIONARY) return 0;
-    return MEM_readLE32((const char*)dict + ZSTD_frameIdSize);
-}
-
-/*! ZSTD_getDictID_fromDDict() :
- *  Provides the dictID of the dictionary loaded into `ddict`.
- *  If @return == 0, the dictionary is not conformant to Zstandard specification, or empty.
- *  Non-conformant dictionaries can still be loaded, but as content-only dictionaries. */
-unsigned ZSTD_getDictID_fromDDict(const ZSTD_DDict* ddict)
-{
-    if (ddict==NULL) return 0;
-    return ZSTD_getDictID_fromDict(ddict->dictContent, ddict->dictSize);
-}
-
-/*! ZSTD_getDictID_fromFrame() :
- *  Provides the dictID required to decompresse frame stored within `src`.
- *  If @return == 0, the dictID could not be decoded.
- *  This could for one of the following reasons :
- *  - The frame does not require a dictionary (most common case).
- *  - The frame was built with dictID intentionally removed.
- *    Needed dictionary is a hidden information.
- *    Note : this use case also happens when using a non-conformant dictionary.
- *  - `srcSize` is too small, and as a result, frame header could not be decoded.
- *    Note : possible if `srcSize < ZSTD_FRAMEHEADERSIZE_MAX`.
- *  - This is not a Zstandard frame.
- *  When identifying the exact failure cause, it's possible to use
- *  ZSTD_getFrameHeader(), which will provide a more precise error code. */
-unsigned ZSTD_getDictID_fromFrame(const void* src, size_t srcSize)
-{
-    ZSTD_frameHeader zfp = { 0, 0, 0, ZSTD_frame, 0, 0, 0 };
-    size_t const hError = ZSTD_getFrameHeader(&zfp, src, srcSize);
-    if (ZSTD_isError(hError)) return 0;
-    return zfp.dictID;
-}
-
-
-/*! ZSTD_decompress_usingDDict() :
-*   Decompression using a pre-digested Dictionary
-*   Use dictionary without significant overhead. */
-size_t ZSTD_decompress_usingDDict(ZSTD_DCtx* dctx,
-                                  void* dst, size_t dstCapacity,
-                            const void* src, size_t srcSize,
-                            const ZSTD_DDict* ddict)
-{
-    /* pass content and size in case legacy frames are encountered */
-    return ZSTD_decompressMultiFrame(dctx, dst, dstCapacity, src, srcSize,
-                                     NULL, 0,
-                                     ddict);
-}
-
-
-/*=====================================
-*   Streaming decompression
-*====================================*/
-
-ZSTD_DStream* ZSTD_createDStream(void)
-{
-    return ZSTD_createDStream_advanced(ZSTD_defaultCMem);
-}
-
-ZSTD_DStream* ZSTD_initStaticDStream(void *workspace, size_t workspaceSize)
-{
-    return ZSTD_initStaticDCtx(workspace, workspaceSize);
-}
-
-ZSTD_DStream* ZSTD_createDStream_advanced(ZSTD_customMem customMem)
-{
-    return ZSTD_createDCtx_advanced(customMem);
-}
-
-size_t ZSTD_freeDStream(ZSTD_DStream* zds)
-{
-    return ZSTD_freeDCtx(zds);
-}
-
-
-/* *** Initialization *** */
-
-size_t ZSTD_DStreamInSize(void)  { return ZSTD_BLOCKSIZE_MAX + ZSTD_blockHeaderSize; }
-size_t ZSTD_DStreamOutSize(void) { return ZSTD_BLOCKSIZE_MAX; }
-
-size_t ZSTD_initDStream_usingDict(ZSTD_DStream* zds, const void* dict, size_t dictSize)
-{
-    zds->streamStage = zdss_loadHeader;
-    zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-    ZSTD_freeDDict(zds->ddictLocal);
-    if (dict && dictSize >= 8) {
-        zds->ddictLocal = ZSTD_createDDict(dict, dictSize);
-        if (zds->ddictLocal == NULL) return ERROR(memory_allocation);
-    } else zds->ddictLocal = NULL;
-    zds->ddict = zds->ddictLocal;
-    zds->legacyVersion = 0;
-    zds->hostageByte = 0;
-    return ZSTD_frameHeaderSize_prefix;
-}
-
-/* note : this variant can't fail */
-size_t ZSTD_initDStream(ZSTD_DStream* zds)
-{
-    return ZSTD_initDStream_usingDict(zds, NULL, 0);
-}
-
-/* ZSTD_initDStream_usingDDict() :
- * ddict will just be referenced, and must outlive decompression session
- * this function cannot fail */
-size_t ZSTD_initDStream_usingDDict(ZSTD_DStream* zds, const ZSTD_DDict* ddict)
-{
-    size_t const initResult = ZSTD_initDStream(zds);
-    zds->ddict = ddict;
-    return initResult;
-}
-
-size_t ZSTD_resetDStream(ZSTD_DStream* zds)
-{
-    zds->streamStage = zdss_loadHeader;
-    zds->lhSize = zds->inPos = zds->outStart = zds->outEnd = 0;
-    zds->legacyVersion = 0;
-    zds->hostageByte = 0;
-    return ZSTD_frameHeaderSize_prefix;
-}
-
-size_t ZSTD_setDStreamParameter(ZSTD_DStream* zds,
-                                ZSTD_DStreamParameter_e paramType, unsigned paramValue)
-{
-    ZSTD_STATIC_ASSERT((unsigned)zdss_loadHeader >= (unsigned)zdss_init);
-    if ((unsigned)zds->streamStage > (unsigned)zdss_loadHeader)
-        return ERROR(stage_wrong);
-    switch(paramType)
-    {
-        default : return ERROR(parameter_unsupported);
-        case DStream_p_maxWindowSize :
-            DEBUGLOG(4, "setting maxWindowSize = %u KB", paramValue >> 10);
-            zds->maxWindowSize = paramValue ? paramValue : (U32)(-1);
-            break;
-    }
-    return 0;
-}
-
-size_t ZSTD_DCtx_setMaxWindowSize(ZSTD_DCtx* dctx, size_t maxWindowSize)
-{
-    ZSTD_STATIC_ASSERT((unsigned)zdss_loadHeader >= (unsigned)zdss_init);
-    if ((unsigned)dctx->streamStage > (unsigned)zdss_loadHeader)
-        return ERROR(stage_wrong);
-    dctx->maxWindowSize = maxWindowSize;
-    return 0;
-}
-
-size_t ZSTD_DCtx_setFormat(ZSTD_DCtx* dctx, ZSTD_format_e format)
-{
-    DEBUGLOG(4, "ZSTD_DCtx_setFormat : %u", (unsigned)format);
-    ZSTD_STATIC_ASSERT((unsigned)zdss_loadHeader >= (unsigned)zdss_init);
-    if ((unsigned)dctx->streamStage > (unsigned)zdss_loadHeader)
-        return ERROR(stage_wrong);
-    dctx->format = format;
-    return 0;
-}
-
-
-size_t ZSTD_sizeof_DStream(const ZSTD_DStream* zds)
-{
-    return ZSTD_sizeof_DCtx(zds);
-}
-
-size_t ZSTD_decodingBufferSize_min(unsigned long long windowSize, unsigned long long frameContentSize)
-{
-    size_t const blockSize = (size_t) MIN(windowSize, ZSTD_BLOCKSIZE_MAX);
-    unsigned long long const neededRBSize = windowSize + blockSize + (WILDCOPY_OVERLENGTH * 2);
-    unsigned long long const neededSize = MIN(frameContentSize, neededRBSize);
-    size_t const minRBSize = (size_t) neededSize;
-    if ((unsigned long long)minRBSize != neededSize) return ERROR(frameParameter_windowTooLarge);
-    return minRBSize;
-}
-
-size_t ZSTD_estimateDStreamSize(size_t windowSize)
-{
-    size_t const blockSize = MIN(windowSize, ZSTD_BLOCKSIZE_MAX);
-    size_t const inBuffSize = blockSize;  /* no block can be larger */
-    size_t const outBuffSize = ZSTD_decodingBufferSize_min(windowSize, ZSTD_CONTENTSIZE_UNKNOWN);
-    return ZSTD_estimateDCtxSize() + inBuffSize + outBuffSize;
-}
-
-size_t ZSTD_estimateDStreamSize_fromFrame(const void* src, size_t srcSize)
-{
-    U32 const windowSizeMax = 1U << ZSTD_WINDOWLOG_MAX;   /* note : should be user-selectable */
-    ZSTD_frameHeader zfh;
-    size_t const err = ZSTD_getFrameHeader(&zfh, src, srcSize);
-    if (ZSTD_isError(err)) return err;
-    if (err>0) return ERROR(srcSize_wrong);
-    if (zfh.windowSize > windowSizeMax)
-        return ERROR(frameParameter_windowTooLarge);
-    return ZSTD_estimateDStreamSize((size_t)zfh.windowSize);
-}
-
-
-/* *****   Decompression   ***** */
-
-MEM_STATIC size_t ZSTD_limitCopy(void* dst, size_t dstCapacity, const void* src, size_t srcSize)
-{
-    size_t const length = MIN(dstCapacity, srcSize);
-    memcpy(dst, src, length);
-    return length;
-}
-
-
-size_t ZSTD_decompressStream(ZSTD_DStream* zds, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
-{
-    const char* const istart = (const char*)(input->src) + input->pos;
-    const char* const iend = (const char*)(input->src) + input->size;
-    const char* ip = istart;
-    char* const ostart = (char*)(output->dst) + output->pos;
-    char* const oend = (char*)(output->dst) + output->size;
-    char* op = ostart;
-    U32 someMoreWork = 1;
-
-    DEBUGLOG(5, "ZSTD_decompressStream");
-    if (input->pos > input->size) {  /* forbidden */
-        DEBUGLOG(5, "in: pos: %u   vs size: %u",
-                    (U32)input->pos, (U32)input->size);
-        return ERROR(srcSize_wrong);
-    }
-    if (output->pos > output->size) {  /* forbidden */
-        DEBUGLOG(5, "out: pos: %u   vs size: %u",
-                    (U32)output->pos, (U32)output->size);
-        return ERROR(dstSize_tooSmall);
-    }
-    DEBUGLOG(5, "input size : %u", (U32)(input->size - input->pos));
-
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-    if (zds->legacyVersion) {
-        /* legacy support is incompatible with static dctx */
-        if (zds->staticSize) return ERROR(memory_allocation);
-        return ZSTD_decompressLegacyStream(zds->legacyContext, zds->legacyVersion, output, input);
-    }
-#endif
-
-    while (someMoreWork) {
-        switch(zds->streamStage)
-        {
-        case zdss_init :
-            ZSTD_resetDStream(zds);   /* transparent reset on starting decoding a new frame */
-            /* fall-through */
-
-        case zdss_loadHeader :
-            DEBUGLOG(5, "stage zdss_loadHeader (srcSize : %u)", (U32)(iend - ip));
-            {   size_t const hSize = ZSTD_getFrameHeader_internal(&zds->fParams, zds->headerBuffer, zds->lhSize, zds->format);
-                DEBUGLOG(5, "header size : %u", (U32)hSize);
-                if (ZSTD_isError(hSize)) {
-#if defined(ZSTD_LEGACY_SUPPORT) && (ZSTD_LEGACY_SUPPORT>=1)
-                    U32 const legacyVersion = ZSTD_isLegacy(istart, iend-istart);
-                    if (legacyVersion) {
-                        const void* const dict = zds->ddict ? zds->ddict->dictContent : NULL;
-                        size_t const dictSize = zds->ddict ? zds->ddict->dictSize : 0;
-                        /* legacy support is incompatible with static dctx */
-                        if (zds->staticSize) return ERROR(memory_allocation);
-                        CHECK_F(ZSTD_initLegacyStream(&zds->legacyContext,
-                                    zds->previousLegacyVersion, legacyVersion,
-                                    dict, dictSize));
-                        zds->legacyVersion = zds->previousLegacyVersion = legacyVersion;
-                        return ZSTD_decompressLegacyStream(zds->legacyContext, legacyVersion, output, input);
-                    }
-#endif
-                    return hSize;   /* error */
-                }
-                if (hSize != 0) {   /* need more input */
-                    size_t const toLoad = hSize - zds->lhSize;   /* if hSize!=0, hSize > zds->lhSize */
-                    size_t const remainingInput = (size_t)(iend-ip);
-                    assert(iend >= ip);
-                    if (toLoad > remainingInput) {   /* not enough input to load full header */
-                        if (remainingInput > 0) {
-                            memcpy(zds->headerBuffer + zds->lhSize, ip, remainingInput);
-                            zds->lhSize += remainingInput;
-                        }
-                        input->pos = input->size;
-                        return (MAX(ZSTD_frameHeaderSize_min, hSize) - zds->lhSize) + ZSTD_blockHeaderSize;   /* remaining header bytes + next block header */
-                    }
-                    assert(ip != NULL);
-                    memcpy(zds->headerBuffer + zds->lhSize, ip, toLoad); zds->lhSize = hSize; ip += toLoad;
-                    break;
-            }   }
-
-            /* check for single-pass mode opportunity */
-            if (zds->fParams.frameContentSize && zds->fParams.windowSize /* skippable frame if == 0 */
-                && (U64)(size_t)(oend-op) >= zds->fParams.frameContentSize) {
-                size_t const cSize = ZSTD_findFrameCompressedSize(istart, iend-istart);
-                if (cSize <= (size_t)(iend-istart)) {
-                    /* shortcut : using single-pass mode */
-                    size_t const decompressedSize = ZSTD_decompress_usingDDict(zds, op, oend-op, istart, cSize, zds->ddict);
-                    if (ZSTD_isError(decompressedSize)) return decompressedSize;
-                    DEBUGLOG(4, "shortcut to single-pass ZSTD_decompress_usingDDict()")
-                    ip = istart + cSize;
-                    op += decompressedSize;
-                    zds->expected = 0;
-                    zds->streamStage = zdss_init;
-                    someMoreWork = 0;
-                    break;
-            }   }
-
-            /* Consume header (see ZSTDds_decodeFrameHeader) */
-            DEBUGLOG(4, "Consume header");
-            CHECK_F(ZSTD_decompressBegin_usingDDict(zds, zds->ddict));
-
-            if ((MEM_readLE32(zds->headerBuffer) & 0xFFFFFFF0U) == ZSTD_MAGIC_SKIPPABLE_START) {  /* skippable frame */
-                zds->expected = MEM_readLE32(zds->headerBuffer + ZSTD_frameIdSize);
-                zds->stage = ZSTDds_skipFrame;
-            } else {
-                CHECK_F(ZSTD_decodeFrameHeader(zds, zds->headerBuffer, zds->lhSize));
-                zds->expected = ZSTD_blockHeaderSize;
-                zds->stage = ZSTDds_decodeBlockHeader;
-            }
-
-            /* control buffer memory usage */
-            DEBUGLOG(4, "Control max memory usage (%u KB <= max %u KB)",
-                        (U32)(zds->fParams.windowSize >>10),
-                        (U32)(zds->maxWindowSize >> 10) );
-            zds->fParams.windowSize = MAX(zds->fParams.windowSize, 1U << ZSTD_WINDOWLOG_ABSOLUTEMIN);
-            if (zds->fParams.windowSize > zds->maxWindowSize) return ERROR(frameParameter_windowTooLarge);
-
-            /* Adapt buffer sizes to frame header instructions */
-            {   size_t const neededInBuffSize = MAX(zds->fParams.blockSizeMax, 4 /* frame checksum */);
-                size_t const neededOutBuffSize = ZSTD_decodingBufferSize_min(zds->fParams.windowSize, zds->fParams.frameContentSize);
-                if ((zds->inBuffSize < neededInBuffSize) || (zds->outBuffSize < neededOutBuffSize)) {
-                    size_t const bufferSize = neededInBuffSize + neededOutBuffSize;
-                    DEBUGLOG(4, "inBuff  : from %u to %u",
-                                (U32)zds->inBuffSize, (U32)neededInBuffSize);
-                    DEBUGLOG(4, "outBuff : from %u to %u",
-                                (U32)zds->outBuffSize, (U32)neededOutBuffSize);
-                    if (zds->staticSize) {  /* static DCtx */
-                        DEBUGLOG(4, "staticSize : %u", (U32)zds->staticSize);
-                        assert(zds->staticSize >= sizeof(ZSTD_DCtx));  /* controlled at init */
-                        if (bufferSize > zds->staticSize - sizeof(ZSTD_DCtx))
-                            return ERROR(memory_allocation);
-                    } else {
-                        ZSTD_free(zds->inBuff, zds->customMem);
-                        zds->inBuffSize = 0;
-                        zds->outBuffSize = 0;
-                        zds->inBuff = (char*)ZSTD_malloc(bufferSize, zds->customMem);
-                        if (zds->inBuff == NULL) return ERROR(memory_allocation);
-                    }
-                    zds->inBuffSize = neededInBuffSize;
-                    zds->outBuff = zds->inBuff + zds->inBuffSize;
-                    zds->outBuffSize = neededOutBuffSize;
-            }   }
-            zds->streamStage = zdss_read;
-            /* fall-through */
-
-        case zdss_read:
-            DEBUGLOG(5, "stage zdss_read");
-            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds);
-                DEBUGLOG(5, "neededInSize = %u", (U32)neededInSize);
-                if (neededInSize==0) {  /* end of frame */
-                    zds->streamStage = zdss_init;
-                    someMoreWork = 0;
-                    break;
-                }
-                if ((size_t)(iend-ip) >= neededInSize) {  /* decode directly from src */
-                    int const isSkipFrame = ZSTD_isSkipFrame(zds);
-                    size_t const decodedSize = ZSTD_decompressContinue(zds,
-                        zds->outBuff + zds->outStart, (isSkipFrame ? 0 : zds->outBuffSize - zds->outStart),
-                        ip, neededInSize);
-                    if (ZSTD_isError(decodedSize)) return decodedSize;
-                    ip += neededInSize;
-                    if (!decodedSize && !isSkipFrame) break;   /* this was just a header */
-                    zds->outEnd = zds->outStart + decodedSize;
-                    zds->streamStage = zdss_flush;
-                    break;
-            }   }
-            if (ip==iend) { someMoreWork = 0; break; }   /* no more input */
-            zds->streamStage = zdss_load;
-            /* fall-through */
-        case zdss_load:
-            {   size_t const neededInSize = ZSTD_nextSrcSizeToDecompress(zds);
-                size_t const toLoad = neededInSize - zds->inPos;
-                int const isSkipFrame = ZSTD_isSkipFrame(zds);
-                size_t loadedSize;
-                if (isSkipFrame) {
-                    loadedSize = MIN(toLoad, (size_t)(iend-ip));
-                } else {
-                    if (toLoad > zds->inBuffSize - zds->inPos) return ERROR(corruption_detected);   /* should never happen */
-                    loadedSize = ZSTD_limitCopy(zds->inBuff + zds->inPos, toLoad, ip, iend-ip);
-                }
-                ip += loadedSize;
-                zds->inPos += loadedSize;
-                if (loadedSize < toLoad) { someMoreWork = 0; break; }   /* not enough input, wait for more */
-
-                /* decode loaded input */
-                {   size_t const decodedSize = ZSTD_decompressContinue(zds,
-                        zds->outBuff + zds->outStart, zds->outBuffSize - zds->outStart,
-                        zds->inBuff, neededInSize);
-                    if (ZSTD_isError(decodedSize)) return decodedSize;
-                    zds->inPos = 0;   /* input is consumed */
-                    if (!decodedSize && !isSkipFrame) { zds->streamStage = zdss_read; break; }   /* this was just a header */
-                    zds->outEnd = zds->outStart +  decodedSize;
-            }   }
-            zds->streamStage = zdss_flush;
-            /* fall-through */
-        case zdss_flush:
-            {   size_t const toFlushSize = zds->outEnd - zds->outStart;
-                size_t const flushedSize = ZSTD_limitCopy(op, oend-op, zds->outBuff + zds->outStart, toFlushSize);
-                op += flushedSize;
-                zds->outStart += flushedSize;
-                if (flushedSize == toFlushSize) {  /* flush completed */
-                    zds->streamStage = zdss_read;
-                    if ( (zds->outBuffSize < zds->fParams.frameContentSize)
-                      && (zds->outStart + zds->fParams.blockSizeMax > zds->outBuffSize) ) {
-                        DEBUGLOG(5, "restart filling outBuff from beginning (left:%i, needed:%u)",
-                                (int)(zds->outBuffSize - zds->outStart),
-                                (U32)zds->fParams.blockSizeMax);
-                        zds->outStart = zds->outEnd = 0;
-                    }
-                    break;
-            }   }
-            /* cannot complete flush */
-            someMoreWork = 0;
-            break;
-
-        default: return ERROR(GENERIC);   /* impossible */
-    }   }
-
-    /* result */
-    input->pos += (size_t)(ip-istart);
-    output->pos += (size_t)(op-ostart);
-    {   size_t nextSrcSizeHint = ZSTD_nextSrcSizeToDecompress(zds);
-        if (!nextSrcSizeHint) {   /* frame fully decoded */
-            if (zds->outEnd == zds->outStart) {  /* output fully flushed */
-                if (zds->hostageByte) {
-                    if (input->pos >= input->size) {
-                        /* can't release hostage (not present) */
-                        zds->streamStage = zdss_read;
-                        return 1;
-                    }
-                    input->pos++;  /* release hostage */
-                }   /* zds->hostageByte */
-                return 0;
-            }  /* zds->outEnd == zds->outStart */
-            if (!zds->hostageByte) { /* output not fully flushed; keep last byte as hostage; will be released when all output is flushed */
-                input->pos--;   /* note : pos > 0, otherwise, impossible to finish reading last block */
-                zds->hostageByte=1;
-            }
-            return 1;
-        }  /* nextSrcSizeHint==0 */
-        nextSrcSizeHint += ZSTD_blockHeaderSize * (ZSTD_nextInputType(zds) == ZSTDnit_block);   /* preload header of next block */
-        if (zds->inPos > nextSrcSizeHint) return ERROR(GENERIC);   /* should never happen */
-        nextSrcSizeHint -= zds->inPos;   /* already loaded*/
-        return nextSrcSizeHint;
-    }
-}
-
-
-size_t ZSTD_decompress_generic(ZSTD_DCtx* dctx, ZSTD_outBuffer* output, ZSTD_inBuffer* input)
-{
-    return ZSTD_decompressStream(dctx, output, input);
-}
-
-size_t ZSTD_decompress_generic_simpleArgs (
-                            ZSTD_DCtx* dctx,
-                            void* dst, size_t dstCapacity, size_t* dstPos,
-                      const void* src, size_t srcSize, size_t* srcPos)
-{
-    ZSTD_outBuffer output = { dst, dstCapacity, *dstPos };
-    ZSTD_inBuffer  input  = { src, srcSize, *srcPos };
-    /* ZSTD_compress_generic() will check validity of dstPos and srcPos */
-    size_t const cErr = ZSTD_decompress_generic(dctx, &output, &input);
-    *dstPos = output.pos;
-    *srcPos = input.pos;
-    return cErr;
-}
-
-void ZSTD_DCtx_reset(ZSTD_DCtx* dctx)
-{
-    (void)ZSTD_initDStream(dctx);
-    dctx->format = ZSTD_f_zstd1;
-    dctx->maxWindowSize = ZSTD_MAXWINDOWSIZE_DEFAULT;
-}
diff --git a/priv/zstd/lib/deprecated/zbuff.h b/priv/zstd/lib/deprecated/zbuff.h
deleted file mode 100644
index a93115d..0000000
--- a/priv/zstd/lib/deprecated/zbuff.h
+++ /dev/null
@@ -1,213 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/* ***************************************************************
-*  NOTES/WARNINGS
-******************************************************************/
-/* The streaming API defined here is deprecated.
- * Consider migrating towards ZSTD_compressStream() API in `zstd.h`
- * See 'lib/README.md'.
- *****************************************************************/
-
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-#ifndef ZSTD_BUFFERED_H_23987
-#define ZSTD_BUFFERED_H_23987
-
-/* *************************************
-*  Dependencies
-***************************************/
-#include       /* size_t */
-#include "zstd.h"        /* ZSTD_CStream, ZSTD_DStream, ZSTDLIB_API */
-
-
-/* ***************************************************************
-*  Compiler specifics
-*****************************************************************/
-/* Deprecation warnings */
-/* Should these warnings be a problem,
-   it is generally possible to disable them,
-   typically with -Wno-deprecated-declarations for gcc
-   or _CRT_SECURE_NO_WARNINGS in Visual.
-   Otherwise, it's also possible to define ZBUFF_DISABLE_DEPRECATE_WARNINGS */
-#ifdef ZBUFF_DISABLE_DEPRECATE_WARNINGS
-#  define ZBUFF_DEPRECATED(message) ZSTDLIB_API  /* disable deprecation warnings */
-#else
-#  if defined (__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */
-#    define ZBUFF_DEPRECATED(message) [[deprecated(message)]] ZSTDLIB_API
-#  elif (defined(__GNUC__) && (__GNUC__ >= 5)) || defined(__clang__)
-#    define ZBUFF_DEPRECATED(message) ZSTDLIB_API __attribute__((deprecated(message)))
-#  elif defined(__GNUC__) && (__GNUC__ >= 3)
-#    define ZBUFF_DEPRECATED(message) ZSTDLIB_API __attribute__((deprecated))
-#  elif defined(_MSC_VER)
-#    define ZBUFF_DEPRECATED(message) ZSTDLIB_API __declspec(deprecated(message))
-#  else
-#    pragma message("WARNING: You need to implement ZBUFF_DEPRECATED for this compiler")
-#    define ZBUFF_DEPRECATED(message) ZSTDLIB_API
-#  endif
-#endif /* ZBUFF_DISABLE_DEPRECATE_WARNINGS */
-
-
-/* *************************************
-*  Streaming functions
-***************************************/
-/* This is the easier "buffered" streaming API,
-*  using an internal buffer to lift all restrictions on user-provided buffers
-*  which can be any size, any place, for both input and output.
-*  ZBUFF and ZSTD are 100% interoperable,
-*  frames created by one can be decoded by the other one */
-
-typedef ZSTD_CStream ZBUFF_CCtx;
-ZBUFF_DEPRECATED("use ZSTD_createCStream") ZBUFF_CCtx* ZBUFF_createCCtx(void);
-ZBUFF_DEPRECATED("use ZSTD_freeCStream")   size_t      ZBUFF_freeCCtx(ZBUFF_CCtx* cctx);
-
-ZBUFF_DEPRECATED("use ZSTD_initCStream")           size_t ZBUFF_compressInit(ZBUFF_CCtx* cctx, int compressionLevel);
-ZBUFF_DEPRECATED("use ZSTD_initCStream_usingDict") size_t ZBUFF_compressInitDictionary(ZBUFF_CCtx* cctx, const void* dict, size_t dictSize, int compressionLevel);
-
-ZBUFF_DEPRECATED("use ZSTD_compressStream") size_t ZBUFF_compressContinue(ZBUFF_CCtx* cctx, void* dst, size_t* dstCapacityPtr, const void* src, size_t* srcSizePtr);
-ZBUFF_DEPRECATED("use ZSTD_flushStream")    size_t ZBUFF_compressFlush(ZBUFF_CCtx* cctx, void* dst, size_t* dstCapacityPtr);
-ZBUFF_DEPRECATED("use ZSTD_endStream")      size_t ZBUFF_compressEnd(ZBUFF_CCtx* cctx, void* dst, size_t* dstCapacityPtr);
-
-/*-*************************************************
-*  Streaming compression - howto
-*
-*  A ZBUFF_CCtx object is required to track streaming operation.
-*  Use ZBUFF_createCCtx() and ZBUFF_freeCCtx() to create/release resources.
-*  ZBUFF_CCtx objects can be reused multiple times.
-*
-*  Start by initializing ZBUF_CCtx.
-*  Use ZBUFF_compressInit() to start a new compression operation.
-*  Use ZBUFF_compressInitDictionary() for a compression which requires a dictionary.
-*
-*  Use ZBUFF_compressContinue() repetitively to consume input stream.
-*  *srcSizePtr and *dstCapacityPtr can be any size.
-*  The function will report how many bytes were read or written within *srcSizePtr and *dstCapacityPtr.
-*  Note that it may not consume the entire input, in which case it's up to the caller to present again remaining data.
-*  The content of `dst` will be overwritten (up to *dstCapacityPtr) at each call, so save its content if it matters or change @dst .
-*  @return : a hint to preferred nb of bytes to use as input for next function call (it's just a hint, to improve latency)
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  At any moment, it's possible to flush whatever data remains within buffer, using ZBUFF_compressFlush().
-*  The nb of bytes written into `dst` will be reported into *dstCapacityPtr.
-*  Note that the function cannot output more than *dstCapacityPtr,
-*  therefore, some content might still be left into internal buffer if *dstCapacityPtr is too small.
-*  @return : nb of bytes still present into internal buffer (0 if it's empty)
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  ZBUFF_compressEnd() instructs to finish a frame.
-*  It will perform a flush and write frame epilogue.
-*  The epilogue is required for decoders to consider a frame completed.
-*  Similar to ZBUFF_compressFlush(), it may not be able to output the entire internal buffer content if *dstCapacityPtr is too small.
-*  In which case, call again ZBUFF_compressFlush() to complete the flush.
-*  @return : nb of bytes still present into internal buffer (0 if it's empty)
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  Hint : _recommended buffer_ sizes (not compulsory) : ZBUFF_recommendedCInSize() / ZBUFF_recommendedCOutSize()
-*  input : ZBUFF_recommendedCInSize==128 KB block size is the internal unit, use this value to reduce intermediate stages (better latency)
-*  output : ZBUFF_recommendedCOutSize==ZSTD_compressBound(128 KB) + 3 + 3 : ensures it's always possible to write/flush/end a full block. Skip some buffering.
-*  By using both, it ensures that input will be entirely consumed, and output will always contain the result, reducing intermediate buffering.
-* **************************************************/
-
-
-typedef ZSTD_DStream ZBUFF_DCtx;
-ZBUFF_DEPRECATED("use ZSTD_createDStream") ZBUFF_DCtx* ZBUFF_createDCtx(void);
-ZBUFF_DEPRECATED("use ZSTD_freeDStream")   size_t      ZBUFF_freeDCtx(ZBUFF_DCtx* dctx);
-
-ZBUFF_DEPRECATED("use ZSTD_initDStream")           size_t ZBUFF_decompressInit(ZBUFF_DCtx* dctx);
-ZBUFF_DEPRECATED("use ZSTD_initDStream_usingDict") size_t ZBUFF_decompressInitDictionary(ZBUFF_DCtx* dctx, const void* dict, size_t dictSize);
-
-ZBUFF_DEPRECATED("use ZSTD_decompressStream") size_t ZBUFF_decompressContinue(ZBUFF_DCtx* dctx,
-                                            void* dst, size_t* dstCapacityPtr,
-                                      const void* src, size_t* srcSizePtr);
-
-/*-***************************************************************************
-*  Streaming decompression howto
-*
-*  A ZBUFF_DCtx object is required to track streaming operations.
-*  Use ZBUFF_createDCtx() and ZBUFF_freeDCtx() to create/release resources.
-*  Use ZBUFF_decompressInit() to start a new decompression operation,
-*   or ZBUFF_decompressInitDictionary() if decompression requires a dictionary.
-*  Note that ZBUFF_DCtx objects can be re-init multiple times.
-*
-*  Use ZBUFF_decompressContinue() repetitively to consume your input.
-*  *srcSizePtr and *dstCapacityPtr can be any size.
-*  The function will report how many bytes were read or written by modifying *srcSizePtr and *dstCapacityPtr.
-*  Note that it may not consume the entire input, in which case it's up to the caller to present remaining input again.
-*  The content of `dst` will be overwritten (up to *dstCapacityPtr) at each function call, so save its content if it matters, or change `dst`.
-*  @return : 0 when a frame is completely decoded and fully flushed,
-*            1 when there is still some data left within internal buffer to flush,
-*            >1 when more data is expected, with value being a suggested next input size (it's just a hint, which helps latency),
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  Hint : recommended buffer sizes (not compulsory) : ZBUFF_recommendedDInSize() and ZBUFF_recommendedDOutSize()
-*  output : ZBUFF_recommendedDOutSize== 128 KB block size is the internal unit, it ensures it's always possible to write a full block when decoded.
-*  input  : ZBUFF_recommendedDInSize == 128KB + 3;
-*           just follow indications from ZBUFF_decompressContinue() to minimize latency. It should always be <= 128 KB + 3 .
-* *******************************************************************************/
-
-
-/* *************************************
-*  Tool functions
-***************************************/
-ZBUFF_DEPRECATED("use ZSTD_isError")      unsigned ZBUFF_isError(size_t errorCode);
-ZBUFF_DEPRECATED("use ZSTD_getErrorName") const char* ZBUFF_getErrorName(size_t errorCode);
-
-/** Functions below provide recommended buffer sizes for Compression or Decompression operations.
-*   These sizes are just hints, they tend to offer better latency */
-ZBUFF_DEPRECATED("use ZSTD_CStreamInSize")  size_t ZBUFF_recommendedCInSize(void);
-ZBUFF_DEPRECATED("use ZSTD_CStreamOutSize") size_t ZBUFF_recommendedCOutSize(void);
-ZBUFF_DEPRECATED("use ZSTD_DStreamInSize")  size_t ZBUFF_recommendedDInSize(void);
-ZBUFF_DEPRECATED("use ZSTD_DStreamOutSize") size_t ZBUFF_recommendedDOutSize(void);
-
-#endif  /* ZSTD_BUFFERED_H_23987 */
-
-
-#ifdef ZBUFF_STATIC_LINKING_ONLY
-#ifndef ZBUFF_STATIC_H_30298098432
-#define ZBUFF_STATIC_H_30298098432
-
-/* ====================================================================================
- * The definitions in this section are considered experimental.
- * They should never be used in association with a dynamic library, as they may change in the future.
- * They are provided for advanced usages.
- * Use them only in association with static linking.
- * ==================================================================================== */
-
-/*--- Dependency ---*/
-#define ZSTD_STATIC_LINKING_ONLY   /* ZSTD_parameters, ZSTD_customMem */
-#include "zstd.h"
-
-
-/*--- Custom memory allocator ---*/
-/*! ZBUFF_createCCtx_advanced() :
- *  Create a ZBUFF compression context using external alloc and free functions */
-ZBUFF_DEPRECATED("use ZSTD_createCStream_advanced") ZBUFF_CCtx* ZBUFF_createCCtx_advanced(ZSTD_customMem customMem);
-
-/*! ZBUFF_createDCtx_advanced() :
- *  Create a ZBUFF decompression context using external alloc and free functions */
-ZBUFF_DEPRECATED("use ZSTD_createDStream_advanced") ZBUFF_DCtx* ZBUFF_createDCtx_advanced(ZSTD_customMem customMem);
-
-
-/*--- Advanced Streaming Initialization ---*/
-ZBUFF_DEPRECATED("use ZSTD_initDStream_usingDict") size_t ZBUFF_compressInit_advanced(ZBUFF_CCtx* zbc,
-                                               const void* dict, size_t dictSize,
-                                               ZSTD_parameters params, unsigned long long pledgedSrcSize);
-
-
-#endif    /* ZBUFF_STATIC_H_30298098432 */
-#endif    /* ZBUFF_STATIC_LINKING_ONLY */
-
-
-#if defined (__cplusplus)
-}
-#endif
diff --git a/priv/zstd/lib/deprecated/zbuff_common.c b/priv/zstd/lib/deprecated/zbuff_common.c
deleted file mode 100644
index 661b9b0..0000000
--- a/priv/zstd/lib/deprecated/zbuff_common.c
+++ /dev/null
@@ -1,26 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include "error_private.h"
-#include "zbuff.h"
-
-/*-****************************************
-*  ZBUFF Error Management  (deprecated)
-******************************************/
-
-/*! ZBUFF_isError() :
-*   tells if a return value is an error code */
-unsigned ZBUFF_isError(size_t errorCode) { return ERR_isError(errorCode); }
-/*! ZBUFF_getErrorName() :
-*   provides error code string from function result (useful for debugging) */
-const char* ZBUFF_getErrorName(size_t errorCode) { return ERR_getErrorName(errorCode); }
diff --git a/priv/zstd/lib/deprecated/zbuff_compress.c b/priv/zstd/lib/deprecated/zbuff_compress.c
deleted file mode 100644
index f39c60d..0000000
--- a/priv/zstd/lib/deprecated/zbuff_compress.c
+++ /dev/null
@@ -1,147 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-
-/* *************************************
-*  Dependencies
-***************************************/
-#define ZBUFF_STATIC_LINKING_ONLY
-#include "zbuff.h"
-
-
-/*-***********************************************************
-*  Streaming compression
-*
-*  A ZBUFF_CCtx object is required to track streaming operation.
-*  Use ZBUFF_createCCtx() and ZBUFF_freeCCtx() to create/release resources.
-*  Use ZBUFF_compressInit() to start a new compression operation.
-*  ZBUFF_CCtx objects can be reused multiple times.
-*
-*  Use ZBUFF_compressContinue() repetitively to consume your input.
-*  *srcSizePtr and *dstCapacityPtr can be any size.
-*  The function will report how many bytes were read or written by modifying *srcSizePtr and *dstCapacityPtr.
-*  Note that it may not consume the entire input, in which case it's up to the caller to call again the function with remaining input.
-*  The content of dst will be overwritten (up to *dstCapacityPtr) at each function call, so save its content if it matters or change dst .
-*  @return : a hint to preferred nb of bytes to use as input for next function call (it's only a hint, to improve latency)
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  ZBUFF_compressFlush() can be used to instruct ZBUFF to compress and output whatever remains within its buffer.
-*  Note that it will not output more than *dstCapacityPtr.
-*  Therefore, some content might still be left into its internal buffer if dst buffer is too small.
-*  @return : nb of bytes still present into internal buffer (0 if it's empty)
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  ZBUFF_compressEnd() instructs to finish a frame.
-*  It will perform a flush and write frame epilogue.
-*  Similar to ZBUFF_compressFlush(), it may not be able to output the entire internal buffer content if *dstCapacityPtr is too small.
-*  @return : nb of bytes still present into internal buffer (0 if it's empty)
-*            or an error code, which can be tested using ZBUFF_isError().
-*
-*  Hint : recommended buffer sizes (not compulsory)
-*  input : ZSTD_BLOCKSIZE_MAX (128 KB), internal unit size, it improves latency to use this value.
-*  output : ZSTD_compressBound(ZSTD_BLOCKSIZE_MAX) + ZSTD_blockHeaderSize + ZBUFF_endFrameSize : ensures it's always possible to write/flush/end a full block at best speed.
-* ***********************************************************/
-
-ZBUFF_CCtx* ZBUFF_createCCtx(void)
-{
-    return ZSTD_createCStream();
-}
-
-ZBUFF_CCtx* ZBUFF_createCCtx_advanced(ZSTD_customMem customMem)
-{
-    return ZSTD_createCStream_advanced(customMem);
-}
-
-size_t ZBUFF_freeCCtx(ZBUFF_CCtx* zbc)
-{
-    return ZSTD_freeCStream(zbc);
-}
-
-
-/* ======   Initialization   ====== */
-
-size_t ZBUFF_compressInit_advanced(ZBUFF_CCtx* zbc,
-                                   const void* dict, size_t dictSize,
-                                   ZSTD_parameters params, unsigned long long pledgedSrcSize)
-{
-    if (pledgedSrcSize==0) pledgedSrcSize = ZSTD_CONTENTSIZE_UNKNOWN;  /* preserve "0 == unknown" behavior */
-    return ZSTD_initCStream_advanced(zbc, dict, dictSize, params, pledgedSrcSize);
-}
-
-
-size_t ZBUFF_compressInitDictionary(ZBUFF_CCtx* zbc, const void* dict, size_t dictSize, int compressionLevel)
-{
-    return ZSTD_initCStream_usingDict(zbc, dict, dictSize, compressionLevel);
-}
-
-size_t ZBUFF_compressInit(ZBUFF_CCtx* zbc, int compressionLevel)
-{
-    return ZSTD_initCStream(zbc, compressionLevel);
-}
-
-/* ======   Compression   ====== */
-
-
-size_t ZBUFF_compressContinue(ZBUFF_CCtx* zbc,
-                              void* dst, size_t* dstCapacityPtr,
-                        const void* src, size_t* srcSizePtr)
-{
-    size_t result;
-    ZSTD_outBuffer outBuff;
-    ZSTD_inBuffer inBuff;
-    outBuff.dst = dst;
-    outBuff.pos = 0;
-    outBuff.size = *dstCapacityPtr;
-    inBuff.src = src;
-    inBuff.pos = 0;
-    inBuff.size = *srcSizePtr;
-    result = ZSTD_compressStream(zbc, &outBuff, &inBuff);
-    *dstCapacityPtr = outBuff.pos;
-    *srcSizePtr = inBuff.pos;
-    return result;
-}
-
-
-
-/* ======   Finalize   ====== */
-
-size_t ZBUFF_compressFlush(ZBUFF_CCtx* zbc, void* dst, size_t* dstCapacityPtr)
-{
-    size_t result;
-    ZSTD_outBuffer outBuff;
-    outBuff.dst = dst;
-    outBuff.pos = 0;
-    outBuff.size = *dstCapacityPtr;
-    result = ZSTD_flushStream(zbc, &outBuff);
-    *dstCapacityPtr = outBuff.pos;
-    return result;
-}
-
-
-size_t ZBUFF_compressEnd(ZBUFF_CCtx* zbc, void* dst, size_t* dstCapacityPtr)
-{
-    size_t result;
-    ZSTD_outBuffer outBuff;
-    outBuff.dst = dst;
-    outBuff.pos = 0;
-    outBuff.size = *dstCapacityPtr;
-    result = ZSTD_endStream(zbc, &outBuff);
-    *dstCapacityPtr = outBuff.pos;
-    return result;
-}
-
-
-
-/* *************************************
-*  Tool functions
-***************************************/
-size_t ZBUFF_recommendedCInSize(void)  { return ZSTD_CStreamInSize(); }
-size_t ZBUFF_recommendedCOutSize(void) { return ZSTD_CStreamOutSize(); }
diff --git a/priv/zstd/lib/deprecated/zbuff_decompress.c b/priv/zstd/lib/deprecated/zbuff_decompress.c
deleted file mode 100644
index 923c22b..0000000
--- a/priv/zstd/lib/deprecated/zbuff_decompress.c
+++ /dev/null
@@ -1,75 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-
-/* *************************************
-*  Dependencies
-***************************************/
-#define ZBUFF_STATIC_LINKING_ONLY
-#include "zbuff.h"
-
-
-ZBUFF_DCtx* ZBUFF_createDCtx(void)
-{
-    return ZSTD_createDStream();
-}
-
-ZBUFF_DCtx* ZBUFF_createDCtx_advanced(ZSTD_customMem customMem)
-{
-    return ZSTD_createDStream_advanced(customMem);
-}
-
-size_t ZBUFF_freeDCtx(ZBUFF_DCtx* zbd)
-{
-    return ZSTD_freeDStream(zbd);
-}
-
-
-/* *** Initialization *** */
-
-size_t ZBUFF_decompressInitDictionary(ZBUFF_DCtx* zbd, const void* dict, size_t dictSize)
-{
-    return ZSTD_initDStream_usingDict(zbd, dict, dictSize);
-}
-
-size_t ZBUFF_decompressInit(ZBUFF_DCtx* zbd)
-{
-    return ZSTD_initDStream(zbd);
-}
-
-
-/* *** Decompression *** */
-
-size_t ZBUFF_decompressContinue(ZBUFF_DCtx* zbd,
-                                void* dst, size_t* dstCapacityPtr,
-                          const void* src, size_t* srcSizePtr)
-{
-    ZSTD_outBuffer outBuff;
-    ZSTD_inBuffer inBuff;
-    size_t result;
-    outBuff.dst  = dst;
-    outBuff.pos  = 0;
-    outBuff.size = *dstCapacityPtr;
-    inBuff.src  = src;
-    inBuff.pos  = 0;
-    inBuff.size = *srcSizePtr;
-    result = ZSTD_decompressStream(zbd, &outBuff, &inBuff);
-    *dstCapacityPtr = outBuff.pos;
-    *srcSizePtr = inBuff.pos;
-    return result;
-}
-
-
-/* *************************************
-*  Tool functions
-***************************************/
-size_t ZBUFF_recommendedDInSize(void)  { return ZSTD_DStreamInSize(); }
-size_t ZBUFF_recommendedDOutSize(void) { return ZSTD_DStreamOutSize(); }
diff --git a/priv/zstd/lib/dictBuilder/cover.c b/priv/zstd/lib/dictBuilder/cover.c
deleted file mode 100644
index efdffdd..0000000
--- a/priv/zstd/lib/dictBuilder/cover.c
+++ /dev/null
@@ -1,1045 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-/* *****************************************************************************
- * Constructs a dictionary using a heuristic based on the following paper:
- *
- * Liao, Petri, Moffat, Wirth
- * Effective Construction of Relative Lempel-Ziv Dictionaries
- * Published in WWW 2016.
- *
- * Adapted from code originally written by @ot (Giuseppe Ottaviano).
- ******************************************************************************/
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include   /* fprintf */
-#include  /* malloc, free, qsort */
-#include  /* memset */
-#include    /* clock */
-
-#include "mem.h" /* read */
-#include "pool.h"
-#include "threading.h"
-#include "zstd_internal.h" /* includes zstd.h */
-#ifndef ZDICT_STATIC_LINKING_ONLY
-#define ZDICT_STATIC_LINKING_ONLY
-#endif
-#include "zdict.h"
-
-/*-*************************************
-*  Constants
-***************************************/
-#define COVER_MAX_SAMPLES_SIZE (sizeof(size_t) == 8 ? ((U32)-1) : ((U32)1 GB))
-
-/*-*************************************
-*  Console display
-***************************************/
-static int g_displayLevel = 2;
-#define DISPLAY(...)                                                           \
-  {                                                                            \
-    fprintf(stderr, __VA_ARGS__);                                              \
-    fflush(stderr);                                                            \
-  }
-#define LOCALDISPLAYLEVEL(displayLevel, l, ...)                                \
-  if (displayLevel >= l) {                                                     \
-    DISPLAY(__VA_ARGS__);                                                      \
-  } /* 0 : no display;   1: errors;   2: default;  3: details;  4: debug */
-#define DISPLAYLEVEL(l, ...) LOCALDISPLAYLEVEL(g_displayLevel, l, __VA_ARGS__)
-
-#define LOCALDISPLAYUPDATE(displayLevel, l, ...)                               \
-  if (displayLevel >= l) {                                                     \
-    if ((clock() - g_time > refreshRate) || (displayLevel >= 4)) {             \
-      g_time = clock();                                                        \
-      DISPLAY(__VA_ARGS__);                                                    \
-    }                                                                          \
-  }
-#define DISPLAYUPDATE(l, ...) LOCALDISPLAYUPDATE(g_displayLevel, l, __VA_ARGS__)
-static const clock_t refreshRate = CLOCKS_PER_SEC * 15 / 100;
-static clock_t g_time = 0;
-
-/*-*************************************
-* Hash table
-***************************************
-* A small specialized hash map for storing activeDmers.
-* The map does not resize, so if it becomes full it will loop forever.
-* Thus, the map must be large enough to store every value.
-* The map implements linear probing and keeps its load less than 0.5.
-*/
-
-#define MAP_EMPTY_VALUE ((U32)-1)
-typedef struct COVER_map_pair_t_s {
-  U32 key;
-  U32 value;
-} COVER_map_pair_t;
-
-typedef struct COVER_map_s {
-  COVER_map_pair_t *data;
-  U32 sizeLog;
-  U32 size;
-  U32 sizeMask;
-} COVER_map_t;
-
-/**
- * Clear the map.
- */
-static void COVER_map_clear(COVER_map_t *map) {
-  memset(map->data, MAP_EMPTY_VALUE, map->size * sizeof(COVER_map_pair_t));
-}
-
-/**
- * Initializes a map of the given size.
- * Returns 1 on success and 0 on failure.
- * The map must be destroyed with COVER_map_destroy().
- * The map is only guaranteed to be large enough to hold size elements.
- */
-static int COVER_map_init(COVER_map_t *map, U32 size) {
-  map->sizeLog = ZSTD_highbit32(size) + 2;
-  map->size = (U32)1 << map->sizeLog;
-  map->sizeMask = map->size - 1;
-  map->data = (COVER_map_pair_t *)malloc(map->size * sizeof(COVER_map_pair_t));
-  if (!map->data) {
-    map->sizeLog = 0;
-    map->size = 0;
-    return 0;
-  }
-  COVER_map_clear(map);
-  return 1;
-}
-
-/**
- * Internal hash function
- */
-static const U32 prime4bytes = 2654435761U;
-static U32 COVER_map_hash(COVER_map_t *map, U32 key) {
-  return (key * prime4bytes) >> (32 - map->sizeLog);
-}
-
-/**
- * Helper function that returns the index that a key should be placed into.
- */
-static U32 COVER_map_index(COVER_map_t *map, U32 key) {
-  const U32 hash = COVER_map_hash(map, key);
-  U32 i;
-  for (i = hash;; i = (i + 1) & map->sizeMask) {
-    COVER_map_pair_t *pos = &map->data[i];
-    if (pos->value == MAP_EMPTY_VALUE) {
-      return i;
-    }
-    if (pos->key == key) {
-      return i;
-    }
-  }
-}
-
-/**
- * Returns the pointer to the value for key.
- * If key is not in the map, it is inserted and the value is set to 0.
- * The map must not be full.
- */
-static U32 *COVER_map_at(COVER_map_t *map, U32 key) {
-  COVER_map_pair_t *pos = &map->data[COVER_map_index(map, key)];
-  if (pos->value == MAP_EMPTY_VALUE) {
-    pos->key = key;
-    pos->value = 0;
-  }
-  return &pos->value;
-}
-
-/**
- * Deletes key from the map if present.
- */
-static void COVER_map_remove(COVER_map_t *map, U32 key) {
-  U32 i = COVER_map_index(map, key);
-  COVER_map_pair_t *del = &map->data[i];
-  U32 shift = 1;
-  if (del->value == MAP_EMPTY_VALUE) {
-    return;
-  }
-  for (i = (i + 1) & map->sizeMask;; i = (i + 1) & map->sizeMask) {
-    COVER_map_pair_t *const pos = &map->data[i];
-    /* If the position is empty we are done */
-    if (pos->value == MAP_EMPTY_VALUE) {
-      del->value = MAP_EMPTY_VALUE;
-      return;
-    }
-    /* If pos can be moved to del do so */
-    if (((i - COVER_map_hash(map, pos->key)) & map->sizeMask) >= shift) {
-      del->key = pos->key;
-      del->value = pos->value;
-      del = pos;
-      shift = 1;
-    } else {
-      ++shift;
-    }
-  }
-}
-
-/**
- * Destroyes a map that is inited with COVER_map_init().
- */
-static void COVER_map_destroy(COVER_map_t *map) {
-  if (map->data) {
-    free(map->data);
-  }
-  map->data = NULL;
-  map->size = 0;
-}
-
-/*-*************************************
-* Context
-***************************************/
-
-typedef struct {
-  const BYTE *samples;
-  size_t *offsets;
-  const size_t *samplesSizes;
-  size_t nbSamples;
-  U32 *suffix;
-  size_t suffixSize;
-  U32 *freqs;
-  U32 *dmerAt;
-  unsigned d;
-} COVER_ctx_t;
-
-/* We need a global context for qsort... */
-static COVER_ctx_t *g_ctx = NULL;
-
-/*-*************************************
-*  Helper functions
-***************************************/
-
-/**
- * Returns the sum of the sample sizes.
- */
-static size_t COVER_sum(const size_t *samplesSizes, unsigned nbSamples) {
-  size_t sum = 0;
-  size_t i;
-  for (i = 0; i < nbSamples; ++i) {
-    sum += samplesSizes[i];
-  }
-  return sum;
-}
-
-/**
- * Returns -1 if the dmer at lp is less than the dmer at rp.
- * Return 0 if the dmers at lp and rp are equal.
- * Returns 1 if the dmer at lp is greater than the dmer at rp.
- */
-static int COVER_cmp(COVER_ctx_t *ctx, const void *lp, const void *rp) {
-  U32 const lhs = *(U32 const *)lp;
-  U32 const rhs = *(U32 const *)rp;
-  return memcmp(ctx->samples + lhs, ctx->samples + rhs, ctx->d);
-}
-/**
- * Faster version for d <= 8.
- */
-static int COVER_cmp8(COVER_ctx_t *ctx, const void *lp, const void *rp) {
-  U64 const mask = (ctx->d == 8) ? (U64)-1 : (((U64)1 << (8 * ctx->d)) - 1);
-  U64 const lhs = MEM_readLE64(ctx->samples + *(U32 const *)lp) & mask;
-  U64 const rhs = MEM_readLE64(ctx->samples + *(U32 const *)rp) & mask;
-  if (lhs < rhs) {
-    return -1;
-  }
-  return (lhs > rhs);
-}
-
-/**
- * Same as COVER_cmp() except ties are broken by pointer value
- * NOTE: g_ctx must be set to call this function.  A global is required because
- * qsort doesn't take an opaque pointer.
- */
-static int COVER_strict_cmp(const void *lp, const void *rp) {
-  int result = COVER_cmp(g_ctx, lp, rp);
-  if (result == 0) {
-    result = lp < rp ? -1 : 1;
-  }
-  return result;
-}
-/**
- * Faster version for d <= 8.
- */
-static int COVER_strict_cmp8(const void *lp, const void *rp) {
-  int result = COVER_cmp8(g_ctx, lp, rp);
-  if (result == 0) {
-    result = lp < rp ? -1 : 1;
-  }
-  return result;
-}
-
-/**
- * Returns the first pointer in [first, last) whose element does not compare
- * less than value.  If no such element exists it returns last.
- */
-static const size_t *COVER_lower_bound(const size_t *first, const size_t *last,
-                                       size_t value) {
-  size_t count = last - first;
-  while (count != 0) {
-    size_t step = count / 2;
-    const size_t *ptr = first;
-    ptr += step;
-    if (*ptr < value) {
-      first = ++ptr;
-      count -= step + 1;
-    } else {
-      count = step;
-    }
-  }
-  return first;
-}
-
-/**
- * Generic groupBy function.
- * Groups an array sorted by cmp into groups with equivalent values.
- * Calls grp for each group.
- */
-static void
-COVER_groupBy(const void *data, size_t count, size_t size, COVER_ctx_t *ctx,
-              int (*cmp)(COVER_ctx_t *, const void *, const void *),
-              void (*grp)(COVER_ctx_t *, const void *, const void *)) {
-  const BYTE *ptr = (const BYTE *)data;
-  size_t num = 0;
-  while (num < count) {
-    const BYTE *grpEnd = ptr + size;
-    ++num;
-    while (num < count && cmp(ctx, ptr, grpEnd) == 0) {
-      grpEnd += size;
-      ++num;
-    }
-    grp(ctx, ptr, grpEnd);
-    ptr = grpEnd;
-  }
-}
-
-/*-*************************************
-*  Cover functions
-***************************************/
-
-/**
- * Called on each group of positions with the same dmer.
- * Counts the frequency of each dmer and saves it in the suffix array.
- * Fills `ctx->dmerAt`.
- */
-static void COVER_group(COVER_ctx_t *ctx, const void *group,
-                        const void *groupEnd) {
-  /* The group consists of all the positions with the same first d bytes. */
-  const U32 *grpPtr = (const U32 *)group;
-  const U32 *grpEnd = (const U32 *)groupEnd;
-  /* The dmerId is how we will reference this dmer.
-   * This allows us to map the whole dmer space to a much smaller space, the
-   * size of the suffix array.
-   */
-  const U32 dmerId = (U32)(grpPtr - ctx->suffix);
-  /* Count the number of samples this dmer shows up in */
-  U32 freq = 0;
-  /* Details */
-  const size_t *curOffsetPtr = ctx->offsets;
-  const size_t *offsetsEnd = ctx->offsets + ctx->nbSamples;
-  /* Once *grpPtr >= curSampleEnd this occurrence of the dmer is in a
-   * different sample than the last.
-   */
-  size_t curSampleEnd = ctx->offsets[0];
-  for (; grpPtr != grpEnd; ++grpPtr) {
-    /* Save the dmerId for this position so we can get back to it. */
-    ctx->dmerAt[*grpPtr] = dmerId;
-    /* Dictionaries only help for the first reference to the dmer.
-     * After that zstd can reference the match from the previous reference.
-     * So only count each dmer once for each sample it is in.
-     */
-    if (*grpPtr < curSampleEnd) {
-      continue;
-    }
-    freq += 1;
-    /* Binary search to find the end of the sample *grpPtr is in.
-     * In the common case that grpPtr + 1 == grpEnd we can skip the binary
-     * search because the loop is over.
-     */
-    if (grpPtr + 1 != grpEnd) {
-      const size_t *sampleEndPtr =
-          COVER_lower_bound(curOffsetPtr, offsetsEnd, *grpPtr);
-      curSampleEnd = *sampleEndPtr;
-      curOffsetPtr = sampleEndPtr + 1;
-    }
-  }
-  /* At this point we are never going to look at this segment of the suffix
-   * array again.  We take advantage of this fact to save memory.
-   * We store the frequency of the dmer in the first position of the group,
-   * which is dmerId.
-   */
-  ctx->suffix[dmerId] = freq;
-}
-
-/**
- * A segment is a range in the source as well as the score of the segment.
- */
-typedef struct {
-  U32 begin;
-  U32 end;
-  U32 score;
-} COVER_segment_t;
-
-/**
- * Selects the best segment in an epoch.
- * Segments of are scored according to the function:
- *
- * Let F(d) be the frequency of dmer d.
- * Let S_i be the dmer at position i of segment S which has length k.
- *
- *     Score(S) = F(S_1) + F(S_2) + ... + F(S_{k-d+1})
- *
- * Once the dmer d is in the dictionay we set F(d) = 0.
- */
-static COVER_segment_t COVER_selectSegment(const COVER_ctx_t *ctx, U32 *freqs,
-                                           COVER_map_t *activeDmers, U32 begin,
-                                           U32 end,
-                                           ZDICT_cover_params_t parameters) {
-  /* Constants */
-  const U32 k = parameters.k;
-  const U32 d = parameters.d;
-  const U32 dmersInK = k - d + 1;
-  /* Try each segment (activeSegment) and save the best (bestSegment) */
-  COVER_segment_t bestSegment = {0, 0, 0};
-  COVER_segment_t activeSegment;
-  /* Reset the activeDmers in the segment */
-  COVER_map_clear(activeDmers);
-  /* The activeSegment starts at the beginning of the epoch. */
-  activeSegment.begin = begin;
-  activeSegment.end = begin;
-  activeSegment.score = 0;
-  /* Slide the activeSegment through the whole epoch.
-   * Save the best segment in bestSegment.
-   */
-  while (activeSegment.end < end) {
-    /* The dmerId for the dmer at the next position */
-    U32 newDmer = ctx->dmerAt[activeSegment.end];
-    /* The entry in activeDmers for this dmerId */
-    U32 *newDmerOcc = COVER_map_at(activeDmers, newDmer);
-    /* If the dmer isn't already present in the segment add its score. */
-    if (*newDmerOcc == 0) {
-      /* The paper suggest using the L-0.5 norm, but experiments show that it
-       * doesn't help.
-       */
-      activeSegment.score += freqs[newDmer];
-    }
-    /* Add the dmer to the segment */
-    activeSegment.end += 1;
-    *newDmerOcc += 1;
-
-    /* If the window is now too large, drop the first position */
-    if (activeSegment.end - activeSegment.begin == dmersInK + 1) {
-      U32 delDmer = ctx->dmerAt[activeSegment.begin];
-      U32 *delDmerOcc = COVER_map_at(activeDmers, delDmer);
-      activeSegment.begin += 1;
-      *delDmerOcc -= 1;
-      /* If this is the last occurence of the dmer, subtract its score */
-      if (*delDmerOcc == 0) {
-        COVER_map_remove(activeDmers, delDmer);
-        activeSegment.score -= freqs[delDmer];
-      }
-    }
-
-    /* If this segment is the best so far save it */
-    if (activeSegment.score > bestSegment.score) {
-      bestSegment = activeSegment;
-    }
-  }
-  {
-    /* Trim off the zero frequency head and tail from the segment. */
-    U32 newBegin = bestSegment.end;
-    U32 newEnd = bestSegment.begin;
-    U32 pos;
-    for (pos = bestSegment.begin; pos != bestSegment.end; ++pos) {
-      U32 freq = freqs[ctx->dmerAt[pos]];
-      if (freq != 0) {
-        newBegin = MIN(newBegin, pos);
-        newEnd = pos + 1;
-      }
-    }
-    bestSegment.begin = newBegin;
-    bestSegment.end = newEnd;
-  }
-  {
-    /* Zero out the frequency of each dmer covered by the chosen segment. */
-    U32 pos;
-    for (pos = bestSegment.begin; pos != bestSegment.end; ++pos) {
-      freqs[ctx->dmerAt[pos]] = 0;
-    }
-  }
-  return bestSegment;
-}
-
-/**
- * Check the validity of the parameters.
- * Returns non-zero if the parameters are valid and 0 otherwise.
- */
-static int COVER_checkParameters(ZDICT_cover_params_t parameters,
-                                 size_t maxDictSize) {
-  /* k and d are required parameters */
-  if (parameters.d == 0 || parameters.k == 0) {
-    return 0;
-  }
-  /* k <= maxDictSize */
-  if (parameters.k > maxDictSize) {
-    return 0;
-  }
-  /* d <= k */
-  if (parameters.d > parameters.k) {
-    return 0;
-  }
-  return 1;
-}
-
-/**
- * Clean up a context initialized with `COVER_ctx_init()`.
- */
-static void COVER_ctx_destroy(COVER_ctx_t *ctx) {
-  if (!ctx) {
-    return;
-  }
-  if (ctx->suffix) {
-    free(ctx->suffix);
-    ctx->suffix = NULL;
-  }
-  if (ctx->freqs) {
-    free(ctx->freqs);
-    ctx->freqs = NULL;
-  }
-  if (ctx->dmerAt) {
-    free(ctx->dmerAt);
-    ctx->dmerAt = NULL;
-  }
-  if (ctx->offsets) {
-    free(ctx->offsets);
-    ctx->offsets = NULL;
-  }
-}
-
-/**
- * Prepare a context for dictionary building.
- * The context is only dependent on the parameter `d` and can used multiple
- * times.
- * Returns 1 on success or zero on error.
- * The context must be destroyed with `COVER_ctx_destroy()`.
- */
-static int COVER_ctx_init(COVER_ctx_t *ctx, const void *samplesBuffer,
-                          const size_t *samplesSizes, unsigned nbSamples,
-                          unsigned d) {
-  const BYTE *const samples = (const BYTE *)samplesBuffer;
-  const size_t totalSamplesSize = COVER_sum(samplesSizes, nbSamples);
-  /* Checks */
-  if (totalSamplesSize < MAX(d, sizeof(U64)) ||
-      totalSamplesSize >= (size_t)COVER_MAX_SAMPLES_SIZE) {
-    DISPLAYLEVEL(1, "Total samples size is too large, maximum size is %u MB\n",
-                 (COVER_MAX_SAMPLES_SIZE >> 20));
-    return 0;
-  }
-  /* Zero the context */
-  memset(ctx, 0, sizeof(*ctx));
-  DISPLAYLEVEL(2, "Training on %u samples of total size %u\n", nbSamples,
-               (U32)totalSamplesSize);
-  ctx->samples = samples;
-  ctx->samplesSizes = samplesSizes;
-  ctx->nbSamples = nbSamples;
-  /* Partial suffix array */
-  ctx->suffixSize = totalSamplesSize - MAX(d, sizeof(U64)) + 1;
-  ctx->suffix = (U32 *)malloc(ctx->suffixSize * sizeof(U32));
-  /* Maps index to the dmerID */
-  ctx->dmerAt = (U32 *)malloc(ctx->suffixSize * sizeof(U32));
-  /* The offsets of each file */
-  ctx->offsets = (size_t *)malloc((nbSamples + 1) * sizeof(size_t));
-  if (!ctx->suffix || !ctx->dmerAt || !ctx->offsets) {
-    DISPLAYLEVEL(1, "Failed to allocate scratch buffers\n");
-    COVER_ctx_destroy(ctx);
-    return 0;
-  }
-  ctx->freqs = NULL;
-  ctx->d = d;
-
-  /* Fill offsets from the samlesSizes */
-  {
-    U32 i;
-    ctx->offsets[0] = 0;
-    for (i = 1; i <= nbSamples; ++i) {
-      ctx->offsets[i] = ctx->offsets[i - 1] + samplesSizes[i - 1];
-    }
-  }
-  DISPLAYLEVEL(2, "Constructing partial suffix array\n");
-  {
-    /* suffix is a partial suffix array.
-     * It only sorts suffixes by their first parameters.d bytes.
-     * The sort is stable, so each dmer group is sorted by position in input.
-     */
-    U32 i;
-    for (i = 0; i < ctx->suffixSize; ++i) {
-      ctx->suffix[i] = i;
-    }
-    /* qsort doesn't take an opaque pointer, so pass as a global */
-    g_ctx = ctx;
-    qsort(ctx->suffix, ctx->suffixSize, sizeof(U32),
-          (ctx->d <= 8 ? &COVER_strict_cmp8 : &COVER_strict_cmp));
-  }
-  DISPLAYLEVEL(2, "Computing frequencies\n");
-  /* For each dmer group (group of positions with the same first d bytes):
-   * 1. For each position we set dmerAt[position] = dmerID.  The dmerID is
-   *    (groupBeginPtr - suffix).  This allows us to go from position to
-   *    dmerID so we can look up values in freq.
-   * 2. We calculate how many samples the dmer occurs in and save it in
-   *    freqs[dmerId].
-   */
-  COVER_groupBy(ctx->suffix, ctx->suffixSize, sizeof(U32), ctx,
-                (ctx->d <= 8 ? &COVER_cmp8 : &COVER_cmp), &COVER_group);
-  ctx->freqs = ctx->suffix;
-  ctx->suffix = NULL;
-  return 1;
-}
-
-/**
- * Given the prepared context build the dictionary.
- */
-static size_t COVER_buildDictionary(const COVER_ctx_t *ctx, U32 *freqs,
-                                    COVER_map_t *activeDmers, void *dictBuffer,
-                                    size_t dictBufferCapacity,
-                                    ZDICT_cover_params_t parameters) {
-  BYTE *const dict = (BYTE *)dictBuffer;
-  size_t tail = dictBufferCapacity;
-  /* Divide the data up into epochs of equal size.
-   * We will select at least one segment from each epoch.
-   */
-  const U32 epochs = (U32)(dictBufferCapacity / parameters.k);
-  const U32 epochSize = (U32)(ctx->suffixSize / epochs);
-  size_t epoch;
-  DISPLAYLEVEL(2, "Breaking content into %u epochs of size %u\n", epochs,
-               epochSize);
-  /* Loop through the epochs until there are no more segments or the dictionary
-   * is full.
-   */
-  for (epoch = 0; tail > 0; epoch = (epoch + 1) % epochs) {
-    const U32 epochBegin = (U32)(epoch * epochSize);
-    const U32 epochEnd = epochBegin + epochSize;
-    size_t segmentSize;
-    /* Select a segment */
-    COVER_segment_t segment = COVER_selectSegment(
-        ctx, freqs, activeDmers, epochBegin, epochEnd, parameters);
-    /* If the segment covers no dmers, then we are out of content */
-    if (segment.score == 0) {
-      break;
-    }
-    /* Trim the segment if necessary and if it is too small then we are done */
-    segmentSize = MIN(segment.end - segment.begin + parameters.d - 1, tail);
-    if (segmentSize < parameters.d) {
-      break;
-    }
-    /* We fill the dictionary from the back to allow the best segments to be
-     * referenced with the smallest offsets.
-     */
-    tail -= segmentSize;
-    memcpy(dict + tail, ctx->samples + segment.begin, segmentSize);
-    DISPLAYUPDATE(
-        2, "\r%u%%       ",
-        (U32)(((dictBufferCapacity - tail) * 100) / dictBufferCapacity));
-  }
-  DISPLAYLEVEL(2, "\r%79s\r", "");
-  return tail;
-}
-
-ZDICTLIB_API size_t ZDICT_trainFromBuffer_cover(
-    void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer,
-    const size_t *samplesSizes, unsigned nbSamples,
-    ZDICT_cover_params_t parameters) {
-  BYTE *const dict = (BYTE *)dictBuffer;
-  COVER_ctx_t ctx;
-  COVER_map_t activeDmers;
-  /* Checks */
-  if (!COVER_checkParameters(parameters, dictBufferCapacity)) {
-    DISPLAYLEVEL(1, "Cover parameters incorrect\n");
-    return ERROR(GENERIC);
-  }
-  if (nbSamples == 0) {
-    DISPLAYLEVEL(1, "Cover must have at least one input file\n");
-    return ERROR(GENERIC);
-  }
-  if (dictBufferCapacity < ZDICT_DICTSIZE_MIN) {
-    DISPLAYLEVEL(1, "dictBufferCapacity must be at least %u\n",
-                 ZDICT_DICTSIZE_MIN);
-    return ERROR(dstSize_tooSmall);
-  }
-  /* Initialize global data */
-  g_displayLevel = parameters.zParams.notificationLevel;
-  /* Initialize context and activeDmers */
-  if (!COVER_ctx_init(&ctx, samplesBuffer, samplesSizes, nbSamples,
-                      parameters.d)) {
-    return ERROR(GENERIC);
-  }
-  if (!COVER_map_init(&activeDmers, parameters.k - parameters.d + 1)) {
-    DISPLAYLEVEL(1, "Failed to allocate dmer map: out of memory\n");
-    COVER_ctx_destroy(&ctx);
-    return ERROR(GENERIC);
-  }
-
-  DISPLAYLEVEL(2, "Building dictionary\n");
-  {
-    const size_t tail =
-        COVER_buildDictionary(&ctx, ctx.freqs, &activeDmers, dictBuffer,
-                              dictBufferCapacity, parameters);
-    const size_t dictionarySize = ZDICT_finalizeDictionary(
-        dict, dictBufferCapacity, dict + tail, dictBufferCapacity - tail,
-        samplesBuffer, samplesSizes, nbSamples, parameters.zParams);
-    if (!ZSTD_isError(dictionarySize)) {
-      DISPLAYLEVEL(2, "Constructed dictionary of size %u\n",
-                   (U32)dictionarySize);
-    }
-    COVER_ctx_destroy(&ctx);
-    COVER_map_destroy(&activeDmers);
-    return dictionarySize;
-  }
-}
-
-/**
- * COVER_best_t is used for two purposes:
- * 1. Synchronizing threads.
- * 2. Saving the best parameters and dictionary.
- *
- * All of the methods except COVER_best_init() are thread safe if zstd is
- * compiled with multithreaded support.
- */
-typedef struct COVER_best_s {
-  ZSTD_pthread_mutex_t mutex;
-  ZSTD_pthread_cond_t cond;
-  size_t liveJobs;
-  void *dict;
-  size_t dictSize;
-  ZDICT_cover_params_t parameters;
-  size_t compressedSize;
-} COVER_best_t;
-
-/**
- * Initialize the `COVER_best_t`.
- */
-static void COVER_best_init(COVER_best_t *best) {
-  if (best==NULL) return; /* compatible with init on NULL */
-  (void)ZSTD_pthread_mutex_init(&best->mutex, NULL);
-  (void)ZSTD_pthread_cond_init(&best->cond, NULL);
-  best->liveJobs = 0;
-  best->dict = NULL;
-  best->dictSize = 0;
-  best->compressedSize = (size_t)-1;
-  memset(&best->parameters, 0, sizeof(best->parameters));
-}
-
-/**
- * Wait until liveJobs == 0.
- */
-static void COVER_best_wait(COVER_best_t *best) {
-  if (!best) {
-    return;
-  }
-  ZSTD_pthread_mutex_lock(&best->mutex);
-  while (best->liveJobs != 0) {
-    ZSTD_pthread_cond_wait(&best->cond, &best->mutex);
-  }
-  ZSTD_pthread_mutex_unlock(&best->mutex);
-}
-
-/**
- * Call COVER_best_wait() and then destroy the COVER_best_t.
- */
-static void COVER_best_destroy(COVER_best_t *best) {
-  if (!best) {
-    return;
-  }
-  COVER_best_wait(best);
-  if (best->dict) {
-    free(best->dict);
-  }
-  ZSTD_pthread_mutex_destroy(&best->mutex);
-  ZSTD_pthread_cond_destroy(&best->cond);
-}
-
-/**
- * Called when a thread is about to be launched.
- * Increments liveJobs.
- */
-static void COVER_best_start(COVER_best_t *best) {
-  if (!best) {
-    return;
-  }
-  ZSTD_pthread_mutex_lock(&best->mutex);
-  ++best->liveJobs;
-  ZSTD_pthread_mutex_unlock(&best->mutex);
-}
-
-/**
- * Called when a thread finishes executing, both on error or success.
- * Decrements liveJobs and signals any waiting threads if liveJobs == 0.
- * If this dictionary is the best so far save it and its parameters.
- */
-static void COVER_best_finish(COVER_best_t *best, size_t compressedSize,
-                              ZDICT_cover_params_t parameters, void *dict,
-                              size_t dictSize) {
-  if (!best) {
-    return;
-  }
-  {
-    size_t liveJobs;
-    ZSTD_pthread_mutex_lock(&best->mutex);
-    --best->liveJobs;
-    liveJobs = best->liveJobs;
-    /* If the new dictionary is better */
-    if (compressedSize < best->compressedSize) {
-      /* Allocate space if necessary */
-      if (!best->dict || best->dictSize < dictSize) {
-        if (best->dict) {
-          free(best->dict);
-        }
-        best->dict = malloc(dictSize);
-        if (!best->dict) {
-          best->compressedSize = ERROR(GENERIC);
-          best->dictSize = 0;
-          return;
-        }
-      }
-      /* Save the dictionary, parameters, and size */
-      memcpy(best->dict, dict, dictSize);
-      best->dictSize = dictSize;
-      best->parameters = parameters;
-      best->compressedSize = compressedSize;
-    }
-    ZSTD_pthread_mutex_unlock(&best->mutex);
-    if (liveJobs == 0) {
-      ZSTD_pthread_cond_broadcast(&best->cond);
-    }
-  }
-}
-
-/**
- * Parameters for COVER_tryParameters().
- */
-typedef struct COVER_tryParameters_data_s {
-  const COVER_ctx_t *ctx;
-  COVER_best_t *best;
-  size_t dictBufferCapacity;
-  ZDICT_cover_params_t parameters;
-} COVER_tryParameters_data_t;
-
-/**
- * Tries a set of parameters and upates the COVER_best_t with the results.
- * This function is thread safe if zstd is compiled with multithreaded support.
- * It takes its parameters as an *OWNING* opaque pointer to support threading.
- */
-static void COVER_tryParameters(void *opaque) {
-  /* Save parameters as local variables */
-  COVER_tryParameters_data_t *const data = (COVER_tryParameters_data_t *)opaque;
-  const COVER_ctx_t *const ctx = data->ctx;
-  const ZDICT_cover_params_t parameters = data->parameters;
-  size_t dictBufferCapacity = data->dictBufferCapacity;
-  size_t totalCompressedSize = ERROR(GENERIC);
-  /* Allocate space for hash table, dict, and freqs */
-  COVER_map_t activeDmers;
-  BYTE *const dict = (BYTE * const)malloc(dictBufferCapacity);
-  U32 *freqs = (U32 *)malloc(ctx->suffixSize * sizeof(U32));
-  if (!COVER_map_init(&activeDmers, parameters.k - parameters.d + 1)) {
-    DISPLAYLEVEL(1, "Failed to allocate dmer map: out of memory\n");
-    goto _cleanup;
-  }
-  if (!dict || !freqs) {
-    DISPLAYLEVEL(1, "Failed to allocate buffers: out of memory\n");
-    goto _cleanup;
-  }
-  /* Copy the frequencies because we need to modify them */
-  memcpy(freqs, ctx->freqs, ctx->suffixSize * sizeof(U32));
-  /* Build the dictionary */
-  {
-    const size_t tail = COVER_buildDictionary(ctx, freqs, &activeDmers, dict,
-                                              dictBufferCapacity, parameters);
-    dictBufferCapacity = ZDICT_finalizeDictionary(
-        dict, dictBufferCapacity, dict + tail, dictBufferCapacity - tail,
-        ctx->samples, ctx->samplesSizes, (unsigned)ctx->nbSamples,
-        parameters.zParams);
-    if (ZDICT_isError(dictBufferCapacity)) {
-      DISPLAYLEVEL(1, "Failed to finalize dictionary\n");
-      goto _cleanup;
-    }
-  }
-  /* Check total compressed size */
-  {
-    /* Pointers */
-    ZSTD_CCtx *cctx;
-    ZSTD_CDict *cdict;
-    void *dst;
-    /* Local variables */
-    size_t dstCapacity;
-    size_t i;
-    /* Allocate dst with enough space to compress the maximum sized sample */
-    {
-      size_t maxSampleSize = 0;
-      for (i = 0; i < ctx->nbSamples; ++i) {
-        maxSampleSize = MAX(ctx->samplesSizes[i], maxSampleSize);
-      }
-      dstCapacity = ZSTD_compressBound(maxSampleSize);
-      dst = malloc(dstCapacity);
-    }
-    /* Create the cctx and cdict */
-    cctx = ZSTD_createCCtx();
-    cdict = ZSTD_createCDict(dict, dictBufferCapacity,
-                             parameters.zParams.compressionLevel);
-    if (!dst || !cctx || !cdict) {
-      goto _compressCleanup;
-    }
-    /* Compress each sample and sum their sizes (or error) */
-    totalCompressedSize = dictBufferCapacity;
-    for (i = 0; i < ctx->nbSamples; ++i) {
-      const size_t size = ZSTD_compress_usingCDict(
-          cctx, dst, dstCapacity, ctx->samples + ctx->offsets[i],
-          ctx->samplesSizes[i], cdict);
-      if (ZSTD_isError(size)) {
-        totalCompressedSize = ERROR(GENERIC);
-        goto _compressCleanup;
-      }
-      totalCompressedSize += size;
-    }
-  _compressCleanup:
-    ZSTD_freeCCtx(cctx);
-    ZSTD_freeCDict(cdict);
-    if (dst) {
-      free(dst);
-    }
-  }
-
-_cleanup:
-  COVER_best_finish(data->best, totalCompressedSize, parameters, dict,
-                    dictBufferCapacity);
-  free(data);
-  COVER_map_destroy(&activeDmers);
-  if (dict) {
-    free(dict);
-  }
-  if (freqs) {
-    free(freqs);
-  }
-}
-
-ZDICTLIB_API size_t ZDICT_optimizeTrainFromBuffer_cover(
-    void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer,
-    const size_t *samplesSizes, unsigned nbSamples,
-    ZDICT_cover_params_t *parameters) {
-  /* constants */
-  const unsigned nbThreads = parameters->nbThreads;
-  const unsigned kMinD = parameters->d == 0 ? 6 : parameters->d;
-  const unsigned kMaxD = parameters->d == 0 ? 8 : parameters->d;
-  const unsigned kMinK = parameters->k == 0 ? 50 : parameters->k;
-  const unsigned kMaxK = parameters->k == 0 ? 2000 : parameters->k;
-  const unsigned kSteps = parameters->steps == 0 ? 40 : parameters->steps;
-  const unsigned kStepSize = MAX((kMaxK - kMinK) / kSteps, 1);
-  const unsigned kIterations =
-      (1 + (kMaxD - kMinD) / 2) * (1 + (kMaxK - kMinK) / kStepSize);
-  /* Local variables */
-  const int displayLevel = parameters->zParams.notificationLevel;
-  unsigned iteration = 1;
-  unsigned d;
-  unsigned k;
-  COVER_best_t best;
-  POOL_ctx *pool = NULL;
-  /* Checks */
-  if (kMinK < kMaxD || kMaxK < kMinK) {
-    LOCALDISPLAYLEVEL(displayLevel, 1, "Incorrect parameters\n");
-    return ERROR(GENERIC);
-  }
-  if (nbSamples == 0) {
-    DISPLAYLEVEL(1, "Cover must have at least one input file\n");
-    return ERROR(GENERIC);
-  }
-  if (dictBufferCapacity < ZDICT_DICTSIZE_MIN) {
-    DISPLAYLEVEL(1, "dictBufferCapacity must be at least %u\n",
-                 ZDICT_DICTSIZE_MIN);
-    return ERROR(dstSize_tooSmall);
-  }
-  if (nbThreads > 1) {
-    pool = POOL_create(nbThreads, 1);
-    if (!pool) {
-      return ERROR(memory_allocation);
-    }
-  }
-  /* Initialization */
-  COVER_best_init(&best);
-  /* Turn down global display level to clean up display at level 2 and below */
-  g_displayLevel = displayLevel == 0 ? 0 : displayLevel - 1;
-  /* Loop through d first because each new value needs a new context */
-  LOCALDISPLAYLEVEL(displayLevel, 2, "Trying %u different sets of parameters\n",
-                    kIterations);
-  for (d = kMinD; d <= kMaxD; d += 2) {
-    /* Initialize the context for this value of d */
-    COVER_ctx_t ctx;
-    LOCALDISPLAYLEVEL(displayLevel, 3, "d=%u\n", d);
-    if (!COVER_ctx_init(&ctx, samplesBuffer, samplesSizes, nbSamples, d)) {
-      LOCALDISPLAYLEVEL(displayLevel, 1, "Failed to initialize context\n");
-      COVER_best_destroy(&best);
-      POOL_free(pool);
-      return ERROR(GENERIC);
-    }
-    /* Loop through k reusing the same context */
-    for (k = kMinK; k <= kMaxK; k += kStepSize) {
-      /* Prepare the arguments */
-      COVER_tryParameters_data_t *data = (COVER_tryParameters_data_t *)malloc(
-          sizeof(COVER_tryParameters_data_t));
-      LOCALDISPLAYLEVEL(displayLevel, 3, "k=%u\n", k);
-      if (!data) {
-        LOCALDISPLAYLEVEL(displayLevel, 1, "Failed to allocate parameters\n");
-        COVER_best_destroy(&best);
-        COVER_ctx_destroy(&ctx);
-        POOL_free(pool);
-        return ERROR(GENERIC);
-      }
-      data->ctx = &ctx;
-      data->best = &best;
-      data->dictBufferCapacity = dictBufferCapacity;
-      data->parameters = *parameters;
-      data->parameters.k = k;
-      data->parameters.d = d;
-      data->parameters.steps = kSteps;
-      data->parameters.zParams.notificationLevel = g_displayLevel;
-      /* Check the parameters */
-      if (!COVER_checkParameters(data->parameters, dictBufferCapacity)) {
-        DISPLAYLEVEL(1, "Cover parameters incorrect\n");
-        free(data);
-        continue;
-      }
-      /* Call the function and pass ownership of data to it */
-      COVER_best_start(&best);
-      if (pool) {
-        POOL_add(pool, &COVER_tryParameters, data);
-      } else {
-        COVER_tryParameters(data);
-      }
-      /* Print status */
-      LOCALDISPLAYUPDATE(displayLevel, 2, "\r%u%%       ",
-                         (U32)((iteration * 100) / kIterations));
-      ++iteration;
-    }
-    COVER_best_wait(&best);
-    COVER_ctx_destroy(&ctx);
-  }
-  LOCALDISPLAYLEVEL(displayLevel, 2, "\r%79s\r", "");
-  /* Fill the output buffer and parameters with output of the best parameters */
-  {
-    const size_t dictSize = best.dictSize;
-    if (ZSTD_isError(best.compressedSize)) {
-      const size_t compressedSize = best.compressedSize;
-      COVER_best_destroy(&best);
-      POOL_free(pool);
-      return compressedSize;
-    }
-    *parameters = best.parameters;
-    memcpy(dictBuffer, best.dict, dictSize);
-    COVER_best_destroy(&best);
-    POOL_free(pool);
-    return dictSize;
-  }
-}
diff --git a/priv/zstd/lib/dictBuilder/divsufsort.c b/priv/zstd/lib/dictBuilder/divsufsort.c
deleted file mode 100644
index 60cceb0..0000000
--- a/priv/zstd/lib/dictBuilder/divsufsort.c
+++ /dev/null
@@ -1,1913 +0,0 @@
-/*
- * divsufsort.c for libdivsufsort-lite
- * Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use,
- * copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following
- * conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
- * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
- * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
- * OTHER DEALINGS IN THE SOFTWARE.
- */
-
-/*- Compiler specifics -*/
-#ifdef __clang__
-#pragma clang diagnostic ignored "-Wshorten-64-to-32"
-#endif
-
-#if defined(_MSC_VER)
-#  pragma warning(disable : 4244)
-#  pragma warning(disable : 4127)    /* C4127 : Condition expression is constant */
-#endif
-
-
-/*- Dependencies -*/
-#include 
-#include 
-#include 
-
-#include "divsufsort.h"
-
-/*- Constants -*/
-#if defined(INLINE)
-# undef INLINE
-#endif
-#if !defined(INLINE)
-# define INLINE __inline
-#endif
-#if defined(ALPHABET_SIZE) && (ALPHABET_SIZE < 1)
-# undef ALPHABET_SIZE
-#endif
-#if !defined(ALPHABET_SIZE)
-# define ALPHABET_SIZE (256)
-#endif
-#define BUCKET_A_SIZE (ALPHABET_SIZE)
-#define BUCKET_B_SIZE (ALPHABET_SIZE * ALPHABET_SIZE)
-#if defined(SS_INSERTIONSORT_THRESHOLD)
-# if SS_INSERTIONSORT_THRESHOLD < 1
-#  undef SS_INSERTIONSORT_THRESHOLD
-#  define SS_INSERTIONSORT_THRESHOLD (1)
-# endif
-#else
-# define SS_INSERTIONSORT_THRESHOLD (8)
-#endif
-#if defined(SS_BLOCKSIZE)
-# if SS_BLOCKSIZE < 0
-#  undef SS_BLOCKSIZE
-#  define SS_BLOCKSIZE (0)
-# elif 32768 <= SS_BLOCKSIZE
-#  undef SS_BLOCKSIZE
-#  define SS_BLOCKSIZE (32767)
-# endif
-#else
-# define SS_BLOCKSIZE (1024)
-#endif
-/* minstacksize = log(SS_BLOCKSIZE) / log(3) * 2 */
-#if SS_BLOCKSIZE == 0
-# define SS_MISORT_STACKSIZE (96)
-#elif SS_BLOCKSIZE <= 4096
-# define SS_MISORT_STACKSIZE (16)
-#else
-# define SS_MISORT_STACKSIZE (24)
-#endif
-#define SS_SMERGE_STACKSIZE (32)
-#define TR_INSERTIONSORT_THRESHOLD (8)
-#define TR_STACKSIZE (64)
-
-
-/*- Macros -*/
-#ifndef SWAP
-# define SWAP(_a, _b) do { t = (_a); (_a) = (_b); (_b) = t; } while(0)
-#endif /* SWAP */
-#ifndef MIN
-# define MIN(_a, _b) (((_a) < (_b)) ? (_a) : (_b))
-#endif /* MIN */
-#ifndef MAX
-# define MAX(_a, _b) (((_a) > (_b)) ? (_a) : (_b))
-#endif /* MAX */
-#define STACK_PUSH(_a, _b, _c, _d)\
-  do {\
-    assert(ssize < STACK_SIZE);\
-    stack[ssize].a = (_a), stack[ssize].b = (_b),\
-    stack[ssize].c = (_c), stack[ssize++].d = (_d);\
-  } while(0)
-#define STACK_PUSH5(_a, _b, _c, _d, _e)\
-  do {\
-    assert(ssize < STACK_SIZE);\
-    stack[ssize].a = (_a), stack[ssize].b = (_b),\
-    stack[ssize].c = (_c), stack[ssize].d = (_d), stack[ssize++].e = (_e);\
-  } while(0)
-#define STACK_POP(_a, _b, _c, _d)\
-  do {\
-    assert(0 <= ssize);\
-    if(ssize == 0) { return; }\
-    (_a) = stack[--ssize].a, (_b) = stack[ssize].b,\
-    (_c) = stack[ssize].c, (_d) = stack[ssize].d;\
-  } while(0)
-#define STACK_POP5(_a, _b, _c, _d, _e)\
-  do {\
-    assert(0 <= ssize);\
-    if(ssize == 0) { return; }\
-    (_a) = stack[--ssize].a, (_b) = stack[ssize].b,\
-    (_c) = stack[ssize].c, (_d) = stack[ssize].d, (_e) = stack[ssize].e;\
-  } while(0)
-#define BUCKET_A(_c0) bucket_A[(_c0)]
-#if ALPHABET_SIZE == 256
-#define BUCKET_B(_c0, _c1) (bucket_B[((_c1) << 8) | (_c0)])
-#define BUCKET_BSTAR(_c0, _c1) (bucket_B[((_c0) << 8) | (_c1)])
-#else
-#define BUCKET_B(_c0, _c1) (bucket_B[(_c1) * ALPHABET_SIZE + (_c0)])
-#define BUCKET_BSTAR(_c0, _c1) (bucket_B[(_c0) * ALPHABET_SIZE + (_c1)])
-#endif
-
-
-/*- Private Functions -*/
-
-static const int lg_table[256]= {
- -1,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
-  5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
-  6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
-  6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
-  7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-  7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-  7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-  7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7
-};
-
-#if (SS_BLOCKSIZE == 0) || (SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE)
-
-static INLINE
-int
-ss_ilg(int n) {
-#if SS_BLOCKSIZE == 0
-  return (n & 0xffff0000) ?
-          ((n & 0xff000000) ?
-            24 + lg_table[(n >> 24) & 0xff] :
-            16 + lg_table[(n >> 16) & 0xff]) :
-          ((n & 0x0000ff00) ?
-             8 + lg_table[(n >>  8) & 0xff] :
-             0 + lg_table[(n >>  0) & 0xff]);
-#elif SS_BLOCKSIZE < 256
-  return lg_table[n];
-#else
-  return (n & 0xff00) ?
-          8 + lg_table[(n >> 8) & 0xff] :
-          0 + lg_table[(n >> 0) & 0xff];
-#endif
-}
-
-#endif /* (SS_BLOCKSIZE == 0) || (SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE) */
-
-#if SS_BLOCKSIZE != 0
-
-static const int sqq_table[256] = {
-  0,  16,  22,  27,  32,  35,  39,  42,  45,  48,  50,  53,  55,  57,  59,  61,
- 64,  65,  67,  69,  71,  73,  75,  76,  78,  80,  81,  83,  84,  86,  87,  89,
- 90,  91,  93,  94,  96,  97,  98,  99, 101, 102, 103, 104, 106, 107, 108, 109,
-110, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
-128, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142,
-143, 144, 144, 145, 146, 147, 148, 149, 150, 150, 151, 152, 153, 154, 155, 155,
-156, 157, 158, 159, 160, 160, 161, 162, 163, 163, 164, 165, 166, 167, 167, 168,
-169, 170, 170, 171, 172, 173, 173, 174, 175, 176, 176, 177, 178, 178, 179, 180,
-181, 181, 182, 183, 183, 184, 185, 185, 186, 187, 187, 188, 189, 189, 190, 191,
-192, 192, 193, 193, 194, 195, 195, 196, 197, 197, 198, 199, 199, 200, 201, 201,
-202, 203, 203, 204, 204, 205, 206, 206, 207, 208, 208, 209, 209, 210, 211, 211,
-212, 212, 213, 214, 214, 215, 215, 216, 217, 217, 218, 218, 219, 219, 220, 221,
-221, 222, 222, 223, 224, 224, 225, 225, 226, 226, 227, 227, 228, 229, 229, 230,
-230, 231, 231, 232, 232, 233, 234, 234, 235, 235, 236, 236, 237, 237, 238, 238,
-239, 240, 240, 241, 241, 242, 242, 243, 243, 244, 244, 245, 245, 246, 246, 247,
-247, 248, 248, 249, 249, 250, 250, 251, 251, 252, 252, 253, 253, 254, 254, 255
-};
-
-static INLINE
-int
-ss_isqrt(int x) {
-  int y, e;
-
-  if(x >= (SS_BLOCKSIZE * SS_BLOCKSIZE)) { return SS_BLOCKSIZE; }
-  e = (x & 0xffff0000) ?
-        ((x & 0xff000000) ?
-          24 + lg_table[(x >> 24) & 0xff] :
-          16 + lg_table[(x >> 16) & 0xff]) :
-        ((x & 0x0000ff00) ?
-           8 + lg_table[(x >>  8) & 0xff] :
-           0 + lg_table[(x >>  0) & 0xff]);
-
-  if(e >= 16) {
-    y = sqq_table[x >> ((e - 6) - (e & 1))] << ((e >> 1) - 7);
-    if(e >= 24) { y = (y + 1 + x / y) >> 1; }
-    y = (y + 1 + x / y) >> 1;
-  } else if(e >= 8) {
-    y = (sqq_table[x >> ((e - 6) - (e & 1))] >> (7 - (e >> 1))) + 1;
-  } else {
-    return sqq_table[x] >> 4;
-  }
-
-  return (x < (y * y)) ? y - 1 : y;
-}
-
-#endif /* SS_BLOCKSIZE != 0 */
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Compares two suffixes. */
-static INLINE
-int
-ss_compare(const unsigned char *T,
-           const int *p1, const int *p2,
-           int depth) {
-  const unsigned char *U1, *U2, *U1n, *U2n;
-
-  for(U1 = T + depth + *p1,
-      U2 = T + depth + *p2,
-      U1n = T + *(p1 + 1) + 2,
-      U2n = T + *(p2 + 1) + 2;
-      (U1 < U1n) && (U2 < U2n) && (*U1 == *U2);
-      ++U1, ++U2) {
-  }
-
-  return U1 < U1n ?
-        (U2 < U2n ? *U1 - *U2 : 1) :
-        (U2 < U2n ? -1 : 0);
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-#if (SS_BLOCKSIZE != 1) && (SS_INSERTIONSORT_THRESHOLD != 1)
-
-/* Insertionsort for small size groups */
-static
-void
-ss_insertionsort(const unsigned char *T, const int *PA,
-                 int *first, int *last, int depth) {
-  int *i, *j;
-  int t;
-  int r;
-
-  for(i = last - 2; first <= i; --i) {
-    for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) {
-      do { *(j - 1) = *j; } while((++j < last) && (*j < 0));
-      if(last <= j) { break; }
-    }
-    if(r == 0) { *j = ~*j; }
-    *(j - 1) = t;
-  }
-}
-
-#endif /* (SS_BLOCKSIZE != 1) && (SS_INSERTIONSORT_THRESHOLD != 1) */
-
-
-/*---------------------------------------------------------------------------*/
-
-#if (SS_BLOCKSIZE == 0) || (SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE)
-
-static INLINE
-void
-ss_fixdown(const unsigned char *Td, const int *PA,
-           int *SA, int i, int size) {
-  int j, k;
-  int v;
-  int c, d, e;
-
-  for(v = SA[i], c = Td[PA[v]]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) {
-    d = Td[PA[SA[k = j++]]];
-    if(d < (e = Td[PA[SA[j]]])) { k = j; d = e; }
-    if(d <= c) { break; }
-  }
-  SA[i] = v;
-}
-
-/* Simple top-down heapsort. */
-static
-void
-ss_heapsort(const unsigned char *Td, const int *PA, int *SA, int size) {
-  int i, m;
-  int t;
-
-  m = size;
-  if((size % 2) == 0) {
-    m--;
-    if(Td[PA[SA[m / 2]]] < Td[PA[SA[m]]]) { SWAP(SA[m], SA[m / 2]); }
-  }
-
-  for(i = m / 2 - 1; 0 <= i; --i) { ss_fixdown(Td, PA, SA, i, m); }
-  if((size % 2) == 0) { SWAP(SA[0], SA[m]); ss_fixdown(Td, PA, SA, 0, m); }
-  for(i = m - 1; 0 < i; --i) {
-    t = SA[0], SA[0] = SA[i];
-    ss_fixdown(Td, PA, SA, 0, i);
-    SA[i] = t;
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Returns the median of three elements. */
-static INLINE
-int *
-ss_median3(const unsigned char *Td, const int *PA,
-           int *v1, int *v2, int *v3) {
-  int *t;
-  if(Td[PA[*v1]] > Td[PA[*v2]]) { SWAP(v1, v2); }
-  if(Td[PA[*v2]] > Td[PA[*v3]]) {
-    if(Td[PA[*v1]] > Td[PA[*v3]]) { return v1; }
-    else { return v3; }
-  }
-  return v2;
-}
-
-/* Returns the median of five elements. */
-static INLINE
-int *
-ss_median5(const unsigned char *Td, const int *PA,
-           int *v1, int *v2, int *v3, int *v4, int *v5) {
-  int *t;
-  if(Td[PA[*v2]] > Td[PA[*v3]]) { SWAP(v2, v3); }
-  if(Td[PA[*v4]] > Td[PA[*v5]]) { SWAP(v4, v5); }
-  if(Td[PA[*v2]] > Td[PA[*v4]]) { SWAP(v2, v4); SWAP(v3, v5); }
-  if(Td[PA[*v1]] > Td[PA[*v3]]) { SWAP(v1, v3); }
-  if(Td[PA[*v1]] > Td[PA[*v4]]) { SWAP(v1, v4); SWAP(v3, v5); }
-  if(Td[PA[*v3]] > Td[PA[*v4]]) { return v4; }
-  return v3;
-}
-
-/* Returns the pivot element. */
-static INLINE
-int *
-ss_pivot(const unsigned char *Td, const int *PA, int *first, int *last) {
-  int *middle;
-  int t;
-
-  t = last - first;
-  middle = first + t / 2;
-
-  if(t <= 512) {
-    if(t <= 32) {
-      return ss_median3(Td, PA, first, middle, last - 1);
-    } else {
-      t >>= 2;
-      return ss_median5(Td, PA, first, first + t, middle, last - 1 - t, last - 1);
-    }
-  }
-  t >>= 3;
-  first  = ss_median3(Td, PA, first, first + t, first + (t << 1));
-  middle = ss_median3(Td, PA, middle - t, middle, middle + t);
-  last   = ss_median3(Td, PA, last - 1 - (t << 1), last - 1 - t, last - 1);
-  return ss_median3(Td, PA, first, middle, last);
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Binary partition for substrings. */
-static INLINE
-int *
-ss_partition(const int *PA,
-                    int *first, int *last, int depth) {
-  int *a, *b;
-  int t;
-  for(a = first - 1, b = last;;) {
-    for(; (++a < b) && ((PA[*a] + depth) >= (PA[*a + 1] + 1));) { *a = ~*a; }
-    for(; (a < --b) && ((PA[*b] + depth) <  (PA[*b + 1] + 1));) { }
-    if(b <= a) { break; }
-    t = ~*b;
-    *b = *a;
-    *a = t;
-  }
-  if(first < a) { *first = ~*first; }
-  return a;
-}
-
-/* Multikey introsort for medium size groups. */
-static
-void
-ss_mintrosort(const unsigned char *T, const int *PA,
-              int *first, int *last,
-              int depth) {
-#define STACK_SIZE SS_MISORT_STACKSIZE
-  struct { int *a, *b, c; int d; } stack[STACK_SIZE];
-  const unsigned char *Td;
-  int *a, *b, *c, *d, *e, *f;
-  int s, t;
-  int ssize;
-  int limit;
-  int v, x = 0;
-
-  for(ssize = 0, limit = ss_ilg(last - first);;) {
-
-    if((last - first) <= SS_INSERTIONSORT_THRESHOLD) {
-#if 1 < SS_INSERTIONSORT_THRESHOLD
-      if(1 < (last - first)) { ss_insertionsort(T, PA, first, last, depth); }
-#endif
-      STACK_POP(first, last, depth, limit);
-      continue;
-    }
-
-    Td = T + depth;
-    if(limit-- == 0) { ss_heapsort(Td, PA, first, last - first); }
-    if(limit < 0) {
-      for(a = first + 1, v = Td[PA[*first]]; a < last; ++a) {
-        if((x = Td[PA[*a]]) != v) {
-          if(1 < (a - first)) { break; }
-          v = x;
-          first = a;
-        }
-      }
-      if(Td[PA[*first] - 1] < v) {
-        first = ss_partition(PA, first, a, depth);
-      }
-      if((a - first) <= (last - a)) {
-        if(1 < (a - first)) {
-          STACK_PUSH(a, last, depth, -1);
-          last = a, depth += 1, limit = ss_ilg(a - first);
-        } else {
-          first = a, limit = -1;
-        }
-      } else {
-        if(1 < (last - a)) {
-          STACK_PUSH(first, a, depth + 1, ss_ilg(a - first));
-          first = a, limit = -1;
-        } else {
-          last = a, depth += 1, limit = ss_ilg(a - first);
-        }
-      }
-      continue;
-    }
-
-    /* choose pivot */
-    a = ss_pivot(Td, PA, first, last);
-    v = Td[PA[*a]];
-    SWAP(*first, *a);
-
-    /* partition */
-    for(b = first; (++b < last) && ((x = Td[PA[*b]]) == v);) { }
-    if(((a = b) < last) && (x < v)) {
-      for(; (++b < last) && ((x = Td[PA[*b]]) <= v);) {
-        if(x == v) { SWAP(*b, *a); ++a; }
-      }
-    }
-    for(c = last; (b < --c) && ((x = Td[PA[*c]]) == v);) { }
-    if((b < (d = c)) && (x > v)) {
-      for(; (b < --c) && ((x = Td[PA[*c]]) >= v);) {
-        if(x == v) { SWAP(*c, *d); --d; }
-      }
-    }
-    for(; b < c;) {
-      SWAP(*b, *c);
-      for(; (++b < c) && ((x = Td[PA[*b]]) <= v);) {
-        if(x == v) { SWAP(*b, *a); ++a; }
-      }
-      for(; (b < --c) && ((x = Td[PA[*c]]) >= v);) {
-        if(x == v) { SWAP(*c, *d); --d; }
-      }
-    }
-
-    if(a <= d) {
-      c = b - 1;
-
-      if((s = a - first) > (t = b - a)) { s = t; }
-      for(e = first, f = b - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }
-      if((s = d - c) > (t = last - d - 1)) { s = t; }
-      for(e = b, f = last - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }
-
-      a = first + (b - a), c = last - (d - c);
-      b = (v <= Td[PA[*a] - 1]) ? a : ss_partition(PA, a, c, depth);
-
-      if((a - first) <= (last - c)) {
-        if((last - c) <= (c - b)) {
-          STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
-          STACK_PUSH(c, last, depth, limit);
-          last = a;
-        } else if((a - first) <= (c - b)) {
-          STACK_PUSH(c, last, depth, limit);
-          STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
-          last = a;
-        } else {
-          STACK_PUSH(c, last, depth, limit);
-          STACK_PUSH(first, a, depth, limit);
-          first = b, last = c, depth += 1, limit = ss_ilg(c - b);
-        }
-      } else {
-        if((a - first) <= (c - b)) {
-          STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
-          STACK_PUSH(first, a, depth, limit);
-          first = c;
-        } else if((last - c) <= (c - b)) {
-          STACK_PUSH(first, a, depth, limit);
-          STACK_PUSH(b, c, depth + 1, ss_ilg(c - b));
-          first = c;
-        } else {
-          STACK_PUSH(first, a, depth, limit);
-          STACK_PUSH(c, last, depth, limit);
-          first = b, last = c, depth += 1, limit = ss_ilg(c - b);
-        }
-      }
-    } else {
-      limit += 1;
-      if(Td[PA[*first] - 1] < v) {
-        first = ss_partition(PA, first, last, depth);
-        limit = ss_ilg(last - first);
-      }
-      depth += 1;
-    }
-  }
-#undef STACK_SIZE
-}
-
-#endif /* (SS_BLOCKSIZE == 0) || (SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE) */
-
-
-/*---------------------------------------------------------------------------*/
-
-#if SS_BLOCKSIZE != 0
-
-static INLINE
-void
-ss_blockswap(int *a, int *b, int n) {
-  int t;
-  for(; 0 < n; --n, ++a, ++b) {
-    t = *a, *a = *b, *b = t;
-  }
-}
-
-static INLINE
-void
-ss_rotate(int *first, int *middle, int *last) {
-  int *a, *b, t;
-  int l, r;
-  l = middle - first, r = last - middle;
-  for(; (0 < l) && (0 < r);) {
-    if(l == r) { ss_blockswap(first, middle, l); break; }
-    if(l < r) {
-      a = last - 1, b = middle - 1;
-      t = *a;
-      do {
-        *a-- = *b, *b-- = *a;
-        if(b < first) {
-          *a = t;
-          last = a;
-          if((r -= l + 1) <= l) { break; }
-          a -= 1, b = middle - 1;
-          t = *a;
-        }
-      } while(1);
-    } else {
-      a = first, b = middle;
-      t = *a;
-      do {
-        *a++ = *b, *b++ = *a;
-        if(last <= b) {
-          *a = t;
-          first = a + 1;
-          if((l -= r + 1) <= r) { break; }
-          a += 1, b = middle;
-          t = *a;
-        }
-      } while(1);
-    }
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-static
-void
-ss_inplacemerge(const unsigned char *T, const int *PA,
-                int *first, int *middle, int *last,
-                int depth) {
-  const int *p;
-  int *a, *b;
-  int len, half;
-  int q, r;
-  int x;
-
-  for(;;) {
-    if(*(last - 1) < 0) { x = 1; p = PA + ~*(last - 1); }
-    else                { x = 0; p = PA +  *(last - 1); }
-    for(a = first, len = middle - first, half = len >> 1, r = -1;
-        0 < len;
-        len = half, half >>= 1) {
-      b = a + half;
-      q = ss_compare(T, PA + ((0 <= *b) ? *b : ~*b), p, depth);
-      if(q < 0) {
-        a = b + 1;
-        half -= (len & 1) ^ 1;
-      } else {
-        r = q;
-      }
-    }
-    if(a < middle) {
-      if(r == 0) { *a = ~*a; }
-      ss_rotate(a, middle, last);
-      last -= middle - a;
-      middle = a;
-      if(first == middle) { break; }
-    }
-    --last;
-    if(x != 0) { while(*--last < 0) { } }
-    if(middle == last) { break; }
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Merge-forward with internal buffer. */
-static
-void
-ss_mergeforward(const unsigned char *T, const int *PA,
-                int *first, int *middle, int *last,
-                int *buf, int depth) {
-  int *a, *b, *c, *bufend;
-  int t;
-  int r;
-
-  bufend = buf + (middle - first) - 1;
-  ss_blockswap(buf, first, middle - first);
-
-  for(t = *(a = first), b = buf, c = middle;;) {
-    r = ss_compare(T, PA + *b, PA + *c, depth);
-    if(r < 0) {
-      do {
-        *a++ = *b;
-        if(bufend <= b) { *bufend = t; return; }
-        *b++ = *a;
-      } while(*b < 0);
-    } else if(r > 0) {
-      do {
-        *a++ = *c, *c++ = *a;
-        if(last <= c) {
-          while(b < bufend) { *a++ = *b, *b++ = *a; }
-          *a = *b, *b = t;
-          return;
-        }
-      } while(*c < 0);
-    } else {
-      *c = ~*c;
-      do {
-        *a++ = *b;
-        if(bufend <= b) { *bufend = t; return; }
-        *b++ = *a;
-      } while(*b < 0);
-
-      do {
-        *a++ = *c, *c++ = *a;
-        if(last <= c) {
-          while(b < bufend) { *a++ = *b, *b++ = *a; }
-          *a = *b, *b = t;
-          return;
-        }
-      } while(*c < 0);
-    }
-  }
-}
-
-/* Merge-backward with internal buffer. */
-static
-void
-ss_mergebackward(const unsigned char *T, const int *PA,
-                 int *first, int *middle, int *last,
-                 int *buf, int depth) {
-  const int *p1, *p2;
-  int *a, *b, *c, *bufend;
-  int t;
-  int r;
-  int x;
-
-  bufend = buf + (last - middle) - 1;
-  ss_blockswap(buf, middle, last - middle);
-
-  x = 0;
-  if(*bufend < 0)       { p1 = PA + ~*bufend; x |= 1; }
-  else                  { p1 = PA +  *bufend; }
-  if(*(middle - 1) < 0) { p2 = PA + ~*(middle - 1); x |= 2; }
-  else                  { p2 = PA +  *(middle - 1); }
-  for(t = *(a = last - 1), b = bufend, c = middle - 1;;) {
-    r = ss_compare(T, p1, p2, depth);
-    if(0 < r) {
-      if(x & 1) { do { *a-- = *b, *b-- = *a; } while(*b < 0); x ^= 1; }
-      *a-- = *b;
-      if(b <= buf) { *buf = t; break; }
-      *b-- = *a;
-      if(*b < 0) { p1 = PA + ~*b; x |= 1; }
-      else       { p1 = PA +  *b; }
-    } else if(r < 0) {
-      if(x & 2) { do { *a-- = *c, *c-- = *a; } while(*c < 0); x ^= 2; }
-      *a-- = *c, *c-- = *a;
-      if(c < first) {
-        while(buf < b) { *a-- = *b, *b-- = *a; }
-        *a = *b, *b = t;
-        break;
-      }
-      if(*c < 0) { p2 = PA + ~*c; x |= 2; }
-      else       { p2 = PA +  *c; }
-    } else {
-      if(x & 1) { do { *a-- = *b, *b-- = *a; } while(*b < 0); x ^= 1; }
-      *a-- = ~*b;
-      if(b <= buf) { *buf = t; break; }
-      *b-- = *a;
-      if(x & 2) { do { *a-- = *c, *c-- = *a; } while(*c < 0); x ^= 2; }
-      *a-- = *c, *c-- = *a;
-      if(c < first) {
-        while(buf < b) { *a-- = *b, *b-- = *a; }
-        *a = *b, *b = t;
-        break;
-      }
-      if(*b < 0) { p1 = PA + ~*b; x |= 1; }
-      else       { p1 = PA +  *b; }
-      if(*c < 0) { p2 = PA + ~*c; x |= 2; }
-      else       { p2 = PA +  *c; }
-    }
-  }
-}
-
-/* D&C based merge. */
-static
-void
-ss_swapmerge(const unsigned char *T, const int *PA,
-             int *first, int *middle, int *last,
-             int *buf, int bufsize, int depth) {
-#define STACK_SIZE SS_SMERGE_STACKSIZE
-#define GETIDX(a) ((0 <= (a)) ? (a) : (~(a)))
-#define MERGE_CHECK(a, b, c)\
-  do {\
-    if(((c) & 1) ||\
-       (((c) & 2) && (ss_compare(T, PA + GETIDX(*((a) - 1)), PA + *(a), depth) == 0))) {\
-      *(a) = ~*(a);\
-    }\
-    if(((c) & 4) && ((ss_compare(T, PA + GETIDX(*((b) - 1)), PA + *(b), depth) == 0))) {\
-      *(b) = ~*(b);\
-    }\
-  } while(0)
-  struct { int *a, *b, *c; int d; } stack[STACK_SIZE];
-  int *l, *r, *lm, *rm;
-  int m, len, half;
-  int ssize;
-  int check, next;
-
-  for(check = 0, ssize = 0;;) {
-    if((last - middle) <= bufsize) {
-      if((first < middle) && (middle < last)) {
-        ss_mergebackward(T, PA, first, middle, last, buf, depth);
-      }
-      MERGE_CHECK(first, last, check);
-      STACK_POP(first, middle, last, check);
-      continue;
-    }
-
-    if((middle - first) <= bufsize) {
-      if(first < middle) {
-        ss_mergeforward(T, PA, first, middle, last, buf, depth);
-      }
-      MERGE_CHECK(first, last, check);
-      STACK_POP(first, middle, last, check);
-      continue;
-    }
-
-    for(m = 0, len = MIN(middle - first, last - middle), half = len >> 1;
-        0 < len;
-        len = half, half >>= 1) {
-      if(ss_compare(T, PA + GETIDX(*(middle + m + half)),
-                       PA + GETIDX(*(middle - m - half - 1)), depth) < 0) {
-        m += half + 1;
-        half -= (len & 1) ^ 1;
-      }
-    }
-
-    if(0 < m) {
-      lm = middle - m, rm = middle + m;
-      ss_blockswap(lm, middle, m);
-      l = r = middle, next = 0;
-      if(rm < last) {
-        if(*rm < 0) {
-          *rm = ~*rm;
-          if(first < lm) { for(; *--l < 0;) { } next |= 4; }
-          next |= 1;
-        } else if(first < lm) {
-          for(; *r < 0; ++r) { }
-          next |= 2;
-        }
-      }
-
-      if((l - first) <= (last - r)) {
-        STACK_PUSH(r, rm, last, (next & 3) | (check & 4));
-        middle = lm, last = l, check = (check & 3) | (next & 4);
-      } else {
-        if((next & 2) && (r == middle)) { next ^= 6; }
-        STACK_PUSH(first, lm, l, (check & 3) | (next & 4));
-        first = r, middle = rm, check = (next & 3) | (check & 4);
-      }
-    } else {
-      if(ss_compare(T, PA + GETIDX(*(middle - 1)), PA + *middle, depth) == 0) {
-        *middle = ~*middle;
-      }
-      MERGE_CHECK(first, last, check);
-      STACK_POP(first, middle, last, check);
-    }
-  }
-#undef STACK_SIZE
-}
-
-#endif /* SS_BLOCKSIZE != 0 */
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Substring sort */
-static
-void
-sssort(const unsigned char *T, const int *PA,
-       int *first, int *last,
-       int *buf, int bufsize,
-       int depth, int n, int lastsuffix) {
-  int *a;
-#if SS_BLOCKSIZE != 0
-  int *b, *middle, *curbuf;
-  int j, k, curbufsize, limit;
-#endif
-  int i;
-
-  if(lastsuffix != 0) { ++first; }
-
-#if SS_BLOCKSIZE == 0
-  ss_mintrosort(T, PA, first, last, depth);
-#else
-  if((bufsize < SS_BLOCKSIZE) &&
-      (bufsize < (last - first)) &&
-      (bufsize < (limit = ss_isqrt(last - first)))) {
-    if(SS_BLOCKSIZE < limit) { limit = SS_BLOCKSIZE; }
-    buf = middle = last - limit, bufsize = limit;
-  } else {
-    middle = last, limit = 0;
-  }
-  for(a = first, i = 0; SS_BLOCKSIZE < (middle - a); a += SS_BLOCKSIZE, ++i) {
-#if SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE
-    ss_mintrosort(T, PA, a, a + SS_BLOCKSIZE, depth);
-#elif 1 < SS_BLOCKSIZE
-    ss_insertionsort(T, PA, a, a + SS_BLOCKSIZE, depth);
-#endif
-    curbufsize = last - (a + SS_BLOCKSIZE);
-    curbuf = a + SS_BLOCKSIZE;
-    if(curbufsize <= bufsize) { curbufsize = bufsize, curbuf = buf; }
-    for(b = a, k = SS_BLOCKSIZE, j = i; j & 1; b -= k, k <<= 1, j >>= 1) {
-      ss_swapmerge(T, PA, b - k, b, b + k, curbuf, curbufsize, depth);
-    }
-  }
-#if SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE
-  ss_mintrosort(T, PA, a, middle, depth);
-#elif 1 < SS_BLOCKSIZE
-  ss_insertionsort(T, PA, a, middle, depth);
-#endif
-  for(k = SS_BLOCKSIZE; i != 0; k <<= 1, i >>= 1) {
-    if(i & 1) {
-      ss_swapmerge(T, PA, a - k, a, middle, buf, bufsize, depth);
-      a -= k;
-    }
-  }
-  if(limit != 0) {
-#if SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE
-    ss_mintrosort(T, PA, middle, last, depth);
-#elif 1 < SS_BLOCKSIZE
-    ss_insertionsort(T, PA, middle, last, depth);
-#endif
-    ss_inplacemerge(T, PA, first, middle, last, depth);
-  }
-#endif
-
-  if(lastsuffix != 0) {
-    /* Insert last type B* suffix. */
-    int PAi[2]; PAi[0] = PA[*(first - 1)], PAi[1] = n - 2;
-    for(a = first, i = *(first - 1);
-        (a < last) && ((*a < 0) || (0 < ss_compare(T, &(PAi[0]), PA + *a, depth)));
-        ++a) {
-      *(a - 1) = *a;
-    }
-    *(a - 1) = i;
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-static INLINE
-int
-tr_ilg(int n) {
-  return (n & 0xffff0000) ?
-          ((n & 0xff000000) ?
-            24 + lg_table[(n >> 24) & 0xff] :
-            16 + lg_table[(n >> 16) & 0xff]) :
-          ((n & 0x0000ff00) ?
-             8 + lg_table[(n >>  8) & 0xff] :
-             0 + lg_table[(n >>  0) & 0xff]);
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Simple insertionsort for small size groups. */
-static
-void
-tr_insertionsort(const int *ISAd, int *first, int *last) {
-  int *a, *b;
-  int t, r;
-
-  for(a = first + 1; a < last; ++a) {
-    for(t = *a, b = a - 1; 0 > (r = ISAd[t] - ISAd[*b]);) {
-      do { *(b + 1) = *b; } while((first <= --b) && (*b < 0));
-      if(b < first) { break; }
-    }
-    if(r == 0) { *b = ~*b; }
-    *(b + 1) = t;
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-static INLINE
-void
-tr_fixdown(const int *ISAd, int *SA, int i, int size) {
-  int j, k;
-  int v;
-  int c, d, e;
-
-  for(v = SA[i], c = ISAd[v]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) {
-    d = ISAd[SA[k = j++]];
-    if(d < (e = ISAd[SA[j]])) { k = j; d = e; }
-    if(d <= c) { break; }
-  }
-  SA[i] = v;
-}
-
-/* Simple top-down heapsort. */
-static
-void
-tr_heapsort(const int *ISAd, int *SA, int size) {
-  int i, m;
-  int t;
-
-  m = size;
-  if((size % 2) == 0) {
-    m--;
-    if(ISAd[SA[m / 2]] < ISAd[SA[m]]) { SWAP(SA[m], SA[m / 2]); }
-  }
-
-  for(i = m / 2 - 1; 0 <= i; --i) { tr_fixdown(ISAd, SA, i, m); }
-  if((size % 2) == 0) { SWAP(SA[0], SA[m]); tr_fixdown(ISAd, SA, 0, m); }
-  for(i = m - 1; 0 < i; --i) {
-    t = SA[0], SA[0] = SA[i];
-    tr_fixdown(ISAd, SA, 0, i);
-    SA[i] = t;
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Returns the median of three elements. */
-static INLINE
-int *
-tr_median3(const int *ISAd, int *v1, int *v2, int *v3) {
-  int *t;
-  if(ISAd[*v1] > ISAd[*v2]) { SWAP(v1, v2); }
-  if(ISAd[*v2] > ISAd[*v3]) {
-    if(ISAd[*v1] > ISAd[*v3]) { return v1; }
-    else { return v3; }
-  }
-  return v2;
-}
-
-/* Returns the median of five elements. */
-static INLINE
-int *
-tr_median5(const int *ISAd,
-           int *v1, int *v2, int *v3, int *v4, int *v5) {
-  int *t;
-  if(ISAd[*v2] > ISAd[*v3]) { SWAP(v2, v3); }
-  if(ISAd[*v4] > ISAd[*v5]) { SWAP(v4, v5); }
-  if(ISAd[*v2] > ISAd[*v4]) { SWAP(v2, v4); SWAP(v3, v5); }
-  if(ISAd[*v1] > ISAd[*v3]) { SWAP(v1, v3); }
-  if(ISAd[*v1] > ISAd[*v4]) { SWAP(v1, v4); SWAP(v3, v5); }
-  if(ISAd[*v3] > ISAd[*v4]) { return v4; }
-  return v3;
-}
-
-/* Returns the pivot element. */
-static INLINE
-int *
-tr_pivot(const int *ISAd, int *first, int *last) {
-  int *middle;
-  int t;
-
-  t = last - first;
-  middle = first + t / 2;
-
-  if(t <= 512) {
-    if(t <= 32) {
-      return tr_median3(ISAd, first, middle, last - 1);
-    } else {
-      t >>= 2;
-      return tr_median5(ISAd, first, first + t, middle, last - 1 - t, last - 1);
-    }
-  }
-  t >>= 3;
-  first  = tr_median3(ISAd, first, first + t, first + (t << 1));
-  middle = tr_median3(ISAd, middle - t, middle, middle + t);
-  last   = tr_median3(ISAd, last - 1 - (t << 1), last - 1 - t, last - 1);
-  return tr_median3(ISAd, first, middle, last);
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-typedef struct _trbudget_t trbudget_t;
-struct _trbudget_t {
-  int chance;
-  int remain;
-  int incval;
-  int count;
-};
-
-static INLINE
-void
-trbudget_init(trbudget_t *budget, int chance, int incval) {
-  budget->chance = chance;
-  budget->remain = budget->incval = incval;
-}
-
-static INLINE
-int
-trbudget_check(trbudget_t *budget, int size) {
-  if(size <= budget->remain) { budget->remain -= size; return 1; }
-  if(budget->chance == 0) { budget->count += size; return 0; }
-  budget->remain += budget->incval - size;
-  budget->chance -= 1;
-  return 1;
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-static INLINE
-void
-tr_partition(const int *ISAd,
-             int *first, int *middle, int *last,
-             int **pa, int **pb, int v) {
-  int *a, *b, *c, *d, *e, *f;
-  int t, s;
-  int x = 0;
-
-  for(b = middle - 1; (++b < last) && ((x = ISAd[*b]) == v);) { }
-  if(((a = b) < last) && (x < v)) {
-    for(; (++b < last) && ((x = ISAd[*b]) <= v);) {
-      if(x == v) { SWAP(*b, *a); ++a; }
-    }
-  }
-  for(c = last; (b < --c) && ((x = ISAd[*c]) == v);) { }
-  if((b < (d = c)) && (x > v)) {
-    for(; (b < --c) && ((x = ISAd[*c]) >= v);) {
-      if(x == v) { SWAP(*c, *d); --d; }
-    }
-  }
-  for(; b < c;) {
-    SWAP(*b, *c);
-    for(; (++b < c) && ((x = ISAd[*b]) <= v);) {
-      if(x == v) { SWAP(*b, *a); ++a; }
-    }
-    for(; (b < --c) && ((x = ISAd[*c]) >= v);) {
-      if(x == v) { SWAP(*c, *d); --d; }
-    }
-  }
-
-  if(a <= d) {
-    c = b - 1;
-    if((s = a - first) > (t = b - a)) { s = t; }
-    for(e = first, f = b - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }
-    if((s = d - c) > (t = last - d - 1)) { s = t; }
-    for(e = b, f = last - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }
-    first += (b - a), last -= (d - c);
-  }
-  *pa = first, *pb = last;
-}
-
-static
-void
-tr_copy(int *ISA, const int *SA,
-        int *first, int *a, int *b, int *last,
-        int depth) {
-  /* sort suffixes of middle partition
-     by using sorted order of suffixes of left and right partition. */
-  int *c, *d, *e;
-  int s, v;
-
-  v = b - SA - 1;
-  for(c = first, d = a - 1; c <= d; ++c) {
-    if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
-      *++d = s;
-      ISA[s] = d - SA;
-    }
-  }
-  for(c = last - 1, e = d + 1, d = b; e < d; --c) {
-    if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
-      *--d = s;
-      ISA[s] = d - SA;
-    }
-  }
-}
-
-static
-void
-tr_partialcopy(int *ISA, const int *SA,
-               int *first, int *a, int *b, int *last,
-               int depth) {
-  int *c, *d, *e;
-  int s, v;
-  int rank, lastrank, newrank = -1;
-
-  v = b - SA - 1;
-  lastrank = -1;
-  for(c = first, d = a - 1; c <= d; ++c) {
-    if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
-      *++d = s;
-      rank = ISA[s + depth];
-      if(lastrank != rank) { lastrank = rank; newrank = d - SA; }
-      ISA[s] = newrank;
-    }
-  }
-
-  lastrank = -1;
-  for(e = d; first <= e; --e) {
-    rank = ISA[*e];
-    if(lastrank != rank) { lastrank = rank; newrank = e - SA; }
-    if(newrank != rank) { ISA[*e] = newrank; }
-  }
-
-  lastrank = -1;
-  for(c = last - 1, e = d + 1, d = b; e < d; --c) {
-    if((0 <= (s = *c - depth)) && (ISA[s] == v)) {
-      *--d = s;
-      rank = ISA[s + depth];
-      if(lastrank != rank) { lastrank = rank; newrank = d - SA; }
-      ISA[s] = newrank;
-    }
-  }
-}
-
-static
-void
-tr_introsort(int *ISA, const int *ISAd,
-             int *SA, int *first, int *last,
-             trbudget_t *budget) {
-#define STACK_SIZE TR_STACKSIZE
-  struct { const int *a; int *b, *c; int d, e; }stack[STACK_SIZE];
-  int *a, *b, *c;
-  int t;
-  int v, x = 0;
-  int incr = ISAd - ISA;
-  int limit, next;
-  int ssize, trlink = -1;
-
-  for(ssize = 0, limit = tr_ilg(last - first);;) {
-
-    if(limit < 0) {
-      if(limit == -1) {
-        /* tandem repeat partition */
-        tr_partition(ISAd - incr, first, first, last, &a, &b, last - SA - 1);
-
-        /* update ranks */
-        if(a < last) {
-          for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; }
-        }
-        if(b < last) {
-          for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; }
-        }
-
-        /* push */
-        if(1 < (b - a)) {
-          STACK_PUSH5(NULL, a, b, 0, 0);
-          STACK_PUSH5(ISAd - incr, first, last, -2, trlink);
-          trlink = ssize - 2;
-        }
-        if((a - first) <= (last - b)) {
-          if(1 < (a - first)) {
-            STACK_PUSH5(ISAd, b, last, tr_ilg(last - b), trlink);
-            last = a, limit = tr_ilg(a - first);
-          } else if(1 < (last - b)) {
-            first = b, limit = tr_ilg(last - b);
-          } else {
-            STACK_POP5(ISAd, first, last, limit, trlink);
-          }
-        } else {
-          if(1 < (last - b)) {
-            STACK_PUSH5(ISAd, first, a, tr_ilg(a - first), trlink);
-            first = b, limit = tr_ilg(last - b);
-          } else if(1 < (a - first)) {
-            last = a, limit = tr_ilg(a - first);
-          } else {
-            STACK_POP5(ISAd, first, last, limit, trlink);
-          }
-        }
-      } else if(limit == -2) {
-        /* tandem repeat copy */
-        a = stack[--ssize].b, b = stack[ssize].c;
-        if(stack[ssize].d == 0) {
-          tr_copy(ISA, SA, first, a, b, last, ISAd - ISA);
-        } else {
-          if(0 <= trlink) { stack[trlink].d = -1; }
-          tr_partialcopy(ISA, SA, first, a, b, last, ISAd - ISA);
-        }
-        STACK_POP5(ISAd, first, last, limit, trlink);
-      } else {
-        /* sorted partition */
-        if(0 <= *first) {
-          a = first;
-          do { ISA[*a] = a - SA; } while((++a < last) && (0 <= *a));
-          first = a;
-        }
-        if(first < last) {
-          a = first; do { *a = ~*a; } while(*++a < 0);
-          next = (ISA[*a] != ISAd[*a]) ? tr_ilg(a - first + 1) : -1;
-          if(++a < last) { for(b = first, v = a - SA - 1; b < a; ++b) { ISA[*b] = v; } }
-
-          /* push */
-          if(trbudget_check(budget, a - first)) {
-            if((a - first) <= (last - a)) {
-              STACK_PUSH5(ISAd, a, last, -3, trlink);
-              ISAd += incr, last = a, limit = next;
-            } else {
-              if(1 < (last - a)) {
-                STACK_PUSH5(ISAd + incr, first, a, next, trlink);
-                first = a, limit = -3;
-              } else {
-                ISAd += incr, last = a, limit = next;
-              }
-            }
-          } else {
-            if(0 <= trlink) { stack[trlink].d = -1; }
-            if(1 < (last - a)) {
-              first = a, limit = -3;
-            } else {
-              STACK_POP5(ISAd, first, last, limit, trlink);
-            }
-          }
-        } else {
-          STACK_POP5(ISAd, first, last, limit, trlink);
-        }
-      }
-      continue;
-    }
-
-    if((last - first) <= TR_INSERTIONSORT_THRESHOLD) {
-      tr_insertionsort(ISAd, first, last);
-      limit = -3;
-      continue;
-    }
-
-    if(limit-- == 0) {
-      tr_heapsort(ISAd, first, last - first);
-      for(a = last - 1; first < a; a = b) {
-        for(x = ISAd[*a], b = a - 1; (first <= b) && (ISAd[*b] == x); --b) { *b = ~*b; }
-      }
-      limit = -3;
-      continue;
-    }
-
-    /* choose pivot */
-    a = tr_pivot(ISAd, first, last);
-    SWAP(*first, *a);
-    v = ISAd[*first];
-
-    /* partition */
-    tr_partition(ISAd, first, first + 1, last, &a, &b, v);
-    if((last - first) != (b - a)) {
-      next = (ISA[*a] != v) ? tr_ilg(b - a) : -1;
-
-      /* update ranks */
-      for(c = first, v = a - SA - 1; c < a; ++c) { ISA[*c] = v; }
-      if(b < last) { for(c = a, v = b - SA - 1; c < b; ++c) { ISA[*c] = v; } }
-
-      /* push */
-      if((1 < (b - a)) && (trbudget_check(budget, b - a))) {
-        if((a - first) <= (last - b)) {
-          if((last - b) <= (b - a)) {
-            if(1 < (a - first)) {
-              STACK_PUSH5(ISAd + incr, a, b, next, trlink);
-              STACK_PUSH5(ISAd, b, last, limit, trlink);
-              last = a;
-            } else if(1 < (last - b)) {
-              STACK_PUSH5(ISAd + incr, a, b, next, trlink);
-              first = b;
-            } else {
-              ISAd += incr, first = a, last = b, limit = next;
-            }
-          } else if((a - first) <= (b - a)) {
-            if(1 < (a - first)) {
-              STACK_PUSH5(ISAd, b, last, limit, trlink);
-              STACK_PUSH5(ISAd + incr, a, b, next, trlink);
-              last = a;
-            } else {
-              STACK_PUSH5(ISAd, b, last, limit, trlink);
-              ISAd += incr, first = a, last = b, limit = next;
-            }
-          } else {
-            STACK_PUSH5(ISAd, b, last, limit, trlink);
-            STACK_PUSH5(ISAd, first, a, limit, trlink);
-            ISAd += incr, first = a, last = b, limit = next;
-          }
-        } else {
-          if((a - first) <= (b - a)) {
-            if(1 < (last - b)) {
-              STACK_PUSH5(ISAd + incr, a, b, next, trlink);
-              STACK_PUSH5(ISAd, first, a, limit, trlink);
-              first = b;
-            } else if(1 < (a - first)) {
-              STACK_PUSH5(ISAd + incr, a, b, next, trlink);
-              last = a;
-            } else {
-              ISAd += incr, first = a, last = b, limit = next;
-            }
-          } else if((last - b) <= (b - a)) {
-            if(1 < (last - b)) {
-              STACK_PUSH5(ISAd, first, a, limit, trlink);
-              STACK_PUSH5(ISAd + incr, a, b, next, trlink);
-              first = b;
-            } else {
-              STACK_PUSH5(ISAd, first, a, limit, trlink);
-              ISAd += incr, first = a, last = b, limit = next;
-            }
-          } else {
-            STACK_PUSH5(ISAd, first, a, limit, trlink);
-            STACK_PUSH5(ISAd, b, last, limit, trlink);
-            ISAd += incr, first = a, last = b, limit = next;
-          }
-        }
-      } else {
-        if((1 < (b - a)) && (0 <= trlink)) { stack[trlink].d = -1; }
-        if((a - first) <= (last - b)) {
-          if(1 < (a - first)) {
-            STACK_PUSH5(ISAd, b, last, limit, trlink);
-            last = a;
-          } else if(1 < (last - b)) {
-            first = b;
-          } else {
-            STACK_POP5(ISAd, first, last, limit, trlink);
-          }
-        } else {
-          if(1 < (last - b)) {
-            STACK_PUSH5(ISAd, first, a, limit, trlink);
-            first = b;
-          } else if(1 < (a - first)) {
-            last = a;
-          } else {
-            STACK_POP5(ISAd, first, last, limit, trlink);
-          }
-        }
-      }
-    } else {
-      if(trbudget_check(budget, last - first)) {
-        limit = tr_ilg(last - first), ISAd += incr;
-      } else {
-        if(0 <= trlink) { stack[trlink].d = -1; }
-        STACK_POP5(ISAd, first, last, limit, trlink);
-      }
-    }
-  }
-#undef STACK_SIZE
-}
-
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Tandem repeat sort */
-static
-void
-trsort(int *ISA, int *SA, int n, int depth) {
-  int *ISAd;
-  int *first, *last;
-  trbudget_t budget;
-  int t, skip, unsorted;
-
-  trbudget_init(&budget, tr_ilg(n) * 2 / 3, n);
-/*  trbudget_init(&budget, tr_ilg(n) * 3 / 4, n); */
-  for(ISAd = ISA + depth; -n < *SA; ISAd += ISAd - ISA) {
-    first = SA;
-    skip = 0;
-    unsorted = 0;
-    do {
-      if((t = *first) < 0) { first -= t; skip += t; }
-      else {
-        if(skip != 0) { *(first + skip) = skip; skip = 0; }
-        last = SA + ISA[t] + 1;
-        if(1 < (last - first)) {
-          budget.count = 0;
-          tr_introsort(ISA, ISAd, SA, first, last, &budget);
-          if(budget.count != 0) { unsorted += budget.count; }
-          else { skip = first - last; }
-        } else if((last - first) == 1) {
-          skip = -1;
-        }
-        first = last;
-      }
-    } while(first < (SA + n));
-    if(skip != 0) { *(first + skip) = skip; }
-    if(unsorted == 0) { break; }
-  }
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/* Sorts suffixes of type B*. */
-static
-int
-sort_typeBstar(const unsigned char *T, int *SA,
-               int *bucket_A, int *bucket_B,
-               int n, int openMP) {
-  int *PAb, *ISAb, *buf;
-#ifdef LIBBSC_OPENMP
-  int *curbuf;
-  int l;
-#endif
-  int i, j, k, t, m, bufsize;
-  int c0, c1;
-#ifdef LIBBSC_OPENMP
-  int d0, d1;
-#endif
-  (void)openMP;
-
-  /* Initialize bucket arrays. */
-  for(i = 0; i < BUCKET_A_SIZE; ++i) { bucket_A[i] = 0; }
-  for(i = 0; i < BUCKET_B_SIZE; ++i) { bucket_B[i] = 0; }
-
-  /* Count the number of occurrences of the first one or two characters of each
-     type A, B and B* suffix. Moreover, store the beginning position of all
-     type B* suffixes into the array SA. */
-  for(i = n - 1, m = n, c0 = T[n - 1]; 0 <= i;) {
-    /* type A suffix. */
-    do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1));
-    if(0 <= i) {
-      /* type B* suffix. */
-      ++BUCKET_BSTAR(c0, c1);
-      SA[--m] = i;
-      /* type B suffix. */
-      for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) {
-        ++BUCKET_B(c0, c1);
-      }
-    }
-  }
-  m = n - m;
-/*
-note:
-  A type B* suffix is lexicographically smaller than a type B suffix that
-  begins with the same first two characters.
-*/
-
-  /* Calculate the index of start/end point of each bucket. */
-  for(c0 = 0, i = 0, j = 0; c0 < ALPHABET_SIZE; ++c0) {
-    t = i + BUCKET_A(c0);
-    BUCKET_A(c0) = i + j; /* start point */
-    i = t + BUCKET_B(c0, c0);
-    for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) {
-      j += BUCKET_BSTAR(c0, c1);
-      BUCKET_BSTAR(c0, c1) = j; /* end point */
-      i += BUCKET_B(c0, c1);
-    }
-  }
-
-  if(0 < m) {
-    /* Sort the type B* suffixes by their first two characters. */
-    PAb = SA + n - m; ISAb = SA + m;
-    for(i = m - 2; 0 <= i; --i) {
-      t = PAb[i], c0 = T[t], c1 = T[t + 1];
-      SA[--BUCKET_BSTAR(c0, c1)] = i;
-    }
-    t = PAb[m - 1], c0 = T[t], c1 = T[t + 1];
-    SA[--BUCKET_BSTAR(c0, c1)] = m - 1;
-
-    /* Sort the type B* substrings using sssort. */
-#ifdef LIBBSC_OPENMP
-    if (openMP)
-    {
-        buf = SA + m;
-        c0 = ALPHABET_SIZE - 2, c1 = ALPHABET_SIZE - 1, j = m;
-#pragma omp parallel default(shared) private(bufsize, curbuf, k, l, d0, d1)
-        {
-          bufsize = (n - (2 * m)) / omp_get_num_threads();
-          curbuf = buf + omp_get_thread_num() * bufsize;
-          k = 0;
-          for(;;) {
-            #pragma omp critical(sssort_lock)
-            {
-              if(0 < (l = j)) {
-                d0 = c0, d1 = c1;
-                do {
-                  k = BUCKET_BSTAR(d0, d1);
-                  if(--d1 <= d0) {
-                    d1 = ALPHABET_SIZE - 1;
-                    if(--d0 < 0) { break; }
-                  }
-                } while(((l - k) <= 1) && (0 < (l = k)));
-                c0 = d0, c1 = d1, j = k;
-              }
-            }
-            if(l == 0) { break; }
-            sssort(T, PAb, SA + k, SA + l,
-                   curbuf, bufsize, 2, n, *(SA + k) == (m - 1));
-          }
-        }
-    }
-    else
-    {
-        buf = SA + m, bufsize = n - (2 * m);
-        for(c0 = ALPHABET_SIZE - 2, j = m; 0 < j; --c0) {
-          for(c1 = ALPHABET_SIZE - 1; c0 < c1; j = i, --c1) {
-            i = BUCKET_BSTAR(c0, c1);
-            if(1 < (j - i)) {
-              sssort(T, PAb, SA + i, SA + j,
-                     buf, bufsize, 2, n, *(SA + i) == (m - 1));
-            }
-          }
-        }
-    }
-#else
-    buf = SA + m, bufsize = n - (2 * m);
-    for(c0 = ALPHABET_SIZE - 2, j = m; 0 < j; --c0) {
-      for(c1 = ALPHABET_SIZE - 1; c0 < c1; j = i, --c1) {
-        i = BUCKET_BSTAR(c0, c1);
-        if(1 < (j - i)) {
-          sssort(T, PAb, SA + i, SA + j,
-                 buf, bufsize, 2, n, *(SA + i) == (m - 1));
-        }
-      }
-    }
-#endif
-
-    /* Compute ranks of type B* substrings. */
-    for(i = m - 1; 0 <= i; --i) {
-      if(0 <= SA[i]) {
-        j = i;
-        do { ISAb[SA[i]] = i; } while((0 <= --i) && (0 <= SA[i]));
-        SA[i + 1] = i - j;
-        if(i <= 0) { break; }
-      }
-      j = i;
-      do { ISAb[SA[i] = ~SA[i]] = j; } while(SA[--i] < 0);
-      ISAb[SA[i]] = j;
-    }
-
-    /* Construct the inverse suffix array of type B* suffixes using trsort. */
-    trsort(ISAb, SA, m, 1);
-
-    /* Set the sorted order of tyoe B* suffixes. */
-    for(i = n - 1, j = m, c0 = T[n - 1]; 0 <= i;) {
-      for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) >= c1); --i, c1 = c0) { }
-      if(0 <= i) {
-        t = i;
-        for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { }
-        SA[ISAb[--j]] = ((t == 0) || (1 < (t - i))) ? t : ~t;
-      }
-    }
-
-    /* Calculate the index of start/end point of each bucket. */
-    BUCKET_B(ALPHABET_SIZE - 1, ALPHABET_SIZE - 1) = n; /* end point */
-    for(c0 = ALPHABET_SIZE - 2, k = m - 1; 0 <= c0; --c0) {
-      i = BUCKET_A(c0 + 1) - 1;
-      for(c1 = ALPHABET_SIZE - 1; c0 < c1; --c1) {
-        t = i - BUCKET_B(c0, c1);
-        BUCKET_B(c0, c1) = i; /* end point */
-
-        /* Move all type B* suffixes to the correct position. */
-        for(i = t, j = BUCKET_BSTAR(c0, c1);
-            j <= k;
-            --i, --k) { SA[i] = SA[k]; }
-      }
-      BUCKET_BSTAR(c0, c0 + 1) = i - BUCKET_B(c0, c0) + 1; /* start point */
-      BUCKET_B(c0, c0) = i; /* end point */
-    }
-  }
-
-  return m;
-}
-
-/* Constructs the suffix array by using the sorted order of type B* suffixes. */
-static
-void
-construct_SA(const unsigned char *T, int *SA,
-             int *bucket_A, int *bucket_B,
-             int n, int m) {
-  int *i, *j, *k;
-  int s;
-  int c0, c1, c2;
-
-  if(0 < m) {
-    /* Construct the sorted order of type B suffixes by using
-       the sorted order of type B* suffixes. */
-    for(c1 = ALPHABET_SIZE - 2; 0 <= c1; --c1) {
-      /* Scan the suffix array from right to left. */
-      for(i = SA + BUCKET_BSTAR(c1, c1 + 1),
-          j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1;
-          i <= j;
-          --j) {
-        if(0 < (s = *j)) {
-          assert(T[s] == c1);
-          assert(((s + 1) < n) && (T[s] <= T[s + 1]));
-          assert(T[s - 1] <= T[s]);
-          *j = ~s;
-          c0 = T[--s];
-          if((0 < s) && (T[s - 1] > c0)) { s = ~s; }
-          if(c0 != c2) {
-            if(0 <= c2) { BUCKET_B(c2, c1) = k - SA; }
-            k = SA + BUCKET_B(c2 = c0, c1);
-          }
-          assert(k < j);
-          *k-- = s;
-        } else {
-          assert(((s == 0) && (T[s] == c1)) || (s < 0));
-          *j = ~s;
-        }
-      }
-    }
-  }
-
-  /* Construct the suffix array by using
-     the sorted order of type B suffixes. */
-  k = SA + BUCKET_A(c2 = T[n - 1]);
-  *k++ = (T[n - 2] < c2) ? ~(n - 1) : (n - 1);
-  /* Scan the suffix array from left to right. */
-  for(i = SA, j = SA + n; i < j; ++i) {
-    if(0 < (s = *i)) {
-      assert(T[s - 1] >= T[s]);
-      c0 = T[--s];
-      if((s == 0) || (T[s - 1] < c0)) { s = ~s; }
-      if(c0 != c2) {
-        BUCKET_A(c2) = k - SA;
-        k = SA + BUCKET_A(c2 = c0);
-      }
-      assert(i < k);
-      *k++ = s;
-    } else {
-      assert(s < 0);
-      *i = ~s;
-    }
-  }
-}
-
-/* Constructs the burrows-wheeler transformed string directly
-   by using the sorted order of type B* suffixes. */
-static
-int
-construct_BWT(const unsigned char *T, int *SA,
-              int *bucket_A, int *bucket_B,
-              int n, int m) {
-  int *i, *j, *k, *orig;
-  int s;
-  int c0, c1, c2;
-
-  if(0 < m) {
-    /* Construct the sorted order of type B suffixes by using
-       the sorted order of type B* suffixes. */
-    for(c1 = ALPHABET_SIZE - 2; 0 <= c1; --c1) {
-      /* Scan the suffix array from right to left. */
-      for(i = SA + BUCKET_BSTAR(c1, c1 + 1),
-          j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1;
-          i <= j;
-          --j) {
-        if(0 < (s = *j)) {
-          assert(T[s] == c1);
-          assert(((s + 1) < n) && (T[s] <= T[s + 1]));
-          assert(T[s - 1] <= T[s]);
-          c0 = T[--s];
-          *j = ~((int)c0);
-          if((0 < s) && (T[s - 1] > c0)) { s = ~s; }
-          if(c0 != c2) {
-            if(0 <= c2) { BUCKET_B(c2, c1) = k - SA; }
-            k = SA + BUCKET_B(c2 = c0, c1);
-          }
-          assert(k < j);
-          *k-- = s;
-        } else if(s != 0) {
-          *j = ~s;
-#ifndef NDEBUG
-        } else {
-          assert(T[s] == c1);
-#endif
-        }
-      }
-    }
-  }
-
-  /* Construct the BWTed string by using
-     the sorted order of type B suffixes. */
-  k = SA + BUCKET_A(c2 = T[n - 1]);
-  *k++ = (T[n - 2] < c2) ? ~((int)T[n - 2]) : (n - 1);
-  /* Scan the suffix array from left to right. */
-  for(i = SA, j = SA + n, orig = SA; i < j; ++i) {
-    if(0 < (s = *i)) {
-      assert(T[s - 1] >= T[s]);
-      c0 = T[--s];
-      *i = c0;
-      if((0 < s) && (T[s - 1] < c0)) { s = ~((int)T[s - 1]); }
-      if(c0 != c2) {
-        BUCKET_A(c2) = k - SA;
-        k = SA + BUCKET_A(c2 = c0);
-      }
-      assert(i < k);
-      *k++ = s;
-    } else if(s != 0) {
-      *i = ~s;
-    } else {
-      orig = i;
-    }
-  }
-
-  return orig - SA;
-}
-
-/* Constructs the burrows-wheeler transformed string directly
-   by using the sorted order of type B* suffixes. */
-static
-int
-construct_BWT_indexes(const unsigned char *T, int *SA,
-                      int *bucket_A, int *bucket_B,
-                      int n, int m,
-                      unsigned char * num_indexes, int * indexes) {
-  int *i, *j, *k, *orig;
-  int s;
-  int c0, c1, c2;
-
-  int mod = n / 8;
-  {
-      mod |= mod >> 1;  mod |= mod >> 2;
-      mod |= mod >> 4;  mod |= mod >> 8;
-      mod |= mod >> 16; mod >>= 1;
-
-      *num_indexes = (unsigned char)((n - 1) / (mod + 1));
-  }
-
-  if(0 < m) {
-    /* Construct the sorted order of type B suffixes by using
-       the sorted order of type B* suffixes. */
-    for(c1 = ALPHABET_SIZE - 2; 0 <= c1; --c1) {
-      /* Scan the suffix array from right to left. */
-      for(i = SA + BUCKET_BSTAR(c1, c1 + 1),
-          j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1;
-          i <= j;
-          --j) {
-        if(0 < (s = *j)) {
-          assert(T[s] == c1);
-          assert(((s + 1) < n) && (T[s] <= T[s + 1]));
-          assert(T[s - 1] <= T[s]);
-
-          if ((s & mod) == 0) indexes[s / (mod + 1) - 1] = j - SA;
-
-          c0 = T[--s];
-          *j = ~((int)c0);
-          if((0 < s) && (T[s - 1] > c0)) { s = ~s; }
-          if(c0 != c2) {
-            if(0 <= c2) { BUCKET_B(c2, c1) = k - SA; }
-            k = SA + BUCKET_B(c2 = c0, c1);
-          }
-          assert(k < j);
-          *k-- = s;
-        } else if(s != 0) {
-          *j = ~s;
-#ifndef NDEBUG
-        } else {
-          assert(T[s] == c1);
-#endif
-        }
-      }
-    }
-  }
-
-  /* Construct the BWTed string by using
-     the sorted order of type B suffixes. */
-  k = SA + BUCKET_A(c2 = T[n - 1]);
-  if (T[n - 2] < c2) {
-    if (((n - 1) & mod) == 0) indexes[(n - 1) / (mod + 1) - 1] = k - SA;
-    *k++ = ~((int)T[n - 2]);
-  }
-  else {
-    *k++ = n - 1;
-  }
-
-  /* Scan the suffix array from left to right. */
-  for(i = SA, j = SA + n, orig = SA; i < j; ++i) {
-    if(0 < (s = *i)) {
-      assert(T[s - 1] >= T[s]);
-
-      if ((s & mod) == 0) indexes[s / (mod + 1) - 1] = i - SA;
-
-      c0 = T[--s];
-      *i = c0;
-      if(c0 != c2) {
-        BUCKET_A(c2) = k - SA;
-        k = SA + BUCKET_A(c2 = c0);
-      }
-      assert(i < k);
-      if((0 < s) && (T[s - 1] < c0)) {
-          if ((s & mod) == 0) indexes[s / (mod + 1) - 1] = k - SA;
-          *k++ = ~((int)T[s - 1]);
-      } else
-        *k++ = s;
-    } else if(s != 0) {
-      *i = ~s;
-    } else {
-      orig = i;
-    }
-  }
-
-  return orig - SA;
-}
-
-
-/*---------------------------------------------------------------------------*/
-
-/*- Function -*/
-
-int
-divsufsort(const unsigned char *T, int *SA, int n, int openMP) {
-  int *bucket_A, *bucket_B;
-  int m;
-  int err = 0;
-
-  /* Check arguments. */
-  if((T == NULL) || (SA == NULL) || (n < 0)) { return -1; }
-  else if(n == 0) { return 0; }
-  else if(n == 1) { SA[0] = 0; return 0; }
-  else if(n == 2) { m = (T[0] < T[1]); SA[m ^ 1] = 0, SA[m] = 1; return 0; }
-
-  bucket_A = (int *)malloc(BUCKET_A_SIZE * sizeof(int));
-  bucket_B = (int *)malloc(BUCKET_B_SIZE * sizeof(int));
-
-  /* Suffixsort. */
-  if((bucket_A != NULL) && (bucket_B != NULL)) {
-    m = sort_typeBstar(T, SA, bucket_A, bucket_B, n, openMP);
-    construct_SA(T, SA, bucket_A, bucket_B, n, m);
-  } else {
-    err = -2;
-  }
-
-  free(bucket_B);
-  free(bucket_A);
-
-  return err;
-}
-
-int
-divbwt(const unsigned char *T, unsigned char *U, int *A, int n, unsigned char * num_indexes, int * indexes, int openMP) {
-  int *B;
-  int *bucket_A, *bucket_B;
-  int m, pidx, i;
-
-  /* Check arguments. */
-  if((T == NULL) || (U == NULL) || (n < 0)) { return -1; }
-  else if(n <= 1) { if(n == 1) { U[0] = T[0]; } return n; }
-
-  if((B = A) == NULL) { B = (int *)malloc((size_t)(n + 1) * sizeof(int)); }
-  bucket_A = (int *)malloc(BUCKET_A_SIZE * sizeof(int));
-  bucket_B = (int *)malloc(BUCKET_B_SIZE * sizeof(int));
-
-  /* Burrows-Wheeler Transform. */
-  if((B != NULL) && (bucket_A != NULL) && (bucket_B != NULL)) {
-    m = sort_typeBstar(T, B, bucket_A, bucket_B, n, openMP);
-
-    if (num_indexes == NULL || indexes == NULL) {
-        pidx = construct_BWT(T, B, bucket_A, bucket_B, n, m);
-    } else {
-        pidx = construct_BWT_indexes(T, B, bucket_A, bucket_B, n, m, num_indexes, indexes);
-    }
-
-    /* Copy to output string. */
-    U[0] = T[n - 1];
-    for(i = 0; i < pidx; ++i) { U[i + 1] = (unsigned char)B[i]; }
-    for(i += 1; i < n; ++i) { U[i] = (unsigned char)B[i]; }
-    pidx += 1;
-  } else {
-    pidx = -2;
-  }
-
-  free(bucket_B);
-  free(bucket_A);
-  if(A == NULL) { free(B); }
-
-  return pidx;
-}
diff --git a/priv/zstd/lib/dictBuilder/divsufsort.h b/priv/zstd/lib/dictBuilder/divsufsort.h
deleted file mode 100644
index 5440994..0000000
--- a/priv/zstd/lib/dictBuilder/divsufsort.h
+++ /dev/null
@@ -1,67 +0,0 @@
-/*
- * divsufsort.h for libdivsufsort-lite
- * Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use,
- * copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following
- * conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
- * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
- * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
- * OTHER DEALINGS IN THE SOFTWARE.
- */
-
-#ifndef _DIVSUFSORT_H
-#define _DIVSUFSORT_H 1
-
-#ifdef __cplusplus
-extern "C" {
-#endif /* __cplusplus */
-
-
-/*- Prototypes -*/
-
-/**
- * Constructs the suffix array of a given string.
- * @param T [0..n-1] The input string.
- * @param SA [0..n-1] The output array of suffixes.
- * @param n The length of the given string.
- * @param openMP enables OpenMP optimization.
- * @return 0 if no error occurred, -1 or -2 otherwise.
- */
-int
-divsufsort(const unsigned char *T, int *SA, int n, int openMP);
-
-/**
- * Constructs the burrows-wheeler transformed string of a given string.
- * @param T [0..n-1] The input string.
- * @param U [0..n-1] The output string. (can be T)
- * @param A [0..n-1] The temporary array. (can be NULL)
- * @param n The length of the given string.
- * @param num_indexes The length of secondary indexes array. (can be NULL)
- * @param indexes The secondary indexes array. (can be NULL)
- * @param openMP enables OpenMP optimization.
- * @return The primary index if no error occurred, -1 or -2 otherwise.
- */
-int
-divbwt(const unsigned char *T, unsigned char *U, int *A, int n, unsigned char * num_indexes, int * indexes, int openMP);
-
-
-#ifdef __cplusplus
-} /* extern "C" */
-#endif /* __cplusplus */
-
-#endif /* _DIVSUFSORT_H */
diff --git a/priv/zstd/lib/dictBuilder/zdict.c b/priv/zstd/lib/dictBuilder/zdict.c
deleted file mode 100644
index e8f4540..0000000
--- a/priv/zstd/lib/dictBuilder/zdict.c
+++ /dev/null
@@ -1,1075 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/*-**************************************
-*  Tuning parameters
-****************************************/
-#define MINRATIO 4   /* minimum nb of apparition to be selected in dictionary */
-#define ZDICT_MAX_SAMPLES_SIZE (2000U << 20)
-#define ZDICT_MIN_SAMPLES_SIZE (ZDICT_CONTENTSIZE_MIN * MINRATIO)
-
-
-/*-**************************************
-*  Compiler Options
-****************************************/
-/* Unix Large Files support (>4GB) */
-#define _FILE_OFFSET_BITS 64
-#if (defined(__sun__) && (!defined(__LP64__)))   /* Sun Solaris 32-bits requires specific definitions */
-#  define _LARGEFILE_SOURCE
-#elif ! defined(__LP64__)                        /* No point defining Large file for 64 bit */
-#  define _LARGEFILE64_SOURCE
-#endif
-
-
-/*-*************************************
-*  Dependencies
-***************************************/
-#include         /* malloc, free */
-#include         /* memset */
-#include          /* fprintf, fopen, ftello64 */
-#include           /* clock */
-
-#include "mem.h"           /* read */
-#include "fse.h"           /* FSE_normalizeCount, FSE_writeNCount */
-#define HUF_STATIC_LINKING_ONLY
-#include "huf.h"           /* HUF_buildCTable, HUF_writeCTable */
-#include "zstd_internal.h" /* includes zstd.h */
-#include "xxhash.h"        /* XXH64 */
-#include "divsufsort.h"
-#ifndef ZDICT_STATIC_LINKING_ONLY
-#  define ZDICT_STATIC_LINKING_ONLY
-#endif
-#include "zdict.h"
-
-
-/*-*************************************
-*  Constants
-***************************************/
-#define KB *(1 <<10)
-#define MB *(1 <<20)
-#define GB *(1U<<30)
-
-#define DICTLISTSIZE_DEFAULT 10000
-
-#define NOISELENGTH 32
-
-static const int g_compressionLevel_default = 3;
-static const U32 g_selectivity_default = 9;
-
-
-/*-*************************************
-*  Console display
-***************************************/
-#define DISPLAY(...)         { fprintf(stderr, __VA_ARGS__); fflush( stderr ); }
-#define DISPLAYLEVEL(l, ...) if (notificationLevel>=l) { DISPLAY(__VA_ARGS__); }    /* 0 : no display;   1: errors;   2: default;  3: details;  4: debug */
-
-static clock_t ZDICT_clockSpan(clock_t nPrevious) { return clock() - nPrevious; }
-
-static void ZDICT_printHex(const void* ptr, size_t length)
-{
-    const BYTE* const b = (const BYTE*)ptr;
-    size_t u;
-    for (u=0; u126) c = '.';   /* non-printable char */
-        DISPLAY("%c", c);
-    }
-}
-
-
-/*-********************************************************
-*  Helper functions
-**********************************************************/
-unsigned ZDICT_isError(size_t errorCode) { return ERR_isError(errorCode); }
-
-const char* ZDICT_getErrorName(size_t errorCode) { return ERR_getErrorName(errorCode); }
-
-unsigned ZDICT_getDictID(const void* dictBuffer, size_t dictSize)
-{
-    if (dictSize < 8) return 0;
-    if (MEM_readLE32(dictBuffer) != ZSTD_MAGIC_DICTIONARY) return 0;
-    return MEM_readLE32((const char*)dictBuffer + 4);
-}
-
-
-/*-********************************************************
-*  Dictionary training functions
-**********************************************************/
-static unsigned ZDICT_NbCommonBytes (size_t val)
-{
-    if (MEM_isLittleEndian()) {
-        if (MEM_64bits()) {
-#       if defined(_MSC_VER) && defined(_WIN64)
-            unsigned long r = 0;
-            _BitScanForward64( &r, (U64)val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_ctzll((U64)val) >> 3);
-#       else
-            static const int DeBruijnBytePos[64] = { 0, 0, 0, 0, 0, 1, 1, 2, 0, 3, 1, 3, 1, 4, 2, 7, 0, 2, 3, 6, 1, 5, 3, 5, 1, 3, 4, 4, 2, 5, 6, 7, 7, 0, 1, 2, 3, 3, 4, 6, 2, 6, 5, 5, 3, 4, 5, 6, 7, 1, 2, 4, 6, 4, 4, 5, 7, 2, 6, 5, 7, 6, 7, 7 };
-            return DeBruijnBytePos[((U64)((val & -(long long)val) * 0x0218A392CDABBD3FULL)) >> 58];
-#       endif
-        } else { /* 32 bits */
-#       if defined(_MSC_VER)
-            unsigned long r=0;
-            _BitScanForward( &r, (U32)val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_ctz((U32)val) >> 3);
-#       else
-            static const int DeBruijnBytePos[32] = { 0, 0, 3, 0, 3, 1, 3, 0, 3, 2, 2, 1, 3, 2, 0, 1, 3, 3, 1, 2, 2, 2, 2, 0, 3, 1, 2, 0, 1, 0, 1, 1 };
-            return DeBruijnBytePos[((U32)((val & -(S32)val) * 0x077CB531U)) >> 27];
-#       endif
-        }
-    } else {  /* Big Endian CPU */
-        if (MEM_64bits()) {
-#       if defined(_MSC_VER) && defined(_WIN64)
-            unsigned long r = 0;
-            _BitScanReverse64( &r, val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_clzll(val) >> 3);
-#       else
-            unsigned r;
-            const unsigned n32 = sizeof(size_t)*4;   /* calculate this way due to compiler complaining in 32-bits mode */
-            if (!(val>>n32)) { r=4; } else { r=0; val>>=n32; }
-            if (!(val>>16)) { r+=2; val>>=8; } else { val>>=24; }
-            r += (!val);
-            return r;
-#       endif
-        } else { /* 32 bits */
-#       if defined(_MSC_VER)
-            unsigned long r = 0;
-            _BitScanReverse( &r, (unsigned long)val );
-            return (unsigned)(r>>3);
-#       elif defined(__GNUC__) && (__GNUC__ >= 3)
-            return (__builtin_clz((U32)val) >> 3);
-#       else
-            unsigned r;
-            if (!(val>>16)) { r=2; val>>=8; } else { r=0; val>>=24; }
-            r += (!val);
-            return r;
-#       endif
-    }   }
-}
-
-
-/*! ZDICT_count() :
-    Count the nb of common bytes between 2 pointers.
-    Note : this function presumes end of buffer followed by noisy guard band.
-*/
-static size_t ZDICT_count(const void* pIn, const void* pMatch)
-{
-    const char* const pStart = (const char*)pIn;
-    for (;;) {
-        size_t const diff = MEM_readST(pMatch) ^ MEM_readST(pIn);
-        if (!diff) {
-            pIn = (const char*)pIn+sizeof(size_t);
-            pMatch = (const char*)pMatch+sizeof(size_t);
-            continue;
-        }
-        pIn = (const char*)pIn+ZDICT_NbCommonBytes(diff);
-        return (size_t)((const char*)pIn - pStart);
-    }
-}
-
-
-typedef struct {
-    U32 pos;
-    U32 length;
-    U32 savings;
-} dictItem;
-
-static void ZDICT_initDictItem(dictItem* d)
-{
-    d->pos = 1;
-    d->length = 0;
-    d->savings = (U32)(-1);
-}
-
-
-#define LLIMIT 64          /* heuristic determined experimentally */
-#define MINMATCHLENGTH 7   /* heuristic determined experimentally */
-static dictItem ZDICT_analyzePos(
-                       BYTE* doneMarks,
-                       const int* suffix, U32 start,
-                       const void* buffer, U32 minRatio, U32 notificationLevel)
-{
-    U32 lengthList[LLIMIT] = {0};
-    U32 cumulLength[LLIMIT] = {0};
-    U32 savings[LLIMIT] = {0};
-    const BYTE* b = (const BYTE*)buffer;
-    size_t length;
-    size_t maxLength = LLIMIT;
-    size_t pos = suffix[start];
-    U32 end = start;
-    dictItem solution;
-
-    /* init */
-    memset(&solution, 0, sizeof(solution));
-    doneMarks[pos] = 1;
-
-    /* trivial repetition cases */
-    if ( (MEM_read16(b+pos+0) == MEM_read16(b+pos+2))
-       ||(MEM_read16(b+pos+1) == MEM_read16(b+pos+3))
-       ||(MEM_read16(b+pos+2) == MEM_read16(b+pos+4)) ) {
-        /* skip and mark segment */
-        U16 u16 = MEM_read16(b+pos+4);
-        U32 u, e = 6;
-        while (MEM_read16(b+pos+e) == u16) e+=2 ;
-        if (b[pos+e] == b[pos+e-1]) e++;
-        for (u=1; u=MINMATCHLENGTH);
-
-    /* look backward */
-    do {
-        length = ZDICT_count(b + pos, b + *(suffix+start-1));
-        if (length >=MINMATCHLENGTH) start--;
-    } while(length >= MINMATCHLENGTH);
-
-    /* exit if not found a minimum nb of repetitions */
-    if (end-start < minRatio) {
-        U32 idx;
-        for(idx=start; idx= %i at pos %7u  ", (U32)(end-start), MINMATCHLENGTH, (U32)pos);
-        DISPLAYLEVEL(4, "\n");
-
-        for (searchLength = MINMATCHLENGTH ; ; searchLength++) {
-            BYTE currentChar = 0;
-            U32 currentCount = 0;
-            U32 currentID = refinedStart;
-            U32 id;
-            U32 selectedCount = 0;
-            U32 selectedID = currentID;
-            for (id =refinedStart; id < refinedEnd; id++) {
-                if (b[ suffix[id] + searchLength] != currentChar) {
-                    if (currentCount > selectedCount) {
-                        selectedCount = currentCount;
-                        selectedID = currentID;
-                    }
-                    currentID = id;
-                    currentChar = b[ suffix[id] + searchLength];
-                    currentCount = 0;
-                }
-                currentCount ++;
-            }
-            if (currentCount > selectedCount) {  /* for last */
-                selectedCount = currentCount;
-                selectedID = currentID;
-            }
-
-            if (selectedCount < minRatio)
-                break;
-            refinedStart = selectedID;
-            refinedEnd = refinedStart + selectedCount;
-        }
-
-        /* evaluate gain based on new ref */
-        start = refinedStart;
-        pos = suffix[refinedStart];
-        end = start;
-        memset(lengthList, 0, sizeof(lengthList));
-
-        /* look forward */
-        do {
-            end++;
-            length = ZDICT_count(b + pos, b + suffix[end]);
-            if (length >= LLIMIT) length = LLIMIT-1;
-            lengthList[length]++;
-        } while (length >=MINMATCHLENGTH);
-
-        /* look backward */
-        length = MINMATCHLENGTH;
-        while ((length >= MINMATCHLENGTH) & (start > 0)) {
-            length = ZDICT_count(b + pos, b + suffix[start - 1]);
-            if (length >= LLIMIT) length = LLIMIT - 1;
-            lengthList[length]++;
-            if (length >= MINMATCHLENGTH) start--;
-        }
-
-        /* largest useful length */
-        memset(cumulLength, 0, sizeof(cumulLength));
-        cumulLength[maxLength-1] = lengthList[maxLength-1];
-        for (i=(int)(maxLength-2); i>=0; i--)
-            cumulLength[i] = cumulLength[i+1] + lengthList[i];
-
-        for (i=LLIMIT-1; i>=MINMATCHLENGTH; i--) if (cumulLength[i]>=minRatio) break;
-        maxLength = i;
-
-        /* reduce maxLength in case of final into repetitive data */
-        {   U32 l = (U32)maxLength;
-            BYTE const c = b[pos + maxLength-1];
-            while (b[pos+l-2]==c) l--;
-            maxLength = l;
-        }
-        if (maxLength < MINMATCHLENGTH) return solution;   /* skip : no long-enough solution */
-
-        /* calculate savings */
-        savings[5] = 0;
-        for (i=MINMATCHLENGTH; i<=(int)maxLength; i++)
-            savings[i] = savings[i-1] + (lengthList[i] * (i-3));
-
-        DISPLAYLEVEL(4, "Selected ref at position %u, of length %u : saves %u (ratio: %.2f)  \n",
-                     (U32)pos, (U32)maxLength, savings[maxLength], (double)savings[maxLength] / maxLength);
-
-        solution.pos = (U32)pos;
-        solution.length = (U32)maxLength;
-        solution.savings = savings[maxLength];
-
-        /* mark positions done */
-        {   U32 id;
-            for (id=start; id solution.length) length = solution.length;
-                }
-                pEnd = (U32)(testedPos + length);
-                for (p=testedPos; ppos;
-    const U32 eltEnd = elt.pos + elt.length;
-    const char* const buf = (const char*) buffer;
-
-    /* tail overlap */
-    U32 u; for (u=1; u elt.pos) && (table[u].pos <= eltEnd)) {  /* overlap, existing > new */
-            /* append */
-            U32 const addedLength = table[u].pos - elt.pos;
-            table[u].length += addedLength;
-            table[u].pos = elt.pos;
-            table[u].savings += elt.savings * addedLength / elt.length;   /* rough approx */
-            table[u].savings += elt.length / 8;    /* rough approx bonus */
-            elt = table[u];
-            /* sort : improve rank */
-            while ((u>1) && (table[u-1].savings < elt.savings))
-            table[u] = table[u-1], u--;
-            table[u] = elt;
-            return u;
-    }   }
-
-    /* front overlap */
-    for (u=1; u= elt.pos) && (table[u].pos < elt.pos)) {  /* overlap, existing < new */
-            /* append */
-            int const addedLength = (int)eltEnd - (table[u].pos + table[u].length);
-            table[u].savings += elt.length / 8;    /* rough approx bonus */
-            if (addedLength > 0) {   /* otherwise, elt fully included into existing */
-                table[u].length += addedLength;
-                table[u].savings += elt.savings * addedLength / elt.length;   /* rough approx */
-            }
-            /* sort : improve rank */
-            elt = table[u];
-            while ((u>1) && (table[u-1].savings < elt.savings))
-                table[u] = table[u-1], u--;
-            table[u] = elt;
-            return u;
-        }
-
-        if (MEM_read64(buf + table[u].pos) == MEM_read64(buf + elt.pos + 1)) {
-            if (isIncluded(buf + table[u].pos, buf + elt.pos + 1, table[u].length)) {
-                size_t const addedLength = MAX( (int)elt.length - (int)table[u].length , 1 );
-                table[u].pos = elt.pos;
-                table[u].savings += (U32)(elt.savings * addedLength / elt.length);
-                table[u].length = MIN(elt.length, table[u].length + 1);
-                return u;
-            }
-        }
-    }
-
-    return 0;
-}
-
-
-static void ZDICT_removeDictItem(dictItem* table, U32 id)
-{
-    /* convention : table[0].pos stores nb of elts */
-    U32 const max = table[0].pos;
-    U32 u;
-    if (!id) return;   /* protection, should never happen */
-    for (u=id; upos--;
-}
-
-
-static void ZDICT_insertDictItem(dictItem* table, U32 maxSize, dictItem elt, const void* buffer)
-{
-    /* merge if possible */
-    U32 mergeId = ZDICT_tryMerge(table, elt, 0, buffer);
-    if (mergeId) {
-        U32 newMerge = 1;
-        while (newMerge) {
-            newMerge = ZDICT_tryMerge(table, table[mergeId], mergeId, buffer);
-            if (newMerge) ZDICT_removeDictItem(table, mergeId);
-            mergeId = newMerge;
-        }
-        return;
-    }
-
-    /* insert */
-    {   U32 current;
-        U32 nextElt = table->pos;
-        if (nextElt >= maxSize) nextElt = maxSize-1;
-        current = nextElt-1;
-        while (table[current].savings < elt.savings) {
-            table[current+1] = table[current];
-            current--;
-        }
-        table[current+1] = elt;
-        table->pos = nextElt+1;
-    }
-}
-
-
-static U32 ZDICT_dictSize(const dictItem* dictList)
-{
-    U32 u, dictSize = 0;
-    for (u=1; u=l) { \
-            if (ZDICT_clockSpan(displayClock) > refreshRate)  \
-            { displayClock = clock(); DISPLAY(__VA_ARGS__); \
-            if (notificationLevel>=4) fflush(stderr); } }
-
-    /* init */
-    DISPLAYLEVEL(2, "\r%70s\r", "");   /* clean display line */
-    if (!suffix0 || !reverseSuffix || !doneMarks || !filePos) {
-        result = ERROR(memory_allocation);
-        goto _cleanup;
-    }
-    if (minRatio < MINRATIO) minRatio = MINRATIO;
-    memset(doneMarks, 0, bufferSize+16);
-
-    /* limit sample set size (divsufsort limitation)*/
-    if (bufferSize > ZDICT_MAX_SAMPLES_SIZE) DISPLAYLEVEL(3, "sample set too large : reduced to %u MB ...\n", (U32)(ZDICT_MAX_SAMPLES_SIZE>>20));
-    while (bufferSize > ZDICT_MAX_SAMPLES_SIZE) bufferSize -= fileSizes[--nbFiles];
-
-    /* sort */
-    DISPLAYLEVEL(2, "sorting %u files of total size %u MB ...\n", nbFiles, (U32)(bufferSize>>20));
-    {   int const divSuftSortResult = divsufsort((const unsigned char*)buffer, suffix, (int)bufferSize, 0);
-        if (divSuftSortResult != 0) { result = ERROR(GENERIC); goto _cleanup; }
-    }
-    suffix[bufferSize] = (int)bufferSize;   /* leads into noise */
-    suffix0[0] = (int)bufferSize;           /* leads into noise */
-    /* build reverse suffix sort */
-    {   size_t pos;
-        for (pos=0; pos < bufferSize; pos++)
-            reverseSuffix[suffix[pos]] = (U32)pos;
-        /* note filePos tracks borders between samples.
-           It's not used at this stage, but planned to become useful in a later update */
-        filePos[0] = 0;
-        for (pos=1; pos> 21);
-    }
-}
-
-
-typedef struct
-{
-    ZSTD_CCtx* ref;
-    ZSTD_CCtx* zc;
-    void* workPlace;   /* must be ZSTD_BLOCKSIZE_MAX allocated */
-} EStats_ress_t;
-
-#define MAXREPOFFSET 1024
-
-static void ZDICT_countEStats(EStats_ress_t esr, ZSTD_parameters params,
-                            U32* countLit, U32* offsetcodeCount, U32* matchlengthCount, U32* litlengthCount, U32* repOffsets,
-                            const void* src, size_t srcSize, U32 notificationLevel)
-{
-    size_t const blockSizeMax = MIN (ZSTD_BLOCKSIZE_MAX, 1 << params.cParams.windowLog);
-    size_t cSize;
-
-    if (srcSize > blockSizeMax) srcSize = blockSizeMax;   /* protection vs large samples */
-    {  size_t const errorCode = ZSTD_copyCCtx(esr.zc, esr.ref, 0);
-            if (ZSTD_isError(errorCode)) { DISPLAYLEVEL(1, "warning : ZSTD_copyCCtx failed \n"); return; }
-    }
-    cSize = ZSTD_compressBlock(esr.zc, esr.workPlace, ZSTD_BLOCKSIZE_MAX, src, srcSize);
-    if (ZSTD_isError(cSize)) { DISPLAYLEVEL(3, "warning : could not compress sample size %u \n", (U32)srcSize); return; }
-
-    if (cSize) {  /* if == 0; block is not compressible */
-        const seqStore_t* seqStorePtr = ZSTD_getSeqStore(esr.zc);
-
-        /* literals stats */
-        {   const BYTE* bytePtr;
-            for(bytePtr = seqStorePtr->litStart; bytePtr < seqStorePtr->lit; bytePtr++)
-                countLit[*bytePtr]++;
-        }
-
-        /* seqStats */
-        {   U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
-            ZSTD_seqToCodes(seqStorePtr);
-
-            {   const BYTE* codePtr = seqStorePtr->ofCode;
-                U32 u;
-                for (u=0; umlCode;
-                U32 u;
-                for (u=0; ullCode;
-                U32 u;
-                for (u=0; u= 2) { /* rep offsets */
-                const seqDef* const seq = seqStorePtr->sequencesStart;
-                U32 offset1 = seq[0].offset - 3;
-                U32 offset2 = seq[1].offset - 3;
-                if (offset1 >= MAXREPOFFSET) offset1 = 0;
-                if (offset2 >= MAXREPOFFSET) offset2 = 0;
-                repOffsets[offset1] += 3;
-                repOffsets[offset2] += 1;
-    }   }   }
-}
-
-static size_t ZDICT_totalSampleSize(const size_t* fileSizes, unsigned nbFiles)
-{
-    size_t total=0;
-    unsigned u;
-    for (u=0; u0; u--) {
-        offsetCount_t tmp;
-        if (table[u-1].count >= table[u].count) break;
-        tmp = table[u-1];
-        table[u-1] = table[u];
-        table[u] = tmp;
-    }
-}
-
-
-#define OFFCODE_MAX 30  /* only applicable to first block */
-static size_t ZDICT_analyzeEntropy(void*  dstBuffer, size_t maxDstSize,
-                                   unsigned compressionLevel,
-                             const void*  srcBuffer, const size_t* fileSizes, unsigned nbFiles,
-                             const void* dictBuffer, size_t  dictBufferSize,
-                                   unsigned notificationLevel)
-{
-    U32 countLit[256];
-    HUF_CREATE_STATIC_CTABLE(hufTable, 255);
-    U32 offcodeCount[OFFCODE_MAX+1];
-    short offcodeNCount[OFFCODE_MAX+1];
-    U32 offcodeMax = ZSTD_highbit32((U32)(dictBufferSize + 128 KB));
-    U32 matchLengthCount[MaxML+1];
-    short matchLengthNCount[MaxML+1];
-    U32 litLengthCount[MaxLL+1];
-    short litLengthNCount[MaxLL+1];
-    U32 repOffset[MAXREPOFFSET];
-    offsetCount_t bestRepOffset[ZSTD_REP_NUM+1];
-    EStats_ress_t esr;
-    ZSTD_parameters params;
-    U32 u, huffLog = 11, Offlog = OffFSELog, mlLog = MLFSELog, llLog = LLFSELog, total;
-    size_t pos = 0, errorCode;
-    size_t eSize = 0;
-    size_t const totalSrcSize = ZDICT_totalSampleSize(fileSizes, nbFiles);
-    size_t const averageSampleSize = totalSrcSize / (nbFiles + !nbFiles);
-    BYTE* dstPtr = (BYTE*)dstBuffer;
-
-    /* init */
-    esr.ref = ZSTD_createCCtx();
-    esr.zc = ZSTD_createCCtx();
-    esr.workPlace = malloc(ZSTD_BLOCKSIZE_MAX);
-    if (!esr.ref || !esr.zc || !esr.workPlace) {
-        eSize = ERROR(memory_allocation);
-        DISPLAYLEVEL(1, "Not enough memory \n");
-        goto _cleanup;
-    }
-    if (offcodeMax>OFFCODE_MAX) { eSize = ERROR(dictionaryCreation_failed); goto _cleanup; }   /* too large dictionary */
-    for (u=0; u<256; u++) countLit[u] = 1;   /* any character must be described */
-    for (u=0; u<=offcodeMax; u++) offcodeCount[u] = 1;
-    for (u=0; u<=MaxML; u++) matchLengthCount[u] = 1;
-    for (u=0; u<=MaxLL; u++) litLengthCount[u] = 1;
-    memset(repOffset, 0, sizeof(repOffset));
-    repOffset[1] = repOffset[4] = repOffset[8] = 1;
-    memset(bestRepOffset, 0, sizeof(bestRepOffset));
-    if (compressionLevel<=0) compressionLevel = g_compressionLevel_default;
-    params = ZSTD_getParams(compressionLevel, averageSampleSize, dictBufferSize);
-    {   size_t const beginResult = ZSTD_compressBegin_advanced(esr.ref, dictBuffer, dictBufferSize, params, 0);
-        if (ZSTD_isError(beginResult)) {
-            DISPLAYLEVEL(1, "error : ZSTD_compressBegin_advanced() failed : %s \n", ZSTD_getErrorName(beginResult));
-            eSize = ERROR(GENERIC);
-            goto _cleanup;
-    }   }
-
-    /* collect stats on all files */
-    for (u=0; u dictBufferCapacity) dictContentSize = dictBufferCapacity - hSize;
-    {   size_t const dictSize = hSize + dictContentSize;
-        char* dictEnd = (char*)dictBuffer + dictSize;
-        memmove(dictEnd - dictContentSize, customDictContent, dictContentSize);
-        memcpy(dictBuffer, header, hSize);
-        return dictSize;
-    }
-}
-
-
-size_t ZDICT_addEntropyTablesFromBuffer_advanced(void* dictBuffer, size_t dictContentSize, size_t dictBufferCapacity,
-                                                 const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
-                                                 ZDICT_params_t params)
-{
-    int const compressionLevel = (params.compressionLevel <= 0) ? g_compressionLevel_default : params.compressionLevel;
-    U32 const notificationLevel = params.notificationLevel;
-    size_t hSize = 8;
-
-    /* calculate entropy tables */
-    DISPLAYLEVEL(2, "\r%70s\r", "");   /* clean display line */
-    DISPLAYLEVEL(2, "statistics ... \n");
-    {   size_t const eSize = ZDICT_analyzeEntropy((char*)dictBuffer+hSize, dictBufferCapacity-hSize,
-                                  compressionLevel,
-                                  samplesBuffer, samplesSizes, nbSamples,
-                                  (char*)dictBuffer + dictBufferCapacity - dictContentSize, dictContentSize,
-                                  notificationLevel);
-        if (ZDICT_isError(eSize)) return eSize;
-        hSize += eSize;
-    }
-
-    /* add dictionary header (after entropy tables) */
-    MEM_writeLE32(dictBuffer, ZSTD_MAGIC_DICTIONARY);
-    {   U64 const randomID = XXH64((char*)dictBuffer + dictBufferCapacity - dictContentSize, dictContentSize, 0);
-        U32 const compliantID = (randomID % ((1U<<31)-32768)) + 32768;
-        U32 const dictID = params.dictID ? params.dictID : compliantID;
-        MEM_writeLE32((char*)dictBuffer+4, dictID);
-    }
-
-    if (hSize + dictContentSize < dictBufferCapacity)
-        memmove((char*)dictBuffer + hSize, (char*)dictBuffer + dictBufferCapacity - dictContentSize, dictContentSize);
-    return MIN(dictBufferCapacity, hSize+dictContentSize);
-}
-
-
-/*! ZDICT_trainFromBuffer_unsafe_legacy() :
-*   Warning : `samplesBuffer` must be followed by noisy guard band.
-*   @return : size of dictionary, or an error code which can be tested with ZDICT_isError()
-*/
-size_t ZDICT_trainFromBuffer_unsafe_legacy(
-                            void* dictBuffer, size_t maxDictSize,
-                            const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
-                            ZDICT_legacy_params_t params)
-{
-    U32 const dictListSize = MAX(MAX(DICTLISTSIZE_DEFAULT, nbSamples), (U32)(maxDictSize/16));
-    dictItem* const dictList = (dictItem*)malloc(dictListSize * sizeof(*dictList));
-    unsigned const selectivity = params.selectivityLevel == 0 ? g_selectivity_default : params.selectivityLevel;
-    unsigned const minRep = (selectivity > 30) ? MINRATIO : nbSamples >> selectivity;
-    size_t const targetDictSize = maxDictSize;
-    size_t const samplesBuffSize = ZDICT_totalSampleSize(samplesSizes, nbSamples);
-    size_t dictSize = 0;
-    U32 const notificationLevel = params.zParams.notificationLevel;
-
-    /* checks */
-    if (!dictList) return ERROR(memory_allocation);
-    if (maxDictSize < ZDICT_DICTSIZE_MIN) { free(dictList); return ERROR(dstSize_tooSmall); }   /* requested dictionary size is too small */
-    if (samplesBuffSize < ZDICT_MIN_SAMPLES_SIZE) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* not enough source to create dictionary */
-
-    /* init */
-    ZDICT_initDictItem(dictList);
-
-    /* build dictionary */
-    ZDICT_trainBuffer_legacy(dictList, dictListSize,
-                       samplesBuffer, samplesBuffSize,
-                       samplesSizes, nbSamples,
-                       minRep, notificationLevel);
-
-    /* display best matches */
-    if (params.zParams.notificationLevel>= 3) {
-        U32 const nb = MIN(25, dictList[0].pos);
-        U32 const dictContentSize = ZDICT_dictSize(dictList);
-        U32 u;
-        DISPLAYLEVEL(3, "\n %u segments found, of total size %u \n", dictList[0].pos-1, dictContentSize);
-        DISPLAYLEVEL(3, "list %u best segments \n", nb-1);
-        for (u=1; u samplesBuffSize) || ((pos + length) > samplesBuffSize))
-                return ERROR(GENERIC);   /* should never happen */
-            DISPLAYLEVEL(3, "%3u:%3u bytes at pos %8u, savings %7u bytes |",
-                         u, length, pos, dictList[u].savings);
-            ZDICT_printHex((const char*)samplesBuffer+pos, printedLength);
-            DISPLAYLEVEL(3, "| \n");
-    }   }
-
-
-    /* create dictionary */
-    {   U32 dictContentSize = ZDICT_dictSize(dictList);
-        if (dictContentSize < ZDICT_CONTENTSIZE_MIN) { free(dictList); return ERROR(dictionaryCreation_failed); }   /* dictionary content too small */
-        if (dictContentSize < targetDictSize/4) {
-            DISPLAYLEVEL(2, "!  warning : selected content significantly smaller than requested (%u < %u) \n", dictContentSize, (U32)maxDictSize);
-            if (samplesBuffSize < 10 * targetDictSize)
-                DISPLAYLEVEL(2, "!  consider increasing the number of samples (total size : %u MB)\n", (U32)(samplesBuffSize>>20));
-            if (minRep > MINRATIO) {
-                DISPLAYLEVEL(2, "!  consider increasing selectivity to produce larger dictionary (-s%u) \n", selectivity+1);
-                DISPLAYLEVEL(2, "!  note : larger dictionaries are not necessarily better, test its efficiency on samples \n");
-            }
-        }
-
-        if ((dictContentSize > targetDictSize*3) && (nbSamples > 2*MINRATIO) && (selectivity>1)) {
-            U32 proposedSelectivity = selectivity-1;
-            while ((nbSamples >> proposedSelectivity) <= MINRATIO) { proposedSelectivity--; }
-            DISPLAYLEVEL(2, "!  note : calculated dictionary significantly larger than requested (%u > %u) \n", dictContentSize, (U32)maxDictSize);
-            DISPLAYLEVEL(2, "!  consider increasing dictionary size, or produce denser dictionary (-s%u) \n", proposedSelectivity);
-            DISPLAYLEVEL(2, "!  always test dictionary efficiency on real samples \n");
-        }
-
-        /* limit dictionary size */
-        {   U32 const max = dictList->pos;   /* convention : nb of useful elts within dictList */
-            U32 currentSize = 0;
-            U32 n; for (n=1; n targetDictSize) { currentSize -= dictList[n].length; break; }
-            }
-            dictList->pos = n;
-            dictContentSize = currentSize;
-        }
-
-        /* build dict content */
-        {   U32 u;
-            BYTE* ptr = (BYTE*)dictBuffer + maxDictSize;
-            for (u=1; upos; u++) {
-                U32 l = dictList[u].length;
-                ptr -= l;
-                if (ptr<(BYTE*)dictBuffer) { free(dictList); return ERROR(GENERIC); }   /* should not happen */
-                memcpy(ptr, (const char*)samplesBuffer+dictList[u].pos, l);
-        }   }
-
-        dictSize = ZDICT_addEntropyTablesFromBuffer_advanced(dictBuffer, dictContentSize, maxDictSize,
-                                                             samplesBuffer, samplesSizes, nbSamples,
-                                                             params.zParams);
-    }
-
-    /* clean up */
-    free(dictList);
-    return dictSize;
-}
-
-
-/* issue : samplesBuffer need to be followed by a noisy guard band.
-*  work around : duplicate the buffer, and add the noise */
-size_t ZDICT_trainFromBuffer_legacy(void* dictBuffer, size_t dictBufferCapacity,
-                              const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
-                              ZDICT_legacy_params_t params)
-{
-    size_t result;
-    void* newBuff;
-    size_t const sBuffSize = ZDICT_totalSampleSize(samplesSizes, nbSamples);
-    if (sBuffSize < ZDICT_MIN_SAMPLES_SIZE) return 0;   /* not enough content => no dictionary */
-
-    newBuff = malloc(sBuffSize + NOISELENGTH);
-    if (!newBuff) return ERROR(memory_allocation);
-
-    memcpy(newBuff, samplesBuffer, sBuffSize);
-    ZDICT_fillNoise((char*)newBuff + sBuffSize, NOISELENGTH);   /* guard band, for end of buffer condition */
-
-    result =
-        ZDICT_trainFromBuffer_unsafe_legacy(dictBuffer, dictBufferCapacity, newBuff,
-                                            samplesSizes, nbSamples, params);
-    free(newBuff);
-    return result;
-}
-
-
-size_t ZDICT_trainFromBuffer(void* dictBuffer, size_t dictBufferCapacity,
-                             const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples)
-{
-    ZDICT_cover_params_t params;
-    memset(¶ms, 0, sizeof(params));
-    params.d = 8;
-    params.steps = 4;
-    /* Default to level 6 since no compression level information is avaialble */
-    params.zParams.compressionLevel = 6;
-    return ZDICT_optimizeTrainFromBuffer_cover(dictBuffer, dictBufferCapacity,
-                                               samplesBuffer, samplesSizes,
-                                               nbSamples, ¶ms);
-}
-
-size_t ZDICT_addEntropyTablesFromBuffer(void* dictBuffer, size_t dictContentSize, size_t dictBufferCapacity,
-                                        const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples)
-{
-    ZDICT_params_t params;
-    memset(¶ms, 0, sizeof(params));
-    return ZDICT_addEntropyTablesFromBuffer_advanced(dictBuffer, dictContentSize, dictBufferCapacity,
-                                                     samplesBuffer, samplesSizes, nbSamples,
-                                                     params);
-}
diff --git a/priv/zstd/lib/dictBuilder/zdict.h b/priv/zstd/lib/dictBuilder/zdict.h
deleted file mode 100644
index 5f0000b..0000000
--- a/priv/zstd/lib/dictBuilder/zdict.h
+++ /dev/null
@@ -1,211 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef DICTBUILDER_H_001
-#define DICTBUILDER_H_001
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-/*======  Dependencies  ======*/
-#include   /* size_t */
-
-
-/* =====   ZDICTLIB_API : control library symbols visibility   ===== */
-#ifndef ZDICTLIB_VISIBILITY
-#  if defined(__GNUC__) && (__GNUC__ >= 4)
-#    define ZDICTLIB_VISIBILITY __attribute__ ((visibility ("default")))
-#  else
-#    define ZDICTLIB_VISIBILITY
-#  endif
-#endif
-#if defined(ZSTD_DLL_EXPORT) && (ZSTD_DLL_EXPORT==1)
-#  define ZDICTLIB_API __declspec(dllexport) ZDICTLIB_VISIBILITY
-#elif defined(ZSTD_DLL_IMPORT) && (ZSTD_DLL_IMPORT==1)
-#  define ZDICTLIB_API __declspec(dllimport) ZDICTLIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
-#else
-#  define ZDICTLIB_API ZDICTLIB_VISIBILITY
-#endif
-
-
-/*! ZDICT_trainFromBuffer():
- * Train a dictionary from an array of samples.
- * Uses ZDICT_optimizeTrainFromBuffer_cover() single-threaded, with d=8 and steps=4.
- * Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
- * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
- * The resulting dictionary will be saved into `dictBuffer`.
- * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
- *           or an error code, which can be tested with ZDICT_isError().
- * Note: ZDICT_trainFromBuffer() requires about 9 bytes of memory for each input byte.
- * Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
- *        It's obviously possible to target smaller or larger ones, just by specifying different `dictBufferCapacity`.
- *        In general, it's recommended to provide a few thousands samples, but this can vary a lot.
- *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
- */
-ZDICTLIB_API size_t ZDICT_trainFromBuffer(void* dictBuffer, size_t dictBufferCapacity,
-                       const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples);
-
-
-/*======   Helper functions   ======*/
-ZDICTLIB_API unsigned ZDICT_getDictID(const void* dictBuffer, size_t dictSize);  /**< extracts dictID; @return zero if error (not a valid dictionary) */
-ZDICTLIB_API unsigned ZDICT_isError(size_t errorCode);
-ZDICTLIB_API const char* ZDICT_getErrorName(size_t errorCode);
-
-
-
-#ifdef ZDICT_STATIC_LINKING_ONLY
-
-/* ====================================================================================
- * The definitions in this section are considered experimental.
- * They should never be used with a dynamic library, as they may change in the future.
- * They are provided for advanced usages.
- * Use them only in association with static linking.
- * ==================================================================================== */
-
-typedef struct {
-    int      compressionLevel;   /* 0 means default; target a specific zstd compression level */
-    unsigned notificationLevel;  /* Write to stderr; 0 = none (default); 1 = errors; 2 = progression; 3 = details; 4 = debug; */
-    unsigned dictID;             /* 0 means auto mode (32-bits random value); other : force dictID value */
-} ZDICT_params_t;
-
-/*! ZDICT_cover_params_t:
- *  For all values 0 means default.
- *  k and d are the only required parameters.
- */
-typedef struct {
-    unsigned k;                  /* Segment size : constraint: 0 < k : Reasonable range [16, 2048+] */
-    unsigned d;                  /* dmer size : constraint: 0 < d <= k : Reasonable range [6, 16] */
-    unsigned steps;              /* Number of steps : Only used for optimization : 0 means default (32) : Higher means more parameters checked */
-    unsigned nbThreads;          /* Number of threads : constraint: 0 < nbThreads : 1 means single-threaded : Only used for optimization : Ignored if ZSTD_MULTITHREAD is not defined */
-    ZDICT_params_t zParams;
-} ZDICT_cover_params_t;
-
-
-/*! ZDICT_trainFromBuffer_cover():
- * Train a dictionary from an array of samples using the COVER algorithm.
- * Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
- * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
- * The resulting dictionary will be saved into `dictBuffer`.
- * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
- *           or an error code, which can be tested with ZDICT_isError().
- * Note: ZDICT_trainFromBuffer_cover() requires about 9 bytes of memory for each input byte.
- * Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
- *        It's obviously possible to target smaller or larger ones, just by specifying different `dictBufferCapacity`.
- *        In general, it's recommended to provide a few thousands samples, but this can vary a lot.
- *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
- */
-ZDICTLIB_API size_t ZDICT_trainFromBuffer_cover(
-    void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer,
-    const size_t *samplesSizes, unsigned nbSamples,
-    ZDICT_cover_params_t parameters);
-
-/*! ZDICT_optimizeTrainFromBuffer_cover():
- * The same requirements as above hold for all the parameters except `parameters`.
- * This function tries many parameter combinations and picks the best parameters.
- * `*parameters` is filled with the best parameters found, and the dictionary
- * constructed with those parameters is stored in `dictBuffer`.
- *
- * All of the parameters d, k, steps are optional.
- * If d is non-zero then we don't check multiple values of d, otherwise we check d = {6, 8, 10, 12, 14, 16}.
- * if steps is zero it defaults to its default value.
- * If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [16, 2048].
- *
- * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
- *           or an error code, which can be tested with ZDICT_isError().
- *           On success `*parameters` contains the parameters selected.
- * Note: ZDICT_optimizeTrainFromBuffer_cover() requires about 8 bytes of memory for each input byte and additionally another 5 bytes of memory for each byte of memory for each thread.
- */
-ZDICTLIB_API size_t ZDICT_optimizeTrainFromBuffer_cover(
-    void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer,
-    const size_t *samplesSizes, unsigned nbSamples,
-    ZDICT_cover_params_t *parameters);
-
-/*! ZDICT_finalizeDictionary():
- * Given a custom content as a basis for dictionary, and a set of samples,
- * finalize dictionary by adding headers and statistics.
- *
- * Samples must be stored concatenated in a flat buffer `samplesBuffer`,
- * supplied with an array of sizes `samplesSizes`, providing the size of each sample in order.
- *
- * dictContentSize must be >= ZDICT_CONTENTSIZE_MIN bytes.
- * maxDictSize must be >= dictContentSize, and must be >= ZDICT_DICTSIZE_MIN bytes.
- *
- * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`),
- *           or an error code, which can be tested by ZDICT_isError().
- * Note: ZDICT_finalizeDictionary() will push notifications into stderr if instructed to, using notificationLevel>0.
- * Note 2: dictBuffer and dictContent can overlap
- */
-#define ZDICT_CONTENTSIZE_MIN 128
-#define ZDICT_DICTSIZE_MIN    256
-ZDICTLIB_API size_t ZDICT_finalizeDictionary(void* dictBuffer, size_t dictBufferCapacity,
-                                const void* dictContent, size_t dictContentSize,
-                                const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples,
-                                ZDICT_params_t parameters);
-
-typedef struct {
-    unsigned selectivityLevel;   /* 0 means default; larger => select more => larger dictionary */
-    ZDICT_params_t zParams;
-} ZDICT_legacy_params_t;
-
-/*! ZDICT_trainFromBuffer_legacy():
- * Train a dictionary from an array of samples.
- * Samples must be stored concatenated in a single flat buffer `samplesBuffer`,
- * supplied with an array of sizes `samplesSizes`, providing the size of each sample, in order.
- * The resulting dictionary will be saved into `dictBuffer`.
- * `parameters` is optional and can be provided with values set to 0 to mean "default".
- * @return: size of dictionary stored into `dictBuffer` (<= `dictBufferCapacity`)
- *           or an error code, which can be tested with ZDICT_isError().
- * Tips: In general, a reasonable dictionary has a size of ~ 100 KB.
- *        It's obviously possible to target smaller or larger ones, just by specifying different `dictBufferCapacity`.
- *        In general, it's recommended to provide a few thousands samples, but this can vary a lot.
- *        It's recommended that total size of all samples be about ~x100 times the target size of dictionary.
- * Note: ZDICT_trainFromBuffer_legacy() will send notifications into stderr if instructed to, using notificationLevel>0.
- */
-ZDICTLIB_API size_t ZDICT_trainFromBuffer_legacy(
-    void *dictBuffer, size_t dictBufferCapacity, const void *samplesBuffer,
-    const size_t *samplesSizes, unsigned nbSamples, ZDICT_legacy_params_t parameters);
-
-/* Deprecation warnings */
-/* It is generally possible to disable deprecation warnings from compiler,
-   for example with -Wno-deprecated-declarations for gcc
-   or _CRT_SECURE_NO_WARNINGS in Visual.
-   Otherwise, it's also possible to manually define ZDICT_DISABLE_DEPRECATE_WARNINGS */
-#ifdef ZDICT_DISABLE_DEPRECATE_WARNINGS
-#  define ZDICT_DEPRECATED(message) ZDICTLIB_API   /* disable deprecation warnings */
-#else
-#  define ZDICT_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
-#  if defined (__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */
-#    define ZDICT_DEPRECATED(message) [[deprecated(message)]] ZDICTLIB_API
-#  elif (ZDICT_GCC_VERSION >= 405) || defined(__clang__)
-#    define ZDICT_DEPRECATED(message) ZDICTLIB_API __attribute__((deprecated(message)))
-#  elif (ZDICT_GCC_VERSION >= 301)
-#    define ZDICT_DEPRECATED(message) ZDICTLIB_API __attribute__((deprecated))
-#  elif defined(_MSC_VER)
-#    define ZDICT_DEPRECATED(message) ZDICTLIB_API __declspec(deprecated(message))
-#  else
-#    pragma message("WARNING: You need to implement ZDICT_DEPRECATED for this compiler")
-#    define ZDICT_DEPRECATED(message) ZDICTLIB_API
-#  endif
-#endif /* ZDICT_DISABLE_DEPRECATE_WARNINGS */
-
-ZDICT_DEPRECATED("use ZDICT_finalizeDictionary() instead")
-size_t ZDICT_addEntropyTablesFromBuffer(void* dictBuffer, size_t dictContentSize, size_t dictBufferCapacity,
-                                  const void* samplesBuffer, const size_t* samplesSizes, unsigned nbSamples);
-
-
-#endif   /* ZDICT_STATIC_LINKING_ONLY */
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif   /* DICTBUILDER_H_001 */
diff --git a/priv/zstd/lib/dll/example/Makefile b/priv/zstd/lib/dll/example/Makefile
deleted file mode 100644
index 45d0db3..0000000
--- a/priv/zstd/lib/dll/example/Makefile
+++ /dev/null
@@ -1,47 +0,0 @@
-# ################################################################
-# Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
-# All rights reserved.
-#
-# This source code is licensed under both the BSD-style license (found in the
-# LICENSE file in the root directory of this source tree) and the GPLv2 (found
-# in the COPYING file in the root directory of this source tree).
-# ################################################################
-
-VOID    := /dev/null
-ZSTDDIR  := ../include
-LIBDIR  := ../static
-DLLDIR  := ../dll
-
-CFLAGS  ?= -O3   # can select custom flags. For example : CFLAGS="-O2 -g" make
-CFLAGS  += -Wall -Wextra -Wundef -Wcast-qual -Wcast-align -Wshadow -Wswitch-enum \
-           -Wdeclaration-after-statement -Wstrict-prototypes \
-           -Wpointer-arith -Wstrict-aliasing=1
-CFLAGS  += $(MOREFLAGS)
-CPPFLAGS:= -I$(ZSTDDIR) -DXXH_NAMESPACE=ZSTD_
-FLAGS   := $(CFLAGS) $(CPPFLAGS) $(LDFLAGS)
-
-
-# Define *.exe as extension for Windows systems
-ifneq (,$(filter Windows%,$(OS)))
-EXT =.exe
-else
-EXT =
-endif
-
-.PHONY: default fullbench-dll fullbench-lib
-
-
-default: all
-
-all: fullbench-dll fullbench-lib
-
-
-fullbench-lib: fullbench.c datagen.c
-	$(CC) $(FLAGS) $^ -o $@$(EXT) $(LIBDIR)/libzstd_static.lib
-
-fullbench-dll: fullbench.c datagen.c
-	$(CC) $(FLAGS) $^ -o $@$(EXT) -DZSTD_DLL_IMPORT=1 $(DLLDIR)/libzstd.dll
-
-clean:
-	@$(RM) fullbench-dll$(EXT) fullbench-lib$(EXT) \
-	@echo Cleaning completed
diff --git a/priv/zstd/lib/dll/example/README.md b/priv/zstd/lib/dll/example/README.md
deleted file mode 100644
index e231f59..0000000
--- a/priv/zstd/lib/dll/example/README.md
+++ /dev/null
@@ -1,69 +0,0 @@
-ZSTD Windows binary package
-====================================
-
-#### The package contents
-
-- `zstd.exe`                  : Command Line Utility, supporting gzip-like arguments
-- `dll\libzstd.dll`           : The ZSTD dynamic library (DLL)
-- `dll\libzstd.lib`           : The import library of the ZSTD dynamic library (DLL) for Visual C++
-- `example\`                  : The example of usage of the ZSTD library
-- `include\`                  : Header files required by the ZSTD library
-- `static\libzstd_static.lib` : The static ZSTD library (LIB)
-
-
-#### Usage of Command Line Interface
-
-Command Line Interface (CLI) supports gzip-like arguments.
-By default CLI takes an input file and compresses it to an output file:
-```
-    Usage: zstd [arg] [input] [output]
-```
-The full list of commands for CLI can be obtained with `-h` or `-H`. The ratio can
-be improved with commands from `-3` to `-16` but higher levels also have slower
-compression. CLI includes in-memory compression benchmark module with compression
-levels starting from `-b` and ending with `-e` with iteration time of `-i` seconds.
-CLI supports aggregation of parameters i.e. `-b1`, `-e18`, and `-i1` can be joined
-into `-b1e18i1`.
-
-
-#### The example of usage of static and dynamic ZSTD libraries with gcc/MinGW
-
-Use `cd example` and `make` to build `fullbench-dll` and `fullbench-lib`.
-`fullbench-dll` uses a dynamic ZSTD library from the `dll` directory.
-`fullbench-lib` uses a static ZSTD library from the `lib` directory.
-
-
-#### Using ZSTD DLL with gcc/MinGW
-
-The header files from `include\` and the dynamic library `dll\libzstd.dll`
-are required to compile a project using gcc/MinGW.
-The dynamic library has to be added to linking options.
-It means that if a project that uses ZSTD consists of a single `test-dll.c`
-file it should be linked with `dll\libzstd.dll`. For example:
-```
-    gcc $(CFLAGS) -Iinclude\ test-dll.c -o test-dll dll\libzstd.dll
-```
-The compiled executable will require ZSTD DLL which is available at `dll\libzstd.dll`.
-
-
-#### The example of usage of static and dynamic ZSTD libraries with Visual C++
-
-Open `example\fullbench-dll.sln` to compile `fullbench-dll` that uses a
-dynamic ZSTD library from the `dll` directory. The solution works with Visual C++
-2010 or newer. When one will open the solution with Visual C++ newer than 2010
-then the solution will upgraded to the current version.
-
-
-#### Using ZSTD DLL with Visual C++
-
-The header files from `include\` and the import library `dll\libzstd.lib`
-are required to compile a project using Visual C++.
-
-1. The path to header files should be added to `Additional Include Directories` that can
-   be found in project properties `C/C++` then `General`.
-2. The import library has to be added to `Additional Dependencies` that can
-   be found in project properties `Linker` then `Input`.
-   If one will provide only the name `libzstd.lib` without a full path to the library
-   the directory has to be added to `Linker\General\Additional Library Directories`.
-
-The compiled executable will require ZSTD DLL which is available at `dll\libzstd.dll`.
diff --git a/priv/zstd/lib/dll/example/build_package.bat b/priv/zstd/lib/dll/example/build_package.bat
deleted file mode 100644
index cae0a15..0000000
--- a/priv/zstd/lib/dll/example/build_package.bat
+++ /dev/null
@@ -1,19 +0,0 @@
-@ECHO OFF
-MKDIR bin\dll bin\static bin\example bin\include
-COPY tests\fullbench.c bin\example\
-COPY programs\datagen.c bin\example\
-COPY programs\datagen.h bin\example\
-COPY programs\util.h bin\example\
-COPY programs\platform.h bin\example\
-COPY lib\common\mem.h bin\example\
-COPY lib\common\zstd_errors.h bin\example\
-COPY lib\common\zstd_internal.h bin\example\
-COPY lib\common\error_private.h bin\example\
-COPY lib\common\xxhash.h bin\example\
-COPY lib\zstd.h bin\include\
-COPY lib\libzstd.a bin\static\libzstd_static.lib
-COPY lib\dll\libzstd.* bin\dll\
-COPY lib\dll\example\Makefile bin\example\
-COPY lib\dll\example\fullbench-dll.* bin\example\
-COPY lib\dll\example\README.md bin\
-COPY programs\zstd.exe bin\zstd.exe
diff --git a/priv/zstd/lib/dll/example/fullbench-dll.sln b/priv/zstd/lib/dll/example/fullbench-dll.sln
deleted file mode 100644
index 72e302e..0000000
--- a/priv/zstd/lib/dll/example/fullbench-dll.sln
+++ /dev/null
@@ -1,25 +0,0 @@
-Microsoft Visual Studio Solution File, Format Version 12.00
-# Visual Studio Express 2012 for Windows Desktop
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "fullbench-dll", "fullbench-dll.vcxproj", "{13992FD2-077E-4954-B065-A428198201A9}"
-EndProject
-Global
-	GlobalSection(SolutionConfigurationPlatforms) = preSolution
-		Debug|Win32 = Debug|Win32
-		Debug|x64 = Debug|x64
-		Release|Win32 = Release|Win32
-		Release|x64 = Release|x64
-	EndGlobalSection
-	GlobalSection(ProjectConfigurationPlatforms) = postSolution
-		{13992FD2-077E-4954-B065-A428198201A9}.Debug|Win32.ActiveCfg = Debug|Win32
-		{13992FD2-077E-4954-B065-A428198201A9}.Debug|Win32.Build.0 = Debug|Win32
-		{13992FD2-077E-4954-B065-A428198201A9}.Debug|x64.ActiveCfg = Debug|x64
-		{13992FD2-077E-4954-B065-A428198201A9}.Debug|x64.Build.0 = Debug|x64
-		{13992FD2-077E-4954-B065-A428198201A9}.Release|Win32.ActiveCfg = Release|Win32
-		{13992FD2-077E-4954-B065-A428198201A9}.Release|Win32.Build.0 = Release|Win32
-		{13992FD2-077E-4954-B065-A428198201A9}.Release|x64.ActiveCfg = Release|x64
-		{13992FD2-077E-4954-B065-A428198201A9}.Release|x64.Build.0 = Release|x64
-	EndGlobalSection
-	GlobalSection(SolutionProperties) = preSolution
-		HideSolutionNode = FALSE
-	EndGlobalSection
-EndGlobal
diff --git a/priv/zstd/lib/dll/example/fullbench-dll.vcxproj b/priv/zstd/lib/dll/example/fullbench-dll.vcxproj
deleted file mode 100644
index 44bbaf7..0000000
--- a/priv/zstd/lib/dll/example/fullbench-dll.vcxproj
+++ /dev/null
@@ -1,181 +0,0 @@
-
-
-  
-    
-      Debug
-      Win32
-    
-    
-      Debug
-      x64
-    
-    
-      Release
-      Win32
-    
-    
-      Release
-      x64
-    
-  
-  
-    {00000000-1CC8-4FD7-9281-6B8DBB9D3DF8}
-    Win32Proj
-    fullbench-dll
-    $(SolutionDir)bin\$(Platform)_$(Configuration)\
-    $(SolutionDir)bin\obj\$(RootNamespace)_$(Platform)_$(Configuration)\
-  
-  
-  
-    Application
-    true
-    MultiByte
-  
-  
-    Application
-    true
-    MultiByte
-  
-  
-    Application
-    false
-    true
-    MultiByte
-  
-  
-    Application
-    false
-    true
-    MultiByte
-  
-  
-  
-  
-  
-    
-  
-  
-    
-  
-  
-    
-  
-  
-    
-  
-  
-  
-    true
-    $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath);
-    false
-  
-  
-    true
-    $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath);
-    false
-  
-  
-    false
-    $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath);
-    false
-  
-  
-    false
-    $(IncludePath);$(SolutionDir)..\..\lib;$(SolutionDir)..\..\programs;$(SolutionDir)..\..\lib\legacy;$(SolutionDir)..\..\lib\common;$(UniversalCRT_IncludePath);
-    false
-  
-  
-    
-      
-      
-      Level4
-      Disabled
-      WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions)
-      true
-      false
-      ..\include
-    
-    
-      Console
-      true
-      $(SolutionDir)..\dll;%(AdditionalLibraryDirectories)
-      libzstd.lib;%(AdditionalDependencies)
-      false
-    
-  
-  
-    
-      
-      
-      Level4
-      Disabled
-      WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions)
-      true
-      false
-      ..\include
-    
-    
-      Console
-      true
-      $(SolutionDir)..\dll;%(AdditionalLibraryDirectories)
-      libzstd.lib;%(AdditionalDependencies)
-    
-  
-  
-    
-      Level4
-      
-      
-      MaxSpeed
-      true
-      true
-      WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions)
-      false
-      ..\include
-      false
-      MultiThreaded
-    
-    
-      Console
-      true
-      true
-      true
-      $(SolutionDir)..\dll;%(AdditionalLibraryDirectories)
-      libzstd.lib;%(AdditionalDependencies)
-      false
-    
-  
-  
-    
-      Level4
-      
-      
-      MaxSpeed
-      true
-      true
-      WIN32;_DEBUG;_CONSOLE;ZSTD_DLL_IMPORT=1;%(PreprocessorDefinitions)
-      false
-      false
-      ..\include
-      MultiThreaded
-    
-    
-      Console
-      true
-      true
-      true
-      $(SolutionDir)..\dll;%(AdditionalLibraryDirectories)
-      libzstd.lib;%(AdditionalDependencies)
-    
-  
-  
-    
-    
-  
-  
-    
-  
-  
-  
-  
-
\ No newline at end of file
diff --git a/priv/zstd/lib/dll/libzstd.def b/priv/zstd/lib/dll/libzstd.def
deleted file mode 100644
index 51d0c19..0000000
--- a/priv/zstd/lib/dll/libzstd.def
+++ /dev/null
@@ -1,88 +0,0 @@
-LIBRARY libzstd.dll
-EXPORTS
-    ZDICT_getDictID
-    ZDICT_getErrorName
-    ZDICT_isError
-    ZDICT_trainFromBuffer
-    ZSTD_CStreamInSize
-    ZSTD_CStreamOutSize
-    ZSTD_DStreamInSize
-    ZSTD_DStreamOutSize
-    ZSTD_adjustCParams
-    ZSTD_checkCParams
-    ZSTD_compress
-    ZSTD_compressBegin
-    ZSTD_compressBegin_advanced
-    ZSTD_compressBegin_usingDict
-    ZSTD_compressBlock
-    ZSTD_compressBound
-    ZSTD_compressCCtx
-    ZSTD_compressContinue
-    ZSTD_compressEnd
-    ZSTD_compressStream
-    ZSTD_compress_advanced
-    ZSTD_compress_usingCDict
-    ZSTD_compress_usingDict
-    ZSTD_copyCCtx
-    ZSTD_copyDCtx
-    ZSTD_createCCtx
-    ZSTD_createCCtx_advanced
-    ZSTD_createCDict
-    ZSTD_createCDict_advanced
-    ZSTD_createCStream
-    ZSTD_createCStream_advanced
-    ZSTD_createDCtx
-    ZSTD_createDCtx_advanced
-    ZSTD_createDDict
-    ZSTD_createDStream
-    ZSTD_createDStream_advanced
-    ZSTD_decompress
-    ZSTD_decompressBegin
-    ZSTD_decompressBegin_usingDict
-    ZSTD_decompressBlock
-    ZSTD_decompressContinue
-    ZSTD_decompressDCtx
-    ZSTD_decompressStream
-    ZSTD_decompress_usingDDict
-    ZSTD_decompress_usingDict
-    ZSTD_endStream
-    ZSTD_estimateCCtxSize
-    ZSTD_estimateDCtxSize
-    ZSTD_flushStream
-    ZSTD_freeCCtx
-    ZSTD_freeCDict
-    ZSTD_freeCStream
-    ZSTD_freeDCtx
-    ZSTD_freeDDict
-    ZSTD_freeDStream
-    ZSTD_getBlockSizeMax
-    ZSTD_getCParams
-    ZSTD_getDecompressedSize
-    ZSTD_findDecompressedSize
-    ZSTD_getFrameContentSize
-    ZSTD_getErrorName
-    ZSTD_getFrameParams
-    ZSTD_getParams
-    ZSTD_initCStream
-    ZSTD_initCStream_advanced
-    ZSTD_initCStream_usingCDict
-    ZSTD_initCStream_usingDict
-    ZSTD_initDStream
-    ZSTD_initDStream_usingDDict
-    ZSTD_initDStream_usingDict
-    ZSTD_insertBlock
-    ZSTD_isError
-    ZSTD_isFrame
-    ZSTD_maxCLevel
-    ZSTD_nextInputType
-    ZSTD_nextSrcSizeToDecompress
-    ZSTD_resetCStream
-    ZSTD_resetDStream
-    ZSTD_setDStreamParameter
-    ZSTD_sizeof_CCtx
-    ZSTD_sizeof_CDict
-    ZSTD_sizeof_CStream
-    ZSTD_sizeof_DCtx
-    ZSTD_sizeof_DDict
-    ZSTD_sizeof_DStream
-    ZSTD_versionNumber
diff --git a/priv/zstd/lib/legacy/zstd_legacy.h b/priv/zstd/lib/legacy/zstd_legacy.h
deleted file mode 100644
index 487ff0b..0000000
--- a/priv/zstd/lib/legacy/zstd_legacy.h
+++ /dev/null
@@ -1,379 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_LEGACY_H
-#define ZSTD_LEGACY_H
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/* *************************************
-*  Includes
-***************************************/
-#include "mem.h"            /* MEM_STATIC */
-#include "error_private.h"  /* ERROR */
-#include "zstd.h"           /* ZSTD_inBuffer, ZSTD_outBuffer */
-
-#if !defined (ZSTD_LEGACY_SUPPORT) || (ZSTD_LEGACY_SUPPORT == 0)
-#  undef ZSTD_LEGACY_SUPPORT
-#  define ZSTD_LEGACY_SUPPORT 8
-#endif
-
-#if (ZSTD_LEGACY_SUPPORT <= 1)
-#  include "zstd_v01.h"
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 2)
-#  include "zstd_v02.h"
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 3)
-#  include "zstd_v03.h"
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-#  include "zstd_v04.h"
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-#  include "zstd_v05.h"
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-#  include "zstd_v06.h"
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-#  include "zstd_v07.h"
-#endif
-
-/** ZSTD_isLegacy() :
-    @return : > 0 if supported by legacy decoder. 0 otherwise.
-              return value is the version.
-*/
-MEM_STATIC unsigned ZSTD_isLegacy(const void* src, size_t srcSize)
-{
-    U32 magicNumberLE;
-    if (srcSize<4) return 0;
-    magicNumberLE = MEM_readLE32(src);
-    switch(magicNumberLE)
-    {
-#if (ZSTD_LEGACY_SUPPORT <= 1)
-        case ZSTDv01_magicNumberLE:return 1;
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 2)
-        case ZSTDv02_magicNumber : return 2;
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 3)
-        case ZSTDv03_magicNumber : return 3;
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-        case ZSTDv04_magicNumber : return 4;
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-        case ZSTDv05_MAGICNUMBER : return 5;
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-        case ZSTDv06_MAGICNUMBER : return 6;
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-        case ZSTDv07_MAGICNUMBER : return 7;
-#endif
-        default : return 0;
-    }
-}
-
-
-MEM_STATIC unsigned long long ZSTD_getDecompressedSize_legacy(const void* src, size_t srcSize)
-{
-    U32 const version = ZSTD_isLegacy(src, srcSize);
-    if (version < 5) return 0;  /* no decompressed size in frame header, or not a legacy format */
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-    if (version==5) {
-        ZSTDv05_parameters fParams;
-        size_t const frResult = ZSTDv05_getFrameParams(&fParams, src, srcSize);
-        if (frResult != 0) return 0;
-        return fParams.srcSize;
-    }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-    if (version==6) {
-        ZSTDv06_frameParams fParams;
-        size_t const frResult = ZSTDv06_getFrameParams(&fParams, src, srcSize);
-        if (frResult != 0) return 0;
-        return fParams.frameContentSize;
-    }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-    if (version==7) {
-        ZSTDv07_frameParams fParams;
-        size_t const frResult = ZSTDv07_getFrameParams(&fParams, src, srcSize);
-        if (frResult != 0) return 0;
-        return fParams.frameContentSize;
-    }
-#endif
-    return 0;   /* should not be possible */
-}
-
-
-MEM_STATIC size_t ZSTD_decompressLegacy(
-                     void* dst, size_t dstCapacity,
-               const void* src, size_t compressedSize,
-               const void* dict,size_t dictSize)
-{
-    U32 const version = ZSTD_isLegacy(src, compressedSize);
-    (void)dst; (void)dstCapacity; (void)dict; (void)dictSize;  /* unused when ZSTD_LEGACY_SUPPORT >= 8 */
-    switch(version)
-    {
-#if (ZSTD_LEGACY_SUPPORT <= 1)
-        case 1 :
-            return ZSTDv01_decompress(dst, dstCapacity, src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 2)
-        case 2 :
-            return ZSTDv02_decompress(dst, dstCapacity, src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 3)
-        case 3 :
-            return ZSTDv03_decompress(dst, dstCapacity, src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-        case 4 :
-            return ZSTDv04_decompress(dst, dstCapacity, src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-        case 5 :
-            {   size_t result;
-                ZSTDv05_DCtx* const zd = ZSTDv05_createDCtx();
-                if (zd==NULL) return ERROR(memory_allocation);
-                result = ZSTDv05_decompress_usingDict(zd, dst, dstCapacity, src, compressedSize, dict, dictSize);
-                ZSTDv05_freeDCtx(zd);
-                return result;
-            }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-        case 6 :
-            {   size_t result;
-                ZSTDv06_DCtx* const zd = ZSTDv06_createDCtx();
-                if (zd==NULL) return ERROR(memory_allocation);
-                result = ZSTDv06_decompress_usingDict(zd, dst, dstCapacity, src, compressedSize, dict, dictSize);
-                ZSTDv06_freeDCtx(zd);
-                return result;
-            }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-        case 7 :
-            {   size_t result;
-                ZSTDv07_DCtx* const zd = ZSTDv07_createDCtx();
-                if (zd==NULL) return ERROR(memory_allocation);
-                result = ZSTDv07_decompress_usingDict(zd, dst, dstCapacity, src, compressedSize, dict, dictSize);
-                ZSTDv07_freeDCtx(zd);
-                return result;
-            }
-#endif
-        default :
-            return ERROR(prefix_unknown);
-    }
-}
-
-MEM_STATIC size_t ZSTD_findFrameCompressedSizeLegacy(const void *src,
-                                             size_t compressedSize)
-{
-    U32 const version = ZSTD_isLegacy(src, compressedSize);
-    switch(version)
-    {
-#if (ZSTD_LEGACY_SUPPORT <= 1)
-        case 1 :
-            return ZSTDv01_findFrameCompressedSize(src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 2)
-        case 2 :
-            return ZSTDv02_findFrameCompressedSize(src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 3)
-        case 3 :
-            return ZSTDv03_findFrameCompressedSize(src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-        case 4 :
-            return ZSTDv04_findFrameCompressedSize(src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-        case 5 :
-            return ZSTDv05_findFrameCompressedSize(src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-        case 6 :
-            return ZSTDv06_findFrameCompressedSize(src, compressedSize);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-        case 7 :
-            return ZSTDv07_findFrameCompressedSize(src, compressedSize);
-#endif
-        default :
-            return ERROR(prefix_unknown);
-    }
-}
-
-MEM_STATIC size_t ZSTD_freeLegacyStreamContext(void* legacyContext, U32 version)
-{
-    switch(version)
-    {
-        default :
-        case 1 :
-        case 2 :
-        case 3 :
-            (void)legacyContext;
-            return ERROR(version_unsupported);
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-        case 4 : return ZBUFFv04_freeDCtx((ZBUFFv04_DCtx*)legacyContext);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-        case 5 : return ZBUFFv05_freeDCtx((ZBUFFv05_DCtx*)legacyContext);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-        case 6 : return ZBUFFv06_freeDCtx((ZBUFFv06_DCtx*)legacyContext);
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-        case 7 : return ZBUFFv07_freeDCtx((ZBUFFv07_DCtx*)legacyContext);
-#endif
-    }
-}
-
-
-MEM_STATIC size_t ZSTD_initLegacyStream(void** legacyContext, U32 prevVersion, U32 newVersion,
-                                        const void* dict, size_t dictSize)
-{
-    if (prevVersion != newVersion) ZSTD_freeLegacyStreamContext(*legacyContext, prevVersion);
-    switch(newVersion)
-    {
-        default :
-        case 1 :
-        case 2 :
-        case 3 :
-            (void)dict; (void)dictSize;
-            return 0;
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-        case 4 :
-        {
-            ZBUFFv04_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv04_createDCtx() : (ZBUFFv04_DCtx*)*legacyContext;
-            if (dctx==NULL) return ERROR(memory_allocation);
-            ZBUFFv04_decompressInit(dctx);
-            ZBUFFv04_decompressWithDictionary(dctx, dict, dictSize);
-            *legacyContext = dctx;
-            return 0;
-        }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-        case 5 :
-        {
-            ZBUFFv05_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv05_createDCtx() : (ZBUFFv05_DCtx*)*legacyContext;
-            if (dctx==NULL) return ERROR(memory_allocation);
-            ZBUFFv05_decompressInitDictionary(dctx, dict, dictSize);
-            *legacyContext = dctx;
-            return 0;
-        }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-        case 6 :
-        {
-            ZBUFFv06_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv06_createDCtx() : (ZBUFFv06_DCtx*)*legacyContext;
-            if (dctx==NULL) return ERROR(memory_allocation);
-            ZBUFFv06_decompressInitDictionary(dctx, dict, dictSize);
-            *legacyContext = dctx;
-            return 0;
-        }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-        case 7 :
-        {
-            ZBUFFv07_DCtx* dctx = (prevVersion != newVersion) ? ZBUFFv07_createDCtx() : (ZBUFFv07_DCtx*)*legacyContext;
-            if (dctx==NULL) return ERROR(memory_allocation);
-            ZBUFFv07_decompressInitDictionary(dctx, dict, dictSize);
-            *legacyContext = dctx;
-            return 0;
-        }
-#endif
-    }
-}
-
-
-
-MEM_STATIC size_t ZSTD_decompressLegacyStream(void* legacyContext, U32 version,
-                                              ZSTD_outBuffer* output, ZSTD_inBuffer* input)
-{
-    switch(version)
-    {
-        default :
-        case 1 :
-        case 2 :
-        case 3 :
-            (void)legacyContext; (void)output; (void)input;
-            return ERROR(version_unsupported);
-#if (ZSTD_LEGACY_SUPPORT <= 4)
-        case 4 :
-            {
-                ZBUFFv04_DCtx* dctx = (ZBUFFv04_DCtx*) legacyContext;
-                const void* src = (const char*)input->src + input->pos;
-                size_t readSize = input->size - input->pos;
-                void* dst = (char*)output->dst + output->pos;
-                size_t decodedSize = output->size - output->pos;
-                size_t const hintSize = ZBUFFv04_decompressContinue(dctx, dst, &decodedSize, src, &readSize);
-                output->pos += decodedSize;
-                input->pos += readSize;
-                return hintSize;
-            }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 5)
-        case 5 :
-            {
-                ZBUFFv05_DCtx* dctx = (ZBUFFv05_DCtx*) legacyContext;
-                const void* src = (const char*)input->src + input->pos;
-                size_t readSize = input->size - input->pos;
-                void* dst = (char*)output->dst + output->pos;
-                size_t decodedSize = output->size - output->pos;
-                size_t const hintSize = ZBUFFv05_decompressContinue(dctx, dst, &decodedSize, src, &readSize);
-                output->pos += decodedSize;
-                input->pos += readSize;
-                return hintSize;
-            }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 6)
-        case 6 :
-            {
-                ZBUFFv06_DCtx* dctx = (ZBUFFv06_DCtx*) legacyContext;
-                const void* src = (const char*)input->src + input->pos;
-                size_t readSize = input->size - input->pos;
-                void* dst = (char*)output->dst + output->pos;
-                size_t decodedSize = output->size - output->pos;
-                size_t const hintSize = ZBUFFv06_decompressContinue(dctx, dst, &decodedSize, src, &readSize);
-                output->pos += decodedSize;
-                input->pos += readSize;
-                return hintSize;
-            }
-#endif
-#if (ZSTD_LEGACY_SUPPORT <= 7)
-        case 7 :
-            {
-                ZBUFFv07_DCtx* dctx = (ZBUFFv07_DCtx*) legacyContext;
-                const void* src = (const char*)input->src + input->pos;
-                size_t readSize = input->size - input->pos;
-                void* dst = (char*)output->dst + output->pos;
-                size_t decodedSize = output->size - output->pos;
-                size_t const hintSize = ZBUFFv07_decompressContinue(dctx, dst, &decodedSize, src, &readSize);
-                output->pos += decodedSize;
-                input->pos += readSize;
-                return hintSize;
-            }
-#endif
-    }
-}
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif   /* ZSTD_LEGACY_H */
diff --git a/priv/zstd/lib/legacy/zstd_v01.c b/priv/zstd/lib/legacy/zstd_v01.c
deleted file mode 100644
index ae1cb2c..0000000
--- a/priv/zstd/lib/legacy/zstd_v01.c
+++ /dev/null
@@ -1,2127 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-/******************************************
-*  Includes
-******************************************/
-#include     /* size_t, ptrdiff_t */
-#include "zstd_v01.h"
-#include "error_private.h"
-
-
-/******************************************
-*  Static allocation
-******************************************/
-/* You can statically allocate FSE CTable/DTable as a table of unsigned using below macro */
-#define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
-*  Increasing memory usage improves compression ratio
-*  Reduced memory usage can improve speed, due to cache effect
-*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
-#define FSE_MAX_MEMORY_USAGE 14
-#define FSE_DEFAULT_MEMORY_USAGE 13
-
-/* FSE_MAX_SYMBOL_VALUE :
-*  Maximum symbol value authorized.
-*  Required for proper stack allocation */
-#define FSE_MAX_SYMBOL_VALUE 255
-
-
-/****************************************************************
-*  template functions type & suffix
-****************************************************************/
-#define FSE_FUNCTION_TYPE BYTE
-#define FSE_FUNCTION_EXTENSION
-
-
-/****************************************************************
-*  Byte symbol type
-****************************************************************/
-typedef struct
-{
-    unsigned short newState;
-    unsigned char  symbol;
-    unsigned char  nbBits;
-} FSE_decode_t;   /* size == U32 */
-
-
-
-/****************************************************************
-*  Compiler specifics
-****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  define FORCE_INLINE static __forceinline
-#  include                     /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
-#else
-#  define GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
-
-
-/****************************************************************
-*  Includes
-****************************************************************/
-#include      /* malloc, free, qsort */
-#include      /* memcpy, memset */
-#include       /* printf (debug) */
-
-
-#ifndef MEM_ACCESS_MODULE
-#define MEM_ACCESS_MODULE
-/****************************************************************
-*  Basic Types
-*****************************************************************/
-#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-# include 
-typedef  uint8_t BYTE;
-typedef uint16_t U16;
-typedef  int16_t S16;
-typedef uint32_t U32;
-typedef  int32_t S32;
-typedef uint64_t U64;
-typedef  int64_t S64;
-#else
-typedef unsigned char       BYTE;
-typedef unsigned short      U16;
-typedef   signed short      S16;
-typedef unsigned int        U32;
-typedef   signed int        S32;
-typedef unsigned long long  U64;
-typedef   signed long long  S64;
-#endif
-
-#endif   /* MEM_ACCESS_MODULE */
-
-/****************************************************************
-*  Memory I/O
-*****************************************************************/
-/* FSE_FORCE_MEMORY_ACCESS
- * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
- * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
- * The below switch allow to select different access method for improved performance.
- * Method 0 (default) : use `memcpy()`. Safe and portable.
- * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
- *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
- * Method 2 : direct access. This method is portable but violate C standard.
- *            It can generate buggy code on targets generating assembly depending on alignment.
- *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
- * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
- * Prefer these methods in priority order (0 > 1 > 2)
- */
-#ifndef FSE_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
-#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
-#    define FSE_FORCE_MEMORY_ACCESS 2
-#  elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \
-  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
-#    define FSE_FORCE_MEMORY_ACCESS 1
-#  endif
-#endif
-
-
-static unsigned FSE_32bits(void)
-{
-    return sizeof(void*)==4;
-}
-
-static unsigned FSE_isLittleEndian(void)
-{
-    const union { U32 i; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
-    return one.c[0];
-}
-
-#if defined(FSE_FORCE_MEMORY_ACCESS) && (FSE_FORCE_MEMORY_ACCESS==2)
-
-static U16 FSE_read16(const void* memPtr) { return *(const U16*) memPtr; }
-static U32 FSE_read32(const void* memPtr) { return *(const U32*) memPtr; }
-static U64 FSE_read64(const void* memPtr) { return *(const U64*) memPtr; }
-
-#elif defined(FSE_FORCE_MEMORY_ACCESS) && (FSE_FORCE_MEMORY_ACCESS==1)
-
-/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
-/* currently only defined for gcc and icc */
-typedef union { U16 u16; U32 u32; U64 u64; } __attribute__((packed)) unalign;
-
-static U16 FSE_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }
-static U32 FSE_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
-static U64 FSE_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
-
-#else
-
-static U16 FSE_read16(const void* memPtr)
-{
-    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-static U32 FSE_read32(const void* memPtr)
-{
-    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-static U64 FSE_read64(const void* memPtr)
-{
-    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-#endif // FSE_FORCE_MEMORY_ACCESS
-
-static U16 FSE_readLE16(const void* memPtr)
-{
-    if (FSE_isLittleEndian())
-        return FSE_read16(memPtr);
-    else
-    {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U16)(p[0] + (p[1]<<8));
-    }
-}
-
-static U32 FSE_readLE32(const void* memPtr)
-{
-    if (FSE_isLittleEndian())
-        return FSE_read32(memPtr);
-    else
-    {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U32)((U32)p[0] + ((U32)p[1]<<8) + ((U32)p[2]<<16) + ((U32)p[3]<<24));
-    }
-}
-
-
-static U64 FSE_readLE64(const void* memPtr)
-{
-    if (FSE_isLittleEndian())
-        return FSE_read64(memPtr);
-    else
-    {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U64)((U64)p[0] + ((U64)p[1]<<8) + ((U64)p[2]<<16) + ((U64)p[3]<<24)
-                     + ((U64)p[4]<<32) + ((U64)p[5]<<40) + ((U64)p[6]<<48) + ((U64)p[7]<<56));
-    }
-}
-
-static size_t FSE_readLEST(const void* memPtr)
-{
-    if (FSE_32bits())
-        return (size_t)FSE_readLE32(memPtr);
-    else
-        return (size_t)FSE_readLE64(memPtr);
-}
-
-
-
-/****************************************************************
-*  Constants
-*****************************************************************/
-#define FSE_MAX_TABLELOG  (FSE_MAX_MEMORY_USAGE-2)
-#define FSE_MAX_TABLESIZE (1U< FSE_TABLELOG_ABSOLUTE_MAX
-#error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
-#endif
-
-
-/****************************************************************
-*  Error Management
-****************************************************************/
-#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-
-
-/****************************************************************
-*  Complex types
-****************************************************************/
-typedef struct
-{
-    int deltaFindState;
-    U32 deltaNbBits;
-} FSE_symbolCompressionTransform; /* total 8 bytes */
-
-typedef U32 DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
-
-/****************************************************************
-*  Internal functions
-****************************************************************/
-FORCE_INLINE unsigned FSE_highbit32 (U32 val)
-{
-#   if defined(_MSC_VER)   /* Visual */
-    unsigned long r;
-    _BitScanReverse ( &r, val );
-    return (unsigned) r;
-#   elif defined(__GNUC__) && (GCC_VERSION >= 304)   /* GCC Intrinsic */
-    return 31 - __builtin_clz (val);
-#   else   /* Software version */
-    static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
-    U32 v = val;
-    unsigned r;
-    v |= v >> 1;
-    v |= v >> 2;
-    v |= v >> 4;
-    v |= v >> 8;
-    v |= v >> 16;
-    r = DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
-    return r;
-#   endif
-}
-
-
-/****************************************************************
-*  Templates
-****************************************************************/
-/*
-  designed to be included
-  for type-specific functions (template emulation in C)
-  Objective is to write these functions only once, for improved maintenance
-*/
-
-/* safety checks */
-#ifndef FSE_FUNCTION_EXTENSION
-#  error "FSE_FUNCTION_EXTENSION must be defined"
-#endif
-#ifndef FSE_FUNCTION_TYPE
-#  error "FSE_FUNCTION_TYPE must be defined"
-#endif
-
-/* Function names */
-#define FSE_CAT(X,Y) X##Y
-#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
-#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
-
-
-
-static U32 FSE_tableStep(U32 tableSize) { return (tableSize>>1) + (tableSize>>3) + 3; }
-
-#define FSE_DECODE_TYPE FSE_decode_t
-
-
-typedef struct {
-    U16 tableLog;
-    U16 fastMode;
-} FSE_DTableHeader;   /* sizeof U32 */
-
-static size_t FSE_buildDTable
-(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-{
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*)(ptr) + 1;   /* because dt is unsigned, 32-bits aligned on 32-bits */
-    const U32 tableSize = 1 << tableLog;
-    const U32 tableMask = tableSize-1;
-    const U32 step = FSE_tableStep(tableSize);
-    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
-    U32 position = 0;
-    U32 highThreshold = tableSize-1;
-    const S16 largeLimit= (S16)(1 << (tableLog-1));
-    U32 noLarge = 1;
-    U32 s;
-
-    /* Sanity Checks */
-    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return (size_t)-FSE_ERROR_maxSymbolValue_tooLarge;
-    if (tableLog > FSE_MAX_TABLELOG) return (size_t)-FSE_ERROR_tableLog_tooLarge;
-
-    /* Init, lay down lowprob symbols */
-    DTableH[0].tableLog = (U16)tableLog;
-    for (s=0; s<=maxSymbolValue; s++)
-    {
-        if (normalizedCounter[s]==-1)
-        {
-            tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
-            symbolNext[s] = 1;
-        }
-        else
-        {
-            if (normalizedCounter[s] >= largeLimit) noLarge=0;
-            symbolNext[s] = normalizedCounter[s];
-        }
-    }
-
-    /* Spread symbols */
-    for (s=0; s<=maxSymbolValue; s++)
-    {
-        int i;
-        for (i=0; i highThreshold) position = (position + step) & tableMask;   /* lowprob area */
-        }
-    }
-
-    if (position!=0) return (size_t)-FSE_ERROR_GENERIC;   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
-
-    /* Build Decoding table */
-    {
-        U32 i;
-        for (i=0; ifastMode = (U16)noLarge;
-    return 0;
-}
-
-
-/******************************************
-*  FSE byte symbol
-******************************************/
-#ifndef FSE_COMMONDEFS_ONLY
-
-static unsigned FSE_isError(size_t code) { return (code > (size_t)(-FSE_ERROR_maxCode)); }
-
-static short FSE_abs(short a)
-{
-    return a<0? -a : a;
-}
-
-
-/****************************************************************
-*  Header bitstream management
-****************************************************************/
-static size_t FSE_readNCount (short* normalizedCounter, unsigned* maxSVPtr, unsigned* tableLogPtr,
-                 const void* headerBuffer, size_t hbSize)
-{
-    const BYTE* const istart = (const BYTE*) headerBuffer;
-    const BYTE* const iend = istart + hbSize;
-    const BYTE* ip = istart;
-    int nbBits;
-    int remaining;
-    int threshold;
-    U32 bitStream;
-    int bitCount;
-    unsigned charnum = 0;
-    int previous0 = 0;
-
-    if (hbSize < 4) return (size_t)-FSE_ERROR_srcSize_wrong;
-    bitStream = FSE_readLE32(ip);
-    nbBits = (bitStream & 0xF) + FSE_MIN_TABLELOG;   /* extract tableLog */
-    if (nbBits > FSE_TABLELOG_ABSOLUTE_MAX) return (size_t)-FSE_ERROR_tableLog_tooLarge;
-    bitStream >>= 4;
-    bitCount = 4;
-    *tableLogPtr = nbBits;
-    remaining = (1<1) && (charnum<=*maxSVPtr))
-    {
-        if (previous0)
-        {
-            unsigned n0 = charnum;
-            while ((bitStream & 0xFFFF) == 0xFFFF)
-            {
-                n0+=24;
-                if (ip < iend-5)
-                {
-                    ip+=2;
-                    bitStream = FSE_readLE32(ip) >> bitCount;
-                }
-                else
-                {
-                    bitStream >>= 16;
-                    bitCount+=16;
-                }
-            }
-            while ((bitStream & 3) == 3)
-            {
-                n0+=3;
-                bitStream>>=2;
-                bitCount+=2;
-            }
-            n0 += bitStream & 3;
-            bitCount += 2;
-            if (n0 > *maxSVPtr) return (size_t)-FSE_ERROR_maxSymbolValue_tooSmall;
-            while (charnum < n0) normalizedCounter[charnum++] = 0;
-            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))
-            {
-                ip += bitCount>>3;
-                bitCount &= 7;
-                bitStream = FSE_readLE32(ip) >> bitCount;
-            }
-            else
-                bitStream >>= 2;
-        }
-        {
-            const short max = (short)((2*threshold-1)-remaining);
-            short count;
-
-            if ((bitStream & (threshold-1)) < (U32)max)
-            {
-                count = (short)(bitStream & (threshold-1));
-                bitCount   += nbBits-1;
-            }
-            else
-            {
-                count = (short)(bitStream & (2*threshold-1));
-                if (count >= threshold) count -= max;
-                bitCount   += nbBits;
-            }
-
-            count--;   /* extra accuracy */
-            remaining -= FSE_abs(count);
-            normalizedCounter[charnum++] = count;
-            previous0 = !count;
-            while (remaining < threshold)
-            {
-                nbBits--;
-                threshold >>= 1;
-            }
-
-            {
-                if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))
-                {
-                    ip += bitCount>>3;
-                    bitCount &= 7;
-                }
-                else
-                {
-                    bitCount -= (int)(8 * (iend - 4 - ip));
-                    ip = iend - 4;
-                }
-                bitStream = FSE_readLE32(ip) >> (bitCount & 31);
-            }
-        }
-    }
-    if (remaining != 1) return (size_t)-FSE_ERROR_GENERIC;
-    *maxSVPtr = charnum-1;
-
-    ip += (bitCount+7)>>3;
-    if ((size_t)(ip-istart) > hbSize) return (size_t)-FSE_ERROR_srcSize_wrong;
-    return ip-istart;
-}
-
-
-/*********************************************************
-*  Decompression (Byte symbols)
-*********************************************************/
-static size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)
-{
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    FSE_decode_t* const cell = (FSE_decode_t*)(ptr) + 1;   /* because dt is unsigned */
-
-    DTableH->tableLog = 0;
-    DTableH->fastMode = 0;
-
-    cell->newState = 0;
-    cell->symbol = symbolValue;
-    cell->nbBits = 0;
-
-    return 0;
-}
-
-
-static size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
-{
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    FSE_decode_t* const dinfo = (FSE_decode_t*)(ptr) + 1;   /* because dt is unsigned */
-    const unsigned tableSize = 1 << nbBits;
-    const unsigned tableMask = tableSize - 1;
-    const unsigned maxSymbolValue = tableMask;
-    unsigned s;
-
-    /* Sanity checks */
-    if (nbBits < 1) return (size_t)-FSE_ERROR_GENERIC;             /* min size */
-
-    /* Build Decoding Table */
-    DTableH->tableLog = (U16)nbBits;
-    DTableH->fastMode = 1;
-    for (s=0; s<=maxSymbolValue; s++)
-    {
-        dinfo[s].newState = 0;
-        dinfo[s].symbol = (BYTE)s;
-        dinfo[s].nbBits = (BYTE)nbBits;
-    }
-
-    return 0;
-}
-
-
-/* FSE_initDStream
- * Initialize a FSE_DStream_t.
- * srcBuffer must point at the beginning of an FSE block.
- * The function result is the size of the FSE_block (== srcSize).
- * If srcSize is too small, the function will return an errorCode;
- */
-static size_t FSE_initDStream(FSE_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
-{
-    if (srcSize < 1) return (size_t)-FSE_ERROR_srcSize_wrong;
-
-    if (srcSize >=  sizeof(size_t))
-    {
-        U32 contain32;
-        bitD->start = (const char*)srcBuffer;
-        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(size_t);
-        bitD->bitContainer = FSE_readLEST(bitD->ptr);
-        contain32 = ((const BYTE*)srcBuffer)[srcSize-1];
-        if (contain32 == 0) return (size_t)-FSE_ERROR_GENERIC;   /* stop bit not present */
-        bitD->bitsConsumed = 8 - FSE_highbit32(contain32);
-    }
-    else
-    {
-        U32 contain32;
-        bitD->start = (const char*)srcBuffer;
-        bitD->ptr   = bitD->start;
-        bitD->bitContainer = *(const BYTE*)(bitD->start);
-        switch(srcSize)
-        {
-            case 7: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[6]) << (sizeof(size_t)*8 - 16);
-            case 6: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[5]) << (sizeof(size_t)*8 - 24);
-            case 5: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[4]) << (sizeof(size_t)*8 - 32);
-            case 4: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[3]) << 24;
-            case 3: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[2]) << 16;
-            case 2: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[1]) <<  8;
-            default:;
-        }
-        contain32 = ((const BYTE*)srcBuffer)[srcSize-1];
-        if (contain32 == 0) return (size_t)-FSE_ERROR_GENERIC;   /* stop bit not present */
-        bitD->bitsConsumed = 8 - FSE_highbit32(contain32);
-        bitD->bitsConsumed += (U32)(sizeof(size_t) - srcSize)*8;
-    }
-
-    return srcSize;
-}
-
-
-/*!FSE_lookBits
- * Provides next n bits from the bitContainer.
- * bitContainer is not modified (bits are still present for next read/look)
- * On 32-bits, maxNbBits==25
- * On 64-bits, maxNbBits==57
- * return : value extracted.
- */
-static size_t FSE_lookBits(FSE_DStream_t* bitD, U32 nbBits)
-{
-    const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
-}
-
-static size_t FSE_lookBitsFast(FSE_DStream_t* bitD, U32 nbBits)   /* only if nbBits >= 1 !! */
-{
-    const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
-}
-
-static void FSE_skipBits(FSE_DStream_t* bitD, U32 nbBits)
-{
-    bitD->bitsConsumed += nbBits;
-}
-
-
-/*!FSE_readBits
- * Read next n bits from the bitContainer.
- * On 32-bits, don't read more than maxNbBits==25
- * On 64-bits, don't read more than maxNbBits==57
- * Use the fast variant *only* if n >= 1.
- * return : value extracted.
- */
-static size_t FSE_readBits(FSE_DStream_t* bitD, U32 nbBits)
-{
-    size_t value = FSE_lookBits(bitD, nbBits);
-    FSE_skipBits(bitD, nbBits);
-    return value;
-}
-
-static size_t FSE_readBitsFast(FSE_DStream_t* bitD, U32 nbBits)   /* only if nbBits >= 1 !! */
-{
-    size_t value = FSE_lookBitsFast(bitD, nbBits);
-    FSE_skipBits(bitD, nbBits);
-    return value;
-}
-
-static unsigned FSE_reloadDStream(FSE_DStream_t* bitD)
-{
-    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-        return FSE_DStream_tooFar;
-
-    if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))
-    {
-        bitD->ptr -= bitD->bitsConsumed >> 3;
-        bitD->bitsConsumed &= 7;
-        bitD->bitContainer = FSE_readLEST(bitD->ptr);
-        return FSE_DStream_unfinished;
-    }
-    if (bitD->ptr == bitD->start)
-    {
-        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return FSE_DStream_endOfBuffer;
-        return FSE_DStream_completed;
-    }
-    {
-        U32 nbBytes = bitD->bitsConsumed >> 3;
-        U32 result = FSE_DStream_unfinished;
-        if (bitD->ptr - nbBytes < bitD->start)
-        {
-            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
-            result = FSE_DStream_endOfBuffer;
-        }
-        bitD->ptr -= nbBytes;
-        bitD->bitsConsumed -= nbBytes*8;
-        bitD->bitContainer = FSE_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
-        return result;
-    }
-}
-
-
-static void FSE_initDState(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD, const FSE_DTable* dt)
-{
-    const void* ptr = dt;
-    const FSE_DTableHeader* const DTableH = (const FSE_DTableHeader*)ptr;
-    DStatePtr->state = FSE_readBits(bitD, DTableH->tableLog);
-    FSE_reloadDStream(bitD);
-    DStatePtr->table = dt + 1;
-}
-
-static BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD)
-{
-    const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    const U32  nbBits = DInfo.nbBits;
-    BYTE symbol = DInfo.symbol;
-    size_t lowBits = FSE_readBits(bitD, nbBits);
-
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
-}
-
-static BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, FSE_DStream_t* bitD)
-{
-    const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    const U32 nbBits = DInfo.nbBits;
-    BYTE symbol = DInfo.symbol;
-    size_t lowBits = FSE_readBitsFast(bitD, nbBits);
-
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
-}
-
-/* FSE_endOfDStream
-   Tells if bitD has reached end of bitStream or not */
-
-static unsigned FSE_endOfDStream(const FSE_DStream_t* bitD)
-{
-    return ((bitD->ptr == bitD->start) && (bitD->bitsConsumed == sizeof(bitD->bitContainer)*8));
-}
-
-static unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
-{
-    return DStatePtr->state == 0;
-}
-
-
-FORCE_INLINE size_t FSE_decompress_usingDTable_generic(
-          void* dst, size_t maxDstSize,
-    const void* cSrc, size_t cSrcSize,
-    const FSE_DTable* dt, const unsigned fast)
-{
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const omax = op + maxDstSize;
-    BYTE* const olimit = omax-3;
-
-    FSE_DStream_t bitD;
-    FSE_DState_t state1;
-    FSE_DState_t state2;
-    size_t errorCode;
-
-    /* Init */
-    errorCode = FSE_initDStream(&bitD, cSrc, cSrcSize);   /* replaced last arg by maxCompressed Size */
-    if (FSE_isError(errorCode)) return errorCode;
-
-    FSE_initDState(&state1, &bitD, dt);
-    FSE_initDState(&state2, &bitD, dt);
-
-#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
-
-    /* 4 symbols per loop */
-    for ( ; (FSE_reloadDStream(&bitD)==FSE_DStream_unfinished) && (op sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            FSE_reloadDStream(&bitD);
-
-        op[1] = FSE_GETSYMBOL(&state2);
-
-        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            { if (FSE_reloadDStream(&bitD) > FSE_DStream_unfinished) { op+=2; break; } }
-
-        op[2] = FSE_GETSYMBOL(&state1);
-
-        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            FSE_reloadDStream(&bitD);
-
-        op[3] = FSE_GETSYMBOL(&state2);
-    }
-
-    /* tail */
-    /* note : FSE_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly FSE_DStream_completed */
-    while (1)
-    {
-        if ( (FSE_reloadDStream(&bitD)>FSE_DStream_completed) || (op==omax) || (FSE_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state1))) )
-            break;
-
-        *op++ = FSE_GETSYMBOL(&state1);
-
-        if ( (FSE_reloadDStream(&bitD)>FSE_DStream_completed) || (op==omax) || (FSE_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state2))) )
-            break;
-
-        *op++ = FSE_GETSYMBOL(&state2);
-    }
-
-    /* end ? */
-    if (FSE_endOfDStream(&bitD) && FSE_endOfDState(&state1) && FSE_endOfDState(&state2))
-        return op-ostart;
-
-    if (op==omax) return (size_t)-FSE_ERROR_dstSize_tooSmall;   /* dst buffer is full, but cSrc unfinished */
-
-    return (size_t)-FSE_ERROR_corruptionDetected;
-}
-
-
-static size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
-                            const void* cSrc, size_t cSrcSize,
-                            const FSE_DTable* dt)
-{
-    FSE_DTableHeader DTableH;
-    memcpy(&DTableH, dt, sizeof(DTableH));   /* memcpy() into local variable, to avoid strict aliasing warning */
-
-    /* select fast mode (static) */
-    if (DTableH.fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
-    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
-}
-
-
-static size_t FSE_decompress(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize)
-{
-    const BYTE* const istart = (const BYTE*)cSrc;
-    const BYTE* ip = istart;
-    short counting[FSE_MAX_SYMBOL_VALUE+1];
-    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
-    unsigned tableLog;
-    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
-    size_t errorCode;
-
-    if (cSrcSize<2) return (size_t)-FSE_ERROR_srcSize_wrong;   /* too small input size */
-
-    /* normal FSE decoding mode */
-    errorCode = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
-    if (FSE_isError(errorCode)) return errorCode;
-    if (errorCode >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;   /* too small input size */
-    ip += errorCode;
-    cSrcSize -= errorCode;
-
-    errorCode = FSE_buildDTable (dt, counting, maxSymbolValue, tableLog);
-    if (FSE_isError(errorCode)) return errorCode;
-
-    /* always return, even if it is an error code */
-    return FSE_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, dt);
-}
-
-
-
-/* *******************************************************
-*  Huff0 : Huffman block compression
-*********************************************************/
-#define HUF_MAX_SYMBOL_VALUE 255
-#define HUF_DEFAULT_TABLELOG  12       /* used by default, when not specified */
-#define HUF_MAX_TABLELOG  12           /* max possible tableLog; for allocation purpose; can be modified */
-#define HUF_ABSOLUTEMAX_TABLELOG  16   /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
-#if (HUF_MAX_TABLELOG > HUF_ABSOLUTEMAX_TABLELOG)
-#  error "HUF_MAX_TABLELOG is too large !"
-#endif
-
-typedef struct HUF_CElt_s {
-  U16  val;
-  BYTE nbBits;
-} HUF_CElt ;
-
-typedef struct nodeElt_s {
-    U32 count;
-    U16 parent;
-    BYTE byte;
-    BYTE nbBits;
-} nodeElt;
-
-
-/* *******************************************************
-*  Huff0 : Huffman block decompression
-*********************************************************/
-typedef struct {
-    BYTE byte;
-    BYTE nbBits;
-} HUF_DElt;
-
-static size_t HUF_readDTable (U16* DTable, const void* src, size_t srcSize)
-{
-    BYTE huffWeight[HUF_MAX_SYMBOL_VALUE + 1];
-    U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];  /* large enough for values from 0 to 16 */
-    U32 weightTotal;
-    U32 maxBits;
-    const BYTE* ip = (const BYTE*) src;
-    size_t iSize;
-    size_t oSize;
-    U32 n;
-    U32 nextRankStart;
-    void* ptr = DTable+1;
-    HUF_DElt* const dt = (HUF_DElt*)ptr;
-
-    if (!srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
-    iSize = ip[0];
-
-    FSE_STATIC_ASSERT(sizeof(HUF_DElt) == sizeof(U16));   /* if compilation fails here, assertion is false */
-    //memset(huffWeight, 0, sizeof(huffWeight));   /* should not be necessary, but some analyzer complain ... */
-    if (iSize >= 128)  /* special header */
-    {
-        if (iSize >= (242))   /* RLE */
-        {
-            static int l[14] = { 1, 2, 3, 4, 7, 8, 15, 16, 31, 32, 63, 64, 127, 128 };
-            oSize = l[iSize-242];
-            memset(huffWeight, 1, sizeof(huffWeight));
-            iSize = 0;
-        }
-        else   /* Incompressible */
-        {
-            oSize = iSize - 127;
-            iSize = ((oSize+1)/2);
-            if (iSize+1 > srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
-            ip += 1;
-            for (n=0; n> 4;
-                huffWeight[n+1] = ip[n/2] & 15;
-            }
-        }
-    }
-    else  /* header compressed with FSE (normal case) */
-    {
-        if (iSize+1 > srcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
-        oSize = FSE_decompress(huffWeight, HUF_MAX_SYMBOL_VALUE, ip+1, iSize);   /* max 255 values decoded, last one is implied */
-        if (FSE_isError(oSize)) return oSize;
-    }
-
-    /* collect weight stats */
-    memset(rankVal, 0, sizeof(rankVal));
-    weightTotal = 0;
-    for (n=0; n= HUF_ABSOLUTEMAX_TABLELOG) return (size_t)-FSE_ERROR_corruptionDetected;
-        rankVal[huffWeight[n]]++;
-        weightTotal += (1 << huffWeight[n]) >> 1;
-    }
-    if (weightTotal == 0) return (size_t)-FSE_ERROR_corruptionDetected;
-
-    /* get last non-null symbol weight (implied, total must be 2^n) */
-    maxBits = FSE_highbit32(weightTotal) + 1;
-    if (maxBits > DTable[0]) return (size_t)-FSE_ERROR_tableLog_tooLarge;   /* DTable is too small */
-    DTable[0] = (U16)maxBits;
-    {
-        U32 total = 1 << maxBits;
-        U32 rest = total - weightTotal;
-        U32 verif = 1 << FSE_highbit32(rest);
-        U32 lastWeight = FSE_highbit32(rest) + 1;
-        if (verif != rest) return (size_t)-FSE_ERROR_corruptionDetected;    /* last value must be a clean power of 2 */
-        huffWeight[oSize] = (BYTE)lastWeight;
-        rankVal[lastWeight]++;
-    }
-
-    /* check tree construction validity */
-    if ((rankVal[1] < 2) || (rankVal[1] & 1)) return (size_t)-FSE_ERROR_corruptionDetected;   /* by construction : at least 2 elts of rank 1, must be even */
-
-    /* Prepare ranks */
-    nextRankStart = 0;
-    for (n=1; n<=maxBits; n++)
-    {
-        U32 current = nextRankStart;
-        nextRankStart += (rankVal[n] << (n-1));
-        rankVal[n] = current;
-    }
-
-    /* fill DTable */
-    for (n=0; n<=oSize; n++)
-    {
-        const U32 w = huffWeight[n];
-        const U32 length = (1 << w) >> 1;
-        U32 i;
-        HUF_DElt D;
-        D.byte = (BYTE)n; D.nbBits = (BYTE)(maxBits + 1 - w);
-        for (i = rankVal[w]; i < rankVal[w] + length; i++)
-            dt[i] = D;
-        rankVal[w] += length;
-    }
-
-    return iSize+1;
-}
-
-
-static BYTE HUF_decodeSymbol(FSE_DStream_t* Dstream, const HUF_DElt* dt, const U32 dtLog)
-{
-        const size_t val = FSE_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
-        const BYTE c = dt[val].byte;
-        FSE_skipBits(Dstream, dt[val].nbBits);
-        return c;
-}
-
-static size_t HUF_decompress_usingDTable(   /* -3% slower when non static */
-          void* dst, size_t maxDstSize,
-    const void* cSrc, size_t cSrcSize,
-    const U16* DTable)
-{
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const omax = op + maxDstSize;
-    BYTE* const olimit = omax-15;
-
-    const void* ptr = DTable;
-    const HUF_DElt* const dt = (const HUF_DElt*)(ptr)+1;
-    const U32 dtLog = DTable[0];
-    size_t errorCode;
-    U32 reloadStatus;
-
-    /* Init */
-
-    const U16* jumpTable = (const U16*)cSrc;
-    const size_t length1 = FSE_readLE16(jumpTable);
-    const size_t length2 = FSE_readLE16(jumpTable+1);
-    const size_t length3 = FSE_readLE16(jumpTable+2);
-    const size_t length4 = cSrcSize - 6 - length1 - length2 - length3;   // check coherency !!
-    const char* const start1 = (const char*)(cSrc) + 6;
-    const char* const start2 = start1 + length1;
-    const char* const start3 = start2 + length2;
-    const char* const start4 = start3 + length3;
-    FSE_DStream_t bitD1, bitD2, bitD3, bitD4;
-
-    if (length1+length2+length3+6 >= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
-
-    errorCode = FSE_initDStream(&bitD1, start1, length1);
-    if (FSE_isError(errorCode)) return errorCode;
-    errorCode = FSE_initDStream(&bitD2, start2, length2);
-    if (FSE_isError(errorCode)) return errorCode;
-    errorCode = FSE_initDStream(&bitD3, start3, length3);
-    if (FSE_isError(errorCode)) return errorCode;
-    errorCode = FSE_initDStream(&bitD4, start4, length4);
-    if (FSE_isError(errorCode)) return errorCode;
-
-    reloadStatus=FSE_reloadDStream(&bitD2);
-
-    /* 16 symbols per loop */
-    for ( ; (reloadStatus12)) FSE_reloadDStream(&Dstream)
-
-#define HUF_DECODE_SYMBOL_2(n, Dstream) \
-        op[n] = HUF_decodeSymbol(&Dstream, dt, dtLog); \
-        if (FSE_32bits()) FSE_reloadDStream(&Dstream)
-
-        HUF_DECODE_SYMBOL_1( 0, bitD1);
-        HUF_DECODE_SYMBOL_1( 1, bitD2);
-        HUF_DECODE_SYMBOL_1( 2, bitD3);
-        HUF_DECODE_SYMBOL_1( 3, bitD4);
-        HUF_DECODE_SYMBOL_2( 4, bitD1);
-        HUF_DECODE_SYMBOL_2( 5, bitD2);
-        HUF_DECODE_SYMBOL_2( 6, bitD3);
-        HUF_DECODE_SYMBOL_2( 7, bitD4);
-        HUF_DECODE_SYMBOL_1( 8, bitD1);
-        HUF_DECODE_SYMBOL_1( 9, bitD2);
-        HUF_DECODE_SYMBOL_1(10, bitD3);
-        HUF_DECODE_SYMBOL_1(11, bitD4);
-        HUF_DECODE_SYMBOL_0(12, bitD1);
-        HUF_DECODE_SYMBOL_0(13, bitD2);
-        HUF_DECODE_SYMBOL_0(14, bitD3);
-        HUF_DECODE_SYMBOL_0(15, bitD4);
-    }
-
-    if (reloadStatus!=FSE_DStream_completed)   /* not complete : some bitStream might be FSE_DStream_unfinished */
-        return (size_t)-FSE_ERROR_corruptionDetected;
-
-    /* tail */
-    {
-        // bitTail = bitD1;   // *much* slower : -20% !??!
-        FSE_DStream_t bitTail;
-        bitTail.ptr = bitD1.ptr;
-        bitTail.bitsConsumed = bitD1.bitsConsumed;
-        bitTail.bitContainer = bitD1.bitContainer;   // required in case of FSE_DStream_endOfBuffer
-        bitTail.start = start1;
-        for ( ; (FSE_reloadDStream(&bitTail) < FSE_DStream_completed) && (op= cSrcSize) return (size_t)-FSE_ERROR_srcSize_wrong;
-    ip += errorCode;
-    cSrcSize -= errorCode;
-
-    return HUF_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, DTable);
-}
-
-
-#endif   /* FSE_COMMONDEFS_ONLY */
-
-/*
-    zstd - standard compression library
-    Copyright (C) 2014-2015, Yann Collet.
-
-    BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions are
-    met:
-    * Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
-    * Redistributions in binary form must reproduce the above
-    copyright notice, this list of conditions and the following disclaimer
-    in the documentation and/or other materials provided with the
-    distribution.
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-    "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-    OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - zstd source repository : https://github.com/Cyan4973/zstd
-    - ztsd public forum : https://groups.google.com/forum/#!forum/lz4c
-*/
-
-/****************************************************************
-*  Tuning parameters
-*****************************************************************/
-/* MEMORY_USAGE :
-*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
-*  Increasing memory usage improves compression ratio
-*  Reduced memory usage can improve speed, due to cache effect */
-#define ZSTD_MEMORY_USAGE 17
-
-
-/**************************************
-   CPU Feature Detection
-**************************************/
-/*
- * Automated efficient unaligned memory access detection
- * Based on known hardware architectures
- * This list will be updated thanks to feedbacks
- */
-#if defined(CPU_HAS_EFFICIENT_UNALIGNED_MEMORY_ACCESS) \
-    || defined(__ARM_FEATURE_UNALIGNED) \
-    || defined(__i386__) || defined(__x86_64__) \
-    || defined(_M_IX86) || defined(_M_X64) \
-    || defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_8__) \
-    || (defined(_M_ARM) && (_M_ARM >= 7))
-#  define ZSTD_UNALIGNED_ACCESS 1
-#else
-#  define ZSTD_UNALIGNED_ACCESS 0
-#endif
-
-
-/********************************************************
-*  Includes
-*********************************************************/
-#include       /* calloc */
-#include       /* memcpy, memmove */
-#include        /* debug : printf */
-
-
-/********************************************************
-*  Compiler specifics
-*********************************************************/
-#ifdef __AVX2__
-#  include    /* AVX2 intrinsics */
-#endif
-
-#ifdef _MSC_VER    /* Visual Studio */
-#  include                     /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4324)        /* disable: C4324: padded structure */
-#endif
-
-
-#ifndef MEM_ACCESS_MODULE
-#define MEM_ACCESS_MODULE
-/********************************************************
-*  Basic Types
-*********************************************************/
-#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-# include 
-typedef  uint8_t BYTE;
-typedef uint16_t U16;
-typedef  int16_t S16;
-typedef uint32_t U32;
-typedef  int32_t S32;
-typedef uint64_t U64;
-#else
-typedef unsigned char       BYTE;
-typedef unsigned short      U16;
-typedef   signed short      S16;
-typedef unsigned int        U32;
-typedef   signed int        S32;
-typedef unsigned long long  U64;
-#endif
-
-#endif   /* MEM_ACCESS_MODULE */
-
-
-/********************************************************
-*  Constants
-*********************************************************/
-static const U32 ZSTD_magicNumber = 0xFD2FB51E;   /* 3rd version : seqNb header */
-
-#define HASH_LOG (ZSTD_MEMORY_USAGE - 2)
-#define HASH_TABLESIZE (1 << HASH_LOG)
-#define HASH_MASK (HASH_TABLESIZE - 1)
-
-#define KNUTH 2654435761
-
-#define BIT7 128
-#define BIT6  64
-#define BIT5  32
-#define BIT4  16
-
-#define KB *(1 <<10)
-#define MB *(1 <<20)
-#define GB *(1U<<30)
-
-#define BLOCKSIZE (128 KB)                 /* define, for static allocation */
-
-#define WORKPLACESIZE (BLOCKSIZE*3)
-#define MINMATCH 4
-#define MLbits   7
-#define LLbits   6
-#define Offbits  5
-#define MaxML  ((1<>3];
-#else
-    U32 hashTable[HASH_TABLESIZE];
-#endif
-    BYTE buffer[WORKPLACESIZE];
-} cctxi_t;
-
-
-
-
-/**************************************
-*  Error Management
-**************************************/
-/* published entry point */
-unsigned ZSTDv01_isError(size_t code) { return ERR_isError(code); }
-
-
-/**************************************
-*  Tool functions
-**************************************/
-#define ZSTD_VERSION_MAJOR    0    /* for breaking interface changes  */
-#define ZSTD_VERSION_MINOR    1    /* for new (non-breaking) interface capabilities */
-#define ZSTD_VERSION_RELEASE  3    /* for tweaks, bug-fixes, or development */
-#define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
-
-/**************************************************************
-*   Decompression code
-**************************************************************/
-
-size_t ZSTDv01_getcBlockSize(const void* src, size_t srcSize, blockProperties_t* bpPtr)
-{
-    const BYTE* const in = (const BYTE* const)src;
-    BYTE headerFlags;
-    U32 cSize;
-
-    if (srcSize < 3) return ERROR(srcSize_wrong);
-
-    headerFlags = *in;
-    cSize = in[2] + (in[1]<<8) + ((in[0] & 7)<<16);
-
-    bpPtr->blockType = (blockType_t)(headerFlags >> 6);
-    bpPtr->origSize = (bpPtr->blockType == bt_rle) ? cSize : 0;
-
-    if (bpPtr->blockType == bt_end) return 0;
-    if (bpPtr->blockType == bt_rle) return 1;
-    return cSize;
-}
-
-
-static size_t ZSTD_copyUncompressedBlock(void* dst, size_t maxDstSize, const void* src, size_t srcSize)
-{
-    if (srcSize > maxDstSize) return ERROR(dstSize_tooSmall);
-    memcpy(dst, src, srcSize);
-    return srcSize;
-}
-
-
-static size_t ZSTD_decompressLiterals(void* ctx,
-                                      void* dst, size_t maxDstSize,
-                                const void* src, size_t srcSize)
-{
-    BYTE* op = (BYTE*)dst;
-    BYTE* const oend = op + maxDstSize;
-    const BYTE* ip = (const BYTE*)src;
-    size_t errorCode;
-    size_t litSize;
-
-    /* check : minimum 2, for litSize, +1, for content */
-    if (srcSize <= 3) return ERROR(corruption_detected);
-
-    litSize = ip[1] + (ip[0]<<8);
-    litSize += ((ip[-3] >> 3) & 7) << 16;   // mmmmh....
-    op = oend - litSize;
-
-    (void)ctx;
-    if (litSize > maxDstSize) return ERROR(dstSize_tooSmall);
-    errorCode = HUF_decompress(op, litSize, ip+2, srcSize-2);
-    if (FSE_isError(errorCode)) return ERROR(GENERIC);
-    return litSize;
-}
-
-
-size_t ZSTDv01_decodeLiteralsBlock(void* ctx,
-                                void* dst, size_t maxDstSize,
-                          const BYTE** litStart, size_t* litSize,
-                          const void* src, size_t srcSize)
-{
-    const BYTE* const istart = (const BYTE* const)src;
-    const BYTE* ip = istart;
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* const oend = ostart + maxDstSize;
-    blockProperties_t litbp;
-
-    size_t litcSize = ZSTDv01_getcBlockSize(src, srcSize, &litbp);
-    if (ZSTDv01_isError(litcSize)) return litcSize;
-    if (litcSize > srcSize - ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
-    ip += ZSTD_blockHeaderSize;
-
-    switch(litbp.blockType)
-    {
-    case bt_raw:
-        *litStart = ip;
-        ip += litcSize;
-        *litSize = litcSize;
-        break;
-    case bt_rle:
-        {
-            size_t rleSize = litbp.origSize;
-            if (rleSize>maxDstSize) return ERROR(dstSize_tooSmall);
-            if (!srcSize) return ERROR(srcSize_wrong);
-            memset(oend - rleSize, *ip, rleSize);
-            *litStart = oend - rleSize;
-            *litSize = rleSize;
-            ip++;
-            break;
-        }
-    case bt_compressed:
-        {
-            size_t decodedLitSize = ZSTD_decompressLiterals(ctx, dst, maxDstSize, ip, litcSize);
-            if (ZSTDv01_isError(decodedLitSize)) return decodedLitSize;
-            *litStart = oend - decodedLitSize;
-            *litSize = decodedLitSize;
-            ip += litcSize;
-            break;
-        }
-    case bt_end:
-    default:
-        return ERROR(GENERIC);
-    }
-
-    return ip-istart;
-}
-
-
-size_t ZSTDv01_decodeSeqHeaders(int* nbSeq, const BYTE** dumpsPtr, size_t* dumpsLengthPtr,
-                         FSE_DTable* DTableLL, FSE_DTable* DTableML, FSE_DTable* DTableOffb,
-                         const void* src, size_t srcSize)
-{
-    const BYTE* const istart = (const BYTE* const)src;
-    const BYTE* ip = istart;
-    const BYTE* const iend = istart + srcSize;
-    U32 LLtype, Offtype, MLtype;
-    U32 LLlog, Offlog, MLlog;
-    size_t dumpsLength;
-
-    /* check */
-    if (srcSize < 5) return ERROR(srcSize_wrong);
-
-    /* SeqHead */
-    *nbSeq = ZSTD_readLE16(ip); ip+=2;
-    LLtype  = *ip >> 6;
-    Offtype = (*ip >> 4) & 3;
-    MLtype  = (*ip >> 2) & 3;
-    if (*ip & 2)
-    {
-        dumpsLength  = ip[2];
-        dumpsLength += ip[1] << 8;
-        ip += 3;
-    }
-    else
-    {
-        dumpsLength  = ip[1];
-        dumpsLength += (ip[0] & 1) << 8;
-        ip += 2;
-    }
-    *dumpsPtr = ip;
-    ip += dumpsLength;
-    *dumpsLengthPtr = dumpsLength;
-
-    /* check */
-    if (ip > iend-3) return ERROR(srcSize_wrong); /* min : all 3 are "raw", hence no header, but at least xxLog bits per type */
-
-    /* sequences */
-    {
-        S16 norm[MaxML+1];    /* assumption : MaxML >= MaxLL and MaxOff */
-        size_t headerSize;
-
-        /* Build DTables */
-        switch(LLtype)
-        {
-        case bt_rle :
-            LLlog = 0;
-            FSE_buildDTable_rle(DTableLL, *ip++); break;
-        case bt_raw :
-            LLlog = LLbits;
-            FSE_buildDTable_raw(DTableLL, LLbits); break;
-        default :
-            {   U32 max = MaxLL;
-                headerSize = FSE_readNCount(norm, &max, &LLlog, ip, iend-ip);
-                if (FSE_isError(headerSize)) return ERROR(GENERIC);
-                if (LLlog > LLFSELog) return ERROR(corruption_detected);
-                ip += headerSize;
-                FSE_buildDTable(DTableLL, norm, max, LLlog);
-        }   }
-
-        switch(Offtype)
-        {
-        case bt_rle :
-            Offlog = 0;
-            if (ip > iend-2) return ERROR(srcSize_wrong); /* min : "raw", hence no header, but at least xxLog bits */
-            FSE_buildDTable_rle(DTableOffb, *ip++); break;
-        case bt_raw :
-            Offlog = Offbits;
-            FSE_buildDTable_raw(DTableOffb, Offbits); break;
-        default :
-            {   U32 max = MaxOff;
-                headerSize = FSE_readNCount(norm, &max, &Offlog, ip, iend-ip);
-                if (FSE_isError(headerSize)) return ERROR(GENERIC);
-                if (Offlog > OffFSELog) return ERROR(corruption_detected);
-                ip += headerSize;
-                FSE_buildDTable(DTableOffb, norm, max, Offlog);
-        }   }
-
-        switch(MLtype)
-        {
-        case bt_rle :
-            MLlog = 0;
-            if (ip > iend-2) return ERROR(srcSize_wrong); /* min : "raw", hence no header, but at least xxLog bits */
-            FSE_buildDTable_rle(DTableML, *ip++); break;
-        case bt_raw :
-            MLlog = MLbits;
-            FSE_buildDTable_raw(DTableML, MLbits); break;
-        default :
-            {   U32 max = MaxML;
-                headerSize = FSE_readNCount(norm, &max, &MLlog, ip, iend-ip);
-                if (FSE_isError(headerSize)) return ERROR(GENERIC);
-                if (MLlog > MLFSELog) return ERROR(corruption_detected);
-                ip += headerSize;
-                FSE_buildDTable(DTableML, norm, max, MLlog);
-    }   }   }
-
-    return ip-istart;
-}
-
-
-typedef struct {
-    size_t litLength;
-    size_t offset;
-    size_t matchLength;
-} seq_t;
-
-typedef struct {
-    FSE_DStream_t DStream;
-    FSE_DState_t stateLL;
-    FSE_DState_t stateOffb;
-    FSE_DState_t stateML;
-    size_t prevOffset;
-    const BYTE* dumps;
-    const BYTE* dumpsEnd;
-} seqState_t;
-
-
-static void ZSTD_decodeSequence(seq_t* seq, seqState_t* seqState)
-{
-    size_t litLength;
-    size_t prevOffset;
-    size_t offset;
-    size_t matchLength;
-    const BYTE* dumps = seqState->dumps;
-    const BYTE* const de = seqState->dumpsEnd;
-
-    /* Literal length */
-    litLength = FSE_decodeSymbol(&(seqState->stateLL), &(seqState->DStream));
-    prevOffset = litLength ? seq->offset : seqState->prevOffset;
-    seqState->prevOffset = seq->offset;
-    if (litLength == MaxLL)
-    {
-        U32 add = dumps 1 byte */
-                dumps += 3;
-            }
-        }
-    }
-
-    /* Offset */
-    {
-        U32 offsetCode, nbBits;
-        offsetCode = FSE_decodeSymbol(&(seqState->stateOffb), &(seqState->DStream));
-        if (ZSTD_32bits()) FSE_reloadDStream(&(seqState->DStream));
-        nbBits = offsetCode - 1;
-        if (offsetCode==0) nbBits = 0;   /* cmove */
-        offset = ((size_t)1 << (nbBits & ((sizeof(offset)*8)-1))) + FSE_readBits(&(seqState->DStream), nbBits);
-        if (ZSTD_32bits()) FSE_reloadDStream(&(seqState->DStream));
-        if (offsetCode==0) offset = prevOffset;
-    }
-
-    /* MatchLength */
-    matchLength = FSE_decodeSymbol(&(seqState->stateML), &(seqState->DStream));
-    if (matchLength == MaxML)
-    {
-        U32 add = dumps 1 byte */
-                dumps += 3;
-            }
-        }
-    }
-    matchLength += MINMATCH;
-
-    /* save result */
-    seq->litLength = litLength;
-    seq->offset = offset;
-    seq->matchLength = matchLength;
-    seqState->dumps = dumps;
-}
-
-
-static size_t ZSTD_execSequence(BYTE* op,
-                                seq_t sequence,
-                                const BYTE** litPtr, const BYTE* const litLimit,
-                                BYTE* const base, BYTE* const oend)
-{
-    static const int dec32table[] = {0, 1, 2, 1, 4, 4, 4, 4};   /* added */
-    static const int dec64table[] = {8, 8, 8, 7, 8, 9,10,11};   /* substracted */
-    const BYTE* const ostart = op;
-    const size_t litLength = sequence.litLength;
-    BYTE* const endMatch = op + litLength + sequence.matchLength;    /* risk : address space overflow (32-bits) */
-    const BYTE* const litEnd = *litPtr + litLength;
-
-    /* check */
-    if (endMatch > oend) return ERROR(dstSize_tooSmall);   /* overwrite beyond dst buffer */
-    if (litEnd > litLimit) return ERROR(corruption_detected);
-    if (sequence.matchLength > (size_t)(*litPtr-op))  return ERROR(dstSize_tooSmall);    /* overwrite literal segment */
-
-    /* copy Literals */
-    if (((size_t)(*litPtr - op) < 8) || ((size_t)(oend-litEnd) < 8) || (op+litLength > oend-8))
-        memmove(op, *litPtr, litLength);   /* overwrite risk */
-    else
-        ZSTD_wildcopy(op, *litPtr, litLength);
-    op += litLength;
-    *litPtr = litEnd;   /* update for next sequence */
-
-    /* check : last match must be at a minimum distance of 8 from end of dest buffer */
-    if (oend-op < 8) return ERROR(dstSize_tooSmall);
-
-    /* copy Match */
-    {
-        const U32 overlapRisk = (((size_t)(litEnd - endMatch)) < 12);
-        const BYTE* match = op - sequence.offset;            /* possible underflow at op - offset ? */
-        size_t qutt = 12;
-        U64 saved[2];
-
-        /* check */
-        if (match < base) return ERROR(corruption_detected);
-        if (sequence.offset > (size_t)base) return ERROR(corruption_detected);
-
-        /* save beginning of literal sequence, in case of write overlap */
-        if (overlapRisk)
-        {
-            if ((endMatch + qutt) > oend) qutt = oend-endMatch;
-            memcpy(saved, endMatch, qutt);
-        }
-
-        if (sequence.offset < 8)
-        {
-            const int dec64 = dec64table[sequence.offset];
-            op[0] = match[0];
-            op[1] = match[1];
-            op[2] = match[2];
-            op[3] = match[3];
-            match += dec32table[sequence.offset];
-            ZSTD_copy4(op+4, match);
-            match -= dec64;
-        } else { ZSTD_copy8(op, match); }
-        op += 8; match += 8;
-
-        if (endMatch > oend-(16-MINMATCH))
-        {
-            if (op < oend-8)
-            {
-                ZSTD_wildcopy(op, match, (oend-8) - op);
-                match += (oend-8) - op;
-                op = oend-8;
-            }
-            while (opLLTable;
-    U32* DTableML = dctx->MLTable;
-    U32* DTableOffb = dctx->OffTable;
-    BYTE* const base = (BYTE*) (dctx->base);
-
-    /* Build Decoding Tables */
-    errorCode = ZSTDv01_decodeSeqHeaders(&nbSeq, &dumps, &dumpsLength,
-                                      DTableLL, DTableML, DTableOffb,
-                                      ip, iend-ip);
-    if (ZSTDv01_isError(errorCode)) return errorCode;
-    ip += errorCode;
-
-    /* Regen sequences */
-    {
-        seq_t sequence;
-        seqState_t seqState;
-
-        memset(&sequence, 0, sizeof(sequence));
-        seqState.dumps = dumps;
-        seqState.dumpsEnd = dumps + dumpsLength;
-        seqState.prevOffset = 1;
-        errorCode = FSE_initDStream(&(seqState.DStream), ip, iend-ip);
-        if (FSE_isError(errorCode)) return ERROR(corruption_detected);
-        FSE_initDState(&(seqState.stateLL), &(seqState.DStream), DTableLL);
-        FSE_initDState(&(seqState.stateOffb), &(seqState.DStream), DTableOffb);
-        FSE_initDState(&(seqState.stateML), &(seqState.DStream), DTableML);
-
-        for ( ; (FSE_reloadDStream(&(seqState.DStream)) <= FSE_DStream_completed) && (nbSeq>0) ; )
-        {
-            size_t oneSeqSize;
-            nbSeq--;
-            ZSTD_decodeSequence(&sequence, &seqState);
-            oneSeqSize = ZSTD_execSequence(op, sequence, &litPtr, litEnd, base, oend);
-            if (ZSTDv01_isError(oneSeqSize)) return oneSeqSize;
-            op += oneSeqSize;
-        }
-
-        /* check if reached exact end */
-        if ( !FSE_endOfDStream(&(seqState.DStream)) ) return ERROR(corruption_detected);   /* requested too much : data is corrupted */
-        if (nbSeq<0) return ERROR(corruption_detected);   /* requested too many sequences : data is corrupted */
-
-        /* last literal segment */
-        {
-            size_t lastLLSize = litEnd - litPtr;
-            if (op+lastLLSize > oend) return ERROR(dstSize_tooSmall);
-            if (op != litPtr) memmove(op, litPtr, lastLLSize);
-            op += lastLLSize;
-        }
-    }
-
-    return op-ostart;
-}
-
-
-static size_t ZSTD_decompressBlock(
-                            void* ctx,
-                            void* dst, size_t maxDstSize,
-                      const void* src, size_t srcSize)
-{
-    /* blockType == blockCompressed, srcSize is trusted */
-    const BYTE* ip = (const BYTE*)src;
-    const BYTE* litPtr = NULL;
-    size_t litSize = 0;
-    size_t errorCode;
-
-    /* Decode literals sub-block */
-    errorCode = ZSTDv01_decodeLiteralsBlock(ctx, dst, maxDstSize, &litPtr, &litSize, src, srcSize);
-    if (ZSTDv01_isError(errorCode)) return errorCode;
-    ip += errorCode;
-    srcSize -= errorCode;
-
-    return ZSTD_decompressSequences(ctx, dst, maxDstSize, ip, srcSize, litPtr, litSize);
-}
-
-
-size_t ZSTDv01_decompressDCtx(void* ctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)
-{
-    const BYTE* ip = (const BYTE*)src;
-    const BYTE* iend = ip + srcSize;
-    BYTE* const ostart = (BYTE* const)dst;
-    BYTE* op = ostart;
-    BYTE* const oend = ostart + maxDstSize;
-    size_t remainingSize = srcSize;
-    U32 magicNumber;
-    size_t errorCode=0;
-    blockProperties_t blockProperties;
-
-    /* Frame Header */
-    if (srcSize < ZSTD_frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
-    magicNumber = ZSTD_readBE32(src);
-    if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);
-    ip += ZSTD_frameHeaderSize; remainingSize -= ZSTD_frameHeaderSize;
-
-    /* Loop on each block */
-    while (1)
-    {
-        size_t blockSize = ZSTDv01_getcBlockSize(ip, iend-ip, &blockProperties);
-        if (ZSTDv01_isError(blockSize)) return blockSize;
-
-        ip += ZSTD_blockHeaderSize;
-        remainingSize -= ZSTD_blockHeaderSize;
-        if (blockSize > remainingSize) return ERROR(srcSize_wrong);
-
-        switch(blockProperties.blockType)
-        {
-        case bt_compressed:
-            errorCode = ZSTD_decompressBlock(ctx, op, oend-op, ip, blockSize);
-            break;
-        case bt_raw :
-            errorCode = ZSTD_copyUncompressedBlock(op, oend-op, ip, blockSize);
-            break;
-        case bt_rle :
-            return ERROR(GENERIC);   /* not yet supported */
-            break;
-        case bt_end :
-            /* end of frame */
-            if (remainingSize) return ERROR(srcSize_wrong);
-            break;
-        default:
-            return ERROR(GENERIC);
-        }
-        if (blockSize == 0) break;   /* bt_end */
-
-        if (ZSTDv01_isError(errorCode)) return errorCode;
-        op += errorCode;
-        ip += blockSize;
-        remainingSize -= blockSize;
-    }
-
-    return op-ostart;
-}
-
-size_t ZSTDv01_decompress(void* dst, size_t maxDstSize, const void* src, size_t srcSize)
-{
-    dctx_t ctx;
-    ctx.base = dst;
-    return ZSTDv01_decompressDCtx(&ctx, dst, maxDstSize, src, srcSize);
-}
-
-size_t ZSTDv01_findFrameCompressedSize(const void* src, size_t srcSize)
-{
-    const BYTE* ip = (const BYTE*)src;
-    size_t remainingSize = srcSize;
-    U32 magicNumber;
-    blockProperties_t blockProperties;
-
-    /* Frame Header */
-    if (srcSize < ZSTD_frameHeaderSize+ZSTD_blockHeaderSize) return ERROR(srcSize_wrong);
-    magicNumber = ZSTD_readBE32(src);
-    if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);
-    ip += ZSTD_frameHeaderSize; remainingSize -= ZSTD_frameHeaderSize;
-
-    /* Loop on each block */
-    while (1)
-    {
-        size_t blockSize = ZSTDv01_getcBlockSize(ip, remainingSize, &blockProperties);
-        if (ZSTDv01_isError(blockSize)) return blockSize;
-
-        ip += ZSTD_blockHeaderSize;
-        remainingSize -= ZSTD_blockHeaderSize;
-        if (blockSize > remainingSize) return ERROR(srcSize_wrong);
-
-        if (blockSize == 0) break;   /* bt_end */
-
-        ip += blockSize;
-        remainingSize -= blockSize;
-    }
-
-    return ip - (const BYTE*)src;
-}
-
-/*******************************
-*  Streaming Decompression API
-*******************************/
-
-size_t ZSTDv01_resetDCtx(ZSTDv01_Dctx* dctx)
-{
-    dctx->expected = ZSTD_frameHeaderSize;
-    dctx->phase = 0;
-    dctx->previousDstEnd = NULL;
-    dctx->base = NULL;
-    return 0;
-}
-
-ZSTDv01_Dctx* ZSTDv01_createDCtx(void)
-{
-    ZSTDv01_Dctx* dctx = (ZSTDv01_Dctx*)malloc(sizeof(ZSTDv01_Dctx));
-    if (dctx==NULL) return NULL;
-    ZSTDv01_resetDCtx(dctx);
-    return dctx;
-}
-
-size_t ZSTDv01_freeDCtx(ZSTDv01_Dctx* dctx)
-{
-    free(dctx);
-    return 0;
-}
-
-size_t ZSTDv01_nextSrcSizeToDecompress(ZSTDv01_Dctx* dctx)
-{
-    return ((dctx_t*)dctx)->expected;
-}
-
-size_t ZSTDv01_decompressContinue(ZSTDv01_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize)
-{
-    dctx_t* ctx = (dctx_t*)dctx;
-
-    /* Sanity check */
-    if (srcSize != ctx->expected) return ERROR(srcSize_wrong);
-    if (dst != ctx->previousDstEnd)  /* not contiguous */
-        ctx->base = dst;
-
-    /* Decompress : frame header */
-    if (ctx->phase == 0)
-    {
-        /* Check frame magic header */
-        U32 magicNumber = ZSTD_readBE32(src);
-        if (magicNumber != ZSTD_magicNumber) return ERROR(prefix_unknown);
-        ctx->phase = 1;
-        ctx->expected = ZSTD_blockHeaderSize;
-        return 0;
-    }
-
-    /* Decompress : block header */
-    if (ctx->phase == 1)
-    {
-        blockProperties_t bp;
-        size_t blockSize = ZSTDv01_getcBlockSize(src, ZSTD_blockHeaderSize, &bp);
-        if (ZSTDv01_isError(blockSize)) return blockSize;
-        if (bp.blockType == bt_end)
-        {
-            ctx->expected = 0;
-            ctx->phase = 0;
-        }
-        else
-        {
-            ctx->expected = blockSize;
-            ctx->bType = bp.blockType;
-            ctx->phase = 2;
-        }
-
-        return 0;
-    }
-
-    /* Decompress : block content */
-    {
-        size_t rSize;
-        switch(ctx->bType)
-        {
-        case bt_compressed:
-            rSize = ZSTD_decompressBlock(ctx, dst, maxDstSize, src, srcSize);
-            break;
-        case bt_raw :
-            rSize = ZSTD_copyUncompressedBlock(dst, maxDstSize, src, srcSize);
-            break;
-        case bt_rle :
-            return ERROR(GENERIC);   /* not yet handled */
-            break;
-        case bt_end :   /* should never happen (filtered at phase 1) */
-            rSize = 0;
-            break;
-        default:
-            return ERROR(GENERIC);
-        }
-        ctx->phase = 1;
-        ctx->expected = ZSTD_blockHeaderSize;
-        ctx->previousDstEnd = (void*)( ((char*)dst) + rSize);
-        return rSize;
-    }
-
-}
diff --git a/priv/zstd/lib/legacy/zstd_v01.h b/priv/zstd/lib/legacy/zstd_v01.h
deleted file mode 100644
index 42f0897..0000000
--- a/priv/zstd/lib/legacy/zstd_v01.h
+++ /dev/null
@@ -1,89 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-#ifndef ZSTD_V01_H_28739879432
-#define ZSTD_V01_H_28739879432
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/* *************************************
-*  Includes
-***************************************/
-#include    /* size_t */
-
-
-/* *************************************
-*  Simple one-step function
-***************************************/
-/**
-ZSTDv01_decompress() : decompress ZSTD frames compliant with v0.1.x format
-    compressedSize : is the exact source size
-    maxOriginalSize : is the size of the 'dst' buffer, which must be already allocated.
-                      It must be equal or larger than originalSize, otherwise decompression will fail.
-    return : the number of bytes decompressed into destination buffer (originalSize)
-             or an errorCode if it fails (which can be tested using ZSTDv01_isError())
-*/
-size_t ZSTDv01_decompress( void* dst, size_t maxOriginalSize,
-                     const void* src, size_t compressedSize);
-
-/**
-ZSTDv01_getFrameSrcSize() : get the source length of a ZSTD frame compliant with v0.1.x format
-    compressedSize : The size of the 'src' buffer, at least as large as the frame pointed to by 'src'
-    return : the number of bytes that would be read to decompress this frame
-             or an errorCode if it fails (which can be tested using ZSTDv01_isError())
-*/
-size_t ZSTDv01_findFrameCompressedSize(const void* src, size_t compressedSize);
-
-/**
-ZSTDv01_isError() : tells if the result of ZSTDv01_decompress() is an error
-*/
-unsigned ZSTDv01_isError(size_t code);
-
-
-/* *************************************
-*  Advanced functions
-***************************************/
-typedef struct ZSTDv01_Dctx_s ZSTDv01_Dctx;
-ZSTDv01_Dctx* ZSTDv01_createDCtx(void);
-size_t ZSTDv01_freeDCtx(ZSTDv01_Dctx* dctx);
-
-size_t ZSTDv01_decompressDCtx(void* ctx,
-                              void* dst, size_t maxOriginalSize,
-                        const void* src, size_t compressedSize);
-
-/* *************************************
-*  Streaming functions
-***************************************/
-size_t ZSTDv01_resetDCtx(ZSTDv01_Dctx* dctx);
-
-size_t ZSTDv01_nextSrcSizeToDecompress(ZSTDv01_Dctx* dctx);
-size_t ZSTDv01_decompressContinue(ZSTDv01_Dctx* dctx, void* dst, size_t maxDstSize, const void* src, size_t srcSize);
-/**
-  Use above functions alternatively.
-  ZSTD_nextSrcSizeToDecompress() tells how much bytes to provide as 'srcSize' to ZSTD_decompressContinue().
-  ZSTD_decompressContinue() will use previous data blocks to improve compression if they are located prior to current block.
-  Result is the number of bytes regenerated within 'dst'.
-  It can be zero, which is not an error; it just means ZSTD_decompressContinue() has decoded some header.
-*/
-
-/* *************************************
-*  Prefix - version detection
-***************************************/
-#define ZSTDv01_magicNumber   0xFD2FB51E   /* Big Endian version */
-#define ZSTDv01_magicNumberLE 0x1EB52FFD   /* Little Endian version */
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ZSTD_V01_H_28739879432 */
diff --git a/priv/zstd/lib/legacy/zstd_v02.c b/priv/zstd/lib/legacy/zstd_v02.c
deleted file mode 100644
index 8bc0ece..0000000
--- a/priv/zstd/lib/legacy/zstd_v02.c
+++ /dev/null
@@ -1,3483 +0,0 @@
-/*
- * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- * You may select, at your option, one of the above-listed licenses.
- */
-
-
-#include     /* size_t, ptrdiff_t */
-#include "zstd_v02.h"
-#include "error_private.h"
-
-
-/******************************************
-*  Compiler-specific
-******************************************/
-#if defined(_MSC_VER)   /* Visual Studio */
-#   include   /* _byteswap_ulong */
-#   include   /* _byteswap_* */
-#endif
-
-
-/* ******************************************************************
-   mem.h
-   low-level memory access routines
-   Copyright (C) 2013-2015, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-#ifndef MEM_H_MODULE
-#define MEM_H_MODULE
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/******************************************
-*  Includes
-******************************************/
-#include     /* size_t, ptrdiff_t */
-#include     /* memcpy */
-
-
-/******************************************
-*  Compiler-specific
-******************************************/
-#if defined(__GNUC__)
-#  define MEM_STATIC static __attribute__((unused))
-#elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#  define MEM_STATIC static inline
-#elif defined(_MSC_VER)
-#  define MEM_STATIC static __inline
-#else
-#  define MEM_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
-#endif
-
-
-/****************************************************************
-*  Basic Types
-*****************************************************************/
-#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-# include 
-  typedef  uint8_t BYTE;
-  typedef uint16_t U16;
-  typedef  int16_t S16;
-  typedef uint32_t U32;
-  typedef  int32_t S32;
-  typedef uint64_t U64;
-  typedef  int64_t S64;
-#else
-  typedef unsigned char       BYTE;
-  typedef unsigned short      U16;
-  typedef   signed short      S16;
-  typedef unsigned int        U32;
-  typedef   signed int        S32;
-  typedef unsigned long long  U64;
-  typedef   signed long long  S64;
-#endif
-
-
-/****************************************************************
-*  Memory I/O
-*****************************************************************/
-/* MEM_FORCE_MEMORY_ACCESS
- * By default, access to unaligned memory is controlled by `memcpy()`, which is safe and portable.
- * Unfortunately, on some target/compiler combinations, the generated assembly is sub-optimal.
- * The below switch allow to select different access method for improved performance.
- * Method 0 (default) : use `memcpy()`. Safe and portable.
- * Method 1 : `__packed` statement. It depends on compiler extension (ie, not portable).
- *            This method is safe if your compiler supports it, and *generally* as fast or faster than `memcpy`.
- * Method 2 : direct access. This method is portable but violate C standard.
- *            It can generate buggy code on targets generating assembly depending on alignment.
- *            But in some circumstances, it's the only known way to get the most performance (ie GCC + ARMv6)
- * See http://fastcompression.blogspot.fr/2015/08/accessing-unaligned-memory.html for details.
- * Prefer these methods in priority order (0 > 1 > 2)
- */
-#ifndef MEM_FORCE_MEMORY_ACCESS   /* can be defined externally, on command line for example */
-#  if defined(__GNUC__) && ( defined(__ARM_ARCH_6__) || defined(__ARM_ARCH_6J__) || defined(__ARM_ARCH_6K__) || defined(__ARM_ARCH_6Z__) || defined(__ARM_ARCH_6ZK__) || defined(__ARM_ARCH_6T2__) )
-#    define MEM_FORCE_MEMORY_ACCESS 2
-#  elif (defined(__INTEL_COMPILER) && !defined(WIN32)) || \
-  (defined(__GNUC__) && ( defined(__ARM_ARCH_7__) || defined(__ARM_ARCH_7A__) || defined(__ARM_ARCH_7R__) || defined(__ARM_ARCH_7M__) || defined(__ARM_ARCH_7S__) ))
-#    define MEM_FORCE_MEMORY_ACCESS 1
-#  endif
-#endif
-
-MEM_STATIC unsigned MEM_32bits(void) { return sizeof(void*)==4; }
-MEM_STATIC unsigned MEM_64bits(void) { return sizeof(void*)==8; }
-
-MEM_STATIC unsigned MEM_isLittleEndian(void)
-{
-    const union { U32 u; BYTE c[4]; } one = { 1 };   /* don't use static : performance detrimental  */
-    return one.c[0];
-}
-
-#if defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==2)
-
-/* violates C standard on structure alignment.
-Only use if no other choice to achieve best performance on target platform */
-MEM_STATIC U16 MEM_read16(const void* memPtr) { return *(const U16*) memPtr; }
-MEM_STATIC U32 MEM_read32(const void* memPtr) { return *(const U32*) memPtr; }
-MEM_STATIC U64 MEM_read64(const void* memPtr) { return *(const U64*) memPtr; }
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value) { *(U16*)memPtr = value; }
-
-#elif defined(MEM_FORCE_MEMORY_ACCESS) && (MEM_FORCE_MEMORY_ACCESS==1)
-
-/* __pack instructions are safer, but compiler specific, hence potentially problematic for some compilers */
-/* currently only defined for gcc and icc */
-typedef union { U16 u16; U32 u32; U64 u64; } __attribute__((packed)) unalign;
-
-MEM_STATIC U16 MEM_read16(const void* ptr) { return ((const unalign*)ptr)->u16; }
-MEM_STATIC U32 MEM_read32(const void* ptr) { return ((const unalign*)ptr)->u32; }
-MEM_STATIC U64 MEM_read64(const void* ptr) { return ((const unalign*)ptr)->u64; }
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value) { ((unalign*)memPtr)->u16 = value; }
-
-#else
-
-/* default method, safe and standard.
-   can sometimes prove slower */
-
-MEM_STATIC U16 MEM_read16(const void* memPtr)
-{
-    U16 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC U32 MEM_read32(const void* memPtr)
-{
-    U32 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC U64 MEM_read64(const void* memPtr)
-{
-    U64 val; memcpy(&val, memPtr, sizeof(val)); return val;
-}
-
-MEM_STATIC void MEM_write16(void* memPtr, U16 value)
-{
-    memcpy(memPtr, &value, sizeof(value));
-}
-
-#endif // MEM_FORCE_MEMORY_ACCESS
-
-
-MEM_STATIC U16 MEM_readLE16(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_read16(memPtr);
-    else
-    {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U16)(p[0] + (p[1]<<8));
-    }
-}
-
-MEM_STATIC void MEM_writeLE16(void* memPtr, U16 val)
-{
-    if (MEM_isLittleEndian())
-    {
-        MEM_write16(memPtr, val);
-    }
-    else
-    {
-        BYTE* p = (BYTE*)memPtr;
-        p[0] = (BYTE)val;
-        p[1] = (BYTE)(val>>8);
-    }
-}
-
-MEM_STATIC U32 MEM_readLE32(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_read32(memPtr);
-    else
-    {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U32)((U32)p[0] + ((U32)p[1]<<8) + ((U32)p[2]<<16) + ((U32)p[3]<<24));
-    }
-}
-
-
-MEM_STATIC U64 MEM_readLE64(const void* memPtr)
-{
-    if (MEM_isLittleEndian())
-        return MEM_read64(memPtr);
-    else
-    {
-        const BYTE* p = (const BYTE*)memPtr;
-        return (U64)((U64)p[0] + ((U64)p[1]<<8) + ((U64)p[2]<<16) + ((U64)p[3]<<24)
-                     + ((U64)p[4]<<32) + ((U64)p[5]<<40) + ((U64)p[6]<<48) + ((U64)p[7]<<56));
-    }
-}
-
-
-MEM_STATIC size_t MEM_readLEST(const void* memPtr)
-{
-    if (MEM_32bits())
-        return (size_t)MEM_readLE32(memPtr);
-    else
-        return (size_t)MEM_readLE64(memPtr);
-}
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* MEM_H_MODULE */
-
-
-/* ******************************************************************
-   bitstream
-   Part of NewGen Entropy library
-   header file (to include)
-   Copyright (C) 2013-2015, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-   - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-#ifndef BITSTREAM_H_MODULE
-#define BITSTREAM_H_MODULE
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-/*
-*  This API consists of small unitary functions, which highly benefit from being inlined.
-*  Since link-time-optimization is not available for all compilers,
-*  these functions are defined into a .h to be included.
-*/
-
-
-/**********************************************
-*  bitStream decompression API (read backward)
-**********************************************/
-typedef struct
-{
-    size_t   bitContainer;
-    unsigned bitsConsumed;
-    const char* ptr;
-    const char* start;
-} BIT_DStream_t;
-
-typedef enum { BIT_DStream_unfinished = 0,
-               BIT_DStream_endOfBuffer = 1,
-               BIT_DStream_completed = 2,
-               BIT_DStream_overflow = 3 } BIT_DStream_status;  /* result of BIT_reloadDStream() */
-               /* 1,2,4,8 would be better for bitmap combinations, but slows down performance a bit ... :( */
-
-MEM_STATIC size_t   BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize);
-MEM_STATIC size_t   BIT_readBits(BIT_DStream_t* bitD, unsigned nbBits);
-MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD);
-MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* bitD);
-
-
-/******************************************
-*  unsafe API
-******************************************/
-MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, unsigned nbBits);
-/* faster, but works only if nbBits >= 1 */
-
-
-
-/****************************************************************
-*  Helper functions
-****************************************************************/
-MEM_STATIC unsigned BIT_highbit32 (U32 val)
-{
-#   if defined(_MSC_VER)   /* Visual */
-    unsigned long r=0;
-    _BitScanReverse ( &r, val );
-    return (unsigned) r;
-#   elif defined(__GNUC__) && (__GNUC__ >= 3)   /* Use GCC Intrinsic */
-    return 31 - __builtin_clz (val);
-#   else   /* Software version */
-    static const unsigned DeBruijnClz[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 };
-    U32 v = val;
-    unsigned r;
-    v |= v >> 1;
-    v |= v >> 2;
-    v |= v >> 4;
-    v |= v >> 8;
-    v |= v >> 16;
-    r = DeBruijnClz[ (U32) (v * 0x07C4ACDDU) >> 27];
-    return r;
-#   endif
-}
-
-
-
-/**********************************************************
-* bitStream decoding
-**********************************************************/
-
-/*!BIT_initDStream
-*  Initialize a BIT_DStream_t.
-*  @bitD : a pointer to an already allocated BIT_DStream_t structure
-*  @srcBuffer must point at the beginning of a bitStream
-*  @srcSize must be the exact size of the bitStream
-*  @result : size of stream (== srcSize) or an errorCode if a problem is detected
-*/
-MEM_STATIC size_t BIT_initDStream(BIT_DStream_t* bitD, const void* srcBuffer, size_t srcSize)
-{
-    if (srcSize < 1) { memset(bitD, 0, sizeof(*bitD)); return ERROR(srcSize_wrong); }
-
-    if (srcSize >=  sizeof(size_t))   /* normal case */
-    {
-        U32 contain32;
-        bitD->start = (const char*)srcBuffer;
-        bitD->ptr   = (const char*)srcBuffer + srcSize - sizeof(size_t);
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);
-        contain32 = ((const BYTE*)srcBuffer)[srcSize-1];
-        if (contain32 == 0) return ERROR(GENERIC);   /* endMark not present */
-        bitD->bitsConsumed = 8 - BIT_highbit32(contain32);
-    }
-    else
-    {
-        U32 contain32;
-        bitD->start = (const char*)srcBuffer;
-        bitD->ptr   = bitD->start;
-        bitD->bitContainer = *(const BYTE*)(bitD->start);
-        switch(srcSize)
-        {
-            case 7: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[6]) << (sizeof(size_t)*8 - 16);
-            case 6: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[5]) << (sizeof(size_t)*8 - 24);
-            case 5: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[4]) << (sizeof(size_t)*8 - 32);
-            case 4: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[3]) << 24;
-            case 3: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[2]) << 16;
-            case 2: bitD->bitContainer += (size_t)(((const BYTE*)(bitD->start))[1]) <<  8;
-            default:;
-        }
-        contain32 = ((const BYTE*)srcBuffer)[srcSize-1];
-        if (contain32 == 0) return ERROR(GENERIC);   /* endMark not present */
-        bitD->bitsConsumed = 8 - BIT_highbit32(contain32);
-        bitD->bitsConsumed += (U32)(sizeof(size_t) - srcSize)*8;
-    }
-
-    return srcSize;
-}
-
-MEM_STATIC size_t BIT_lookBits(BIT_DStream_t* bitD, U32 nbBits)
-{
-    const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return ((bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> 1) >> ((bitMask-nbBits) & bitMask);
-}
-
-/*! BIT_lookBitsFast :
-*   unsafe version; only works only if nbBits >= 1 */
-MEM_STATIC size_t BIT_lookBitsFast(BIT_DStream_t* bitD, U32 nbBits)
-{
-    const U32 bitMask = sizeof(bitD->bitContainer)*8 - 1;
-    return (bitD->bitContainer << (bitD->bitsConsumed & bitMask)) >> (((bitMask+1)-nbBits) & bitMask);
-}
-
-MEM_STATIC void BIT_skipBits(BIT_DStream_t* bitD, U32 nbBits)
-{
-    bitD->bitsConsumed += nbBits;
-}
-
-MEM_STATIC size_t BIT_readBits(BIT_DStream_t* bitD, U32 nbBits)
-{
-    size_t value = BIT_lookBits(bitD, nbBits);
-    BIT_skipBits(bitD, nbBits);
-    return value;
-}
-
-/*!BIT_readBitsFast :
-*  unsafe version; only works only if nbBits >= 1 */
-MEM_STATIC size_t BIT_readBitsFast(BIT_DStream_t* bitD, U32 nbBits)
-{
-    size_t value = BIT_lookBitsFast(bitD, nbBits);
-    BIT_skipBits(bitD, nbBits);
-    return value;
-}
-
-MEM_STATIC BIT_DStream_status BIT_reloadDStream(BIT_DStream_t* bitD)
-{
-    if (bitD->bitsConsumed > (sizeof(bitD->bitContainer)*8))  /* should never happen */
-        return BIT_DStream_overflow;
-
-    if (bitD->ptr >= bitD->start + sizeof(bitD->bitContainer))
-    {
-        bitD->ptr -= bitD->bitsConsumed >> 3;
-        bitD->bitsConsumed &= 7;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);
-        return BIT_DStream_unfinished;
-    }
-    if (bitD->ptr == bitD->start)
-    {
-        if (bitD->bitsConsumed < sizeof(bitD->bitContainer)*8) return BIT_DStream_endOfBuffer;
-        return BIT_DStream_completed;
-    }
-    {
-        U32 nbBytes = bitD->bitsConsumed >> 3;
-        BIT_DStream_status result = BIT_DStream_unfinished;
-        if (bitD->ptr - nbBytes < bitD->start)
-        {
-            nbBytes = (U32)(bitD->ptr - bitD->start);  /* ptr > start */
-            result = BIT_DStream_endOfBuffer;
-        }
-        bitD->ptr -= nbBytes;
-        bitD->bitsConsumed -= nbBytes*8;
-        bitD->bitContainer = MEM_readLEST(bitD->ptr);   /* reminder : srcSize > sizeof(bitD) */
-        return result;
-    }
-}
-
-/*! BIT_endOfDStream
-*   @return Tells if DStream has reached its exact end
-*/
-MEM_STATIC unsigned BIT_endOfDStream(const BIT_DStream_t* DStream)
-{
-    return ((DStream->ptr == DStream->start) && (DStream->bitsConsumed == sizeof(DStream->bitContainer)*8));
-}
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* BITSTREAM_H_MODULE */
-/* ******************************************************************
-   Error codes and messages
-   Copyright (C) 2013-2015, Yann Collet
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-   - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-#ifndef ERROR_H_MODULE
-#define ERROR_H_MODULE
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-/******************************************
-*  Compiler-specific
-******************************************/
-#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#  define ERR_STATIC static inline
-#elif defined(_MSC_VER)
-#  define ERR_STATIC static __inline
-#elif defined(__GNUC__)
-#  define ERR_STATIC static __attribute__((unused))
-#else
-#  define ERR_STATIC static  /* this version may generate warnings for unused static functions; disable the relevant warning */
-#endif
-
-
-/******************************************
-*  Error Management
-******************************************/
-#define PREFIX(name) ZSTD_error_##name
-
-#define ERROR(name) (size_t)-PREFIX(name)
-
-#define ERROR_LIST(ITEM) \
-        ITEM(PREFIX(No_Error)) ITEM(PREFIX(GENERIC)) \
-        ITEM(PREFIX(dstSize_tooSmall)) ITEM(PREFIX(srcSize_wrong)) \
-        ITEM(PREFIX(prefix_unknown)) ITEM(PREFIX(corruption_detected)) \
-        ITEM(PREFIX(tableLog_tooLarge)) ITEM(PREFIX(maxSymbolValue_tooLarge)) ITEM(PREFIX(maxSymbolValue_tooSmall)) \
-        ITEM(PREFIX(maxCode))
-
-#define ERROR_GENERATE_ENUM(ENUM) ENUM,
-typedef enum { ERROR_LIST(ERROR_GENERATE_ENUM) } ERR_codes;  /* enum is exposed, to detect & handle specific errors; compare function result to -enum value */
-
-#define ERROR_CONVERTTOSTRING(STRING) #STRING,
-#define ERROR_GENERATE_STRING(EXPR) ERROR_CONVERTTOSTRING(EXPR)
-static const char* ERR_strings[] = { ERROR_LIST(ERROR_GENERATE_STRING) };
-
-ERR_STATIC unsigned ERR_isError(size_t code) { return (code > ERROR(maxCode)); }
-
-ERR_STATIC const char* ERR_getErrorName(size_t code)
-{
-    static const char* codeError = "Unspecified error code";
-    if (ERR_isError(code)) return ERR_strings[-(int)(code)];
-    return codeError;
-}
-
-
-#if defined (__cplusplus)
-}
-#endif
-
-#endif /* ERROR_H_MODULE */
-/*
-Constructor and Destructor of type FSE_CTable
-    Note that its size depends on 'tableLog' and 'maxSymbolValue' */
-typedef unsigned FSE_CTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
-typedef unsigned FSE_DTable;   /* don't allocate that. It's just a way to be more restrictive than void* */
-
-
-/* ******************************************************************
-   FSE : Finite State Entropy coder
-   header file for static linking (only)
-   Copyright (C) 2013-2015, Yann Collet
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-   - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-
-/******************************************
-*  Static allocation
-******************************************/
-/* FSE buffer bounds */
-#define FSE_NCOUNTBOUND 512
-#define FSE_BLOCKBOUND(size) (size + (size>>7))
-#define FSE_COMPRESSBOUND(size) (FSE_NCOUNTBOUND + FSE_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
-
-/* You can statically allocate FSE CTable/DTable as a table of unsigned using below macro */
-#define FSE_CTABLE_SIZE_U32(maxTableLog, maxSymbolValue)   (1 + (1<<(maxTableLog-1)) + ((maxSymbolValue+1)*2))
-#define FSE_DTABLE_SIZE_U32(maxTableLog)                   (1 + (1<= 1 (otherwise, result will be corrupted) */
-
-
-/******************************************
-*  Implementation of inline functions
-******************************************/
-
-/* decompression */
-
-typedef struct {
-    U16 tableLog;
-    U16 fastMode;
-} FSE_DTableHeader;   /* sizeof U32 */
-
-typedef struct
-{
-    unsigned short newState;
-    unsigned char  symbol;
-    unsigned char  nbBits;
-} FSE_decode_t;   /* size == U32 */
-
-MEM_STATIC void FSE_initDState(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD, const FSE_DTable* dt)
-{
-    FSE_DTableHeader DTableH;
-    memcpy(&DTableH, dt, sizeof(DTableH));
-    DStatePtr->state = BIT_readBits(bitD, DTableH.tableLog);
-    BIT_reloadDStream(bitD);
-    DStatePtr->table = dt + 1;
-}
-
-MEM_STATIC BYTE FSE_decodeSymbol(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
-{
-    const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    const U32  nbBits = DInfo.nbBits;
-    BYTE symbol = DInfo.symbol;
-    size_t lowBits = BIT_readBits(bitD, nbBits);
-
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
-}
-
-MEM_STATIC BYTE FSE_decodeSymbolFast(FSE_DState_t* DStatePtr, BIT_DStream_t* bitD)
-{
-    const FSE_decode_t DInfo = ((const FSE_decode_t*)(DStatePtr->table))[DStatePtr->state];
-    const U32 nbBits = DInfo.nbBits;
-    BYTE symbol = DInfo.symbol;
-    size_t lowBits = BIT_readBitsFast(bitD, nbBits);
-
-    DStatePtr->state = DInfo.newState + lowBits;
-    return symbol;
-}
-
-MEM_STATIC unsigned FSE_endOfDState(const FSE_DState_t* DStatePtr)
-{
-    return DStatePtr->state == 0;
-}
-
-
-#if defined (__cplusplus)
-}
-#endif
-/* ******************************************************************
-   Huff0 : Huffman coder, part of New Generation Entropy library
-   header file for static linking (only)
-   Copyright (C) 2013-2015, Yann Collet
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-   You can contact the author at :
-   - Source repository : https://github.com/Cyan4973/FiniteStateEntropy
-   - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/******************************************
-*  Static allocation macros
-******************************************/
-/* Huff0 buffer bounds */
-#define HUF_CTABLEBOUND 129
-#define HUF_BLOCKBOUND(size) (size + (size>>8) + 8)   /* only true if incompressible pre-filtered with fast heuristic */
-#define HUF_COMPRESSBOUND(size) (HUF_CTABLEBOUND + HUF_BLOCKBOUND(size))   /* Macro version, useful for static allocation */
-
-/* static allocation of Huff0's DTable */
-#define HUF_DTABLE_SIZE(maxTableLog)   (1 + (1<   /* size_t */
-
-
-/* *************************************
-*  Version
-***************************************/
-#define ZSTD_VERSION_MAJOR    0    /* for breaking interface changes  */
-#define ZSTD_VERSION_MINOR    2    /* for new (non-breaking) interface capabilities */
-#define ZSTD_VERSION_RELEASE  2    /* for tweaks, bug-fixes, or development */
-#define ZSTD_VERSION_NUMBER  (ZSTD_VERSION_MAJOR *100*100 + ZSTD_VERSION_MINOR *100 + ZSTD_VERSION_RELEASE)
-
-
-/* *************************************
-*  Advanced functions
-***************************************/
-typedef struct ZSTD_CCtx_s ZSTD_CCtx;   /* incomplete type */
-
-#if defined (__cplusplus)
-}
-#endif
-/*
-    zstd - standard compression library
-    Header File for static linking only
-    Copyright (C) 2014-2015, Yann Collet.
-
-    BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-    Redistribution and use in source and binary forms, with or without
-    modification, are permitted provided that the following conditions are
-    met:
-    * Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
-    * Redistributions in binary form must reproduce the above
-    copyright notice, this list of conditions and the following disclaimer
-    in the documentation and/or other materials provided with the
-    distribution.
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-    "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-    OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - zstd source repository : https://github.com/Cyan4973/zstd
-    - ztsd public forum : https://groups.google.com/forum/#!forum/lz4c
-*/
-
-/* The objects defined into this file should be considered experimental.
- * They are not labelled stable, as their prototype may change in the future.
- * You can use them for tests, provide feedback, or if you can endure risk of future changes.
- */
-
-#if defined (__cplusplus)
-extern "C" {
-#endif
-
-/* *************************************
-*  Streaming functions
-***************************************/
-
-typedef struct ZSTD_DCtx_s ZSTD_DCtx;
-
-/*
-  Use above functions alternatively.
-  ZSTD_nextSrcSizeToDecompress() tells how much bytes to provide as 'srcSize' to ZSTD_decompressContinue().
-  ZSTD_decompressContinue() will use previous data blocks to improve compression if they are located prior to current block.
-  Result is the number of bytes regenerated within 'dst'.
-  It can be zero, which is not an error; it just means ZSTD_decompressContinue() has decoded some header.
-*/
-
-/* *************************************
-*  Prefix - version detection
-***************************************/
-#define ZSTD_magicNumber 0xFD2FB522   /* v0.2 (current)*/
-
-
-#if defined (__cplusplus)
-}
-#endif
-/* ******************************************************************
-   FSE : Finite State Entropy coder
-   Copyright (C) 2013-2015, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-#ifndef FSE_COMMONDEFS_ONLY
-
-/****************************************************************
-*  Tuning parameters
-****************************************************************/
-/* MEMORY_USAGE :
-*  Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
-*  Increasing memory usage improves compression ratio
-*  Reduced memory usage can improve speed, due to cache effect
-*  Recommended max value is 14, for 16KB, which nicely fits into Intel x86 L1 cache */
-#define FSE_MAX_MEMORY_USAGE 14
-#define FSE_DEFAULT_MEMORY_USAGE 13
-
-/* FSE_MAX_SYMBOL_VALUE :
-*  Maximum symbol value authorized.
-*  Required for proper stack allocation */
-#define FSE_MAX_SYMBOL_VALUE 255
-
-
-/****************************************************************
-*  template functions type & suffix
-****************************************************************/
-#define FSE_FUNCTION_TYPE BYTE
-#define FSE_FUNCTION_EXTENSION
-
-
-/****************************************************************
-*  Byte symbol type
-****************************************************************/
-#endif   /* !FSE_COMMONDEFS_ONLY */
-
-
-/****************************************************************
-*  Compiler specifics
-****************************************************************/
-#ifdef _MSC_VER    /* Visual Studio */
-#  define FORCE_INLINE static __forceinline
-#  include                     /* For Visual 2005 */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#  pragma warning(disable : 4214)        /* disable: C4214: non-int bitfields */
-#else
-#  if defined (__cplusplus) || defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L   /* C99 */
-#    ifdef __GNUC__
-#      define FORCE_INLINE static inline __attribute__((always_inline))
-#    else
-#      define FORCE_INLINE static inline
-#    endif
-#  else
-#    define FORCE_INLINE static
-#  endif /* __STDC_VERSION__ */
-#endif
-
-
-/****************************************************************
-*  Includes
-****************************************************************/
-#include      /* malloc, free, qsort */
-#include      /* memcpy, memset */
-#include       /* printf (debug) */
-
-/****************************************************************
-*  Constants
-*****************************************************************/
-#define FSE_MAX_TABLELOG  (FSE_MAX_MEMORY_USAGE-2)
-#define FSE_MAX_TABLESIZE (1U< FSE_TABLELOG_ABSOLUTE_MAX
-#error "FSE_MAX_TABLELOG > FSE_TABLELOG_ABSOLUTE_MAX is not supported"
-#endif
-
-
-/****************************************************************
-*  Error Management
-****************************************************************/
-#define FSE_STATIC_ASSERT(c) { enum { FSE_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-
-
-/****************************************************************
-*  Complex types
-****************************************************************/
-typedef U32 DTable_max_t[FSE_DTABLE_SIZE_U32(FSE_MAX_TABLELOG)];
-
-
-/****************************************************************
-*  Templates
-****************************************************************/
-/*
-  designed to be included
-  for type-specific functions (template emulation in C)
-  Objective is to write these functions only once, for improved maintenance
-*/
-
-/* safety checks */
-#ifndef FSE_FUNCTION_EXTENSION
-#  error "FSE_FUNCTION_EXTENSION must be defined"
-#endif
-#ifndef FSE_FUNCTION_TYPE
-#  error "FSE_FUNCTION_TYPE must be defined"
-#endif
-
-/* Function names */
-#define FSE_CAT(X,Y) X##Y
-#define FSE_FUNCTION_NAME(X,Y) FSE_CAT(X,Y)
-#define FSE_TYPE_NAME(X,Y) FSE_CAT(X,Y)
-
-
-/* Function templates */
-
-#define FSE_DECODE_TYPE FSE_decode_t
-
-static U32 FSE_tableStep(U32 tableSize) { return (tableSize>>1) + (tableSize>>3) + 3; }
-
-static size_t FSE_buildDTable
-(FSE_DTable* dt, const short* normalizedCounter, unsigned maxSymbolValue, unsigned tableLog)
-{
-    void* ptr = dt+1;
-    FSE_DECODE_TYPE* const tableDecode = (FSE_DECODE_TYPE*)ptr;
-    FSE_DTableHeader DTableH;
-    const U32 tableSize = 1 << tableLog;
-    const U32 tableMask = tableSize-1;
-    const U32 step = FSE_tableStep(tableSize);
-    U16 symbolNext[FSE_MAX_SYMBOL_VALUE+1];
-    U32 position = 0;
-    U32 highThreshold = tableSize-1;
-    const S16 largeLimit= (S16)(1 << (tableLog-1));
-    U32 noLarge = 1;
-    U32 s;
-
-    /* Sanity Checks */
-    if (maxSymbolValue > FSE_MAX_SYMBOL_VALUE) return ERROR(maxSymbolValue_tooLarge);
-    if (tableLog > FSE_MAX_TABLELOG) return ERROR(tableLog_tooLarge);
-
-    /* Init, lay down lowprob symbols */
-    DTableH.tableLog = (U16)tableLog;
-    for (s=0; s<=maxSymbolValue; s++)
-    {
-        if (normalizedCounter[s]==-1)
-        {
-            tableDecode[highThreshold--].symbol = (FSE_FUNCTION_TYPE)s;
-            symbolNext[s] = 1;
-        }
-        else
-        {
-            if (normalizedCounter[s] >= largeLimit) noLarge=0;
-            symbolNext[s] = normalizedCounter[s];
-        }
-    }
-
-    /* Spread symbols */
-    for (s=0; s<=maxSymbolValue; s++)
-    {
-        int i;
-        for (i=0; i highThreshold) position = (position + step) & tableMask;   /* lowprob area */
-        }
-    }
-
-    if (position!=0) return ERROR(GENERIC);   /* position must reach all cells once, otherwise normalizedCounter is incorrect */
-
-    /* Build Decoding table */
-    {
-        U32 i;
-        for (i=0; i FSE_TABLELOG_ABSOLUTE_MAX) return ERROR(tableLog_tooLarge);
-    bitStream >>= 4;
-    bitCount = 4;
-    *tableLogPtr = nbBits;
-    remaining = (1<1) && (charnum<=*maxSVPtr))
-    {
-        if (previous0)
-        {
-            unsigned n0 = charnum;
-            while ((bitStream & 0xFFFF) == 0xFFFF)
-            {
-                n0+=24;
-                if (ip < iend-5)
-                {
-                    ip+=2;
-                    bitStream = MEM_readLE32(ip) >> bitCount;
-                }
-                else
-                {
-                    bitStream >>= 16;
-                    bitCount+=16;
-                }
-            }
-            while ((bitStream & 3) == 3)
-            {
-                n0+=3;
-                bitStream>>=2;
-                bitCount+=2;
-            }
-            n0 += bitStream & 3;
-            bitCount += 2;
-            if (n0 > *maxSVPtr) return ERROR(maxSymbolValue_tooSmall);
-            while (charnum < n0) normalizedCounter[charnum++] = 0;
-            if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))
-            {
-                ip += bitCount>>3;
-                bitCount &= 7;
-                bitStream = MEM_readLE32(ip) >> bitCount;
-            }
-            else
-                bitStream >>= 2;
-        }
-        {
-            const short max = (short)((2*threshold-1)-remaining);
-            short count;
-
-            if ((bitStream & (threshold-1)) < (U32)max)
-            {
-                count = (short)(bitStream & (threshold-1));
-                bitCount   += nbBits-1;
-            }
-            else
-            {
-                count = (short)(bitStream & (2*threshold-1));
-                if (count >= threshold) count -= max;
-                bitCount   += nbBits;
-            }
-
-            count--;   /* extra accuracy */
-            remaining -= FSE_abs(count);
-            normalizedCounter[charnum++] = count;
-            previous0 = !count;
-            while (remaining < threshold)
-            {
-                nbBits--;
-                threshold >>= 1;
-            }
-
-            {
-                if ((ip <= iend-7) || (ip + (bitCount>>3) <= iend-4))
-                {
-                    ip += bitCount>>3;
-                    bitCount &= 7;
-                }
-                else
-                {
-                    bitCount -= (int)(8 * (iend - 4 - ip));
-                    ip = iend - 4;
-                }
-                bitStream = MEM_readLE32(ip) >> (bitCount & 31);
-            }
-        }
-    }
-    if (remaining != 1) return ERROR(GENERIC);
-    *maxSVPtr = charnum-1;
-
-    ip += (bitCount+7)>>3;
-    if ((size_t)(ip-istart) > hbSize) return ERROR(srcSize_wrong);
-    return ip-istart;
-}
-
-
-/*********************************************************
-*  Decompression (Byte symbols)
-*********************************************************/
-static size_t FSE_buildDTable_rle (FSE_DTable* dt, BYTE symbolValue)
-{
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    FSE_decode_t* const cell = (FSE_decode_t*)(ptr) + 1;   /* because dt is unsigned */
-
-    DTableH->tableLog = 0;
-    DTableH->fastMode = 0;
-
-    cell->newState = 0;
-    cell->symbol = symbolValue;
-    cell->nbBits = 0;
-
-    return 0;
-}
-
-
-static size_t FSE_buildDTable_raw (FSE_DTable* dt, unsigned nbBits)
-{
-    void* ptr = dt;
-    FSE_DTableHeader* const DTableH = (FSE_DTableHeader*)ptr;
-    FSE_decode_t* const dinfo = (FSE_decode_t*)(ptr) + 1;   /* because dt is unsigned */
-    const unsigned tableSize = 1 << nbBits;
-    const unsigned tableMask = tableSize - 1;
-    const unsigned maxSymbolValue = tableMask;
-    unsigned s;
-
-    /* Sanity checks */
-    if (nbBits < 1) return ERROR(GENERIC);         /* min size */
-
-    /* Build Decoding Table */
-    DTableH->tableLog = (U16)nbBits;
-    DTableH->fastMode = 1;
-    for (s=0; s<=maxSymbolValue; s++)
-    {
-        dinfo[s].newState = 0;
-        dinfo[s].symbol = (BYTE)s;
-        dinfo[s].nbBits = (BYTE)nbBits;
-    }
-
-    return 0;
-}
-
-FORCE_INLINE size_t FSE_decompress_usingDTable_generic(
-          void* dst, size_t maxDstSize,
-    const void* cSrc, size_t cSrcSize,
-    const FSE_DTable* dt, const unsigned fast)
-{
-    BYTE* const ostart = (BYTE*) dst;
-    BYTE* op = ostart;
-    BYTE* const omax = op + maxDstSize;
-    BYTE* const olimit = omax-3;
-
-    BIT_DStream_t bitD;
-    FSE_DState_t state1;
-    FSE_DState_t state2;
-    size_t errorCode;
-
-    /* Init */
-    errorCode = BIT_initDStream(&bitD, cSrc, cSrcSize);   /* replaced last arg by maxCompressed Size */
-    if (FSE_isError(errorCode)) return errorCode;
-
-    FSE_initDState(&state1, &bitD, dt);
-    FSE_initDState(&state2, &bitD, dt);
-
-#define FSE_GETSYMBOL(statePtr) fast ? FSE_decodeSymbolFast(statePtr, &bitD) : FSE_decodeSymbol(statePtr, &bitD)
-
-    /* 4 symbols per loop */
-    for ( ; (BIT_reloadDStream(&bitD)==BIT_DStream_unfinished) && (op sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            BIT_reloadDStream(&bitD);
-
-        op[1] = FSE_GETSYMBOL(&state2);
-
-        if (FSE_MAX_TABLELOG*4+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            { if (BIT_reloadDStream(&bitD) > BIT_DStream_unfinished) { op+=2; break; } }
-
-        op[2] = FSE_GETSYMBOL(&state1);
-
-        if (FSE_MAX_TABLELOG*2+7 > sizeof(bitD.bitContainer)*8)    /* This test must be static */
-            BIT_reloadDStream(&bitD);
-
-        op[3] = FSE_GETSYMBOL(&state2);
-    }
-
-    /* tail */
-    /* note : BIT_reloadDStream(&bitD) >= FSE_DStream_partiallyFilled; Ends at exactly BIT_DStream_completed */
-    while (1)
-    {
-        if ( (BIT_reloadDStream(&bitD)>BIT_DStream_completed) || (op==omax) || (BIT_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state1))) )
-            break;
-
-        *op++ = FSE_GETSYMBOL(&state1);
-
-        if ( (BIT_reloadDStream(&bitD)>BIT_DStream_completed) || (op==omax) || (BIT_endOfDStream(&bitD) && (fast || FSE_endOfDState(&state2))) )
-            break;
-
-        *op++ = FSE_GETSYMBOL(&state2);
-    }
-
-    /* end ? */
-    if (BIT_endOfDStream(&bitD) && FSE_endOfDState(&state1) && FSE_endOfDState(&state2))
-        return op-ostart;
-
-    if (op==omax) return ERROR(dstSize_tooSmall);   /* dst buffer is full, but cSrc unfinished */
-
-    return ERROR(corruption_detected);
-}
-
-
-static size_t FSE_decompress_usingDTable(void* dst, size_t originalSize,
-                            const void* cSrc, size_t cSrcSize,
-                            const FSE_DTable* dt)
-{
-    FSE_DTableHeader DTableH;
-    memcpy(&DTableH, dt, sizeof(DTableH));
-
-    /* select fast mode (static) */
-    if (DTableH.fastMode) return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 1);
-    return FSE_decompress_usingDTable_generic(dst, originalSize, cSrc, cSrcSize, dt, 0);
-}
-
-
-static size_t FSE_decompress(void* dst, size_t maxDstSize, const void* cSrc, size_t cSrcSize)
-{
-    const BYTE* const istart = (const BYTE*)cSrc;
-    const BYTE* ip = istart;
-    short counting[FSE_MAX_SYMBOL_VALUE+1];
-    DTable_max_t dt;   /* Static analyzer seems unable to understand this table will be properly initialized later */
-    unsigned tableLog;
-    unsigned maxSymbolValue = FSE_MAX_SYMBOL_VALUE;
-    size_t errorCode;
-
-    if (cSrcSize<2) return ERROR(srcSize_wrong);   /* too small input size */
-
-    /* normal FSE decoding mode */
-    errorCode = FSE_readNCount (counting, &maxSymbolValue, &tableLog, istart, cSrcSize);
-    if (FSE_isError(errorCode)) return errorCode;
-    if (errorCode >= cSrcSize) return ERROR(srcSize_wrong);   /* too small input size */
-    ip += errorCode;
-    cSrcSize -= errorCode;
-
-    errorCode = FSE_buildDTable (dt, counting, maxSymbolValue, tableLog);
-    if (FSE_isError(errorCode)) return errorCode;
-
-    /* always return, even if it is an error code */
-    return FSE_decompress_usingDTable (dst, maxDstSize, ip, cSrcSize, dt);
-}
-
-
-
-#endif   /* FSE_COMMONDEFS_ONLY */
-/* ******************************************************************
-   Huff0 : Huffman coder, part of New Generation Entropy library
-   Copyright (C) 2013-2015, Yann Collet.
-
-   BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions are
-   met:
-
-       * Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-       * Redistributions in binary form must reproduce the above
-   copyright notice, this list of conditions and the following disclaimer
-   in the documentation and/or other materials provided with the
-   distribution.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    You can contact the author at :
-    - FSE+Huff0 source repository : https://github.com/Cyan4973/FiniteStateEntropy
-    - Public forum : https://groups.google.com/forum/#!forum/lz4c
-****************************************************************** */
-
-/****************************************************************
-*  Compiler specifics
-****************************************************************/
-#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-/* inline is defined */
-#elif defined(_MSC_VER)
-#  define inline __inline
-#else
-#  define inline /* disable inline */
-#endif
-
-
-#ifdef _MSC_VER    /* Visual Studio */
-#  pragma warning(disable : 4127)        /* disable: C4127: conditional expression is constant */
-#endif
-
-
-/****************************************************************
-*  Includes
-****************************************************************/
-#include      /* malloc, free, qsort */
-#include      /* memcpy, memset */
-#include       /* printf (debug) */
-
-/****************************************************************
-*  Error Management
-****************************************************************/
-#define HUF_STATIC_ASSERT(c) { enum { HUF_static_assert = 1/(int)(!!(c)) }; }   /* use only *after* variable declarations */
-
-
-/******************************************
-*  Helper functions
-******************************************/
-static unsigned HUF_isError(size_t code) { return ERR_isError(code); }
-
-#define HUF_ABSOLUTEMAX_TABLELOG  16   /* absolute limit of HUF_MAX_TABLELOG. Beyond that value, code does not work */
-#define HUF_MAX_TABLELOG  12           /* max configured tableLog (for static allocation); can be modified up to HUF_ABSOLUTEMAX_TABLELOG */
-#define HUF_DEFAULT_TABLELOG  HUF_MAX_TABLELOG   /* tableLog by default, when not specified */
-#define HUF_MAX_SYMBOL_VALUE 255
-#if (HUF_MAX_TABLELOG > HUF_ABSOLUTEMAX_TABLELOG)
-#  error "HUF_MAX_TABLELOG is too large !"
-#endif
-
-
-
-/*********************************************************
-*  Huff0 : Huffman block decompression
-*********************************************************/
-typedef struct { BYTE byte; BYTE nbBits; } HUF_DEltX2;   /* single-symbol decoding */
-
-typedef struct { U16 sequence; BYTE nbBits; BYTE length; } HUF_DEltX4;  /* double-symbols decoding */
-
-typedef struct { BYTE symbol; BYTE weight; } sortedSymbol_t;
-
-/*! HUF_readStats
-    Read compact Huffman tree, saved by HUF_writeCTable
-    @huffWeight : destination buffer
-    @return : size read from `src`
-*/
-static size_t HUF_readStats(BYTE* huffWeight, size_t hwSize, U32* rankStats,
-                            U32* nbSymbolsPtr, U32* tableLogPtr,
-                            const void* src, size_t srcSize)
-{
-    U32 weightTotal;
-    U32 tableLog;
-    const BYTE* ip = (const BYTE*) src;
-    size_t iSize;
-    size_t oSize;
-    U32 n;
-
-    if (!srcSize) return ERROR(srcSize_wrong);
-    iSize = ip[0];
-    //memset(huffWeight, 0, hwSize);   /* is not necessary, even though some analyzer complain ... */
-
-    if (iSize >= 128)  /* special header */
-    {
-        if (iSize >= (242))   /* RLE */
-        {
-            static int l[14] = { 1, 2, 3, 4, 7, 8, 15, 16, 31, 32, 63, 64, 127, 128 };
-            oSize = l[iSize-242];
-            memset(huffWeight, 1, hwSize);
-            iSize = 0;
-        }
-        else   /* Incompressible */
-        {
-            oSize = iSize - 127;
-            iSize = ((oSize+1)/2);
-            if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
-            if (oSize >= hwSize) return ERROR(corruption_detected);
-            ip += 1;
-            for (n=0; n> 4;
-                huffWeight[n+1] = ip[n/2] & 15;
-            }
-        }
-    }
-    else  /* header compressed with FSE (normal case) */
-    {
-        if (iSize+1 > srcSize) return ERROR(srcSize_wrong);
-        oSize = FSE_decompress(huffWeight, hwSize-1, ip+1, iSize);   /* max (hwSize-1) values decoded, as last one is implied */
-        if (FSE_isError(oSize)) return oSize;
-    }
-
-    /* collect weight stats */
-    memset(rankStats, 0, (HUF_ABSOLUTEMAX_TABLELOG + 1) * sizeof(U32));
-    weightTotal = 0;
-    for (n=0; n= HUF_ABSOLUTEMAX_TABLELOG) return ERROR(corruption_detected);
-        rankStats[huffWeight[n]]++;
-        weightTotal += (1 << huffWeight[n]) >> 1;
-    }
-    if (weightTotal == 0) return ERROR(corruption_detected);
-
-    /* get last non-null symbol weight (implied, total must be 2^n) */
-    tableLog = BIT_highbit32(weightTotal) + 1;
-    if (tableLog > HUF_ABSOLUTEMAX_TABLELOG) return ERROR(corruption_detected);
-    {
-        U32 total = 1 << tableLog;
-        U32 rest = total - weightTotal;
-        U32 verif = 1 << BIT_highbit32(rest);
-        U32 lastWeight = BIT_highbit32(rest) + 1;
-        if (verif != rest) return ERROR(corruption_detected);    /* last value must be a clean power of 2 */
-        huffWeight[oSize] = (BYTE)lastWeight;
-        rankStats[lastWeight]++;
-    }
-
-    /* check tree construction validity */
-    if ((rankStats[1] < 2) || (rankStats[1] & 1)) return ERROR(corruption_detected);   /* by construction : at least 2 elts of rank 1, must be even */
-
-    /* results */
-    *nbSymbolsPtr = (U32)(oSize+1);
-    *tableLogPtr = tableLog;
-    return iSize+1;
-}
-
-
-/**************************/
-/* single-symbol decoding */
-/**************************/
-
-static size_t HUF_readDTableX2 (U16* DTable, const void* src, size_t srcSize)
-{
-    BYTE huffWeight[HUF_MAX_SYMBOL_VALUE + 1];
-    U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];   /* large enough for values from 0 to 16 */
-    U32 tableLog = 0;
-    const BYTE* ip = (const BYTE*) src;
-    size_t iSize = ip[0];
-    U32 nbSymbols = 0;
-    U32 n;
-    U32 nextRankStart;
-    void* ptr = DTable+1;
-    HUF_DEltX2* const dt = (HUF_DEltX2*)ptr;
-
-    HUF_STATIC_ASSERT(sizeof(HUF_DEltX2) == sizeof(U16));   /* if compilation fails here, assertion is false */
-    //memset(huffWeight, 0, sizeof(huffWeight));   /* is not necessary, even though some analyzer complain ... */
-
-    iSize = HUF_readStats(huffWeight, HUF_MAX_SYMBOL_VALUE + 1, rankVal, &nbSymbols, &tableLog, src, srcSize);
-    if (HUF_isError(iSize)) return iSize;
-
-    /* check result */
-    if (tableLog > DTable[0]) return ERROR(tableLog_tooLarge);   /* DTable is too small */
-    DTable[0] = (U16)tableLog;   /* maybe should separate sizeof DTable, as allocated, from used size of DTable, in case of DTable re-use */
-
-    /* Prepare ranks */
-    nextRankStart = 0;
-    for (n=1; n<=tableLog; n++)
-    {
-        U32 current = nextRankStart;
-        nextRankStart += (rankVal[n] << (n-1));
-        rankVal[n] = current;
-    }
-
-    /* fill DTable */
-    for (n=0; n> 1;
-        U32 i;
-        HUF_DEltX2 D;
-        D.byte = (BYTE)n; D.nbBits = (BYTE)(tableLog + 1 - w);
-        for (i = rankVal[w]; i < rankVal[w] + length; i++)
-            dt[i] = D;
-        rankVal[w] += length;
-    }
-
-    return iSize;
-}
-
-static BYTE HUF_decodeSymbolX2(BIT_DStream_t* Dstream, const HUF_DEltX2* dt, const U32 dtLog)
-{
-        const size_t val = BIT_lookBitsFast(Dstream, dtLog); /* note : dtLog >= 1 */
-        const BYTE c = dt[val].byte;
-        BIT_skipBits(Dstream, dt[val].nbBits);
-        return c;
-}
-
-#define HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr) \
-    *ptr++ = HUF_decodeSymbolX2(DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX2_1(ptr, DStreamPtr) \
-    if (MEM_64bits() || (HUF_MAX_TABLELOG<=12)) \
-        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-
-#define HUF_DECODE_SYMBOLX2_2(ptr, DStreamPtr) \
-    if (MEM_64bits()) \
-        HUF_DECODE_SYMBOLX2_0(ptr, DStreamPtr)
-
-static inline size_t HUF_decodeStreamX2(BYTE* p, BIT_DStream_t* const bitDPtr, BYTE* const pEnd, const HUF_DEltX2* const dt, const U32 dtLog)
-{
-    BYTE* const pStart = p;
-
-    /* up to 4 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-4))
-    {
-        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_1(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-    }
-
-    /* closer to the end */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd))
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-
-    /* no more data to retrieve from bitstream, hence no need to reload */
-    while (p < pEnd)
-        HUF_DECODE_SYMBOLX2_0(p, bitDPtr);
-
-    return pEnd-pStart;
-}
-
-
-static size_t HUF_decompress4X2_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const U16* DTable)
-{
-    if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
-
-    {
-        const BYTE* const istart = (const BYTE*) cSrc;
-        BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-
-        const void* ptr = DTable;
-        const HUF_DEltX2* const dt = ((const HUF_DEltX2*)ptr) +1;
-        const U32 dtLog = DTable[0];
-        size_t errorCode;
-
-        /* Init */
-        BIT_DStream_t bitD1;
-        BIT_DStream_t bitD2;
-        BIT_DStream_t bitD3;
-        BIT_DStream_t bitD4;
-        const size_t length1 = MEM_readLE16(istart);
-        const size_t length2 = MEM_readLE16(istart+2);
-        const size_t length3 = MEM_readLE16(istart+4);
-        size_t length4;
-        const BYTE* const istart1 = istart + 6;  /* jumpTable */
-        const BYTE* const istart2 = istart1 + length1;
-        const BYTE* const istart3 = istart2 + length2;
-        const BYTE* const istart4 = istart3 + length3;
-        const size_t segmentSize = (dstSize+3) / 4;
-        BYTE* const opStart2 = ostart + segmentSize;
-        BYTE* const opStart3 = opStart2 + segmentSize;
-        BYTE* const opStart4 = opStart3 + segmentSize;
-        BYTE* op1 = ostart;
-        BYTE* op2 = opStart2;
-        BYTE* op3 = opStart3;
-        BYTE* op4 = opStart4;
-        U32 endSignal;
-
-        length4 = cSrcSize - (length1 + length2 + length3 + 6);
-        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
-        errorCode = BIT_initDStream(&bitD1, istart1, length1);
-        if (HUF_isError(errorCode)) return errorCode;
-        errorCode = BIT_initDStream(&bitD2, istart2, length2);
-        if (HUF_isError(errorCode)) return errorCode;
-        errorCode = BIT_initDStream(&bitD3, istart3, length3);
-        if (HUF_isError(errorCode)) return errorCode;
-        errorCode = BIT_initDStream(&bitD4, istart4, length4);
-        if (HUF_isError(errorCode)) return errorCode;
-
-        /* 16-32 symbols per loop (4-8 symbols per stream) */
-        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; )
-        {
-            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_1(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_1(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_1(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_1(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX2_0(op1, &bitD1);
-            HUF_DECODE_SYMBOLX2_0(op2, &bitD2);
-            HUF_DECODE_SYMBOLX2_0(op3, &bitD3);
-            HUF_DECODE_SYMBOLX2_0(op4, &bitD4);
-
-            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        }
-
-        /* check corruption */
-        if (op1 > opStart2) return ERROR(corruption_detected);
-        if (op2 > opStart3) return ERROR(corruption_detected);
-        if (op3 > opStart4) return ERROR(corruption_detected);
-        /* note : op4 supposed already verified within main loop */
-
-        /* finish bitStreams one by one */
-        HUF_decodeStreamX2(op1, &bitD1, opStart2, dt, dtLog);
-        HUF_decodeStreamX2(op2, &bitD2, opStart3, dt, dtLog);
-        HUF_decodeStreamX2(op3, &bitD3, opStart4, dt, dtLog);
-        HUF_decodeStreamX2(op4, &bitD4, oend,     dt, dtLog);
-
-        /* check */
-        endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-        if (!endSignal) return ERROR(corruption_detected);
-
-        /* decoded size */
-        return dstSize;
-    }
-}
-
-
-static size_t HUF_decompress4X2 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    HUF_CREATE_STATIC_DTABLEX2(DTable, HUF_MAX_TABLELOG);
-    const BYTE* ip = (const BYTE*) cSrc;
-    size_t errorCode;
-
-    errorCode = HUF_readDTableX2 (DTable, cSrc, cSrcSize);
-    if (HUF_isError(errorCode)) return errorCode;
-    if (errorCode >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += errorCode;
-    cSrcSize -= errorCode;
-
-    return HUF_decompress4X2_usingDTable (dst, dstSize, ip, cSrcSize, DTable);
-}
-
-
-/***************************/
-/* double-symbols decoding */
-/***************************/
-
-static void HUF_fillDTableX4Level2(HUF_DEltX4* DTable, U32 sizeLog, const U32 consumed,
-                           const U32* rankValOrigin, const int minWeight,
-                           const sortedSymbol_t* sortedSymbols, const U32 sortedListSize,
-                           U32 nbBitsBaseline, U16 baseSeq)
-{
-    HUF_DEltX4 DElt;
-    U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];
-    U32 s;
-
-    /* get pre-calculated rankVal */
-    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-
-    /* fill skipped values */
-    if (minWeight>1)
-    {
-        U32 i, skipSize = rankVal[minWeight];
-        MEM_writeLE16(&(DElt.sequence), baseSeq);
-        DElt.nbBits   = (BYTE)(consumed);
-        DElt.length   = 1;
-        for (i = 0; i < skipSize; i++)
-            DTable[i] = DElt;
-    }
-
-    /* fill DTable */
-    for (s=0; s= 1 */
-
-        rankVal[weight] += length;
-    }
-}
-
-typedef U32 rankVal_t[HUF_ABSOLUTEMAX_TABLELOG][HUF_ABSOLUTEMAX_TABLELOG + 1];
-
-static void HUF_fillDTableX4(HUF_DEltX4* DTable, const U32 targetLog,
-                           const sortedSymbol_t* sortedList, const U32 sortedListSize,
-                           const U32* rankStart, rankVal_t rankValOrigin, const U32 maxWeight,
-                           const U32 nbBitsBaseline)
-{
-    U32 rankVal[HUF_ABSOLUTEMAX_TABLELOG + 1];
-    const int scaleLog = nbBitsBaseline - targetLog;   /* note : targetLog >= srcLog, hence scaleLog <= 1 */
-    const U32 minBits  = nbBitsBaseline - maxWeight;
-    U32 s;
-
-    memcpy(rankVal, rankValOrigin, sizeof(rankVal));
-
-    /* fill DTable */
-    for (s=0; s= minBits)   /* enough room for a second symbol */
-        {
-            U32 sortedRank;
-            int minWeight = nbBits + scaleLog;
-            if (minWeight < 1) minWeight = 1;
-            sortedRank = rankStart[minWeight];
-            HUF_fillDTableX4Level2(DTable+start, targetLog-nbBits, nbBits,
-                           rankValOrigin[nbBits], minWeight,
-                           sortedList+sortedRank, sortedListSize-sortedRank,
-                           nbBitsBaseline, symbol);
-        }
-        else
-        {
-            U32 i;
-            const U32 end = start + length;
-            HUF_DEltX4 DElt;
-
-            MEM_writeLE16(&(DElt.sequence), symbol);
-            DElt.nbBits   = (BYTE)(nbBits);
-            DElt.length   = 1;
-            for (i = start; i < end; i++)
-                DTable[i] = DElt;
-        }
-        rankVal[weight] += length;
-    }
-}
-
-static size_t HUF_readDTableX4 (U32* DTable, const void* src, size_t srcSize)
-{
-    BYTE weightList[HUF_MAX_SYMBOL_VALUE + 1];
-    sortedSymbol_t sortedSymbol[HUF_MAX_SYMBOL_VALUE + 1];
-    U32 rankStats[HUF_ABSOLUTEMAX_TABLELOG + 1] = { 0 };
-    U32 rankStart0[HUF_ABSOLUTEMAX_TABLELOG + 2] = { 0 };
-    U32* const rankStart = rankStart0+1;
-    rankVal_t rankVal;
-    U32 tableLog, maxW, sizeOfSort, nbSymbols;
-    const U32 memLog = DTable[0];
-    const BYTE* ip = (const BYTE*) src;
-    size_t iSize = ip[0];
-    void* ptr = DTable;
-    HUF_DEltX4* const dt = ((HUF_DEltX4*)ptr) + 1;
-
-    HUF_STATIC_ASSERT(sizeof(HUF_DEltX4) == sizeof(U32));   /* if compilation fails here, assertion is false */
-    if (memLog > HUF_ABSOLUTEMAX_TABLELOG) return ERROR(tableLog_tooLarge);
-    //memset(weightList, 0, sizeof(weightList));   /* is not necessary, even though some analyzer complain ... */
-
-    iSize = HUF_readStats(weightList, HUF_MAX_SYMBOL_VALUE + 1, rankStats, &nbSymbols, &tableLog, src, srcSize);
-    if (HUF_isError(iSize)) return iSize;
-
-    /* check result */
-    if (tableLog > memLog) return ERROR(tableLog_tooLarge);   /* DTable can't fit code depth */
-
-    /* find maxWeight */
-    for (maxW = tableLog; rankStats[maxW]==0; maxW--)
-        {if (!maxW) return ERROR(GENERIC); }  /* necessarily finds a solution before maxW==0 */
-
-    /* Get start index of each weight */
-    {
-        U32 w, nextRankStart = 0;
-        for (w=1; w<=maxW; w++)
-        {
-            U32 current = nextRankStart;
-            nextRankStart += rankStats[w];
-            rankStart[w] = current;
-        }
-        rankStart[0] = nextRankStart;   /* put all 0w symbols at the end of sorted list*/
-        sizeOfSort = nextRankStart;
-    }
-
-    /* sort symbols by weight */
-    {
-        U32 s;
-        for (s=0; s> consumed;
-            }
-        }
-    }
-
-    HUF_fillDTableX4(dt, memLog,
-                   sortedSymbol, sizeOfSort,
-                   rankStart0, rankVal, maxW,
-                   tableLog+1);
-
-    return iSize;
-}
-
-
-static U32 HUF_decodeSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
-{
-    const size_t val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
-    memcpy(op, dt+val, 2);
-    BIT_skipBits(DStream, dt[val].nbBits);
-    return dt[val].length;
-}
-
-static U32 HUF_decodeLastSymbolX4(void* op, BIT_DStream_t* DStream, const HUF_DEltX4* dt, const U32 dtLog)
-{
-    const size_t val = BIT_lookBitsFast(DStream, dtLog);   /* note : dtLog >= 1 */
-    memcpy(op, dt+val, 1);
-    if (dt[val].length==1) BIT_skipBits(DStream, dt[val].nbBits);
-    else
-    {
-        if (DStream->bitsConsumed < (sizeof(DStream->bitContainer)*8))
-        {
-            BIT_skipBits(DStream, dt[val].nbBits);
-            if (DStream->bitsConsumed > (sizeof(DStream->bitContainer)*8))
-                DStream->bitsConsumed = (sizeof(DStream->bitContainer)*8);   /* ugly hack; works only because it's the last symbol. Note : can't easily extract nbBits from just this symbol */
-        }
-    }
-    return 1;
-}
-
-
-#define HUF_DECODE_SYMBOLX4_0(ptr, DStreamPtr) \
-    ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX4_1(ptr, DStreamPtr) \
-    if (MEM_64bits() || (HUF_MAX_TABLELOG<=12)) \
-        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-#define HUF_DECODE_SYMBOLX4_2(ptr, DStreamPtr) \
-    if (MEM_64bits()) \
-        ptr += HUF_decodeSymbolX4(ptr, DStreamPtr, dt, dtLog)
-
-static inline size_t HUF_decodeStreamX4(BYTE* p, BIT_DStream_t* bitDPtr, BYTE* const pEnd, const HUF_DEltX4* const dt, const U32 dtLog)
-{
-    BYTE* const pStart = p;
-
-    /* up to 8 symbols at a time */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p < pEnd-7))
-    {
-        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_1(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_2(p, bitDPtr);
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-    }
-
-    /* closer to the end */
-    while ((BIT_reloadDStream(bitDPtr) == BIT_DStream_unfinished) && (p <= pEnd-2))
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);
-
-    while (p <= pEnd-2)
-        HUF_DECODE_SYMBOLX4_0(p, bitDPtr);   /* no need to reload : reached the end of DStream */
-
-    if (p < pEnd)
-        p += HUF_decodeLastSymbolX4(p, bitDPtr, dt, dtLog);
-
-    return p-pStart;
-}
-
-
-
-static size_t HUF_decompress4X4_usingDTable(
-          void* dst,  size_t dstSize,
-    const void* cSrc, size_t cSrcSize,
-    const U32* DTable)
-{
-    if (cSrcSize < 10) return ERROR(corruption_detected);   /* strict minimum : jump table + 1 byte per stream */
-
-    {
-        const BYTE* const istart = (const BYTE*) cSrc;
-        BYTE* const ostart = (BYTE*) dst;
-        BYTE* const oend = ostart + dstSize;
-
-        const void* ptr = DTable;
-        const HUF_DEltX4* const dt = ((const HUF_DEltX4*)ptr) +1;
-        const U32 dtLog = DTable[0];
-        size_t errorCode;
-
-        /* Init */
-        BIT_DStream_t bitD1;
-        BIT_DStream_t bitD2;
-        BIT_DStream_t bitD3;
-        BIT_DStream_t bitD4;
-        const size_t length1 = MEM_readLE16(istart);
-        const size_t length2 = MEM_readLE16(istart+2);
-        const size_t length3 = MEM_readLE16(istart+4);
-        size_t length4;
-        const BYTE* const istart1 = istart + 6;  /* jumpTable */
-        const BYTE* const istart2 = istart1 + length1;
-        const BYTE* const istart3 = istart2 + length2;
-        const BYTE* const istart4 = istart3 + length3;
-        const size_t segmentSize = (dstSize+3) / 4;
-        BYTE* const opStart2 = ostart + segmentSize;
-        BYTE* const opStart3 = opStart2 + segmentSize;
-        BYTE* const opStart4 = opStart3 + segmentSize;
-        BYTE* op1 = ostart;
-        BYTE* op2 = opStart2;
-        BYTE* op3 = opStart3;
-        BYTE* op4 = opStart4;
-        U32 endSignal;
-
-        length4 = cSrcSize - (length1 + length2 + length3 + 6);
-        if (length4 > cSrcSize) return ERROR(corruption_detected);   /* overflow */
-        errorCode = BIT_initDStream(&bitD1, istart1, length1);
-        if (HUF_isError(errorCode)) return errorCode;
-        errorCode = BIT_initDStream(&bitD2, istart2, length2);
-        if (HUF_isError(errorCode)) return errorCode;
-        errorCode = BIT_initDStream(&bitD3, istart3, length3);
-        if (HUF_isError(errorCode)) return errorCode;
-        errorCode = BIT_initDStream(&bitD4, istart4, length4);
-        if (HUF_isError(errorCode)) return errorCode;
-
-        /* 16-32 symbols per loop (4-8 symbols per stream) */
-        endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        for ( ; (endSignal==BIT_DStream_unfinished) && (op4<(oend-7)) ; )
-        {
-            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_1(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_1(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_1(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_1(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_2(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_2(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_2(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_2(op4, &bitD4);
-            HUF_DECODE_SYMBOLX4_0(op1, &bitD1);
-            HUF_DECODE_SYMBOLX4_0(op2, &bitD2);
-            HUF_DECODE_SYMBOLX4_0(op3, &bitD3);
-            HUF_DECODE_SYMBOLX4_0(op4, &bitD4);
-
-            endSignal = BIT_reloadDStream(&bitD1) | BIT_reloadDStream(&bitD2) | BIT_reloadDStream(&bitD3) | BIT_reloadDStream(&bitD4);
-        }
-
-        /* check corruption */
-        if (op1 > opStart2) return ERROR(corruption_detected);
-        if (op2 > opStart3) return ERROR(corruption_detected);
-        if (op3 > opStart4) return ERROR(corruption_detected);
-        /* note : op4 supposed already verified within main loop */
-
-        /* finish bitStreams one by one */
-        HUF_decodeStreamX4(op1, &bitD1, opStart2, dt, dtLog);
-        HUF_decodeStreamX4(op2, &bitD2, opStart3, dt, dtLog);
-        HUF_decodeStreamX4(op3, &bitD3, opStart4, dt, dtLog);
-        HUF_decodeStreamX4(op4, &bitD4, oend,     dt, dtLog);
-
-        /* check */
-        endSignal = BIT_endOfDStream(&bitD1) & BIT_endOfDStream(&bitD2) & BIT_endOfDStream(&bitD3) & BIT_endOfDStream(&bitD4);
-        if (!endSignal) return ERROR(corruption_detected);
-
-        /* decoded size */
-        return dstSize;
-    }
-}
-
-
-static size_t HUF_decompress4X4 (void* dst, size_t dstSize, const void* cSrc, size_t cSrcSize)
-{
-    HUF_CREATE_STATIC_DTABLEX4(DTable, HUF_MAX_TABLELOG);
-    const BYTE* ip = (const BYTE*) cSrc;
-
-    size_t hSize = HUF_readDTableX4 (DTable, cSrc, cSrcSize);
-    if (HUF_isError(hSize)) return hSize;
-    if (hSize >= cSrcSize) return ERROR(srcSize_wrong);
-    ip += hSize;
-    cSrcSize -= hSize;
-
-    return HUF_decompress4X4_usingDTable (dst, dstSize, ip, cSrcSize, DTable);
-}
-
-
-/**********************************/
-/* quad-symbol decoding           */
-/**********************************/
-typedef struct { BYTE nbBits; BYTE nbBytes; } HUF_DDescX6;
-typedef union { BYTE byte[4]; U32 sequence; } HUF_DSeqX6;
-
-/* recursive, up to level 3; may benefit from