svf-tools 1.0.569 → 1.0.571

package/SVF-doxygen/html/html/search/variables_e.js

@@ -58,7 +58,7 @@ var searchData=
   ['numofentrychi',['NumOfEntryChi',['../classSVF_1_1MemSSAStat.html#ad96437d0c28f8088c711a718d2f2730e',1,'SVF::MemSSAStat']]],
   ['numofentrynodes',['numOfEntryNodes',['../classSVF_1_1ICFGStat.html#ad37793e64fe58a8faba201c18d876685',1,'SVF::ICFGStat']]],
   ['numofexitnodes',['numOfExitNodes',['../classSVF_1_1ICFGStat.html#ad7e00680fb8ca31afbd166f9a4adc5ec',1,'SVF::ICFGStat']]],
-  ['numoffieldexpand',['numOfFieldExpand',['../classSVF_1_1AndersenBase.html#a9f453ec1b4236b8194ae590981217259',1,'SVF::AndersenBase']]],
+  ['numoffieldexpand',['numOfFieldExpand',['../classSVF_1_1CFLAlias.html#a46b3d4d12aa4fbf38038ce68e4e77096',1,'SVF::CFLAlias::numOfFieldExpand()'],['../classSVF_1_1AndersenBase.html#a9f453ec1b4236b8194ae590981217259',1,'SVF::AndersenBase::numOfFieldExpand()']]],
   ['numofflattenelements',['numOfFlattenElements',['../classSVF_1_1StInfo.html#a7aa5b5018b4dec4913eb6aecf25568a4',1,'SVF::StInfo']]],
   ['numofflattenfields',['numOfFlattenFields',['../classSVF_1_1StInfo.html#aa9b4e659f4a4421aadf736a3de24ca50',1,'SVF::StInfo']]],
   ['numofformalin',['numOfFormalIn',['../classSVF_1_1SVFGStat.html#abc5e079242666bb55ec7dbc7f258b3db',1,'SVF::SVFGStat']]],
@@ -80,7 +80,7 @@ var searchData=
   ['numofmhpld',['numOfMHPLd',['../classSVF_1_1MTAAnnotator.html#a29e0123620ab072fddc45331c6aa46e8',1,'SVF::MTAAnnotator']]],
   ['numofmhpqueries',['numOfMHPQueries',['../classSVF_1_1MHP.html#ab8bd382e0c70b0feb2a291ecc4043106',1,'SVF::MHP']]],
   ['numofmhpst',['numOfMHPSt',['../classSVF_1_1MTAAnnotator.html#a3a53e90b4f361d1298983bc89795b3d2',1,'SVF::MTAAnnotator']]],
-  ['numofmssaphi',['numOfMSSAPhi',['../classSVF_1_1SVFGStat.html#a9fc87025af3b7e54442e78f46ebe0360',1,'SVF::SVFGStat::numOfMSSAPhi()'],['../classSVF_1_1MemSSAStat.html#a4b598cb1d06c4c0963787036862b1c3d',1,'SVF::MemSSAStat::NumOfMSSAPhi()']]],
+  ['numofmssaphi',['NumOfMSSAPhi',['../classSVF_1_1MemSSAStat.html#a4b598cb1d06c4c0963787036862b1c3d',1,'SVF::MemSSAStat::NumOfMSSAPhi()'],['../classSVF_1_1SVFGStat.html#a9fc87025af3b7e54442e78f46ebe0360',1,'SVF::SVFGStat::numOfMSSAPhi()']]],
   ['numofnewsvfgedges',['numOfNewSVFGEdges',['../classSVF_1_1MTASVFGBuilder.html#a019a4597074fdad6e51d936ed4ead0d9',1,'SVF::MTASVFGBuilder']]],
   ['numofnodes',['numOfNodes',['../classSVF_1_1ICFGStat.html#a8e71a19c266aacd7acb1fee6bb339788',1,'SVF::ICFGStat::numOfNodes()'],['../classSVF_1_1SVFGStat.html#ab499c24856a990dd4adb366107eb3302',1,'SVF::SVFGStat::numOfNodes()']]],
   ['numofnodesinscc',['numOfNodesInSCC',['../classSVF_1_1FlowSensitive.html#a9f3fe97202db8170fa9f47c5684bce75',1,'SVF::FlowSensitive']]],
