svf-tools 1.0.664 → 1.0.665

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.664",
+  "version": "1.0.665",
   "description": "* <b>[TypeClone](https://github.com/SVF-tools/SVF/wiki/TypeClone) published in our [ECOOP paper](https://yuleisui.github.io/publications/ecoop20.pdf) is now available in SVF </b> * <b>SVF now uses a single script for its build. Just type [`source ./build.sh`](https://github.com/SVF-tools/SVF/blob/master/build.sh) in your terminal, that's it!</b> * <b>SVF now supports LLVM-10.0.0! </b> * <b>We thank [bsauce](https://github.com/bsauce) for writing a user manual of SVF ([link1](https://www.jianshu.com/p/068a08ec749c) and [link2](https://www.jianshu.com/p/777c30d4240e)) in Chinese </b> * <b>SVF now supports LLVM-9.0.0 (Thank [Byoungyoung Lee](https://github.com/SVF-tools/SVF/issues/142) for his help!). </b> * <b>SVF now supports a set of [field-sensitive pointer analyses](https://yuleisui.github.io/publications/sas2019a.pdf). </b> * <b>[Use SVF as an external lib](https://github.com/SVF-tools/SVF/wiki/Using-SVF-as-a-lib-in-your-own-tool) for your own project (Contributed by [Hongxu Chen](https://github.com/HongxuChen)). </b> * <b>SVF now supports LLVM-7.0.0. </b> * <b>SVF now supports Docker. [Try SVF in Docker](https://github.com/SVF-tools/SVF/wiki/Try-SVF-in-Docker)! </b> * <b>SVF now supports [LLVM-6.0.0](https://github.com/svf-tools/SVF/pull/38) (Contributed by [Jack Anthony](https://github.com/jackanth)). </b> * <b>SVF now supports [LLVM-4.0.0](https://github.com/svf-tools/SVF/pull/23) (Contributed by Jared Carlson. Thank [Jared](https://github.com/jcarlson23) and [Will](https://github.com/dtzWill) for their in-depth [discussions](https://github.com/svf-tools/SVF/pull/18) about updating SVF!) </b> * <b>SVF now supports analysis for C++ programs.</b> <br />",
   "main": "index.js",
   "scripts": {

package/svf/include/SVFIR/SVFIR.h

@@ -578,13 +578,13 @@ private:
     /// Add a value (pointer) node
     inline NodeID addValNode(const SVFValue*, SVFVar *node, NodeID i)
     {
-        assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DEBUG to SEQ or DENSE");
+        assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DBUG to SEQ or DENSE");
         return addNode(node,i);
     }
     /// Add a memory obj node
     inline NodeID addObjNode(const SVFValue*, SVFVar *node, NodeID i)
     {
-        assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DEBUG to SEQ or DENSE");
+        assert(hasGNode(i) == false && "This NodeID clashes here. Please check NodeIDAllocator. Switch Strategy::DBUG to SEQ or DENSE");
         return addNode(node,i);
     }
     /// Add a unique return node for a procedure

package/svf/include/SVFIR/SVFType.h

@@ -429,7 +429,7 @@ template <> struct Hash<NodePair>
         } while (false)
 #endif
 
-/// LLVM debug macros, define type of your DEBUG model of each pass
+/// LLVM debug macros, define type of your DBUG model of each pass
 #define DBOUT(TYPE, X) SVF_DEBUG_WITH_TYPE(TYPE, X)
 #define DOSTAT(X) X
 #define DOTIMESTAT(X) X

package/svf/include/Util/NodeIDAllocator.h

@@ -36,7 +36,7 @@ public:
         /// GEP objects are allocated as an offset from their base (see implementation
         /// of allocateGepObjectId). The purpose of this allocation strategy
         /// is human readability.
-        DEBUG,
+        DBUG,
     };
 
     /// These nodes, and any nodes before them are assumed allocated
@@ -61,8 +61,8 @@ public:
 
     /// Allocate a GEP object ID as determined by the strategy.
     /// allocateObjectId is still fine for GEP objects, but
-    /// for some strategies (DEBUG, namely), GEP objects can
-    /// be allocated differently (more readable, for DEBUG).
+    /// for some strategies (DBUG, namely), GEP objects can
+    /// be allocated differently (more readable, for DBUG).
     /// Regardless, numObjects is shared; there is no special
     /// numGepObjects.
     NodeID allocateGepObjectId(NodeID base, u32_t offset, u32_t maxFieldLimit);

package/svf/lib/Util/NodeIDAllocator.cpp

@@ -64,7 +64,7 @@ NodeID NodeIDAllocator::allocateObjectId(void)
         // Everything is sequential and intermixed.
         id = numNodes;
     }
-    else if (strategy == Strategy::DEBUG)
+    else if (strategy == Strategy::DBUG)
     {
         // Non-GEPs just grab the next available ID.
         // We may have "holes" because GEPs increment the total
@@ -101,7 +101,7 @@ NodeID NodeIDAllocator::allocateGepObjectId(NodeID base, u32_t offset, u32_t max
         // Everything is sequential and intermixed.
         id = numNodes;
     }
-    else if (strategy == Strategy::DEBUG)
+    else if (strategy == Strategy::DBUG)
     {
         // For a gep id, base id is set at lower bits, and offset is set at higher bits
         // e.g., 1100050 denotes base=50 and offset=10
@@ -146,7 +146,7 @@ NodeID NodeIDAllocator::allocateValueId(void)
         // Everything is sequential and intermixed.
         id = numNodes;
     }
-    else if (strategy == Strategy::DEBUG)
+    else if (strategy == Strategy::DBUG)
     {
         id = numNodes;
     }

package/svf/lib/Util/Options.cpp

@@ -29,7 +29,7 @@ const OptionMap<NodeIDAllocator::Strategy> Options::NodeAllocStrat(
     {NodeIDAllocator::Strategy::DENSE, "dense", "allocate objects together [0-n] and values together [m-MAX], separately"},
     {NodeIDAllocator::Strategy::REVERSE_DENSE, "reverse-dense", "like dense but flipped, objects are [m-MAX], values are [0-n]"},
     {NodeIDAllocator::Strategy::SEQ, "seq", "allocate values and objects sequentially, intermixed (default)"},
-    {NodeIDAllocator::Strategy::DEBUG, "debug", "allocate value and objects sequentially, intermixed, except GEP objects as offsets"},
+    {NodeIDAllocator::Strategy::DBUG, "debug", "allocate value and objects sequentially, intermixed, except GEP objects as offsets"},
 }
 );