svf-lib 1.0.2695 → 1.0.2697

package/SVF-linux-x86_64/include/MemoryModel/AbstractPointsToDS.h

@@ -101,6 +101,12 @@ public:
         return ptdTy;
     }
 
+    /// Whether we maintain reverse points-to sets.
+    inline bool hasReversePts() const
+    {
+        return rev;
+    }
+
     /// Clears all points-to sets as if nothing is stored.
     virtual void clear() = 0;
 

package/SVF-linux-x86_64/include/MemoryModel/PointerAnalysis.h

@@ -189,6 +189,10 @@ public:
     /// Interface exposed to users of our pointer analysis, given PAGNodeID
     virtual AliasResult alias(NodeID node1, NodeID node2) = 0;
 
+    /// Collect the nodes that may alias the given node.
+    /// Subclasses must implement this query; the default reports unsupported and aborts.
+    virtual NodeBS getMayAliases(NodeID node);
+
     /// Get points-to targets of a pointer. It needs to be implemented in child class
     virtual const PointsTo& getPts(NodeID ptr) = 0;
 

package/SVF-linux-x86_64/include/MemoryModel/PointerAnalysisImpl.h

@@ -225,6 +225,10 @@ public:
     /// Interface expose to users of our pointer analysis, given two pts
     virtual AliasResult alias(const PointsTo& pts1, const PointsTo& pts2);
 
+    /// Declaring the PointsTo overload below would otherwise hide the base class's
+    /// mayAlias(NodeID, NodeID) and mayAlias(const SVFVar*, const SVFVar*).
+    using PointerAnalysis::mayAlias;
+
     /// Convenience bool wrappers: return true if the two operands may/must/partial alias
     inline bool mayAlias(const PointsTo& pts1, const PointsTo& pts2)
     {

package/SVF-linux-x86_64/include/WPA/Andersen.h

@@ -252,6 +252,9 @@ public:
         return getPTDataTy()->unionPts(id,ptd);
     }
 
+    /// Collect exactly the SVFIR nodes q for which mayAlias(node, q) holds
+    virtual NodeBS getMayAliases(NodeID node);
+
 
     void dumpTopLevelPtsTo();
 
@@ -354,6 +357,13 @@ protected:
     /// SCC detection
     virtual NodeStack& SCCDetect();
 
+    /// Collect may-alias candidates. Attempts to do so from reverse points-to sets (cheaper),
+    /// and if not possible, falls back to trying every node (costlier).
+    NodeBS getMayAliasCandidates(NodeID node);
+
+    /// Also check getMayAliases on the pointers that the alias tests use
+    virtual void validateSuccessTests(std::string fun);
+
 
 
     /// Sanitize pts for field insensitive objects

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-lib",
-  "version": "1.0.2695",
+  "version": "1.0.2697",
   "description": "SVF's npm support",
   "main": "index.js",
   "scripts": {