| Index: src/heap/heap-inl.h
|
| diff --git a/src/heap/heap-inl.h b/src/heap/heap-inl.h
|
| index 21f465fe7863741665c3eac6d7afee9542dcb3e9..435b8c8130629e8c016c7d483b15a89bf7e5c185 100644
|
| --- a/src/heap/heap-inl.h
|
| +++ b/src/heap/heap-inl.h
|
| @@ -659,35 +659,6 @@ void Heap::ExternalStringTable::ShrinkNewStrings(int position) {
|
| #endif
|
| }
|
|
|
| -// static
|
| -int DescriptorLookupCache::Hash(Object* source, Name* name) {
|
| - DCHECK(name->IsUniqueName());
|
| - // Uses only lower 32 bits if pointers are larger.
|
| - uint32_t source_hash =
|
| - static_cast<uint32_t>(reinterpret_cast<uintptr_t>(source)) >>
|
| - kPointerSizeLog2;
|
| - uint32_t name_hash = name->hash_field();
|
| - return (source_hash ^ name_hash) % kLength;
|
| -}
|
| -
|
| -int DescriptorLookupCache::Lookup(Map* source, Name* name) {
|
| - int index = Hash(source, name);
|
| - Key& key = keys_[index];
|
| - if ((key.source == source) && (key.name == name)) return results_[index];
|
| - return kAbsent;
|
| -}
|
| -
|
| -
|
| -void DescriptorLookupCache::Update(Map* source, Name* name, int result) {
|
| - DCHECK(result != kAbsent);
|
| - int index = Hash(source, name);
|
| - Key& key = keys_[index];
|
| - key.source = source;
|
| - key.name = name;
|
| - results_[index] = result;
|
| -}
|
| -
|
| -
|
| void Heap::ClearInstanceofCache() {
|
| set_instanceof_cache_function(Smi::FromInt(0));
|
| }
|
|
|