Lines Matching full:hash
714 self->Hash(); // Force regeneration of the hash value.
760 self->Hash(); // Force regeneration of the hash value.
3304 uint32_t descriptor_hash = descriptor->GetKey()->Hash();
3310 if (key->Hash() > descriptor_hash || key == descriptor->GetKey()) {
3370 uint32_t parent_hash = GetKey(parent_index)->Hash();
3371 uint32_t child_hash = GetKey(child_index)->Hash();
3390 uint32_t child1_hash = GetKey(child_index)->Hash();
3391 uint32_t child2_hash = GetKey(child_index + 1)->Hash();
3392 uint32_t parent_hash = GetKey(parent_index)->Hash();
3410 uint32_t hash = name->Hash();
3415 uint32_t mid_hash = mid_name->Hash();
3417 if (mid_hash > hash) {
3421 if (mid_hash < hash) {
3425 // Found an element with the same hash-code.
3426 ASSERT(hash == mid_hash);
3430 while ((mid > low) && (GetKey(mid - 1)->Hash() == hash)) mid--;
3431 for (; (mid <= high) && (GetKey(mid)->Hash() == hash); mid++) {
3441 uint32_t hash = name->Hash();
3444 if ((entry->Hash() == hash) &&
4365 // Fast check: if hash code is computed for both strings
4368 if (Hash() != other->Hash()) return false;
4450 // Should only be called if hash code has not yet been computed.
4453 // Compute the hash code.
4457 // Store the hash code in the object.
4460 // Check the hash code is there.
4463 ASSERT(result != 0); // Ensure that the hash value of 0 is never computed.
4500 Hash(); // force computation of hash code
4503 // Isolate the array index form the full hash field.
4513 static inline uint32_t HashField(uint32_t hash,
4517 (hash << String::kHashShift) | String::kHashComputedMask;
4519 // For array indexes mix the length into the hash as an array index could
4551 // Very long strings have a trivial hash that doesn't inspect the
6578 uint32_t NumberDictionaryShape::Hash(uint32_t key) {
6595 // We know that all entries in a hash table had their hash keys created.
6597 if (key->Hash() != String::cast(other)->Hash()) return false;
6602 uint32_t StringDictionaryShape::Hash(String* key) {
6603 return key->Hash();
6608 return String::cast(other)->Hash();
6625 // We know that all entries in a hash table had their hash keys created.
6633 uint32_t Hash() { return hash_; }
6635 uint32_t HashForObject(Object* other) { return String::cast(other)->Hash(); }
6661 uint32_t hash = source->Hash();
6663 // Instead of using the SharedFunctionInfo pointer in the hash
6664 // code computation, we use a combination of the hash of the
6669 hash ^= String::cast(script->source())->Hash();
6670 hash += shared->start_position();
6672 return hash;
6675 uint32_t Hash() {
6708 // Rather than storing the key in the hash table, a pointer to the
6718 uint32_t Hash() { return RegExpHash(string_, flags_); }
6721 // Plain hash maps, which is where regexp keys are used, don't
6734 return string->Hash() + flags->value();
6751 uint32_t Hash() {
6758 ASSERT(result != 0); // Ensure that the hash value of 0 is never computed.
6763 return String::cast(other)->Hash();
6767 if (hash_field_ == 0) Hash();
6773 int chars_; // Caches the number of characters when computing the hash code.
6786 uint32_t Hash() { return string_->Hash(); }
6789 return String::cast(other)->Hash();
6817 return String::cast(obj)->Hash();
6861 uint32_t entry = FirstProbe(Shape::Hash(key), capacity);
6863 // EnsureCapacity will guarantee the hash table is never full.
6903 uint32_t hash = Shape::HashForObject(key, k);
6905 EntryToIndex(table->FindInsertionEntry(hash));
6919 uint32_t HashTable<Shape, Key>::FindInsertionEntry(uint32_t hash) {
6921 uint32_t entry = FirstProbe(hash, capacity);
6923 // EnsureCapacity will guarantee the hash table is never full.
7349 // string hash calculation loop here for speed. Doesn't work if the two
7350 // characters form a decimal integer, since such strings have a different hash
7357 uint32_t hash = c1 + (c1 << 10);
7358 hash ^= hash >> 6;
7360 hash += c2;
7361 hash += hash << 10;
7362 hash ^= hash >> 6;
7364 hash += hash << 3;
7365 hash ^= hash >> 11;
7366 hash += hash << 15;
7367 if (hash == 0) hash = 27;
7374 // that we were passed two digits as characters, since the hash
7376 ASSERT_EQ(static_cast<int>(hasher.GetHash()), static_cast<int>(hash));
7378 hash_ = hash;
7389 uint32_t Hash() { return hash_; }
7392 return String::cast(key)->Hash();
7467 entry = table->FindInsertionEntry(key->Hash());
7507 int entry = cache->FindInsertionEntry(key.Hash());
7524 int entry = cache->FindInsertionEntry(key.Hash());
7545 int entry = cache->FindInsertionEntry(key.Hash());
7570 uint32_t Hash() { return HashForObject(symbols_); }
7575 uint32_t hash = 0;
7577 hash ^= String::cast(symbols->get(i))->Hash();
7579 return hash;
7603 int entry = cache->FindInsertionEntry(key.Hash());
7745 AddEntry(key, value, details, Shape::Hash(key));
7759 AddEntry(key, value, details, Shape::Hash(key));
7768 uint32_t hash) {
7773 uint32_t entry = Dictionary<Shape, Key>::FindInsertionEntry(hash);
