svf-lib 1.0.2205 → 1.0.2206

package/SVF-linux/Release-build/include/Graphs/SCC.h

@@ -130,12 +130,17 @@ public:
         return _T;
     }
 
+    inline const GNodeStack& topoNodeStack() const
+    {
+        return _T;
+    }
+
     /// Return a handle to the stack of nodes in reverse topological
     /// order. This will be used to seed the initial solution
     /// and improve efficiency.
-    inline GNodeStack revTopoNodeStack()
+    inline FIFOWorkList<NodeID> revTopoNodeStack() const
     {
-        GNodeStack revTopoOrder;
+        FIFOWorkList<NodeID> revTopoOrder;
         GNodeStack topoOrder = topoNodeStack();
         while(!topoOrder.empty())
         {

package/SVF-linux/Release-build/include/MSSA/MemRegion.h

@@ -268,8 +268,6 @@ private:
     /// Get all the objects in callee's modref escaped via global objects (the chain pts of globals)
     void getEscapObjviaGlobals(NodeBS& globs, const NodeBS& pts);
 
-    /// Get reverse topo call graph scc
-    void getCallGraphSCCRevTopoOrder(WorkList& worklist);
 
 protected:
     MRGenerator(BVDataPTAImpl* p, bool ptrOnly);

package/SVF-linux/Release-build/include/WPA/WPAFSSolver.h

@@ -73,10 +73,10 @@ protected:
 
         /// Both rep and sub nodes need to be processed later.
         /// Collect sub nodes from SCCDetector.
-        NodeStack revTopoStack = this->getSCCDetector()->revTopoNodeStack();
+        FIFOWorkList<NodeID> revTopoStack = this->getSCCDetector()->revTopoNodeStack();
         while (!revTopoStack.empty())
         {
-            NodeID nodeId = revTopoStack.top();
+            NodeID nodeId = revTopoStack.front();
             revTopoStack.pop();
             const NodeBS& subNodes = this->getSCCDetector()->subNodes(nodeId);
             for (NodeBS::iterator it = subNodes.begin(), eit = subNodes.end(); it != eit; ++it)

package/package.json

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