184 ProfileNode* ProfileNode::FindChild(CodeEntry* entry) {  in FindChild()
188       reinterpret_cast<ProfileNode*>(map_entry->value) : NULL;  in FindChild()
192 ProfileNode* ProfileNode::FindOrAddChild(CodeEntry* entry) {  in FindOrAddChild()
197     ProfileNode* new_node = new ProfileNode(tree_, entry);  in FindOrAddChild()
201   return reinterpret_cast<ProfileNode*>(map_entry->value);  in FindOrAddChild()
205 void ProfileNode::Print(int indent) {  in Print()
215     reinterpret_cast<ProfileNode*>(p->value)->Print(indent + 2);  in Print()
222   void BeforeTraversingChild(ProfileNode*, ProfileNode*) { }  in BeforeTraversingChild()  argument
224   void AfterAllChildrenTraversed(ProfileNode* node) {  in AfterAllChildrenTraversed()
228   void AfterChildTraversed(ProfileNode*, ProfileNode*) { }  in AfterChildTraversed()  argument
235       root_(new ProfileNode(this, &root_entry_)) {  in ProfileTree()
245 ProfileNode* ProfileTree::AddPathFromEnd(const Vector<CodeEntry*>& path) {  in AddPathFromEnd()
246   ProfileNode* node = root_;  in AddPathFromEnd()
260   ProfileNode* node = root_;  in AddPathFromStart()
273   NodesPair(ProfileNode* src, ProfileNode* dst)  in NodesPair()
275   ProfileNode* src;
276   ProfileNode* dst;
282   explicit Position(ProfileNode* node)  in Position()
284   INLINE(ProfileNode* current_child()) {  in INLINE()
292   ProfileNode* node;
331   ProfileNode* top_frame_node = top_down_.AddPathFromEnd(path);  in AddPath()