svf-lib 1.0.1256 → 1.0.1258

package/SVF-linux/include/SVF-FE/BasicTypes.h

@@ -188,6 +188,9 @@ typedef llvm::SCEVConstant SCEVConstant;
 typedef llvm::ScalarEvolution ScalarEvolution;
 typedef llvm::SCEV SCEV;
 
+/// LLVM outputs
+typedef llvm::raw_fd_ostream raw_fd_ostream;
+
 // LLVM Types.
 typedef llvm::VectorType VectorType;
 #if (LLVM_VERSION_MAJOR >= 9)

package/SVF-linux/include/Util/BasicTypes.h

@@ -76,7 +76,6 @@ typedef llvm::GlobalVariable GlobalVariable;
 
 /// LLVM outputs
 typedef llvm::raw_string_ostream raw_string_ostream;
-typedef llvm::raw_fd_ostream raw_fd_ostream;
 
 /// LLVM types
 typedef llvm::StructType StructType;
@@ -214,17 +213,7 @@ public:
         return bb2LoopMap.find(bb)!=bb2LoopMap.end();
     }
 
-    inline const std::vector<const BasicBlock*>& getLoopInfo(const BasicBlock* bb) const
-    {
-        Map<const BasicBlock*, std::vector<const BasicBlock*>>::const_iterator mapIter = bb2LoopMap.find(bb);
-        if(mapIter != bb2LoopMap.end())
-            return mapIter->second;
-        else
-        {
-            assert(hasLoopInfo(bb) && "loopinfo does not exit(bb not in a loop)");
-            abort();
-        }
-    }
+    const std::vector<const BasicBlock*>& getLoopInfo(const BasicBlock* bb) const;
 
     inline void addToBB2LoopMap(const BasicBlock* bb, const BasicBlock* loopBB)
     {
@@ -266,95 +255,13 @@ public:
         return this->exitBB;
     }
 
-    void getExitBlocksOfLoop(const BasicBlock* bb, Set<const BasicBlock*>& exitbbs) const
-    {
-        if (hasLoopInfo(bb))
-        {
-            const std::vector<const BasicBlock*>& blocks = getLoopInfo(bb);
-            assert(!blocks.empty() && "no available loop info?");
-            for (const BasicBlock* block : blocks)
-            {
-                for (succ_const_iterator succIt = succ_begin(block); succIt != succ_end(block); succIt++)
-                {
-                    const BasicBlock* succ = *succIt;
-                    if ((std::find(blocks.begin(), blocks.end(), succ)==blocks.end()))
-                        exitbbs.insert(succ);
-                }
-            }
-        }
-    }
-
-    bool isLoopHeader(const BasicBlock* bb) const
-    {
-        if (hasLoopInfo(bb))
-        {
-            const std::vector<const BasicBlock*>& blocks = getLoopInfo(bb);
-            assert(!blocks.empty() && "no available loop info?");
-            return blocks.front() == bb;
-        }
-        return false;
-    }
-
-    bool dominate(const BasicBlock* bbKey, const BasicBlock* bbValue) const
-    {
-        if (bbKey == bbValue)
-            return true;
-
-        // An unreachable node is dominated by anything.
-        if (isUnreachable(bbValue))
-        {
-            return true;
-        }
-
-        // And dominates nothing.
-        if (isUnreachable(bbKey))
-        {
-            return false;
-        }
-
-        const Map<const BasicBlock*,Set<const BasicBlock*>>& dtBBsMap = getDomTreeMap();
-        Map<const BasicBlock*,Set<const BasicBlock*>>::const_iterator mapIter = dtBBsMap.find(bbKey);
-        if (mapIter != dtBBsMap.end())
-        {
-            const Set<const BasicBlock*> & dtBBs = mapIter->second;
-            if (dtBBs.find(bbValue) != dtBBs.end())
-            {
-                return true;
-            }
-        }
-
-        return false;
-    }
-
-    bool postDominate(const BasicBlock* bbKey, const BasicBlock* bbValue) const
-    {
-        if (bbKey == bbValue)
-            return true;
-
-        // An unreachable node is dominated by anything.
-        if (isUnreachable(bbValue))
-        {
-            return true;
-        }
-
-        // And dominates nothing.
-        if (isUnreachable(bbKey))
-        {
-            return false;
-        }
-
-        const Map<const BasicBlock*,Set<const BasicBlock*>>& dtBBsMap = getPostDomTreeMap();
-        Map<const BasicBlock*,Set<const BasicBlock*>>::const_iterator mapIter = dtBBsMap.find(bbKey);
-        if (mapIter != dtBBsMap.end())
-        {
-            const Set<const BasicBlock*> & dtBBs = mapIter->second;
-            if (dtBBs.find(bbValue) != dtBBs.end())
-            {
-                return true;
-            }
-        }
-        return false;
-    }
+    void getExitBlocksOfLoop(const BasicBlock* bb, Set<const BasicBlock*>& exitbbs) const;
+
+    bool isLoopHeader(const BasicBlock* bb) const;
+
+    bool dominate(const BasicBlock* bbKey, const BasicBlock* bbValue) const;
+
+    bool postDominate(const BasicBlock* bbKey, const BasicBlock* bbValue) const;
 
     // Dump Control Flow Graph of llvm function, with instructions
     void viewCFG();

package/SVF-osx/include/CFL/CFLAlias.h

@@ -54,12 +54,10 @@ public:
     /// Print grammar and graph
     virtual void finalize();
 
-    /// Start Analysis here (main part of pointer analysis).
-    virtual void analyze();
+    /// Solving CFL Reachability
+    virtual void solve();
 
