C++ profiles processor: wire up to VM.

test/cctest/test-cpu-profiler.cc

 // Copyright 2010 the V8 project authors. All rights reserved.
 //
 // Tests of profiles generator and utilities.
 
 #ifdef ENABLE_CPP_PROFILES_PROCESSOR
 
 #include "v8.h"
 #include "cpu-profiler-inl.h"
 #include "cctest.h"
 
@@ skipping 92 matching lines @@
 
   // Check the state of profile generator.
   CodeEntry* entry1 = generator.code_map()->FindEntry(ToAddress(0x1000));
   CHECK_NE(NULL, entry1);
   CHECK_EQ(aaa_str, entry1->name());
   CodeEntry* entry2 = generator.code_map()->FindEntry(ToAddress(0x1200));
   CHECK_NE(NULL, entry2);
   CHECK_EQ("bbb", entry2->name());
   CodeEntry* entry3 = generator.code_map()->FindEntry(ToAddress(0x1300));
   CHECK_NE(NULL, entry3);
-  CHECK_EQ("args_count: 5", entry3->name());
+  CHECK_EQ("5", entry3->name());
   CHECK_EQ(NULL, generator.code_map()->FindEntry(ToAddress(0x1400)));
   CodeEntry* entry4 = generator.code_map()->FindEntry(ToAddress(0x1500));
   CHECK_NE(NULL, entry4);
   CHECK_EQ("ddd", entry4->name());
   CHECK_EQ(NULL, generator.code_map()->FindEntry(ToAddress(0x1600)));
   CodeEntry* entry5 = generator.code_map()->FindEntry(ToAddress(0x1700));
   CHECK_NE(NULL, entry5);
   CHECK_EQ(aaa_str, entry5->name());
 }
 
@@ skipping 35 matching lines @@
   CHECK_NE(NULL, profile);
 
   // Check call trees.
   const i::List<ProfileNode*>* top_down_root_children =
       profile->top_down()->root()->children();
   CHECK_EQ(1, top_down_root_children->length());
   CHECK_EQ("bbb", top_down_root_children->last()->entry()->name());
   const i::List<ProfileNode*>* top_down_bbb_children =
       top_down_root_children->last()->children();
   CHECK_EQ(1, top_down_bbb_children->length());
-  CHECK_EQ("args_count: 5", top_down_bbb_children->last()->entry()->name());
+  CHECK_EQ("5", top_down_bbb_children->last()->entry()->name());
   const i::List<ProfileNode*>* top_down_stub_children =
       top_down_bbb_children->last()->children();
   CHECK_EQ(1, top_down_stub_children->length());
   CHECK_EQ("ddd", top_down_stub_children->last()->entry()->name());
   const i::List<ProfileNode*>* top_down_ddd_children =
       top_down_stub_children->last()->children();
   CHECK_EQ(0, top_down_ddd_children->length());
 
   const i::List<ProfileNode*>* bottom_up_root_children_unsorted =
       profile->bottom_up()->root()->children();
   CHECK_EQ(3, bottom_up_root_children_unsorted->length());
   i::List<ProfileNode*> bottom_up_root_children(3);
   bottom_up_root_children.AddAll(*bottom_up_root_children_unsorted);
   bottom_up_root_children.Sort(&CompareProfileNodes);
-  CHECK_EQ("args_count: 5", bottom_up_root_children[0]->entry()->name());
+  CHECK_EQ("5", bottom_up_root_children[0]->entry()->name());
   CHECK_EQ("bbb", bottom_up_root_children[1]->entry()->name());
   CHECK_EQ("ddd", bottom_up_root_children[2]->entry()->name());
   const i::List<ProfileNode*>* bottom_up_stub_children =
       bottom_up_root_children[0]->children();
   CHECK_EQ(1, bottom_up_stub_children->length());
   CHECK_EQ("bbb", bottom_up_stub_children->last()->entry()->name());
   const i::List<ProfileNode*>* bottom_up_bbb_children =
       bottom_up_root_children[1]->children();
   CHECK_EQ(0, bottom_up_bbb_children->length());
   const i::List<ProfileNode*>* bottom_up_ddd_children =
       bottom_up_root_children[2]->children();
   CHECK_EQ(1, bottom_up_ddd_children->length());
-  CHECK_EQ("args_count: 5", bottom_up_ddd_children->last()->entry()->name());
+  CHECK_EQ("5", bottom_up_ddd_children->last()->entry()->name());
   const i::List<ProfileNode*>* bottom_up_ddd_stub_children =
       bottom_up_ddd_children->last()->children();
   CHECK_EQ(1, bottom_up_ddd_stub_children->length());
   CHECK_EQ("bbb", bottom_up_ddd_stub_children->last()->entry()->name());
 }
 
 #endif  // ENABLE_CPP_PROFILES_PROCESSOR