#include <TCT.h>

Inheritance diagram for SVF::TCT:

Classes
struct	FunObjVarIdCmp

Public Types
typedef SVFLoopAndDomInfo::LoopBBs	LoopBBs

typedef TCTEdge::ThreadCreateEdgeSet	ThreadCreateEdgeSet

typedef ThreadCreateEdgeSet::iterator	TCTNodeIter

typedef OrderedSet< const FunObjVar *, FunObjVarIdCmp >	FunSet

typedef std::vector< const ICFGNode * >	InstVec

typedef Set< const ICFGNode * >	InstSet

typedef Set< const CallGraphNode * >	PTACGNodeSet

typedef Map< CxtThread, TCTNode * >	CxtThreadToNodeMap

typedef Set< std::pair< NodeID, CallStrCxt > >	CallStrCxtSet

typedef Map< CxtThread, CallStrCxtSet >	CxtThreadToForkCxtSet

typedef Map< CxtThread, const FunObjVar * >	CxtThreadToFun

typedef Map< const ICFGNode *, LoopBBs >	InstToLoopMap

typedef FIFOWorkList< CxtThreadProc >	CxtThreadProcVec

typedef Set< CxtThreadProc >	CxtThreadProcSet

typedef SCCDetection< CallGraph * >	ThreadCallGraphSCC

typedef Set< const ICFGNode * >	DummyForkSiteSet

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
	TCT (PointerAnalysis *p)
	Constructor.

virtual	~TCT ()
	Destructor.

ThreadCallGraph *	getThreadCallGraph () const
	Get TCG.

PointerAnalysis *	getPTA () const
	Get PTA.

TCTNode *	getTCTNode (NodeID id) const
	Get TCT node.

TCTEdge *	hasGraphEdge (TCTNode src, TCTNode dst, TCTEdge::CEDGEK kind) const
	Whether we have already created this call graph edge.

TCTEdge *	getGraphEdge (TCTNode src, TCTNode dst, TCTEdge::CEDGEK kind)
	Get call graph edge via nodes.

ThreadCreateEdgeSet::const_iterator	getChildrenBegin (const TCTNode *node) const
	Get children and parent nodes.

ThreadCreateEdgeSet::const_iterator	getChildrenEnd (const TCTNode *node) const

ThreadCreateEdgeSet::const_iterator	getParentsBegin (const TCTNode *node) const

ThreadCreateEdgeSet::const_iterator	getParentsEnd (const TCTNode *node) const

const FunSet &	getMakredProcs () const
	Get marked candidate functions.

const FunSet &	getEntryProcs () const
	Get marked candidate functions.

u32_t	getTCTNodeNum () const
	Get Statistics.

u32_t	getTCTEdgeNum () const

u32_t	getMaxCxtSize () const

bool	isExtCall (const ICFGNode *inst)
	Whether it is calling an external function.

bool	isCallSite (const ICFGNode *inst)
	Whether it is a callsite.

bool	hasTCTNode (const CxtThread &ct) const
	Find/Get TCT node.

TCTNode *	getTCTNode (const CxtThread &ct) const

bool	isCandidateFun (const CallGraph::FunctionSet &callees) const
	Whether it is a candidate function for indirect call.

bool	isCandidateFun (const FunObjVar *fun) const

bool	inSameCallGraphSCC (const CallGraphNode src, const CallGraphNode dst)
	Whether two functions in the same callgraph scc.

bool	hasParentThread (NodeID tid) const
	Get parent and sibling threads.

NodeBS	getParentThreads (NodeID tid) const
	Get parent threads.

const NodeBS	getAncestorThreads (NodeID tid) const
	Get all ancestor threads.

const NodeBS	getSiblingThread (NodeID tid) const
	Get sibling threads.

const CallStrCxtSet &	getCxtOfCxtThread (const CxtThread &ct) const
	get the contexts of a thread at its spawning sites (fork sites)

const FunObjVar *	getStartRoutineOfCxtThread (const CxtThread &ct) const
	get the start routine function of a thread

LoopBBs &	getJoinLoop (const CallICFGNode *join)
	Get loop for join site.

bool	hasJoinLoop (const CallICFGNode *join) const

bool	hasLoop (const SVFBasicBlock *bb) const

bool	hasLoop (const ICFGNode *inst) const

bool	isJoinMustExecutedInLoop (const LoopBBs &lp, const ICFGNode *join)
	Return true if a join instruction must be executed inside a loop.

const LoopBBs &	getLoop (const ICFGNode *inst)
	Get loop for an instruction.

const LoopBBs &	getLoop (const SVFBasicBlock *bb)
	Get loop for fork/join site.

virtual void	pushCxt (CallStrCxt &cxt, const CallICFGNode call, const FunObjVar callee)
	Context helper functions.

bool	matchAndPopCxt (CallStrCxt &cxt, const CallICFGNode call, const FunObjVar callee)
	Match context.

bool	isContextSuffix (const CallStrCxt &lhs, const CallStrCxt &call)
	If lhs is a suffix of rhs, including equal.

bool	isJoinSiteInRecursion (const CallICFGNode *join) const
	Whether a join site is in recursion.

void	dumpCxt (CallStrCxt &cxt)
	Dump calling context.

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

void	print () const
	Print TCT information.

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
TCTNode *	addTCTNode (const CxtThread &ct)
	Add TCT node.

bool	addTCTEdge (TCTNode src, TCTNode dst)
	Add TCT edge.

virtual void	build ()
	Build TCT.

void	reset ()

virtual void	markRelProcs ()
	Mark relevant procedures that are backward reachable from any fork/join site.

virtual void	markRelProcs (const FunObjVar *fun)

virtual void	collectEntryFunInCallGraph ()
	Get entry functions that are neither called by other functions nor extern functions.

void	collectMultiForkedThreads ()

virtual void	collectLoopInfoForJoin ()
	Handle join site in loop.

bool	isLoopHeaderOfJoinLoop (const SVFBasicBlock *bb)
	Whether a given bb is a loop head of a inloop join site.

bool	isLoopExitOfJoinLoop (const SVFBasicBlock *bb)
	Whether a given bb is an exit of a inloop join site.

bool	isInLoopInstruction (const ICFGNode *inst)
	Multi-forked threads.

bool	isInRecursion (const ICFGNode *inst) const
	Whether an instruction is in a recursion.

virtual void	handleCallRelation (CxtThreadProc &ctp, const CallGraphEdge cgEdge, const CallICFGNode call)
	Handle call relations.

TCTNode *	getOrCreateTCTNode (const CallStrCxt &cxt, const ICFGNode fork, const CxtThreadProc &forkSiteCtp, const FunObjVar routine)
	Get or create a tct node based on CxtThread.

void	setMultiForkedAttrs (CxtThread &ct)
	Set multi-forked thread attributes.

bool	addCxtOfCxtThread (NodeID pTid, const CallStrCxt &cxt, const CxtThread &ct)

