Home
last modified time | relevance | path

Searched refs:SCCMap (Results 1 – 2 of 2) sorted by relevance

/external/llvm/lib/Analysis/
DLazyCallGraph.cpp137 SCCMap(std::move(G.SCCMap)), LeafSCCs(std::move(G.LeafSCCs)), in LazyCallGraph()
150 SCCMap = std::move(G.SCCMap); in operator =()
162 G->SCCMap[&N] = this; in insert()
184 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC."); in insertIntraSCCEdge()
185 assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC."); in insertIntraSCCEdge()
194 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC."); in insertOutgoingEdge()
196 SCC &CalleeC = *G->SCCMap.lookup(&CalleeN); in insertOutgoingEdge()
210 assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC."); in insertIncomingEdge()
212 SCC &CallerC = *G->SCCMap.lookup(&CallerN); in insertIncomingEdge()
301 SCC &ChildC = *G->SCCMap.lookup(&ChildN); in insertIncomingEdge()
[all …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h425 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC()
486 DenseMap<Node *, SCC *> SCCMap; variable