Lines Matching defs:hash
65 #include "src/objects/hash-table-inl.h"
1634 Object hash = Object::GetSimpleHash(*this);
1635 if (hash.IsSmi()) return Smi::cast(hash);
4473 const uint32_t parent_hash = GetSortedKey(i).hash();
4476 uint32_t child_hash = GetSortedKey(child_index).hash();
4478 uint32_t right_child_hash = GetSortedKey(child_index + 1).hash();
4497 const uint32_t parent_hash = GetSortedKey(parent_index).hash();
4501 uint32_t child_hash = GetSortedKey(child_index).hash();
4503 uint32_t right_child_hash = GetSortedKey(child_index + 1).hash();
4761 // For array indexes mix the length into the hash as an array index could
5752 uint32_t hash = Shape::HashForObject(roots, k);
5754 EntryToIndex(new_table.FindInsertionEntry(cage_base, roots, hash));
5768 uint32_t hash = Shape::HashForObject(roots, k);
5770 InternalIndex entry = FirstProbe(hash, capacity);
5933 PtrComprCageBase cage_base, ReadOnlyRoots roots, uint32_t hash) {
5936 // EnsureCapacity will guarantee the hash table is never full.
5937 for (InternalIndex entry = FirstProbe(hash, capacity);;
5955 const int32_t hash = ShapeT::Hash(roots, name);
5960 // EnsureCapacity will guarantee the hash table is never full.
5961 for (InternalIndex entry = FirstProbe(hash, capacity);;
5981 uint32_t hash = ShapeT::Hash(ReadOnlyRoots(isolate), *name);
5982 InternalIndex entry = stringset->FindInsertionEntry(isolate, hash);
6000 uint32_t hash = ShapeT::Hash(ReadOnlyRoots(isolate), key);
6001 InternalIndex entry = table->FindInsertionEntry(isolate, hash);
6011 int32_t hash = key->GetOrCreateHash(isolate).value();
6012 if (!set->Has(isolate, key, hash)) {
6014 InternalIndex entry = set->FindInsertionEntry(isolate, hash);
6132 uint32_t hash = Shape::Hash(roots, key);
6141 InternalIndex entry = dictionary->FindInsertionEntry(isolate, roots, hash);
6288 int32_t hash) {
6293 InternalIndex entry = this->FindEntry(cage_base, roots, key, hash);
6305 InternalIndex entry = this->FindEntry(cage_base, roots, key, key->hash());
6318 // If the object does not have an identity hash, it was never used as a key.
6319 Object hash = key->GetHash();
6320 if (hash.IsUndefined(roots)) {
6323 return Lookup(cage_base, key, Smi::ToInt(hash));
6328 int32_t hash) {
6329 return Lookup(GetPtrComprCageBase(*this), key, hash);
6363 // Make sure the key object has an identity hash code.
6364 int32_t hash = key->GetOrCreateHash(isolate).value();
6367 hash);
6375 int32_t hash) {
6380 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6407 // Check whether the hash table should be extended.
6409 table->AddEntry(table->FindInsertionEntry(isolate, hash), *key, *value);
6419 Object hash = key->GetHash();
6420 if (hash.IsUndefined()) {
6425 return Remove(isolate, table, key, was_present, Smi::ToInt(hash));
6431 bool* was_present, int32_t hash) {
6435 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6506 int32_t hash) {
6513 weak_collection->GetIsolate(), table, key, value, hash);
6522 Handle<Object> key, int32_t hash) {
6530 weak_collection->GetIsolate(), table, key, &was_present, hash);
6970 // from the hash table.
6975 // of the key in the hash table.