371         SCC &TargetSCC = *G->lookupSCC(E.getNode());  in verify()  local
372         if (&TargetSCC.getOuterRefSCC() == this) {  in verify()
373           assert(SCCIndices.find(&TargetSCC)->second <= i &&  in verify()
516     SCCT &SourceSCC, SCCT &TargetSCC, PostorderSequenceT &SCCs,  in updatePostorderSequenceForEdgeInsertion()  argument
521   int TargetIdx = SCCIndices[&TargetSCC];  in updatePostorderSequenceForEdgeInsertion()
540   if (!ConnectedSet.count(&TargetSCC)) {  in updatePostorderSequenceForEdgeInsertion()
543     assert(*std::prev(SourceI) == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
551   assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
573     assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
597   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToCall()  local
601   if (&SourceSCC == &TargetSCC) {  in switchInternalEdgeToCall()
613   int TargetIdx = SCCIndices[&TargetSCC];  in switchInternalEdgeToCall()
652     ConnectedSet.insert(&TargetSCC);  in switchInternalEdgeToCall()
654     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
680       SourceSCC, TargetSCC, SCCs, SCCIndices, ComputeSourceConnectedSet,  in switchInternalEdgeToCall()
708     assert(C != &TargetSCC &&  in switchInternalEdgeToCall()
711     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
713       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
766   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToRef()  local
767   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "  in switchInternalEdgeToRef()
786   SCC &OldSCC = TargetSCC;  in switchInternalEdgeToRef()