372         SCC &TargetSCC = *G->lookupSCC(E.getNode());  in verify()  local
373         if (&TargetSCC.getOuterRefSCC() == this) {  in verify()
374           assert(SCCIndices.find(&TargetSCC)->second <= I &&  in verify()
517     SCCT &SourceSCC, SCCT &TargetSCC, PostorderSequenceT &SCCs,  in updatePostorderSequenceForEdgeInsertion()  argument
522   int TargetIdx = SCCIndices[&TargetSCC];  in updatePostorderSequenceForEdgeInsertion()
541   if (!ConnectedSet.count(&TargetSCC)) {  in updatePostorderSequenceForEdgeInsertion()
544     assert(*std::prev(SourceI) == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
552   assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
573     assert(SCCs[TargetIdx] == &TargetSCC &&  in updatePostorderSequenceForEdgeInsertion()
596   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToCall()  local
600   if (&SourceSCC == &TargetSCC) {  in switchInternalEdgeToCall()
612   int TargetIdx = SCCIndices[&TargetSCC];  in switchInternalEdgeToCall()
651     ConnectedSet.insert(&TargetSCC);  in switchInternalEdgeToCall()
653     Worklist.push_back(&TargetSCC);  in switchInternalEdgeToCall()
679       SourceSCC, TargetSCC, SCCs, SCCIndices, ComputeSourceConnectedSet,  in switchInternalEdgeToCall()
707     assert(C != &TargetSCC &&  in switchInternalEdgeToCall()
710     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
712       G->SCCMap[N] = &TargetSCC;  in switchInternalEdgeToCall()
761   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToRef()  local
762   assert(G->lookupSCC(SourceN) == &TargetSCC && "Source and Target must be in "  in switchInternalEdgeToRef()
781   SCC &OldSCC = TargetSCC;  in switchInternalEdgeToRef()