-    virtual void countSumEdges();
-
-    /// Interface exposed to users of our pointer analysis, given Value infos
+    /// Interface exposed to users of our Alias analysis, given Value infos
     virtual AliasResult alias(const Value* v1, const Value* v2)
     {
         NodeID n1 = svfir->getValueNode(v1);
@@ -67,7 +65,7 @@ public:
         return alias(n1,n2);
     }
 
-    /// Interface exposed to users of our pointer analysis, given PAGNodeID
+    /// Interface exposed to users of our Alias analysis, given PAGNodeID
     virtual AliasResult alias(NodeID node1, NodeID node2)
     {
         if(graph->hasEdge(graph->getGNode(node1), graph->getGNode(node2), graph->startKind))

package/SVF-osx/include/CFL/CFLBase.h

@@ -21,7 +21,7 @@
 //===----------------------------------------------------------------------===//
 
 /*
- * CFLAlias.h
+ * CFLBase.h
  *
  *  Created on: Oct 12, 2022
  *      Author: Pei Xu
@@ -45,6 +45,7 @@ namespace SVF
 
 class CFLStat;
 
+/// CFL Client Base Class
 class CFLBase : public BVDataPTAImpl
 {
 
@@ -57,53 +58,51 @@ public:
     virtual ~CFLBase()
     {
         delete solver;
+        delete grammarBase;
     }
 
-    /// Initialize the grammar, graph, solver
-    virtual void initialize() = 0;
+    /// Build Grammar from text file
+    virtual void buildCFLGrammar();
 
-    /// Print grammar and graph
-    virtual void finalize() = 0;
+    /// Build CFLGraph based on Option
+    virtual void buildCFLGraph();
 
-    /// Start Analysis here (main part of pointer analysis).
-    virtual void analyze() = 0;
+    /// Normalize grammar
+    virtual void normalizeCFLGrammar();
 
     /// Get CFL graph
-    CFLGraph* getCFLGraph()
-    {
-        return graph;
-    }
+    CFLGraph* getCFLGraph();
+
+    /// Count the num of Nonterminal Edges
+    virtual void countSumEdges();
+
+    /// Solving CFL Reachability
+    virtual void solve();
 
-    virtual void countSumEdges() = 0;
+    /// Perform analyze (main part of CFLR Analysis)
+    virtual void analyze();
 
     /// Statistics
     //@{
-    static u32_t numOfProcessedAddr;   /// Number of processed Addr edge
-    static u32_t numOfProcessedCopy;   /// Number of processed Copy edge
-    static u32_t numOfProcessedGep;    /// Number of processed Gep edge
-    static u32_t numOfProcessedLoad;   /// Number of processed Load edge
-    static u32_t numOfProcessedStore;  /// Number of processed Store edge
-    static u32_t numOfSfrs;
-    static u32_t numOfFieldExpand;
-
-    static u32_t numOfSCCDetection;
-    static double timeOfSCCDetection;
-    static double timeOfSCCMerges;
-    static double timeOfCollapse;
-    static u32_t AveragePointsToSetSize;
-    static u32_t MaxPointsToSetSize;
-    static double timeOfProcessCopyGep;
-    static double timeOfProcessLoadStore;
-    static double timeOfUpdateCallGraph;
-    static double timeOfSolving;
-    static double numOfSumEdges;
+    // Grammar
+    static double timeOfBuildCFLGrammar;            // Time of building grammarBase from text file
+    static double timeOfNormalizeGrammar;           // Time of normalizing grammarBase to CFLGrammar
+    // Graph
+    static double timeOfBuildCFLGraph;              // Time of building CFLGraph
+    static double numOfTerminalEdges;               // Number of terminal labeled edges
+    static double numOfTemporaryNonterminalEdges;   // Number of temporary (ie. X0, X1..) nonterminal labeled edges
+    static double numOfNonterminalEdges;            // Number of nonterminal labeled edges
+    static double numOfStartEdges;                  // Number of start nonterminal labeled edges
+    // Solver
+    static double timeOfSolving;                    // time of solving CFL Reachability
     //@}
 
 protected:
     SVFIR* svfir;
     CFLGraph* graph;
+    GrammarBase* grammarBase;
     CFLGrammar* grammar;
-    CFLSolver *solver;
+    CFLSolver* solver;
 };
 
 } // End namespace SVF

package/SVF-osx/include/CFL/CFLStat.h

@@ -53,17 +53,6 @@ private:
     CFLBase* pta;
 
 public:
-    static const char* CollapseTime;
-
-    static u32_t _MaxPtsSize;
-    static u32_t _NumOfCycles;
-    static u32_t _NumOfPWCCycles;
-    static u32_t _NumOfNodesInCycles;
-    static u32_t _MaxNumOfNodesInSCC;
-    u32_t _NumOfNullPtr;
-    u32_t _NumOfConstantPtr;
-    u32_t _NumOfBlackholePtr;
-
     /// CFL Stat
     u32_t _NumofCFLGraphNode;
 
@@ -76,15 +65,13 @@ public:
 
     virtual void performStat();
 
-    void collectCycleInfo(ConstraintGraph* consCG);
-
     void collectCFLInfo(CFLGraph* CFLGraph);
 
-    void statNullPtr();
-
     void constraintGraphStat();
+
+    void CFLGrammarStat();
 };
 
 } // End namespace SVF
 
-#endif /* FLOWSENSITIVESTAT_H_ */
+#endif /* CFL_CFLSTAT_H_ */

package/SVF-osx/include/CFL/CFLVF.h

@@ -52,10 +52,8 @@ public:
     /// Print grammar and graph
     virtual void finalize();
 
-    /// Start Analysis here (main part of pointer analysis).
-    virtual void analyze();
-
-    virtual void countSumEdges();
+    /// Build CFLGraph via VFG
+    void buildCFLGraph();
 
 private:
     SaberSVFGBuilder memSSA;

package/package.json

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