Searched refs:TargetC (Results 1 – 2 of 2) sorted by relevance
504 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForFunctionPass() local505 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()507 if (C != &TargetC) { in updateCGAndAnalysisManagerForFunctionPass()524 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForFunctionPass() local525 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()574 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForFunctionPass() local575 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()590 if (C != &TargetC) { in updateCGAndAnalysisManagerForFunctionPass()603 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForFunctionPass() local604 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()[all …]
250 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()251 if (this == &TargetC) in isAncestorOf()270 if (CalleeC == &TargetC) in isAncestorOf()1378 SCC &TargetC = *G->lookupSCC(TargetN); in insertTrivialCallEdge() local1379 if (&SourceC != &TargetC) in insertTrivialCallEdge()1380 assert(SourceC.isAncestorOf(TargetC) && in insertTrivialCallEdge()