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
|
//===-- InstructionInfoTable.cpp ------------------------------------------===//
//
// The KLEE Symbolic Virtual Machine
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "klee/Internal/Module/InstructionInfoTable.h"
#include "llvm/Function.h"
#include "llvm/Instructions.h"
#include "llvm/IntrinsicInst.h"
#include "llvm/Linker.h"
#include "llvm/Module.h"
#include "llvm/Assembly/AsmAnnotationWriter.h"
#include "llvm/Support/CFG.h"
#include "llvm/Support/InstIterator.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Analysis/ValueTracking.h"
#include <map>
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
using namespace llvm;
using namespace klee;
class InstructionToLineAnnotator : public llvm::AssemblyAnnotationWriter {
public:
void emitInstructionAnnot(const Instruction *i, llvm::raw_ostream &os) {
os << "%%%" << (uintptr_t) i;
}
};
static void buildInstructionToLineMap(Module *m,
std::map<const Instruction*, unsigned> &out) {
InstructionToLineAnnotator a;
std::ostringstream buffer;
m->print(buffer, &a);
std::string str = buffer.str();
const char *s;
unsigned line = 1;
for (s=str.c_str(); *s; s++) {
if (*s=='\n') {
line++;
if (s[1]=='%' && s[2]=='%' && s[3]=='%') {
s += 4;
char *end;
unsigned long long value = strtoull(s, &end, 10);
if (end!=s) {
out.insert(std::make_pair((const Instruction*) value, line));
}
s = end;
}
}
}
}
static std::string getDSPIPath(DbgStopPointInst *dspi) {
std::string dir, file;
bool res = GetConstantStringInfo(dspi->getDirectory(), dir);
assert(res && "GetConstantStringInfo failed");
res = GetConstantStringInfo(dspi->getFileName(), file);
assert(res && "GetConstantStringInfo failed");
if (dir.empty()) {
return file;
} else if (*dir.rbegin() == '/') {
return dir + file;
} else {
return dir + "/" + file;
}
}
InstructionInfoTable::InstructionInfoTable(Module *m)
: dummyString(""), dummyInfo(0, dummyString, 0, 0) {
unsigned id = 0;
std::map<const Instruction*, unsigned> lineTable;
buildInstructionToLineMap(m, lineTable);
for (Module::iterator fnIt = m->begin(), fn_ie = m->end();
fnIt != fn_ie; ++fnIt) {
const std::string *initialFile = &dummyString;
unsigned initialLine = 0;
// It may be better to look for the closest stoppoint to the entry
// following the CFG, but it is not clear that it ever matters in
// practice.
for (inst_iterator it = inst_begin(fnIt), ie = inst_end(fnIt);
it != ie; ++it) {
if (DbgStopPointInst *dspi = dyn_cast<DbgStopPointInst>(&*it)) {
initialFile = internString(getDSPIPath(dspi));
initialLine = dspi->getLine();
break;
}
}
typedef std::map<BasicBlock*, std::pair<const std::string*,unsigned> >
sourceinfo_ty;
sourceinfo_ty sourceInfo;
for (llvm::Function::iterator bbIt = fnIt->begin(), bbie = fnIt->end();
bbIt != bbie; ++bbIt) {
std::pair<sourceinfo_ty::iterator, bool>
res = sourceInfo.insert(std::make_pair(bbIt,
std::make_pair(initialFile,
initialLine)));
if (!res.second)
continue;
std::vector<BasicBlock*> worklist;
worklist.push_back(bbIt);
do {
BasicBlock *bb = worklist.back();
worklist.pop_back();
sourceinfo_ty::iterator si = sourceInfo.find(bb);
assert(si != sourceInfo.end());
const std::string *file = si->second.first;
unsigned line = si->second.second;
for (BasicBlock::iterator it = bb->begin(), ie = bb->end();
it != ie; ++it) {
Instruction *instr = it;
unsigned assemblyLine = 0;
std::map<const Instruction*, unsigned>::const_iterator ltit =
lineTable.find(instr);
if (ltit!=lineTable.end())
assemblyLine = ltit->second;
if (DbgStopPointInst *dspi = dyn_cast<DbgStopPointInst>(instr)) {
file = internString(getDSPIPath(dspi));
line = dspi->getLine();
}
infos.insert(std::make_pair(instr,
InstructionInfo(id++,
*file,
line,
assemblyLine)));
}
for (succ_iterator it = succ_begin(bb), ie = succ_end(bb);
it != ie; ++it) {
if (sourceInfo.insert(std::make_pair(*it,
std::make_pair(file, line))).second)
worklist.push_back(*it);
}
} while (!worklist.empty());
}
}
}
InstructionInfoTable::~InstructionInfoTable() {
for (std::set<const std::string *, ltstr>::iterator
it = internedStrings.begin(), ie = internedStrings.end();
it != ie; ++it)
delete *it;
}
const std::string *InstructionInfoTable::internString(std::string s) {
std::set<const std::string *, ltstr>::iterator it = internedStrings.find(&s);
if (it==internedStrings.end()) {
std::string *interned = new std::string(s);
internedStrings.insert(interned);
return interned;
} else {
return *it;
}
}
unsigned InstructionInfoTable::getMaxID() const {
return infos.size();
}
const InstructionInfo &
InstructionInfoTable::getInfo(const Instruction *inst) const {
std::map<const llvm::Instruction*, InstructionInfo>::const_iterator it =
infos.find(inst);
if (it==infos.end()) {
return dummyInfo;
} else {
return it->second;
}
}
const InstructionInfo &
InstructionInfoTable::getFunctionInfo(const Function *f) const {
if (f->isDeclaration()) {
return dummyInfo;
} else {
return getInfo(f->begin()->begin());
}
}
|
