Home
last modified time | relevance | path

Searched refs:hash_value (Results 1 – 8 of 8) sorted by relevance

/external/chromium/sdch/open-vcdiff/src/
Dblockhash.h180 void AddOneIndexHash(int index, uint32_t hash_value) { in AddOneIndexHash() argument
182 AddBlock(hash_value); in AddOneIndexHash()
294 void FindBestMatch(uint32_t hash_value,
344 uint32_t GetHashTableIndex(uint32_t hash_value) const { in GetHashTableIndex() argument
345 return hash_value & hash_table_mask_; in GetHashTableIndex()
364 void AddBlock(uint32_t hash_value);
404 int FirstMatchingBlock(uint32_t hash_value, const char* block_ptr) const;
415 inline int FirstMatchingBlockInline(uint32_t hash_value,
Dvcdiffengine.cc81 uint32_t hash_value, in EncodeCopyForBestMatch() argument
93 hashed_dictionary_->FindBestMatch(hash_value, in EncodeCopyForBestMatch()
101 target_hash->FindBestMatch(hash_value, in EncodeCopyForBestMatch()
191 uint32_t hash_value = hasher.Hash(candidate_pos); in EncodeInternal() local
195 hash_value, in EncodeInternal()
209 hash_value = hasher.Hash(candidate_pos); in EncodeInternal()
224 hash_value); in EncodeInternal()
226 hash_value = hasher.UpdateHash(hash_value, in EncodeInternal()
Dblockhash.cc152 void BlockHash::AddBlock(uint32_t hash_value) { in AddBlock() argument
176 const uint32_t hash_table_index = GetHashTableIndex(hash_value); in AddBlock()
314 inline int BlockHash::FirstMatchingBlockInline(uint32_t hash_value, in FirstMatchingBlockInline() argument
316 return SkipNonMatchingBlocks(hash_table_[GetHashTableIndex(hash_value)], in FirstMatchingBlockInline()
320 int BlockHash::FirstMatchingBlock(uint32_t hash_value, in FirstMatchingBlock() argument
322 return FirstMatchingBlockInline(hash_value, block_ptr); in FirstMatchingBlock()
391 void BlockHash::FindBestMatch(uint32_t hash_value, in FindBestMatch() argument
397 for (int block_number = FirstMatchingBlockInline(hash_value, in FindBestMatch()
Dblockhash_test.cc50 uint32_t hash_value, in FirstMatchingBlock() argument
52 return block_hash.FirstMatchingBlock(hash_value, block_ptr); in FirstMatchingBlock()
793 uint32_t hash_value = RollingHash<kBlockSize>::Hash( in TEST_F() local
795 dh_->FindBestMatch(hash_value, in TEST_F()
807 uint32_t hash_value = RollingHash<kBlockSize>::Hash( in TEST_F() local
809 dh_->FindBestMatch(hash_value, in TEST_F()
828 uint32_t hash_value = in TEST_F() local
830 many_matches_hash.FindBestMatch(hash_value, in TEST_F()
Dvcdiffengine.h96 size_t EncodeCopyForBestMatch(uint32_t hash_value,
/external/bluetooth/glib/glib/
Dghash.c189 guint hash_value; in g_hash_table_lookup_node() local
195 hash_value = (* hash_table->hash_func) (key); in g_hash_table_lookup_node()
196 if (G_UNLIKELY (hash_value <= 1)) in g_hash_table_lookup_node()
197 hash_value = 2; in g_hash_table_lookup_node()
199 node_index = hash_value % hash_table->mod; in g_hash_table_lookup_node()
209 if (node->key_hash == hash_value) in g_hash_table_lookup_node()
260 guint hash_value; in g_hash_table_lookup_node_for_insertion() local
268 hash_value = (* hash_table->hash_func) (key); in g_hash_table_lookup_node_for_insertion()
269 if (G_UNLIKELY (hash_value <= 1)) in g_hash_table_lookup_node_for_insertion()
270 hash_value = 2; in g_hash_table_lookup_node_for_insertion()
[all …]
/external/chromium/base/
Dfile_path.h372 inline size_t hash_value(const FilePath& f) {
373 return hash_value(f.value());
/external/v8/src/
Dapi.cc2289 int hash_value; in GetIdentityHash() local
2291 hash_value = i::Smi::cast(*hash)->value(); in GetIdentityHash()
2297 hash_value = i::V8::Random() & i::Smi::kMaxValue; in GetIdentityHash()
2299 } while (hash_value == 0 && attempts < 30); in GetIdentityHash()
2300 hash_value = hash_value != 0 ? hash_value : 1; // never return 0 in GetIdentityHash()
2303 i::Handle<i::Object>(i::Smi::FromInt(hash_value)), in GetIdentityHash()
2306 return hash_value; in GetIdentityHash()