void	addStartRoutineOfCxtThread (const FunObjVar *fun, const CxtThread &ct)
	Add start routine function of a cxt thread.

ICFGNode *	createDummyForkSite ()
	Create and get a new dummy fork site for starter routines.

bool	pushToCTPWorkList (const CxtThreadProc &ctp)
	WorkList helper functions.

CxtThreadProc	popFromCTPWorkList ()

bool	isVisitedCTPs (const CxtThreadProc &ctp) const

Protected Attributes
ThreadCallGraph *	tcg

PointerAnalysis *	pta

u32_t	TCTNodeNum

u32_t	TCTEdgeNum

u32_t	MaxCxtSize

FunSet	entryFuncSet

FunSet	candidateFuncSet
	Procedures that are neither called by other functions nor extern functions.

ThreadCallGraphSCC *	tcgSCC
	Procedures we care about during call graph traversing when creating TCT.

CxtThreadProcVec	ctpList
	Thread call graph SCC.

CxtThreadProcSet	visitedCTPs
	CxtThreadProc List.

CxtThreadToNodeMap	ctpToNodeMap
	Record all visited ctps.

CxtThreadToForkCxtSet	ctToForkCxtsMap
	Map a ctp to its graph node.

CxtThreadToFun	ctToRoutineFunMap
	Map a CxtThread to the context at its spawning site (fork site).

InstToLoopMap	joinSiteToLoopMap
	Map a CxtThread to its start routine function.

Set< const ICFGNode * >	inRecurJoinSites
	Fork or Join sites in recursions.

DummyForkSiteSet	dummyForkSites
	set of dummy fork sites for starter routines

NodeID	dummyForkICFGNodeID = UINT32_MAX
	unique ID generator for dummy

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

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 154 of file TCT.h.

Member Typedef Documentation

◆ CallStrCxtSet

typedef Set<std::pair<NodeID, CallStrCxt> > SVF::TCT::CallStrCxtSet

Definition at line 177 of file TCT.h.

◆ CxtThreadProcSet

typedef Set<CxtThreadProc> SVF::TCT::CxtThreadProcSet

Definition at line 182 of file TCT.h.

◆ CxtThreadProcVec

typedef FIFOWorkList<CxtThreadProc> SVF::TCT::CxtThreadProcVec

Definition at line 181 of file TCT.h.

◆ CxtThreadToForkCxtSet

typedef Map<CxtThread,CallStrCxtSet> SVF::TCT::CxtThreadToForkCxtSet

Definition at line 178 of file TCT.h.

◆ CxtThreadToFun

typedef Map<CxtThread,const FunObjVar*> SVF::TCT::CxtThreadToFun

Definition at line 179 of file TCT.h.

◆ CxtThreadToNodeMap

typedef Map<CxtThread,TCTNode*> SVF::TCT::CxtThreadToNodeMap

Definition at line 176 of file TCT.h.

◆ DummyForkSiteSet

typedef Set<const ICFGNode*> SVF::TCT::DummyForkSiteSet

Definition at line 184 of file TCT.h.

◆ FunSet

typedef OrderedSet<const FunObjVar*, FunObjVarIdCmp> SVF::TCT::FunSet

Definition at line 172 of file TCT.h.

◆ InstSet

typedef Set<const ICFGNode*> SVF::TCT::InstSet

Definition at line 174 of file TCT.h.

◆ InstToLoopMap

typedef Map<const ICFGNode*, LoopBBs> SVF::TCT::InstToLoopMap

Definition at line 180 of file TCT.h.

◆ InstVec

typedef std::vector<const ICFGNode*> SVF::TCT::InstVec

Definition at line 173 of file TCT.h.

◆ LoopBBs

typedef SVFLoopAndDomInfo::LoopBBs SVF::TCT::LoopBBs

Definition at line 158 of file TCT.h.

◆ PTACGNodeSet

typedef Set<const CallGraphNode*> SVF::TCT::PTACGNodeSet

Definition at line 175 of file TCT.h.

◆ TCTNodeIter

typedef ThreadCreateEdgeSet::iterator SVF::TCT::TCTNodeIter

Definition at line 160 of file TCT.h.

◆ ThreadCallGraphSCC

typedef SCCDetection<CallGraph*> SVF::TCT::ThreadCallGraphSCC

Definition at line 183 of file TCT.h.

◆ ThreadCreateEdgeSet

typedef TCTEdge::ThreadCreateEdgeSet SVF::TCT::ThreadCreateEdgeSet

Definition at line 159 of file TCT.h.

Constructor & Destructor Documentation

◆ TCT()

TCT::TCT ( PointerAnalysis * p )

Constructor.

Constructor

Definition at line 44 of file TCT.cpp.

                           :pta(p),TCTNodeNum(0),TCTEdgeNum(0),MaxCxtSize(0)
{
    tcg = SVFUtil::dyn_cast<ThreadCallGraph>(pta->getCallGraph());
    assert(tcg != nullptr && "TCT::TCT: call graph is not a ThreadCallGraph!");
    tcg->updateCallGraph(pta);
    //tcg->updateJoinEdge(pta);
    tcgSCC = pta->getCallGraphSCC();
    tcgSCC->find();
    build();
}

◆ ~TCT()

TCT::~TCT ( )

virtual

Destructor.

Definition at line 55 of file TCT.cpp.

{
    for (const ICFGNode* dummyForkSite: dummyForkSites)
    {
        delete dummyForkSite;
    }
}

Member Function Documentation

◆ addCxtOfCxtThread()

bool SVF::TCT::addCxtOfCxtThread	(	NodeID	pTid,
		const CallStrCxt &	cxt,
		const CxtThread &	ct
	)

inlineprotected

Add context for a thread at its spawning site (fork site). Returns true if this (parent tid, context) pair was not recorded before.

Definition at line 583 of file TCT.h.

    {
        return ctToForkCxtsMap[ct].insert(std::make_pair(pTid, cxt)).second;
    }

◆ addStartRoutineOfCxtThread()

void SVF::TCT::addStartRoutineOfCxtThread	(	const FunObjVar *	fun,
		const CxtThread &	ct
	)

inlineprotected

Add start routine function of a cxt thread.

Definition at line 589 of file TCT.h.

    {
        ctToRoutineFunMap[ct] = fun;
    }

◆ addTCTEdge()

bool SVF::TCT::addTCTEdge	(	TCTNode *	src,
		TCTNode *	dst
	)

inlineprotected

Add TCT edge.

Definition at line 465 of file TCT.h.

    {
        if (!hasGraphEdge(src, dst, TCTEdge::ThreadCreateEdge))
        {
            TCTEdge* edge = new TCTEdge(src, dst, TCTEdge::ThreadCreateEdge);
            dst->addIncomingEdge(edge);
            src->addOutgoingEdge(edge);
            TCTEdgeNum++;
            return true;
        }
        return false;
    }

