Cross Reference: /external/chromium

Lines Matching refs:Hash
843     uint32_t hash = Name::cast(this)->Hash();
847     uint32_t hash = Oddball::cast(this)->to_string()->Hash();
1044   if (is_internalized) self->Hash();  // Force regeneration of the hash value.
1104   if (is_internalized) self->Hash();  // Force regeneration of the hash value.
1474       os << "<Symbol: " << symbol->Hash();
7457     return name->Hash() ^ flags;
7460   uint32_t Hash() OVERRIDE { return NameFlagsHashHelper(*name_, flags_); }
7500   int entry = new_cache->FindInsertionEntry(key.Hash());
7603       hash ^= maps->at(i)->Hash();
7608   uint32_t Hash() OVERRIDE {
7669   int entry = cache->FindInsertionEntry(key.Hash());
7848     const uint32_t parent_hash = GetSortedKey(i)->Hash();
7851       uint32_t child_hash = GetSortedKey(child_index)->Hash();
7853         uint32_t right_child_hash = GetSortedKey(child_index + 1)->Hash();
7872     const uint32_t parent_hash = GetSortedKey(parent_index)->Hash();
7876       uint32_t child_hash = GetSortedKey(child_index)->Hash();
7878         uint32_t right_child_hash = GetSortedKey(child_index + 1)->Hash();
8672       if (Hash() != other->Hash()) {
8684     if (Hash() != other->Hash()) return false;
8716       if (one->Hash() != two->Hash()) {
8728     if (one->Hash() != two->Hash()) return false;
8838   uint32_t field = IteratingStringHasher::Hash(this, GetHeap()->HashSeed());
8860     Hash();  // force computation of hash code
9002 int Map::Hash() {
13559     uint32_t hash = source->Hash();
13567       hash ^= String::cast(script->source())->Hash();
13574   uint32_t Hash() OVERRIDE {
13627   uint32_t Hash() OVERRIDE { return RegExpHash(*string_, flags_); }
13643     return string->Hash() + flags->value();
13652   if (hash_field_ == 0) Hash();
13658   if (hash_field_ == 0) Hash();
13664   if (hash_field_ == 0) Hash();
13686   virtual uint32_t Hash() OVERRIDE { return string_->Hash(); }
13689     return String::cast(other)->Hash();
13708     return String::cast(obj)->Hash();
13774   uint32_t entry = FirstProbe(key->Hash(), capacity);
14617   uint32_t Hash() OVERRIDE { return hash_; }
14620     return String::cast(key)->Hash();
14706   entry = table->FindInsertionEntry(key->Hash());
14760   int entry = cache->FindInsertionEntry(key.Hash());
14776   int entry = cache->FindInsertionEntry(key.Hash());
14789   int entry = cache->FindInsertionEntry(key.Hash());
14830   uint32_t Hash() OVERRIDE { return HashForObject(*strings_); }
14837       hash ^= String::cast(strings->get(i))->Hash();
14863   int entry = new_cache->FindInsertionEntry(key.Hash());
14991   AddEntry(dictionary, key, value, details, dictionary->Hash(key));
15007   AddEntry(dictionary, key, value, details, dictionary->Hash(key));
15366   table->AddEntry(table->FindInsertionEntry(table->Hash(key)), key, value);