| OLD | NEW |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 #include "vm/megamorphic_cache_table.h" | 5 #include "vm/megamorphic_cache_table.h" |
| 6 | 6 |
| 7 #include <stdlib.h> | 7 #include <stdlib.h> |
| 8 #include "vm/object.h" | 8 #include "vm/object.h" |
| 9 #include "vm/object_store.h" | 9 #include "vm/object_store.h" |
| 10 #include "vm/stub_code.h" | 10 #include "vm/stub_code.h" |
| 11 #include "vm/symbols.h" | 11 #include "vm/symbols.h" |
| 12 | 12 |
| 13 namespace dart { | 13 namespace dart { |
| 14 | 14 |
| 15 RawMegamorphicCache* MegamorphicCacheTable::Lookup(Isolate* isolate, | 15 RawMegamorphicCache* MegamorphicCacheTable::Lookup(Isolate* isolate, |
| 16 const String& name, | 16 const String& name, |
| 17 const Array& descriptor) { | 17 const Array& descriptor) { |
| 18 ASSERT(name.IsSymbol()); | 18 ASSERT(name.IsSymbol()); |
| 19 // TODO(rmacnak): ASSERT(descriptor.IsCanonical()); | 19 // TODO(rmacnak): ASSERT(descriptor.IsCanonical()); |
| 20 | 20 |
| 21 // TODO(rmacnak): Make a proper hashtable a la symbol table. | 21 // TODO(rmacnak): Make a proper hashtable a la symbol table. |
| 22 GrowableObjectArray& table = GrowableObjectArray::Handle( | 22 GrowableObjectArray& table = GrowableObjectArray::Handle( |
| 23 isolate->object_store()->megamorphic_cache_table()); | 23 isolate->object_store()->megamorphic_cache_table()); |
| 24 if (table.IsNull()) { | 24 if (table.IsNull()) { |
| 25 table = GrowableObjectArray::New(); | 25 table = GrowableObjectArray::New(Heap::kOld); |
| 26 ASSERT((table.Length() % kEntrySize) == 0); | 26 ASSERT((table.Length() % kEntrySize) == 0); |
| 27 isolate->object_store()->set_megamorphic_cache_table(table); | 27 isolate->object_store()->set_megamorphic_cache_table(table); |
| 28 } else { | 28 } else { |
| 29 for (intptr_t i = 0; i < table.Length(); i += kEntrySize) { | 29 for (intptr_t i = 0; i < table.Length(); i += kEntrySize) { |
| 30 if ((table.At(i + kEntryNameOffset) == name.raw()) && | 30 if ((table.At(i + kEntryNameOffset) == name.raw()) && |
| 31 (table.At(i + kEntryDescriptorOffset) == descriptor.raw())) { | 31 (table.At(i + kEntryDescriptorOffset) == descriptor.raw())) { |
| 32 return MegamorphicCache::RawCast(table.At(i + kEntryCacheOffset)); | 32 return MegamorphicCache::RawCast(table.At(i + kEntryCacheOffset)); |
| 33 } | 33 } |
| 34 } | 34 } |
| 35 } | 35 } |
| 36 | 36 |
| 37 const MegamorphicCache& cache = | 37 const MegamorphicCache& cache = |
| 38 MegamorphicCache::Handle(MegamorphicCache::New()); | 38 MegamorphicCache::Handle(MegamorphicCache::New()); |
| 39 table.Add(name); | 39 table.Add(name, Heap::kOld); |
| 40 table.Add(descriptor); | 40 table.Add(descriptor, Heap::kOld); |
| 41 table.Add(cache); | 41 table.Add(cache, Heap::kOld); |
| 42 ASSERT((table.Length() % kEntrySize) == 0); | 42 ASSERT((table.Length() % kEntrySize) == 0); |
| 43 return cache.raw(); | 43 return cache.raw(); |
| 44 } | 44 } |
| 45 | 45 |
| 46 | 46 |
| 47 RawFunction* MegamorphicCacheTable::miss_handler(Isolate* isolate) { | 47 RawFunction* MegamorphicCacheTable::miss_handler(Isolate* isolate) { |
| 48 ASSERT(isolate->object_store()->megamorphic_miss_function() != | 48 ASSERT(isolate->object_store()->megamorphic_miss_function() != |
| 49 Function::null()); | 49 Function::null()); |
| 50 return isolate->object_store()->megamorphic_miss_function(); | 50 return isolate->object_store()->megamorphic_miss_function(); |
| 51 } | 51 } |
| (...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 92 cache ^= table.At(i + kEntryCacheOffset); | 92 cache ^= table.At(i + kEntryCacheOffset); |
| 93 buckets = cache.buckets(); | 93 buckets = cache.buckets(); |
| 94 size += MegamorphicCache::InstanceSize(); | 94 size += MegamorphicCache::InstanceSize(); |
| 95 size += Array::InstanceSize(buckets.Length()); | 95 size += Array::InstanceSize(buckets.Length()); |
| 96 } | 96 } |
| 97 OS::Print("%" Pd " megamorphic caches using %" Pd "KB.\n", | 97 OS::Print("%" Pd " megamorphic caches using %" Pd "KB.\n", |
| 98 table.Length() / kEntrySize, size / 1024); | 98 table.Length() / kEntrySize, size / 1024); |
| 99 } | 99 } |
| 100 | 100 |
| 101 } // namespace dart | 101 } // namespace dart |
| OLD | NEW |