◆ addTCTNode()

TCTNode * SVF::TCT::addTCTNode ( const CxtThread & ct )

inlineprotected

Add TCT node.

Definition at line 454 of file TCT.h.

    {
        assert(ctpToNodeMap.find(ct)==ctpToNodeMap.end() && "Already has this node!!");
        NodeID id = TCTNodeNum;
        TCTNode* node = new TCTNode(id, ct);
        addGNode(id, node);
        TCTNodeNum++;
        ctpToNodeMap[ct] = node;
        return node;
    }

◆ build()

void TCT::build ( )

protectedvirtual

Build TCT.

Start building TCT

Reimplemented in SVF::SlicedTCT.

Definition at line 409 of file TCT.cpp.

{
 
    markRelProcs();
 
    collectLoopInfoForJoin();
 
    // the fork site of main function is initialized with nullptr.
    // the context of main is initialized with empty
    // start routine is empty
 
    collectEntryFunInCallGraph();
 
    for (FunSet::iterator it=entryFuncSet.begin(), eit=entryFuncSet.end(); it!=eit; ++it)
    {
        if (!isCandidateFun(*it))
            continue;
        CallStrCxt cxt;
        CxtThreadProc dummyCtp(-1, cxt, nullptr);
        const ICFGNode* dummyForkSite = createDummyForkSite();
        TCTNode* mainTCTNode = getOrCreateTCTNode(cxt, dummyForkSite, dummyCtp, *it);
        CxtThreadProc t(mainTCTNode->getId(), cxt, *it);
        pushToCTPWorkList(t);
    }
 
    while(!ctpList.empty())
    {
        CxtThreadProc ctp = popFromCTPWorkList();
        CallGraphNode* cgNode = tcg->getCallGraphNode(ctp.getProc());
        if(isCandidateFun(cgNode->getFunction()) == false)
            continue;
 
        for(CallGraphNode::const_iterator nit = cgNode->OutEdgeBegin(), neit = cgNode->OutEdgeEnd(); nit!=neit; nit++)
        {
            const CallGraphEdge* cgEdge = (*nit);
 
            for(CallGraphEdge::CallInstSet::const_iterator cit = cgEdge->directCallsBegin(),
                    ecit = cgEdge->directCallsEnd(); cit!=ecit; ++cit)
            {
                DBOUT(DMTA,outs() << "\nTCT handling direct call:" << **cit << "\t" << cgEdge->getSrcNode()->getFunction()->getName() << "-->" << cgEdge->getDstNode()->getFunction()->getName() << "\n");
                handleCallRelation(ctp,cgEdge,*cit);
            }
            for(CallGraphEdge::CallInstSet::const_iterator ind = cgEdge->indirectCallsBegin(),
                    eind = cgEdge->indirectCallsEnd(); ind!=eind; ++ind)
            {
                DBOUT(DMTA,outs() << "\nTCT handling indirect call:" << **ind << "\t" << cgEdge->getSrcNode()->getFunction()->getName() << "-->" << cgEdge->getDstNode()->getFunction()->getName() << "\n");
                handleCallRelation(ctp,cgEdge,*ind);
            }
        }
    }
 
    collectMultiForkedThreads();
 
    if (Options::TCTDotGraph())
    {
        print();
        dump("tct");
    }
 
}

◆ collectEntryFunInCallGraph()

void TCT::collectEntryFunInCallGraph ( )

protectedvirtual

Get entry functions that are neither called by other functions nor extern functions.

Get entry function, i.e., functions without callers, e.g., main function

Reimplemented in SVF::SlicedTCT.

Definition at line 209 of file TCT.cpp.

{
    const CallGraph* svfirCallGraph = PAG::getPAG()->getCallGraph();
    for (const auto& item: *svfirCallGraph)
    {
        const FunObjVar* fun = item.second->getFunction();
        if (SVFUtil::isExtCall(fun))
            continue;
        CallGraphNode* node = tcg->getCallGraphNode(fun);
        if (!node->hasIncomingEdge())
        {
            entryFuncSet.insert(fun);
        }
    }
    assert(!entryFuncSet.empty() && "Can't find any function in module!");
}

◆ collectLoopInfoForJoin()

void TCT::collectLoopInfoForJoin ( )

protectedvirtual

Handle join site in loop.

collect loop info for join sites

Collect loop info for join sites the in-loop join site must be joined if the loop is executed

Reimplemented in SVF::SlicedTCT.

Definition at line 340 of file TCT.cpp.

{
    for(ThreadCallGraph::CallSiteSet::const_iterator it = tcg->joinsitesBegin(), eit = tcg->joinsitesEnd(); it!=eit; ++it)
    {
        const ICFGNode* join = *it;
        const FunObjVar* svffun = join->getFun();
        const SVFBasicBlock* svfbb = join->getBB();
 
        if(svffun->hasLoopInfo(svfbb))
        {
            const LoopBBs& lp = svffun->getLoopInfo(svfbb);
            if(!lp.empty() && isJoinMustExecutedInLoop(lp,join))
            {
                joinSiteToLoopMap[join] = lp;
            }
        }
 
        if(isInRecursion(join))
            inRecurJoinSites.insert(join);
    }
}

◆ collectMultiForkedThreads()

void TCT::collectMultiForkedThreads ( )

protected

Collect multi-forked threads whose 1, cxt is in loop or recursion; 2, parent thread is a multi-forked thread.

Collect all multi-forked threads

Definition at line 229 of file TCT.cpp.

{
    if (this->nodeNum == 0 )
        return;
 
    FIFOWorkList<TCTNode*> worklist;
    worklist.push(getTCTNode(0));
 
    while(!worklist.empty())
    {
        TCTNode* node = worklist.pop();
        const CxtThread &ct = node->getCxtThread();
 
        if(ct.isIncycle() || ct.isInloop())
        {
            node->setMultiforked(true);
        }
        else
        {
            for (TCT::ThreadCreateEdgeSet::const_iterator it = node->getInEdges().begin(), eit = node->getInEdges().end(); it != eit;
                    ++it)
            {
                if ((*it)->getSrcNode()->isMultiforked())
                    node->setMultiforked(true);
            }
        }
        for (TCT::ThreadCreateEdgeSet::const_iterator it = node->getOutEdges().begin(), eit = node->getOutEdges().end(); it != eit;
                ++it)
        {
            worklist.push((*it)->getDstNode());
        }
    }
}

◆ createDummyForkSite()

ICFGNode * SVF::TCT::createDummyForkSite ( )

inlineprotected

Create and get a new dummy fork site for starter routines.

Definition at line 595 of file TCT.h.

    {
        ICFGNode* dummyForkSite = new ICFGNode(dummyForkICFGNodeID--, SVFValue::GlobalBlock);
        dummyForkSites.insert(dummyForkSite);
        return dummyForkSite;
    }

◆ dump()

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

Dump the graph.

Dump call graph into dot file

