v8::internal::compiler::GraphVisualizer Class Reference

Inheritance diagram for v8::internal::compiler::GraphVisualizer:

Collaboration diagram for v8::internal::compiler::GraphVisualizer:

Public Member Functions
	GraphVisualizer (OStream &os, Zone *zone, const Graph *graph)
void	Print ()
GenericGraphVisit::Control	Pre (Node *node)
GenericGraphVisit::Control	PreEdge (Node *from, int index, Node *to)
Public Member Functions inherited from v8::internal::compiler::GenericGraphVisit::NullNodeVisitor< B, S >
Control	Pre (GenericNode< B, S > *node)
Control	Post (GenericNode< B, S > *node)
void	PreEdge (GenericNode< B, S > *from, int index, GenericNode< B, S > *to)
void	PostEdge (GenericNode< B, S > *from, int index, GenericNode< B, S > *to)

Private Member Functions
void	AnnotateNode (Node *node)
void	PrintEdge (Node::Edge edge)
	DISALLOW_COPY_AND_ASSIGN (GraphVisualizer)

Private Attributes
Zone *	zone_
NodeSet	all_nodes_
NodeSet	white_nodes_
bool	use_to_def_
OStream &	os_
const Graph *const	graph_

Detailed Description

Definition at line 160 of file graph-visualizer.cc.

Constructor & Destructor Documentation

GraphVisualizer()

v8::internal::compiler::GraphVisualizer::GraphVisualizer	(	OStream &	os,
		Zone *	zone,
		const Graph *	graph
	)

Definition at line 370 of file graph-visualizer.cc.

    : zone_(zone),
      all_nodes_(NodeSet::key_compare(), NodeSet::allocator_type(zone)),
      white_nodes_(NodeSet::key_compare(), NodeSet::allocator_type(zone)),
      use_to_def_(true),
      os_(os),
      graph_(graph) {}

Member Function Documentation

AnnotateNode()

void v8::internal::compiler::GraphVisualizer::AnnotateNode ( Node *  node )

private

Definition at line 238 of file graph-visualizer.cc.

                                             {
  if (!use_to_def_) {
    os_ << "    style=\"filled\"\n"
        << "    fillcolor=\"" DEAD_COLOR "\"\n";
  }
 
  os_ << "    shape=\"record\"\n";
  switch (node->opcode()) {
    case IrOpcode::kEnd:
    case IrOpcode::kDead:
    case IrOpcode::kStart:
      os_ << "    style=\"diagonals\"\n";
      break;
    case IrOpcode::kMerge:
    case IrOpcode::kIfTrue:
    case IrOpcode::kIfFalse:
    case IrOpcode::kLoop:
      os_ << "    style=\"rounded\"\n";
      break;
    default:
      break;
  }
 
  OStringStream label;
  label << *node->op();
  os_ << "    label=\"{{#" << node->id() << ":" << Escaped(label);
 
  InputIter i = node->inputs().begin();
  for (int j = OperatorProperties::GetValueInputCount(node->op()); j > 0;
       ++i, j--) {
    os_ << "|<I" << i.index() << ">#" << (*i)->id();
  }
  for (int j = OperatorProperties::GetContextInputCount(node->op()); j > 0;
       ++i, j--) {
    os_ << "|<I" << i.index() << ">X #" << (*i)->id();
  }
  for (int j = OperatorProperties::GetFrameStateInputCount(node->op()); j > 0;
       ++i, j--) {
    os_ << "|<I" << i.index() << ">F #" << (*i)->id();
  }
  for (int j = OperatorProperties::GetEffectInputCount(node->op()); j > 0;
       ++i, j--) {
    os_ << "|<I" << i.index() << ">E #" << (*i)->id();
  }
 
  if (!use_to_def_ || OperatorProperties::IsBasicBlockBegin(node->op()) ||
      GetControlCluster(node) == NULL) {
    for (int j = OperatorProperties::GetControlInputCount(node->op()); j > 0;
         ++i, j--) {
      os_ << "|<I" << i.index() << ">C #" << (*i)->id();
    }
  }
  os_ << "}";
 
  if (FLAG_trace_turbo_types && !NodeProperties::IsControl(node)) {
    Bounds bounds = NodeProperties::GetBounds(node);
    OStringStream upper;
    bounds.upper->PrintTo(upper);
    OStringStream lower;
    bounds.lower->PrintTo(lower);
    os_ << "|" << Escaped(upper) << "|" << Escaped(lower);
  }
  os_ << "}\"\n";
}

