isomorfeus-ferret 0.12.5 → 0.13.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/LICENSE +101 -19
- data/README.md +54 -4
- data/ext/isomorfeus_ferret_ext/bm_bitvector.c +22 -30
- data/ext/isomorfeus_ferret_ext/bm_hash.c +6 -12
- data/ext/isomorfeus_ferret_ext/bm_micro_string.c +3 -6
- data/ext/isomorfeus_ferret_ext/bm_store.c +11 -22
- data/ext/isomorfeus_ferret_ext/brotli_common_constants.c +15 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_constants.h +200 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_context.c +156 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_context.h +113 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_dictionary.c +5914 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_dictionary.h +64 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_platform.c +22 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_platform.h +594 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_transform.c +291 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_transform.h +85 -0
- data/ext/isomorfeus_ferret_ext/brotli_common_version.h +26 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_bit_reader.c +76 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_bit_reader.h +351 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_decode.c +2608 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_huffman.c +339 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_huffman.h +121 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_prefix.h +732 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_state.c +159 -0
- data/ext/isomorfeus_ferret_ext/brotli_dec_state.h +365 -0
- data/ext/isomorfeus_ferret_ext/brotli_decode.h +344 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_backward_references.c +145 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_backward_references.h +39 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_backward_references_hq.c +843 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_backward_references_hq.h +95 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_backward_references_inc.h +163 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_bit_cost.c +35 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_bit_cost.h +63 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_bit_cost_inc.h +127 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_block_encoder_inc.h +34 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_block_splitter.c +194 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_block_splitter.h +51 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_block_splitter_inc.h +440 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_brotli_bit_stream.c +1314 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_brotli_bit_stream.h +84 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_cluster.c +56 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_cluster.h +48 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_cluster_inc.h +320 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_command.c +28 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_command.h +190 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_compress_fragment.c +790 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_compress_fragment.h +61 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_compress_fragment_two_pass.c +645 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_compress_fragment_two_pass.h +54 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_dictionary_hash.c +1846 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_dictionary_hash.h +25 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_encode.c +1927 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_encoder_dict.c +33 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_encoder_dict.h +43 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_entropy_encode.c +503 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_entropy_encode.h +122 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_entropy_encode_static.h +539 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_fast_log.c +105 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_fast_log.h +66 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_find_match_length.h +79 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash.h +488 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_composite_inc.h +125 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_forgetful_chain_inc.h +293 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_longest_match64_inc.h +267 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_longest_match_inc.h +262 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_longest_match_quickly_inc.h +266 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_rolling_inc.h +212 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_hash_to_binary_tree_inc.h +329 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_histogram.c +100 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_histogram.h +63 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_histogram_inc.h +51 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_literal_cost.c +175 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_literal_cost.h +30 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_memory.c +170 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_memory.h +114 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_metablock.c +663 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_metablock.h +105 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_metablock_inc.h +183 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_params.h +46 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_prefix.h +53 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_quality.h +165 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_ringbuffer.h +167 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_static_dict.c +486 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_static_dict.h +40 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_static_dict_lut.h +5864 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_utf8_util.c +85 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_utf8_util.h +32 -0
- data/ext/isomorfeus_ferret_ext/brotli_enc_write_bits.h +87 -0
- data/ext/isomorfeus_ferret_ext/brotli_encode.h +448 -0
- data/ext/isomorfeus_ferret_ext/brotli_port.h +288 -0
- data/ext/isomorfeus_ferret_ext/brotli_types.h +83 -0
- data/ext/isomorfeus_ferret_ext/bzip_blocksort.c +1094 -0
- data/ext/isomorfeus_ferret_ext/bzip_huffman.c +205 -0
- data/ext/isomorfeus_ferret_ext/bzlib.c +1572 -0
- data/ext/isomorfeus_ferret_ext/bzlib.h +282 -0
- data/ext/isomorfeus_ferret_ext/bzlib_compress.c +672 -0
- data/ext/isomorfeus_ferret_ext/bzlib_crctable.c +104 -0
- data/ext/isomorfeus_ferret_ext/bzlib_decompress.c +652 -0
- data/ext/isomorfeus_ferret_ext/bzlib_private.h +509 -0
- data/ext/isomorfeus_ferret_ext/bzlib_randtable.c +84 -0
- data/ext/isomorfeus_ferret_ext/fio_tmpfile.h +53 -53
- data/ext/isomorfeus_ferret_ext/frb_analysis.c +785 -1192
- data/ext/isomorfeus_ferret_ext/frb_index.c +513 -464
- data/ext/isomorfeus_ferret_ext/frb_qparser.c +48 -60
- data/ext/isomorfeus_ferret_ext/frb_search.c +1520 -1002
- data/ext/isomorfeus_ferret_ext/frb_store.c +96 -96
- data/ext/isomorfeus_ferret_ext/frb_threading.h +0 -1
- data/ext/isomorfeus_ferret_ext/frb_utils.c +147 -196
- data/ext/isomorfeus_ferret_ext/frt_analysis.c +695 -1090
- data/ext/isomorfeus_ferret_ext/frt_analysis.h +174 -170
- data/ext/isomorfeus_ferret_ext/frt_array.c +2 -4
- data/ext/isomorfeus_ferret_ext/frt_bitvector.c +9 -16
- data/ext/isomorfeus_ferret_ext/frt_bitvector.h +32 -81
- data/ext/isomorfeus_ferret_ext/frt_document.c +15 -20
- data/ext/isomorfeus_ferret_ext/frt_document.h +10 -9
- data/ext/isomorfeus_ferret_ext/frt_except.c +5 -12
- data/ext/isomorfeus_ferret_ext/frt_field_index.c +3 -3
- data/ext/isomorfeus_ferret_ext/frt_field_index.h +6 -7
- data/ext/isomorfeus_ferret_ext/frt_filter.c +35 -46
- data/ext/isomorfeus_ferret_ext/frt_fs_store.c +2 -0
- data/ext/isomorfeus_ferret_ext/frt_global.c +105 -63
- data/ext/isomorfeus_ferret_ext/frt_global.h +7 -3
- data/ext/isomorfeus_ferret_ext/frt_hash.c +1 -2
- data/ext/isomorfeus_ferret_ext/frt_ind.c +32 -35
- data/ext/isomorfeus_ferret_ext/frt_ind.h +9 -9
- data/ext/isomorfeus_ferret_ext/frt_index.c +714 -384
- data/ext/isomorfeus_ferret_ext/frt_index.h +274 -290
- data/ext/isomorfeus_ferret_ext/frt_mempool.c +1 -2
- data/ext/isomorfeus_ferret_ext/frt_multimapper.c +4 -7
- data/ext/isomorfeus_ferret_ext/frt_q_boolean.c +67 -91
- data/ext/isomorfeus_ferret_ext/frt_q_const_score.c +35 -38
- data/ext/isomorfeus_ferret_ext/frt_q_filtered_query.c +53 -72
- data/ext/isomorfeus_ferret_ext/frt_q_fuzzy.c +25 -32
- data/ext/isomorfeus_ferret_ext/frt_q_match_all.c +21 -23
- data/ext/isomorfeus_ferret_ext/frt_q_multi_term.c +66 -103
- data/ext/isomorfeus_ferret_ext/frt_q_parser.c +207 -195
- data/ext/isomorfeus_ferret_ext/frt_q_phrase.c +26 -25
- data/ext/isomorfeus_ferret_ext/frt_q_prefix.c +17 -14
- data/ext/isomorfeus_ferret_ext/frt_q_range.c +102 -131
- data/ext/isomorfeus_ferret_ext/frt_q_span.c +179 -178
- data/ext/isomorfeus_ferret_ext/frt_q_term.c +47 -60
- data/ext/isomorfeus_ferret_ext/frt_q_wildcard.c +18 -16
- data/ext/isomorfeus_ferret_ext/frt_ram_store.c +46 -84
- data/ext/isomorfeus_ferret_ext/frt_search.c +105 -146
- data/ext/isomorfeus_ferret_ext/frt_search.h +331 -320
- data/ext/isomorfeus_ferret_ext/frt_similarity.c +5 -13
- data/ext/isomorfeus_ferret_ext/frt_similarity.h +7 -12
- data/ext/isomorfeus_ferret_ext/frt_sort.c +105 -149
- data/ext/isomorfeus_ferret_ext/frt_store.c +13 -7
- data/ext/isomorfeus_ferret_ext/frt_store.h +10 -2
- data/ext/isomorfeus_ferret_ext/frt_threading.h +0 -1
- data/ext/isomorfeus_ferret_ext/isomorfeus_ferret.c +21 -109
- data/ext/isomorfeus_ferret_ext/isomorfeus_ferret.h +2 -32
- data/ext/isomorfeus_ferret_ext/lz4.c +2495 -0
- data/ext/isomorfeus_ferret_ext/lz4.h +774 -0
- data/ext/isomorfeus_ferret_ext/lz4frame.c +1899 -0
- data/ext/isomorfeus_ferret_ext/lz4frame.h +623 -0
- data/ext/isomorfeus_ferret_ext/lz4hc.c +1615 -0
- data/ext/isomorfeus_ferret_ext/lz4hc.h +413 -0
- data/ext/isomorfeus_ferret_ext/lz4xxhash.c +1030 -0
- data/ext/isomorfeus_ferret_ext/lz4xxhash.h +328 -0
- data/ext/isomorfeus_ferret_ext/stem_modules.h +0 -86
- data/ext/isomorfeus_ferret_ext/test.c +1 -2
- data/ext/isomorfeus_ferret_ext/test_1710.c +11 -12
- data/ext/isomorfeus_ferret_ext/test_analysis.c +590 -583
- data/ext/isomorfeus_ferret_ext/test_compound_io.c +1 -1
- data/ext/isomorfeus_ferret_ext/test_document.c +19 -15
- data/ext/isomorfeus_ferret_ext/test_except.c +1 -2
- data/ext/isomorfeus_ferret_ext/test_fields.c +111 -100
- data/ext/isomorfeus_ferret_ext/test_file_deleter.c +10 -27
- data/ext/isomorfeus_ferret_ext/test_filter.c +11 -8
- data/ext/isomorfeus_ferret_ext/test_hash.c +2 -2
- data/ext/isomorfeus_ferret_ext/test_hashset.c +1 -1
- data/ext/isomorfeus_ferret_ext/test_highlighter.c +15 -11
- data/ext/isomorfeus_ferret_ext/test_index.c +373 -363
- data/ext/isomorfeus_ferret_ext/test_q_const_score.c +5 -3
- data/ext/isomorfeus_ferret_ext/test_q_filtered.c +5 -3
- data/ext/isomorfeus_ferret_ext/test_q_fuzzy.c +13 -10
- data/ext/isomorfeus_ferret_ext/test_q_parser.c +45 -7
- data/ext/isomorfeus_ferret_ext/test_q_span.c +15 -12
- data/ext/isomorfeus_ferret_ext/test_ram_store.c +3 -3
- data/ext/isomorfeus_ferret_ext/test_search.c +60 -62
- data/ext/isomorfeus_ferret_ext/test_segments.c +5 -4
- data/ext/isomorfeus_ferret_ext/test_sort.c +17 -14
- data/ext/isomorfeus_ferret_ext/test_store.c +2 -0
- data/ext/isomorfeus_ferret_ext/test_term.c +3 -1
- data/ext/isomorfeus_ferret_ext/test_term_vectors.c +9 -10
- data/ext/isomorfeus_ferret_ext/test_test.c +1 -2
- data/ext/isomorfeus_ferret_ext/test_threading.c +9 -10
- data/ext/isomorfeus_ferret_ext/testhelper.c +1 -2
- data/lib/isomorfeus/ferret/version.rb +1 -1
- metadata +113 -58
- data/ext/isomorfeus_ferret_ext/email.rl +0 -21
- data/ext/isomorfeus_ferret_ext/frt_scanner.c +0 -900
- data/ext/isomorfeus_ferret_ext/frt_scanner.h +0 -28
- data/ext/isomorfeus_ferret_ext/frt_scanner_mb.c +0 -6706
- data/ext/isomorfeus_ferret_ext/frt_scanner_utf8.c +0 -4420
- data/ext/isomorfeus_ferret_ext/scanner.h +0 -28
- data/ext/isomorfeus_ferret_ext/scanner.in +0 -43
- data/ext/isomorfeus_ferret_ext/scanner.rl +0 -84
- data/ext/isomorfeus_ferret_ext/scanner_mb.rl +0 -200
- data/ext/isomorfeus_ferret_ext/scanner_utf8.rl +0 -85
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_basque.c +0 -1167
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_basque.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_catalan.c +0 -1433
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_catalan.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_danish.c +0 -301
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_danish.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_dutch.c +0 -590
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_dutch.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_english.c +0 -1049
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_english.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_finnish.c +0 -705
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_finnish.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_french.c +0 -1239
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_french.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_german.c +0 -477
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_german.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_hungarian.c +0 -1217
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_hungarian.h +0 -7
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_indonesian.c +0 -394
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_indonesian.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_irish.c +0 -457
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_irish.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_italian.c +0 -1009
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_italian.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_norwegian.c +0 -259
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_norwegian.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_porter.c +0 -704
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_porter.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_portuguese.c +0 -948
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_portuguese.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_spanish.c +0 -1028
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_spanish.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_swedish.c +0 -275
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_1_swedish.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_2_hungarian.c +0 -849
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_2_hungarian.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_2_romanian.c +0 -952
- data/ext/isomorfeus_ferret_ext/stem_ISO_8859_2_romanian.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_KOI8_R_russian.c +0 -669
- data/ext/isomorfeus_ferret_ext/stem_KOI8_R_russian.h +0 -6
- data/ext/isomorfeus_ferret_ext/stem_modules.txt +0 -63
- data/ext/isomorfeus_ferret_ext/uchar-ucs4.rl +0 -1854
- data/ext/isomorfeus_ferret_ext/uchar-utf8.rl +0 -1999
- data/ext/isomorfeus_ferret_ext/url.rl +0 -27
@@ -0,0 +1,774 @@
|
|
1
|
+
/*
|
2
|
+
* LZ4 - Fast LZ compression algorithm
|
3
|
+
* Header File
|
4
|
+
* Copyright (C) 2011-present, Yann Collet.
|
5
|
+
|
6
|
+
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
7
|
+
|
8
|
+
Redistribution and use in source and binary forms, with or without
|
9
|
+
modification, are permitted provided that the following conditions are
|
10
|
+
met:
|
11
|
+
|
12
|
+
* Redistributions of source code must retain the above copyright
|
13
|
+
notice, this list of conditions and the following disclaimer.
|
14
|
+
* Redistributions in binary form must reproduce the above
|
15
|
+
copyright notice, this list of conditions and the following disclaimer
|
16
|
+
in the documentation and/or other materials provided with the
|
17
|
+
distribution.
|
18
|
+
|
19
|
+
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
20
|
+
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
21
|
+
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
22
|
+
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
23
|
+
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
24
|
+
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
25
|
+
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
26
|
+
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
27
|
+
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
28
|
+
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
29
|
+
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
30
|
+
|
31
|
+
You can contact the author at :
|
32
|
+
- LZ4 homepage : http://www.lz4.org
|
33
|
+
- LZ4 source repository : https://github.com/lz4/lz4
|
34
|
+
*/
|
35
|
+
#if defined (__cplusplus)
|
36
|
+
extern "C" {
|
37
|
+
#endif
|
38
|
+
|
39
|
+
#ifndef LZ4_H_2983827168210
|
40
|
+
#define LZ4_H_2983827168210
|
41
|
+
|
42
|
+
/* --- Dependency --- */
|
43
|
+
#include <stddef.h> /* size_t */
|
44
|
+
|
45
|
+
|
46
|
+
/**
|
47
|
+
Introduction
|
48
|
+
|
49
|
+
LZ4 is lossless compression algorithm, providing compression speed >500 MB/s per core,
|
50
|
+
scalable with multi-cores CPU. It features an extremely fast decoder, with speed in
|
51
|
+
multiple GB/s per core, typically reaching RAM speed limits on multi-core systems.
|
52
|
+
|
53
|
+
The LZ4 compression library provides in-memory compression and decompression functions.
|
54
|
+
It gives full buffer control to user.
|
55
|
+
Compression can be done in:
|
56
|
+
- a single step (described as Simple Functions)
|
57
|
+
- a single step, reusing a context (described in Advanced Functions)
|
58
|
+
- unbounded multiple steps (described as Streaming compression)
|
59
|
+
|
60
|
+
lz4.h generates and decodes LZ4-compressed blocks (doc/lz4_Block_format.md).
|
61
|
+
Decompressing such a compressed block requires additional metadata.
|
62
|
+
Exact metadata depends on exact decompression function.
|
63
|
+
For the typical case of LZ4_decompress_safe(),
|
64
|
+
metadata includes block's compressed size, and maximum bound of decompressed size.
|
65
|
+
Each application is free to encode and pass such metadata in whichever way it wants.
|
66
|
+
|
67
|
+
lz4.h only handle blocks, it can not generate Frames.
|
68
|
+
|
69
|
+
Blocks are different from Frames (doc/lz4_Frame_format.md).
|
70
|
+
Frames bundle both blocks and metadata in a specified manner.
|
71
|
+
Embedding metadata is required for compressed data to be self-contained and portable.
|
72
|
+
Frame format is delivered through a companion API, declared in lz4frame.h.
|
73
|
+
The `lz4` CLI can only manage frames.
|
74
|
+
*/
|
75
|
+
|
76
|
+
/*^***************************************************************
|
77
|
+
* Export parameters
|
78
|
+
*****************************************************************/
|
79
|
+
/*
|
80
|
+
* LZ4_DLL_EXPORT :
|
81
|
+
* Enable exporting of functions when building a Windows DLL
|
82
|
+
* LZ4LIB_VISIBILITY :
|
83
|
+
* Control library symbols visibility.
|
84
|
+
*/
|
85
|
+
#ifndef LZ4LIB_VISIBILITY
|
86
|
+
# if defined(__GNUC__) && (__GNUC__ >= 4)
|
87
|
+
# define LZ4LIB_VISIBILITY __attribute__ ((visibility ("default")))
|
88
|
+
# else
|
89
|
+
# define LZ4LIB_VISIBILITY
|
90
|
+
# endif
|
91
|
+
#endif
|
92
|
+
#if defined(LZ4_DLL_EXPORT) && (LZ4_DLL_EXPORT==1)
|
93
|
+
# define LZ4LIB_API __declspec(dllexport) LZ4LIB_VISIBILITY
|
94
|
+
#elif defined(LZ4_DLL_IMPORT) && (LZ4_DLL_IMPORT==1)
|
95
|
+
# define LZ4LIB_API __declspec(dllimport) LZ4LIB_VISIBILITY /* It isn't required but allows to generate better code, saving a function pointer load from the IAT and an indirect jump.*/
|
96
|
+
#else
|
97
|
+
# define LZ4LIB_API LZ4LIB_VISIBILITY
|
98
|
+
#endif
|
99
|
+
|
100
|
+
/*------ Version ------*/
|
101
|
+
#define LZ4_VERSION_MAJOR 1 /* for breaking interface changes */
|
102
|
+
#define LZ4_VERSION_MINOR 9 /* for new (non-breaking) interface capabilities */
|
103
|
+
#define LZ4_VERSION_RELEASE 3 /* for tweaks, bug-fixes, or development */
|
104
|
+
|
105
|
+
#define LZ4_VERSION_NUMBER (LZ4_VERSION_MAJOR *100*100 + LZ4_VERSION_MINOR *100 + LZ4_VERSION_RELEASE)
|
106
|
+
|
107
|
+
#define LZ4_LIB_VERSION LZ4_VERSION_MAJOR.LZ4_VERSION_MINOR.LZ4_VERSION_RELEASE
|
108
|
+
#define LZ4_QUOTE(str) #str
|
109
|
+
#define LZ4_EXPAND_AND_QUOTE(str) LZ4_QUOTE(str)
|
110
|
+
#define LZ4_VERSION_STRING LZ4_EXPAND_AND_QUOTE(LZ4_LIB_VERSION)
|
111
|
+
|
112
|
+
LZ4LIB_API int LZ4_versionNumber (void); /**< library version number; useful to check dll version */
|
113
|
+
LZ4LIB_API const char* LZ4_versionString (void); /**< library version string; useful to check dll version */
|
114
|
+
|
115
|
+
|
116
|
+
/*-************************************
|
117
|
+
* Tuning parameter
|
118
|
+
**************************************/
|
119
|
+
/*!
|
120
|
+
* LZ4_MEMORY_USAGE :
|
121
|
+
* Memory usage formula : N->2^N Bytes (examples : 10 -> 1KB; 12 -> 4KB ; 16 -> 64KB; 20 -> 1MB; etc.)
|
122
|
+
* Increasing memory usage improves compression ratio.
|
123
|
+
* Reduced memory usage may improve speed, thanks to better cache locality.
|
124
|
+
* Default value is 14, for 16KB, which nicely fits into Intel x86 L1 cache
|
125
|
+
*/
|
126
|
+
#ifndef LZ4_MEMORY_USAGE
|
127
|
+
# define LZ4_MEMORY_USAGE 14
|
128
|
+
#endif
|
129
|
+
|
130
|
+
|
131
|
+
/*-************************************
|
132
|
+
* Simple Functions
|
133
|
+
**************************************/
|
134
|
+
/*! LZ4_compress_default() :
|
135
|
+
* Compresses 'srcSize' bytes from buffer 'src'
|
136
|
+
* into already allocated 'dst' buffer of size 'dstCapacity'.
|
137
|
+
* Compression is guaranteed to succeed if 'dstCapacity' >= LZ4_compressBound(srcSize).
|
138
|
+
* It also runs faster, so it's a recommended setting.
|
139
|
+
* If the function cannot compress 'src' into a more limited 'dst' budget,
|
140
|
+
* compression stops *immediately*, and the function result is zero.
|
141
|
+
* In which case, 'dst' content is undefined (invalid).
|
142
|
+
* srcSize : max supported value is LZ4_MAX_INPUT_SIZE.
|
143
|
+
* dstCapacity : size of buffer 'dst' (which must be already allocated)
|
144
|
+
* @return : the number of bytes written into buffer 'dst' (necessarily <= dstCapacity)
|
145
|
+
* or 0 if compression fails
|
146
|
+
* Note : This function is protected against buffer overflow scenarios (never writes outside 'dst' buffer, nor read outside 'source' buffer).
|
147
|
+
*/
|
148
|
+
LZ4LIB_API int LZ4_compress_default(const char* src, char* dst, int srcSize, int dstCapacity);
|
149
|
+
|
150
|
+
/*! LZ4_decompress_safe() :
|
151
|
+
* compressedSize : is the exact complete size of the compressed block.
|
152
|
+
* dstCapacity : is the size of destination buffer (which must be already allocated), presumed an upper bound of decompressed size.
|
153
|
+
* @return : the number of bytes decompressed into destination buffer (necessarily <= dstCapacity)
|
154
|
+
* If destination buffer is not large enough, decoding will stop and output an error code (negative value).
|
155
|
+
* If the source stream is detected malformed, the function will stop decoding and return a negative result.
|
156
|
+
* Note 1 : This function is protected against malicious data packets :
|
157
|
+
* it will never writes outside 'dst' buffer, nor read outside 'source' buffer,
|
158
|
+
* even if the compressed block is maliciously modified to order the decoder to do these actions.
|
159
|
+
* In such case, the decoder stops immediately, and considers the compressed block malformed.
|
160
|
+
* Note 2 : compressedSize and dstCapacity must be provided to the function, the compressed block does not contain them.
|
161
|
+
* The implementation is free to send / store / derive this information in whichever way is most beneficial.
|
162
|
+
* If there is a need for a different format which bundles together both compressed data and its metadata, consider looking at lz4frame.h instead.
|
163
|
+
*/
|
164
|
+
LZ4LIB_API int LZ4_decompress_safe (const char* src, char* dst, int compressedSize, int dstCapacity);
|
165
|
+
|
166
|
+
|
167
|
+
/*-************************************
|
168
|
+
* Advanced Functions
|
169
|
+
**************************************/
|
170
|
+
#define LZ4_MAX_INPUT_SIZE 0x7E000000 /* 2 113 929 216 bytes */
|
171
|
+
#define LZ4_COMPRESSBOUND(isize) ((unsigned)(isize) > (unsigned)LZ4_MAX_INPUT_SIZE ? 0 : (isize) + ((isize)/255) + 16)
|
172
|
+
|
173
|
+
/*! LZ4_compressBound() :
|
174
|
+
Provides the maximum size that LZ4 compression may output in a "worst case" scenario (input data not compressible)
|
175
|
+
This function is primarily useful for memory allocation purposes (destination buffer size).
|
176
|
+
Macro LZ4_COMPRESSBOUND() is also provided for compilation-time evaluation (stack memory allocation for example).
|
177
|
+
Note that LZ4_compress_default() compresses faster when dstCapacity is >= LZ4_compressBound(srcSize)
|
178
|
+
inputSize : max supported value is LZ4_MAX_INPUT_SIZE
|
179
|
+
return : maximum output size in a "worst case" scenario
|
180
|
+
or 0, if input size is incorrect (too large or negative)
|
181
|
+
*/
|
182
|
+
LZ4LIB_API int LZ4_compressBound(int inputSize);
|
183
|
+
|
184
|
+
/*! LZ4_compress_fast() :
|
185
|
+
Same as LZ4_compress_default(), but allows selection of "acceleration" factor.
|
186
|
+
The larger the acceleration value, the faster the algorithm, but also the lesser the compression.
|
187
|
+
It's a trade-off. It can be fine tuned, with each successive value providing roughly +~3% to speed.
|
188
|
+
An acceleration value of "1" is the same as regular LZ4_compress_default()
|
189
|
+
Values <= 0 will be replaced by LZ4_ACCELERATION_DEFAULT (currently == 1, see lz4.c).
|
190
|
+
Values > LZ4_ACCELERATION_MAX will be replaced by LZ4_ACCELERATION_MAX (currently == 65537, see lz4.c).
|
191
|
+
*/
|
192
|
+
LZ4LIB_API int LZ4_compress_fast (const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
|
193
|
+
|
194
|
+
|
195
|
+
/*! LZ4_compress_fast_extState() :
|
196
|
+
* Same as LZ4_compress_fast(), using an externally allocated memory space for its state.
|
197
|
+
* Use LZ4_sizeofState() to know how much memory must be allocated,
|
198
|
+
* and allocate it on 8-bytes boundaries (using `malloc()` typically).
|
199
|
+
* Then, provide this buffer as `void* state` to compression function.
|
200
|
+
*/
|
201
|
+
LZ4LIB_API int LZ4_sizeofState(void);
|
202
|
+
LZ4LIB_API int LZ4_compress_fast_extState (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
|
203
|
+
|
204
|
+
|
205
|
+
/*! LZ4_compress_destSize() :
|
206
|
+
* Reverse the logic : compresses as much data as possible from 'src' buffer
|
207
|
+
* into already allocated buffer 'dst', of size >= 'targetDestSize'.
|
208
|
+
* This function either compresses the entire 'src' content into 'dst' if it's large enough,
|
209
|
+
* or fill 'dst' buffer completely with as much data as possible from 'src'.
|
210
|
+
* note: acceleration parameter is fixed to "default".
|
211
|
+
*
|
212
|
+
* *srcSizePtr : will be modified to indicate how many bytes where read from 'src' to fill 'dst'.
|
213
|
+
* New value is necessarily <= input value.
|
214
|
+
* @return : Nb bytes written into 'dst' (necessarily <= targetDestSize)
|
215
|
+
* or 0 if compression fails.
|
216
|
+
*
|
217
|
+
* Note : from v1.8.2 to v1.9.1, this function had a bug (fixed un v1.9.2+):
|
218
|
+
* the produced compressed content could, in specific circumstances,
|
219
|
+
* require to be decompressed into a destination buffer larger
|
220
|
+
* by at least 1 byte than the content to decompress.
|
221
|
+
* If an application uses `LZ4_compress_destSize()`,
|
222
|
+
* it's highly recommended to update liblz4 to v1.9.2 or better.
|
223
|
+
* If this can't be done or ensured,
|
224
|
+
* the receiving decompression function should provide
|
225
|
+
* a dstCapacity which is > decompressedSize, by at least 1 byte.
|
226
|
+
* See https://github.com/lz4/lz4/issues/859 for details
|
227
|
+
*/
|
228
|
+
LZ4LIB_API int LZ4_compress_destSize (const char* src, char* dst, int* srcSizePtr, int targetDstSize);
|
229
|
+
|
230
|
+
|
231
|
+
/*! LZ4_decompress_safe_partial() :
|
232
|
+
* Decompress an LZ4 compressed block, of size 'srcSize' at position 'src',
|
233
|
+
* into destination buffer 'dst' of size 'dstCapacity'.
|
234
|
+
* Up to 'targetOutputSize' bytes will be decoded.
|
235
|
+
* The function stops decoding on reaching this objective.
|
236
|
+
* This can be useful to boost performance
|
237
|
+
* whenever only the beginning of a block is required.
|
238
|
+
*
|
239
|
+
* @return : the number of bytes decoded in `dst` (necessarily <= targetOutputSize)
|
240
|
+
* If source stream is detected malformed, function returns a negative result.
|
241
|
+
*
|
242
|
+
* Note 1 : @return can be < targetOutputSize, if compressed block contains less data.
|
243
|
+
*
|
244
|
+
* Note 2 : targetOutputSize must be <= dstCapacity
|
245
|
+
*
|
246
|
+
* Note 3 : this function effectively stops decoding on reaching targetOutputSize,
|
247
|
+
* so dstCapacity is kind of redundant.
|
248
|
+
* This is because in older versions of this function,
|
249
|
+
* decoding operation would still write complete sequences.
|
250
|
+
* Therefore, there was no guarantee that it would stop writing at exactly targetOutputSize,
|
251
|
+
* it could write more bytes, though only up to dstCapacity.
|
252
|
+
* Some "margin" used to be required for this operation to work properly.
|
253
|
+
* Thankfully, this is no longer necessary.
|
254
|
+
* The function nonetheless keeps the same signature, in an effort to preserve API compatibility.
|
255
|
+
*
|
256
|
+
* Note 4 : If srcSize is the exact size of the block,
|
257
|
+
* then targetOutputSize can be any value,
|
258
|
+
* including larger than the block's decompressed size.
|
259
|
+
* The function will, at most, generate block's decompressed size.
|
260
|
+
*
|
261
|
+
* Note 5 : If srcSize is _larger_ than block's compressed size,
|
262
|
+
* then targetOutputSize **MUST** be <= block's decompressed size.
|
263
|
+
* Otherwise, *silent corruption will occur*.
|
264
|
+
*/
|
265
|
+
LZ4LIB_API int LZ4_decompress_safe_partial (const char* src, char* dst, int srcSize, int targetOutputSize, int dstCapacity);
|
266
|
+
|
267
|
+
|
268
|
+
/*-*********************************************
|
269
|
+
* Streaming Compression Functions
|
270
|
+
***********************************************/
|
271
|
+
typedef union LZ4_stream_u LZ4_stream_t; /* incomplete type (defined later) */
|
272
|
+
|
273
|
+
LZ4LIB_API LZ4_stream_t* LZ4_createStream(void);
|
274
|
+
LZ4LIB_API int LZ4_freeStream (LZ4_stream_t* streamPtr);
|
275
|
+
|
276
|
+
/*! LZ4_resetStream_fast() : v1.9.0+
|
277
|
+
* Use this to prepare an LZ4_stream_t for a new chain of dependent blocks
|
278
|
+
* (e.g., LZ4_compress_fast_continue()).
|
279
|
+
*
|
280
|
+
* An LZ4_stream_t must be initialized once before usage.
|
281
|
+
* This is automatically done when created by LZ4_createStream().
|
282
|
+
* However, should the LZ4_stream_t be simply declared on stack (for example),
|
283
|
+
* it's necessary to initialize it first, using LZ4_initStream().
|
284
|
+
*
|
285
|
+
* After init, start any new stream with LZ4_resetStream_fast().
|
286
|
+
* A same LZ4_stream_t can be re-used multiple times consecutively
|
287
|
+
* and compress multiple streams,
|
288
|
+
* provided that it starts each new stream with LZ4_resetStream_fast().
|
289
|
+
*
|
290
|
+
* LZ4_resetStream_fast() is much faster than LZ4_initStream(),
|
291
|
+
* but is not compatible with memory regions containing garbage data.
|
292
|
+
*
|
293
|
+
* Note: it's only useful to call LZ4_resetStream_fast()
|
294
|
+
* in the context of streaming compression.
|
295
|
+
* The *extState* functions perform their own resets.
|
296
|
+
* Invoking LZ4_resetStream_fast() before is redundant, and even counterproductive.
|
297
|
+
*/
|
298
|
+
LZ4LIB_API void LZ4_resetStream_fast (LZ4_stream_t* streamPtr);
|
299
|
+
|
300
|
+
/*! LZ4_loadDict() :
|
301
|
+
* Use this function to reference a static dictionary into LZ4_stream_t.
|
302
|
+
* The dictionary must remain available during compression.
|
303
|
+
* LZ4_loadDict() triggers a reset, so any previous data will be forgotten.
|
304
|
+
* The same dictionary will have to be loaded on decompression side for successful decoding.
|
305
|
+
* Dictionary are useful for better compression of small data (KB range).
|
306
|
+
* While LZ4 accept any input as dictionary,
|
307
|
+
* results are generally better when using Zstandard's Dictionary Builder.
|
308
|
+
* Loading a size of 0 is allowed, and is the same as reset.
|
309
|
+
* @return : loaded dictionary size, in bytes (necessarily <= 64 KB)
|
310
|
+
*/
|
311
|
+
LZ4LIB_API int LZ4_loadDict (LZ4_stream_t* streamPtr, const char* dictionary, int dictSize);
|
312
|
+
|
313
|
+
/*! LZ4_compress_fast_continue() :
|
314
|
+
* Compress 'src' content using data from previously compressed blocks, for better compression ratio.
|
315
|
+
* 'dst' buffer must be already allocated.
|
316
|
+
* If dstCapacity >= LZ4_compressBound(srcSize), compression is guaranteed to succeed, and runs faster.
|
317
|
+
*
|
318
|
+
* @return : size of compressed block
|
319
|
+
* or 0 if there is an error (typically, cannot fit into 'dst').
|
320
|
+
*
|
321
|
+
* Note 1 : Each invocation to LZ4_compress_fast_continue() generates a new block.
|
322
|
+
* Each block has precise boundaries.
|
323
|
+
* Each block must be decompressed separately, calling LZ4_decompress_*() with relevant metadata.
|
324
|
+
* It's not possible to append blocks together and expect a single invocation of LZ4_decompress_*() to decompress them together.
|
325
|
+
*
|
326
|
+
* Note 2 : The previous 64KB of source data is __assumed__ to remain present, unmodified, at same address in memory !
|
327
|
+
*
|
328
|
+
* Note 3 : When input is structured as a double-buffer, each buffer can have any size, including < 64 KB.
|
329
|
+
* Make sure that buffers are separated, by at least one byte.
|
330
|
+
* This construction ensures that each block only depends on previous block.
|
331
|
+
*
|
332
|
+
* Note 4 : If input buffer is a ring-buffer, it can have any size, including < 64 KB.
|
333
|
+
*
|
334
|
+
* Note 5 : After an error, the stream status is undefined (invalid), it can only be reset or freed.
|
335
|
+
*/
|
336
|
+
LZ4LIB_API int LZ4_compress_fast_continue (LZ4_stream_t* streamPtr, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
|
337
|
+
|
338
|
+
/*! LZ4_saveDict() :
|
339
|
+
* If last 64KB data cannot be guaranteed to remain available at its current memory location,
|
340
|
+
* save it into a safer place (char* safeBuffer).
|
341
|
+
* This is schematically equivalent to a memcpy() followed by LZ4_loadDict(),
|
342
|
+
* but is much faster, because LZ4_saveDict() doesn't need to rebuild tables.
|
343
|
+
* @return : saved dictionary size in bytes (necessarily <= maxDictSize), or 0 if error.
|
344
|
+
*/
|
345
|
+
LZ4LIB_API int LZ4_saveDict (LZ4_stream_t* streamPtr, char* safeBuffer, int maxDictSize);
|
346
|
+
|
347
|
+
|
348
|
+
/*-**********************************************
|
349
|
+
* Streaming Decompression Functions
|
350
|
+
* Bufferless synchronous API
|
351
|
+
************************************************/
|
352
|
+
typedef union LZ4_streamDecode_u LZ4_streamDecode_t; /* tracking context */
|
353
|
+
|
354
|
+
/*! LZ4_createStreamDecode() and LZ4_freeStreamDecode() :
|
355
|
+
* creation / destruction of streaming decompression tracking context.
|
356
|
+
* A tracking context can be re-used multiple times.
|
357
|
+
*/
|
358
|
+
LZ4LIB_API LZ4_streamDecode_t* LZ4_createStreamDecode(void);
|
359
|
+
LZ4LIB_API int LZ4_freeStreamDecode (LZ4_streamDecode_t* LZ4_stream);
|
360
|
+
|
361
|
+
/*! LZ4_setStreamDecode() :
|
362
|
+
* An LZ4_streamDecode_t context can be allocated once and re-used multiple times.
|
363
|
+
* Use this function to start decompression of a new stream of blocks.
|
364
|
+
* A dictionary can optionally be set. Use NULL or size 0 for a reset order.
|
365
|
+
* Dictionary is presumed stable : it must remain accessible and unmodified during next decompression.
|
366
|
+
* @return : 1 if OK, 0 if error
|
367
|
+
*/
|
368
|
+
LZ4LIB_API int LZ4_setStreamDecode (LZ4_streamDecode_t* LZ4_streamDecode, const char* dictionary, int dictSize);
|
369
|
+
|
370
|
+
/*! LZ4_decoderRingBufferSize() : v1.8.2+
|
371
|
+
* Note : in a ring buffer scenario (optional),
|
372
|
+
* blocks are presumed decompressed next to each other
|
373
|
+
* up to the moment there is not enough remaining space for next block (remainingSize < maxBlockSize),
|
374
|
+
* at which stage it resumes from beginning of ring buffer.
|
375
|
+
* When setting such a ring buffer for streaming decompression,
|
376
|
+
* provides the minimum size of this ring buffer
|
377
|
+
* to be compatible with any source respecting maxBlockSize condition.
|
378
|
+
* @return : minimum ring buffer size,
|
379
|
+
* or 0 if there is an error (invalid maxBlockSize).
|
380
|
+
*/
|
381
|
+
LZ4LIB_API int LZ4_decoderRingBufferSize(int maxBlockSize);
|
382
|
+
#define LZ4_DECODER_RING_BUFFER_SIZE(maxBlockSize) (65536 + 14 + (maxBlockSize)) /* for static allocation; maxBlockSize presumed valid */
|
383
|
+
|
384
|
+
/*! LZ4_decompress_*_continue() :
|
385
|
+
* These decoding functions allow decompression of consecutive blocks in "streaming" mode.
|
386
|
+
* A block is an unsplittable entity, it must be presented entirely to a decompression function.
|
387
|
+
* Decompression functions only accepts one block at a time.
|
388
|
+
* The last 64KB of previously decoded data *must* remain available and unmodified at the memory position where they were decoded.
|
389
|
+
* If less than 64KB of data has been decoded, all the data must be present.
|
390
|
+
*
|
391
|
+
* Special : if decompression side sets a ring buffer, it must respect one of the following conditions :
|
392
|
+
* - Decompression buffer size is _at least_ LZ4_decoderRingBufferSize(maxBlockSize).
|
393
|
+
* maxBlockSize is the maximum size of any single block. It can have any value > 16 bytes.
|
394
|
+
* In which case, encoding and decoding buffers do not need to be synchronized.
|
395
|
+
* Actually, data can be produced by any source compliant with LZ4 format specification, and respecting maxBlockSize.
|
396
|
+
* - Synchronized mode :
|
397
|
+
* Decompression buffer size is _exactly_ the same as compression buffer size,
|
398
|
+
* and follows exactly same update rule (block boundaries at same positions),
|
399
|
+
* and decoding function is provided with exact decompressed size of each block (exception for last block of the stream),
|
400
|
+
* _then_ decoding & encoding ring buffer can have any size, including small ones ( < 64 KB).
|
401
|
+
* - Decompression buffer is larger than encoding buffer, by a minimum of maxBlockSize more bytes.
|
402
|
+
* In which case, encoding and decoding buffers do not need to be synchronized,
|
403
|
+
* and encoding ring buffer can have any size, including small ones ( < 64 KB).
|
404
|
+
*
|
405
|
+
* Whenever these conditions are not possible,
|
406
|
+
* save the last 64KB of decoded data into a safe buffer where it can't be modified during decompression,
|
407
|
+
* then indicate where this data is saved using LZ4_setStreamDecode(), before decompressing next block.
|
408
|
+
*/
|
409
|
+
LZ4LIB_API int LZ4_decompress_safe_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int srcSize, int dstCapacity);
|
410
|
+
|
411
|
+
|
412
|
+
/*! LZ4_decompress_*_usingDict() :
|
413
|
+
* These decoding functions work the same as
|
414
|
+
* a combination of LZ4_setStreamDecode() followed by LZ4_decompress_*_continue()
|
415
|
+
* They are stand-alone, and don't need an LZ4_streamDecode_t structure.
|
416
|
+
* Dictionary is presumed stable : it must remain accessible and unmodified during decompression.
|
417
|
+
* Performance tip : Decompression speed can be substantially increased
|
418
|
+
* when dst == dictStart + dictSize.
|
419
|
+
*/
|
420
|
+
LZ4LIB_API int LZ4_decompress_safe_usingDict (const char* src, char* dst, int srcSize, int dstCapcity, const char* dictStart, int dictSize);
|
421
|
+
|
422
|
+
#endif /* LZ4_H_2983827168210 */
|
423
|
+
|
424
|
+
|
425
|
+
/*^*************************************
|
426
|
+
* !!!!!! STATIC LINKING ONLY !!!!!!
|
427
|
+
***************************************/
|
428
|
+
|
429
|
+
/*-****************************************************************************
|
430
|
+
* Experimental section
|
431
|
+
*
|
432
|
+
* Symbols declared in this section must be considered unstable. Their
|
433
|
+
* signatures or semantics may change, or they may be removed altogether in the
|
434
|
+
* future. They are therefore only safe to depend on when the caller is
|
435
|
+
* statically linked against the library.
|
436
|
+
*
|
437
|
+
* To protect against unsafe usage, not only are the declarations guarded,
|
438
|
+
* the definitions are hidden by default
|
439
|
+
* when building LZ4 as a shared/dynamic library.
|
440
|
+
*
|
441
|
+
* In order to access these declarations,
|
442
|
+
* define LZ4_STATIC_LINKING_ONLY in your application
|
443
|
+
* before including LZ4's headers.
|
444
|
+
*
|
445
|
+
* In order to make their implementations accessible dynamically, you must
|
446
|
+
* define LZ4_PUBLISH_STATIC_FUNCTIONS when building the LZ4 library.
|
447
|
+
******************************************************************************/
|
448
|
+
|
449
|
+
#ifdef LZ4_STATIC_LINKING_ONLY
|
450
|
+
|
451
|
+
#ifndef LZ4_STATIC_3504398509
|
452
|
+
#define LZ4_STATIC_3504398509
|
453
|
+
|
454
|
+
#ifdef LZ4_PUBLISH_STATIC_FUNCTIONS
|
455
|
+
#define LZ4LIB_STATIC_API LZ4LIB_API
|
456
|
+
#else
|
457
|
+
#define LZ4LIB_STATIC_API
|
458
|
+
#endif
|
459
|
+
|
460
|
+
|
461
|
+
/*! LZ4_compress_fast_extState_fastReset() :
|
462
|
+
* A variant of LZ4_compress_fast_extState().
|
463
|
+
*
|
464
|
+
* Using this variant avoids an expensive initialization step.
|
465
|
+
* It is only safe to call if the state buffer is known to be correctly initialized already
|
466
|
+
* (see above comment on LZ4_resetStream_fast() for a definition of "correctly initialized").
|
467
|
+
* From a high level, the difference is that
|
468
|
+
* this function initializes the provided state with a call to something like LZ4_resetStream_fast()
|
469
|
+
* while LZ4_compress_fast_extState() starts with a call to LZ4_resetStream().
|
470
|
+
*/
|
471
|
+
LZ4LIB_STATIC_API int LZ4_compress_fast_extState_fastReset (void* state, const char* src, char* dst, int srcSize, int dstCapacity, int acceleration);
|
472
|
+
|
473
|
+
/*! LZ4_attach_dictionary() :
|
474
|
+
* This is an experimental API that allows
|
475
|
+
* efficient use of a static dictionary many times.
|
476
|
+
*
|
477
|
+
* Rather than re-loading the dictionary buffer into a working context before
|
478
|
+
* each compression, or copying a pre-loaded dictionary's LZ4_stream_t into a
|
479
|
+
* working LZ4_stream_t, this function introduces a no-copy setup mechanism,
|
480
|
+
* in which the working stream references the dictionary stream in-place.
|
481
|
+
*
|
482
|
+
* Several assumptions are made about the state of the dictionary stream.
|
483
|
+
* Currently, only streams which have been prepared by LZ4_loadDict() should
|
484
|
+
* be expected to work.
|
485
|
+
*
|
486
|
+
* Alternatively, the provided dictionaryStream may be NULL,
|
487
|
+
* in which case any existing dictionary stream is unset.
|
488
|
+
*
|
489
|
+
* If a dictionary is provided, it replaces any pre-existing stream history.
|
490
|
+
* The dictionary contents are the only history that can be referenced and
|
491
|
+
* logically immediately precede the data compressed in the first subsequent
|
492
|
+
* compression call.
|
493
|
+
*
|
494
|
+
* The dictionary will only remain attached to the working stream through the
|
495
|
+
* first compression call, at the end of which it is cleared. The dictionary
|
496
|
+
* stream (and source buffer) must remain in-place / accessible / unchanged
|
497
|
+
* through the completion of the first compression call on the stream.
|
498
|
+
*/
|
499
|
+
LZ4LIB_STATIC_API void LZ4_attach_dictionary(LZ4_stream_t* workingStream, const LZ4_stream_t* dictionaryStream);
|
500
|
+
|
501
|
+
|
502
|
+
/*! In-place compression and decompression
|
503
|
+
*
|
504
|
+
* It's possible to have input and output sharing the same buffer,
|
505
|
+
* for highly contrained memory environments.
|
506
|
+
* In both cases, it requires input to lay at the end of the buffer,
|
507
|
+
* and decompression to start at beginning of the buffer.
|
508
|
+
* Buffer size must feature some margin, hence be larger than final size.
|
509
|
+
*
|
510
|
+
* |<------------------------buffer--------------------------------->|
|
511
|
+
* |<-----------compressed data--------->|
|
512
|
+
* |<-----------decompressed size------------------>|
|
513
|
+
* |<----margin---->|
|
514
|
+
*
|
515
|
+
* This technique is more useful for decompression,
|
516
|
+
* since decompressed size is typically larger,
|
517
|
+
* and margin is short.
|
518
|
+
*
|
519
|
+
* In-place decompression will work inside any buffer
|
520
|
+
* which size is >= LZ4_DECOMPRESS_INPLACE_BUFFER_SIZE(decompressedSize).
|
521
|
+
* This presumes that decompressedSize > compressedSize.
|
522
|
+
* Otherwise, it means compression actually expanded data,
|
523
|
+
* and it would be more efficient to store such data with a flag indicating it's not compressed.
|
524
|
+
* This can happen when data is not compressible (already compressed, or encrypted).
|
525
|
+
*
|
526
|
+
* For in-place compression, margin is larger, as it must be able to cope with both
|
527
|
+
* history preservation, requiring input data to remain unmodified up to LZ4_DISTANCE_MAX,
|
528
|
+
* and data expansion, which can happen when input is not compressible.
|
529
|
+
* As a consequence, buffer size requirements are much higher,
|
530
|
+
* and memory savings offered by in-place compression are more limited.
|
531
|
+
*
|
532
|
+
* There are ways to limit this cost for compression :
|
533
|
+
* - Reduce history size, by modifying LZ4_DISTANCE_MAX.
|
534
|
+
* Note that it is a compile-time constant, so all compressions will apply this limit.
|
535
|
+
* Lower values will reduce compression ratio, except when input_size < LZ4_DISTANCE_MAX,
|
536
|
+
* so it's a reasonable trick when inputs are known to be small.
|
537
|
+
* - Require the compressor to deliver a "maximum compressed size".
|
538
|
+
* This is the `dstCapacity` parameter in `LZ4_compress*()`.
|
539
|
+
* When this size is < LZ4_COMPRESSBOUND(inputSize), then compression can fail,
|
540
|
+
* in which case, the return code will be 0 (zero).
|
541
|
+
* The caller must be ready for these cases to happen,
|
542
|
+
* and typically design a backup scheme to send data uncompressed.
|
543
|
+
* The combination of both techniques can significantly reduce
|
544
|
+
* the amount of margin required for in-place compression.
|
545
|
+
*
|
546
|
+
* In-place compression can work in any buffer
|
547
|
+
* which size is >= (maxCompressedSize)
|
548
|
+
* with maxCompressedSize == LZ4_COMPRESSBOUND(srcSize) for guaranteed compression success.
|
549
|
+
* LZ4_COMPRESS_INPLACE_BUFFER_SIZE() depends on both maxCompressedSize and LZ4_DISTANCE_MAX,
|
550
|
+
* so it's possible to reduce memory requirements by playing with them.
|
551
|
+
*/
|
552
|
+
|
553
|
+
#define LZ4_DECOMPRESS_INPLACE_MARGIN(compressedSize) (((compressedSize) >> 8) + 32)
|
554
|
+
#define LZ4_DECOMPRESS_INPLACE_BUFFER_SIZE(decompressedSize) ((decompressedSize) + LZ4_DECOMPRESS_INPLACE_MARGIN(decompressedSize)) /**< note: presumes that compressedSize < decompressedSize. note2: margin is overestimated a bit, since it could use compressedSize instead */
|
555
|
+
|
556
|
+
#ifndef LZ4_DISTANCE_MAX /* history window size; can be user-defined at compile time */
|
557
|
+
# define LZ4_DISTANCE_MAX 65535 /* set to maximum value by default */
|
558
|
+
#endif
|
559
|
+
|
560
|
+
#define LZ4_COMPRESS_INPLACE_MARGIN (LZ4_DISTANCE_MAX + 32) /* LZ4_DISTANCE_MAX can be safely replaced by srcSize when it's smaller */
|
561
|
+
#define LZ4_COMPRESS_INPLACE_BUFFER_SIZE(maxCompressedSize) ((maxCompressedSize) + LZ4_COMPRESS_INPLACE_MARGIN) /**< maxCompressedSize is generally LZ4_COMPRESSBOUND(inputSize), but can be set to any lower value, with the risk that compression can fail (return code 0(zero)) */
|
562
|
+
|
563
|
+
#endif /* LZ4_STATIC_3504398509 */
|
564
|
+
#endif /* LZ4_STATIC_LINKING_ONLY */
|
565
|
+
|
566
|
+
|
567
|
+
|
568
|
+
#ifndef LZ4_H_98237428734687
|
569
|
+
#define LZ4_H_98237428734687
|
570
|
+
|
571
|
+
/*-************************************************************
|
572
|
+
* Private Definitions
|
573
|
+
**************************************************************
|
574
|
+
* Do not use these definitions directly.
|
575
|
+
* They are only exposed to allow static allocation of `LZ4_stream_t` and `LZ4_streamDecode_t`.
|
576
|
+
* Accessing members will expose user code to API and/or ABI break in future versions of the library.
|
577
|
+
**************************************************************/
|
578
|
+
#define LZ4_HASHLOG (LZ4_MEMORY_USAGE-2)
|
579
|
+
#define LZ4_HASHTABLESIZE (1 << LZ4_MEMORY_USAGE)
|
580
|
+
#define LZ4_HASH_SIZE_U32 (1 << LZ4_HASHLOG) /* required as macro for static allocation */
|
581
|
+
|
582
|
+
#if defined(__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
|
583
|
+
# include <stdint.h>
|
584
|
+
typedef int8_t LZ4_i8;
|
585
|
+
typedef uint8_t LZ4_byte;
|
586
|
+
typedef uint16_t LZ4_u16;
|
587
|
+
typedef uint32_t LZ4_u32;
|
588
|
+
#else
|
589
|
+
typedef signed char LZ4_i8;
|
590
|
+
typedef unsigned char LZ4_byte;
|
591
|
+
typedef unsigned short LZ4_u16;
|
592
|
+
typedef unsigned int LZ4_u32;
|
593
|
+
#endif
|
594
|
+
|
595
|
+
typedef struct LZ4_stream_t_internal LZ4_stream_t_internal;
|
596
|
+
struct LZ4_stream_t_internal {
|
597
|
+
LZ4_u32 hashTable[LZ4_HASH_SIZE_U32];
|
598
|
+
LZ4_u32 currentOffset;
|
599
|
+
LZ4_u32 tableType;
|
600
|
+
const LZ4_byte* dictionary;
|
601
|
+
const LZ4_stream_t_internal* dictCtx;
|
602
|
+
LZ4_u32 dictSize;
|
603
|
+
};
|
604
|
+
|
605
|
+
typedef struct {
|
606
|
+
const LZ4_byte* externalDict;
|
607
|
+
size_t extDictSize;
|
608
|
+
const LZ4_byte* prefixEnd;
|
609
|
+
size_t prefixSize;
|
610
|
+
} LZ4_streamDecode_t_internal;
|
611
|
+
|
612
|
+
|
613
|
+
/*! LZ4_stream_t :
|
614
|
+
* Do not use below internal definitions directly !
|
615
|
+
* Declare or allocate an LZ4_stream_t instead.
|
616
|
+
* LZ4_stream_t can also be created using LZ4_createStream(), which is recommended.
|
617
|
+
* The structure definition can be convenient for static allocation
|
618
|
+
* (on stack, or as part of larger structure).
|
619
|
+
* Init this structure with LZ4_initStream() before first use.
|
620
|
+
* note : only use this definition in association with static linking !
|
621
|
+
* this definition is not API/ABI safe, and may change in future versions.
|
622
|
+
*/
|
623
|
+
#define LZ4_STREAMSIZE 16416 /* static size, for inter-version compatibility */
|
624
|
+
#define LZ4_STREAMSIZE_VOIDP (LZ4_STREAMSIZE / sizeof(void*))
|
625
|
+
union LZ4_stream_u {
|
626
|
+
void* table[LZ4_STREAMSIZE_VOIDP];
|
627
|
+
LZ4_stream_t_internal internal_donotuse;
|
628
|
+
}; /* previously typedef'd to LZ4_stream_t */
|
629
|
+
|
630
|
+
|
631
|
+
/*! LZ4_initStream() : v1.9.0+
|
632
|
+
* An LZ4_stream_t structure must be initialized at least once.
|
633
|
+
* This is automatically done when invoking LZ4_createStream(),
|
634
|
+
* but it's not when the structure is simply declared on stack (for example).
|
635
|
+
*
|
636
|
+
* Use LZ4_initStream() to properly initialize a newly declared LZ4_stream_t.
|
637
|
+
* It can also initialize any arbitrary buffer of sufficient size,
|
638
|
+
* and will @return a pointer of proper type upon initialization.
|
639
|
+
*
|
640
|
+
* Note : initialization fails if size and alignment conditions are not respected.
|
641
|
+
* In which case, the function will @return NULL.
|
642
|
+
* Note2: An LZ4_stream_t structure guarantees correct alignment and size.
|
643
|
+
* Note3: Before v1.9.0, use LZ4_resetStream() instead
|
644
|
+
*/
|
645
|
+
LZ4LIB_API LZ4_stream_t* LZ4_initStream (void* buffer, size_t size);
|
646
|
+
|
647
|
+
|
648
|
+
/*! LZ4_streamDecode_t :
|
649
|
+
* information structure to track an LZ4 stream during decompression.
|
650
|
+
* init this structure using LZ4_setStreamDecode() before first use.
|
651
|
+
* note : only use in association with static linking !
|
652
|
+
* this definition is not API/ABI safe,
|
653
|
+
* and may change in a future version !
|
654
|
+
*/
|
655
|
+
#define LZ4_STREAMDECODESIZE_U64 (4 + ((sizeof(void*)==16) ? 2 : 0) /*AS-400*/ )
|
656
|
+
#define LZ4_STREAMDECODESIZE (LZ4_STREAMDECODESIZE_U64 * sizeof(unsigned long long))
|
657
|
+
union LZ4_streamDecode_u {
|
658
|
+
unsigned long long table[LZ4_STREAMDECODESIZE_U64];
|
659
|
+
LZ4_streamDecode_t_internal internal_donotuse;
|
660
|
+
} ; /* previously typedef'd to LZ4_streamDecode_t */
|
661
|
+
|
662
|
+
|
663
|
+
|
664
|
+
/*-************************************
|
665
|
+
* Obsolete Functions
|
666
|
+
**************************************/
|
667
|
+
|
668
|
+
/*! Deprecation warnings
|
669
|
+
*
|
670
|
+
* Deprecated functions make the compiler generate a warning when invoked.
|
671
|
+
* This is meant to invite users to update their source code.
|
672
|
+
* Should deprecation warnings be a problem, it is generally possible to disable them,
|
673
|
+
* typically with -Wno-deprecated-declarations for gcc
|
674
|
+
* or _CRT_SECURE_NO_WARNINGS in Visual.
|
675
|
+
*
|
676
|
+
* Another method is to define LZ4_DISABLE_DEPRECATE_WARNINGS
|
677
|
+
* before including the header file.
|
678
|
+
*/
|
679
|
+
#ifdef LZ4_DISABLE_DEPRECATE_WARNINGS
|
680
|
+
# define LZ4_DEPRECATED(message) /* disable deprecation warnings */
|
681
|
+
#else
|
682
|
+
# if defined (__cplusplus) && (__cplusplus >= 201402) /* C++14 or greater */
|
683
|
+
# define LZ4_DEPRECATED(message) [[deprecated(message)]]
|
684
|
+
# elif defined(_MSC_VER)
|
685
|
+
# define LZ4_DEPRECATED(message) __declspec(deprecated(message))
|
686
|
+
# elif defined(__clang__) || (defined(__GNUC__) && (__GNUC__ * 10 + __GNUC_MINOR__ >= 45))
|
687
|
+
# define LZ4_DEPRECATED(message) __attribute__((deprecated(message)))
|
688
|
+
# elif defined(__GNUC__) && (__GNUC__ * 10 + __GNUC_MINOR__ >= 31)
|
689
|
+
# define LZ4_DEPRECATED(message) __attribute__((deprecated))
|
690
|
+
# else
|
691
|
+
# pragma message("WARNING: LZ4_DEPRECATED needs custom implementation for this compiler")
|
692
|
+
# define LZ4_DEPRECATED(message) /* disabled */
|
693
|
+
# endif
|
694
|
+
#endif /* LZ4_DISABLE_DEPRECATE_WARNINGS */
|
695
|
+
|
696
|
+
/*! Obsolete compression functions (since v1.7.3) */
|
697
|
+
LZ4_DEPRECATED("use LZ4_compress_default() instead") LZ4LIB_API int LZ4_compress (const char* src, char* dest, int srcSize);
|
698
|
+
LZ4_DEPRECATED("use LZ4_compress_default() instead") LZ4LIB_API int LZ4_compress_limitedOutput (const char* src, char* dest, int srcSize, int maxOutputSize);
|
699
|
+
LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_withState (void* state, const char* source, char* dest, int inputSize);
|
700
|
+
LZ4_DEPRECATED("use LZ4_compress_fast_extState() instead") LZ4LIB_API int LZ4_compress_limitedOutput_withState (void* state, const char* source, char* dest, int inputSize, int maxOutputSize);
|
701
|
+
LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_continue (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize);
|
702
|
+
LZ4_DEPRECATED("use LZ4_compress_fast_continue() instead") LZ4LIB_API int LZ4_compress_limitedOutput_continue (LZ4_stream_t* LZ4_streamPtr, const char* source, char* dest, int inputSize, int maxOutputSize);
|
703
|
+
|
704
|
+
/*! Obsolete decompression functions (since v1.8.0) */
|
705
|
+
LZ4_DEPRECATED("use LZ4_decompress_fast() instead") LZ4LIB_API int LZ4_uncompress (const char* source, char* dest, int outputSize);
|
706
|
+
LZ4_DEPRECATED("use LZ4_decompress_safe() instead") LZ4LIB_API int LZ4_uncompress_unknownOutputSize (const char* source, char* dest, int isize, int maxOutputSize);
|
707
|
+
|
708
|
+
/* Obsolete streaming functions (since v1.7.0)
|
709
|
+
* degraded functionality; do not use!
|
710
|
+
*
|
711
|
+
* In order to perform streaming compression, these functions depended on data
|
712
|
+
* that is no longer tracked in the state. They have been preserved as well as
|
713
|
+
* possible: using them will still produce a correct output. However, they don't
|
714
|
+
* actually retain any history between compression calls. The compression ratio
|
715
|
+
* achieved will therefore be no better than compressing each chunk
|
716
|
+
* independently.
|
717
|
+
*/
|
718
|
+
LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API void* LZ4_create (char* inputBuffer);
|
719
|
+
LZ4_DEPRECATED("Use LZ4_createStream() instead") LZ4LIB_API int LZ4_sizeofStreamState(void);
|
720
|
+
LZ4_DEPRECATED("Use LZ4_resetStream() instead") LZ4LIB_API int LZ4_resetStreamState(void* state, char* inputBuffer);
|
721
|
+
LZ4_DEPRECATED("Use LZ4_saveDict() instead") LZ4LIB_API char* LZ4_slideInputBuffer (void* state);
|
722
|
+
|
723
|
+
/*! Obsolete streaming decoding functions (since v1.7.0) */
|
724
|
+
LZ4_DEPRECATED("use LZ4_decompress_safe_usingDict() instead") LZ4LIB_API int LZ4_decompress_safe_withPrefix64k (const char* src, char* dst, int compressedSize, int maxDstSize);
|
725
|
+
LZ4_DEPRECATED("use LZ4_decompress_fast_usingDict() instead") LZ4LIB_API int LZ4_decompress_fast_withPrefix64k (const char* src, char* dst, int originalSize);
|
726
|
+
|
727
|
+
/*! Obsolete LZ4_decompress_fast variants (since v1.9.0) :
|
728
|
+
* These functions used to be faster than LZ4_decompress_safe(),
|
729
|
+
* but this is no longer the case. They are now slower.
|
730
|
+
* This is because LZ4_decompress_fast() doesn't know the input size,
|
731
|
+
* and therefore must progress more cautiously into the input buffer to not read beyond the end of block.
|
732
|
+
* On top of that `LZ4_decompress_fast()` is not protected vs malformed or malicious inputs, making it a security liability.
|
733
|
+
* As a consequence, LZ4_decompress_fast() is strongly discouraged, and deprecated.
|
734
|
+
*
|
735
|
+
* The last remaining LZ4_decompress_fast() specificity is that
|
736
|
+
* it can decompress a block without knowing its compressed size.
|
737
|
+
* Such functionality can be achieved in a more secure manner
|
738
|
+
* by employing LZ4_decompress_safe_partial().
|
739
|
+
*
|
740
|
+
* Parameters:
|
741
|
+
* originalSize : is the uncompressed size to regenerate.
|
742
|
+
* `dst` must be already allocated, its size must be >= 'originalSize' bytes.
|
743
|
+
* @return : number of bytes read from source buffer (== compressed size).
|
744
|
+
* The function expects to finish at block's end exactly.
|
745
|
+
* If the source stream is detected malformed, the function stops decoding and returns a negative result.
|
746
|
+
* note : LZ4_decompress_fast*() requires originalSize. Thanks to this information, it never writes past the output buffer.
|
747
|
+
* However, since it doesn't know its 'src' size, it may read an unknown amount of input, past input buffer bounds.
|
748
|
+
* Also, since match offsets are not validated, match reads from 'src' may underflow too.
|
749
|
+
* These issues never happen if input (compressed) data is correct.
|
750
|
+
* But they may happen if input data is invalid (error or intentional tampering).
|
751
|
+
* As a consequence, use these functions in trusted environments with trusted data **only**.
|
752
|
+
*/
|
753
|
+
LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe() instead")
|
754
|
+
LZ4LIB_API int LZ4_decompress_fast (const char* src, char* dst, int originalSize);
|
755
|
+
LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_continue() instead")
|
756
|
+
LZ4LIB_API int LZ4_decompress_fast_continue (LZ4_streamDecode_t* LZ4_streamDecode, const char* src, char* dst, int originalSize);
|
757
|
+
LZ4_DEPRECATED("This function is deprecated and unsafe. Consider using LZ4_decompress_safe_usingDict() instead")
|
758
|
+
LZ4LIB_API int LZ4_decompress_fast_usingDict (const char* src, char* dst, int originalSize, const char* dictStart, int dictSize);
|
759
|
+
|
760
|
+
/*! LZ4_resetStream() :
|
761
|
+
* An LZ4_stream_t structure must be initialized at least once.
|
762
|
+
* This is done with LZ4_initStream(), or LZ4_resetStream().
|
763
|
+
* Consider switching to LZ4_initStream(),
|
764
|
+
* invoking LZ4_resetStream() will trigger deprecation warnings in the future.
|
765
|
+
*/
|
766
|
+
LZ4LIB_API void LZ4_resetStream (LZ4_stream_t* streamPtr);
|
767
|
+
|
768
|
+
|
769
|
+
#endif /* LZ4_H_98237428734687 */
|
770
|
+
|
771
|
+
|
772
|
+
#if defined (__cplusplus)
|
773
|
+
}
|
774
|
+
#endif
|