-
Notifications
You must be signed in to change notification settings - Fork 29
/
svf-ex.cpp
207 lines (169 loc) · 5.9 KB
/
svf-ex.cpp
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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
//===- svf-ex.cpp -- A driver example of SVF-------------------------------------//
//
// SVF: Static Value-Flow Analysis
//
// Copyright (C) <2013-> <Yulei Sui>
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//
//===-----------------------------------------------------------------------===//
/*
// A driver program of SVF including usages of SVF APIs
//
// Author: Yulei Sui,
*/
#include "SVF-FE/LLVMUtil.h"
#include "Graphs/SVFG.h"
#include "WPA/Andersen.h"
#include "SVF-FE/SVFIRBuilder.h"
#include "Util/Options.h"
using namespace llvm;
using namespace std;
using namespace SVF;
static llvm::cl::opt<std::string> InputFilename(cl::Positional,
llvm::cl::desc("<input bitcode>"), llvm::cl::init("-"));
/*!
* An example to query alias results of two LLVM values
*/
SVF::AliasResult aliasQuery(PointerAnalysis* pta, Value* v1, Value* v2)
{
return pta->alias(v1,v2);
}
/*!
* An example to print points-to set of an LLVM value
*/
std::string printPts(PointerAnalysis* pta, Value* val)
{
std::string str;
raw_string_ostream rawstr(str);
NodeID pNodeId = pta->getPAG()->getValueNode(val);
const PointsTo& pts = pta->getPts(pNodeId);
for (PointsTo::iterator ii = pts.begin(), ie = pts.end();
ii != ie; ii++)
{
rawstr << " " << *ii << " ";
PAGNode* targetObj = pta->getPAG()->getGNode(*ii);
if(targetObj->hasValue())
{
rawstr << "(" <<*targetObj->getValue() << ")\t ";
}
}
return rawstr.str();
}
/*!
* An example to query/collect all successor nodes from a ICFGNode (iNode) along control-flow graph (ICFG)
*/
void traverseOnICFG(ICFG* icfg, const Instruction* inst)
{
ICFGNode* iNode = icfg->getICFGNode(inst);
FIFOWorkList<const ICFGNode*> worklist;
Set<const ICFGNode*> visited;
worklist.push(iNode);
/// Traverse along VFG
while (!worklist.empty())
{
const ICFGNode* iNode = worklist.pop();
for (ICFGNode::const_iterator it = iNode->OutEdgeBegin(), eit =
iNode->OutEdgeEnd(); it != eit; ++it)
{
ICFGEdge* edge = *it;
ICFGNode* succNode = edge->getDstNode();
if (visited.find(succNode) == visited.end())
{
visited.insert(succNode);
worklist.push(succNode);
}
}
}
}
/*!
* An example to query/collect all the uses of a definition of a value along value-flow graph (VFG)
*/
void traverseOnVFG(const SVFG* vfg, Value* val)
{
SVFIR* pag = SVFIR::getPAG();
PAGNode* pNode = pag->getGNode(pag->getValueNode(val));
const VFGNode* vNode = vfg->getDefSVFGNode(pNode);
FIFOWorkList<const VFGNode*> worklist;
Set<const VFGNode*> visited;
worklist.push(vNode);
/// Traverse along VFG
while (!worklist.empty())
{
const VFGNode* vNode = worklist.pop();
for (VFGNode::const_iterator it = vNode->OutEdgeBegin(), eit =
vNode->OutEdgeEnd(); it != eit; ++it)
{
VFGEdge* edge = *it;
VFGNode* succNode = edge->getDstNode();
if (visited.find(succNode) == visited.end())
{
visited.insert(succNode);
worklist.push(succNode);
}
}
}
/// Collect all LLVM Values
for(Set<const VFGNode*>::const_iterator it = visited.begin(), eit = visited.end(); it!=eit; ++it)
{
const VFGNode* node = *it;
/// can only query VFGNode involving top-level pointers (starting with % or @ in LLVM IR)
/// PAGNode* pNode = vfg->getLHSTopLevPtr(node);
/// Value* val = pNode->getValue();
}
}
int main(int argc, char ** argv)
{
int arg_num = 0;
char **arg_value = new char*[argc];
std::vector<std::string> moduleNameVec;
LLVMUtil::processArguments(argc, argv, arg_num, arg_value, moduleNameVec);
cl::ParseCommandLineOptions(arg_num, arg_value,
"Whole Program Points-to Analysis\n");
if (Options::WriteAnder == "ir_annotator")
{
LLVMModuleSet::getLLVMModuleSet()->preProcessBCs(moduleNameVec);
}
SVFModule* svfModule = LLVMModuleSet::getLLVMModuleSet()->buildSVFModule(moduleNameVec);
svfModule->buildSymbolTableInfo();
/// Build Program Assignment Graph (SVFIR)
SVFIRBuilder builder;
SVFIR* pag = builder.build(svfModule);
/// Create Andersen's pointer analysis
Andersen* ander = AndersenWaveDiff::createAndersenWaveDiff(pag);
/// Query aliases
/// aliasQuery(ander,value1,value2);
/// Print points-to information
/// printPts(ander, value1);
/// Call Graph
PTACallGraph* callgraph = ander->getPTACallGraph();
/// ICFG
ICFG* icfg = pag->getICFG();
/// Value-Flow Graph (VFG)
VFG* vfg = new VFG(callgraph);
/// Sparse value-flow graph (SVFG)
SVFGBuilder svfBuilder;
SVFG* svfg = svfBuilder.buildFullSVFG(ander);
/// Collect uses of an LLVM Value
/// traverseOnVFG(svfg, value);
/// Collect all successor nodes on ICFG
/// traverseOnICFG(icfg, value);
// clean up memory
delete vfg;
delete svfg;
AndersenWaveDiff::releaseAndersenWaveDiff();
SVFIR::releaseSVFIR();
LLVMModuleSet::getLLVMModuleSet()->dumpModulesToFile(".svf.bc");
SVF::LLVMModuleSet::releaseLLVMModuleSet();
llvm::llvm_shutdown();
return 0;
}