References DEAD_COLOR, v8::internal::compiler::NodeProperties::GetBounds(), v8::internal::compiler::OperatorProperties::GetContextInputCount(), v8::internal::compiler::GetControlCluster(), v8::internal::compiler::OperatorProperties::GetControlInputCount(), v8::internal::compiler::OperatorProperties::GetEffectInputCount(), v8::internal::compiler::OperatorProperties::GetFrameStateInputCount(), v8::internal::compiler::OperatorProperties::GetValueInputCount(), v8::internal::compiler::OperatorProperties::IsBasicBlockBegin(), v8::internal::compiler::NodeProperties::IsControl(), v8::internal::BoundsImpl< Config >::lower, NULL, os_, v8::internal::BoundsImpl< Config >::upper, and use_to_def_.

Referenced by Pre().

Here is the call graph for this function:

Here is the caller graph for this function:

DISALLOW_COPY_AND_ASSIGN()

v8::internal::compiler::GraphVisualizer::DISALLOW_COPY_AND_ASSIGN ( GraphVisualizer  )

private

Pre()

GenericGraphVisit::Control v8::internal::compiler::GraphVisualizer::Pre

(

Node *

node

)

Definition at line 197 of file graph-visualizer.cc.

                                                        {
  if (all_nodes_.count(node) == 0) {
    Node* control_cluster = GetControlCluster(node);
    if (control_cluster != NULL) {
      os_ << "  subgraph cluster_BasicBlock" << control_cluster->id() << " {\n";
    }
    os_ << "  ID" << node->id() << " [\n";
    AnnotateNode(node);
    os_ << "  ]\n";
    if (control_cluster != NULL) os_ << "  }\n";
    all_nodes_.insert(node);
    if (use_to_def_) white_nodes_.insert(node);
  }
  return GenericGraphVisit::CONTINUE;
}

References all_nodes_, AnnotateNode(), v8::internal::compiler::GenericGraphVisit::CONTINUE, v8::internal::compiler::GetControlCluster(), NULL, os_, use_to_def_, and white_nodes_.

Here is the call graph for this function:

PreEdge()

GenericGraphVisit::Control v8::internal::compiler::GraphVisualizer::PreEdge	(	Node *	from,
		int	index,
		Node *	to
	)

Definition at line 214 of file graph-visualizer.cc.

                                                              {
  if (use_to_def_) return GenericGraphVisit::CONTINUE;
  // When going from def to use, only consider white -> other edges, which are
  // the dead nodes that use live nodes. We're probably not interested in
  // dead nodes that only use other dead nodes.
  if (white_nodes_.count(from) > 0) return GenericGraphVisit::CONTINUE;
  return GenericGraphVisit::SKIP;
}

References v8::internal::compiler::GenericGraphVisit::CONTINUE, v8::internal::compiler::GenericGraphVisit::SKIP, use_to_def_, and white_nodes_.

Print()

void v8::internal::compiler::GraphVisualizer::Print

(

)

Definition at line 330 of file graph-visualizer.cc.

                            {
  os_ << "digraph D {\n"
      << "  node [fontsize=8,height=0.25]\n"
      << "  rankdir=\"BT\"\n"
      << "  ranksep=\"1.2 equally\"\n"
      << "  overlap=\"false\"\n"
      << "  splines=\"true\"\n"
      << "  concentrate=\"true\"\n"
      << "  \n";
 
  // Make sure all nodes have been output before writing out the edges.
  use_to_def_ = true;
  // TODO(svenpanne) Remove the need for the const_casts.
  const_cast<Graph*>(graph_)->VisitNodeInputsFromEnd(this);
  white_nodes_.insert(const_cast<Graph*>(graph_)->start());
 
  // Visit all uses of white nodes.
  use_to_def_ = false;
  GenericGraphVisit::Visit<GraphVisualizer, NodeUseIterationTraits<Node> >(
      const_cast<Graph*>(graph_), zone_, white_nodes_.begin(),
      white_nodes_.end(), this);
 
  os_ << "  DEAD_INPUT [\n"
      << "    style=\"filled\" \n"
      << "    fillcolor=\"" DEAD_COLOR "\"\n"
      << "  ]\n"
      << "\n";
 
  // With all the nodes written, add the edges.
  for (NodeSetIter i = all_nodes_.begin(); i != all_nodes_.end(); ++i) {
    Node::Inputs inputs = (*i)->inputs();
    for (Node::Inputs::iterator iter(inputs.begin()); iter != inputs.end();
         ++iter) {
      PrintEdge(iter.edge());
    }
  }
  os_ << "}\n";
}