@@ -88,14 +88,14 @@ var searchData=
   ['numofnonlocalst',['numOfNonLocalSt',['../classSVF_1_1MTAAnnotator.html#a3c07f9964623b3895b1bab59a63dccfb',1,'SVF::MTAAnnotator']]],
   ['numofphi',['numOfPhi',['../classSVF_1_1SVFGStat.html#a0e1fcb9154aad266406c4da4861ba020',1,'SVF::SVFGStat']]],
   ['numofprocessedactualparam',['numOfProcessedActualParam',['../classSVF_1_1FlowSensitive.html#abdc30e45347579986c42795a436a1251',1,'SVF::FlowSensitive']]],
-  ['numofprocessedaddr',['numOfProcessedAddr',['../classSVF_1_1AndersenBase.html#a4acad18a6eb585ba9e3d2276dd591067',1,'SVF::AndersenBase::numOfProcessedAddr()'],['../classSVF_1_1FlowSensitive.html#ae4253bc632ffffe2498263c90f456ca7',1,'SVF::FlowSensitive::numOfProcessedAddr()']]],
-  ['numofprocessedcopy',['numOfProcessedCopy',['../classSVF_1_1AndersenBase.html#a04acd871bd1b98cd9e83e395334ac130',1,'SVF::AndersenBase::numOfProcessedCopy()'],['../classSVF_1_1FlowSensitive.html#a19e017f3ed6429fa30687018e64dae54',1,'SVF::FlowSensitive::numOfProcessedCopy()']]],
+  ['numofprocessedaddr',['numOfProcessedAddr',['../classSVF_1_1CFLAlias.html#acd6070559826ef7983a828852ac93331',1,'SVF::CFLAlias::numOfProcessedAddr()'],['../classSVF_1_1AndersenBase.html#a4acad18a6eb585ba9e3d2276dd591067',1,'SVF::AndersenBase::numOfProcessedAddr()'],['../classSVF_1_1FlowSensitive.html#ae4253bc632ffffe2498263c90f456ca7',1,'SVF::FlowSensitive::numOfProcessedAddr()']]],
+  ['numofprocessedcopy',['numOfProcessedCopy',['../classSVF_1_1CFLAlias.html#a320eed3b2074070c5a58a97d24e379db',1,'SVF::CFLAlias::numOfProcessedCopy()'],['../classSVF_1_1AndersenBase.html#a04acd871bd1b98cd9e83e395334ac130',1,'SVF::AndersenBase::numOfProcessedCopy()'],['../classSVF_1_1FlowSensitive.html#a19e017f3ed6429fa30687018e64dae54',1,'SVF::FlowSensitive::numOfProcessedCopy()']]],
   ['numofprocessedformalret',['numOfProcessedFormalRet',['../classSVF_1_1FlowSensitive.html#ae048cc5350cf2b075c05f5d84777a3c5',1,'SVF::FlowSensitive']]],