Definition at line 559 of file TCT.cpp.

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

◆ dumpCxt()

void TCT::dumpCxt ( CallStrCxt & cxt )

Dump calling context.

Dump calling context information

Definition at line 541 of file TCT.cpp.

{
    std::string str;
    std::stringstream rawstr(str);
    rawstr << "[:";
    for(CallStrCxt::const_iterator it = cxt.begin(), eit = cxt.end(); it!=eit; ++it)
    {
        rawstr << " ' "<< *it << " ' ";
        rawstr << (tcg->getCallSite(*it))->valueOnlyToString();
        rawstr << "  call  " << tcg->getCallSite(*it)->getCaller()->getName() << "-->" << tcg->getCalleeOfCallSite(*it)->getName() << ", \n";
    }
    rawstr << " ]";
    outs() << "max cxt = " << cxt.size() << rawstr.str() << "\n";
}

◆ getAncestorThreads()

const NodeBS SVF::TCT::getAncestorThreads ( NodeID tid ) const

inline

Get all ancestor threads.

Definition at line 330 of file TCT.h.

    {
        NodeBS tds;
        if(hasParentThread(tid) == false)
            return tds;
 
        FIFOWorkList<NodeID> worklist;
        for(NodeID parentTid : getParentThreads(tid))
            worklist.push(parentTid);
 
        while(!worklist.empty())
        {
            NodeID t = worklist.pop();
            if(tds.test_and_set(t))
            {
                if(hasParentThread(t))
                    for(NodeID parentTid : getParentThreads(t))
                        worklist.push(parentTid);
            }
        }
        return tds;
    }

◆ getChildrenBegin()

ThreadCreateEdgeSet::const_iterator SVF::TCT::getChildrenBegin ( const TCTNode * node ) const

inline

Get children and parent nodes.

Definition at line 214 of file TCT.h.

    {
        return node->OutEdgeBegin();
    }

◆ getChildrenEnd()

ThreadCreateEdgeSet::const_iterator SVF::TCT::getChildrenEnd ( const TCTNode * node ) const

inline

Definition at line 218 of file TCT.h.

    {
        return node->OutEdgeEnd();
    }

◆ getCxtOfCxtThread()

const CallStrCxtSet & SVF::TCT::getCxtOfCxtThread ( const CxtThread & ct ) const

inline

get the contexts of a thread at its spawning sites (fork sites)

Definition at line 374 of file TCT.h.

    {
        CxtThreadToForkCxtSet::const_iterator it = ctToForkCxtsMap.find(ct);
        assert(it!=ctToForkCxtsMap.end() && "Cxt Thread not found!!");
        return it->second;
    }

◆ getEntryProcs()

const FunSet & SVF::TCT::getEntryProcs ( ) const

inline

Get marked candidate functions.

Definition at line 239 of file TCT.h.

    {
        return entryFuncSet;
    }

◆ getGraphEdge()

TCTEdge * TCT::getGraphEdge	(	TCTNode *	src,
		TCTNode *	dst,
		TCTEdge::CEDGEK	kind
	)

Get call graph edge via nodes.

get PTACallGraph edge via nodes

Definition at line 596 of file TCT.cpp.

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

◆ getJoinLoop()

LoopBBs & SVF::TCT::getJoinLoop ( const CallICFGNode * join )

inline

Get loop for join site.

Definition at line 390 of file TCT.h.

    {
        assert(tcg->getThreadAPI()->isTDJoin(join) && "not a join site");
        InstToLoopMap::iterator it = joinSiteToLoopMap.find(join);
        assert(it!=joinSiteToLoopMap.end() && "loop not found");
        return it->second;
    }

◆ getLoop() [1/2]

const LoopBBs & SVF::TCT::getLoop ( const ICFGNode * inst )

Get loop for an instruction.

◆ getLoop() [2/2]

const TCT::LoopBBs & TCT::getLoop ( const SVFBasicBlock * bb )

Get loop for fork/join site.

Get loop for fork/join site

Definition at line 400 of file TCT.cpp.

{
    const FunObjVar* fun = bb->getParent();
    return fun->getLoopInfo(bb);
}

◆ getMakredProcs()

const FunSet & SVF::TCT::getMakredProcs ( ) const

inline

Get marked candidate functions.

Definition at line 233 of file TCT.h.

    {
        return candidateFuncSet;
    }

◆ getMaxCxtSize()

u32_t SVF::TCT::getMaxCxtSize ( ) const

inline

Definition at line 254 of file TCT.h.

    {
        return MaxCxtSize;
    }

◆ getOrCreateTCTNode()

TCTNode * SVF::TCT::getOrCreateTCTNode	(	const CallStrCxt &	cxt,
		const ICFGNode *	fork,
		const CxtThreadProc &	forkSiteCtp,
		const FunObjVar *	routine
	)

inlineprotected

Get or create a tct node based on CxtThread.

Definition at line 537 of file TCT.h.

    {
        CxtThread ct(cxt,fork);
        CxtThreadToNodeMap::const_iterator it = ctpToNodeMap.find(ct);
        if(it!=ctpToNodeMap.end())
        {
            // A second spawn context merged onto this truncated CxtThread: the
            // node stands for multiple dynamic instances, so mark it multiforked.
            if (addCxtOfCxtThread(forkSiteCtp.getTid(), forkSiteCtp.getContext(), ct))
                it->second->setMultiforked(true);
            return it->second;
        }
 
        addCxtOfCxtThread(forkSiteCtp.getTid(), forkSiteCtp.getContext(), ct);
        addStartRoutineOfCxtThread(routine,ct);
 
        setMultiForkedAttrs(ct);
        return addTCTNode(ct);
    }

◆ getParentsBegin()

ThreadCreateEdgeSet::const_iterator SVF::TCT::getParentsBegin ( const TCTNode * node ) const

inline

Definition at line 222 of file TCT.h.

    {
        return node->InEdgeBegin();
    }

◆ getParentsEnd()

ThreadCreateEdgeSet::const_iterator SVF::TCT::getParentsEnd ( const TCTNode * node ) const

inline

Definition at line 226 of file TCT.h.

    {
        return node->InEdgeEnd();
    }

◆ getParentThreads()

NodeBS SVF::TCT::getParentThreads ( NodeID tid ) const

inline

Get parent threads.

Definition at line 317 of file TCT.h.

    {
        NodeBS parentTds;
        const TCTNode* node = getTCTNode(tid);
        assert(node->getInEdges().size()>=1 && "does not have a parent thread");
 
        for (const TCTEdge* edge : node->getInEdges())
        {
            parentTds.set(edge->getSrcID());
        }
        return parentTds;
    }

◆ getPTA()

PointerAnalysis * SVF::TCT::getPTA ( ) const

inline

Get PTA.

Definition at line 198 of file TCT.h.

    {
        return pta;
    }

◆ getSiblingThread()

const NodeBS SVF::TCT::getSiblingThread ( NodeID tid ) const

