SVF::CDG Class Reference

#include <CDG.h>

Inheritance diagram for SVF::CDG:

Public Types
typedef Map< NodeID, CDGNode * >	CDGNodeIDToNodeMapTy
typedef CDGEdge::CDGEdgeSetTy	CDGEdgeSetTy
typedef CDGNodeIDToNodeMapTy::iterator	iterator
typedef CDGNodeIDToNodeMapTy::const_iterator	const_iterator
typedef std::vector< const ICFGNode * >	ICFGNodeVector
typedef std::vector< std::pair< const ICFGNode *, const ICFGNode * > >	ICFGNodePairVector
Public Types inherited from SVF::GenericGraph< NodeTy, EdgeTy >
typedef NodeTy	NodeType
typedef EdgeTy	EdgeType
typedef OrderedMap< NodeID, NodeType * >	IDToNodeMapTy
	NodeID to GenericNode map.
typedef IDToNodeMapTy::iterator	iterator
	Node Iterators.
typedef IDToNodeMapTy::const_iterator	const_iterator

Public Member Functions
virtual	~CDG ()
	Destructor.
CDGNode *	getCDGNode (NodeID id) const
	Get a CDG node.
bool	hasCDGNode (NodeID id) const
	Whether has the CDGNode.
bool	hasCDGEdge (CDGNode *src, CDGNode *dst)
	Whether we has a CDG edge.
CDGEdge *	getCDGEdge (const CDGNode *src, const CDGNode *dst)
	Get a control dependence edge according to src and dst.
void	view ()
	View graph from the debugger.
void	dump (const std::string &filename)
	Dump graph into dot file.
void	removeCDGEdge (CDGEdge *edge)
	Remove a control dependence edge.
void	removeCDGNode (CDGNode *node)
	Remove a CDGNode.
bool	removeCDGNode (NodeID id)
	Remove node from nodeID.
bool	addCDGEdge (CDGEdge *edge)
	Add CDG edge.
virtual void	addCDGNode (CDGNode *node)
	Add a CDG node.
void	addCDGNodesFromVector (ICFGNodeVector nodes)
	Add CDG nodes from nodeid vector.
void	addCDGEdgeFromSrcDst (const ICFGNode *src, const ICFGNode *dst, const SVFVar *pNode, s32_t branchID)
	Add CDG edges from nodeid pair.
Public Member Functions inherited from SVF::GenericGraph< NodeTy, EdgeTy >
	GenericGraph ()
	Constructor.
virtual	~GenericGraph ()
	Destructor.
void	destroy ()
	Release memory.
iterator	begin ()
	Iterators.
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
void	addGNode (NodeID id, NodeType *node)
	Add a Node.
NodeType *	getGNode (NodeID id) const
	Get a node.
bool	hasGNode (NodeID id) const
	Has a node.
void	removeGNode (NodeType *node)
	Delete a node.
u32_t	getTotalNodeNum () const
	Get total number of node/edge.
u32_t	getTotalEdgeNum () const
void	incNodeNum ()
	Increase number of node/edge.
void	incEdgeNum ()

Static Public Member Functions
static CDG *	getCDG ()
	Singleton design here to make sure we only have one instance during any analysis.
static void	releaseCDG ()

Private Member Functions
	CDG ()
	Constructor.

Static Private Attributes
static CDG *	controlDg = nullptr

Additional Inherited Members
Public Attributes inherited from SVF::GenericGraph< NodeTy, EdgeTy >
u32_t	edgeNum
	total num of node
u32_t	nodeNum
	total num of edge
Protected Attributes inherited from SVF::GenericGraph< NodeTy, EdgeTy >
IDToNodeMapTy	IDToNodeMap
	node map

Detailed Description

Definition at line 142 of file CDG.h.

Member Typedef Documentation

CDGEdgeSetTy

typedef CDGEdge::CDGEdgeSetTy SVF::CDG::CDGEdgeSetTy

