Extend allocation profile testing

runtime/vm/profiler_service.h

 // 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.
 
 #ifndef VM_PROFILER_SERVICE_H_
 #define VM_PROFILER_SERVICE_H_
 
 #include "vm/allocation.h"
 #include "vm/code_observers.h"
 #include "vm/globals.h"
@@ skipping 32 matching lines @@
   ProfileFunction(Kind kind,
                   const char* name,
                   const Function& function,
                   const intptr_t table_index);
 
   const char* name() const {
     ASSERT(name_ != NULL);
     return name_;
   }
 
+  const char* Name() const;
+
   RawFunction* function() const {
     return function_.raw();
   }
 
   intptr_t table_index() const {
     return table_index_;
   }
 
   Kind kind() const {
     return kind_;
@@ skipping 176 matching lines @@
   }
 
   intptr_t NumChildren() const {
     return children_.length();
   }
 
   ProfileTrieNode* At(intptr_t i) {
     return children_.At(i);
   }
 
+  intptr_t IndexOf(ProfileTrieNode* node);
+
  protected:
   void SortChildren();
 
   static int ProfileTrieNodeCompare(ProfileTrieNode* const* a,
                                     ProfileTrieNode* const* b) {
     ASSERT(a != NULL);
     ASSERT(b != NULL);
     return (*b)->count() - (*a)->count();
   }
 
@@ skipping 19 matching lines @@
   };
 
   enum TrieKind {
     kExclusiveCode,
     kExclusiveFunction,
     kInclusiveCode,
     kInclusiveFunction,
     kNumTrieKinds,
   };
 
+  static bool IsCodeTrie(TrieKind kind) {
+    return (kind == kExclusiveCode) || (kind == kInclusiveCode);
+  }
+
+  static bool IsFunctionTrie(TrieKind kind) {
+    return !IsCodeTrie(kind);
+  }
+
   explicit Profile(Isolate* isolate);
 
   // Build a filtered model using |filter| with the specified |tag_order|.
   void Build(SampleFilter* filter, TagOrder tag_order);
 
   // After building:
   int64_t min_time() const { return min_time_; }
   int64_t max_time() const { return max_time_; }
   int64_t GetTimeSpan() const {
     return max_time() - min_time();
@@ skipping 19 matching lines @@
 
   int64_t min_time_;
   int64_t max_time_;
 
   intptr_t sample_count_;
 
   friend class ProfileBuilder;
 };
 
 
+class ProfileTrieWalker : public ValueObject {
+ public:
+  explicit ProfileTrieWalker(Profile* profile)
+      : profile_(profile),
+        parent_(NULL),
+        current_(NULL),
+        code_trie_(false) {
+    ASSERT(profile_ != NULL);
+  }
+
+  void Reset(Profile::TrieKind trie_kind);
+
+  const char* CurrentName();
+
+  bool Down();
+  bool NextSibling();
+
+ private:
+  Profile* profile_;
+  ProfileTrieNode* parent_;
+  ProfileTrieNode* current_;
+  bool code_trie_;
+};
+
+
 class ProfilerService : public AllStatic {
  public:
   static void PrintJSON(JSONStream* stream,
                         Profile::TagOrder tag_order);
 
   static void ClearSamples();
 };
 
 }  // namespace dart
 
 #endif  // VM_PROFILER_SERVICE_H_