364         SCC &TargetSCC = *G->lookupSCC(E.getNode());  in verify()  local
365         if (&TargetSCC.getOuterRefSCC() == this) {  in verify()
366           assert(SCCIndices.find(&TargetSCC)->second <= I &&  in verify()
509     SCCT &SourceSCC, SCCT &TargetSCC, PostorderSequenceT &SCCs,  in updatePostorderSequenceForEdgeInsertion()  argument
514   int TargetIdx = SCCIndices[&TargetSCC];  in updatePostorderSequenceForEdgeInsertion()
533   if (!ConnectedSet.count(&TargetSCC)) {  in updatePostorderSequenceForEdgeInsertion()
536     assert(*std::prev(SourceI) == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
544   assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
565     assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
588   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToCall()  local
592   if (&SourceSCC == &TargetSCC) {  in switchInternalEdgeToCall()
604   int TargetIdx = SCCIndices[&TargetSCC];  in switchInternalEdgeToCall()
643     ConnectedSet.insert(&TargetSCC);  in switchInternalEdgeToCall()
645     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
671       SourceSCC, TargetSCC, SCCs, SCCIndices, ComputeSourceConnectedSet,  in switchInternalEdgeToCall()
699     assert(C != &TargetSCC &&  in switchInternalEdgeToCall()
702     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
704       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
753   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToRef()  local
754   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "  in switchInternalEdgeToRef()
773   SCC &OldSCC = TargetSCC;  in switchInternalEdgeToRef()