svf-tools 1.0.977 → 1.0.978

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (68) hide show
  1. package/package.json +1 -1
  2. package/svf/include/AE/Svfexe/AbstractInterpretation.h +1 -1
  3. package/svf/include/DDA/ContextDDA.h +2 -2
  4. package/svf/include/DDA/DDAVFSolver.h +5 -5
  5. package/svf/include/DDA/FlowDDA.h +1 -1
  6. package/svf/include/Graphs/{PTACallGraph.h → CallGraph.h} +41 -41
  7. package/svf/include/Graphs/ICFG.h +2 -2
  8. package/svf/include/Graphs/ThreadCallGraph.h +24 -30
  9. package/svf/include/Graphs/VFG.h +4 -4
  10. package/svf/include/MSSA/MemRegion.h +4 -4
  11. package/svf/include/MTA/LockAnalysis.h +42 -32
  12. package/svf/include/MTA/MHP.h +34 -54
  13. package/svf/include/MTA/MTAStat.h +1 -2
  14. package/svf/include/MTA/TCT.h +43 -25
  15. package/svf/include/MemoryModel/PointerAnalysis.h +13 -13
  16. package/svf/include/SABER/SaberSVFGBuilder.h +1 -1
  17. package/svf/include/SABER/SrcSnkDDA.h +7 -7
  18. package/svf/include/Util/CallGraphBuilder.h +5 -5
  19. package/svf/include/Util/CxtStmt.h +13 -12
  20. package/svf/include/Util/Options.h +1 -20
  21. package/svf/include/Util/SVFUtil.h +8 -43
  22. package/svf/include/Util/ThreadAPI.h +42 -85
  23. package/svf/lib/AE/Svfexe/AbstractInterpretation.cpp +1 -1
  24. package/svf/lib/CFL/CFLSVFGBuilder.cpp +1 -1
  25. package/svf/lib/DDA/ContextDDA.cpp +9 -9
  26. package/svf/lib/DDA/DDAClient.cpp +3 -3
  27. package/svf/lib/DDA/DDAPass.cpp +4 -4
  28. package/svf/lib/DDA/FlowDDA.cpp +2 -2
  29. package/svf/lib/Graphs/{PTACallGraph.cpp → CallGraph.cpp} +66 -66
  30. package/svf/lib/Graphs/ICFG.cpp +6 -6
  31. package/svf/lib/Graphs/SVFG.cpp +7 -7
  32. package/svf/lib/Graphs/SVFGReadWrite.cpp +6 -6
  33. package/svf/lib/Graphs/SVFGStat.cpp +1 -1
  34. package/svf/lib/Graphs/ThreadCallGraph.cpp +12 -84
  35. package/svf/lib/Graphs/VFG.cpp +1 -1
  36. package/svf/lib/MSSA/MemRegion.cpp +7 -7
  37. package/svf/lib/MTA/LockAnalysis.cpp +100 -92
  38. package/svf/lib/MTA/MHP.cpp +159 -138
  39. package/svf/lib/MTA/MTA.cpp +3 -41
  40. package/svf/lib/MTA/MTAStat.cpp +7 -33
  41. package/svf/lib/MTA/TCT.cpp +52 -52
  42. package/svf/lib/MemoryModel/PointerAnalysis.cpp +12 -12
  43. package/svf/lib/SABER/LeakChecker.cpp +4 -4
  44. package/svf/lib/SABER/SaberSVFGBuilder.cpp +4 -4
  45. package/svf/lib/SABER/SrcSnkDDA.cpp +1 -1
  46. package/svf/lib/Util/CallGraphBuilder.cpp +2 -17
  47. package/svf/lib/Util/Options.cpp +0 -62
  48. package/svf/lib/Util/PTAStat.cpp +7 -7
  49. package/svf/lib/Util/ThreadAPI.cpp +27 -6
  50. package/svf/lib/WPA/VersionedFlowSensitive.cpp +2 -2
  51. package/svf-llvm/include/SVF-LLVM/SVFIRBuilder.h +1 -1
  52. package/svf-llvm/lib/SVFIRBuilder.cpp +5 -5
  53. package/svf-llvm/lib/SVFIRExtAPI.cpp +0 -26
  54. package/svf-llvm/tools/AE/ae.cpp +1 -1
  55. package/svf-llvm/tools/Example/svf-ex.cpp +1 -1
  56. package/svf-llvm/tools/MTA/CMakeLists.txt +1 -1
  57. package/svf-llvm/tools/MTA/mta.cpp +0 -8
  58. package/svf/include/MTA/FSMPTA.h +0 -270
  59. package/svf/include/MTA/MTAResultValidator.h +0 -448
  60. package/svf/include/MTA/PCG.h +0 -229
  61. package/svf/lib/MTA/FSMPTA.cpp +0 -792
  62. package/svf/lib/MTA/PCG.cpp +0 -364
  63. package/svf-llvm/tools/MTA/LockResultValidator.cpp +0 -251
  64. package/svf-llvm/tools/MTA/LockResultValidator.h +0 -84
  65. package/svf-llvm/tools/MTA/MTAAnnotator.cpp +0 -293
  66. package/svf-llvm/tools/MTA/MTAAnnotator.h +0 -120
  67. package/svf-llvm/tools/MTA/MTAResultValidator.cpp +0 -716
  68. package/svf-llvm/tools/MTA/MTAResultValidator.h +0 -337
