svf-lib 1.0.733 → 1.0.737

package/SVF-linux/include/Graphs/ICFGNode.h

@@ -41,8 +41,8 @@ class ICFGNode;
 class RetBlockNode;
 class CallPE;
 class RetPE;
-class PAGEdge;
-class PAGNode;
+class SVFStmt;
+class SVFVar;
 class VFGNode;
 
 /*!
@@ -67,7 +67,7 @@ public:
     typedef Set<const CallPE *> CallPESet;
     typedef Set<const RetPE *> RetPESet;
     typedef std::list<const VFGNode*> VFGNodeList;
-    typedef std::list<const PAGEdge*> PAGEdgeList;
+    typedef std::list<const SVFStmt*> PAGEdgeList;
 
 public:
     /// Constructor
@@ -113,7 +113,7 @@ public:
 
     /// Set/Get methods of VFGNodes
     ///@{
-    inline void addPAGEdge(const PAGEdge *edge)
+    inline void addPAGEdge(const SVFStmt *edge)
     {
         pagEdges.push_back(edge);
     }
@@ -252,7 +252,7 @@ class FunEntryBlockNode : public InterBlockNode
 {
 
 public:
-    typedef std::vector<const PAGNode *> FormalParmNodeVec;
+    typedef std::vector<const SVFVar *> FormalParmNodeVec;
 private:
     FormalParmNodeVec FPNodes;
 public:
@@ -271,7 +271,7 @@ public:
     }
 
     /// Add formal parameters
-    inline void addFormalParms(const PAGNode *fp)
+    inline void addFormalParms(const SVFVar *fp)
     {
         FPNodes.push_back(fp);
     }
@@ -310,7 +310,7 @@ class FunExitBlockNode : public InterBlockNode
 
 private:
     const SVFFunction* fun;
-    const PAGNode *formalRet;
+    const SVFVar *formalRet;
 public:
     FunExitBlockNode(NodeID id, const SVFFunction* f);
 
@@ -321,13 +321,13 @@ public:
     }
 
     /// Return actual return parameter
-    inline const PAGNode *getFormalRet() const
+    inline const SVFVar *getFormalRet() const
     {
         return formalRet;
     }
 
     /// Add actual return parameter
-    inline void addFormalRet(const PAGNode *fr)
+    inline void addFormalRet(const SVFVar *fr)
     {
         formalRet = fr;
     }
@@ -365,7 +365,7 @@ class CallBlockNode : public InterBlockNode
 {
 
 public:
-    typedef std::vector<const PAGNode *> ActualParmVFGNodeVec;
+    typedef std::vector<const SVFVar *> ActualParmVFGNodeVec;
 private:
     const Instruction* cs;
     const RetBlockNode* ret;
@@ -421,7 +421,7 @@ public:
     }
 
     /// Add actual parameters
-    inline void addActualParms(const PAGNode *ap)
+    inline void addActualParms(const SVFVar *ap)
     {
         APNodes.push_back(ap);
     }
@@ -461,7 +461,7 @@ class RetBlockNode : public InterBlockNode
 
 private:
     const Instruction* cs;
-    const PAGNode *actualRet;
+    const SVFVar *actualRet;
     const CallBlockNode* callBlockNode;
 public:
     RetBlockNode(NodeID id, const Instruction* c, CallBlockNode* cb) :
@@ -482,13 +482,13 @@ public:
         return callBlockNode;
     }
     /// Return actual return parameter
-    inline const PAGNode *getActualRet() const
+    inline const SVFVar *getActualRet() const
     {
         return actualRet;
     }
 
     /// Add actual return parameter
-    inline void addActualRet(const PAGNode *ar)
+    inline void addActualRet(const SVFVar *ar)
     {
         actualRet = ar;
     }

package/SVF-linux/include/Graphs/IRGraph.h

@@ -0,0 +1,236 @@
+//===- SVFIR.h -- SVF IR Graph or PAG (Program Assignment Graph)--------------------------------------//
+//
+//                     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/>.
+//
+//===----------------------------------------------------------------------===//
+
+/*
+ * IRGraph.h 
+ *
+ *  Created on: Nov 1, 2013
+ *      Author: Yulei Sui
+ */
+
+
+#ifndef IRGRAPH_H_
+#define IRGRAPH_H_
+
+#include "MemoryModel/SVFStatements.h"
+#include "MemoryModel/SVFVariables.h"
+#include "Util/NodeIDAllocator.h"
+#include "Util/SVFUtil.h"
+#include "Graphs/ICFG.h"
+
+namespace SVF
+{
+typedef SVFVar PAGNode;
+typedef SVFStmt PAGEdge;
+
+/*
+* Graph representation of SVF IR. It can be seen as a program assignment graph (PAG)
+*/
+class IRGraph : public GenericGraph<SVFVar,SVFStmt>
+{
+public:
+    typedef Set<const SVFStmt*> PAGEdgeSet;
+    typedef Map<const Value*,PAGEdgeSet> ValueToEdgeMap;
+
+protected:
+    SVFStmt::PAGKindToEdgeSetMapTy PAGEdgeKindToSetMap;  // < SVFIR edge map containing all PAGEdges
+    SVFStmt::PAGKindToEdgeSetMapTy PTAPAGEdgeKindToSetMap;  // < SVFIR edge map containing only pointer-related edges, i.e, both RHS and RHS are of pointer type
+    bool fromFile; ///< Whether the SVFIR is built according to user specified data from a txt file
+    NodeID nodeNumAfterPAGBuild; // initial node number after building SVFIR, excluding later added nodes, e.g., gepobj nodes
+    u32_t totalPTAPAGEdge;
+    ValueToEdgeMap valueToEdgeMap;	///< Map llvm::Values to all corresponding PAGEdges
+    SymbolTableInfo* symInfo;
+
+    /// Add a node into the graph
+    inline NodeID addNode(SVFVar* node, NodeID i)
+    {
+        addGNode(i,node);
+        return i;
+    }
+    /// Add an edge into the graph
+    bool addEdge(SVFVar* src, SVFVar* dst, SVFStmt* edge);
+
+    //// Return true if this edge exits
+    SVFStmt* hasNonlabeledEdge(SVFVar* src, SVFVar* dst, SVFStmt::PEDGEK kind);
+    /// Return true if this labeled edge exits, including store, call and load
+    /// two store edge can have same dst and src but located in different basic blocks, thus flags are needed to distinguish them
+    SVFStmt* hasLabeledEdge(SVFVar* src, SVFVar* dst, SVFStmt::PEDGEK kind, const ICFGNode* cs);
+    /// Return MultiOpndStmt since it has more than one operands (we use operand 2 here to make the flag)
+    SVFStmt* hasLabeledEdge(SVFVar* src, SVFVar* op1, SVFStmt::PEDGEK kind, const SVFVar* op2);
+
+    /// Map a value to a set of edges
+    inline void mapValueToEdge(const Value *V, SVFStmt *edge)
+    {
+        auto inserted = valueToEdgeMap.emplace(V, PAGEdgeSet{edge});
+        if (!inserted.second) {
+            inserted.first->second.emplace(edge);
+        }
+    }
+    /// get MemObj according to LLVM value
+    inline const MemObj* getMemObj(const Value* val) const{
+        return symInfo->getObj(symInfo->getObjSym(val));
+    }
+    
+public:
+    IRGraph(bool buildFromFile): fromFile(buildFromFile), nodeNumAfterPAGBuild(0), totalPTAPAGEdge(0){
+        symInfo = SymbolTableInfo::SymbolInfo();
+        // insert dummy value if a correct value cannot be found
+        valueToEdgeMap[nullptr] = PAGEdgeSet();
+    }
+
+    virtual ~IRGraph();
+
+    /// Whether this SVFIR built from a txt file
+    inline bool isBuiltFromFile()
+    {
+        return fromFile;
+    }
+    /// Get all SVFIR Edges that corresponds to an LLVM value
+    inline const PAGEdgeSet& getValueEdges(const Value *V)
+    {
+        auto it = valueToEdgeMap.find(V);
+        if (it == valueToEdgeMap.end()) {
+            //special empty set
+            return valueToEdgeMap.at(nullptr);
+        }
+        return it->second;
+    }
+
+    /// Get SVFIR Node according to LLVM value
+    ///getNode - Return the node corresponding to the specified pointer.
+    inline NodeID getValueNode(const Value *V)
+    {
+        return symInfo->getValSym(V);
+    }
+    inline bool hasValueNode(const Value* V)
+    {
+        return symInfo->hasValSym(V);
+    }
+    /// getObject - Return the obj node id refer to the memory object for the
+    /// specified global, heap or alloca instruction according to llvm value.
+    inline NodeID getObjectNode(const Value *V)
+    {
+        return symInfo->getObjSym(V);
+    }
+    /// GetReturnNode - Return the unique node representing the return value of a function
+    inline NodeID getReturnNode(const SVFFunction* func) const
+    {
+        return symInfo->getRetSym(func->getLLVMFun());
+    }
+    /// getVarargNode - Return the unique node representing the variadic argument of a variadic function.
+    inline NodeID getVarargNode(const SVFFunction* func) const
+    {
+        return symInfo->getVarargSym(func->getLLVMFun());
+    }
+    inline NodeID getBlackHoleNode() const
+    {
+        return symInfo->blackholeSymID();
+    }
+    inline NodeID getConstantNode() const
+    {
+        return symInfo->constantSymID();
+    }
+    inline NodeID getBlkPtr() const
+    {
+        return symInfo->blkPtrSymID();
+    }
+    inline NodeID getNullPtr() const
+    {
+        return symInfo->nullPtrSymID();
+    }
+    inline const MemObj* getBlackHoleObj() const
+    {
+        return symInfo->getBlkObj();
+    }
+    inline const MemObj* getConstantObj() const
+    {
+        return symInfo->getConstantObj();
+    }
+
+    inline Size_t getValueNodeNum() const
+    {
+        return symInfo->valSyms().size();
+    }
+    inline Size_t getObjectNodeNum() const
+    {
+        return symInfo->idToObjMap().size();
+    }
+    inline u32_t getNodeNumAfterPAGBuild() const
+    {
+        return nodeNumAfterPAGBuild;
+    }
+    inline void setNodeNumAfterPAGBuild(u32_t num)
+    {
+        nodeNumAfterPAGBuild = num;
+    }
+
+    inline Size_t getPAGNodeNum() const
+    {
+        return nodeNum;
+    }
+    inline Size_t getPAGEdgeNum() const
+    {
+        return edgeNum;
+    }
+    inline Size_t getPTAPAGEdgeNum() const
+    {
+        return totalPTAPAGEdge;
+    }
+    /// Return graph name
+    inline std::string getGraphName() const
+    {
+        return "SVFIR";
+    }
+
+    /// Dump SVFIR
+    void dump(std::string name);
+
+    /// View graph from the debugger
+    void view();
+};
+
+}
+
+
+namespace llvm
+{
+
+/* !
+ * GraphTraits specializations of SVFIR to be used for the generic graph algorithms.
+ * Provide graph traits for tranversing from a SVFIR node using standard graph traversals.
+ */
+template<> struct GraphTraits<SVF::SVFVar*> : public GraphTraits<SVF::GenericNode<SVF::SVFVar,SVF::SVFStmt>*  >
+{
+};
+
+/// Inverse GraphTraits specializations for SVFIR node, it is used for inverse traversal.
+template<> struct GraphTraits<Inverse<SVF::SVFVar *> > : public GraphTraits<Inverse<SVF::GenericNode<SVF::SVFVar,SVF::SVFStmt>* > >
+{
+};
+
+template<> struct GraphTraits<SVF::IRGraph*> : public GraphTraits<SVF::GenericGraph<SVF::SVFVar,SVF::SVFStmt>* >
+{
+    typedef SVF::SVFVar *NodeRef;
+};
+
+} // End namespace llvm
+#endif /* IRGRAPH_H_ */