-  ['numofprocessedgep',['numOfProcessedGep',['../classSVF_1_1AndersenBase.html#aa1246b392aeae1fd10c8a9ebedcc2dd9',1,'SVF::AndersenBase::numOfProcessedGep()'],['../classSVF_1_1FlowSensitive.html#a88a111b6bc347d6562db7af8bd8f2f0e',1,'SVF::FlowSensitive::numOfProcessedGep()']]],
-  ['numofprocessedload',['numOfProcessedLoad',['../classSVF_1_1AndersenBase.html#a69aae96fc1c99bf108075e5061f50f9e',1,'SVF::AndersenBase::numOfProcessedLoad()'],['../classSVF_1_1FlowSensitive.html#a0e1a0bdbf4f81a3600ac26ac011ac268',1,'SVF::FlowSensitive::numOfProcessedLoad()']]],
+  ['numofprocessedgep',['numOfProcessedGep',['../classSVF_1_1CFLAlias.html#aa6a5ed4632eeef28f35910514b9e8a66',1,'SVF::CFLAlias::numOfProcessedGep()'],['../classSVF_1_1AndersenBase.html#aa1246b392aeae1fd10c8a9ebedcc2dd9',1,'SVF::AndersenBase::numOfProcessedGep()'],['../classSVF_1_1FlowSensitive.html#a88a111b6bc347d6562db7af8bd8f2f0e',1,'SVF::FlowSensitive::numOfProcessedGep()']]],
+  ['numofprocessedload',['numOfProcessedLoad',['../classSVF_1_1CFLAlias.html#a35356e309560c939ca47bccf47d2ba50',1,'SVF::CFLAlias::numOfProcessedLoad()'],['../classSVF_1_1AndersenBase.html#a69aae96fc1c99bf108075e5061f50f9e',1,'SVF::AndersenBase::numOfProcessedLoad()'],['../classSVF_1_1FlowSensitive.html#a0e1a0bdbf4f81a3600ac26ac011ac268',1,'SVF::FlowSensitive::numOfProcessedLoad()']]],
   ['numofprocessedmssanode',['numOfProcessedMSSANode',['../classSVF_1_1FlowSensitive.html#af71a5ae3aef022c569e89f40515072cf',1,'SVF::FlowSensitive']]],
   ['numofprocessedphi',['numOfProcessedPhi',['../classSVF_1_1FlowSensitive.html#ac39abcb40e4b568ab59b7cf48ed10f70',1,'SVF::FlowSensitive']]],
-  ['numofprocessedstore',['numOfProcessedStore',['../classSVF_1_1AndersenBase.html#a2b763519509ce21cf40893c01f8357b6',1,'SVF::AndersenBase::numOfProcessedStore()'],['../classSVF_1_1FlowSensitive.html#a669e8f1dd8572b7dcff373c9787a923d',1,'SVF::FlowSensitive::numOfProcessedStore()']]],
+  ['numofprocessedstore',['numOfProcessedStore',['../classSVF_1_1CFLAlias.html#afc529c27f0e572948de13c319435b415',1,'SVF::CFLAlias::numOfProcessedStore()'],['../classSVF_1_1AndersenBase.html#a2b763519509ce21cf40893c01f8357b6',1,'SVF::AndersenBase::numOfProcessedStore()'],['../classSVF_1_1FlowSensitive.html#a669e8f1dd8572b7dcff373c9787a923d',1,'SVF::FlowSensitive::numOfProcessedStore()']]],
   ['numofremovedpts',['numOfRemovedPTS',['../classSVF_1_1MTASVFGBuilder.html#a07c3f5fa2e0092dac28521cf901a26cf',1,'SVF::MTASVFGBuilder']]],
   ['numofremovedsvfgedges',['numOfRemovedSVFGEdges',['../classSVF_1_1MTASVFGBuilder.html#a0319d1d2e78c79f9943f2e2f65da26ed',1,'SVF::MTASVFGBuilder']]],
   ['numofresolvedindcalledge',['numOfResolvedIndCallEdge',['../classSVF_1_1PTACallGraph.html#adf05313ea8bcc7973acebd3fbcd75c92',1,'SVF::PTACallGraph']]],
@@ -103,8 +103,8 @@ var searchData=
   ['numofretmu',['NumOfRetMu',['../classSVF_1_1MemSSAStat.html#a1459465f0a76c09b5dd7d777467ac2e4',1,'SVF::MemSSAStat']]],
   ['numofretnodes',['numOfRetNodes',['../classSVF_1_1ICFGStat.html#ac9bfce40c058ed7ab178fe1f1818e9de',1,'SVF::ICFGStat']]],
   ['numofscc',['numOfSCC',['../classSVF_1_1FlowSensitive.html#a0ac955bf06261eec1c6bb78ec99652e3',1,'SVF::FlowSensitive']]],
