#include <CallGraph.h>

Inheritance diagram for SVF::CallGraph:

Public Types
enum	CGEK { NormCallGraph , ThdCallGraph }

typedef CallGraphEdge::CallGraphEdgeSet	CallGraphEdgeSet

typedef Map< const FunObjVar , CallGraphNode >	FunToCallGraphNodeMap

typedef Map< const CallICFGNode *, CallGraphEdgeSet >	CallInstToCallGraphEdgesMap

typedef std::pair< const CallICFGNode , const FunObjVar >	CallSitePair

typedef Map< CallSitePair, CallSiteID >	CallSiteToIdMap

typedef Map< CallSiteID, CallSitePair >	IdToCallSiteMap

typedef Set< const FunObjVar * >	FunctionSet

typedef OrderedMap< const CallICFGNode *, FunctionSet >	CallEdgeMap

typedef CallGraphEdgeSet::iterator	CallGraphEdgeIter

typedef CallGraphEdgeSet::const_iterator	CallGraphEdgeConstIter

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
	CallGraph (CGEK k=NormCallGraph)
	Constructor.

	CallGraph (const CallGraph &other)
	Copy constructor.

virtual	~CallGraph ()
	Destructor.

CGEK	getKind () const
	Return type of this callgraph.

CallEdgeMap &	getIndCallMap ()
	Get callees from an indirect callsite.

bool	hasIndCSCallees (const CallICFGNode *cs) const

const FunctionSet &	getIndCSCallees (const CallICFGNode *cs) const

u32_t	getTotalCallSiteNumber () const

u32_t	getNumOfResolvedIndCallEdge () const

const CallInstToCallGraphEdgesMap &	getCallInstToCallGraphEdgesMap () const

void	verifyCallGraph ()
	Issue a warning if the function which has indirect call sites can not be reached from program entry.

void	addDirectCallGraphEdge (const CallICFGNode call, const FunObjVar callerFun, const FunObjVar *calleeFun)
	Add direct call edges.

void	addCallGraphNode (const FunObjVar *fun)

const CallGraphNode *	getCallGraphNode (const std::string &name)
	Get call graph node.

CallGraphNode *	getCallGraphNode (NodeID id) const

CallGraphNode *	getCallGraphNode (const FunObjVar *fun) const

CallSiteID	getCallSiteID (const CallICFGNode cs, const FunObjVar callee) const
	Get CallSiteID.

bool	hasCallSiteID (const CallICFGNode cs, const FunObjVar callee) const

const CallSitePair &	getCallSitePair (CallSiteID id) const

const CallICFGNode *	getCallSite (CallSiteID id) const

const FunObjVar *	getCallerOfCallSite (CallSiteID id) const

const FunObjVar *	getCalleeOfCallSite (CallSiteID id) const

CallGraphEdge *	hasGraphEdge (CallGraphNode src, CallGraphNode dst, CallGraphEdge::CEDGEK kind, CallSiteID csId) const
	Whether we have already created this call graph edge.

CallGraphEdge *	getGraphEdge (CallGraphNode src, CallGraphNode dst, CallGraphEdge::CEDGEK kind, CallSiteID csId)
	Get call graph edge via nodes.

void	getCallees (const CallICFGNode *cs, FunctionSet &callees)
	Get all callees for a callsite.

bool	hasCallGraphEdge (const CallICFGNode *inst) const
	Get call graph edge via call instruction.

CallGraphEdgeSet::const_iterator	getCallEdgeBegin (const CallICFGNode *inst) const

CallGraphEdgeSet::const_iterator	getCallEdgeEnd (const CallICFGNode *inst) const

void	addIndirectCallGraphEdge (const CallICFGNode cs, const FunObjVar callerFun, const FunObjVar *calleeFun)
	Add indirect call edges.

void	getAllCallSitesInvokingCallee (const FunObjVar *callee, CallGraphEdge::CallInstSet &csSet)
	Get callsites invoking the callee.

void	getDirCallSitesInvokingCallee (const FunObjVar *callee, CallGraphEdge::CallInstSet &csSet)

void	getIndCallSitesInvokingCallee (const FunObjVar *callee, CallGraphEdge::CallInstSet &csSet)

bool	isReachableBetweenFunctions (const FunObjVar srcFn, const FunObjVar dstFn) const
	Whether its reachable between two functions.

void	dump (const std::string &filename)
	Dump the graph.

void	view ()
	View the graph from the debugger.

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 ()