package/SVF-linux/include/Graphs/OfflineConsG.h

@@ -55,7 +55,7 @@ protected:
     NodeToRepMap norToRepMap;   // for each *a construct a --> rep, i.e., mapping a node of to a rep node for online constraint solving
 
 public:
-    OfflineConsG(PAG *p) : ConstraintGraph(p),
+    OfflineConsG(SVFIR *p) : ConstraintGraph(p),
         nodeToRefMap( {}), norToRepMap({})
     {
         buildOfflineCG();

package/SVF-linux/include/Graphs/SVFG.h

@@ -369,7 +369,7 @@ protected:
         }
         else
         {
-            assert((it->second == node->getId()) && "a PAG node can only have unique definition ");
+            assert((it->second == node->getId()) && "a SVFIR node can only have unique definition ");
         }
     }
     inline NodeID getDef(const MRVer* mvar) const

package/SVF-linux/include/Graphs/SVFGOPT.h

@@ -259,7 +259,7 @@ private:
     inline void resetDef(const PAGNode* pagNode, const SVFGNode* node)
     {
         PAGNodeToDefMapTy::iterator it = PAGNodeToDefMap.find(pagNode);
-        assert(it != PAGNodeToDefMap.end() && "a PAG node doesn't have definition before");
+        assert(it != PAGNodeToDefMap.end() && "a SVFIR node doesn't have definition before");
         PAGNodeToDefMap[pagNode] = node->getId();
     }
 
