Track live instance and allocation counts for classes

runtime/vm/class_table.cc

 // 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.
 
 #include "vm/class_table.h"
 #include "vm/flags.h"
 #include "vm/freelist.h"
 #include "vm/object.h"
 #include "vm/raw_object.h"
 #include "vm/visitor.h"
 
 namespace dart {
 
 DEFINE_FLAG(bool, print_class_table, false, "Print initial class table.");
 
 ClassTable::ClassTable()
-    : top_(kNumPredefinedCids), capacity_(0), table_(NULL) {
+    : top_(kNumPredefinedCids), capacity_(0), table_(NULL),
+      class_heap_stats_table_(NULL),
+      predefined_class_heap_stats_table_(NULL) {
   if (Dart::vm_isolate() == NULL) {
     capacity_ = initial_capacity_;
     table_ = reinterpret_cast<RawClass**>(
         calloc(capacity_, sizeof(RawClass*)));  // NOLINT
   } else {
     // Duplicate the class table from the VM isolate.
     ClassTable* vm_class_table = Dart::vm_isolate()->class_table();
     capacity_ = vm_class_table->capacity_;
     table_ = reinterpret_cast<RawClass**>(
         calloc(capacity_, sizeof(RawClass*)));  // NOLINT
     for (intptr_t i = kObjectCid; i < kInstanceCid; i++) {
       table_[i] = vm_class_table->At(i);
     }
     table_[kFreeListElement] = vm_class_table->At(kFreeListElement);
     table_[kDynamicCid] = vm_class_table->At(kDynamicCid);
     table_[kVoidCid] = vm_class_table->At(kVoidCid);
+    predefined_class_heap_stats_table_ = reinterpret_cast<ClassHeapStats*>(
+        calloc(kNumPredefinedCids, sizeof(ClassHeapStats)));  // NOLINT
+    class_heap_stats_table_ = reinterpret_cast<ClassHeapStats*>(
+        calloc(capacity_, sizeof(ClassHeapStats)));  // NOLINT
+    for (intptr_t i = 0; i < capacity_; i++) {
+      class_heap_stats_table_[i].Initialize();
+    }
+  }
+  predefined_class_heap_stats_table_ = reinterpret_cast<ClassHeapStats*>(
+        calloc(kNumPredefinedCids, sizeof(ClassHeapStats)));  // NOLINT
+  for (intptr_t i = 0; i < kNumPredefinedCids; i++) {
+    predefined_class_heap_stats_table_[i].Initialize();
   }
 }
 
 
 ClassTable::~ClassTable() {
   free(table_);
+  free(predefined_class_heap_stats_table_);
+  free(class_heap_stats_table_);
 }
 
 
 void ClassTable::Register(const Class& cls) {
   intptr_t index = cls.id();
   if (index != kIllegalCid) {
     ASSERT(index > 0);
     ASSERT(index < kNumPredefinedCids);
     ASSERT(table_[index] == 0);
     ASSERT(index < capacity_);
     table_[index] = cls.raw();
     // Add the vtable for this predefined class into the static vtable registry
     // if it has not been setup yet.
     cpp_vtable cls_vtable = cls.handle_vtable();
     cpp_vtable table_entry = Object::builtin_vtables_[index];
     ASSERT((table_entry == 0) || (table_entry == cls_vtable));
     if (table_entry == 0) {
       Object::builtin_vtables_[index] = cls_vtable;
     }
   } else {
     if (top_ == capacity_) {
       // Grow the capacity of the class table.
       intptr_t new_capacity = capacity_ + capacity_increment_;
       RawClass** new_table = reinterpret_cast<RawClass**>(
           realloc(table_, new_capacity * sizeof(RawClass*)));  // NOLINT
+      ClassHeapStats* new_stats_table = reinterpret_cast<ClassHeapStats*>(
+          realloc(class_heap_stats_table_,
+                  new_capacity * sizeof(ClassHeapStats)));  // NOLINT
       for (intptr_t i = capacity_; i < new_capacity; i++) {
         new_table[i] = NULL;
+        new_stats_table[i].Initialize();
       }
       capacity_ = new_capacity;
       table_ = new_table;
+      class_heap_stats_table_ = new_stats_table;
     }
     ASSERT(top_ < capacity_);
     cls.set_id(top_);
     table_[top_] = cls.raw();
     top_++;  // Increment next index.
   }
 }
 
 
 void ClassTable::VisitObjectPointers(ObjectPointerVisitor* visitor) {
@@ skipping 24 matching lines @@
     JSONArray members(&jsobj, "members");
     for (intptr_t i = 1; i < top_; i++) {
       if (HasValidClassAt(i)) {
         cls = At(i);
         members.AddValue(cls);
       }
     }
   }
 }
 
+
+void ClassHeapStats::Initialize() {
+  live_count_old_space = 0;
+  live_count_new_space = 0;
+  live_size_old_space = 0;
+  live_size_new_space = 0;
+  new_count_since_gc_new_space = 0;
+  new_count_since_gc_old_space = 0;
+  new_size_since_gc_new_space = 0;
+  new_size_since_gc_old_space = 0;
+}
+
+
+void ClassHeapStats::ResetAtGC() {
+  live_count_old_space = 0;
+  live_count_new_space = 0;
+  live_size_old_space = 0;
+  live_size_new_space = 0;
+  new_count_since_gc_new_space = 0;
+  new_count_since_gc_old_space = 0;
+  new_size_since_gc_new_space = 0;
+  new_size_since_gc_old_space = 0;
+}
+
+
+void ClassTable::AllocateClassNewSpace(intptr_t cid, intptr_t size) {
+  ClassHeapStats* stats = FindClassHeapStats(cid);
+  ASSERT(stats != NULL);
+  ASSERT(size != 0);
+  stats->new_count_since_gc_new_space++;
+  stats->new_size_since_gc_new_space += size;
+}
+
+
+void ClassTable::AllocateClassOldSpace(intptr_t cid, intptr_t size) {
+  ClassHeapStats* stats = FindClassHeapStats(cid);
+  ASSERT(stats != NULL);
+  ASSERT(size != 0);
+  stats->new_count_since_gc_old_space++;
+  stats->new_size_since_gc_old_space += size;
+}
+
+
+//  #define DEBUG_PRINT
+
+#if defined(DEBUG_PRINT)
+static void PrintClassHeapStats(intptr_t cid, const ClassHeapStats& stat) {
+  int new_new = static_cast<int>(stat.new_count_since_gc_new_space);
+  int new_old = static_cast<int>(stat.new_count_since_gc_old_space);
+  int b_new = static_cast<int>(stat.new_size_since_gc_new_space);
+  int b_old = static_cast<int>(stat.new_size_since_gc_old_space);
+  printf("%d (%d %d) [%d %d]\n", static_cast<int>(cid),
+                                 new_new, b_new, new_old, b_old);
+}
+#endif
+
+
+void ClassTable::Collect() {
+  Isolate* isolate = Isolate::Current();
+  ASSERT(isolate != NULL);
+#if defined(DEBUG_PRINT)
+  for (intptr_t i = 0; i < kNumPredefinedCids; i++) {
+    const ClassHeapStats& stat = predefined_class_heap_stats_table_[i];
+    if ((stat.new_count_since_gc_new_space > 0) ||
+        (stat.new_count_since_gc_old_space > 0)) {
+      PrintClassHeapStats(i, stat);
+    }
+  }
+  for (intptr_t i = kNumPredefinedCids; i < top_; i++) {
+    const ClassHeapStats& stat = class_heap_stats_table_[i];
+    if ((stat.new_count_since_gc_new_space > 0) ||
+        (stat.new_count_since_gc_old_space > 0)) {
+      PrintClassHeapStats(i, stat);
+    }
+  }
+#endif
+  ResetCounters();
+}
+
+
+ClassHeapStats* ClassTable::FindClassHeapStats(intptr_t cid) {
+  ASSERT(cid > 0);
+  if (cid < kNumPredefinedCids) {
+    return &predefined_class_heap_stats_table_[cid];
+  }
+  ASSERT(cid < top_);
+  return &class_heap_stats_table_[cid];
+}
+
+
+void ClassTable::ResetCounters() {
+  for (intptr_t i = 0; i < kNumPredefinedCids; i++) {
+    predefined_class_heap_stats_table_[i].ResetAtGC();
+  }
+  for (intptr_t i = kNumPredefinedCids; i < top_; i++) {
+    class_heap_stats_table_[i].ResetAtGC();
+  }
+}
+
+
+void ClassTable::ReportLiveOldSpace(intptr_t cid, intptr_t size) {
+  ClassHeapStats* stats = FindClassHeapStats(cid);
+  ASSERT(stats != NULL);
+  ASSERT(size != 0);
+  stats->live_count_old_space++;
+  stats->live_size_old_space += size;
+}
+
+
+void ClassTable::ReportLiveNewSpace(intptr_t cid, intptr_t size) {
+  ClassHeapStats* stats = FindClassHeapStats(cid);
+  ASSERT(stats != NULL);
+  ASSERT(size != 0);
+  stats->live_count_new_space++;
+  stats->live_size_new_space += size;
+}
+
+
 }  // namespace dart