Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 1 | //===- Printer.cpp - Code for printing data structure graphs nicely -------===// |
| 2 | // |
| 3 | // This file implements the 'dot' graph printer. |
| 4 | // |
| 5 | //===----------------------------------------------------------------------===// |
| 6 | |
| 7 | #include "llvm/Analysis/DataStructure.h" |
| 8 | #include "llvm/Module.h" |
| 9 | #include "llvm/Assembly/Writer.h" |
| 10 | #include <fstream> |
| 11 | #include <sstream> |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 12 | using std::string; |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 13 | |
| 14 | void DSNode::dump() const { print(std::cerr, 0); } |
| 15 | |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 16 | string DSNode::getCaption(const DSGraph *G) const { |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 17 | std::stringstream OS; |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 18 | Module *M = G ? G->getFunction().getParent() : 0; |
| 19 | WriteTypeSymbolic(OS, getType(), M); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 20 | |
| 21 | OS << " "; |
| 22 | if (NodeType & ScalarNode) OS << "S"; |
| 23 | if (NodeType & AllocaNode) OS << "A"; |
| 24 | if (NodeType & NewNode ) OS << "N"; |
| 25 | if (NodeType & GlobalNode) OS << "G"; |
| 26 | if (NodeType & SubElement) OS << "E"; |
| 27 | if (NodeType & CastNode ) OS << "C"; |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 28 | if (NodeType & Incomplete) OS << "I"; |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 29 | |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 30 | for (unsigned i = 0, e = Globals.size(); i != e; ++i) { |
| 31 | OS << "\n"; |
| 32 | WriteAsOperand(OS, Globals[i], false, true, M); |
| 33 | } |
| 34 | |
| 35 | if ((NodeType & ScalarNode) && G) { |
| 36 | const std::map<Value*, DSNodeHandle> &VM = G->getValueMap(); |
| 37 | for (std::map<Value*, DSNodeHandle>::const_iterator I = VM.begin(), |
| 38 | E = VM.end(); I != E; ++I) |
| 39 | if (I->second == this) { |
| 40 | OS << "\n"; |
| 41 | WriteAsOperand(OS, I->first, false, true, M); |
| 42 | } |
| 43 | } |
| 44 | |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 45 | return OS.str(); |
| 46 | } |
| 47 | |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 48 | static string getValueName(Value *V, Function &F) { |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 49 | std::stringstream OS; |
| 50 | WriteAsOperand(OS, V, true, true, F.getParent()); |
| 51 | return OS.str(); |
| 52 | } |
| 53 | |
| 54 | |
| 55 | |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 56 | static void replaceIn(string &S, char From, const string &To) { |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 57 | for (unsigned i = 0; i < S.size(); ) |
| 58 | if (S[i] == From) { |
| 59 | S.replace(S.begin()+i, S.begin()+i+1, |
| 60 | To.begin(), To.end()); |
| 61 | i += To.size(); |
| 62 | } else { |
| 63 | ++i; |
| 64 | } |
| 65 | } |
| 66 | |
Anand Shukla | 6c5ed41 | 2002-07-16 00:03:10 +0000 | [diff] [blame] | 67 | static std::string escapeLabel(const std::string &In) { |
| 68 | std::string Label(In); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 69 | replaceIn(Label, '\\', "\\\\"); // Escape caption... |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 70 | replaceIn(Label, '\n', "\\n"); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 71 | replaceIn(Label, ' ', "\\ "); |
| 72 | replaceIn(Label, '{', "\\{"); |
| 73 | replaceIn(Label, '}', "\\}"); |
| 74 | return Label; |
| 75 | } |
| 76 | |
| 77 | static void writeEdge(std::ostream &O, const void *SrcNode, |
| 78 | const char *SrcNodePortName, int SrcNodeIdx, |
Anand Shukla | 6c5ed41 | 2002-07-16 00:03:10 +0000 | [diff] [blame] | 79 | const DSNode *VS, const std::string &EdgeAttr = "") { |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 80 | O << "\tNode" << SrcNode << SrcNodePortName; |
| 81 | if (SrcNodeIdx != -1) O << SrcNodeIdx; |
| 82 | O << " -> Node" << (void*)VS; |
| 83 | |
| 84 | if (!EdgeAttr.empty()) |
| 85 | O << "[" << EdgeAttr << "]"; |
| 86 | O << ";\n"; |
| 87 | } |
| 88 | |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 89 | void DSNode::print(std::ostream &O, const DSGraph *G) const { |
Anand Shukla | 6c5ed41 | 2002-07-16 00:03:10 +0000 | [diff] [blame] | 90 | std::string Caption = escapeLabel(getCaption(G)); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 91 | |
| 92 | O << "\tNode" << (void*)this << " [ label =\"{" << Caption; |
| 93 | |
| 94 | if (!Links.empty()) { |
| 95 | O << "|{"; |
| 96 | for (unsigned i = 0; i < Links.size(); ++i) { |
| 97 | if (i) O << "|"; |
| 98 | O << "<g" << i << ">"; |
| 99 | } |
| 100 | O << "}"; |
| 101 | } |
| 102 | O << "}\"];\n"; |
| 103 | |
| 104 | for (unsigned i = 0; i < Links.size(); ++i) |
| 105 | if (Links[i]) |
| 106 | writeEdge(O, this, ":g", i, Links[i]); |
| 107 | } |
| 108 | |
| 109 | void DSGraph::print(std::ostream &O) const { |
| 110 | O << "digraph DataStructures {\n" |
| 111 | << "\tnode [shape=Mrecord];\n" |
| 112 | << "\tedge [arrowtail=\"dot\"];\n" |
| 113 | << "\tsize=\"10,7.5\";\n" |
| 114 | << "\trotate=\"90\";\n" |
| 115 | << "\tlabel=\"Function\\ " << Func.getName() << "\";\n\n"; |
| 116 | |
| 117 | // Output all of the nodes... |
| 118 | for (unsigned i = 0, e = Nodes.size(); i != e; ++i) |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 119 | Nodes[i]->print(O, this); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 120 | |
| 121 | O << "\n"; |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 122 | |
| 123 | // Output the returned value pointer... |
| 124 | if (RetNode != 0) { |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 125 | O << "\tNode0x1" << "[ plaintext=circle, label =\"" |
| 126 | << escapeLabel("returning") << "\"];\n"; |
| 127 | writeEdge(O, (void*)1, "", -1, RetNode, "arrowtail=tee,color=gray63"); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 128 | } |
| 129 | |
| 130 | // Output all of the call nodes... |
| 131 | for (unsigned i = 0, e = FunctionCalls.size(); i != e; ++i) { |
| 132 | const std::vector<DSNodeHandle> &Call = FunctionCalls[i]; |
| 133 | O << "\tNode" << (void*)&Call << " [shape=record,label=\"{call|{"; |
| 134 | for (unsigned j = 0, e = Call.size(); j != e; ++j) { |
| 135 | if (j) O << "|"; |
| 136 | O << "<g" << j << ">"; |
| 137 | } |
| 138 | O << "}}\"];\n"; |
| 139 | |
| 140 | for (unsigned j = 0, e = Call.size(); j != e; ++j) |
| 141 | if (Call[j]) |
Chris Lattner | 76d5b48 | 2002-07-11 20:33:32 +0000 | [diff] [blame] | 142 | writeEdge(O, &Call, ":g", j, Call[j], "color=gray63"); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 143 | } |
| 144 | |
| 145 | |
| 146 | O << "}\n"; |
| 147 | } |
| 148 | |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 149 | template <typename Collection> |
Chris Lattner | 97f51a3 | 2002-07-27 01:12:15 +0000 | [diff] [blame^] | 150 | static void printCollection(const Collection &C, std::ostream &O, |
| 151 | const Module *M, const string &Prefix) { |
| 152 | if (M == 0) { |
| 153 | O << "Null Module pointer, cannot continue!\n"; |
| 154 | return; |
| 155 | } |
| 156 | |
| 157 | for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I) |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 158 | if (!I->isExternal()) { |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 159 | string Filename = Prefix + "." + I->getName() + ".dot"; |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 160 | O << "Writing '" << Filename << "'..."; |
| 161 | std::ofstream F(Filename.c_str()); |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 162 | |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 163 | if (F.good()) { |
Chris Lattner | 97f51a3 | 2002-07-27 01:12:15 +0000 | [diff] [blame^] | 164 | DSGraph &Graph = C.getDSGraph((Function&)*I); |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 165 | Graph.print(F); |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 166 | O << " [" << Graph.getGraphSize() << "+" |
| 167 | << Graph.getFunctionCalls().size() << "]\n"; |
Chris Lattner | c68c31b | 2002-07-10 22:38:08 +0000 | [diff] [blame] | 168 | } else { |
| 169 | O << " error opening file for writing!\n"; |
| 170 | } |
| 171 | } |
| 172 | } |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 173 | |
| 174 | |
| 175 | // print - Print out the analysis results... |
Chris Lattner | 97f51a3 | 2002-07-27 01:12:15 +0000 | [diff] [blame^] | 176 | void LocalDataStructures::print(std::ostream &O, const Module *M) const { |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 177 | printCollection(*this, O, M, "ds"); |
| 178 | } |
| 179 | |
Chris Lattner | 97f51a3 | 2002-07-27 01:12:15 +0000 | [diff] [blame^] | 180 | void BUDataStructures::print(std::ostream &O, const Module *M) const { |
Chris Lattner | 0d9bab8 | 2002-07-18 00:12:30 +0000 | [diff] [blame] | 181 | printCollection(*this, O, M, "bu"); |
| 182 | } |