svf-lib 1.0.1432 → 1.0.1434
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.
- package/SVF-linux/Release-build/svf/libSvfCore.a +0 -0
- package/SVF-linux/Release-build/svf-llvm/libSvfLLVM.a +0 -0
- package/SVF-linux/svf/include/SVFIR/SVFIR.h +2 -2
- package/SVF-linux/svf/include/SVFIR/SVFType.h +1 -1
- package/SVF-linux/svf/include/Util/NodeIDAllocator.h +3 -3
- package/SVF-osx/Release-build/svf/libSvfCore.a +0 -0
- package/SVF-osx/Release-build/svf-llvm/libSvfLLVM.a +0 -0
- package/SVF-osx/svf/include/SVFIR/SVFIR.h +2 -2
- package/SVF-osx/svf/include/SVFIR/SVFType.h +1 -1
- package/SVF-osx/svf/include/Util/NodeIDAllocator.h +3 -3
- package/package.json +1 -1
|
Binary file
|
|
Binary file
|
|
@@ -578,13 +578,13 @@ private:
|
|
|
578
578
|
/// Add a value (pointer) node
|
|
579
579
|
inline NodeID addValNode(const SVFValue*, SVFVar *node, NodeID i)
|
|
580
580
|
{
|
|
581
|
-
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::
|
|
581
|
+
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DBUG to SEQ or DENSE");
|
|
582
582
|
return addNode(node,i);
|
|
583
583
|
}
|
|
584
584
|
/// Add a memory obj node
|
|
585
585
|
inline NodeID addObjNode(const SVFValue*, SVFVar *node, NodeID i)
|
|
586
586
|
{
|
|
587
|
-
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::
|
|
587
|
+
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DBUG to SEQ or DENSE");
|
|
588
588
|
return addNode(node,i);
|
|
589
589
|
}
|
|
590
590
|
/// Add a unique return node for a procedure
|
|
@@ -429,7 +429,7 @@ template <> struct Hash<NodePair>
|
|
|
429
429
|
} while (false)
|
|
430
430
|
#endif
|
|
431
431
|
|
|
432
|
-
/// LLVM debug macros, define type of your
|
|
432
|
+
/// LLVM debug macros, define type of your DBUG model of each pass
|
|
433
433
|
#define DBOUT(TYPE, X) SVF_DEBUG_WITH_TYPE(TYPE, X)
|
|
434
434
|
#define DOSTAT(X) X
|
|
435
435
|
#define DOTIMESTAT(X) X
|
|
@@ -36,7 +36,7 @@ public:
|
|
|
36
36
|
/// GEP objects are allocated as an offset from their base (see implementation
|
|
37
37
|
/// of allocateGepObjectId). The purpose of this allocation strategy
|
|
38
38
|
/// is human readability.
|
|
39
|
-
|
|
39
|
+
DBUG,
|
|
40
40
|
};
|
|
41
41
|
|
|
42
42
|
/// These nodes, and any nodes before them are assumed allocated
|
|
@@ -61,8 +61,8 @@ public:
|
|
|
61
61
|
|
|
62
62
|
/// Allocate a GEP object ID as determined by the strategy.
|
|
63
63
|
/// allocateObjectId is still fine for GEP objects, but
|
|
64
|
-
/// for some strategies (
|
|
65
|
-
/// be allocated differently (more readable, for
|
|
64
|
+
/// for some strategies (DBUG, namely), GEP objects can
|
|
65
|
+
/// be allocated differently (more readable, for DBUG).
|
|
66
66
|
/// Regardless, numObjects is shared; there is no special
|
|
67
67
|
/// numGepObjects.
|
|
68
68
|
NodeID allocateGepObjectId(NodeID base, u32_t offset, u32_t maxFieldLimit);
|
|
Binary file
|
|
Binary file
|
|
@@ -578,13 +578,13 @@ private:
|
|
|
578
578
|
/// Add a value (pointer) node
|
|
579
579
|
inline NodeID addValNode(const SVFValue*, SVFVar *node, NodeID i)
|
|
580
580
|
{
|
|
581
|
-
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::
|
|
581
|
+
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DBUG to SEQ or DENSE");
|
|
582
582
|
return addNode(node,i);
|
|
583
583
|
}
|
|
584
584
|
/// Add a memory obj node
|
|
585
585
|
inline NodeID addObjNode(const SVFValue*, SVFVar *node, NodeID i)
|
|
586
586
|
{
|
|
587
|
-
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::
|
|
587
|
+
assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DBUG to SEQ or DENSE");
|
|
588
588
|
return addNode(node,i);
|
|
589
589
|
}
|
|
590
590
|
/// Add a unique return node for a procedure
|
|
@@ -429,7 +429,7 @@ template <> struct Hash<NodePair>
|
|
|
429
429
|
} while (false)
|
|
430
430
|
#endif
|
|
431
431
|
|
|
432
|
-
/// LLVM debug macros, define type of your
|
|
432
|
+
/// LLVM debug macros, define type of your DBUG model of each pass
|
|
433
433
|
#define DBOUT(TYPE, X) SVF_DEBUG_WITH_TYPE(TYPE, X)
|
|
434
434
|
#define DOSTAT(X) X
|
|
435
435
|
#define DOTIMESTAT(X) X
|
|
@@ -36,7 +36,7 @@ public:
|
|
|
36
36
|
/// GEP objects are allocated as an offset from their base (see implementation
|
|
37
37
|
/// of allocateGepObjectId). The purpose of this allocation strategy
|
|
38
38
|
/// is human readability.
|
|
39
|
-
|
|
39
|
+
DBUG,
|
|
40
40
|
};
|
|
41
41
|
|
|
42
42
|
/// These nodes, and any nodes before them are assumed allocated
|
|
@@ -61,8 +61,8 @@ public:
|
|
|
61
61
|
|
|
62
62
|
/// Allocate a GEP object ID as determined by the strategy.
|
|
63
63
|
/// allocateObjectId is still fine for GEP objects, but
|
|
64
|
-
/// for some strategies (
|
|
65
|
-
/// be allocated differently (more readable, for
|
|
64
|
+
/// for some strategies (DBUG, namely), GEP objects can
|
|
65
|
+
/// be allocated differently (more readable, for DBUG).
|
|
66
66
|
/// Regardless, numObjects is shared; there is no special
|
|
67
67
|
/// numGepObjects.
|
|
68
68
|
NodeID allocateGepObjectId(NodeID base, u32_t offset, u32_t maxFieldLimit);
|