Searched refs:TargetC (Results 1 – 3 of 3) sorted by relevance
489 SCC &TargetC = *G.lookupSCC(E.getNode()); in updateCGAndAnalysisManagerForFunctionPass() local490 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()492 if (C != &TargetC) { in updateCGAndAnalysisManagerForFunctionPass()509 SCC &TargetC = *G.lookupSCC(*TargetN); in updateCGAndAnalysisManagerForFunctionPass() local510 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()559 SCC &TargetC = *G.lookupSCC(*RefTarget); in updateCGAndAnalysisManagerForFunctionPass() local560 RefSCC &TargetRC = TargetC.getOuterRefSCC(); in updateCGAndAnalysisManagerForFunctionPass()575 if (C != &TargetC) { in updateCGAndAnalysisManagerForFunctionPass()588 SCC &TargetC = *G.lookupSCC(*CallTarget); in updateCGAndAnalysisManagerForFunctionPass() local589 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()
732 RefSCC &TargetC = *G->lookupRefSCC(TargetN); in insertOutgoingEdge() local733 assert(&TargetC != this && "Target must not be in this RefSCC."); in insertOutgoingEdge()734 assert(TargetC.isDescendantOf(*this) && in insertOutgoingEdge()739 TargetC.Parents.insert(this); in insertOutgoingEdge()997 SCC &TargetC = *G->lookupSCC(TargetN); in removeInternalRefEdge() local998 for (Node &N : TargetC) in removeInternalRefEdge()1005 if (C == &TargetC) in removeInternalRefEdge()