@@ -1,448 +0,0 @@
1
- /*
2
- * MTAResultValidator.h
3
- *
4
- * Created on: 29/06/2015
5
- * Author: Peng Di and Ding Ye
6
- */
7
-
8
- #ifndef MTARESULTVALIDATOR_H_
9
- #define MTARESULTVALIDATOR_H_
10
-
11
- #include "MTA/MHP.h"
12
-
13
- /*!
14
- * Validate the result of context-sensitive analysis, including context-sensitive
15
- * thread detection and thread interleaving.
16
- */
17
- namespace SVF
18
- {
19
- typedef unsigned NodeID;
20
-
21
- class MTAResultValidator
22
- {
23
-
24
- public:
25
- typedef int INTERLEV_FLAG;
26
- MTAResultValidator(MHP* mh) :
27
- mhp(mh)
28
- {
29
- tcg = mhp->getThreadCallGraph();
30
- tdAPI = tcg->getThreadAPI();
31
- mod = mhp->getTCT()->getSVFModule();
32
- }
33
- // Destructor
34
- ~MTAResultValidator()
35
- {
36
- }
37
-
38
- // Analysis
39
- void analyze();
40
- inline SVFModule* getModule() const
41
- {
42
- return mod;
43
- }
44
- protected:
45
-
46
- /*
47
- * Assistant functions
48
- */
49
-
50
- // Split string
51
- std::vector<std::string> &split(const std::string &s, char delim, std::vector<std::string> &elems);
52
- std::vector<std::string> split(const std::string &s, char delim);
53
-
54
- // Get special arguments of given call sites
55
- NodeID getIntArg(const Instruction* inst, unsigned int arg_num);
56
- std::vector<std::string> getStringArg(const Instruction* inst, unsigned int arg_num);
57
- CallStrCxt getCxtArg(const Instruction* inst, unsigned int arg_num);
58
-
59
- /*
60
- * Get the previous LoadInst or StoreInst from Instruction "I" in the
61
- * same BasicBlock. Return nullptr if none exists.
62
- */
63
- const Instruction* getPreviousMemoryAccessInst(const Instruction* I);
64
-
65
- // Compare two cxts
66
- bool matchCxt(const CallStrCxt cxt1, const CallStrCxt cxt2) const;
67
-
68
- // Dump calling context information
69
- void dumpCxt(const CallStrCxt& cxt) const;
70
-
71
- void dumpInterlev(NodeBS& lev);
72
-
73
- // Get the validation result string of a single validation scenario.
74
- inline std::string getOutput(const char *scenario, bool analysisRes);
75
- inline std::string getOutputforInterlevAnalysis(const char *scenario, INTERLEV_FLAG analysisRes);
76
-
77
- /*
78
- * Collect the callsite targets for validations.
79
- * The targets are labeled by "cs1:", "cs2:"... that are the names of its basic blocks.
80
- * The collected targets are stored in csnumToInstMap that maps label "cs1" to its Callsite.
81
- */
82
- bool collectCallsiteTargets();
83
-
84
- /*
85
- * Collect the CxtThread targets for validations.
86
- * The collected targets are stored in vthdToCxt that maps vthd to cxt.
87
- */
88
- bool collectCxtThreadTargets();
89
-
90
- /*
91
- * Collect TCT targets for validations.
92
- * The collected targets are stored in rthdToChildren.
93
- */
94
- bool collectTCTTargets();
95
-
96
- /*
97
- * Collect the thread interleaving targets for validations.
98
- * The collected targets are stored in instToTSMap and threadStmtToInterLeaving.
99
- */
100
- bool collectInterleavingTargets();
101
-
102
- /*
103
- * Perform validation for Cxtthread.
104
- * If correct, the validator maps given thread vthd to static CxtThread rthd stored in vthdTorthd.
105
- */
106
- bool validateCxtThread();
107
-
108
- /*
109
- * Perform validation for TCT.
110
- */
111
- bool validateTCT();
112
-
113
- /*
114
- * Perform validation for thread interleaving.
115
- */
116
- INTERLEV_FLAG validateInterleaving();
117
-
118
- private:
119
-
120
- typedef Map<NodeID, const SVFInstruction*> csnumToInst;
121
- typedef Map<NodeID, CallStrCxt> vthdToCxtMap;
122
- typedef Map<NodeID, NodeID> vthdTorthdMap;
123
- typedef Map<NodeID, NodeID> rthdTovthdMap;
124
-
125
- typedef Map<NodeID, Set<NodeID>> rthdToChildrenMap;
126
-
127
- MHP::InstToThreadStmtSetMap instToTSMap; // Map a instruction to CxtThreadStmtSet
128
- MHP::ThreadStmtToThreadInterleav threadStmtToInterLeaving; /// Map a statement to its thread interleavings
129
-
130
- static constexpr char const *CXT_THREAD = "CXT_THREAD";
131
- static constexpr char const *INTERLEV_ACCESS = "INTERLEV_ACCESS";
132
- static constexpr char const *TCT_ACCESS = "TCT_ACCESS";
133
-
134
- ThreadAPI* tdAPI;
135
- ThreadCallGraph* tcg;
136
- MHP* mhp;
137
- vthdToCxtMap vthdToCxt;
138
- vthdTorthdMap vthdTorthd;
139
- rthdTovthdMap rthdTovthd;
140
- csnumToInst csnumToInstMap;
141
- rthdToChildrenMap rthdToChildren;
142
- SVFModule* mod;
143
- /// Constant INTERLEV_FLAG values
144
- //@{
145
- static const INTERLEV_FLAG INTERLEV_TRUE = 0x01;
146
- static const INTERLEV_FLAG INTERLEV_IMPRECISE = 0x02;
147
- static const INTERLEV_FLAG INTERLEV_UNSOUND = 0x04;
148
- //@}
149
- };
150
-
151
-
152
-
153
- /*!
154
- * \brief Validate the result of concurrent analysis.
155
- *
156
- * The properties to validate of two memory accesses include
157
- * one or more of the following four:
158
- * (1) they may accesses aliases;
159
- * (2) they may happen in parallel;
160
- * (3) they are protected by common lock(s);
161
- * (4) they may cause a data race error.
162
- * The ground truth are specified by the "RC_ACCESS" function in the target program.
163
- *
164
- * Users may utilize this result validator to validate their analysis with
165
- * one or more of the four properties, by inheriting the RCResultValidator class.
166
- * The corresponding virtual function of the desired property should be overridden.
167
- */
168
- class RaceResultValidator
169
- {
170
- public:
171
- typedef int RC_FLAG;
172
-
173
- /*!
174
- * Data structure for recording access pairs for the validation.
175
- */
176
- class AccessPair
177
- {
178
- public:
179
- /// Constructor
180
- AccessPair(const Instruction* I1, const Instruction* I2,
181
- const RC_FLAG flags) :
182
- I1(I1), I2(I2), flags(flags)
183
- {
184
- }
185
-
186
- /// Class member access
187
- //@{
188
- inline bool isFlaged(const RC_FLAG flag) const
189
- {
190
- return flags & flag;
191
- }
192
- inline const Instruction* getInstruction1() const
193
- {
194
- return I1;
195
- }
196
- inline const Instruction* getInstruction2() const
197
- {
198
- return I2;
199
- }
200
- //@}
201
-
202
- private:
203
- const Instruction* I1;
204
- const Instruction* I2;
205
- RC_FLAG flags;
206
- };
207
-
208
- /// Destructor
209
- virtual ~RaceResultValidator()
210
- {
211
- release();
212
- }
213
-
214
- /// Initialization
215
- void init(SVFModule* M)
216
- {
217
- this->M = M;
218
- selectedValidationScenarios = RC_MHP | RC_ALIASES | RC_PROTECTED | RC_RACE;
219
- collectValidationTargets();
220
- }
221
-
222
- /// Analysis
223
- void analyze()
224
- {
225
- validateAll();
226
- }
227
-
228
- /// Release resource
229
- void release()
230
- {
231
- }
232
-
233
- /// Check if the input program has validation target
234
- inline bool hasValidationTarget() const
235
- {
236
- return !accessPairs.empty();
237
- }
238
-
239
- protected:
240
- /// Interface to the specific validation properties.
241
- /// Override one or more to implement your own analysis.
242
- //@{
243
- virtual bool mayAccessAliases(const Instruction* I1,
244
- const Instruction* I2)
245
- {
246
- selectedValidationScenarios &= ~RC_ALIASES;
247
- return true;
248
- }
249
- virtual bool mayHappenInParallel(const Instruction* I1,
250
- const Instruction* I2)
251
- {
252
- selectedValidationScenarios &= ~RC_MHP;
253
- return true;
254
- }
255
- virtual bool protectedByCommonLocks(const Instruction* I1,
256
- const Instruction* I2)
257
- {
258
- selectedValidationScenarios &= ~RC_PROTECTED;
259
- return true;
260
- }
261
- virtual bool mayHaveDataRace(const Instruction* I1,
262
- const Instruction* I2)
263
- {
264
- selectedValidationScenarios &= ~RC_RACE;
265
- return true;
266
- }
267
- //@}
268
-
269
- /*!
270
- * Collect the targets for validations.
271
- * The targets should be memory access Instructions in pairs.
272
- * The collected targets are stored in the member variable "accessPairs".
273
- */
274
- void collectValidationTargets()
275
- {
276
- // Collect call sites of all RC_ACCESS function calls.
277
- std::vector<const CallBase*> csInsts;
278
- const Function* F = nullptr;
279
- for (Module &M : LLVMModuleSet::getLLVMModuleSet()->getLLVMModules())
280
- {
281
- for(auto it = M.begin(); it != M.end(); it++)
282
- {
283
- const std::string fName = (*it).getName().str();
284
- if(fName.find(RC_ACCESS) != std::string::npos)
285
- {
286
- F = &(*it);
287
- break;
288
- }
289
- }
290
- }
291
- if (!F) return;
292
-
293
- for (Value::const_use_iterator it = F->use_begin(), ie =
294
- F->use_end(); it != ie; ++it)
295
- {
296
- const Use *u = &*it;
297
- const Value *user = u->getUser();
298
- if(LLVMUtil::isCallSite(user))
299
- {
300
- const CallBase* csInst = LLVMUtil::getLLVMCallSite(user);
301
- csInsts.push_back(csInst);
302
- }
303
- }
304
- assert(csInsts.size() % 2 == 0 && "We should have RC_ACCESS called in pairs.");
305
-
306
- // Sort the validation sites according to their ids.
307
- std::sort(csInsts.begin(), csInsts.end(), compare);
308
-
309
- // Generate access pairs.
310
- for (int i = 0, e = csInsts.size(); i != e;)
311
- {
312
- const CallBase* CI1 = csInsts[i++];
313
- const CallBase* CI2 = csInsts[i++];
314
- const ConstantInt* C = SVFUtil::dyn_cast<ConstantInt>(CI1->getArgOperand(1));
315
- assert(C);
316
- const Instruction* I1 = getPreviousMemoryAccessInst(CI1);
317
- const Instruction* I2 = getPreviousMemoryAccessInst(CI2);
318
- assert(I1 && I2 && "RC_ACCESS should be placed immediately after the target memory access.");
319
- RC_FLAG flags = C->getZExtValue();
320
- accessPairs.push_back(AccessPair(I1, I2, flags));
321
- }
322
- }
323
-
324
- /// Perform validation for all targets.
325
- void validateAll()
326
- {
327
- SVFUtil::outs() << SVFUtil::pasMsg(" --- Analysis Result Validation ---\n");
328
-
329
- // Iterate every memory access pair to perform the validation.
330
- for (int i = 0, e = accessPairs.size(); i != e; ++i)
331
- {
332
- const AccessPair &ap = accessPairs[i];
333
- const Instruction* I1 = ap.getInstruction1();
334
- const Instruction* I2 = ap.getInstruction2();
335
-
336
- bool mhp = mayHappenInParallel(I1, I2);
337
- bool alias = mayAccessAliases(I1, I2);
338
- bool protect = protectedByCommonLocks(I1, I2);
339
- bool racy = mayHaveDataRace(I1, I2);
340
-
341
- SVFUtil::outs() << "For the memory access pair at ("
342
- << LLVMModuleSet::getLLVMModuleSet()->getSVFValue(I1)->getSourceLoc() << ", "
343
- << LLVMModuleSet::getLLVMModuleSet()->getSVFValue(I2)->getSourceLoc() << ")\n";
344
- if (selectedValidationScenarios & RC_ALIASES)
345
- {
346
- SVFUtil::outs() << "\t"
347
- << getOutput("ALIASES", alias, ap.isFlaged(RC_ALIASES))
348
- << "\n";
349
- }
350
- if (selectedValidationScenarios & RC_MHP)
351
- {
352
- SVFUtil::outs() << "\t"
353
- << getOutput("MHP", mhp, ap.isFlaged(RC_MHP)) << "\n";
354
- }
355
- if (selectedValidationScenarios & RC_PROTECTED)
356
- {
357
- SVFUtil::outs() << "\t"
358
- << getOutput("PROTECT", protect,
359
- ap.isFlaged(RC_PROTECTED)) << "\n";
360
- }
361
- if (selectedValidationScenarios & RC_RACE)
362
- {
363
- SVFUtil::outs() << "\t"
364
- << getOutput("RACE", racy, ap.isFlaged(RC_RACE))
365
- << "\n";
366
- }
367
- }
368
-
369
- SVFUtil::outs() << "\n";
370
- }
371
-
372
- /// Get the validation result string of a single validation scenario.
373
- inline std::string getOutput(const char *scenario,
374
- bool analysisRes, bool expectedRes)
375
- {
376
- std::string ret(scenario);
377
- ret += "\t";
378
- if (expectedRes)
379
- ret += " T: ";
380
- else
381
- ret += " F: ";
382
- if (analysisRes == expectedRes)
383
- ret += SVFUtil::sucMsg("SUCCESS");
384
- else
385
- ret += SVFUtil::errMsg("FAILURE");
386
- return ret;
387
- }
388
-
389
- private:
390
- SVFModule* M;
391
- std::vector<AccessPair> accessPairs;
392
- RC_FLAG selectedValidationScenarios;
393
-
394
- /*!
395
- * Comparison function to sort the validation targets in ascending order of
396
- * the validation id (i.e., the 1st argument of RC_ACCESS function call).
397
- */
398
- static bool compare(const CallBase* CI1, const CallBase* CI2)
399
- {
400
- const Value *V1 = CI1->getArgOperand(0);
401
- const Value *V2 = CI2->getArgOperand(0);
402
- const ConstantInt* C1 = SVFUtil::dyn_cast<ConstantInt>(V1);
403
- const ConstantInt* C2 = SVFUtil::dyn_cast<ConstantInt>(V2);
404
- assert(0 != C1 && 0 != C2);
405
- return C1->getZExtValue() < C2->getZExtValue();
406
- }
407
-
408
- /*!
409
- * Get the previous LoadInst or StoreInst from Instruction "I" in the
410
- * same BasicBlock.
411
- * Return nullptr if none exists.
412
- */
413
- const Instruction* getPreviousMemoryAccessInst(
414
- const Instruction* I)
415
- {
416
- I = I->getPrevNode();
417
- while (I)
418
- {
419
- if (SVFUtil::isa<LoadInst, StoreInst>(I))
420
- return I;
421
-
422
- const SVFInstruction* inst = LLVMModuleSet::getLLVMModuleSet()->getSVFInstruction(I);
423
-
424
- if (const SVFFunction *callee = SVFUtil::getCallee(inst))
425
- {
426
- if (callee->getName().find("llvm.memset") != std::string::npos)
427
- return I;
428
-
429
- }
430
- I = I->getPrevNode();
431
- }
432
- return nullptr;
433
- }
434
-
435
- /// Constant RC_FLAG values
436
- //@{
437
- static const RC_FLAG RC_MHP = 0x01;
438
- static const RC_FLAG RC_ALIASES = 0x02;
439
- static const RC_FLAG RC_PROTECTED = 0x04;
440
- static const RC_FLAG RC_RACE = 0x10;
441
- //@}
442
-
443
- /// The name of the function which is used to specify the ground truth
444
- /// of the validation properties in the target program.
445
- static constexpr char const *RC_ACCESS = "RC_ACCESS";
446
- };
447
- } // namespace SVF end
448
- #endif /* MTARESULTVALIDATOR_H_ */
@@ -1,229 +0,0 @@
1
- //===- PCG.h -- Procedure creation graph-------------//
2
- //
3
- // SVF: Static Value-Flow Analysis
4
- //
5
- // Copyright (C) <2013-> <Yulei Sui>
6
- //
7
-
8
- // This program is free software: you can redistribute it and/or modify
9
- // it under the terms of the GNU Affero General Public License as published by
10
- // the Free Software Foundation, either version 3 of the License, or
11
- // (at your option) any later version.
12
-
13
- // This program is distributed in the hope that it will be useful,
14
- // but WITHOUT ANY WARRANTY; without even the implied warranty of
15
- // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16
- // GNU Affero General Public License for more details.
17
-
18
- // You should have received a copy of the GNU Affero General Public License
19
- // along with this program. If not, see <http://www.gnu.org/licenses/>.
20
- //
21
- //===----------------------------------------------------------------------===//
22
-
23
- /*
24
- * MHP.h
25
- *
26
- * Created on: Jan 21, 2014
27
- * Author: Yulei Sui, Peng Di
28
- */
29
-
30
- #ifndef PCG_H_
31
- #define PCG_H_
32
-
33
- #include "Util/ThreadAPI.h"
34
- #include "Graphs/PTACallGraph.h"
35
- #include "Util/WorkList.h"
36
- #include "WPA/Andersen.h"
37
- #include <set>
38
- #include <vector>
39
-
40
- #include "MHP.h"
41
-
42
- namespace SVF
43
- {
44
-
45
- /*!
46
- * This class serves as a base may-happen in parallel analysis for multithreaded program
47
- * It distinguish thread spawner, spawnee, follower in procedure level by
48
- * modeling pthread_create, pthread_join, pthread_exit, pthread_cancel synchronization operations
49
- */
50
- class PCG
51
- {
52
-
53
- public:
54
- typedef Set<const SVFFunction*> FunSet;
55
- typedef std::vector<const SVFFunction*> FunVec;
56
- typedef Set<const SVFInstruction*> CallInstSet;
57
- typedef FIFOWorkList<const SVFFunction*> FunWorkList;
58
- typedef FIFOWorkList<const SVFBasicBlock*> BBWorkList;
59
-
60
- private:
61
- FunSet spawners;
62
- FunSet spawnees;
63
- FunSet followers;
64
- FunSet mhpfuns;
65
- PTACallGraph* callgraph;
66
- SVFModule* mod;
67
- PointerAnalysis* pta;
68
- ThreadAPI* tdAPI;
69
-
70
- /// Callsites direct or Indirect call a function which spawn a thread
71
- CallInstSet spawnCallSites;
72
-
73
- /// Add/Get methods for thread properties of a procedure
74
- //@{
75
- inline bool isSpawnerFun(const SVFFunction* fun) const
76
- {
77
- return spawners.find(fun) != spawners.end();
78
- }
79
- inline bool isSpawneeFun(const SVFFunction* fun) const
80
- {
81
- return spawnees.find(fun) != spawnees.end();
82
- }
83
- inline bool isFollowerFun(const SVFFunction* fun) const
84
- {
85
- return followers.find(fun) != followers.end();
86
- }
87
- inline bool addSpawnerFun(const SVFFunction* fun)
88
- {
89
- if (fun->isDeclaration())
90
- return false;
91
- return spawners.insert(fun).second;
92
- }
93
- inline bool addSpawneeFun(const SVFFunction* fun)
94
- {
95
- if (fun->isDeclaration())
96
- return false;
97
- return spawnees.insert(fun).second;
98
- }
99
- inline bool addFollowerFun(const SVFFunction* fun)
100
- {
101
- if (fun->isDeclaration())
102
- return false;
103
- return followers.insert(fun).second;
104
- }
105
- //@}
106
-
107
- /// Add/search spawn sites which directly or indirectly create a thread
108
- //@{
109
- inline bool addSpawnsite(const SVFInstruction* callInst)
110
- {
111
- return spawnCallSites.insert(callInst).second;
112
- }
113
- inline bool isSpawnsite(const SVFInstruction* callInst)
114
- {
115
- return spawnCallSites.find(callInst) != spawnCallSites.end();
116
- }
117
- //@}
118
- /// Spawn sites iterators
119
- //@{
120
- inline CallInstSet::const_iterator spawnSitesBegin() const
121
- {
122
- return spawnCallSites.begin();
123
- }
124
- inline CallInstSet::const_iterator spawnSitesEnd() const
125
- {
126
- return spawnCallSites.end();
127
- }
128
- //@}
129
-
130
- public:
131
-
132
- /// Constructor
133
- PCG(PointerAnalysis* an) : pta(an)
134
- {
135
- mod = pta->getModule();
136
- tdAPI=ThreadAPI::getThreadAPI();
137
- callgraph = pta->getPTACallGraph();
138
- }
139
-
140
- /// We start the pass here
141
- virtual bool analyze();
142
-
143
- /// Destructor
144
- virtual ~PCG()
145
- {
146
- }
147
-
148
- CallICFGNode* getCallICFGNode(const SVFInstruction* inst)
149
- {
150
- return pta->getICFG()->getCallICFGNode(inst);
151
- }
152
- /// Interface to query whether two function may happen-in-parallel
153
- virtual bool mayHappenInParallel(const SVFInstruction* i1, const SVFInstruction* i2) const;
154
- bool mayHappenInParallelBetweenFunctions(const SVFFunction* fun1, const SVFFunction* fun2) const;
155
- inline const FunSet& getMHPFunctions() const
156
- {
157
- return mhpfuns;
158
- }
159
-
160
- /// Initialize spawner and spawnee sets with threadAPI
161
- void initFromThreadAPI(SVFModule* module);
162
-
163
- /// Infer spawner spawnee and followers sets by traversing on callGraph
164
- //@{
165
- void inferFromCallGraph();
166
- void collectSpawners();
167
- void collectSpawnees();
168
- void collectFollowers();
169
- void identifyFollowers();
170
- //@}
171
-
172
- /// Get spawners/spawnees/followers
173
- //@{
174
- inline const FunSet& getSpawners() const
175
- {
176
- return spawners;
177
- }
178
- inline const FunSet& getSpawnees() const
179
- {
180
- return spawnees;
181
- }
182
- inline const FunSet& getFollowers() const
183
- {
184
- return followers;
185
- }
186
- //@}
187
-
188
- /// Iterators for thread properties of a procedure
189
- //@{
190
- inline FunSet::const_iterator spawnersBegin(const SVFFunction* fun) const
191
- {
192
- return spawners.begin();
193
- }
194
- inline FunSet::const_iterator spawnersEnd(const SVFFunction* fun) const
195
- {
196
- return spawners.end();
197
- }
198
- inline FunSet::const_iterator spawneesBegin(const SVFFunction* fun) const
199
- {
200
- return spawnees.begin();
201
- }
202
- inline FunSet::const_iterator spawneesEnd(const SVFFunction* fun) const
203
- {
204
- return spawnees.end();
205
- }
206
- inline FunSet::const_iterator followersBegin(const SVFFunction* fun) const
207
- {
208
- return followers.begin();
209
- }
210
- inline FunSet::const_iterator followersEnd(const SVFFunction* fun) const
211
- {
212
- return followers.end();
213
- }
214
- //@}
215
-
216
- /// Thread interferenceAnalysis
217
- void interferenceAnalysis();
218
-
219
- /// Print analysis results
220
- void printResults();
221
- /*!
222
- * Print Thread sensitive properties for each function
223
- */
224
- void printTDFuns();
225
- };
226
-
227
- } // End namespace SVF
228
-
229
- #endif /* PCG_H_ */