Home
last modified time | relevance | path

Searched refs:lookupRefSCC (Results 1 – 7 of 7) sorted by relevance

/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp565 EXPECT_EQ(&RC, CG.lookupRefSCC(N1)); in TEST()
566 EXPECT_EQ(&RC, CG.lookupRefSCC(N2)); in TEST()
567 EXPECT_EQ(&RC, CG.lookupRefSCC(N3)); in TEST()
568 EXPECT_EQ(&RC, CG.lookupRefSCC(N4)); in TEST()
569 EXPECT_EQ(&RC, CG.lookupRefSCC(N5)); in TEST()
618 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()
619 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()
620 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()
621 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()
661 EXPECT_EQ(&ARC, CG.lookupRefSCC(A)); in TEST()
[all …]
/external/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp439 EXPECT_EQ(&RC, CG.lookupRefSCC(N1)); in TEST()
440 EXPECT_EQ(&RC, CG.lookupRefSCC(N2)); in TEST()
441 EXPECT_EQ(&RC, CG.lookupRefSCC(N3)); in TEST()
442 EXPECT_EQ(&RC, CG.lookupRefSCC(N4)); in TEST()
443 EXPECT_EQ(&RC, CG.lookupRefSCC(N5)); in TEST()
491 LazyCallGraph::RefSCC &ARC = *CG.lookupRefSCC(A); in TEST()
492 LazyCallGraph::RefSCC &BRC = *CG.lookupRefSCC(B); in TEST()
493 LazyCallGraph::RefSCC &CRC = *CG.lookupRefSCC(C); in TEST()
494 LazyCallGraph::RefSCC &DRC = *CG.lookupRefSCC(D); in TEST()
522 EXPECT_EQ(&ARC, CG.lookupRefSCC(A)); in TEST()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DLazyCallGraph.cpp346 if (G->lookupRefSCC(E.getNode()) == &RC) in isParentOf()
368 auto *ChildRC = G->lookupRefSCC(E.getNode()); in isAncestorOf()
676 assert(G->lookupRefSCC(SourceN) == this && in switchTrivialInternalEdgeToRef()
678 assert(G->lookupRefSCC(TargetN) == this && in switchTrivialInternalEdgeToRef()
698 assert(G->lookupRefSCC(SourceN) == this && in switchInternalEdgeToRef()
700 assert(G->lookupRefSCC(TargetN) == this && in switchInternalEdgeToRef()
878 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToCall()
879 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToCall()
882 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToCall()
900 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToRef()
[all …]
DCGSCCPassManager.cpp538 assert(G.lookupRefSCC(N) == RC && "Failed to update current RefSCC!"); in updateCGAndAnalysisManagerForFunctionPass()
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp676 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToCall()
677 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToCall()
679 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToCall()
696 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToRef()
697 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToRef()
699 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToRef()
714 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in insertInternalRefEdge()
715 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); in insertInternalRefEdge()
730 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in insertOutgoingEdge()
732 RefSCC &TargetC = *G->lookupRefSCC(TargetN); in insertOutgoingEdge()
[all …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h788 RefSCC *lookupRefSCC(Node &N) const { in lookupRefSCC() function
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DLazyCallGraph.h975 RefSCC *lookupRefSCC(Node &N) const { in lookupRefSCC() function