#include <PTACallGraph.h>

Inheritance diagram for SVF::PTACallGraph:

Public Types
enum	CGEK { NormCallGraph , ThdCallGraph }

typedef PTACallGraphEdge::CallGraphEdgeSet	CallGraphEdgeSet

typedef Map< const SVFFunction , PTACallGraphNode >	FunToCallGraphNodeMap

typedef Map< const CallICFGNode *, CallGraphEdgeSet >	CallInstToCallGraphEdgesMap

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

typedef Map< CallSitePair, CallSiteID >	CallSiteToIdMap

typedef Map< CallSiteID, CallSitePair >	IdToCallSiteMap

typedef Set< const SVFFunction * >	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
	PTACallGraph (CGEK k=NormCallGraph)
	Constructor.

	PTACallGraph (const CallGraph &other)
	Copy constructor.

virtual	~PTACallGraph ()
	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.

PTACallGraphNode *	getCallGraphNode (NodeID id) const
	Get call graph node.

PTACallGraphNode *	getCallGraphNode (const SVFFunction *fun) const

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

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

const CallSitePair &	getCallSitePair (CallSiteID id) const

const CallICFGNode *	getCallSite (CallSiteID id) const

const SVFFunction *	getCallerOfCallSite (CallSiteID id) const

const SVFFunction *	getCalleeOfCallSite (CallSiteID id) const

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

PTACallGraphEdge *	getGraphEdge (PTACallGraphNode src, PTACallGraphNode dst, PTACallGraphEdge::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 SVFFunction callerFun, const SVFFunction *calleeFun)
	Add indirect call edges.

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

void	getDirCallSitesInvokingCallee (const SVFFunction *callee, PTACallGraphEdge::CallInstSet &csSet)

void	getIndCallSitesInvokingCallee (const SVFFunction *callee, PTACallGraphEdge::CallInstSet &csSet)

bool	isReachableBetweenFunctions (const SVFFunction srcFn, const SVFFunction 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 SVFFunction callee)
	Add CallSiteID.