-  ['numofsccdetection',['numOfSCCDetection',['../classSVF_1_1AndersenBase.html#a0d7298cbf83568f24fd2bd1926a32968',1,'SVF::AndersenBase']]],
-  ['numofsfrs',['numOfSfrs',['../classSVF_1_1AndersenBase.html#a25b00d9ca71cbdd27530fc5d0dc84ee5',1,'SVF::AndersenBase']]],
+  ['numofsccdetection',['numOfSCCDetection',['../classSVF_1_1CFLAlias.html#abde85bf1f0f4ff2cf01e05b2f645a876',1,'SVF::CFLAlias::numOfSCCDetection()'],['../classSVF_1_1AndersenBase.html#a0d7298cbf83568f24fd2bd1926a32968',1,'SVF::AndersenBase::numOfSCCDetection()']]],
+  ['numofsfrs',['numOfSfrs',['../classSVF_1_1CFLAlias.html#a7f63c7509ac67a697b248dd28e9c2409',1,'SVF::CFLAlias::numOfSfrs()'],['../classSVF_1_1AndersenBase.html#a25b00d9ca71cbdd27530fc5d0dc84ee5',1,'SVF::AndersenBase::numOfSfrs()']]],
   ['numofstore',['numOfStore',['../classSVF_1_1SVFGStat.html#a4d15f2de3f226c26cb2af57176444ec9',1,'SVF::SVFGStat']]],
   ['numofstorechi',['NumOfStoreChi',['../classSVF_1_1MemSSAStat.html#a810965c025da84c58575c8066bc84056',1,'SVF::MemSSAStat']]],
   ['numofstorehaschi',['NumOfStoreHasChi',['../classSVF_1_1MemSSAStat.html#a3bc14307bd0f986cbd8ba5970f1abf0f',1,'SVF::MemSSAStat']]],

package/include/CFL/CFLAlias.h

@@ -38,10 +38,13 @@
 #include "MemoryModel/PointerAnalysis.h"
 #include "Graphs/ConsG.h"
 #include "Util/Options.h"
+#include "CFL/CFLStat.h"
 
 namespace SVF
 {
 
+class CFLStat;
+
 class CFLAlias : public BVDataPTAImpl
 {
 
@@ -138,6 +141,34 @@ public:
     void connectCaller2CalleeParams(CallSite cs, const SVFFunction* F);
 
     void heapAllocatorViaIndCall(CallSite cs);
+
+    /// Get CFL graph
+    CFLGraph* getCFLGraph()
+    {
+        return graph;
+    }
+
+    /// 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;
+    //@}
+
 private:
     CallSite2DummyValPN callsite2DummyValPN;        ///< Map an instruction to a dummy obj which created at an indirect callsite, which invokes a heap allocator
     SVFIR* svfir;

package/include/CFL/CFLGramGraphChecker.h

@@ -26,6 +26,8 @@
  *  Created on: May 23, 2022
  *      Author: Pei Xu
  */
+#ifndef INCLUDE_CFL_CFLGRAMGRAPHCHECKER_H_
+#define INCLUDE_CFL_CFLGRAMGRAPHCHECKER_H_
 
 #include "CFL/CFLGrammar.h"
 #include "Graphs/CFLGraph.h"
@@ -69,3 +71,4 @@ public:
 
 }// SVF
 
+#endif /* INCLUDE_CFL_CFLGRAMGRAPHCHECKER_H_*/

package/include/CFL/CFLGraphBuilder.h

@@ -32,6 +32,8 @@
 
 #include "CFL/CFLGrammar.h"
 #include "Graphs/CFLGraph.h"
+#include "Graphs/SVFG.h"
+
 namespace SVF
 {
 
@@ -166,6 +168,26 @@ private:
     void addBiGepCFLEdge(CFLGraph *cflGraph,  ConstraintNode* src, ConstraintNode* dst, CFLGrammar::Attribute attri);
 };
 
+class VFCFLGraphBuilder : public CFLGraphBuilder
+{
+public:
+    /// Build Bidirectional graph by copying nodes and edges from const graph inherited from GenericGraph
+    CFLGraph* buildBigraph(SVFG *graph, Kind startKind, GrammarBase *grammar);
+
+    /// Build Bidirectional graph by copying nodes and edges from any graph inherited from GenericGraph
+    /// And transfer Load Store to copy edge and address edge to construct PEG style CFG
+    CFLGraph* buildBiPEGgraph(ConstraintGraph *graph, Kind startKind, GrammarBase *grammar, SVFIR* pag);
+
+private:
+    void connectVGep(CFLGraph *cflGraph,  ConstraintGraph *graph, ConstraintNode *src, ConstraintNode *dst, u32_t level, SVFIR* pag);
+
+    /// Handle edge except for the GEP
+    void addBiCFLEdge(CFLGraph *cflGraph,  ConstraintNode* src, ConstraintNode* dst, CFLGrammar::Kind label);
+
+    /// Add Bidirectional GEP edge with attribute
+    void addBiGepCFLEdge(CFLGraph *cflGraph,  ConstraintNode* src, ConstraintNode* dst, CFLGrammar::Attribute attri);
+};
+
 }// SVF
 
 #endif /* INCLUDE_CFL_CFLGRAPHBUILDER_H_*/

