Searched refs:TargetC (Results 1 – 2 of 2) sorted by relevance
978 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass() local979 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()991 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass() local992 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForPass()1019 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForPass() local1022 if (C != &TargetC) { in updateCGAndAnalysisManagerForPass()1037 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForPass() local1085 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForPass() local1103 if (C != &TargetC) { in updateCGAndAnalysisManagerForPass()1121 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForPass() local[all …]
294 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()295 if (this == &TargetC) in isAncestorOf()314 if (CalleeC == &TargetC) in isAncestorOf()1414 SCC &TargetC = *G->lookupSCC(TargetN); in insertTrivialCallEdge() local1415 if (&SourceC != &TargetC) in insertTrivialCallEdge()1416 assert(SourceC.isAncestorOf(TargetC) && in insertTrivialCallEdge()