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
|
//===- DataStructure.cpp - Analysis for data structure identification -------=//
//
// Implement the LLVM data structure analysis library.
//
//===----------------------------------------------------------------------===//
#include "llvm/Analysis/DataStructure.h"
#include "llvm/Module.h"
#include "llvm/Function.h"
#include <fstream>
#include <algorithm>
//===----------------------------------------------------------------------===//
// DataStructure Class Implementation
//
AnalysisID DataStructure::ID(AnalysisID::create<DataStructure>());
// releaseMemory - If the pass pipeline is done with this pass, we can release
// our memory... here...
void DataStructure::releaseMemory() {
for (InfoMap::iterator I = DSInfo.begin(), E = DSInfo.end(); I != E; ++I) {
delete I->second.first;
delete I->second.second;
}
// Empty map so next time memory is released, data structures are not
// re-deleted.
DSInfo.clear();
}
// print - Print out the analysis results...
void DataStructure::print(std::ostream &O, Module *M) const {
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I)
if (!(*I)->isExternal()) {
string Filename = "ds." + (*I)->getName() + ".dot";
O << "Writing '" << Filename << "'...\n";
ofstream F(Filename.c_str());
if (F.good()) {
F << "digraph DataStructures {\n"
<< "\tnode [shape=Mrecord];\n"
<< "\tedge [arrowtail=\"dot\"];\n"
<< "\tsize=\"10,7.5\";\n"
<< "\trotate=\"90\";\n";
getDSGraph(*I).printFunction(F, "Local");
getClosedDSGraph(*I).printFunction(F, "Closed");
F << "}\n";
} else {
O << " error opening file for writing!\n";
}
}
}
//===----------------------------------------------------------------------===//
// PointerVal Class Implementation
//
void PointerVal::print(std::ostream &O) const {
if (Node) {
O << " Node: " << Node->getCaption() << "[" << Index << "]\n";
} else {
O << " NULL NODE\n";
}
}
//===----------------------------------------------------------------------===//
// PointerValSet Class Implementation
//
void PointerValSet::addRefs() {
for (unsigned i = 0, e = Vals.size(); i != e; ++i)
Vals[i].Node->addReferrer(this);
}
void PointerValSet::dropRefs() {
for (unsigned i = 0, e = Vals.size(); i != e; ++i)
Vals[i].Node->removeReferrer(this);
}
const PointerValSet &PointerValSet::operator=(const PointerValSet &PVS) {
dropRefs();
Vals.clear();
Vals = PVS.Vals;
addRefs();
return *this;
}
bool PointerValSet::add(const PointerVal &PV, Value *Pointer) {
if (std::find(Vals.begin(), Vals.end(), PV) != Vals.end())
return false;
Vals.push_back(PV);
if (Pointer) PV.Node->addPointer(Pointer);
PV.Node->addReferrer(this);
return true;
}
// removePointerTo - Remove a single pointer val that points to the specified
// node...
void PointerValSet::removePointerTo(DSNode *Node) {
vector<PointerVal>::iterator I = std::find(Vals.begin(), Vals.end(), Node);
assert(I != Vals.end() && "Couldn't remove nonexistent edge!");
Vals.erase(I);
Node->removeReferrer(this);
}
void PointerValSet::print(std::ostream &O) const {
for (unsigned i = 0, e = Vals.size(); i != e; ++i)
Vals[i].print(O);
}
|