inline

Get sibling threads.

Definition at line 353 of file TCT.h.

    {
        NodeBS tds;
        if(hasParentThread(tid) == false)
            return tds;
        for (NodeID parentTid : getParentThreads(tid))
        {
            const TCTNode* parentNode = getTCTNode(parentTid);
            for(ThreadCreateEdgeSet::const_iterator it = getChildrenBegin(parentNode),
                    eit = getChildrenEnd(parentNode); it!=eit; ++it)
            {
                NodeID child = (*it)->getDstNode()->getId();
                if(child!=tid)
                    tds.set(child);
            }
        }
        return tds;
    }

◆ getStartRoutineOfCxtThread()

const FunObjVar * SVF::TCT::getStartRoutineOfCxtThread ( const CxtThread & ct ) const

inline

get the start routine function of a thread

Definition at line 382 of file TCT.h.

    {
        CxtThreadToFun::const_iterator it = ctToRoutineFunMap.find(ct);
        assert(it!=ctToRoutineFunMap.end() && "Cxt Thread not found!!");
        return it->second;
    }

◆ getTCTEdgeNum()

u32_t SVF::TCT::getTCTEdgeNum ( ) const

inline

Definition at line 250 of file TCT.h.

    {
        return TCTEdgeNum;
    }

◆ getTCTNode() [1/2]

TCTNode * SVF::TCT::getTCTNode ( const CxtThread & ct ) const

inline

Definition at line 279 of file TCT.h.

    {
        CxtThreadToNodeMap::const_iterator it = ctpToNodeMap.find(ct);
        assert(it!=ctpToNodeMap.end() && "TCT node not found??");
        return it->second;
    }

◆ getTCTNode() [2/2]

TCTNode * SVF::TCT::getTCTNode ( NodeID id ) const

inline

Get TCT node.

Definition at line 203 of file TCT.h.

    {
        return getGNode(id);
    }

◆ getTCTNodeNum()

u32_t SVF::TCT::getTCTNodeNum ( ) const

inline

Get Statistics.

Definition at line 246 of file TCT.h.

    {
        return TCTNodeNum;
    }

◆ getThreadCallGraph()

ThreadCallGraph * SVF::TCT::getThreadCallGraph ( ) const

inline

Get TCG.

Definition at line 193 of file TCT.h.

    {
        return tcg;
    }

◆ handleCallRelation()

void TCT::handleCallRelation	(	CxtThreadProc &	ctp,
		const CallGraphEdge *	cgEdge,
		const CallICFGNode *	cs
	)

protectedvirtual

Handle call relations.

Handle call relations

handle calling context for candidate functions only

Create spawnee TCT node

Add TCT nodes and edge

Reimplemented in SVF::SlicedTCT.

Definition at line 267 of file TCT.cpp.

{
    const FunObjVar* callee = cgEdge->getDstNode()->getFunction();
 
    CallStrCxt cxt(ctp.getContext());
    CallStrCxt oldCxt = cxt;
    const CallICFGNode* callNode = cs;
 
    if(isCandidateFun(callNode->getFun()) == true)
        pushCxt(cxt,callNode,callee);
 
    if(cgEdge->getEdgeKind() == CallGraphEdge::CallRetEdge)
    {
        CxtThreadProc newctp(ctp.getTid(),cxt,callee);
        if(pushToCTPWorkList(newctp))
        {
            DBOUT(DMTA,outs() << "TCT Process CallRet old ctp --"; ctp.dump());
            DBOUT(DMTA,outs() << "TCT Process CallRet new ctp --"; newctp.dump());
        }
    }
 
    else if(cgEdge->getEdgeKind() == CallGraphEdge::TDForkEdge)
    {
        TCTNode* spawneeNode = getOrCreateTCTNode(cxt,callNode, ctp, callee);
        CxtThreadProc newctp(spawneeNode->getId(),cxt,callee);
 
        if(pushToCTPWorkList(newctp))
        {
            if(addTCTEdge(this->getTCTNode(ctp.getTid()), spawneeNode))
            {
                DBOUT(DMTA,outs() << "Add TCT Edge from thread " << ctp.getTid() << "  ";
                      this->getTCTNode(ctp.getTid())->getCxtThread().dump();
                      outs() << " to thread " << spawneeNode->getId() << "  ";
                      spawneeNode->getCxtThread().dump();
                      outs() << "\n" );
            }
            DBOUT(DMTA,outs() << "TCT Process Fork old ctp --"; ctp.dump());
            DBOUT(DMTA,outs() << "TCT Process Fork new ctp --"; newctp.dump());
        }
    }
}

◆ hasGraphEdge()

TCTEdge * TCT::hasGraphEdge	(	TCTNode *	src,
		TCTNode *	dst,
		TCTEdge::CEDGEK	kind
	)		const

Whether we have already created this call graph edge.

Whether we have already created this call graph edge

Definition at line 579 of file TCT.cpp.

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

◆ hasJoinLoop()

bool SVF::TCT::hasJoinLoop ( const CallICFGNode * join ) const

inline

Definition at line 398 of file TCT.h.

    {
        assert(tcg->getThreadAPI()->isTDJoin(join) && "not a join site");
        InstToLoopMap::const_iterator it = joinSiteToLoopMap.find(join);
        return it!=joinSiteToLoopMap.end();
    }

◆ hasLoop() [1/2]

bool SVF::TCT::hasLoop ( const ICFGNode * inst ) const

inline

Definition at line 410 of file TCT.h.

    {
        return hasLoop(inst->getBB());
    }

◆ hasLoop() [2/2]

bool SVF::TCT::hasLoop ( const SVFBasicBlock * bb ) const

inline

Definition at line 405 of file TCT.h.

    {
        const FunObjVar* fun = bb->getFunction();
        return fun->hasLoopInfo(bb);
    }

◆ hasParentThread()

bool SVF::TCT::hasParentThread ( NodeID tid ) const

inline

Get parent and sibling threads.

Has parent thread

Definition at line 311 of file TCT.h.

    {
        const TCTNode* node = getTCTNode(tid);
        return node->getInEdges().size()==1;
    }

◆ hasTCTNode()

bool SVF::TCT::hasTCTNode ( const CxtThread & ct ) const

inline

Find/Get TCT node.

Definition at line 275 of file TCT.h.

    {
        return ctpToNodeMap.find(ct)!=ctpToNodeMap.end();
    }

◆ inSameCallGraphSCC()

bool SVF::TCT::inSameCallGraphSCC	(	const CallGraphNode *	src,
		const CallGraphNode *	dst
	)

inline

Whether two functions in the same callgraph scc.

Definition at line 303 of file TCT.h.

    {
        return (tcgSCC->repNode(src->getId()) == tcgSCC->repNode(dst->getId()));
    }

◆ isCallSite()

bool SVF::TCT::isCallSite ( const ICFGNode * inst )

inline

