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.h25 static uint32_t FN(HashBytes)(const uint8_t* data) { in FN() argument
64 const uint32_t key = FN(HashBytes)(&data[i]); in FN()
98 const uint32_t key = FN(HashBytes)(&data[ix & mask]); in FN()
159 size_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* BROTLI_RESTRICT data, in FN() argument
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_, in FN()
114 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_mask_, in FN()
220 const uint32_t key = FN(HashBytes)( in FN()
Dhash_longest_match_inc.h23 static uint32_t FN(HashBytes)( in FN() argument
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_); in FN()
111 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_); in FN()
217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FN()
Dhash_forgetful_chain_inc.h31 static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in FN() argument
103 size_t bucket = FN(HashBytes)(&data[i]); in FN()
137 const size_t key = FN(HashBytes)(&data[ix & mask]); in FN()
209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
Dhash_to_binary_tree_inc.h27 static uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in FN() argument
123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()