mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-17 21:29:20 +00:00
* Significantly refactor GraphWriter into a class.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4194 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
f29e307765
commit
8c836ce4f8
@ -49,24 +49,45 @@ namespace DOT { // Private functions...
|
||||
}
|
||||
|
||||
template<typename GraphType>
|
||||
std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
class GraphWriter {
|
||||
std::ostream &O;
|
||||
const GraphType &G;
|
||||
|
||||
typedef DOTGraphTraits<GraphType> DOTTraits;
|
||||
typedef GraphTraits<GraphType> GTraits;
|
||||
typedef typename GTraits::NodeType NodeType;
|
||||
typedef typename GTraits::nodes_iterator node_iterator;
|
||||
|
||||
typedef typename GTraits::ChildIteratorType child_iterator;
|
||||
public:
|
||||
GraphWriter(std::ostream &o, const GraphType &g,
|
||||
const std::string &Name) : O(o), G(g) {
|
||||
if (Name.empty())
|
||||
O << "digraph foo {\n"; // Graph name doesn't matter
|
||||
else
|
||||
O << "digraph " << Name << " {\n";
|
||||
|
||||
std::string GraphName = DOTTraits::getGraphName(G);
|
||||
if (!GraphName.empty())
|
||||
O << "\tlabel=\"" << DOT::EscapeString(GraphName) << "\";\n";
|
||||
O << DOTTraits::getGraphProperties(G);
|
||||
O << "\n";
|
||||
|
||||
// Loop over the graph in DFO, printing it out...
|
||||
for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G);
|
||||
I != E; ++I) {
|
||||
NodeType *Node = &*I;
|
||||
writeNodes();
|
||||
}
|
||||
|
||||
~GraphWriter() {
|
||||
// Finish off the graph
|
||||
O << "}\n";
|
||||
}
|
||||
|
||||
void writeNodes() {
|
||||
// Loop over the graph, printing it out...
|
||||
for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G);
|
||||
I != E; ++I)
|
||||
writeNode(&*I);
|
||||
}
|
||||
|
||||
void writeNode(NodeType *Node) {
|
||||
std::string NodeAttributes = DOTTraits::getNodeAttributes(Node);
|
||||
|
||||
O << "\tNode" << (void*)Node << " [shape=record,";
|
||||
@ -75,8 +96,8 @@ std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
<< DOT::EscapeString(DOTTraits::getNodeLabel(Node, G));
|
||||
|
||||
// Print out the fields of the current node...
|
||||
typename GTraits::ChildIteratorType EI = GTraits::child_begin(Node);
|
||||
typename GTraits::ChildIteratorType EE = GTraits::child_end(Node);
|
||||
child_iterator EI = GTraits::child_begin(Node);
|
||||
child_iterator EE = GTraits::child_end(Node);
|
||||
if (EI != EE) {
|
||||
O << "|{";
|
||||
|
||||
@ -93,17 +114,21 @@ std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
|
||||
// Output all of the edges now
|
||||
EI = GTraits::child_begin(Node);
|
||||
for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
|
||||
for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
|
||||
writeEdge(Node, i, EI);
|
||||
}
|
||||
|
||||
void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) {
|
||||
if (NodeType *TargetNode = *EI) {
|
||||
O << "\tNode" << (void*)Node << ":g" << i << " -> Node"
|
||||
O << "\tNode" << (void*)Node << ":g" << edgeidx << " -> Node"
|
||||
<< (void*)TargetNode;
|
||||
if (DOTTraits::edgeTargetsEdgeSource(Node, EI)) {
|
||||
typename GTraits::ChildIteratorType TargetIt =
|
||||
DOTTraits::getEdgeTarget(Node, EI);
|
||||
child_iterator TargetIt = DOTTraits::getEdgeTarget(Node, EI);
|
||||
|
||||
// Figure out which edge this targets...
|
||||
unsigned Offset = std::distance(GTraits::child_begin(TargetNode),
|
||||
TargetIt);
|
||||
if (Offset > 64) Offset = 64; // Targetting the trancated part?
|
||||
if (Offset > 64) Offset = 64; // Targetting the truncated part?
|
||||
O << ":g" << Offset;
|
||||
}
|
||||
|
||||
@ -113,10 +138,13 @@ std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
O << ";\n";
|
||||
}
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
// Finish off the graph
|
||||
O << "}\n";
|
||||
template<typename GraphType>
|
||||
std::ostream &WriteGraph(std::ostream &O, const GraphType &G,
|
||||
const std::string &Name = "") {
|
||||
// Start the graph emission process...
|
||||
GraphWriter<GraphType> W(O, G, Name);
|
||||
return O;
|
||||
}
|
||||
|
||||
|
@ -49,24 +49,45 @@ namespace DOT { // Private functions...
|
||||
}
|
||||
|
||||
template<typename GraphType>
|
||||
std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
class GraphWriter {
|
||||
std::ostream &O;
|
||||
const GraphType &G;
|
||||
|
||||
typedef DOTGraphTraits<GraphType> DOTTraits;
|
||||
typedef GraphTraits<GraphType> GTraits;
|
||||
typedef typename GTraits::NodeType NodeType;
|
||||
typedef typename GTraits::nodes_iterator node_iterator;
|
||||
|
||||
typedef typename GTraits::ChildIteratorType child_iterator;
|
||||
public:
|
||||
GraphWriter(std::ostream &o, const GraphType &g,
|
||||
const std::string &Name) : O(o), G(g) {
|
||||
if (Name.empty())
|
||||
O << "digraph foo {\n"; // Graph name doesn't matter
|
||||
else
|
||||
O << "digraph " << Name << " {\n";
|
||||
|
||||
std::string GraphName = DOTTraits::getGraphName(G);
|
||||
if (!GraphName.empty())
|
||||
O << "\tlabel=\"" << DOT::EscapeString(GraphName) << "\";\n";
|
||||
O << DOTTraits::getGraphProperties(G);
|
||||
O << "\n";
|
||||
|
||||
// Loop over the graph in DFO, printing it out...
|
||||
for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G);
|
||||
I != E; ++I) {
|
||||
NodeType *Node = &*I;
|
||||
writeNodes();
|
||||
}
|
||||
|
||||
~GraphWriter() {
|
||||
// Finish off the graph
|
||||
O << "}\n";
|
||||
}
|
||||
|
||||
void writeNodes() {
|
||||
// Loop over the graph, printing it out...
|
||||
for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G);
|
||||
I != E; ++I)
|
||||
writeNode(&*I);
|
||||
}
|
||||
|
||||
void writeNode(NodeType *Node) {
|
||||
std::string NodeAttributes = DOTTraits::getNodeAttributes(Node);
|
||||
|
||||
O << "\tNode" << (void*)Node << " [shape=record,";
|
||||
@ -75,8 +96,8 @@ std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
<< DOT::EscapeString(DOTTraits::getNodeLabel(Node, G));
|
||||
|
||||
// Print out the fields of the current node...
|
||||
typename GTraits::ChildIteratorType EI = GTraits::child_begin(Node);
|
||||
typename GTraits::ChildIteratorType EE = GTraits::child_end(Node);
|
||||
child_iterator EI = GTraits::child_begin(Node);
|
||||
child_iterator EE = GTraits::child_end(Node);
|
||||
if (EI != EE) {
|
||||
O << "|{";
|
||||
|
||||
@ -93,17 +114,21 @@ std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
|
||||
// Output all of the edges now
|
||||
EI = GTraits::child_begin(Node);
|
||||
for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
|
||||
for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
|
||||
writeEdge(Node, i, EI);
|
||||
}
|
||||
|
||||
void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) {
|
||||
if (NodeType *TargetNode = *EI) {
|
||||
O << "\tNode" << (void*)Node << ":g" << i << " -> Node"
|
||||
O << "\tNode" << (void*)Node << ":g" << edgeidx << " -> Node"
|
||||
<< (void*)TargetNode;
|
||||
if (DOTTraits::edgeTargetsEdgeSource(Node, EI)) {
|
||||
typename GTraits::ChildIteratorType TargetIt =
|
||||
DOTTraits::getEdgeTarget(Node, EI);
|
||||
child_iterator TargetIt = DOTTraits::getEdgeTarget(Node, EI);
|
||||
|
||||
// Figure out which edge this targets...
|
||||
unsigned Offset = std::distance(GTraits::child_begin(TargetNode),
|
||||
TargetIt);
|
||||
if (Offset > 64) Offset = 64; // Targetting the trancated part?
|
||||
if (Offset > 64) Offset = 64; // Targetting the truncated part?
|
||||
O << ":g" << Offset;
|
||||
}
|
||||
|
||||
@ -113,10 +138,13 @@ std::ostream &WriteGraph(std::ostream &O, const GraphType &G) {
|
||||
O << ";\n";
|
||||
}
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
// Finish off the graph
|
||||
O << "}\n";
|
||||
template<typename GraphType>
|
||||
std::ostream &WriteGraph(std::ostream &O, const GraphType &G,
|
||||
const std::string &Name = "") {
|
||||
// Start the graph emission process...
|
||||
GraphWriter<GraphType> W(O, G, Name);
|
||||
return O;
|
||||
}
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user