Whether it is a callsite.

Definition at line 268 of file TCT.h.

    {
        return SVFUtil::isa<CallICFGNode>(inst);
    }

◆ isCandidateFun() [1/2]

bool SVF::TCT::isCandidateFun ( const CallGraph::FunctionSet & callees ) const

inline

Whether it is a candidate function for indirect call.

Definition at line 288 of file TCT.h.

    {
        for(CallGraph::FunctionSet::const_iterator cit = callees.begin(),
                ecit = callees.end(); cit!=ecit; cit++)
        {
            if(candidateFuncSet.find((*cit))!=candidateFuncSet.end())
                return true;
        }
        return false;
    }

◆ isCandidateFun() [2/2]

bool SVF::TCT::isCandidateFun ( const FunObjVar * fun ) const

inline

Definition at line 298 of file TCT.h.

    {
        return candidateFuncSet.find(fun)!=candidateFuncSet.end();
    }

◆ isContextSuffix()

bool TCT::isContextSuffix	(	const CallStrCxt &	lhs,
		const CallStrCxt &	call
	)

If lhs is a suffix of rhs, including equal.

If lhs is a suffix of rhs, including equal

Definition at line 521 of file TCT.cpp.

{
    if (lhs.size() > call.size())
        return false;
    bool isSuffix = true;
    for (size_t i = 0; i < lhs.size(); ++i)
    {
        if (lhs[lhs.size() - 1 - i] != call[call.size() - 1 - i])
        {
            isSuffix = false;
            break;
        }
    }
    return isSuffix;
}

◆ isExtCall()

bool SVF::TCT::isExtCall ( const ICFGNode * inst )

inline

Whether it is calling an external function.

Definition at line 261 of file TCT.h.

    {
        if(const CallICFGNode* call = SVFUtil::dyn_cast<CallICFGNode>(inst))
            return SVFUtil::isExtCall(call);
        return false;
    }

◆ isInLoopInstruction()

bool TCT::isInLoopInstruction ( const ICFGNode * inst )

protected

Multi-forked threads.

Whether an instruction is in a loop

An instruction i is in loop (1) the instruction i itself (2) all the callsites invoke the function where i resides in

Definition at line 68 of file TCT.cpp.

{
    assert(inst && "null value instruction!!");
 
    Set<const ICFGNode*> insts;
    FIFOWorkList<const ICFGNode*> worklist;
    worklist.push(inst);
 
    while(!worklist.empty())
    {
        const ICFGNode* inst = worklist.pop();
        insts.insert(inst);
        CallGraphNode* cgnode = tcg->getCallGraphNode(inst->getFun());
        for(CallGraphNode::const_iterator nit = cgnode->InEdgeBegin(), neit = cgnode->InEdgeEnd(); nit!=neit; nit++)
        {
            for(CallGraphEdge::CallInstSet::const_iterator cit = (*nit)->directCallsBegin(),
                    ecit = (*nit)->directCallsEnd(); cit!=ecit; ++cit)
            {
                if(insts.insert(*cit).second)
                    worklist.push(*cit);
            }
            for(CallGraphEdge::CallInstSet::const_iterator cit = (*nit)->indirectCallsBegin(),
                    ecit = (*nit)->indirectCallsEnd(); cit!=ecit; ++cit)
            {
                if(insts.insert(*cit).second)
                    worklist.push(*cit);
            }
        }
    }
 
    for(const ICFGNode* i : insts)
    {
        if(i->getFun()->hasLoopInfo(i->getBB()))
            return true;
    }
 
 
    return false;
}

◆ isInRecursion()

bool TCT::isInRecursion ( const ICFGNode * inst ) const

protected

Whether an instruction is in a recursion.

An instruction i is in a recursion (1) the function f where i resides in is in a recursion (2) any caller function starting from the function f in is in a recursion

Definition at line 113 of file TCT.cpp.

{
    const FunObjVar* f = inst->getFun();
    FIFOWorkList<const FunObjVar*> worklist;
    Set<const FunObjVar*> visits;
    worklist.push(f);
 
    while(!worklist.empty())
    {
        const FunObjVar* svffun = worklist.pop();
        visits.insert(svffun);
        if(tcgSCC->isInCycle(tcg->getCallGraphNode(svffun)->getId()))
            return true;
 
        const CallGraphNode* cgnode = tcg->getCallGraphNode(svffun);
 
        for(CallGraphNode::const_iterator nit = cgnode->InEdgeBegin(), neit = cgnode->InEdgeEnd(); nit!=neit; nit++)
        {
            for(CallGraphEdge::CallInstSet::const_iterator cit = (*nit)->directCallsBegin(),
                    ecit = (*nit)->directCallsEnd(); cit!=ecit; ++cit)
            {
                const FunObjVar* caller = (*cit)->getFun();
                if(visits.find(caller)==visits.end())
                    worklist.push(caller);
            }
            for(CallGraphEdge::CallInstSet::const_iterator cit = (*nit)->indirectCallsBegin(),
                    ecit = (*nit)->indirectCallsEnd(); cit!=ecit; ++cit)
            {
                const FunObjVar* caller = (*cit)->getFun();
                if(visits.find(caller)==visits.end())
                    worklist.push(caller);
            }
        }
    }
 
    return false;
 
}

◆ isJoinMustExecutedInLoop()

bool TCT::isJoinMustExecutedInLoop	(	const LoopBBs &	lp,
		const ICFGNode *	join
	)

Return true if a join instruction must be executed inside a loop.

Return true if a join instruction must be executed inside a loop joinbb should post dominate the successive basic block of a loop header

Definition at line 316 of file TCT.cpp.

{
    assert(!lp.empty() && "this is not a loop, empty basic block");
    const FunObjVar* svffun = join->getFun();
    const SVFBasicBlock* loopheadbb = svffun->getLoopHeader(lp);
    const SVFBasicBlock* joinbb = join->getBB();
    assert(loopheadbb->getParent()==joinbb->getParent() && "should inside same function");
 
    for (const SVFBasicBlock* svf_scc_bb : loopheadbb->getSuccessors())
    {
        if(svffun->loopContainsBB(lp,svf_scc_bb))
        {
            if(svffun->dominate(joinbb,svf_scc_bb)==false)
                return false;
        }
    }
 
    return true;
}

◆ isJoinSiteInRecursion()

bool SVF::TCT::isJoinSiteInRecursion ( const CallICFGNode * join ) const

inline

Whether a join site is in recursion.

Definition at line 432 of file TCT.h.

    {
        assert(tcg->getThreadAPI()->isTDJoin(join) && "not a join site");
        return inRecurJoinSites.find(join)!=inRecurJoinSites.end();
    }

◆ isLoopExitOfJoinLoop()

bool TCT::isLoopExitOfJoinLoop ( const SVFBasicBlock * bb )

protected

Whether a given bb is an exit of a inloop join site.

Whether a given bb is an exit of a inloop join site

