C++ profiler: publish the new API, make compatible with WebKit / Chromium.

src/profile-generator.h

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 32 matching lines @@
                    const char* name,
                    const char* resource_name,
                    int line_number));
 
   INLINE(bool is_js_function() const);
   INLINE(const char* name_prefix() const) { return name_prefix_; }
   INLINE(bool has_name_prefix() const) { return name_prefix_[0] != '\0'; }
   INLINE(const char* name() const) { return name_; }
   INLINE(const char* resource_name() const) { return resource_name_; }
   INLINE(int line_number() const) { return line_number_; }
+  INLINE(unsigned long call_uid() const) { return call_uid_; }
 
   static const char* kEmptyNamePrefix;
-  static const int kNoLineNumberInfo;
 
  private:
+  const unsigned long call_uid_;
   Logger::LogEventsAndTags tag_;
   const char* name_prefix_;
   const char* name_;
   const char* resource_name_;
   int line_number_;
 
+  static unsigned long next_call_uid_;
+
   DISALLOW_COPY_AND_ASSIGN(CodeEntry);
 };
 
 
 class ProfileNode {
  public:
   INLINE(explicit ProfileNode(CodeEntry* entry));
 
   ProfileNode* FindChild(CodeEntry* entry);
   ProfileNode* FindOrAddChild(CodeEntry* entry);
@@ skipping 22 matching lines @@
   // CodeEntry* -> ProfileNode*
   HashMap children_;
   List<ProfileNode*> children_list_;
 
   DISALLOW_COPY_AND_ASSIGN(ProfileNode);
 };
 
 
 class ProfileTree {
  public:
-  ProfileTree() : root_(new ProfileNode(NULL)) { }
+  ProfileTree();
   ~ProfileTree();
 
   void AddPathFromEnd(const Vector<CodeEntry*>& path);
   void AddPathFromStart(const Vector<CodeEntry*>& path);
   void CalculateTotalTicks();
 
   ProfileNode* root() const { return root_; }
 
   void ShortPrint();
   void Print() {
     root_->Print(0);
   }
 
  private:
   template <typename Callback>
   void TraverseBreadthFirstPostOrder(Callback* callback);
 
+  CodeEntry root_entry_;
   ProfileNode* root_;
 
   DISALLOW_COPY_AND_ASSIGN(ProfileTree);
 };
 
 
 class CpuProfile {
  public:
   CpuProfile(const char* title, unsigned uid)
       : title_(title), uid_(uid) { }
@@ skipping 78 matching lines @@
                           String* name, String* resource_name, int line_number);
   CodeEntry* NewCodeEntry(Logger::LogEventsAndTags tag, const char* name);
   CodeEntry* NewCodeEntry(Logger::LogEventsAndTags tag,
                           const char* name_prefix, String* name);
   CodeEntry* NewCodeEntry(Logger::LogEventsAndTags tag, int args_count);
 
   // Called from profile generator thread.
   void AddPathToCurrentProfiles(const Vector<CodeEntry*>& path);
 
  private:
+  const char* GetFunctionName(String* name);
   const char* GetName(String* name);
   const char* GetName(int args_count);
 
   INLINE(static bool StringsMatch(void* key1, void* key2)) {
     return strcmp(reinterpret_cast<char*>(key1),
                   reinterpret_cast<char*>(key2)) == 0;
   }
 
   INLINE(static bool CpuProfilesMatch(void* key1, void* key2)) {
     return key1 == key2;
@@ skipping 43 matching lines @@
     return profiles_->NewCodeEntry(tag, args_count);
   }
 
   void RecordTickSample(const TickSample& sample);
 
   INLINE(CodeMap* code_map()) { return &code_map_; }
 
  private:
   CpuProfilesCollection* profiles_;
   CodeMap code_map_;
+  CodeEntry* program_entry_;
 
   DISALLOW_COPY_AND_ASSIGN(ProfileGenerator);
 };
 
 } }  // namespace v8::internal
 
 #endif  // ENABLE_CPP_PROFILES_PROCESSOR
 
 #endif  // V8_PROFILE_GENERATOR_H_