Lines Matching defs:dictionary
9 #include "../common/dictionary.h"
32 static BROTLI_INLINE size_t DictMatchLength(const BrotliDictionary* dictionary,
37 const size_t offset = dictionary->offsets_by_length[len] + len * id;
38 return FindMatchLengthWithLimit(&dictionary->data[offset], data,
42 static BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary,
47 const size_t offset = dictionary->offsets_by_length[w.len] +
49 const uint8_t* dict = &dictionary->data[offset];
51 /* Match against base dictionary word. */
78 const BrotliEncoderDictionary* dictionary, const uint8_t* data,
82 size_t offset = dictionary->buckets[Hash(data)];
85 DictWord w = dictionary->dict_words[offset++];
87 const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
93 DictMatchLength(dictionary->words, data, id, l, max_length);
121 (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);
282 if (!IsMatch(dictionary->words, w, data, max_length)) {
327 size_t offset = dictionary->buckets[Hash(&data[1])];
330 DictWord w = dictionary->dict_words[offset++];
332 const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
338 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
382 if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {
422 size_t offset = dictionary->buckets[Hash(&data[2])];
425 DictWord w = dictionary->dict_words[offset++];
427 const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
432 IsMatch(dictionary->words, w, &data[2], max_length - 2)) {
451 size_t offset = dictionary->buckets[Hash(&data[5])];
454 DictWord w = dictionary->dict_words[offset++];
456 const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];
461 IsMatch(dictionary->words, w, &data[5], max_length - 5)) {