svf-lib 1.0.2543 → 1.0.2545

package/SVF-linux-aarch64/include/AE/Core/AbstractState.h

@@ -352,7 +352,7 @@ public:
     /// freed addresses intact. Used when building a cycle snapshot so the
     /// ValVar set is controlled by the caller rather than whatever was
     /// cached at the seed node.
-    void clearVars()
+    void clearValVars()
     {
         _varToAbsVal.clear();
     }

package/SVF-linux-aarch64/include/AE/Svfexe/AbstractInterpretation.h

@@ -149,6 +149,11 @@ public:
         svfStateMgr->updateAbstractState(node, state);
     }
 
+    inline bool hasAbsValue(const SVFVar* var, const ICFGNode* node)
+    {
+        return svfStateMgr->hasAbstractValue(var, node);
+    }
+
     inline const AbstractValue& getAbsValue(const SVFVar* var, const ICFGNode* node)
     {
         return svfStateMgr->getAbstractValue(var, node);
@@ -180,6 +185,30 @@ private:
     /// Handle a WTO cycle (loop or recursive function) using widening/narrowing iteration
     virtual void handleLoopOrRecursion(const ICFGCycleWTO* cycle, const CallICFGNode* caller = nullptr);
 
+    // ---- Semi-sparse cycle helpers ----
+    // ValVars whose def-site is inside the cycle but NOT cycle_head do not
+    // flow through cycle_head's merge in semi-sparse mode, so the around-merge
+    // widening cannot observe them.  getFullCycleHeadState pulls these ValVars
+    // into a single AbstractState snapshot so widen/narrow can treat ValVars
+    // and ObjVars uniformly; after widen/narrow we scatter the ValVars back
+    // to their def-sites.
+
+    /// Build a full cycle-head AbstractState: the ObjVars currently at
+    /// cycle_head combined with every cycle ValVar pulled from its
+    /// def-site.  Skips ValVars without a stored value to avoid the
+    /// top-fallback contamination.  In dense mode this is equivalent to
+    /// trace[cycle_head] since ValVars already live there.
+    AbstractState getFullCycleHeadState(const ICFGCycleWTO* cycle);
+
+    /// Widen prev with cur; write the widened state to trace[cycle_head]
+    /// and scatter its ValVars back to their def-sites.  Returns true
+    /// when the widened result equals prev (fixpoint).
+    bool widenCycleState(const AbstractState& prev, const AbstractState& cur,
+                         const ICFGCycleWTO* cycle);
+    /// Narrow prev with cur; write the narrowed state back and scatter.
+    bool narrowCycleState(const AbstractState& prev, const AbstractState& cur,
+                          const ICFGCycleWTO* cycle);
+
     /// Handle a function body via worklist-driven WTO traversal starting from funEntry
     void handleFunction(const ICFGNode* funEntry, const CallICFGNode* caller = nullptr);
 

package/SVF-linux-aarch64/include/AE/Svfexe/AbstractStateManager.h

@@ -66,6 +66,19 @@ public:
     /// Dispatch to ValVar or ObjVar overload (checks ObjVar first due to inheritance).
     const AbstractValue& getAbstractValue(const SVFVar* var, const ICFGNode* node);
 
+    /// Check whether a ValVar has a real stored value reachable by
+    /// getAbstractValue.  Unlike getAbstractValue, this is side-effect free
+    /// and does NOT treat the final top-fallback as "present" — so callers
+    /// that plan to write the fetched value back (e.g. cycle widen/narrow)
+    /// can distinguish a genuine stored value from the top sentinel.
+    bool hasAbstractValue(const ValVar* var, const ICFGNode* node) const;
+
+    /// Check whether an ObjVar has a stored value at node.
+    bool hasAbstractValue(const ObjVar* var, const ICFGNode* node) const;
+
+    /// Dispatch to ValVar or ObjVar overload.
+    bool hasAbstractValue(const SVFVar* var, const ICFGNode* node) const;
+
     /// Write a top-level variable's abstract value into abstractTrace[node].
     void updateAbstractValue(const ValVar* var, const AbstractValue& val, const ICFGNode* node);
 

package/SVF-linux-aarch64/include/AE/Svfexe/PreAnalysis.h

@@ -80,10 +80,10 @@ public:
 
     /// Look up the ValVar id set of a WTO cycle. Returns nullptr if the
     /// cycle is unknown (e.g. dense mode, where the map is never built).
-    const Set<NodeID>* getCycleValVars(const ICFGCycleWTO* cycle) const
+    const Set<const ValVar*> getCycleValVars(const ICFGCycleWTO* cycle) const
     {
         auto it = cycleToValVars.find(cycle);
-        return it == cycleToValVars.end() ? nullptr : &it->second;
+        return it == cycleToValVars.end() ? Set<const ValVar*>() : it->second;
     }
 
 private:
@@ -98,7 +98,7 @@ private:
     /// Pre-computed (semi-sparse only) map from a WTO cycle to the IDs of
     /// every ValVar whose def-site is inside that cycle, including all
     /// nested sub-cycles. Empty in dense mode.
-    Map<const ICFGCycleWTO*, Set<NodeID>> cycleToValVars;
+    Map<const ICFGCycleWTO*, Set<const ValVar*>> cycleToValVars;
 };
 
 } // End namespace SVF