Protected Member Functions
void	destroy ()
	Clean up memory.

CallSiteID	addCallSite (const CallICFGNode cs, const FunObjVar callee)
	Add CallSiteID.

void	addEdge (CallGraphEdge *edge)
	Add call graph edge.

Protected Attributes
FunToCallGraphNodeMap	funToCallGraphNodeMap
	Call Graph node map.

CallInstToCallGraphEdgesMap	callinstToCallGraphEdgesMap
	Map a call instruction to its corresponding call edges.

NodeID	callGraphNodeNum

u32_t	numOfResolvedIndCallEdge

CGEK	kind

Protected Attributes inherited from SVF::GenericGraph< NodeTy, EdgeTy >
IDToNodeMapTy	IDToNodeMap
	node map

Private Attributes
CallEdgeMap	indirectCallMap
	Indirect call map.

Static Private Attributes
static CallSiteToIdMap	csToIdMap
	Call site information.

static IdToCallSiteMap	idToCSMap
	Map a callsite ID to a pair of call instruction and callee.

static CallSiteID	totalCallSiteNum =1
	CallSiteIDs, start from 1;.

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

Detailed Description

Definition at line 234 of file CallGraph.h.

Member Typedef Documentation

◆ CallEdgeMap

typedef OrderedMap<const CallICFGNode*, FunctionSet> SVF::CallGraph::CallEdgeMap

Definition at line 245 of file CallGraph.h.

◆ CallGraphEdgeConstIter

typedef CallGraphEdgeSet::const_iterator SVF::CallGraph::CallGraphEdgeConstIter

Definition at line 247 of file CallGraph.h.

◆ CallGraphEdgeIter

typedef CallGraphEdgeSet::iterator SVF::CallGraph::CallGraphEdgeIter

Definition at line 246 of file CallGraph.h.

◆ CallGraphEdgeSet

typedef CallGraphEdge::CallGraphEdgeSet SVF::CallGraph::CallGraphEdgeSet

Definition at line 238 of file CallGraph.h.

◆ CallInstToCallGraphEdgesMap

typedef Map<const CallICFGNode*, CallGraphEdgeSet> SVF::CallGraph::CallInstToCallGraphEdgesMap

Definition at line 240 of file CallGraph.h.

◆ CallSitePair

typedef std::pair<const CallICFGNode*, const FunObjVar*> SVF::CallGraph::CallSitePair

Definition at line 241 of file CallGraph.h.

◆ CallSiteToIdMap

typedef Map<CallSitePair, CallSiteID> SVF::CallGraph::CallSiteToIdMap

Definition at line 242 of file CallGraph.h.

◆ FunctionSet

typedef Set<const FunObjVar*> SVF::CallGraph::FunctionSet

Definition at line 244 of file CallGraph.h.

◆ FunToCallGraphNodeMap

typedef Map<const FunObjVar*, CallGraphNode*> SVF::CallGraph::FunToCallGraphNodeMap

Definition at line 239 of file CallGraph.h.

◆ IdToCallSiteMap

typedef Map<CallSiteID, CallSitePair> SVF::CallGraph::IdToCallSiteMap

Definition at line 243 of file CallGraph.h.

Member Enumeration Documentation

◆ CGEK

enum SVF::CallGraph::CGEK

Enumerator
NormCallGraph
ThdCallGraph

Definition at line 249 of file CallGraph.h.

    {
        NormCallGraph, ThdCallGraph
    };

Constructor & Destructor Documentation

◆ CallGraph() [1/2]

CallGraph::CallGraph ( CGEK k = NormCallGraph )

Constructor.

Definition at line 121 of file CallGraph.cpp.

                          : kind(k)
{
    callGraphNodeNum = 0;
    numOfResolvedIndCallEdge = 0;
}

◆ CallGraph() [2/2]

CallGraph::CallGraph ( const CallGraph & other )

Copy constructor.

copy call graph nodes

copy edges

Definition at line 128 of file CallGraph.cpp.