void	addEdge (PTACallGraphEdge *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 236 of file PTACallGraph.h.

Member Typedef Documentation

◆ CallEdgeMap

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

Definition at line 247 of file PTACallGraph.h.

◆ CallGraphEdgeConstIter

typedef CallGraphEdgeSet::const_iterator SVF::PTACallGraph::CallGraphEdgeConstIter

Definition at line 249 of file PTACallGraph.h.

◆ CallGraphEdgeIter

typedef CallGraphEdgeSet::iterator SVF::PTACallGraph::CallGraphEdgeIter

Definition at line 248 of file PTACallGraph.h.

◆ CallGraphEdgeSet

typedef PTACallGraphEdge::CallGraphEdgeSet SVF::PTACallGraph::CallGraphEdgeSet

Definition at line 240 of file PTACallGraph.h.

◆ CallInstToCallGraphEdgesMap

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

Definition at line 242 of file PTACallGraph.h.

◆ CallSitePair

typedef std::pair<const CallICFGNode*, const SVFFunction*> SVF::PTACallGraph::CallSitePair

Definition at line 243 of file PTACallGraph.h.

◆ CallSiteToIdMap

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

Definition at line 244 of file PTACallGraph.h.

◆ FunctionSet

typedef Set<const SVFFunction*> SVF::PTACallGraph::FunctionSet

Definition at line 246 of file PTACallGraph.h.

◆ FunToCallGraphNodeMap

typedef Map<const SVFFunction*, PTACallGraphNode*> SVF::PTACallGraph::FunToCallGraphNodeMap

Definition at line 241 of file PTACallGraph.h.

◆ IdToCallSiteMap

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

Definition at line 245 of file PTACallGraph.h.

Member Enumeration Documentation

◆ CGEK

enum SVF::PTACallGraph::CGEK

Enumerator
NormCallGraph
ThdCallGraph

Definition at line 251 of file PTACallGraph.h.

    {
        NormCallGraph, ThdCallGraph
    };

Constructor & Destructor Documentation

◆ PTACallGraph() [1/2]

PTACallGraph::PTACallGraph ( CGEK k = NormCallGraph )

Constructor.

Definition at line 110 of file PTACallGraph.cpp.

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

◆ PTACallGraph() [2/2]

PTACallGraph::PTACallGraph ( const CallGraph & other )

Copy constructor.

copy call graph nodes

copy edges

Definition at line 117 of file PTACallGraph.cpp.

{
    callGraphNodeNum = other.getTotalNodeNum();
    numOfResolvedIndCallEdge = 0;
    kind = NormCallGraph;
 
    for (const auto& item : other)
    {
        const CallGraphNode* cgn = item.second;
        PTACallGraphNode* callGraphNode = new PTACallGraphNode(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)
        {
            PTACallGraphNode* src = getCallGraphNode(edge->getSrcID());
            PTACallGraphNode* dst = getCallGraphNode(edge->getDstID());
            CallSiteID csId = addCallSite(cs, dst->getFunction());
 
            PTACallGraphEdge* newEdge = new PTACallGraphEdge(src,dst, PTACallGraphEdge::CallRetEdge,csId);
            newEdge->addDirectCallSite(cs);
            addEdge(newEdge);
            callinstToCallGraphEdgesMap[cs].insert(newEdge);
        }
    }
 
}

◆ ~PTACallGraph()

virtual SVF::PTACallGraph::~PTACallGraph ( )

inlinevirtual

Destructor.

Definition at line 308 of file PTACallGraph.h.

    {
        destroy();
    }

Member Function Documentation

◆ addCallSite()

CallSiteID SVF::PTACallGraph::addCallSite	(	const CallICFGNode *	cs,
		const SVFFunction *	callee
	)

inlineprotected

Add CallSiteID.

Definition at line 278 of file PTACallGraph.h.

    {
        std::pair<const CallICFGNode*, const SVFFunction*> 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;
    }

◆ addEdge()

void SVF::PTACallGraph::addEdge ( PTACallGraphEdge * edge )

inlineprotected

Add call graph edge.

Definition at line 294 of file PTACallGraph.h.

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

◆ addIndirectCallGraphEdge()

void PTACallGraph::addIndirectCallGraphEdge	(	const CallICFGNode *	cs,
		const SVFFunction *	callerFun,
		const SVFFunction *	calleeFun
	)

Add indirect call edges.

Add indirect call edge to update call graph

Definition at line 198 of file PTACallGraph.cpp.

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

◆ destroy()

void PTACallGraph::destroy ( )

protected

Clean up memory.

Memory has been cleaned up at GenericGraph

Definition at line 154 of file PTACallGraph.cpp.

155{

156}

◆ dump()

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

Dump the graph.

Dump call graph into dot file

Definition at line 327 of file PTACallGraph.cpp.

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

◆ getAllCallSitesInvokingCallee()

void PTACallGraph::getAllCallSitesInvokingCallee	(	const SVFFunction *	callee,
		PTACallGraphEdge::CallInstSet &	csSet
	)

Get callsites invoking the callee.

Get all callsite invoking this callee

Definition at line 220 of file PTACallGraph.cpp.

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

◆ getCallEdgeBegin()

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

inline

Definition at line 430 of file PTACallGraph.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::PTACallGraph::getCallEdgeEnd ( const CallICFGNode * inst ) const

inline

Definition at line 437 of file PTACallGraph.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 SVFFunction * SVF::PTACallGraph::getCalleeOfCallSite ( CallSiteID id ) const

inline

Definition at line 398 of file PTACallGraph.h.

    {
        return getCallSitePair(id).second;
    }

◆ getCallees()

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

inline

Get all callees for a callsite.

Definition at line 411 of file PTACallGraph.h.

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

◆ getCallerOfCallSite()

const SVFFunction * SVF::PTACallGraph::getCallerOfCallSite ( CallSiteID id ) const

inline

Definition at line 394 of file PTACallGraph.h.

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

◆ getCallGraphNode() [1/2]

PTACallGraphNode * SVF::PTACallGraph::getCallGraphNode ( const SVFFunction * fun ) const

inline

Definition at line 360 of file PTACallGraph.h.

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

◆ getCallGraphNode() [2/2]

PTACallGraphNode * SVF::PTACallGraph::getCallGraphNode ( NodeID id ) const

inline

Get call graph node.

Definition at line 356 of file PTACallGraph.h.

    {
        return getGNode(id);
    }

◆ getCallInstToCallGraphEdgesMap()

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

inline

Definition at line 346 of file PTACallGraph.h.

    {
        return callinstToCallGraphEdgesMap;
    }

◆ getCallSite()

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

inline

Definition at line 390 of file PTACallGraph.h.

    {
        return getCallSitePair(id).first;
    }

◆ getCallSiteID()

CallSiteID SVF::PTACallGraph::getCallSiteID	(	const CallICFGNode *	cs,
		const SVFFunction *	callee
	)		const

inline

Get CallSiteID.

Definition at line 371 of file PTACallGraph.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::PTACallGraph::getCallSitePair ( CallSiteID id ) const

inline

Definition at line 384 of file PTACallGraph.h.

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

◆ getDirCallSitesInvokingCallee()

void PTACallGraph::getDirCallSitesInvokingCallee	(	const SVFFunction *	callee,
		PTACallGraphEdge::CallInstSet &	csSet
	)

Get direct callsite invoking this callee

Definition at line 242 of file PTACallGraph.cpp.

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

◆ getGraphEdge()

PTACallGraphEdge * PTACallGraph::getGraphEdge	(	PTACallGraphNode *	src,
		PTACallGraphNode *	dst,
		PTACallGraphEdge::CEDGEK	kind,
		CallSiteID	csId
	)

Get call graph edge via nodes.

get PTACallGraph edge via nodes

Definition at line 180 of file PTACallGraph.cpp.

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

◆ getIndCallMap()

CallEdgeMap & SVF::PTACallGraph::getIndCallMap ( )

inline

Get callees from an indirect callsite.

Definition at line 321 of file PTACallGraph.h.

    {
        return indirectCallMap;
    }

◆ getIndCallSitesInvokingCallee()

void PTACallGraph::getIndCallSitesInvokingCallee	(	const SVFFunction *	callee,
		PTACallGraphEdge::CallInstSet &	csSet
	)

Get indirect callsite invoking this callee

Definition at line 259 of file PTACallGraph.cpp.

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

◆ getIndCSCallees()

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

inline

Definition at line 329 of file PTACallGraph.h.

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

◆ getKind()

CGEK SVF::PTACallGraph::getKind ( ) const

inline

Return type of this callgraph.

Definition at line 314 of file PTACallGraph.h.

    {
        return kind;
    }

◆ getNumOfResolvedIndCallEdge()

u32_t SVF::PTACallGraph::getNumOfResolvedIndCallEdge ( ) const

inline

Definition at line 341 of file PTACallGraph.h.

    {
        return numOfResolvedIndCallEdge;
    }

◆ getTotalCallSiteNumber()

u32_t SVF::PTACallGraph::getTotalCallSiteNumber ( ) const

inline

Definition at line 336 of file PTACallGraph.h.

    {
        return totalCallSiteNum;
    }

◆ hasCallGraphEdge()

bool SVF::PTACallGraph::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 426 of file PTACallGraph.h.

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

◆ hasCallSiteID()

bool SVF::PTACallGraph::hasCallSiteID	(	const CallICFGNode *	cs,
		const SVFFunction *	callee
	)		const

inline

Definition at line 378 of file PTACallGraph.h.

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

◆ hasGraphEdge()

PTACallGraphEdge * PTACallGraph::hasGraphEdge	(	PTACallGraphNode *	src,
		PTACallGraphNode *	dst,
		PTACallGraphEdge::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 161 of file PTACallGraph.cpp.

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

◆ hasIndCSCallees()

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

inline

Definition at line 325 of file PTACallGraph.h.

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

◆ isReachableBetweenFunctions()

bool PTACallGraph::isReachableBetweenFunctions	(	const SVFFunction *	srcFn,
		const SVFFunction *	dstFn
	)		const

Whether its reachable between two functions.

Whether its reachable between two functions

Definition at line 296 of file PTACallGraph.cpp.

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

◆ verifyCallGraph()

void PTACallGraph::verifyCallGraph ( )

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

Definition at line 276 of file PTACallGraph.cpp.

{
    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 SVFFunction* func = cs->getCaller();
            if (getCallGraphNode(func)->isReachableFromProgEntry() == false)
                writeWrnMsg(func->getName() + " has indirect call site but not reachable from main");
        }
    }
}