package/SVF-linux-x86_64/include/AE/Core/AbstractState.h

@@ -352,7 +352,7 @@ public:
     /// freed addresses intact. Used when building a cycle snapshot so the
     /// ValVar set is controlled by the caller rather than whatever was
     /// cached at the seed node.
-    void clearVars()
+    void clearValVars()
     {
         _varToAbsVal.clear();
     }

package/SVF-linux-x86_64/include/AE/Svfexe/AbstractInterpretation.h

@@ -149,6 +149,11 @@ public:
         svfStateMgr->updateAbstractState(node, state);
     }
 
+    inline bool hasAbsValue(const SVFVar* var, const ICFGNode* node)
+    {
+        return svfStateMgr->hasAbstractValue(var, node);
+    }
+
     inline const AbstractValue& getAbsValue(const SVFVar* var, const ICFGNode* node)
     {
         return svfStateMgr->getAbstractValue(var, node);
@@ -180,6 +185,30 @@ private:
     /// Handle a WTO cycle (loop or recursive function) using widening/narrowing iteration
     virtual void handleLoopOrRecursion(const ICFGCycleWTO* cycle, const CallICFGNode* caller = nullptr);
 
+    // ---- Semi-sparse cycle helpers ----
+    // ValVars whose def-site is inside the cycle but NOT cycle_head do not
+    // flow through cycle_head's merge in semi-sparse mode, so the around-merge
+    // widening cannot observe them.  getFullCycleHeadState pulls these ValVars
+    // into a single AbstractState snapshot so widen/narrow can treat ValVars
+    // and ObjVars uniformly; after widen/narrow we scatter the ValVars back
+    // to their def-sites.
+
+    /// Build a full cycle-head AbstractState: the ObjVars currently at
+    /// cycle_head combined with every cycle ValVar pulled from its
+    /// def-site.  Skips ValVars without a stored value to avoid the
+    /// top-fallback contamination.  In dense mode this is equivalent to
+    /// trace[cycle_head] since ValVars already live there.
+    AbstractState getFullCycleHeadState(const ICFGCycleWTO* cycle);
+
+    /// Widen prev with cur; write the widened state to trace[cycle_head]
+    /// and scatter its ValVars back to their def-sites.  Returns true
+    /// when the widened result equals prev (fixpoint).
+    bool widenCycleState(const AbstractState& prev, const AbstractState& cur,
+                         const ICFGCycleWTO* cycle);
+    /// Narrow prev with cur; write the narrowed state back and scatter.
+    bool narrowCycleState(const AbstractState& prev, const AbstractState& cur,
+                          const ICFGCycleWTO* cycle);
+
     /// Handle a function body via worklist-driven WTO traversal starting from funEntry
     void handleFunction(const ICFGNode* funEntry, const CallICFGNode* caller = nullptr);
 

package/SVF-linux-x86_64/include/AE/Svfexe/AbstractStateManager.h

@@ -66,6 +66,19 @@ public:
     /// Dispatch to ValVar or ObjVar overload (checks ObjVar first due to inheritance).
     const AbstractValue& getAbstractValue(const SVFVar* var, const ICFGNode* node);
 
+    /// Check whether a ValVar has a real stored value reachable by
+    /// getAbstractValue.  Unlike getAbstractValue, this is side-effect free
+    /// and does NOT treat the final top-fallback as "present" — so callers
+    /// that plan to write the fetched value back (e.g. cycle widen/narrow)
+    /// can distinguish a genuine stored value from the top sentinel.
+    bool hasAbstractValue(const ValVar* var, const ICFGNode* node) const;
+
+    /// Check whether an ObjVar has a stored value at node.
+    bool hasAbstractValue(const ObjVar* var, const ICFGNode* node) const;
+
+    /// Dispatch to ValVar or ObjVar overload.
+    bool hasAbstractValue(const SVFVar* var, const ICFGNode* node) const;
+
     /// Write a top-level variable's abstract value into abstractTrace[node].
     void updateAbstractValue(const ValVar* var, const AbstractValue& val, const ICFGNode* node);
 

package/SVF-linux-x86_64/include/AE/Svfexe/PreAnalysis.h

@@ -80,10 +80,10 @@ public:
 
     /// Look up the ValVar id set of a WTO cycle. Returns nullptr if the
     /// cycle is unknown (e.g. dense mode, where the map is never built).
-    const Set<NodeID>* getCycleValVars(const ICFGCycleWTO* cycle) const
+    const Set<const ValVar*> getCycleValVars(const ICFGCycleWTO* cycle) const
     {
         auto it = cycleToValVars.find(cycle);
-        return it == cycleToValVars.end() ? nullptr : &it->second;
+        return it == cycleToValVars.end() ? Set<const ValVar*>() : it->second;
     }
 
 private:
@@ -98,7 +98,7 @@ private:
     /// Pre-computed (semi-sparse only) map from a WTO cycle to the IDs of
     /// every ValVar whose def-site is inside that cycle, including all
     /// nested sub-cycles. Empty in dense mode.
-    Map<const ICFGCycleWTO*, Set<NodeID>> cycleToValVars;
+    Map<const ICFGCycleWTO*, Set<const ValVar*>> cycleToValVars;
 };
 
 } // End namespace SVF

package/package.json

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