Definition at line 148 of file CDG.h.

CDGNodeIDToNodeMapTy

typedef Map<NodeID, CDGNode *> SVF::CDG::CDGNodeIDToNodeMapTy

Definition at line 147 of file CDG.h.

const_iterator

typedef CDGNodeIDToNodeMapTy::const_iterator SVF::CDG::const_iterator

Definition at line 150 of file CDG.h.

ICFGNodePairVector

typedef std::vector<std::pair<const ICFGNode *, const ICFGNode *> > SVF::CDG::ICFGNodePairVector

Definition at line 152 of file CDG.h.

ICFGNodeVector

typedef std::vector<const ICFGNode *> SVF::CDG::ICFGNodeVector

Definition at line 151 of file CDG.h.

iterator

typedef CDGNodeIDToNodeMapTy::iterator SVF::CDG::iterator

Definition at line 149 of file CDG.h.

Constructor & Destructor Documentation

CDG()

SVF::CDG::CDG ( )

inlineprivate

Constructor.

Definition at line 157 of file CDG.h.

    {
 
    }

~CDG()

virtual SVF::CDG::~CDG ( )

inlinevirtual

Destructor.

Definition at line 184 of file CDG.h.

{}

Member Function Documentation

addCDGEdge()

bool SVF::CDG::addCDGEdge ( CDGEdge *  edge )

inline

Add CDG edge.

Definition at line 281 of file CDG.h.

    {
        bool added1 = edge->getDstNode()->addIncomingEdge(edge);
        bool added2 = edge->getSrcNode()->addOutgoingEdge(edge);
        assert(added1 && added2 && "edge not added??");
        return added1 && added2;
    }

addCDGEdgeFromSrcDst()

void CDG::addCDGEdgeFromSrcDst	(	const ICFGNode *	src,
		const ICFGNode *	dst,
		const SVFVar *	pNode,
		s32_t	branchID
	)

Add CDG edges from nodeid pair.

Definition at line 35 of file CDG.cpp.

{
    if (!hasCDGNode(src->getId()))
    {
        addGNode(src->getId(), new CDGNode(src));
    }
    if (!hasCDGNode(dst->getId()))
    {
        addGNode(dst->getId(), new CDGNode(dst));
    }
    if (!hasCDGEdge(getCDGNode(src->getId()), getCDGNode(dst->getId())))
    {
        CDGEdge *pEdge = new CDGEdge(getCDGNode(src->getId()),
                                     getCDGNode(dst->getId()));
        pEdge->insertBranchCondition(pNode, branchID);
        addCDGEdge(pEdge);
        incEdgeNum();
    }
    else
    {
        CDGEdge *pEdge = getCDGEdge(getCDGNode(src->getId()),
                                    getCDGNode(dst->getId()));
        pEdge->insertBranchCondition(pNode, branchID);
    }
}

addCDGNode()

virtual void SVF::CDG::addCDGNode ( CDGNode *  node )

inlinevirtual

Add a CDG node.

Definition at line 290 of file CDG.h.

    {
        addGNode(node->getId(), node);
    }

addCDGNodesFromVector()

void SVF::CDG::addCDGNodesFromVector ( ICFGNodeVector  nodes )

inline

Add CDG nodes from nodeid vector.

Definition at line 296 of file CDG.h.

    {
        for (const ICFGNode *icfgNode: nodes)
        {
            if (!IDToNodeMap.count(icfgNode->getId()))
            {
                addGNode(icfgNode->getId(), new CDGNode(icfgNode));
            }
        }
    }

dump()

void SVF::CDG::dump ( const std::string &  filename )

inline

Dump graph into dot file.

Definition at line 240 of file CDG.h.

    {
        GraphPrinter::WriteGraphToFile(SVFUtil::outs(), filename, this);
    }

getCDG()

static CDG * SVF::CDG::getCDG ( )

inlinestatic

Singleton design here to make sure we only have one instance during any analysis.

