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