HomeSort by relevance Sort by last modified time
    Searched refs:HashBytes (Results 1 - 8 of 8) sorted by null

  /external/brotli/c/enc/
hash_longest_match_quickly_inc.h 21 /* HashBytes is the function that chooses the bucket to place
24 static uint32_t FN(HashBytes)(const uint8_t* data) {
59 const uint32_t key = FN(HashBytes)(&data[i]);
85 const uint32_t key = FN(HashBytes)(&data[ix & mask]);
136 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]);
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 *data) {
75 size_t bucket = FN(HashBytes)(&data[i]);
105 const size_t key = FN(HashBytes)(&data[ix & mask]);
169 const size_t key = FN(HashBytes)(&data[cur_ix_masked]);
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 *data,
87 const uint32_t key = FN(HashBytes)(&data[i], self->hash_mask_,
112 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_mask_,
218 const uint32_t key = FN(HashBytes)(
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)(const uint8_t *data, const int shift) {
82 const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_);
106 const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_);
212 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_);
hash_to_binary_tree_inc.h 27 static uint32_t FN(HashBytes)(const uint8_t *data) {
125 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]);
  /art/dexlayout/
compact_dex_writer.h 76 return HashBytes(Data() + range.offset_, range.length_);
  /art/compiler/driver/
compiled_method_storage.cc 140 return HashBytes(data, len);
  /art/libartbase/base/
utils.h 248 static inline size_t HashBytes(const uint8_t* data, size_t len) {

Completed in 82 milliseconds