{
    callGraphNodeNum = other.getTotalNodeNum();
    numOfResolvedIndCallEdge = 0;
    kind = NormCallGraph;
 
    for (const auto& item : other)
    {
        const CallGraphNode* cgn = item.second;
        CallGraphNode* callGraphNode = new CallGraphNode(cgn->getId(), cgn->getFunction());
        addGNode(cgn->getId(),callGraphNode);
        funToCallGraphNodeMap[cgn->getFunction()] = callGraphNode;
    }
 
    for (const auto& item : other.callinstToCallGraphEdgesMap)
    {
        const CallICFGNode* cs = item.first;
        for (const CallGraphEdge* edge : item.second)
        {
            CallGraphNode* src = getCallGraphNode(edge->getSrcID());
            CallGraphNode* dst = getCallGraphNode(edge->getDstID());
            CallSiteID csId = addCallSite(cs, dst->getFunction());
 
            CallGraphEdge* newEdge = new CallGraphEdge(src,dst, CallGraphEdge::CallRetEdge,csId);
            newEdge->addDirectCallSite(cs);
            addEdge(newEdge);
            callinstToCallGraphEdgesMap[cs].insert(newEdge);
        }
    }
 
}

◆ ~CallGraph()

virtual SVF::CallGraph::~CallGraph ( )

inlinevirtual

Destructor.

Definition at line 306 of file CallGraph.h.

    {
        destroy();
    }

Member Function Documentation

◆ addCallGraphNode()

void CallGraph::addCallGraphNode ( const FunObjVar * fun )

Add call graph node

Definition at line 358 of file CallGraph.cpp.

{
    NodeID id  = callGraphNodeNum;
    CallGraphNode*callGraphNode = new CallGraphNode(id, fun);
    addGNode(id, callGraphNode);
    funToCallGraphNodeMap[callGraphNode->getFunction()] = callGraphNode;
    callGraphNodeNum++;
}

◆ addCallSite()

CallSiteID SVF::CallGraph::addCallSite	(	const CallICFGNode *	cs,
		const FunObjVar *	callee
	)

inlineprotected

Add CallSiteID.

Definition at line 276 of file CallGraph.h.

    {
        std::pair<const CallICFGNode*, const FunObjVar*> newCS(std::make_pair(cs, callee));
        CallSiteToIdMap::const_iterator it = csToIdMap.find(newCS);
        //assert(it == csToIdMap.end() && "cannot add a callsite twice");
        if(it == csToIdMap.end())
        {
            CallSiteID id = totalCallSiteNum++;
            csToIdMap.insert(std::make_pair(newCS, id));
            idToCSMap.insert(std::make_pair(id, newCS));
            return id;
        }
        return it->second;
    }

◆ addDirectCallGraphEdge()

void CallGraph::addDirectCallGraphEdge	(	const CallICFGNode *	cs,
		const FunObjVar *	callerFun,
		const FunObjVar *	calleeFun
	)

Add direct call edges.

Add direct call edges

Definition at line 380 of file CallGraph.cpp.

{
 
    CallGraphNode* caller = getCallGraphNode(callerFun);
    CallGraphNode* callee = getCallGraphNode(calleeFun);
    CallSiteID csId = addCallSite(cs, calleeFun);
 
    if(!hasGraphEdge(caller,callee, CallGraphEdge::CallRetEdge, csId))
    {
        CallGraphEdge* edge = new CallGraphEdge(caller,callee, CallGraphEdge::CallRetEdge, csId);
        edge->addDirectCallSite(cs);
        addEdge(edge);
        callinstToCallGraphEdgesMap[cs].insert(edge);
    }
}

◆ addEdge()

void SVF::CallGraph::addEdge ( CallGraphEdge * edge )

inlineprotected

Add call graph edge.

Definition at line 292 of file CallGraph.h.

    {
        edge->getDstNode()->addIncomingEdge(edge);
        edge->getSrcNode()->addOutgoingEdge(edge);
    }

◆ addIndirectCallGraphEdge()

void CallGraph::addIndirectCallGraphEdge	(	const CallICFGNode *	cs,
		const FunObjVar *	callerFun,
		const FunObjVar *	calleeFun
	)

Add indirect call edges.

Add indirect call edge to update call graph

Definition at line 209 of file CallGraph.cpp.

{
 
    CallGraphNode* caller = getCallGraphNode(callerFun);
    CallGraphNode* callee = getCallGraphNode(calleeFun);
 
    numOfResolvedIndCallEdge++;
 
    CallSiteID csId = addCallSite(cs, callee->getFunction());
 
    if(!hasGraphEdge(caller,callee, CallGraphEdge::CallRetEdge,csId))
    {
        CallGraphEdge* edge = new CallGraphEdge(caller,callee, CallGraphEdge::CallRetEdge, csId);
        edge->addInDirectCallSite(cs);
        addEdge(edge);
        callinstToCallGraphEdgesMap[cs].insert(edge);
    }
}

