327         SCC &TargetSCC = *G->lookupSCC(E.getNode());  in verify()  local
328         if (&TargetSCC.getOuterRefSCC() == this) {  in verify()
329           assert(SCCIndices.find(&TargetSCC)->second <= i &&  in verify()
447     SCCT &SourceSCC, SCCT &TargetSCC, PostorderSequenceT &SCCs,  in updatePostorderSequenceForEdgeInsertion()  argument
452   int TargetIdx = SCCIndices[&TargetSCC];  in updatePostorderSequenceForEdgeInsertion()
471   if (!ConnectedSet.count(&TargetSCC)) {  in updatePostorderSequenceForEdgeInsertion()
474     assert(*std::prev(SourceI) == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
482   assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
504     assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
530   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToCall()  local
534   if (&SourceSCC == &TargetSCC) {  in switchInternalEdgeToCall()
546   int TargetIdx = SCCIndices[&TargetSCC];  in switchInternalEdgeToCall()
585     ConnectedSet.insert(&TargetSCC);  in switchInternalEdgeToCall()
587     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
613       SourceSCC, TargetSCC, SCCs, SCCIndices, ComputeSourceConnectedSet,  in switchInternalEdgeToCall()
641     assert(C != &TargetSCC &&  in switchInternalEdgeToCall()
644     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
646       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
703   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToRef()  local
704   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "  in switchInternalEdgeToRef()
723   SCC &OldSCC = TargetSCC;  in switchInternalEdgeToRef()