Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp37 auto *DeadSCC = LCG->lookupSCC(N); in finalize()
47 UR->InvalidatedSCCs.insert(LCG->lookupSCC(N)); in finalize()
67 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp254 assert(OuterRefSCC->G->lookupSCC(*N) == this && in verify()
290 if (OuterRefSCC->G->lookupSCC(E.getNode()) == &C) in isParentOf()
312 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
372 SCC &TargetSCC = *G->lookupSCC(E.getNode()); in verify()
595 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
596 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
629 if (ConnectedSet.count(G->lookupSCC(E.getNode()))) in switchInternalEdgeToCall()
660 SCC &EdgeC = *G->lookupSCC(E.getNode()); in switchInternalEdgeToCall()
742 assert(G->lookupSCC(SourceN) != G->lookupSCC(TargetN) && in switchTrivialInternalEdgeToRef()
761 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToRef()
[all …]
H A DCGSCCPassManager.cpp531 if (CG.lookupSCC(*N) != CurrentC) in run()
563 assert(CG.lookupSCC(*N) == CurrentC && in run()
835 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); in incorporateNewSCCRange()
963 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass()
976 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass()
1004 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForPass()
1022 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass()
1040 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass()
1076 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass()
1125 assert(G.lookupSCC(N) == C && "Failed to update current SCC!"); in updateCGAndAnalysisManagerForPass()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp317 if (CG.lookupSCC(N) != C) in run()
354 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
432 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) { in run()
522 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC; in run()
555 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF)); in run()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h984 SCC *lookupSCC(Node &N) const { return SCCMap.lookup(&N); } in lookupSCC() function
991 if (SCC *C = lookupSCC(N)) in lookupRefSCC()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp2134 UR.CWorklist.insert(CG.lookupSCC(CG.get(*Clone))); in run()