package/include/CFL/CFLSolver.h

@@ -27,6 +27,9 @@
  *      Author: Yulei Sui
  */
 
+#ifndef INCLUDE_CFL_CFLSolver_H_
+#define INCLUDE_CFL_CFLSolver_H_
+
 #include "Graphs/CFLGraph.h"
 #include "CFL/CFLGrammar.h"
 #include "Util/WorkList.h"
@@ -99,4 +102,6 @@ private:
 
 };
 
-}
+}
+
+#endif /* INCLUDE_CFL_CFLSolver_H_*/

package/include/CFL/CFLStat.h

@@ -0,0 +1,88 @@
+//===- CFLStat.h -- CFL statistics--------------------------------------------//
+//
+//                     SVF: Static Value-Flow Analysis
+//
+// Copyright (C) <2013-2017>  <Yulei Sui>
+//
+
+// This program is free software: you can redistribute it and/or modify
+// it under the terms of the GNU General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+//===----------------------------------------------------------------------===//
+
+
+/*
+ * CFLStat.h
+ *
+ *  Created on: 17/9/2022
+ *      Author: Pei Xu
+ */
+
+#ifndef CFL_CFLSTAT_H_
+#define CFL_CFLSTAT_H_
+
+#include "Util/PTAStat.h"
+#include "CFL/CFLAlias.h"
+
+namespace SVF
+{
+
+class CFLAlias;
+class SVFIR;
+class ConstraintGraph;
+
+/*!
+ * Statistics of CFL's analysis
+ */
+class CFLStat : public PTAStat
+{
+
+private:
+    CFLAlias* 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;
+
+    CFLStat(CFLAlias* p);
+
+    virtual ~CFLStat()
+    {
+
+    }
+
+    virtual void performStat();
+
+    void collectCycleInfo(ConstraintGraph* consCG);
+
+    void collectCFLInfo(CFLGraph* CFLGraph);
+
+    void statNullPtr();
+
+    void constraintGraphStat();
+};
+
+} // End namespace SVF
+
+#endif /* FLOWSENSITIVESTAT_H_ */

package/include/CFL/CFLVF.h

