Searched refs:HashBytes (Results 1 - 11 of 11) sorted by relevance
/third_party/node/deps/brotli/c/enc/ |
H A D | hash_forgetful_chain_inc.h | 30 /* HashBytes is the function that chooses the bucket to place the address in.*/ 31 static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes() function 103 size_t bucket = FN(HashBytes)(&data[i]); in Prepare() 137 const size_t key = FN(HashBytes)(&data[ix & mask]); in Store() 209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
|
H A D | hash_longest_match64_inc.h | 22 /* HashBytes is the function that chooses the bucket to place the address in. */ 23 static BROTLI_INLINE uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data, in HashBytes() function 87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_, in Prepare() 114 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_mask_, in Store() 220 const uint32_t key = FN(HashBytes)( in FindLongestMatch()
|
H A D | hash_longest_match_inc.h | 22 /* HashBytes is the function that chooses the bucket to place the address in. */ 23 static uint32_t FN(HashBytes)( in HashBytes() function 87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_); in Prepare() 111 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_); in Store() 217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FindLongestMatch()
|
H A D | hash_longest_match_quickly_inc.h | 22 /* HashBytes is the function that chooses the bucket to place 25 static uint32_t FN(HashBytes)(const uint8_t* data) { in HashBytes() function 64 const uint32_t key = FN(HashBytes)(&data[i]); in Prepare() 98 const uint32_t key = FN(HashBytes)(&data[ix & mask]); in Store() 159 size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
|
H A D | hash_to_binary_tree_inc.h | 27 static uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes() function 123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in StoreAndFindMatches()
|
/third_party/skia/third_party/externals/brotli/c/enc/ |
H A D | hash_longest_match_inc.h | 22 /* HashBytes is the function that chooses the bucket to place the address in. */ 23 static uint32_t FN(HashBytes)( in HashBytes() function 87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_); in Prepare() 111 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_); in Store() 217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FindLongestMatch()
|
H A D | hash_longest_match_quickly_inc.h | 22 /* HashBytes is the function that chooses the bucket to place 25 static uint32_t FN(HashBytes)(const uint8_t* data) { in HashBytes() function 64 const uint32_t key = FN(HashBytes)(&data[i]); in Prepare() 98 const uint32_t key = FN(HashBytes)(&data[ix & mask]); in Store() 159 size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
|
H A D | hash_forgetful_chain_inc.h | 30 /* HashBytes is the function that chooses the bucket to place the address in.*/ 31 static BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes() function 103 size_t bucket = FN(HashBytes)(&data[i]); in Prepare() 137 const size_t key = FN(HashBytes)(&data[ix & mask]); in Store() 209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
|
H A D | hash_longest_match64_inc.h | 22 /* HashBytes is the function that chooses the bucket to place the address in. */ 23 static BROTLI_INLINE uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data, in HashBytes() function 87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_, in Prepare() 114 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_mask_, in Store() 220 const uint32_t key = FN(HashBytes)( in FindLongestMatch()
|
H A D | hash_to_binary_tree_inc.h | 27 static uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) { in HashBytes() function 123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in StoreAndFindMatches()
|
/third_party/rust/crates/bindgen/bindgen-tests/tests/ |
H A D | stylo.hpp | [all...] |
Completed in 31 milliseconds