Home
last modified time | relevance | path

Searched refs:OuterRefSCC (Results 1 – 4 of 4) sorted by relevance

/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h353 RefSCC *OuterRefSCC; variable
357 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() argument
358 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} in SCC()
361 OuterRefSCC = nullptr; in clear()
411 RefSCC &getOuterRefSCC() const { return *OuterRefSCC; } in getOuterRefSCC()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DLazyCallGraph.h435 RefSCC *OuterRefSCC; variable
439 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() argument
440 : OuterRefSCC(&OuterRefSCC), Nodes(std::forward<NodeRangeT>(Nodes)) {} in SCC()
443 OuterRefSCC = nullptr; in clear()
493 RefSCC &getOuterRefSCC() const { return *OuterRefSCC; } in getOuterRefSCC()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DLazyCallGraph.cpp220 assert(OuterRefSCC && "Can't have a null RefSCC!"); in verify()
225 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
243 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) in isParentOf()
254 LazyCallGraph &G = *OuterRefSCC->G; in isAncestorOf()
1053 InnerC.OuterRefSCC = this; in insertIncomingRefEdge()
1332 C->OuterRefSCC = &RC; in removeInternalRefEdge()
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp185 assert(OuterRefSCC && "Can't have a null RefSCC!"); in verify()
190 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
855 InnerC.OuterRefSCC = this; in insertIncomingRefEdge()
1170 C->OuterRefSCC = &RC; in removeInternalRefEdge()