@@ -0,0 +1,77 @@
+//===----- CFLVF.h -- CFL Value-Flow Client--------------//
+//
+//                     SVF: Static Value-Flow Analysis
+//
+// Copyright (C) <2013->  <Yulei Sui>
+//
+
+// This program is free software: you can redistribute it and/or modify
+// it under the terms of the GNU General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+
+// This program is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this program.  If not, see <http://www.gnu.org/licenses/>.
+//
+//===----------------------------------------------------------------------===//
+
+/*
+ * CFLVF.h
+ *
+ *  Created on: September 5, 2022
+ *      Author: Pei Xu
+ */
+
+#ifndef INCLUDE_CFL_CFLVF_H_
+#define INCLUDE_CFL_CFLVF_H_
+
+#include "CFL/CFLSolver.h"
+#include "CFL/CFGNormalizer.h"
+#include "CFL/GrammarBuilder.h"
+#include "CFL/CFLGraphBuilder.h"
+#include "CFL/CFLGramGraphChecker.h"
+#include "MemoryModel/PointerAnalysis.h"
+#include "Graphs/ConsG.h"
+#include "Util/Options.h"
+#include "SABER/SaberSVFGBuilder.h"
+
+namespace SVF
+{
+
+class CFLVF : public BVDataPTAImpl
+{
+
+public:
+    typedef OrderedMap<CallSite, NodeID> CallSite2DummyValPN;
+
+    CFLVF(SVFIR* ir) : BVDataPTAImpl(ir, PointerAnalysis::CFLFSCS_WPA, false), svfir(ir), graph(nullptr), grammar(nullptr), solver(nullptr)
+    {
+    }
+
+    /// Destructor
+    virtual ~CFLVF()
+    {
+        delete solver;
+    }
+
+    /// Start Analysis here (main part of pointer analysis).
+    virtual void analyze();
+
+private:
+    CallSite2DummyValPN callsite2DummyValPN;        ///< Map an instruction to a dummy obj which created at an indirect callsite, which invokes a heap allocator
+    SVFIR* svfir;
+    CFLGraph* graph;
+    CFLGrammar* grammar;
+    CFLSolver *solver;
+    SaberSVFGBuilder memSSA;
+    SVFG* svfg;
+};
+
+} // End namespace SVF
+
+#endif /* INCLUDE_CFL_CFLVF_H_*/

package/include/CFL/VFG.txt

@@ -0,0 +1,6 @@
+Start:  
+   A
+Terminal:
+   a Call Ret
+Productions:
+   A -> A A | a | Call_i A Ret_i | epsilon;

package/include/Util/Options.h

@@ -254,6 +254,7 @@ public:
     static const llvm::cl::opt<bool> PrintCFL;
     static const llvm::cl::opt<bool> FlexSymMap;
     static const llvm::cl::opt<bool>  PEGTransfer;
+    static const llvm::cl::opt<bool>  CFLSVFG;
 
     // Loop Analysis
     static const llvm::cl::opt<bool> LoopAnalysis;

package/lib/CFL/CFLAlias.cpp

@@ -34,6 +34,25 @@ using namespace SVF;
 using namespace cppUtil;
 using namespace SVFUtil;
 
