Home
last modified time | relevance | path

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

/openbsd/src/gnu/llvm/llvm/lib/Analysis/
DCGSCCPassManager.cpp529 if (CG.lookupSCC(*N) != CurrentC) in run()
562 assert(CG.lookupSCC(*N) == CurrentC && in run()
834 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); in incorporateNewSCCRange()
962 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass()
975 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass()
1003 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForPass()
1021 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass()
1047 assert(G.lookupSCC(N) == C && "Changed the SCC when splitting RefSCCs!"); in updateCGAndAnalysisManagerForPass()
1069 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass()
1105 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass()
[all …]
DLazyCallGraph.cpp246 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
282 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) in isParentOf()
304 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
364 SCC &TargetSCC = *G->lookupSCC(E.getNode()); in verify()
587 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
588 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
621 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) in switchInternalEdgeToCall()
652 SCC &EdgeC = *G->lookupSCC(E.getNode()); in switchInternalEdgeToCall()
734 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && in switchTrivialInternalEdgeToRef()
753 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Utils/
DCallGraphUpdater.cpp59 auto *DeadSCC = LCG->lookupSCC(N); in finalize()
96 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/IPO/
DInliner.cpp851 if (CG.lookupSCC(N) != C) in run()
885 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
963 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) { in run()
1055 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
1087 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF)); in run()
/openbsd/src/gnu/llvm/llvm/include/llvm/Analysis/
DLazyCallGraph.h979 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC() function
986 if (SCC *C = lookupSCC(N)) in lookupRefSCC()
/openbsd/src/gnu/llvm/llvm/lib/Transforms/Coroutines/
DCoroSplit.cpp2153 UR.CWorklist.insert(CG.lookupSCC(CG.get(*Clone))); in run()