◆ destroy()

void CallGraph::destroy ( )

protected

Clean up memory.

Memory has been cleaned up at GenericGraph

Definition at line 165 of file CallGraph.cpp.

166{

167}

◆ dump()

void CallGraph::dump ( const std::string & filename )

Dump the graph.

Dump call graph into dot file

Definition at line 344 of file CallGraph.cpp.

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

◆ getAllCallSitesInvokingCallee()

void CallGraph::getAllCallSitesInvokingCallee	(	const FunObjVar *	callee,
		CallGraphEdge::CallInstSet &	csSet
	)

Get callsites invoking the callee.

Get all callsite invoking this callee

Definition at line 231 of file CallGraph.cpp.

{
    CallGraphNode* callGraphNode = getCallGraphNode(callee);
    for(CallGraphNode::iterator it = callGraphNode->InEdgeBegin(), eit = callGraphNode->InEdgeEnd();
            it!=eit; ++it)
    {
        for(CallGraphEdge::CallInstSet::const_iterator cit = (*it)->directCallsBegin(),
                ecit = (*it)->directCallsEnd(); cit!=ecit; ++cit)
        {
            csSet.insert((*cit));
        }
        for(CallGraphEdge::CallInstSet::const_iterator cit = (*it)->indirectCallsBegin(),
                ecit = (*it)->indirectCallsEnd(); cit!=ecit; ++cit)
        {
            csSet.insert((*cit));
        }
    }
}

◆ getCallEdgeBegin()

CallGraphEdgeSet::const_iterator SVF::CallGraph::getCallEdgeBegin ( const CallICFGNode * inst ) const

inline

Definition at line 433 of file CallGraph.h.

    {
        CallInstToCallGraphEdgesMap::const_iterator it = callinstToCallGraphEdgesMap.find(inst);
        assert(it!=callinstToCallGraphEdgesMap.end()
               && "call instruction does not have a valid callee");
        return it->second.begin();
    }

◆ getCallEdgeEnd()

CallGraphEdgeSet::const_iterator SVF::CallGraph::getCallEdgeEnd ( const CallICFGNode * inst ) const

inline

Definition at line 440 of file CallGraph.h.

    {
        CallInstToCallGraphEdgesMap::const_iterator it = callinstToCallGraphEdgesMap.find(inst);
        assert(it!=callinstToCallGraphEdgesMap.end()
               && "call instruction does not have a valid callee");
        return it->second.end();
    }

◆ getCalleeOfCallSite()

const FunObjVar * SVF::CallGraph::getCalleeOfCallSite ( CallSiteID id ) const

inline

Definition at line 401 of file CallGraph.h.

    {
        return getCallSitePair(id).second;
    }

◆ getCallees()

void SVF::CallGraph::getCallees	(	const CallICFGNode *	cs,
		FunctionSet &	callees
	)

inline

Get all callees for a callsite.

Definition at line 414 of file CallGraph.h.

    {
        if(hasCallGraphEdge(cs))
        {
            for (CallGraphEdgeSet::const_iterator it = getCallEdgeBegin(cs), eit =
                        getCallEdgeEnd(cs); it != eit; ++it)
            {
                callees.insert((*it)->getDstNode()->getFunction());
            }
        }
    }

◆ getCallerOfCallSite()

const FunObjVar * CallGraph::getCallerOfCallSite ( CallSiteID id ) const

Definition at line 88 of file CallGraph.cpp.

{
    return getCallSite(id)->getCaller();
}

◆ getCallGraphNode() [1/3]

CallGraphNode * SVF::CallGraph::getCallGraphNode ( const FunObjVar * fun ) const

inline

Definition at line 366 of file CallGraph.h.

    {
        FunToCallGraphNodeMap::const_iterator it = funToCallGraphNodeMap.find(fun);
        assert(it!=funToCallGraphNodeMap.end() && "call graph node not found!!");
        return it->second;
    }

◆ getCallGraphNode() [2/3]

const CallGraphNode * CallGraph::getCallGraphNode ( const std::string & name )

Get call graph node.

Definition at line 367 of file CallGraph.cpp.

{
    for (const auto& item : *this)
    {
        if (item.second->getName() == name)
            return item.second;
    }
    return nullptr;
}

◆ getCallGraphNode() [3/3]