+u32_t CFLAlias::numOfProcessedAddr = 0;
+u32_t CFLAlias::numOfProcessedCopy = 0;
+u32_t CFLAlias::numOfProcessedGep = 0;
+u32_t CFLAlias::numOfProcessedLoad = 0;
+u32_t CFLAlias::numOfProcessedStore = 0;
+u32_t CFLAlias::numOfSfrs = 0;
+u32_t CFLAlias::numOfFieldExpand = 0;
+
+u32_t CFLAlias::numOfSCCDetection = 0;
+double CFLAlias::timeOfSCCDetection = 0;
+double CFLAlias::timeOfSCCMerges = 0;
+double CFLAlias::timeOfCollapse = 0;
+
+u32_t CFLAlias::AveragePointsToSetSize = 0;
+u32_t CFLAlias::MaxPointsToSetSize = 0;
+double CFLAlias::timeOfProcessCopyGep = 0;
+double CFLAlias::timeOfProcessLoadStore = 0;
+double CFLAlias::timeOfUpdateCallGraph = 0;
+
 /*!
  * On the fly call graph construction
  * callsites is candidate indirect callsites need to be analyzed based on points-to results
@@ -197,6 +216,7 @@ bool CFLAlias::updateCallGraph(const CallSiteToFunPtrMap& callsites)
 
 void CFLAlias::analyze()
 {
+    stat = new CFLStat(this);
     GrammarBuilder grammarBuilder = GrammarBuilder(Options::GrammarFilename);
     CFGNormalizer normalizer = CFGNormalizer();
     AliasCFLGraphBuilder cflGraphBuilder = AliasCFLGraphBuilder();

package/lib/CFL/CFLGraphBuilder.cpp

@@ -401,4 +401,75 @@ void AliasCFLGraphBuilder::addBiGepCFLEdge(CFLGraph *cflGraph,  ConstraintNode*
     cflGraph->addCFLEdge(cflGraph->getGNode(dst->getId()), cflGraph->getGNode(src->getId()), CFLGrammar::getAttributedKind(attri, label2KindMap[key]));
     return;
 }
+
+CFLGraph* VFCFLGraphBuilder::buildBigraph(SVFG *graph, Kind startKind, GrammarBase *grammar)
+{
+    CFLGraph *cflGraph = new CFLGraph(startKind);
+    externMap = true;
+    for(auto pairV : grammar->getTerminals())
+    {
+        if(label2KindMap.find(pairV.first) == label2KindMap.end())
+        {
+            label2KindMap.insert(pairV);
+        }
+        if(kind2LabelMap.find(pairV.second) == kind2LabelMap.end())
+        {
+            kind2LabelMap.insert(make_pair(pairV.second, pairV.first));
+        }
+    }
+    for(auto pairV : grammar->getNonterminals())
+    {
+        if(label2KindMap.find(pairV.first) == label2KindMap.end())
+        {
+            label2KindMap.insert(pairV);
+        }
+        if(kind2LabelMap.find(pairV.second) == kind2LabelMap.end())
+        {
+            kind2LabelMap.insert(make_pair(pairV.second, pairV.first));
+        }
+    }
+    for(auto it = graph->begin(); it!= graph->end(); it++)
+    {
+        CFLNode* node = new CFLNode((*it).first);
+        cflGraph->addCFLNode((*it).first, node);
+    }
+    // for(auto it = graph->begin(); it!= graph->end(); it++)
+    // {
+    //     ConstraintNode* node = (*it).second;
+    //     for(ConstraintEdge* edge : node->getOutEdges())
+    //     {
+    //         CFLGrammar::Kind edgeLabel = edge->getEdgeKind();
+    //         // Need to get the offset from the Const Edge
+    //         // The offset present edge is only from Normal Gep CG at moment
+    //         if(NormalGepCGEdge::classof(edge))
+    //         {
+    //             NormalGepCGEdge *nGepEdge = SVFUtil::dyn_cast<NormalGepCGEdge>(edge);
+    //             CFLGrammar::Attribute attr =  nGepEdge->getConstantFieldIdx();
+    //             addAttribute(edgeLabel, attr);
+    //             edgeLabel = CFLGrammar::getAttributedKind(attr, edgeLabel);
+    //             cflGraph->addCFLEdge(cflGraph->getGNode(edge->getSrcID()), cflGraph->getGNode(edge->getDstID()), edgeLabel);
+    //             std::string key = kind2LabelMap[edge->getEdgeKind()];
+    //             key.append("bar");   // for example Gep_i should be Gepbar_i, not Gep_ibar
+    //             cflGraph->addCFLEdge(cflGraph->getGNode(edge->getDstID()), cflGraph->getGNode(edge->getSrcID()), CFLGrammar::getAttributedKind(attr, label2KindMap[key]));
+    //             addAttribute(label2KindMap[key], attr);
+    //         }
+    //         else
+    //         {
+    //             cflGraph->addCFLEdge(cflGraph->getGNode(edge->getSrcID()), cflGraph->getGNode(edge->getDstID()), edgeLabel);
+    //             std::string key = kind2LabelMap[edge->getEdgeKind()];
+    //             key.append("bar");
+    //             cflGraph->addCFLEdge(cflGraph->getGNode(edge->getDstID()), cflGraph->getGNode(edge->getSrcID()), label2KindMap[key]);
+    //         }
+    //     }
+    // }
+    return cflGraph;
+}
+
+CFLGraph* VFCFLGraphBuilder::buildBiPEGgraph(ConstraintGraph *graph, Kind startKind, GrammarBase *grammar, SVFIR* pag)
+{
+    CFLGraph *cflGraph = new CFLGraph(startKind);
+    return cflGraph;
+}
+
+
 } // end of SVF namespace