Home
last modified time | relevance | path

Searched refs:HashBytes (Results 1 – 5 of 5) sorted by relevance

/external/brotli/c/enc/
Dhash_longest_match_quickly_inc.h24 static uint32_t FN(HashBytes)(const uint8_t* data) { in FN() argument
59 const uint32_t key = FN(HashBytes)(&data[i]); in FN()
85 const uint32_t key = FN(HashBytes)(&data[ix & mask]); in FN()
137 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
Dhash_longest_match64_inc.h23 static BROTLI_INLINE uint32_t FN(HashBytes)(const uint8_t* data, in FN() argument
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_, in FN()
112 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_mask_, in FN()
219 const uint32_t key = FN(HashBytes)( in FN()
Dhash_forgetful_chain_inc.h31 static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* data) { in FN() argument
75 size_t bucket = FN(HashBytes)(&data[i]); in FN()
105 const size_t key = FN(HashBytes)(&data[ix & mask]); in FN()
170 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
Dhash_longest_match_inc.h23 static uint32_t FN(HashBytes)(const uint8_t* data, const int shift) { in FN() argument
82 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_); in FN()
106 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_); in FN()
213 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FN()
Dhash_to_binary_tree_inc.h27 static uint32_t FN(HashBytes)(const uint8_t* data) { in FN() argument
125 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()