@@ -290,11 +290,11 @@ private:
     //@{
     inline bool actualInOfIndCS(const ActualINSVFGNode* ai) const
     {
-        return (PAG::getPAG()->isIndirectCallSites(ai->getCallSite()));
+        return (SVFIR::getPAG()->isIndirectCallSites(ai->getCallSite()));
     }
     inline bool actualOutOfIndCS(const ActualOUTSVFGNode* ao) const
     {
-        return (PAG::getPAG()->isIndirectCallSites(ao->getCallSite()));
+        return (SVFIR::getPAG()->isIndirectCallSites(ao->getCallSite()));
     }
     //@}
 

package/SVF-linux/include/Graphs/VFG.h

@@ -31,7 +31,7 @@
 #define INCLUDE_UTIL_VFG_H_
 
 
-#include "Graphs/PAG.h"
+#include "MemoryModel/SVFIR.h"
 #include "Graphs/PTACallGraph.h"
 #include "Graphs/VFGNode.h"
 #include "Graphs/VFGEdge.h"
@@ -68,6 +68,7 @@ public:
     typedef Map<const PAGNode*, IntraPHIVFGNode*> PAGNodeToPHIVFGNodeMapTy;
     typedef Map<const PAGNode*, BinaryOPVFGNode*> PAGNodeToBinaryOPVFGNodeMapTy;
     typedef Map<const PAGNode*, UnaryOPVFGNode*> PAGNodeToUnaryOPVFGNodeMapTy;