CallGraphNode * SVF::CallGraph::getCallGraphNode ( NodeID id ) const

inline

Definition at line 362 of file CallGraph.h.

    {
        return getGNode(id);
    }

◆ getCallInstToCallGraphEdgesMap()

const CallInstToCallGraphEdgesMap & SVF::CallGraph::getCallInstToCallGraphEdgesMap ( ) const

inline

Definition at line 344 of file CallGraph.h.

    {
        return callinstToCallGraphEdgesMap;
    }

◆ getCallSite()

const CallICFGNode * SVF::CallGraph::getCallSite ( CallSiteID id ) const

inline

Definition at line 396 of file CallGraph.h.

    {
        return getCallSitePair(id).first;
    }

◆ getCallSiteID()

CallSiteID SVF::CallGraph::getCallSiteID	(	const CallICFGNode *	cs,
		const FunObjVar *	callee
	)		const

inline

Get CallSiteID.

Definition at line 377 of file CallGraph.h.

    {
        CallSitePair newCS(std::make_pair(cs, callee));
        CallSiteToIdMap::const_iterator it = csToIdMap.find(newCS);
        assert(it != csToIdMap.end() && "callsite id not found! This maybe a partially resolved callgraph, please check the indCallEdge limit");
        return it->second;
    }

◆ getCallSitePair()

const CallSitePair & SVF::CallGraph::getCallSitePair ( CallSiteID id ) const

inline

Definition at line 390 of file CallGraph.h.

    {
        IdToCallSiteMap::const_iterator it = idToCSMap.find(id);
        assert(it != idToCSMap.end() && "cannot find call site for this CallSiteID");
        return (it->second);
    }

◆ getDirCallSitesInvokingCallee()

void CallGraph::getDirCallSitesInvokingCallee	(	const FunObjVar *	callee,
		CallGraphEdge::CallInstSet &	csSet
	)

Get direct callsite invoking this callee

Definition at line 253 of file CallGraph.cpp.

{
    CallGraphNode* callGraphNode = getCallGraphNode(callee);
    for(CallGraphNode::iterator it = callGraphNode->InEdgeBegin(), eit = callGraphNode->InEdgeEnd();
            it!=eit; ++it)
    {
        for(CallGraphEdge::CallInstSet::const_iterator cit = (*it)->directCallsBegin(),
                ecit = (*it)->directCallsEnd(); cit!=ecit; ++cit)
        {
            csSet.insert((*cit));
        }
    }
}

◆ getGraphEdge()

CallGraphEdge * CallGraph::getGraphEdge	(	CallGraphNode *	src,
		CallGraphNode *	dst,
		CallGraphEdge::CEDGEK	kind,
		CallSiteID	csId
	)

Get call graph edge via nodes.

get PTACallGraph edge via nodes

Definition at line 191 of file CallGraph.cpp.

{
    for (CallGraphEdge::CallGraphEdgeSet::iterator iter = src->OutEdgeBegin();
            iter != src->OutEdgeEnd(); ++iter)
    {
        CallGraphEdge* edge = (*iter);
        if (edge->getEdgeKind() == kind && edge->getDstID() == dst->getId())
            return edge;
    }
    return nullptr;
}

◆ getIndCallMap()

CallEdgeMap & SVF::CallGraph::getIndCallMap ( )

inline

Get callees from an indirect callsite.

Definition at line 319 of file CallGraph.h.

    {
        return indirectCallMap;
    }

◆ getIndCallSitesInvokingCallee()

void CallGraph::getIndCallSitesInvokingCallee	(	const FunObjVar *	callee,
		CallGraphEdge::CallInstSet &	csSet
	)

Get indirect callsite invoking this callee

Definition at line 270 of file CallGraph.cpp.

{
    CallGraphNode* callGraphNode = getCallGraphNode(callee);
    for(CallGraphNode::iterator it = callGraphNode->InEdgeBegin(), eit = callGraphNode->InEdgeEnd();
            it!=eit; ++it)
    {
        for(CallGraphEdge::CallInstSet::const_iterator cit = (*it)->indirectCallsBegin(),
                ecit = (*it)->indirectCallsEnd(); cit!=ecit; ++cit)
        {
            csSet.insert((*cit));
        }
    }
}

◆ getIndCSCallees()

const FunctionSet & SVF::CallGraph::getIndCSCallees ( const CallICFGNode * cs ) const

inline