◆ view()

void PTACallGraph::view ( )

View the graph from the debugger.

Definition at line 332 of file PTACallGraph.cpp.

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

Member Data Documentation

◆ callGraphNodeNum

NodeID SVF::PTACallGraph::callGraphNodeNum

protected

Definition at line 269 of file PTACallGraph.h.

◆ callinstToCallGraphEdgesMap

CallInstToCallGraphEdgesMap SVF::PTACallGraph::callinstToCallGraphEdgesMap

protected

Map a call instruction to its corresponding call edges.

Definition at line 267 of file PTACallGraph.h.

◆ csToIdMap

PTACallGraph::CallSiteToIdMap PTACallGraph::csToIdMap

staticprivate

Call site information.

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

Definition at line 261 of file PTACallGraph.h.

◆ funToCallGraphNodeMap

FunToCallGraphNodeMap SVF::PTACallGraph::funToCallGraphNodeMap

protected

Call Graph node map.

Definition at line 266 of file PTACallGraph.h.

◆ idToCSMap

PTACallGraph::IdToCallSiteMap PTACallGraph::idToCSMap

staticprivate

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

Definition at line 262 of file PTACallGraph.h.

◆ indirectCallMap

CallEdgeMap SVF::PTACallGraph::indirectCallMap

private

Indirect call map.

Definition at line 258 of file PTACallGraph.h.

◆ kind

CGEK SVF::PTACallGraph::kind

protected

Definition at line 271 of file PTACallGraph.h.

◆ numOfResolvedIndCallEdge

u32_t SVF::PTACallGraph::numOfResolvedIndCallEdge

protected

Definition at line 270 of file PTACallGraph.h.

◆ totalCallSiteNum

CallSiteID PTACallGraph::totalCallSiteNum =1

staticprivate

CallSiteIDs, start from 1;.

Definition at line 263 of file PTACallGraph.h.

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

/home/runner/work/SVF/SVF/svf/include/Graphs/PTACallGraph.h
/home/runner/work/SVF/SVF/svf/lib/Graphs/PTACallGraph.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

◆ PTACallGraph() [1/2]

◆ PTACallGraph() [2/2]

◆ ~PTACallGraph()

Member Function Documentation

◆ addCallSite()

◆ addEdge()

◆ addIndirectCallGraphEdge()

◆ destroy()

◆ dump()

◆ getAllCallSitesInvokingCallee()

◆ getCallEdgeBegin()

◆ getCallEdgeEnd()

◆ getCalleeOfCallSite()

◆ getCallees()

◆ getCallerOfCallSite()

◆ getCallGraphNode() [1/2]

◆ getCallGraphNode() [2/2]

◆ 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