Provide a logical view of VM-internal maps in Observatory.

runtime/vm/object.h

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #ifndef VM_OBJECT_H_
 #define VM_OBJECT_H_
 
 #include "include/dart_api.h"
 #include "platform/assert.h"
 #include "platform/utils.h"
@@ skipping 7215 matching lines @@
   RawSmi* deleted_keys() const {
     return raw_ptr()->deleted_keys_;
   }
   void SetDeletedKeys(intptr_t value) const {
     StoreSmi(&raw_ptr()->deleted_keys_, Smi::New(value));
   }
   static intptr_t deleted_keys_offset() {
     return OFFSET_OF(RawLinkedHashMap, deleted_keys_);
   }
 
+  intptr_t Length() const {
+    intptr_t used = Smi::Value(raw_ptr()->used_data_);
+    intptr_t deleted = Smi::Value(raw_ptr()->deleted_keys_);
+    return (used >> 1) - deleted;
+  }
+
+  // This iterator differs somewhat from its Dart counterpart (_CompactIterator
+  // in runtime/lib/compact_hash.dart):
+  //  - There are no checks for concurrent modifications.
+  //  - Accessing a key or value before the first call to MoveNext and after
+  //    MoveNext returns false will result in crashes.
+  class Iterator : ValueObject {
+   public:
+    explicit Iterator(const LinkedHashMap& map)
+      : map_(map),
+        data_(Array::Handle(map.data())),
+        scratch_(Object::Handle()),
+        offset_(-2),
+        length_(Smi::Value(map.used_data())) {}
+
+    bool MoveNext() {
+      while (true) {
+        offset_ += 2;
+        if (offset_ >= length_) {
+          return false;
+        }
+        scratch_ = data_.At(offset_);
+        if (scratch_.raw() != data_.raw()) {
+          // Slot is not deleted (self-reference indicates deletion).
+          return true;
+        }
+      }
+    }
+
+    RawObject* CurrentKey() const {
+      return data_.At(offset_);
+    }
+
+    RawObject* CurrentValue() const {
+      return data_.At(offset_ + 1);
+    }
+
+   private:
+    const LinkedHashMap& map_;
+    const Array& data_;
+    Object& scratch_;
+    intptr_t offset_;
+    const intptr_t length_;
+  };
+
  private:
   FINAL_HEAP_OBJECT_IMPLEMENTATION(LinkedHashMap, Instance);
 
   // Keep this in sync with Dart implementation (lib/compact_hash.dart).
   static const intptr_t kInitialIndexBits = 3;
   static const intptr_t kInitialIndexSize = 1 << (kInitialIndexBits + 1);
 
   // Allocate a map, but leave all fields set to null.
   // Used during deserialization (since map might contain itself as key/value).
   static RawLinkedHashMap* NewUninitialized(Heap::Space space = Heap::kNew);
@@ skipping 550 matching lines @@
 
 
 RawObject* MegamorphicCache::GetTargetFunction(const Array& array,
                                                intptr_t index) {
   return array.At((index * kEntryLength) + kTargetFunctionIndex);
 }
 
 }  // namespace dart
 
 #endif  // VM_OBJECT_H_