Definition at line 327 of file CallGraph.h.

    {
        CallEdgeMap::const_iterator it = indirectCallMap.find(cs);
        assert(it!=indirectCallMap.end() && "not an indirect callsite!");
        return it->second;
    }

◆ getKind()

CGEK SVF::CallGraph::getKind ( ) const

inline

Return type of this callgraph.

Definition at line 312 of file CallGraph.h.

    {
        return kind;
    }

◆ getNumOfResolvedIndCallEdge()

u32_t SVF::CallGraph::getNumOfResolvedIndCallEdge ( ) const

inline

Definition at line 339 of file CallGraph.h.

    {
        return numOfResolvedIndCallEdge;
    }

◆ getTotalCallSiteNumber()

u32_t SVF::CallGraph::getTotalCallSiteNumber ( ) const

inline

Definition at line 334 of file CallGraph.h.

    {
        return totalCallSiteNum;
    }

◆ hasCallGraphEdge()

bool SVF::CallGraph::hasCallGraphEdge ( const CallICFGNode * inst ) const

inline

Get call graph edge via call instruction.

whether this call instruction has a valid call graph edge

Definition at line 429 of file CallGraph.h.

    {
        return callinstToCallGraphEdgesMap.find(inst)!=callinstToCallGraphEdgesMap.end();
    }

◆ hasCallSiteID()

bool SVF::CallGraph::hasCallSiteID	(	const CallICFGNode *	cs,
		const FunObjVar *	callee
	)		const

inline

Definition at line 384 of file CallGraph.h.

    {
        CallSitePair newCS(std::make_pair(cs, callee));
        CallSiteToIdMap::const_iterator it = csToIdMap.find(newCS);
        return it != csToIdMap.end();
    }

◆ hasGraphEdge()

CallGraphEdge * CallGraph::hasGraphEdge	(	CallGraphNode *	src,
		CallGraphNode *	dst,
		CallGraphEdge::CEDGEK	kind,
		CallSiteID	csId
	)		const

Whether we have already created this call graph edge.

Whether we have already created this call graph edge

Definition at line 172 of file CallGraph.cpp.

{
    CallGraphEdge edge(src,dst,kind,csId);
    CallGraphEdge* outEdge = src->hasOutgoingEdge(&edge);
    CallGraphEdge* inEdge = dst->hasIncomingEdge(&edge);
    if (outEdge && inEdge)
    {
        assert(outEdge == inEdge && "edges not match");
        return outEdge;
    }
    else
        return nullptr;
}

◆ hasIndCSCallees()

bool SVF::CallGraph::hasIndCSCallees ( const CallICFGNode * cs ) const

inline

Definition at line 323 of file CallGraph.h.

    {
        return (indirectCallMap.find(cs) != indirectCallMap.end());
    }

◆ isReachableBetweenFunctions()

bool CallGraph::isReachableBetweenFunctions	(	const FunObjVar *	srcFn,
		const FunObjVar *	dstFn
	)		const

Whether its reachable between two functions.

Whether its reachable between two functions

Definition at line 313 of file CallGraph.cpp.

{
    CallGraphNode* dstNode = getCallGraphNode(dstFn);
 
    std::stack<const CallGraphNode*> nodeStack;
    NodeBS visitedNodes;
    nodeStack.push(dstNode);
    visitedNodes.set(dstNode->getId());
 
    while (nodeStack.empty() == false)
    {
        CallGraphNode* node = const_cast<CallGraphNode*>(nodeStack.top());
        nodeStack.pop();
 
        if (node->getFunction() == srcFn)
            return true;
 
        for (CallGraphEdgeConstIter it = node->InEdgeBegin(), eit = node->InEdgeEnd(); it != eit; ++it)
        {
            CallGraphEdge* edge = *it;
            if (visitedNodes.test_and_set(edge->getSrcID()))
                nodeStack.push(edge->getSrcNode());
        }
    }
 
    return false;
}

◆ verifyCallGraph()

void CallGraph::verifyCallGraph ( )

Issue a warning if the function which has indirect call sites can not be reached from program entry.

Definition at line 287 of file CallGraph.cpp.