+    typedef Map<const PAGNode*, BranchVFGNode*> PAGNodeToBranchVFGNodeMapTy;
     typedef Map<const PAGNode*, CmpVFGNode*> PAGNodeToCmpVFGNodeMapTy;
     typedef Map<const SVFFunction*, VFGNodeSet > FunToVFGNodesMapTy;
 
@@ -78,7 +79,7 @@ public:
     typedef VFGEdge::VFGEdgeSetTy::iterator VFGNodeIter;
     typedef VFGNodeIDToNodeMapTy::iterator iterator;
     typedef VFGNodeIDToNodeMapTy::const_iterator const_iterator;
-    typedef PAG::PAGEdgeSet PAGEdgeSet;
+    typedef SVFIR::PAGEdgeSet PAGEdgeSet;
     typedef Set<const VFGNode*> GlobalVFGNodeSet;
     typedef Set<const PAGNode*> PAGNodeSet;
 
@@ -93,13 +94,14 @@ protected:
     PAGNodeToPHIVFGNodeMapTy PAGNodeToIntraPHIVFGNodeMap;	///< map a PAGNode to its PHIVFGNode
     PAGNodeToBinaryOPVFGNodeMapTy PAGNodeToBinaryOPVFGNodeMap;	///< map a PAGNode to its BinaryOPVFGNode
     PAGNodeToUnaryOPVFGNodeMapTy PAGNodeToUnaryOPVFGNodeMap;	///< map a PAGNode to its UnaryOPVFGNode
+    PAGNodeToBranchVFGNodeMapTy PAGNodeToBranchVFGNodeMap;	///< map a PAGNode to its BranchVFGNode
     PAGNodeToCmpVFGNodeMapTy PAGNodeToCmpVFGNodeMap;	///< map a PAGNode to its CmpVFGNode
     PAGEdgeToStmtVFGNodeMapTy PAGEdgeToStmtVFGNodeMap;	///< map a PAGEdge to its StmtVFGNode
     FunToVFGNodesMapTy funToVFGNodesMap; ///< map a function to its VFGNodes;
 
     GlobalVFGNodeSet globalVFGNodes;	///< set of global store VFG nodes
     PTACallGraph* callgraph;
-    PAG* pag;
+    SVFIR* pag;
     VFGK kind;
 
     /// Clean up memory
@@ -127,8 +129,8 @@ public:
         return (kind == PTRONLYSVFG) || (kind == PTRONLYSVFG_OPT);
     }
 
-    /// Return PAG
-    inline PAG* getPAG() const
+    /// Return SVFIR
+    inline SVFIR* getPAG() const
     {
         return pag;
     }
@@ -218,6 +220,12 @@ public:
         assert(it != PAGNodeToUnaryOPVFGNodeMap.end() && "UnaryOPVFGNode can not be found??");
         return it->second;
     }
