Home
last modified time | relevance | path

Searched refs:lookupSCC (Results 1 – 15 of 15) sorted by relevance

/external/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp448 EXPECT_EQ(&C, CG.lookupSCC(N1)); in TEST()
449 EXPECT_EQ(&C, CG.lookupSCC(N2)); in TEST()
450 EXPECT_EQ(&C, CG.lookupSCC(N3)); in TEST()
451 EXPECT_EQ(&C, CG.lookupSCC(N4)); in TEST()
452 EXPECT_EQ(&C, CG.lookupSCC(N5)); in TEST()
487 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
488 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
489 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
490 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
518 EXPECT_EQ(&AC, CG.lookupSCC(A)); in TEST()
[all …]
/external/llvm-project/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp576 EXPECT_EQ(&C, CG.lookupSCC(N1)); in TEST()
577 EXPECT_EQ(&C, CG.lookupSCC(N2)); in TEST()
578 EXPECT_EQ(&C, CG.lookupSCC(N3)); in TEST()
579 EXPECT_EQ(&C, CG.lookupSCC(N4)); in TEST()
580 EXPECT_EQ(&C, CG.lookupSCC(N5)); in TEST()
616 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
617 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
618 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
619 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
659 EXPECT_EQ(&AC, CG.lookupSCC(A)); in TEST()
[all …]
DCGSCCPassManagerTest.cpp1005 *CGAM.getCachedResult<TestSCCAnalysis>(*CG.lookupSCC(*CG.lookup(F))); in run()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DCGSCCPassManager.cpp386 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); in incorporateNewSCCRange()
509 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForFunctionPass()
529 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForFunctionPass()
556 assert(G.lookupSCC(N) == C && "Changed the SCC when splitting RefSCCs!"); in updateCGAndAnalysisManagerForFunctionPass()
579 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForFunctionPass()
608 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForFunctionPass()
655 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); in updateCGAndAnalysisManagerForFunctionPass()
DLazyCallGraph.cpp238 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
256 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) in isParentOf()
278 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
340 SCC &TargetSCC = *G->lookupSCC(E.getNode()); in verify()
542 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
543 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
576 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) in switchInternalEdgeToCall()
607 SCC &EdgeC = *G->lookupSCC(E.getNode()); in switchInternalEdgeToCall()
693 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && in switchTrivialInternalEdgeToRef()
716 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
[all …]
/external/llvm-project/llvm/lib/Analysis/
DLazyCallGraph.cpp250 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
268 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) in isParentOf()
290 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
352 SCC &TargetSCC = *G->lookupSCC(E.getNode()); in verify()
554 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
555 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
588 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) in switchInternalEdgeToCall()
619 SCC &EdgeC = *G->lookupSCC(E.getNode()); in switchInternalEdgeToCall()
705 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && in switchTrivialInternalEdgeToRef()
728 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
[all …]
DCGSCCPassManager.cpp545 if (CG.lookupSCC(*N) != CurrentC) in run()
578 assert(CG.lookupSCC(*N) == CurrentC && in run()
855 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); in incorporateNewSCCRange()
992 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass()
1003 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass()
1029 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForPass()
1049 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass()
1076 assert(G.lookupSCC(N) == C && "Changed the SCC when splitting RefSCCs!"); in updateCGAndAnalysisManagerForPass()
1099 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass()
1133 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass()
[all …]
/external/llvm-project/llvm/lib/Transforms/Utils/
DCallGraphUpdater.cpp57 auto *DeadSCC = LCG->lookupSCC(N); in finalize()
94 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp190 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
236 SCC &TargetSCC = *G->lookupSCC(*E.getNode()); in verify()
270 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
271 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
349 if (ConnectedSet.count(G->lookupSCC(*E.getNode()))) in switchInternalEdgeToCall()
412 SCC &EdgeC = *G->lookupSCC(*E.getNode()); in switchInternalEdgeToCall()
485 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToRef()
486 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
584 if (G->lookupSCC(ChildN) == &OldSCC) { in switchInternalEdgeToRef()
997 SCC &TargetC = *G->lookupSCC(TargetN); in removeInternalRefEdge()
[all …]
/external/llvm-project/llvm/lib/Transforms/IPO/
DInliner.cpp791 if (CG.lookupSCC(N) != C) in run()
827 if (CG.lookupSCC(*CG.lookup(Callee)) == C && in run()
966 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
985 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF)); in run()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DInliner.cpp979 if (CG.lookupSCC(N) != C) in run()
1042 if (CG.lookupSCC(*CG.lookup(Callee)) == C && in run()
1193 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
1212 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF)); in run()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DCGSCCPassManager.h478 if (CG.lookupSCC(*N) != CurrentC)
508 CG.lookupSCC(*N) == CurrentC &&
DLazyCallGraph.h970 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC() function
977 if (SCC *C = lookupSCC(N)) in lookupRefSCC()
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h782 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC() function
789 if (SCC *C = lookupSCC(N)) in lookupRefSCC()
/external/llvm-project/llvm/include/llvm/Analysis/
DLazyCallGraph.h973 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC() function
980 if (SCC *C = lookupSCC(N)) in lookupRefSCC()