-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathRaceDetectionTool.cpp
More file actions
295 lines (224 loc) · 7.63 KB
/
RaceDetectionTool.cpp
File metadata and controls
295 lines (224 loc) · 7.63 KB
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
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
/*
* RaceDetectionTool.cpp
*
* Created on: Aug 28, 2014
* Author: wilhelma
*/
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include "RaceDetectionTool.h"
#include "Event.h"
#include "ShadowThread.h"
#include "ShadowVar.h"
#include "ShadowLock.h"
#include "rapidjson/document.h"
#include "rapidjson/writer.h"
#include "rapidjson/stringbuffer.h"
#include "rapidjson/prettywriter.h"
RaceDetectionTool::RaceDetectionTool(const char *outFile) : outFile_(outFile) {
threadVC_[0].fill(0);
threadVC_[0][0] = 1;
}
RaceDetectionTool::~RaceDetectionTool() {
dumpRaceEntries(outFile_);
}
void RaceDetectionTool::create(const Event* e) {
ShadowThread* childThread =
dynamic_cast<const NewThreadEvent*>(e)->getNewThreadInfo()->childThread;
if (threadVC_.find(childThread->threadId) == threadVC_.end()) {
threadVC_[childThread->threadId].fill(0);
threadVC_[childThread->threadId][childThread->threadId] = 1;
}
// LockSet_u = set of all possible locks
lockSet_[childThread] = lockSet_[e->getThread()];
// VC_u = Vc_u # VC_t
vcMerge( threadVC_[childThread->threadId],
threadVC_[e->getThread()->threadId] );
// VC_t[t] = VC_t[t] + 1
threadVC_[e->getThread()->threadId][e->getThread()->threadId]++;
}
void RaceDetectionTool::join(const Event* e) {
// VC_t = VC_t # VC_u
vcMerge( threadVC_[e->getThread()->threadId],
threadVC_[((JoinEvent*)e)->getJoinInfo()->childThread->threadId] );
// VC_u[u] = VC_u[u] + 1
ThreadId id = ((JoinEvent*)e)->getJoinInfo()->childThread->threadId;
threadVC_[id][id]++;
}
void RaceDetectionTool::acquire(const Event* e) {
// LockSet_t = LockSet_t + {lock}
lockSet_[e->getThread()].insert(((AcquireEvent*)e)->getAcquireInfo()->lock);
}
void RaceDetectionTool::release(const Event* e) {
// LockSet_t = LockSet_t - {lock}
auto lock = ((AcquireEvent*)e)->getAcquireInfo()->lock;
lockSet_[e->getThread()].erase(lock);
// VC_t[t] = VC_t[t] + 1
threadVC_[e->getThread()->threadId][e->getThread()->threadId]++;
}
void RaceDetectionTool::access(const Event* e) {
const AccessEvent *event = dynamic_cast<const AccessEvent*>(e);
const RefId ref = event->getAccessInfo()->var->id;
Epoch_ epoch(e->getThread()->threadId,
threadVC_[e->getThread()->threadId][e->getThread()->threadId]);
const ThreadId threadId = event->getThread()->threadId;
if (event->getAccessInfo()->var->type == ShadowVar::STACK)
return;
switch(event->getAccessInfo()->type) {
case Access::READ:
{
// if epoch(t) != R_x[t].epoch
if (epoch == readVarSet_[ref][threadId].epoch)
return;
//auto searchRead = readVarSet_.find(ref);
//if (searchRead != readVarSet_.end()) {
// auto searchThread = searchRead->second.find(e->getThread()->threadId);
// if (searchThread != searchRead->second.end())
// if (epoch == searchThread->second.epoch)
// return;
//}
// if epoch(t) != W_x.epoch
if (epoch == writeVarSet_[ref].epoch)
return;
//auto searchWrite = writeVarSet_.find(ref);
//if (searchWrite != writeVarSet_.end())
// if (epoch == searchWrite->second.epoch)
// return;
// R_x[t].epoch = epoch(t)
readVarSet_[ref][threadId].epoch = epoch;
readVarSet_[ref][threadId].instruction =
event->getAccessInfo()->instructionID;
// R_x[t].lockset = LockSet_t
readVarSet_[ref][threadId].lockset = lockSet_[e->getThread()];
// check if W_x.epoch > VC_t
if ( !vcLEQ(writeVarSet_[ref].epoch, threadVC_[threadId]) ) {
if (lsIsEmptySet( readVarSet_[ref][threadId].lockset,
writeVarSet_[ref].lockset) ) {
raceEntries_.push_back(
std::unique_ptr<RaceEntry_>(new RaceEntry_(
WRITE_READ,
writeVarSet_[ref].instruction,
event->getAccessInfo()->instructionID,
ref)
));
std::cout << "race detected..1" << std::endl;
}
}
}
break;
case Access::WRITE:
// if epoch(t) != W_x.epoch
if (epoch == writeVarSet_[ref].epoch)
return;
// if W_x.epoch > Lockset_t
if ( !vcLEQ(writeVarSet_[ref].epoch, threadVC_[threadId]) ) {
// W_x.lockset = W_x.lockset intersect Lockset_t
lsIntersect(writeVarSet_[ref].lockset, lockSet_[e->getThread()]);
// check W_x.lockset = empty
if (writeVarSet_[ref].lockset.empty()) {
raceEntries_.push_back(
std::unique_ptr<RaceEntry_>(new RaceEntry_(
WRITE_WRITE,
writeVarSet_[ref].instruction,
event->getAccessInfo()->instructionID,
ref)
));
std::cout << "race detected..2" << std::endl;
}
} else {
// W_x.lockset = Lockset_t
writeVarSet_[ref].lockset = lockSet_[e->getThread()];
}
// W_x.epoch = epoch(t)
writeVarSet_[ref].epoch = epoch;
writeVarSet_[ref].instruction = event->getAccessInfo()->instructionID;
// forall threads t' in read map R_x do
for (auto tp : readVarSet_[ref]) {
// if R_x[t'].epoch > VC_t then
if ( !vcLEQ(tp.second.epoch, threadVC_[threadId]) ) {
// check R_x[t'].lockset intersect Lockset_t = empty
if ( lsIsEmptySet(readVarSet_[ref][tp.first].lockset, lockSet_[e->getThread()]) ) {
raceEntries_.push_back(
std::unique_ptr<RaceEntry_>(new RaceEntry_(
READ_WRITE,
tp.second.instruction,
event->getAccessInfo()->instructionID,
ref)
));
std::cout << "race detected..3" << std::endl;
}
}
}
// R_x = empty
readVarSet_[ref].clear();
break;
default:
break;
}
//LockSet_* ls = (LockSet_*)((const AccessEvent*)e)->getAccessInfo()->var->ptr;
//if (ls == nullptr) {
// ls = new LockSet_();
// ((const AccessEvent*)e)->getAccessInfo()->var->ptr = (void*)ls;
//}
//LockSet_ result;
//auto search = lockSet_.find(e->getThread());
//if (search != lockSet_.end()) {
// std::set_intersection(ls->begin(), ls->end(),
// search->second.begin(), search->second.end(),
// std::inserter(result, result.begin()));
//}
//*ls = result;
}
void RaceDetectionTool::dumpRaceEntries(const char* fileName) const {
rapidjson::Document doc;
doc.SetObject();
rapidjson::Document::AllocatorType& allocator = doc.GetAllocator();
rapidjson::Value array(rapidjson::kArrayType);
for (const auto& race : raceEntries_) {
rapidjson::Value object(rapidjson::kObjectType);
object.AddMember("type", race->type, allocator);
object.AddMember("1st", race->firstInstruction, allocator);
object.AddMember("2nd", race->secondInstruction, allocator);
object.AddMember("id", race->id, allocator);
array.PushBack(object, allocator);
}
doc.AddMember("races", array, allocator);
// 3. Stringify the DOM
rapidjson::StringBuffer buffer;
rapidjson::Writer<rapidjson::StringBuffer> writer(buffer);
doc.Accept(writer);
// 4. Write to the file.
std::ofstream file;
file.open (fileName);
file << buffer.GetString();
file.close();
}
void RaceDetectionTool::call(const Event* e) { }
void RaceDetectionTool::vcMerge(VectorClock_& lhs,
const VectorClock_& rhs) const {
for (unsigned i = 0; i < lhs.size(); ++i) {
if (lhs[i] < rhs[i])
lhs[i] = rhs[i];
}
}
bool RaceDetectionTool::vcLEQ(const Epoch_& epoch,
const VectorClock_& vc) const {
return (epoch.clock <= vc[epoch.threadId]);
}
bool RaceDetectionTool::lsIsEmptySet(const LockSet_& lhs,
const LockSet_& rhs) const {
LockSet_ result;
std::set_intersection(lhs.begin(), lhs.end(),
rhs.begin(), rhs.end(),
std::inserter(result, result.begin()));
return result.empty();
}
void RaceDetectionTool::lsIntersect(LockSet_& lhs, const LockSet_& rhs) const {
LockSet_ result;
std::set_intersection(lhs.begin(), lhs.end(),
rhs.begin(), rhs.end(),
std::inserter(result, result.begin()));
lhs = result;
}