multi_compress 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +7 -0
- data/CHANGELOG.md +13 -0
- data/LICENSE.txt +21 -0
- data/README.md +116 -0
- data/ext/multi_compress/extconf.rb +171 -0
- data/ext/multi_compress/multi_compress.c +1534 -0
- data/ext/multi_compress/vendor/brotli/c/common/constants.c +15 -0
- data/ext/multi_compress/vendor/brotli/c/common/constants.h +201 -0
- data/ext/multi_compress/vendor/brotli/c/common/context.c +156 -0
- data/ext/multi_compress/vendor/brotli/c/common/context.h +113 -0
- data/ext/multi_compress/vendor/brotli/c/common/dictionary.c +5916 -0
- data/ext/multi_compress/vendor/brotli/c/common/dictionary.h +64 -0
- data/ext/multi_compress/vendor/brotli/c/common/platform.c +23 -0
- data/ext/multi_compress/vendor/brotli/c/common/platform.h +541 -0
- data/ext/multi_compress/vendor/brotli/c/common/shared_dictionary.c +521 -0
- data/ext/multi_compress/vendor/brotli/c/common/shared_dictionary_internal.h +75 -0
- data/ext/multi_compress/vendor/brotli/c/common/transform.c +291 -0
- data/ext/multi_compress/vendor/brotli/c/common/transform.h +85 -0
- data/ext/multi_compress/vendor/brotli/c/common/version.h +51 -0
- data/ext/multi_compress/vendor/brotli/c/dec/bit_reader.c +78 -0
- data/ext/multi_compress/vendor/brotli/c/dec/bit_reader.h +423 -0
- data/ext/multi_compress/vendor/brotli/c/dec/decode.c +2875 -0
- data/ext/multi_compress/vendor/brotli/c/dec/huffman.c +342 -0
- data/ext/multi_compress/vendor/brotli/c/dec/huffman.h +122 -0
- data/ext/multi_compress/vendor/brotli/c/dec/prefix.h +733 -0
- data/ext/multi_compress/vendor/brotli/c/dec/state.c +183 -0
- data/ext/multi_compress/vendor/brotli/c/dec/state.h +400 -0
- data/ext/multi_compress/vendor/brotli/c/enc/backward_references.c +207 -0
- data/ext/multi_compress/vendor/brotli/c/enc/backward_references.h +40 -0
- data/ext/multi_compress/vendor/brotli/c/enc/backward_references_hq.c +939 -0
- data/ext/multi_compress/vendor/brotli/c/enc/backward_references_hq.h +96 -0
- data/ext/multi_compress/vendor/brotli/c/enc/backward_references_inc.h +189 -0
- data/ext/multi_compress/vendor/brotli/c/enc/bit_cost.c +36 -0
- data/ext/multi_compress/vendor/brotli/c/enc/bit_cost.h +64 -0
- data/ext/multi_compress/vendor/brotli/c/enc/bit_cost_inc.h +127 -0
- data/ext/multi_compress/vendor/brotli/c/enc/block_encoder_inc.h +34 -0
- data/ext/multi_compress/vendor/brotli/c/enc/block_splitter.c +217 -0
- data/ext/multi_compress/vendor/brotli/c/enc/block_splitter.h +52 -0
- data/ext/multi_compress/vendor/brotli/c/enc/block_splitter_inc.h +481 -0
- data/ext/multi_compress/vendor/brotli/c/enc/brotli_bit_stream.c +1336 -0
- data/ext/multi_compress/vendor/brotli/c/enc/brotli_bit_stream.h +89 -0
- data/ext/multi_compress/vendor/brotli/c/enc/cluster.c +57 -0
- data/ext/multi_compress/vendor/brotli/c/enc/cluster.h +49 -0
- data/ext/multi_compress/vendor/brotli/c/enc/cluster_inc.h +325 -0
- data/ext/multi_compress/vendor/brotli/c/enc/command.c +28 -0
- data/ext/multi_compress/vendor/brotli/c/enc/command.h +191 -0
- data/ext/multi_compress/vendor/brotli/c/enc/compound_dictionary.c +207 -0
- data/ext/multi_compress/vendor/brotli/c/enc/compound_dictionary.h +74 -0
- data/ext/multi_compress/vendor/brotli/c/enc/compress_fragment.c +800 -0
- data/ext/multi_compress/vendor/brotli/c/enc/compress_fragment.h +86 -0
- data/ext/multi_compress/vendor/brotli/c/enc/compress_fragment_two_pass.c +657 -0
- data/ext/multi_compress/vendor/brotli/c/enc/compress_fragment_two_pass.h +72 -0
- data/ext/multi_compress/vendor/brotli/c/enc/dictionary_hash.c +1848 -0
- data/ext/multi_compress/vendor/brotli/c/enc/dictionary_hash.h +25 -0
- data/ext/multi_compress/vendor/brotli/c/enc/encode.c +1996 -0
- data/ext/multi_compress/vendor/brotli/c/enc/encoder_dict.c +640 -0
- data/ext/multi_compress/vendor/brotli/c/enc/encoder_dict.h +157 -0
- data/ext/multi_compress/vendor/brotli/c/enc/entropy_encode.c +504 -0
- data/ext/multi_compress/vendor/brotli/c/enc/entropy_encode.h +123 -0
- data/ext/multi_compress/vendor/brotli/c/enc/entropy_encode_static.h +542 -0
- data/ext/multi_compress/vendor/brotli/c/enc/fast_log.c +105 -0
- data/ext/multi_compress/vendor/brotli/c/enc/fast_log.h +67 -0
- data/ext/multi_compress/vendor/brotli/c/enc/find_match_length.h +72 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash.h +728 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_composite_inc.h +140 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_forgetful_chain_inc.h +295 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_longest_match64_inc.h +262 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_longest_match_inc.h +258 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_longest_match_quickly_inc.h +266 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_rolling_inc.h +212 -0
- data/ext/multi_compress/vendor/brotli/c/enc/hash_to_binary_tree_inc.h +330 -0
- data/ext/multi_compress/vendor/brotli/c/enc/histogram.c +100 -0
- data/ext/multi_compress/vendor/brotli/c/enc/histogram.h +64 -0
- data/ext/multi_compress/vendor/brotli/c/enc/histogram_inc.h +51 -0
- data/ext/multi_compress/vendor/brotli/c/enc/literal_cost.c +180 -0
- data/ext/multi_compress/vendor/brotli/c/enc/literal_cost.h +32 -0
- data/ext/multi_compress/vendor/brotli/c/enc/memory.c +194 -0
- data/ext/multi_compress/vendor/brotli/c/enc/memory.h +131 -0
- data/ext/multi_compress/vendor/brotli/c/enc/metablock.c +677 -0
- data/ext/multi_compress/vendor/brotli/c/enc/metablock.h +106 -0
- data/ext/multi_compress/vendor/brotli/c/enc/metablock_inc.h +185 -0
- data/ext/multi_compress/vendor/brotli/c/enc/params.h +47 -0
- data/ext/multi_compress/vendor/brotli/c/enc/prefix.h +54 -0
- data/ext/multi_compress/vendor/brotli/c/enc/quality.h +202 -0
- data/ext/multi_compress/vendor/brotli/c/enc/ringbuffer.h +168 -0
- data/ext/multi_compress/vendor/brotli/c/enc/state.h +104 -0
- data/ext/multi_compress/vendor/brotli/c/enc/static_dict.c +542 -0
- data/ext/multi_compress/vendor/brotli/c/enc/static_dict.h +41 -0
- data/ext/multi_compress/vendor/brotli/c/enc/static_dict_lut.h +5866 -0
- data/ext/multi_compress/vendor/brotli/c/enc/utf8_util.c +85 -0
- data/ext/multi_compress/vendor/brotli/c/enc/utf8_util.h +33 -0
- data/ext/multi_compress/vendor/brotli/c/enc/write_bits.h +88 -0
- data/ext/multi_compress/vendor/brotli/c/include/brotli/decode.h +409 -0
- data/ext/multi_compress/vendor/brotli/c/include/brotli/encode.h +501 -0
- data/ext/multi_compress/vendor/brotli/c/include/brotli/port.h +305 -0
- data/ext/multi_compress/vendor/brotli/c/include/brotli/shared_dictionary.h +100 -0
- data/ext/multi_compress/vendor/brotli/c/include/brotli/types.h +83 -0
- data/ext/multi_compress/vendor/lz4/lib/LICENSE +24 -0
- data/ext/multi_compress/vendor/lz4/lib/Makefile +244 -0
- data/ext/multi_compress/vendor/lz4/lib/README.md +193 -0
- data/ext/multi_compress/vendor/lz4/lib/dll/example/Makefile +63 -0
- data/ext/multi_compress/vendor/lz4/lib/dll/example/README.md +69 -0
- data/ext/multi_compress/vendor/lz4/lib/dll/example/fullbench-dll.sln +25 -0
- data/ext/multi_compress/vendor/lz4/lib/dll/example/fullbench-dll.vcxproj +182 -0
- data/ext/multi_compress/vendor/lz4/lib/liblz4-dll.rc.in +35 -0
- data/ext/multi_compress/vendor/lz4/lib/liblz4.pc.in +14 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4.c +2829 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4.h +884 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4file.c +341 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4file.h +93 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4frame.c +2136 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4frame.h +751 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4frame_static.h +47 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4hc.c +2192 -0
- data/ext/multi_compress/vendor/lz4/lib/lz4hc.h +414 -0
- data/ext/multi_compress/vendor/lz4/lib/xxhash.c +1030 -0
- data/ext/multi_compress/vendor/lz4/lib/xxhash.h +328 -0
- data/ext/multi_compress/vendor/zstd/lib/BUCK +232 -0
- data/ext/multi_compress/vendor/zstd/lib/Makefile +369 -0
- data/ext/multi_compress/vendor/zstd/lib/README.md +237 -0
- data/ext/multi_compress/vendor/zstd/lib/common/allocations.h +55 -0
- data/ext/multi_compress/vendor/zstd/lib/common/bits.h +200 -0
- data/ext/multi_compress/vendor/zstd/lib/common/bitstream.h +457 -0
- data/ext/multi_compress/vendor/zstd/lib/common/compiler.h +450 -0
- data/ext/multi_compress/vendor/zstd/lib/common/cpu.h +249 -0
- data/ext/multi_compress/vendor/zstd/lib/common/debug.c +30 -0
- data/ext/multi_compress/vendor/zstd/lib/common/debug.h +116 -0
- data/ext/multi_compress/vendor/zstd/lib/common/entropy_common.c +340 -0
- data/ext/multi_compress/vendor/zstd/lib/common/error_private.c +63 -0
- data/ext/multi_compress/vendor/zstd/lib/common/error_private.h +168 -0
- data/ext/multi_compress/vendor/zstd/lib/common/fse.h +640 -0
- data/ext/multi_compress/vendor/zstd/lib/common/fse_decompress.c +313 -0
- data/ext/multi_compress/vendor/zstd/lib/common/huf.h +286 -0
- data/ext/multi_compress/vendor/zstd/lib/common/mem.h +426 -0
- data/ext/multi_compress/vendor/zstd/lib/common/pool.c +371 -0
- data/ext/multi_compress/vendor/zstd/lib/common/pool.h +90 -0
- data/ext/multi_compress/vendor/zstd/lib/common/portability_macros.h +158 -0
- data/ext/multi_compress/vendor/zstd/lib/common/threading.c +182 -0
- data/ext/multi_compress/vendor/zstd/lib/common/threading.h +150 -0
- data/ext/multi_compress/vendor/zstd/lib/common/xxhash.c +18 -0
- data/ext/multi_compress/vendor/zstd/lib/common/xxhash.h +7020 -0
- data/ext/multi_compress/vendor/zstd/lib/common/zstd_common.c +48 -0
- data/ext/multi_compress/vendor/zstd/lib/common/zstd_deps.h +111 -0
- data/ext/multi_compress/vendor/zstd/lib/common/zstd_internal.h +392 -0
- data/ext/multi_compress/vendor/zstd/lib/common/zstd_trace.h +163 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/clevels.h +134 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/fse_compress.c +625 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/hist.c +181 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/hist.h +75 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/huf_compress.c +1464 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress.c +7153 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_internal.h +1534 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_literals.c +235 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_literals.h +39 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_sequences.c +442 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_sequences.h +54 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_superblock.c +688 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_compress_superblock.h +32 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_cwksp.h +748 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_double_fast.c +770 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_double_fast.h +50 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_fast.c +968 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_fast.h +38 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_lazy.c +2199 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_lazy.h +202 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_ldm.c +730 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_ldm.h +117 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_ldm_geartab.h +106 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_opt.c +1576 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstd_opt.h +80 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstdmt_compress.c +1882 -0
- data/ext/multi_compress/vendor/zstd/lib/compress/zstdmt_compress.h +113 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/huf_decompress.c +1944 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/huf_decompress_amd64.S +595 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/zstd_ddict.c +244 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/zstd_ddict.h +44 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/zstd_decompress.c +2407 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/zstd_decompress_block.c +2215 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/zstd_decompress_block.h +73 -0
- data/ext/multi_compress/vendor/zstd/lib/decompress/zstd_decompress_internal.h +240 -0
- data/ext/multi_compress/vendor/zstd/lib/deprecated/zbuff.h +214 -0
- data/ext/multi_compress/vendor/zstd/lib/deprecated/zbuff_common.c +26 -0
- data/ext/multi_compress/vendor/zstd/lib/deprecated/zbuff_compress.c +167 -0
- data/ext/multi_compress/vendor/zstd/lib/deprecated/zbuff_decompress.c +77 -0
- data/ext/multi_compress/vendor/zstd/lib/dictBuilder/cover.c +1261 -0
- data/ext/multi_compress/vendor/zstd/lib/dictBuilder/cover.h +152 -0
- data/ext/multi_compress/vendor/zstd/lib/dictBuilder/divsufsort.c +1913 -0
- data/ext/multi_compress/vendor/zstd/lib/dictBuilder/divsufsort.h +67 -0
- data/ext/multi_compress/vendor/zstd/lib/dictBuilder/fastcover.c +766 -0
- data/ext/multi_compress/vendor/zstd/lib/dictBuilder/zdict.c +1133 -0
- data/ext/multi_compress/vendor/zstd/lib/dll/example/Makefile +48 -0
- data/ext/multi_compress/vendor/zstd/lib/dll/example/README.md +63 -0
- data/ext/multi_compress/vendor/zstd/lib/dll/example/build_package.bat +20 -0
- data/ext/multi_compress/vendor/zstd/lib/dll/example/fullbench-dll.sln +25 -0
- data/ext/multi_compress/vendor/zstd/lib/dll/example/fullbench-dll.vcxproj +181 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_legacy.h +452 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v01.c +2127 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v01.h +94 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v02.c +3465 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v02.h +93 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v03.c +3105 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v03.h +93 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v04.c +3598 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v04.h +142 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v05.c +4005 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v05.h +162 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v06.c +4106 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v06.h +172 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v07.c +4490 -0
- data/ext/multi_compress/vendor/zstd/lib/legacy/zstd_v07.h +187 -0
- data/ext/multi_compress/vendor/zstd/lib/libzstd.mk +237 -0
- data/ext/multi_compress/vendor/zstd/lib/libzstd.pc.in +16 -0
- data/ext/multi_compress/vendor/zstd/lib/module.modulemap +35 -0
- data/ext/multi_compress/vendor/zstd/lib/zdict.h +474 -0
- data/ext/multi_compress/vendor/zstd/lib/zstd.h +3089 -0
- data/ext/multi_compress/vendor/zstd/lib/zstd_errors.h +114 -0
- data/lib/multi_compress/version.rb +5 -0
- data/lib/multi_compress.rb +329 -0
- metadata +322 -0
|
@@ -0,0 +1,217 @@
|
|
|
1
|
+
/* Copyright 2013 Google Inc. All Rights Reserved.
|
|
2
|
+
|
|
3
|
+
Distributed under MIT license.
|
|
4
|
+
See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
|
|
5
|
+
*/
|
|
6
|
+
|
|
7
|
+
/* Block split point selection utilities. */
|
|
8
|
+
|
|
9
|
+
#include "block_splitter.h"
|
|
10
|
+
|
|
11
|
+
#include <string.h> /* memcpy, memset */
|
|
12
|
+
|
|
13
|
+
#include "../common/platform.h"
|
|
14
|
+
#include "bit_cost.h"
|
|
15
|
+
#include "cluster.h"
|
|
16
|
+
#include "command.h"
|
|
17
|
+
#include "fast_log.h"
|
|
18
|
+
#include "histogram.h"
|
|
19
|
+
#include "memory.h"
|
|
20
|
+
#include "quality.h"
|
|
21
|
+
|
|
22
|
+
#if defined(__cplusplus) || defined(c_plusplus)
|
|
23
|
+
extern "C" {
|
|
24
|
+
#endif
|
|
25
|
+
|
|
26
|
+
static const size_t kMaxLiteralHistograms = 100;
|
|
27
|
+
static const size_t kMaxCommandHistograms = 50;
|
|
28
|
+
static const double kLiteralBlockSwitchCost = 28.1;
|
|
29
|
+
static const double kCommandBlockSwitchCost = 13.5;
|
|
30
|
+
static const double kDistanceBlockSwitchCost = 14.6;
|
|
31
|
+
static const size_t kLiteralStrideLength = 70;
|
|
32
|
+
static const size_t kCommandStrideLength = 40;
|
|
33
|
+
static const size_t kDistanceStrideLength = 40;
|
|
34
|
+
static const size_t kSymbolsPerLiteralHistogram = 544;
|
|
35
|
+
static const size_t kSymbolsPerCommandHistogram = 530;
|
|
36
|
+
static const size_t kSymbolsPerDistanceHistogram = 544;
|
|
37
|
+
static const size_t kMinLengthForBlockSplitting = 128;
|
|
38
|
+
static const size_t kIterMulForRefining = 2;
|
|
39
|
+
static const size_t kMinItersForRefining = 100;
|
|
40
|
+
|
|
41
|
+
static size_t CountLiterals(const Command* cmds, const size_t num_commands) {
|
|
42
|
+
/* Count how many we have. */
|
|
43
|
+
size_t total_length = 0;
|
|
44
|
+
size_t i;
|
|
45
|
+
for (i = 0; i < num_commands; ++i) {
|
|
46
|
+
total_length += cmds[i].insert_len_;
|
|
47
|
+
}
|
|
48
|
+
return total_length;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
static void CopyLiteralsToByteArray(const Command* cmds,
|
|
52
|
+
const size_t num_commands,
|
|
53
|
+
const uint8_t* data,
|
|
54
|
+
const size_t offset,
|
|
55
|
+
const size_t mask,
|
|
56
|
+
uint8_t* literals) {
|
|
57
|
+
size_t pos = 0;
|
|
58
|
+
size_t from_pos = offset & mask;
|
|
59
|
+
size_t i;
|
|
60
|
+
for (i = 0; i < num_commands; ++i) {
|
|
61
|
+
size_t insert_len = cmds[i].insert_len_;
|
|
62
|
+
if (from_pos + insert_len > mask) {
|
|
63
|
+
size_t head_size = mask + 1 - from_pos;
|
|
64
|
+
memcpy(literals + pos, data + from_pos, head_size);
|
|
65
|
+
from_pos = 0;
|
|
66
|
+
pos += head_size;
|
|
67
|
+
insert_len -= head_size;
|
|
68
|
+
}
|
|
69
|
+
if (insert_len > 0) {
|
|
70
|
+
memcpy(literals + pos, data + from_pos, insert_len);
|
|
71
|
+
pos += insert_len;
|
|
72
|
+
}
|
|
73
|
+
from_pos = (from_pos + insert_len + CommandCopyLen(&cmds[i])) & mask;
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
static BROTLI_INLINE uint32_t MyRand(uint32_t* seed) {
|
|
78
|
+
/* Initial seed should be 7. In this case, loop length is (1 << 29). */
|
|
79
|
+
*seed *= 16807U;
|
|
80
|
+
return *seed;
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
static BROTLI_INLINE double BitCost(size_t count) {
|
|
84
|
+
return count == 0 ? -2.0 : FastLog2(count);
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
#define HISTOGRAMS_PER_BATCH 64
|
|
88
|
+
#define CLUSTERS_PER_BATCH 16
|
|
89
|
+
|
|
90
|
+
#define FN(X) X ## Literal
|
|
91
|
+
#define DataType uint8_t
|
|
92
|
+
/* NOLINTNEXTLINE(build/include) */
|
|
93
|
+
#include "block_splitter_inc.h"
|
|
94
|
+
#undef DataType
|
|
95
|
+
#undef FN
|
|
96
|
+
|
|
97
|
+
#define FN(X) X ## Command
|
|
98
|
+
#define DataType uint16_t
|
|
99
|
+
/* NOLINTNEXTLINE(build/include) */
|
|
100
|
+
#include "block_splitter_inc.h"
|
|
101
|
+
#undef FN
|
|
102
|
+
|
|
103
|
+
#define FN(X) X ## Distance
|
|
104
|
+
/* NOLINTNEXTLINE(build/include) */
|
|
105
|
+
#include "block_splitter_inc.h"
|
|
106
|
+
#undef DataType
|
|
107
|
+
#undef FN
|
|
108
|
+
|
|
109
|
+
void BrotliInitBlockSplit(BlockSplit* self) {
|
|
110
|
+
self->num_types = 0;
|
|
111
|
+
self->num_blocks = 0;
|
|
112
|
+
self->types = 0;
|
|
113
|
+
self->lengths = 0;
|
|
114
|
+
self->types_alloc_size = 0;
|
|
115
|
+
self->lengths_alloc_size = 0;
|
|
116
|
+
}
|
|
117
|
+
|
|
118
|
+
void BrotliDestroyBlockSplit(MemoryManager* m, BlockSplit* self) {
|
|
119
|
+
BROTLI_FREE(m, self->types);
|
|
120
|
+
BROTLI_FREE(m, self->lengths);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
/* Extracts literals, command distance and prefix codes, then applies
|
|
124
|
+
* SplitByteVector to create partitioning. */
|
|
125
|
+
void BrotliSplitBlock(MemoryManager* m,
|
|
126
|
+
const Command* cmds,
|
|
127
|
+
const size_t num_commands,
|
|
128
|
+
const uint8_t* data,
|
|
129
|
+
const size_t pos,
|
|
130
|
+
const size_t mask,
|
|
131
|
+
const BrotliEncoderParams* params,
|
|
132
|
+
BlockSplit* literal_split,
|
|
133
|
+
BlockSplit* insert_and_copy_split,
|
|
134
|
+
BlockSplit* dist_split) {
|
|
135
|
+
{
|
|
136
|
+
size_t literals_count = CountLiterals(cmds, num_commands);
|
|
137
|
+
uint8_t* literals = BROTLI_ALLOC(m, uint8_t, literals_count);
|
|
138
|
+
if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literals)) return;
|
|
139
|
+
/* Create a continuous array of literals. */
|
|
140
|
+
CopyLiteralsToByteArray(cmds, num_commands, data, pos, mask, literals);
|
|
141
|
+
/* Create the block split on the array of literals.
|
|
142
|
+
* Literal histograms can have alphabet size up to 256.
|
|
143
|
+
* Though, to accomodate context modeling, less than half of maximum size
|
|
144
|
+
* is allowed. */
|
|
145
|
+
SplitByteVectorLiteral(
|
|
146
|
+
m, literals, literals_count,
|
|
147
|
+
kSymbolsPerLiteralHistogram, kMaxLiteralHistograms,
|
|
148
|
+
kLiteralStrideLength, kLiteralBlockSwitchCost, params,
|
|
149
|
+
literal_split);
|
|
150
|
+
if (BROTLI_IS_OOM(m)) return;
|
|
151
|
+
BROTLI_FREE(m, literals);
|
|
152
|
+
/* NB: this might be a good place for injecting extra splitting without
|
|
153
|
+
* increasing encoder complexity; however, output parition would be less
|
|
154
|
+
* optimal than one produced with forced splitting inside
|
|
155
|
+
* SplitByteVector (FindBlocks / ClusterBlocks). */
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
{
|
|
159
|
+
/* Compute prefix codes for commands. */
|
|
160
|
+
uint16_t* insert_and_copy_codes = BROTLI_ALLOC(m, uint16_t, num_commands);
|
|
161
|
+
size_t i;
|
|
162
|
+
if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(insert_and_copy_codes)) return;
|
|
163
|
+
for (i = 0; i < num_commands; ++i) {
|
|
164
|
+
insert_and_copy_codes[i] = cmds[i].cmd_prefix_;
|
|
165
|
+
}
|
|
166
|
+
/* Create the block split on the array of command prefixes. */
|
|
167
|
+
SplitByteVectorCommand(
|
|
168
|
+
m, insert_and_copy_codes, num_commands,
|
|
169
|
+
kSymbolsPerCommandHistogram, kMaxCommandHistograms,
|
|
170
|
+
kCommandStrideLength, kCommandBlockSwitchCost, params,
|
|
171
|
+
insert_and_copy_split);
|
|
172
|
+
if (BROTLI_IS_OOM(m)) return;
|
|
173
|
+
/* TODO(eustas): reuse for distances? */
|
|
174
|
+
BROTLI_FREE(m, insert_and_copy_codes);
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
{
|
|
178
|
+
/* Create a continuous array of distance prefixes. */
|
|
179
|
+
uint16_t* distance_prefixes = BROTLI_ALLOC(m, uint16_t, num_commands);
|
|
180
|
+
size_t j = 0;
|
|
181
|
+
size_t i;
|
|
182
|
+
if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(distance_prefixes)) return;
|
|
183
|
+
for (i = 0; i < num_commands; ++i) {
|
|
184
|
+
const Command* cmd = &cmds[i];
|
|
185
|
+
if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {
|
|
186
|
+
distance_prefixes[j++] = cmd->dist_prefix_ & 0x3FF;
|
|
187
|
+
}
|
|
188
|
+
}
|
|
189
|
+
/* Create the block split on the array of distance prefixes. */
|
|
190
|
+
SplitByteVectorDistance(
|
|
191
|
+
m, distance_prefixes, j,
|
|
192
|
+
kSymbolsPerDistanceHistogram, kMaxCommandHistograms,
|
|
193
|
+
kDistanceStrideLength, kDistanceBlockSwitchCost, params,
|
|
194
|
+
dist_split);
|
|
195
|
+
if (BROTLI_IS_OOM(m)) return;
|
|
196
|
+
BROTLI_FREE(m, distance_prefixes);
|
|
197
|
+
}
|
|
198
|
+
}
|
|
199
|
+
|
|
200
|
+
#if defined(BROTLI_TEST)
|
|
201
|
+
size_t CountLiteralsForTest(const Command*, const size_t);
|
|
202
|
+
size_t CountLiteralsForTest(const Command* cmds, const size_t num_commands) {
|
|
203
|
+
return CountLiterals(cmds, num_commands);
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
void CopyLiteralsToByteArrayForTest(const Command*,
|
|
207
|
+
const size_t, const uint8_t*, const size_t, const size_t, uint8_t*);
|
|
208
|
+
void CopyLiteralsToByteArrayForTest(const Command* cmds,
|
|
209
|
+
const size_t num_commands, const uint8_t* data, const size_t offset,
|
|
210
|
+
const size_t mask, uint8_t* literals) {
|
|
211
|
+
CopyLiteralsToByteArray(cmds, num_commands, data, offset, mask, literals);
|
|
212
|
+
}
|
|
213
|
+
#endif
|
|
214
|
+
|
|
215
|
+
#if defined(__cplusplus) || defined(c_plusplus)
|
|
216
|
+
} /* extern "C" */
|
|
217
|
+
#endif
|
|
@@ -0,0 +1,52 @@
|
|
|
1
|
+
/* Copyright 2013 Google Inc. All Rights Reserved.
|
|
2
|
+
|
|
3
|
+
Distributed under MIT license.
|
|
4
|
+
See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
|
|
5
|
+
*/
|
|
6
|
+
|
|
7
|
+
/* Block split point selection utilities. */
|
|
8
|
+
|
|
9
|
+
#ifndef BROTLI_ENC_BLOCK_SPLITTER_H_
|
|
10
|
+
#define BROTLI_ENC_BLOCK_SPLITTER_H_
|
|
11
|
+
|
|
12
|
+
#include <brotli/types.h>
|
|
13
|
+
|
|
14
|
+
#include "../common/platform.h"
|
|
15
|
+
#include "command.h"
|
|
16
|
+
#include "memory.h"
|
|
17
|
+
#include "quality.h"
|
|
18
|
+
|
|
19
|
+
#if defined(__cplusplus) || defined(c_plusplus)
|
|
20
|
+
extern "C" {
|
|
21
|
+
#endif
|
|
22
|
+
|
|
23
|
+
typedef struct BlockSplit {
|
|
24
|
+
size_t num_types; /* Amount of distinct types */
|
|
25
|
+
size_t num_blocks; /* Amount of values in types and length */
|
|
26
|
+
uint8_t* types;
|
|
27
|
+
uint32_t* lengths;
|
|
28
|
+
|
|
29
|
+
size_t types_alloc_size;
|
|
30
|
+
size_t lengths_alloc_size;
|
|
31
|
+
} BlockSplit;
|
|
32
|
+
|
|
33
|
+
BROTLI_INTERNAL void BrotliInitBlockSplit(BlockSplit* self);
|
|
34
|
+
BROTLI_INTERNAL void BrotliDestroyBlockSplit(MemoryManager* m,
|
|
35
|
+
BlockSplit* self);
|
|
36
|
+
|
|
37
|
+
BROTLI_INTERNAL void BrotliSplitBlock(MemoryManager* m,
|
|
38
|
+
const Command* cmds,
|
|
39
|
+
const size_t num_commands,
|
|
40
|
+
const uint8_t* data,
|
|
41
|
+
const size_t offset,
|
|
42
|
+
const size_t mask,
|
|
43
|
+
const BrotliEncoderParams* params,
|
|
44
|
+
BlockSplit* literal_split,
|
|
45
|
+
BlockSplit* insert_and_copy_split,
|
|
46
|
+
BlockSplit* dist_split);
|
|
47
|
+
|
|
48
|
+
#if defined(__cplusplus) || defined(c_plusplus)
|
|
49
|
+
} /* extern "C" */
|
|
50
|
+
#endif
|
|
51
|
+
|
|
52
|
+
#endif /* BROTLI_ENC_BLOCK_SPLITTER_H_ */
|