{
    if (Options::DisableWarn())
        return;
 
    Map<NodeID, bool> reachableFromEntry;
    NodeBS visitedNodes;
    CallEdgeMap::const_iterator it = indirectCallMap.begin();
    CallEdgeMap::const_iterator eit = indirectCallMap.end();
    for (; it != eit; ++it)
    {
        const FunctionSet& targets = it->second;
        if (targets.empty() == false)
        {
            const CallICFGNode* cs = it->first;
            const FunObjVar* func = cs->getCaller();
            if (getCallGraphNode(func)->
                    isReachableFromProgEntry(reachableFromEntry, visitedNodes) == false)
                writeWrnMsg(func->getName() + " has indirect call site but not reachable from main");
        }
    }
}

◆ view()

void CallGraph::view ( )

View the graph from the debugger.

Definition at line 349 of file CallGraph.cpp.

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

Member Data Documentation

◆ callGraphNodeNum

NodeID SVF::CallGraph::callGraphNodeNum

protected

Definition at line 267 of file CallGraph.h.

◆ callinstToCallGraphEdgesMap

CallInstToCallGraphEdgesMap SVF::CallGraph::callinstToCallGraphEdgesMap

protected

Map a call instruction to its corresponding call edges.

Definition at line 265 of file CallGraph.h.

◆ csToIdMap

CallGraph::CallSiteToIdMap CallGraph::csToIdMap

staticprivate

Call site information.

Map a pair of call instruction and callee to a callsite ID

Definition at line 259 of file CallGraph.h.

◆ funToCallGraphNodeMap

FunToCallGraphNodeMap SVF::CallGraph::funToCallGraphNodeMap

protected

Call Graph node map.

Definition at line 264 of file CallGraph.h.

◆ idToCSMap

CallGraph::IdToCallSiteMap CallGraph::idToCSMap

staticprivate

Map a callsite ID to a pair of call instruction and callee.

Definition at line 260 of file CallGraph.h.

◆ indirectCallMap

CallEdgeMap SVF::CallGraph::indirectCallMap

private

Indirect call map.

Definition at line 256 of file CallGraph.h.

◆ kind

CGEK SVF::CallGraph::kind

protected

Definition at line 269 of file CallGraph.h.

◆ numOfResolvedIndCallEdge

u32_t SVF::CallGraph::numOfResolvedIndCallEdge

protected

Definition at line 268 of file CallGraph.h.

◆ totalCallSiteNum

CallSiteID CallGraph::totalCallSiteNum =1

staticprivate

CallSiteIDs, start from 1;.

Definition at line 261 of file CallGraph.h.

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

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

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Private Attributes

Static Private Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ CallEdgeMap

◆ CallGraphEdgeConstIter

◆ CallGraphEdgeIter

◆ CallGraphEdgeSet

◆ CallInstToCallGraphEdgesMap

◆ CallSitePair

◆ CallSiteToIdMap

◆ FunctionSet

◆ FunToCallGraphNodeMap

◆ IdToCallSiteMap

Member Enumeration Documentation

◆ CGEK

Constructor & Destructor Documentation

◆ CallGraph() [1/2]

◆ CallGraph() [2/2]

◆ ~CallGraph()

Member Function Documentation

◆ addCallGraphNode()

◆ addCallSite()

◆ addDirectCallGraphEdge()

◆ addEdge()

◆ addIndirectCallGraphEdge()

◆ destroy()

◆ dump()

◆ getAllCallSitesInvokingCallee()

◆ getCallEdgeBegin()

◆ getCallEdgeEnd()

◆ getCalleeOfCallSite()

◆ getCallees()

◆ getCallerOfCallSite()

◆ getCallGraphNode() [1/3]

◆ getCallGraphNode() [2/3]

◆ getCallGraphNode() [3/3]

◆ getCallInstToCallGraphEdgesMap()

◆ getCallSite()

◆ getCallSiteID()

◆ getCallSitePair()

◆ getDirCallSitesInvokingCallee()

◆ getGraphEdge()

◆ getIndCallMap()

◆ getIndCallSitesInvokingCallee()

◆ getIndCSCallees()

◆ getKind()

◆ getNumOfResolvedIndCallEdge()

◆ getTotalCallSiteNumber()

◆ hasCallGraphEdge()

◆ hasCallSiteID()

◆ hasGraphEdge()

◆ hasIndCSCallees()

◆ isReachableBetweenFunctions()

◆ verifyCallGraph()

◆ view()

Member Data Documentation

◆ callGraphNodeNum

◆ callinstToCallGraphEdgesMap

◆ csToIdMap

◆ funToCallGraphNodeMap

◆ idToCSMap

◆ indirectCallMap

◆ kind

◆ numOfResolvedIndCallEdge

◆ totalCallSiteNum