References all_nodes_, DEAD_COLOR, graph_, os_, PrintEdge(), v8::internal::compiler::GenericGraph< V >::start(), use_to_def_, white_nodes_, and zone_.

Referenced by v8::internal::compiler::operator<<().

Here is the call graph for this function:

Here is the caller graph for this function:

PrintEdge()

void v8::internal::compiler::GraphVisualizer::PrintEdge ( Node::Edge  edge )

private

Definition at line 304 of file graph-visualizer.cc.

                                             {
  Node* from = edge.from();
  int index = edge.index();
  Node* to = edge.to();
  bool unconstrained = IsLikelyBackEdge(from, index, to);
  os_ << "  ID" << from->id();
  if (all_nodes_.count(to) == 0) {
    os_ << ":I" << index << ":n -> DEAD_INPUT";
  } else if (OperatorProperties::IsBasicBlockBegin(from->op()) ||
             GetControlCluster(from) == NULL ||
             (OperatorProperties::GetControlInputCount(from->op()) > 0 &&
              NodeProperties::GetControlInput(from) != to)) {
    os_ << ":I" << index << ":n -> ID" << to->id() << ":s"
        << "[" << (unconstrained ? "constraint=false, " : "")
        << (NodeProperties::IsControlEdge(edge) ? "style=bold, " : "")
        << (NodeProperties::IsEffectEdge(edge) ? "style=dotted, " : "")
        << (NodeProperties::IsContextEdge(edge) ? "style=dashed, " : "") << "]";
  } else {
    os_ << " -> ID" << to->id() << ":s [color=transparent, "
        << (unconstrained ? "constraint=false, " : "")
        << (NodeProperties::IsControlEdge(edge) ? "style=dashed, " : "") << "]";
  }
  os_ << "\n";
}

References all_nodes_, v8::internal::compiler::GetControlCluster(), v8::internal::compiler::NodeProperties::GetControlInput(), v8::internal::compiler::OperatorProperties::GetControlInputCount(), v8::internal::compiler::OperatorProperties::IsBasicBlockBegin(), v8::internal::compiler::NodeProperties::IsContextEdge(), v8::internal::compiler::NodeProperties::IsControlEdge(), v8::internal::compiler::NodeProperties::IsEffectEdge(), v8::internal::compiler::IsLikelyBackEdge(), NULL, os_, and to().

Referenced by Print().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

all_nodes_

NodeSet v8::internal::compiler::GraphVisualizer::all_nodes_

private

Definition at line 174 of file graph-visualizer.cc.

Referenced by Pre(), Print(), and PrintEdge().

graph_

const Graph* const v8::internal::compiler::GraphVisualizer::graph_

private

Definition at line 178 of file graph-visualizer.cc.

Referenced by Print().

os_

OStream& v8::internal::compiler::GraphVisualizer::os_

private

Definition at line 177 of file graph-visualizer.cc.

Referenced by AnnotateNode(), Pre(), Print(), and PrintEdge().

use_to_def_

bool v8::internal::compiler::GraphVisualizer::use_to_def_

private

Definition at line 176 of file graph-visualizer.cc.

Referenced by AnnotateNode(), Pre(), PreEdge(), and Print().

white_nodes_

NodeSet v8::internal::compiler::GraphVisualizer::white_nodes_

private

Definition at line 175 of file graph-visualizer.cc.

Referenced by Pre(), PreEdge(), and Print().

zone_

Zone* v8::internal::compiler::GraphVisualizer::zone_

private

Definition at line 173 of file graph-visualizer.cc.

Referenced by Print().

---

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

• /mnt/V8SourceCode/src/compiler/graph-visualizer.cc