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 | /* Class to model the static dictionary. */ |
8 | |
9 | #ifndef BROTLI_ENC_STATIC_DICT_H_ |
10 | #define BROTLI_ENC_STATIC_DICT_H_ |
11 | |
12 | #include "../common/dictionary.h" |
13 | #include "../common/platform.h" |
14 | #include <brotli/types.h> |
15 | #include "./encoder_dict.h" |
16 | |
17 | #if defined(__cplusplus) || defined(c_plusplus) |
18 | extern "C" { |
19 | #endif |
20 | |
21 | #define BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN 37 |
22 | static const uint32_t kInvalidMatch = 0xFFFFFFF; |
23 | |
24 | /* Matches data against static dictionary words, and for each length l, |
25 | for which a match is found, updates matches[l] to be the minimum possible |
26 | (distance << 5) + len_code. |
27 | Returns 1 if matches have been found, otherwise 0. |
28 | Prerequisites: |
29 | matches array is at least BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1 long |
30 | all elements are initialized to kInvalidMatch */ |
31 | BROTLI_INTERNAL BROTLI_BOOL BrotliFindAllStaticDictionaryMatches( |
32 | const BrotliEncoderDictionary* dictionary, |
33 | const uint8_t* data, size_t min_length, size_t max_length, |
34 | uint32_t* matches); |
35 | |
36 | #if defined(__cplusplus) || defined(c_plusplus) |
37 | } /* extern "C" */ |
38 | #endif |
39 | |
40 | #endif /* BROTLI_ENC_STATIC_DICT_H_ */ |
41 | |