Definition at line 379 of file TCT.cpp.

{
    for(InstToLoopMap::const_iterator it = joinSiteToLoopMap.begin(), eit = joinSiteToLoopMap.end(); it!=eit; ++it)
    {
        std::vector<const SVFBasicBlock*> exitbbs;
        it->first->getFun()->getExitBlocksOfLoop(it->first->getBB(),exitbbs);
        while(!exitbbs.empty())
        {
            const SVFBasicBlock* eb = exitbbs.back();
            exitbbs.pop_back();
            if(eb == bb)
                return true;
        }
    }
 
    return false;
}

◆ isLoopHeaderOfJoinLoop()

bool TCT::isLoopHeaderOfJoinLoop ( const SVFBasicBlock * bb )

protected

Whether a given bb is a loop head of a inloop join site.

Return true if a given bb is a loop head of a inloop join site

Definition at line 365 of file TCT.cpp.

{
    for(InstToLoopMap::const_iterator it = joinSiteToLoopMap.begin(), eit = joinSiteToLoopMap.end(); it!=eit; ++it)
    {
        if(bb->getParent()->getLoopHeader(it->second) == bb)
            return true;
    }
 
    return false;
}

◆ isVisitedCTPs()

bool SVF::TCT::isVisitedCTPs ( const CxtThreadProc & ctp ) const

inlineprotected

Definition at line 618 of file TCT.h.

    {
        return visitedCTPs.find(ctp)!=visitedCTPs.end();
    }

◆ markRelProcs() [1/2]

void TCT::markRelProcs ( )

protectedvirtual

Mark relevant procedures that are backward reachable from any fork/join site.

Mark relevant procedures that are backward reachable from any fork/join site

Reimplemented in SVF::SlicedTCT.

Definition at line 155 of file TCT.cpp.

{
    for (ThreadCallGraph::CallSiteSet::const_iterator it = tcg->forksitesBegin(), eit = tcg->forksitesEnd(); it != eit; ++it)
    {
        const FunObjVar* svfun = (*it)->getParent()->getParent();
        markRelProcs(svfun);
 
        for(ThreadCallGraph::ForkEdgeSet::const_iterator nit = tcg->getForkEdgeBegin(*it), neit = tcg->getForkEdgeEnd(*it); nit!=neit; nit++)
        {
            const CallGraphNode* forkeeNode = (*nit)->getDstNode();
            candidateFuncSet.insert(forkeeNode->getFunction());
        }
 
    }
 
    for (ThreadCallGraph::CallSiteSet::const_iterator it = tcg->joinsitesBegin(), eit = tcg->joinsitesEnd(); it != eit; ++it)
    {
        const FunObjVar* svfun = (*it)->getParent()->getParent();
        markRelProcs(svfun);
    }
 
    if(candidateFuncSet.empty())
        writeWrnMsg("We didn't recognize any fork site, this is single thread program?");
}

◆ markRelProcs() [2/2]

void TCT::markRelProcs ( const FunObjVar * svffun )

protectedvirtual

Add relevant procedures that are backward reachable from svffun on Thread Call Graph

Reimplemented in SVF::SlicedTCT.

Definition at line 183 of file TCT.cpp.

{
    CallGraphNode* cgnode = tcg->getCallGraphNode(svffun);
    FIFOWorkList<const CallGraphNode*> worklist;
    PTACGNodeSet visited;
    worklist.push(cgnode);
    visited.insert(cgnode);
    while(!worklist.empty())
    {
        const CallGraphNode* node = worklist.pop();
        candidateFuncSet.insert(node->getFunction());
        for(CallGraphNode::const_iterator nit = node->InEdgeBegin(), neit = node->InEdgeEnd(); nit!=neit; nit++)
        {
            const CallGraphNode* srcNode = (*nit)->getSrcNode();
            if(visited.find(srcNode)==visited.end())
            {
                visited.insert(srcNode);
                worklist.push(srcNode);
            }
        }
    }
}

◆ matchAndPopCxt()

bool TCT::matchAndPopCxt	(	CallStrCxt &	cxt,
		const CallICFGNode *	call,
		const FunObjVar *	callee
	)

Match context.

Match calling context

handle calling context for candidate functions only

partial match

Definition at line 493 of file TCT.cpp.

{
    const FunObjVar* caller = call->getFun();
    CallSiteID csId = tcg->getCallSiteID(call, callee);
 
    if(isCandidateFun(caller) == false)
        return true;
 
    if(cxt.empty())
        return true;
 
    if(inSameCallGraphSCC(tcg->getCallGraphNode(caller),tcg->getCallGraphNode(callee))==false)
    {
        if(cxt.back() == csId)
            cxt.pop_back();
        else
            return false;
        DBOUT(DMTA,dumpCxt(cxt));
    }
 
    return true;
}

◆ popFromCTPWorkList()

CxtThreadProc SVF::TCT::popFromCTPWorkList ( )

inlineprotected

Definition at line 613 of file TCT.h.

    {
        CxtThreadProc ctp = ctpList.pop();
        return ctp;
    }

◆ print()

void TCT::print ( ) const

Print TCT information.

Print TCT information

Definition at line 567 of file TCT.cpp.

{
    for(TCT::const_iterator it = this->begin(), eit = this->end(); it!=eit; ++it)
    {
        outs() << "TID " << it->first << "\t";
        it->second->getCxtThread().dump();
    }
}

◆ pushCxt()

void TCT::pushCxt	(	CallStrCxt &	cxt,
		const CallICFGNode *	call,
		const FunObjVar *	callee
	)

virtual

Context helper functions.

Push calling context

Push calling context, with k limiting

Reimplemented in SVF::SlicedTCT.

Definition at line 473 of file TCT.cpp.

{
    const FunObjVar* caller = call->getFun();
    CallSiteID csId = tcg->getCallSiteID(call, callee);
 
    if(inSameCallGraphSCC(tcg->getCallGraphNode(caller),tcg->getCallGraphNode(callee))==false)
    {
        cxt.push_back(csId);
        if (cxt.size() > Options::MaxContextLen())
            cxt.erase(cxt.begin());
        if (cxt.size() > MaxCxtSize)
            MaxCxtSize = cxt.size();
        DBOUT(DMTA,dumpCxt(cxt));
    }
}

◆ pushToCTPWorkList()

bool SVF::TCT::pushToCTPWorkList ( const CxtThreadProc & ctp )

inlineprotected

WorkList helper functions.

Definition at line 604 of file TCT.h.

    {
        if(isVisitedCTPs(ctp)==false)
        {
            visitedCTPs.insert(ctp);
            return ctpList.push(ctp);
        }
        return false;
    }

◆ reset()

void SVF::TCT::reset ( )

inlineprotected

Free the built graph and clear all bookkeeping so build() can run again from a clean state (SlicedTCT rebuilds the tree over a sliced view).

