svf-tools 1.0.1279 → 1.0.1281

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.1279",
+  "version": "1.0.1281",
   "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/setup.sh

@@ -74,3 +74,5 @@ export PATH=$SVF_DIR/$Build/bin:$PATH
 
 # Add compiled library directories to $LD_LIBRARY_PATH
 export LD_LIBRARY_PATH=$SVF_DIR/$Build/svf:$SVF_DIR/$Build/svf-llvm:$LD_LIBRARY_PATH
+
+echo "Added SVF, LLVM, and Z3 to each of \$PATH, \$LD_LIBRARY_PATH, and \$DYLD_LIBRARY_PATH."

package/svf/include/Util/NodeIDAllocator.h

@@ -212,12 +212,12 @@ public:
 
         // From all the candidates, returns the best mapping for pointsToSets (points-to set -> # occurrences).
         static inline std::pair<hclust_fast_methods, std::vector<NodeID>> determineBestMapping(
-            const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
-            Map<PointsTo, unsigned> pointsToSets,
-            const std::string &evalSubtitle,
-            double &evalTime,
-            bool printStat
-        );
+                    const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
+                    Map<PointsTo, unsigned> pointsToSets,
+                    const std::string &evalSubtitle,
+                    double &evalTime,
+                    bool printStat
+                );
     };
 };
 

package/svf/lib/Util/NodeIDAllocator.cpp

@@ -392,7 +392,7 @@ std::vector<NodeID> NodeIDAllocator::Clusterer::cluster(
 
     // Work out which of the mappings we generated looks best.
     std::pair<hclust_fast_methods, std::vector<NodeID>> bestMapping =
-        determineBestMapping(candidates, pointsToSets, evalSubtitle, evalTime, printStat);
+                determineBestMapping(candidates, pointsToSets, evalSubtitle, evalTime, printStat);
 
     overallStats[DistanceMatrixTime] = std::to_string(distanceMatrixTime);
     overallStats[DendrogramTraversalTime] = std::to_string(dendrogramTraversalTime);
@@ -401,7 +401,10 @@ std::vector<NodeID> NodeIDAllocator::Clusterer::cluster(
     overallStats[TotalTime] = std::to_string(distanceMatrixTime + dendrogramTraversalTime + fastClusterTime + regioningTime + evalTime);
 
     overallStats[BestCandidate] = SVFUtil::hclustMethodToString(bestMapping.first);
-    if (printStat) { printStats(evalSubtitle + ": overall", overallStats); }
+    if (printStat)
+    {
+        printStats(evalSubtitle + ": overall", overallStats);
+    }
 
     return bestMapping.second;
 }
@@ -660,12 +663,12 @@ void NodeIDAllocator::Clusterer::evaluate(const std::vector<NodeID> &nodeMap, co
 
 // Work out which of the mappings we generated looks best.
 std::pair<hclust_fast_methods, std::vector<NodeID>> NodeIDAllocator::Clusterer::determineBestMapping(
-    const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
-    Map<PointsTo, unsigned> pointsToSets,
-    const std::string &evalSubtitle,
-    double &evalTime,
-    bool printStat
-)
+            const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
+            Map<PointsTo, unsigned> pointsToSets,
+            const std::string &evalSubtitle,
+            double &evalTime,
+            bool printStat
+        )
 {
     // In case we're not comparing anything, set to first "candidate".
     std::pair<hclust_fast_methods, std::vector<NodeID>> bestMapping = candidates[0];
@@ -685,7 +688,10 @@ std::pair<hclust_fast_methods, std::vector<NodeID>> NodeIDAllocator::Clusterer::
             evaluate(candidateMapping, pointsToSets, candidateStats, true);
             const double clkEnd = PTAStat::getClk(true);
             evalTime += (clkEnd - clkStart) / TIMEINTERVAL;
-            if (printStat) { printStats(evalSubtitle + ": candidate " + candidateMethodName, candidateStats); }
+            if (printStat)
+            {
+                printStats(evalSubtitle + ": candidate " + candidateMethodName, candidateStats);
+            }
 
             size_t candidateWords = 0;
             if (Options::PtType() == PointsTo::SBV) candidateWords = std::stoull(candidateStats[NewSbvNumWords]);

package/svf/lib/WPA/Andersen.cpp

@@ -439,7 +439,10 @@ void Andersen::finalize()
         // TODO: should we use liveOnly?
         // TODO: parameterise final arg.
         NodeIDAllocator::Clusterer::evaluate(*PointsTo::getCurrentBestNodeMapping(), ptd->getAllPts(true), stats, true);
-        if (print_stat) { NodeIDAllocator::Clusterer::printStats("post-main", stats); }
+        if (print_stat)
+        {
+            NodeIDAllocator::Clusterer::printStats("post-main", stats);
+        }
     }
 
     /// sanitize field insensitive obj

package/svf/lib/WPA/FlowSensitive.cpp

@@ -188,7 +188,10 @@ void FlowSensitive::finalize()
         Map<PointsTo, unsigned> allPts = ptd->getAllPts(true);
         // TODO: parameterise final arg.
         NodeIDAllocator::Clusterer::evaluate(*PointsTo::getCurrentBestNodeMapping(), allPts, stats, true);
-        if (print_stat) { NodeIDAllocator::Clusterer::printStats("post-main: best", stats); }
+        if (print_stat)
+        {
+            NodeIDAllocator::Clusterer::printStats("post-main: best", stats);
+        }
     }
 
     BVDataPTAImpl::finalize();