v8::internal::ProfileTree Class Reference

#include <profile-generator.h>

Collaboration diagram for v8::internal::ProfileTree:

Public Member Functions
	ProfileTree ()
	~ProfileTree ()
ProfileNode *	AddPathFromEnd (const Vector< CodeEntry * > &path)
void	AddPathFromStart (const Vector< CodeEntry * > &path)
ProfileNode *	root () const
unsigned	next_node_id ()
void	Print ()

Private Member Functions
template<typename Callback >
void	TraverseDepthFirst (Callback *callback)
	DISALLOW_COPY_AND_ASSIGN (ProfileTree)

Private Attributes
CodeEntry	root_entry_
unsigned	next_node_id_
ProfileNode *	root_

Detailed Description

Definition at line 147 of file profile-generator.h.

Constructor & Destructor Documentation

ProfileTree()

v8::internal::ProfileTree::ProfileTree

(

)

Definition at line 232 of file profile-generator.cc.

    : root_entry_(Logger::FUNCTION_TAG, "(root)"),
      next_node_id_(1),
      root_(new ProfileNode(this, &root_entry_)) {
}

~ProfileTree()

v8::internal::ProfileTree::~ProfileTree

(

)

Definition at line 239 of file profile-generator.cc.

                          {
  DeleteNodesCallback cb;
  TraverseDepthFirst(&cb);
}

References TraverseDepthFirst().

Here is the call graph for this function:

Member Function Documentation

AddPathFromEnd()

ProfileNode * v8::internal::ProfileTree::AddPathFromEnd

(

const Vector< CodeEntry * > &

path

)

Definition at line 245 of file profile-generator.cc.

                                                                       {
  ProfileNode* node = root_;
  for (CodeEntry** entry = path.start() + path.length() - 1;
       entry != path.start() - 1;
       --entry) {
    if (*entry != NULL) {
      node = node->FindOrAddChild(*entry);
    }
  }
  node->IncrementSelfTicks();
  return node;
}

References v8::internal::ProfileNode::FindOrAddChild(), v8::internal::ProfileNode::IncrementSelfTicks(), v8::internal::Vector< T >::length(), NULL, root_, and v8::internal::Vector< T >::start().

Referenced by v8::internal::CpuProfile::AddPath().

Here is the call graph for this function:

Here is the caller graph for this function:

AddPathFromStart()

void v8::internal::ProfileTree::AddPathFromStart

(

const Vector< CodeEntry * > &

path

)

Definition at line 259 of file profile-generator.cc.

                                                                 {
  ProfileNode* node = root_;
  for (CodeEntry** entry = path.start();
       entry != path.start() + path.length();
       ++entry) {
    if (*entry != NULL) {
      node = node->FindOrAddChild(*entry);
    }
  }
  node->IncrementSelfTicks();
}

References v8::internal::ProfileNode::FindOrAddChild(), v8::internal::ProfileNode::IncrementSelfTicks(), v8::internal::Vector< T >::length(), NULL, root_, and v8::internal::Vector< T >::start().

Here is the call graph for this function:

DISALLOW_COPY_AND_ASSIGN()

v8::internal::ProfileTree::DISALLOW_COPY_AND_ASSIGN ( ProfileTree  )

private

next_node_id()

unsigned v8::internal::ProfileTree::next_node_id ( )

inline

Definition at line 155 of file profile-generator.h.

{ return next_node_id_++; }

References next_node_id_.

Print()

void v8::internal::ProfileTree::Print ( )

inline

Definition at line 157 of file profile-generator.h.

               {
    root_->Print(0);
  }

References v8::internal::ProfileNode::Print(), and root_.

Referenced by v8::internal::CpuProfile::Print().

Here is the call graph for this function:

Here is the caller graph for this function:

root()

ProfileNode* v8::internal::ProfileTree::root ( ) const

inline

Definition at line 154 of file profile-generator.h.

{ return root_; }

References root_.

Referenced by v8::CpuProfile::GetTopDownRoot().

Here is the caller graph for this function:

TraverseDepthFirst()

template<typename Callback >

void v8::internal::ProfileTree::TraverseDepthFirst ( Callback *  callback )

private

Definition at line 300 of file profile-generator.cc.

                                                       {
  List<Position> stack(10);
  stack.Add(Position(root_));
  while (stack.length() > 0) {
    Position& current = stack.last();
    if (current.has_current_child()) {
      callback->BeforeTraversingChild(current.node, current.current_child());
      stack.Add(Position(current.current_child()));
    } else {
      callback->AfterAllChildrenTraversed(current.node);
      if (stack.length() > 1) {
        Position& parent = stack[stack.length() - 2];
        callback->AfterChildTraversed(parent.node, current.node);
        parent.next_child();
      }
      // Remove child from the stack.
      stack.RemoveLast();
    }
  }
}

References v8::internal::List< T, AllocationPolicy >::Add(), v8::internal::List< T, AllocationPolicy >::last(), v8::internal::Position::node, and root_.

Referenced by ~ProfileTree().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

next_node_id_

unsigned v8::internal::ProfileTree::next_node_id_

private

Definition at line 166 of file profile-generator.h.

Referenced by next_node_id().

root_

ProfileNode* v8::internal::ProfileTree::root_

private

Definition at line 167 of file profile-generator.h.

Referenced by AddPathFromEnd(), AddPathFromStart(), Print(), root(), and TraverseDepthFirst().

root_entry_

CodeEntry v8::internal::ProfileTree::root_entry_

private

Definition at line 165 of file profile-generator.h.

---

The documentation for this class was generated from the following files:

• /mnt/V8SourceCode/src/profile-generator.h
• /mnt/V8SourceCode/src/profile-generator.cc