Definition at line 166 of file CDG.h.

    {
        if (controlDg == nullptr)
        {
            controlDg = new CDG();
        }
        return controlDg;
    }

getCDGEdge()

CDGEdge * SVF::CDG::getCDGEdge ( const CDGNode *  src, const CDGNode *  dst  )

inline

Get a control dependence edge according to src and dst.

Definition at line 216 of file CDG.h.

    {
        CDGEdge *edge = nullptr;
        size_t counter = 0;
        for (CDGEdge::CDGEdgeSetTy::iterator iter = src->OutEdgeBegin();
                iter != src->OutEdgeEnd(); ++iter)
        {
            if ((*iter)->getDstID() == dst->getId())
            {
                counter++;
                edge = (*iter);
            }
        }
        assert(counter <= 1 && "there's more than one edge between two CDG nodes");
        return edge;
    }

getCDGNode()

CDGNode * SVF::CDG::getCDGNode ( NodeID  id ) const

inline

Get a CDG node.

Definition at line 187 of file CDG.h.

    {
        if (!hasCDGNode(id))
            return nullptr;
        return getGNode(id);
    }

hasCDGEdge()

bool SVF::CDG::hasCDGEdge ( CDGNode *  src, CDGNode *  dst  )

inline

Whether we has a CDG edge.

Definition at line 201 of file CDG.h.

    {
        CDGEdge edge(src, dst);
        CDGEdge *outEdge = src->hasOutgoingEdge(&edge);
        CDGEdge *inEdge = dst->hasIncomingEdge(&edge);
        if (outEdge && inEdge)
        {
            assert(outEdge == inEdge && "edges not match");
            return true;
        }
        else
            return false;
    }

hasCDGNode()

bool SVF::CDG::hasCDGNode ( NodeID  id ) const

inline

Whether has the CDGNode.

Definition at line 195 of file CDG.h.

    {
        return hasGNode(id);
    }

releaseCDG()

static void SVF::CDG::releaseCDG ( )

inlinestatic

Definition at line 175 of file CDG.h.

    {
        if (controlDg)
            delete controlDg;
        controlDg = nullptr;
    }

removeCDGEdge()

void SVF::CDG::removeCDGEdge ( CDGEdge *  edge )

inline

Remove a control dependence edge.

Definition at line 247 of file CDG.h.

    {
        edge->getDstNode()->removeIncomingEdge(edge);
        edge->getSrcNode()->removeOutgoingEdge(edge);
        delete edge;
    }

removeCDGNode() [1/2]

void SVF::CDG::removeCDGNode ( CDGNode *  node )

inline

Remove a CDGNode.

Definition at line 255 of file CDG.h.

    {
        std::set<CDGEdge *> temp;
        for (CDGEdge *e: node->getInEdges())
            temp.insert(e);
        for (CDGEdge *e: node->getOutEdges())
            temp.insert(e);
        for (CDGEdge *e: temp)
        {
            removeCDGEdge(e);
        }
        removeGNode(node);
    }

removeCDGNode() [2/2]

bool SVF::CDG::removeCDGNode ( NodeID  id )

inline

Remove node from nodeID.

Definition at line 270 of file CDG.h.

    {
        if (hasCDGNode(id))
        {
            removeCDGNode(getCDGNode(id));
            return true;
        }
        return false;
    }

view()

void SVF::CDG::view ( )

inline

View graph from the debugger.

Definition at line 234 of file CDG.h.

    {
        SVF::ViewGraph(this, "Control Dependence Graph");
    }

Member Data Documentation

controlDg

CDG * CDG::controlDg = nullptr

staticprivate

Singleton pattern here

Definition at line 155 of file CDG.h.

---

The documentation for this class was generated from the following files:

• /home/runner/work/SVF/SVF/svf/include/Graphs/CDG.h
• /home/runner/work/SVF/SVF/svf/lib/Graphs/CDG.cpp