+    inline BranchVFGNode* getBranchVFGNode(const PAGNode* pagNode) const
+    {
+        PAGNodeToBranchVFGNodeMapTy::const_iterator it = PAGNodeToBranchVFGNodeMap.find(pagNode);
+        assert(it != PAGNodeToBranchVFGNodeMap.end() && "BranchVFGNode can not be found??");
+        return it->second;
+    }
     inline CmpVFGNode* getCmpVFGNode(const PAGNode* pagNode) const
     {
         PAGNodeToCmpVFGNodeMapTy::const_iterator it = PAGNodeToCmpVFGNodeMap.find(pagNode);
@@ -261,12 +269,12 @@ public:
             const VFGNode* defNode = getVFGNode(getDef(pagNode));
             if (const AddrVFGNode* addr = SVFUtil::dyn_cast<AddrVFGNode>(defNode))
             {
-                if (PAG::getPAG()->isBlkObjOrConstantObj(addr->getPAGEdge()->getSrcID()))
+                if (SVFIR::getPAG()->isBlkObjOrConstantObj(addr->getPAGEdge()->getSrcID()))
                     return true;
             }
             else if(const CopyVFGNode* copy = SVFUtil::dyn_cast<CopyVFGNode>(defNode))
             {
-                if (PAG::getPAG()->isNullPtr(copy->getPAGEdge()->getSrcID()))
+                if (SVFIR::getPAG()->isNullPtr(copy->getPAGEdge()->getSrcID()))
                     return true;
             }
         }
@@ -400,13 +408,13 @@ protected:
         }
         else
         {
-            assert((it->second == node->getId()) && "a PAG node can only have unique definition ");
+            assert((it->second == node->getId()) && "a SVFIR node can only have unique definition ");
         }
     }
     inline NodeID getDef(const PAGNode* pagNode) const
     {
         PAGNodeToDefMapTy::const_iterator it = PAGNodeToDefMap.find(pagNode);
-        assert(it!=PAGNodeToDefMap.end() && "PAG node does not have a definition??");
+        assert(it!=PAGNodeToDefMap.end() && "SVFIR node does not have a definition??");
         return it->second;
     }
     inline bool hasDef(const PAGNode* pagNode) const
@@ -503,7 +511,7 @@ protected:
         setDef(load->getDstNode(),sNode);
     }
     /// Add a Store VFG node,