Definition at line 483 of file TCT.h.

    {
        destroy();
        IDToNodeMap.clear();
        ctpToNodeMap.clear();
        ctToForkCxtsMap.clear();
        ctToRoutineFunMap.clear();
        candidateFuncSet.clear();
        entryFuncSet.clear();
        joinSiteToLoopMap.clear();
        inRecurJoinSites.clear();
        ctpList.clear();
        visitedCTPs.clear();
        TCTNodeNum = 0;
        TCTEdgeNum = 0;
        MaxCxtSize = 0;
    }

◆ setMultiForkedAttrs()

void SVF::TCT::setMultiForkedAttrs ( CxtThread & ct )

inlineprotected

Set multi-forked thread attributes.

non-main thread spawned at a real fork site. The main thread uses a synthetic dummy fork site (see createDummyForkSite); it has no real function/call-graph node, is never in a loop or recursion, and must be treated like the null (main) case – otherwise isInLoopInstruction would look up a call-graph node that does not exist.

main thread (null or dummy fork site)

Definition at line 559 of file TCT.h.

    {
        if(ct.getThread() != nullptr &&
                dummyForkSites.find(ct.getThread()) == dummyForkSites.end())
        {
            const ICFGNode* svfInst = ct.getThread();
            ct.setInloop(isInLoopInstruction(svfInst));
            ct.setIncycle(isInRecursion(svfInst));
        }
        else
        {
            ct.setInloop(false);
            ct.setIncycle(false);
        }
    }

Member Data Documentation

◆ candidateFuncSet

FunSet SVF::TCT::candidateFuncSet

protected

Procedures that are neither called by other functions nor extern functions.

Definition at line 625 of file TCT.h.

◆ ctpList

CxtThreadProcVec SVF::TCT::ctpList

protected

Thread call graph SCC.

Definition at line 627 of file TCT.h.

◆ ctpToNodeMap

CxtThreadToNodeMap SVF::TCT::ctpToNodeMap

protected

Record all visited ctps.

Definition at line 629 of file TCT.h.

◆ ctToForkCxtsMap

CxtThreadToForkCxtSet SVF::TCT::ctToForkCxtsMap

protected

Map a ctp to its graph node.

Definition at line 630 of file TCT.h.

◆ ctToRoutineFunMap

CxtThreadToFun SVF::TCT::ctToRoutineFunMap

protected

Map a CxtThread to the context at its spawning site (fork site).

Definition at line 631 of file TCT.h.

◆ dummyForkICFGNodeID

NodeID SVF::TCT::dummyForkICFGNodeID = UINT32_MAX

protected

unique ID generator for dummy

Definition at line 635 of file TCT.h.

◆ dummyForkSites

DummyForkSiteSet SVF::TCT::dummyForkSites

protected

set of dummy fork sites for starter routines

Definition at line 634 of file TCT.h.

◆ entryFuncSet

FunSet SVF::TCT::entryFuncSet

protected

Definition at line 624 of file TCT.h.

◆ inRecurJoinSites

Set<const ICFGNode*> SVF::TCT::inRecurJoinSites

protected

Fork or Join sites in recursions.

Definition at line 633 of file TCT.h.

◆ joinSiteToLoopMap

InstToLoopMap SVF::TCT::joinSiteToLoopMap

protected

Map a CxtThread to its start routine function.

map an inloop join to its loop class

Definition at line 632 of file TCT.h.

◆ MaxCxtSize

u32_t SVF::TCT::MaxCxtSize

protected

Definition at line 451 of file TCT.h.

◆ pta

PointerAnalysis* SVF::TCT::pta

protected

Definition at line 448 of file TCT.h.

◆ tcg

ThreadCallGraph* SVF::TCT::tcg

protected

Definition at line 447 of file TCT.h.

◆ tcgSCC

ThreadCallGraphSCC* SVF::TCT::tcgSCC

protected

Procedures we care about during call graph traversing when creating TCT.

Definition at line 626 of file TCT.h.

◆ TCTEdgeNum

u32_t SVF::TCT::TCTEdgeNum

protected

Definition at line 450 of file TCT.h.

◆ TCTNodeNum

u32_t SVF::TCT::TCTNodeNum

protected

Definition at line 449 of file TCT.h.

◆ visitedCTPs

CxtThreadProcSet SVF::TCT::visitedCTPs

protected

CxtThreadProc List.

Definition at line 628 of file TCT.h.

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

/home/runner/work/SVF/SVF/svf/include/MTA/TCT.h
/home/runner/work/SVF/SVF/svf/lib/MTA/TCT.cpp

Classes

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ CallStrCxtSet

◆ CxtThreadProcSet

◆ CxtThreadProcVec

◆ CxtThreadToForkCxtSet

◆ CxtThreadToFun

◆ CxtThreadToNodeMap

◆ DummyForkSiteSet

◆ FunSet

◆ InstSet

◆ InstToLoopMap

◆ InstVec

◆ LoopBBs

◆ PTACGNodeSet

◆ TCTNodeIter

◆ ThreadCallGraphSCC

◆ ThreadCreateEdgeSet

Constructor & Destructor Documentation

◆ TCT()

◆ ~TCT()

Member Function Documentation

◆ addCxtOfCxtThread()

◆ addStartRoutineOfCxtThread()

◆ addTCTEdge()

◆ addTCTNode()

◆ build()

◆ collectEntryFunInCallGraph()

◆ collectLoopInfoForJoin()

◆ collectMultiForkedThreads()

◆ createDummyForkSite()

◆ dump()

◆ dumpCxt()

◆ getAncestorThreads()

◆ getChildrenBegin()

◆ getChildrenEnd()

◆ getCxtOfCxtThread()

◆ getEntryProcs()

◆ getGraphEdge()

◆ getJoinLoop()

◆ getLoop() [1/2]

◆ getLoop() [2/2]

◆ getMakredProcs()

◆ getMaxCxtSize()

◆ getOrCreateTCTNode()

◆ getParentsBegin()

◆ getParentsEnd()

◆ getParentThreads()

◆ getPTA()

◆ getSiblingThread()

◆ getStartRoutineOfCxtThread()

◆ getTCTEdgeNum()

◆ getTCTNode() [1/2]

◆ getTCTNode() [2/2]

◆ getTCTNodeNum()

◆ getThreadCallGraph()

◆ handleCallRelation()

◆ hasGraphEdge()

◆ hasJoinLoop()

◆ hasLoop() [1/2]

◆ hasLoop() [2/2]

◆ hasParentThread()

◆ hasTCTNode()

◆ inSameCallGraphSCC()

◆ isCallSite()

◆ isCandidateFun() [1/2]

◆ isCandidateFun() [2/2]

◆ isContextSuffix()

◆ isExtCall()

◆ isInLoopInstruction()

◆ isInRecursion()

◆ isJoinMustExecutedInLoop()

◆ isJoinSiteInRecursion()

◆ isLoopExitOfJoinLoop()