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