-    /// To be noted store does not create a new pointer, we do not set def for any PAG node
+    /// To be noted store does not create a new pointer, we do not set def for any SVFIR node
     void addStoreVFGNode(const StorePE* store)
     {
         StoreVFGNode* sNode = new StoreVFGNode(totalVFGNode++,store);
@@ -545,7 +553,7 @@ protected:
 		PAGNodeToFormalRetMap[uniqueFunRet] = sNode;
 		/// if this uniqueFunRet is a phi node, which means it will receive values from multiple return instructions of fun
 		/// we will set this phi node's def later
-		/// Ideally, every function uniqueFunRet should be a PhiNode (PAGBuilder.cpp), unless it does not have ret instruction
+		/// Ideally, every function uniqueFunRet should be a PhiNode (SVFIRBuilder.cpp), unless it does not have ret instruction
 		if (!pag->isPhiNode(uniqueFunRet)){
 			std::string warn = fun->getName().str();
 			SVFUtil::writeWrnMsg(warn + " does not have any ret instruction!");
@@ -561,70 +569,63 @@ protected:
         PAGNodeToActualRetMap[ret] = sNode;
     }
     /// Add an llvm PHI VFG node
-    inline void addIntraPHIVFGNode(const PAGNode* phiResNode, PAG::CopyPEList& oplist)
+    inline void addIntraPHIVFGNode(const PhiPE* edge)
     {
-        IntraPHIVFGNode* sNode = new IntraPHIVFGNode(totalVFGNode++,phiResNode);
+        IntraPHIVFGNode* sNode = new IntraPHIVFGNode(totalVFGNode++,edge->getRes());
         u32_t pos = 0;
-        const PAGEdge* edge = nullptr;
-        for(PAG::CopyPEList::const_iterator it = oplist.begin(), eit=oplist.end(); it!=eit; ++it,++pos)
+        for(auto var : edge->getOpndVars())
         {
-            edge = *it;
-            sNode->setOpVerAndBB(pos, edge->getSrcNode(), edge->getICFGNode());
+            sNode->setOpVerAndBB(pos, var, edge->getICFGNode());
+            pos++;
         }
-        assert(edge && "edge not found?");
         addVFGNode(sNode,edge->getICFGNode());
-        setDef(phiResNode,sNode);
-        PAGNodeToIntraPHIVFGNodeMap[phiResNode] = sNode;
+        setDef(edge->getRes(),sNode);
+        PAGNodeToIntraPHIVFGNodeMap[edge->getRes()] = sNode;
     }
     /// Add a Compare VFG node
-    inline void addCmpVFGNode(const PAGNode* resNode, PAG::CmpPEList& oplist)
+    inline void addCmpVFGNode(const CmpPE* edge)
     {
-        CmpVFGNode* sNode = new CmpVFGNode(totalVFGNode++, resNode);
+        CmpVFGNode* sNode = new CmpVFGNode(totalVFGNode++, edge->getRes());
         u32_t pos = 0;
-        const PAGEdge* edge = nullptr;
-        for(PAG::CmpPEList::const_iterator it = oplist.begin(), eit=oplist.end(); it!=eit; ++it,++pos)
+        for(auto var : edge->getOpndVars())
         {
-            edge = *it;
-            sNode->setOpVer(pos, edge->getSrcNode());
+            sNode->setOpVer(pos, var);
+            pos++;
         }
-        assert(edge && "edge not found?");
         addVFGNode(sNode,edge->getICFGNode());
-        setDef(resNode,sNode);
-        PAGNodeToCmpVFGNodeMap[resNode] = sNode;
+        setDef(edge->getRes(),sNode);
+        PAGNodeToCmpVFGNodeMap[edge->getRes()] = sNode;
     }
     /// Add a BinaryOperator VFG node
-    inline void addBinaryOPVFGNode(const PAGNode* resNode, PAG::BinaryOPList& oplist)
+    inline void addBinaryOPVFGNode(const BinaryOPPE* edge)
     {
-        BinaryOPVFGNode* sNode = new BinaryOPVFGNode(totalVFGNode++, resNode);
+        BinaryOPVFGNode* sNode = new BinaryOPVFGNode(totalVFGNode++, edge->getRes());
         u32_t pos = 0;
-        const PAGEdge* edge = nullptr;
-        for(PAG::BinaryOPList::const_iterator it = oplist.begin(), eit=oplist.end(); it!=eit; ++it,++pos)
+        for(auto var : edge->getOpndVars())
         {
-            edge = *it;
-            sNode->setOpVer(pos, (*it)->getSrcNode());
+            sNode->setOpVer(pos, var);
+            pos++;
         }
-
-        assert(edge && "edge not found?");
         addVFGNode(sNode,edge->getICFGNode());
-        setDef(resNode,sNode);
-        PAGNodeToBinaryOPVFGNodeMap[resNode] = sNode;
+        setDef(edge->getRes(),sNode);
+        PAGNodeToBinaryOPVFGNodeMap[edge->getRes()] = sNode;
     }
     /// Add a UnaryOperator VFG node
-    inline void addUnaryOPVFGNode(const PAGNode* resNode, PAG::UnaryOPList& oplist)
+    inline void addUnaryOPVFGNode(const UnaryOPPE* edge)
     {
-        UnaryOPVFGNode* sNode = new UnaryOPVFGNode(totalVFGNode++, resNode);
-        u32_t pos = 0;
-        const PAGEdge* edge = nullptr;
-        for(PAG::UnaryOPList::const_iterator it = oplist.begin(), eit=oplist.end(); it!=eit; ++it,++pos)
-        {
-            edge = *it;
-            sNode->setOpVer(pos, (*it)->getSrcNode());
-        }
-
-        assert(edge && "edge not found?");
+        UnaryOPVFGNode* sNode = new UnaryOPVFGNode(totalVFGNode++, edge->getRes());
+        sNode->setOpVer(0, edge->getOpVar());
+        addVFGNode(sNode,edge->getICFGNode());
+        setDef(edge->getRes(),sNode);
+        PAGNodeToUnaryOPVFGNodeMap[edge->getRes()] = sNode;
+    }
+    /// Add a BranchVFGNode 
+    inline void addBranchVFGNode(const BranchStmt* edge)
+    {
+        BranchVFGNode* sNode = new BranchVFGNode(totalVFGNode++, edge);
         addVFGNode(sNode,edge->getICFGNode());
-        setDef(resNode,sNode);
-        PAGNodeToUnaryOPVFGNodeMap[resNode] = sNode;
+        setDef(edge->getBranchInst(),sNode);
+        PAGNodeToBranchVFGNodeMap[edge->getBranchInst()] = sNode;
     }
 };