Extend allocation profile testing

runtime/vm/profiler_service.cc

 // Copyright (c) 2015, 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/profiler_service.h"
 
 #include "vm/growable_array.h"
 #include "vm/native_symbol.h"
 #include "vm/object.h"
 #include "vm/os.h"
@@ skipping 86 matching lines @@
       table_index_(table_index),
       profile_codes_(0),
       exclusive_ticks_(0),
       inclusive_ticks_(0) {
   ASSERT((kind_ != kDartFunction) || !function_.IsNull());
   ASSERT((kind_ != kDartFunction) || (table_index_ >= 0));
   ASSERT(profile_codes_.length() == 0);
 }
 
 
+const char* ProfileFunction::Name() const {
+  if (name_ != NULL) {
+    return name_;
+  }
+  ASSERT(!function_.IsNull());
+  const String& func_name = String::Handle(function_.UserVisibleName());

[rmacnak, 2015/06/26 17:55:57]

QualifiedUserVisibleName

[Cutch, 2015/06/26 18:02:49]

Done.

+  return func_name.ToCString();
+}
+
 void ProfileFunction::Tick(bool exclusive, intptr_t inclusive_serial) {
   if (exclusive) {
     exclusive_ticks_++;
   } else {
     if (inclusive_serial_ == inclusive_serial) {
       // Already ticket.
       return;
     }
     inclusive_serial_ = inclusive_serial;
     inclusive_ticks_++;
@@ skipping 655 matching lines @@
 
 void ProfileTrieNode::SortChildren() {
   children_.Sort(ProfileTrieNodeCompare);
   // Recurse.
   for (intptr_t i = 0; i < children_.length(); i++) {
     children_[i]->SortChildren();
   }
 }
 
 
+intptr_t ProfileTrieNode::IndexOf(ProfileTrieNode* node) {
+  for (intptr_t i = 0; i < children_.length(); i++) {
+    if (children_[i] == node) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+
 class ProfileCodeTrieNode : public ProfileTrieNode {
  public:
   explicit ProfileCodeTrieNode(intptr_t table_index)
       : ProfileTrieNode(table_index) {
   }
 
   void PrintToJSONArray(JSONArray* array) const {
     ASSERT(array != NULL);
     // Write CodeRegion index.
     array->AddValue(table_index());
@@ skipping 1101 matching lines @@
   }
   {
     JSONArray function_trie(&obj, "inclusiveFunctionTrie");
     ProfileTrieNode* root = roots_[static_cast<intptr_t>(kInclusiveFunction)];
     ASSERT(root != NULL);
     root->PrintToJSONArray(&function_trie);
   }
 }
 
 
+void ProfileTrieWalker::Reset(Profile::TrieKind trie_kind) {
+  code_trie_ = Profile::IsCodeTrie(trie_kind);
+  parent_ = NULL;
+  current_ = profile_->GetTrieRoot(trie_kind);
+  ASSERT(current_ != NULL);
+}
+
+
+const char* ProfileTrieWalker::CurrentName() {
+  if (current_ == NULL) {
+    return NULL;
+  }
+  if (code_trie_) {
+    ProfileCode* code = profile_->GetCode(current_->table_index());
+    return code->name();
+  } else {
+    ProfileFunction* func = profile_->GetFunction(current_->table_index());
+    return func->Name();
+  }
+  UNREACHABLE();
+}
+
+
+bool ProfileTrieWalker::Down() {
+  if ((current_ == NULL) || (current_->NumChildren() == 0)) {
+    return false;
+  }
+  parent_ = current_;
+  current_ = current_->At(0);
+  return true;
+}
+
+
+bool ProfileTrieWalker::NextSibling() {
+  if (parent_ == NULL) {
+    return false;
+  }
+  intptr_t current_index = parent_->IndexOf(current_);
+  if (current_index < 0) {
+    return false;
+  }
+  current_index++;
+  if (current_index >= parent_->NumChildren()) {
+    return false;
+  }
+  current_ = parent_->At(current_index);
+  return true;
+}
+
+
 class NoAllocationSampleFilter : public SampleFilter {
  public:
   explicit NoAllocationSampleFilter(Isolate* isolate)
       : SampleFilter(isolate) {
   }
 
   bool FilterSample(Sample* sample) {
     return !sample->is_allocation_sample();
   }
 };
@@ skipping 43 matching lines @@
   ASSERT(sample_buffer != NULL);
 
   ClearProfileVisitor clear_profile(isolate);
   sample_buffer->VisitSamples(&clear_profile);
 
   // Enable profile interrupts.
   Profiler::BeginExecution(isolate);
 }
 
 }  // namespace dart