234 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
240 void LazyCallGraph::SCC::verify() {  in verify()
276 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
289 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
296   SmallPtrSet<const SCC *, 16> Visited = {this};  in isAncestorOf()
297   SmallVector<const SCC *, 16> Worklist = {this};  in isAncestorOf()
301     const SCC &C = *Worklist.pop_back_val();  in isAncestorOf()
304         SCC *CalleeC = G.lookupSCC(E.getNode());  in isAncestorOf()
337   SmallPtrSet<SCC *, 4> SCCSet;  in verify()
338   for (SCC *C : SCCs) {  in verify()
359     SCC &SourceSCC = *SCCs[I];  in verify()
364         SCC &TargetSCC = *G->lookupSCC(E.getNode());  in verify()
376   for (SCC *C : SCCs) {  in verify()
405   for (SCC &C : *this)  in isParentOf()
427     for (SCC &C : DescendantRC)  in isAncestorOf()
578     function_ref<void(ArrayRef<SCC *> MergeSCCs)> MergeCB) {  in switchInternalEdgeToCall()
580   SmallVector<SCC *, 1> DeletedSCCs;  in switchInternalEdgeToCall()
587   SCC &SourceSCC = *G->lookupSCC(SourceN);  in switchInternalEdgeToCall()
588   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToCall()
611   auto ComputeSourceConnectedSet = [&](SmallPtrSetImpl<SCC *> &ConnectedSet) {  in switchInternalEdgeToCall()
618     auto IsConnected = [&](SCC &C) {  in switchInternalEdgeToCall()
627     for (SCC *C :  in switchInternalEdgeToCall()
637   auto ComputeTargetConnectedSet = [&](SmallPtrSetImpl<SCC *> &ConnectedSet) {  in switchInternalEdgeToCall()
644     SmallVector<SCC *, 4> Worklist;  in switchInternalEdgeToCall()
647       SCC &C = *Worklist.pop_back_val();  in switchInternalEdgeToCall()
652           SCC &EdgeC = *G->lookupSCC(E.getNode());  in switchInternalEdgeToCall()
698   for (SCC *C : MergeRange) {  in switchInternalEdgeToCall()
713   for (SCC *C : make_range(EraseEnd, SCCs.end()))  in switchInternalEdgeToCall()
753   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToRef()
773   SCC &OldSCC = TargetSCC;  in switchInternalEdgeToRef()
776   SmallVector<SCC *, 4> NewSCCs;  in switchInternalEdgeToRef()
1027       for (SCC &C : RC)  in insertIncomingRefEdge()
1052       for (SCC &C : RC)  in insertIncomingRefEdge()
1084   SmallVector<SCC *, 16> MergedSCCs;  in insertIncomingRefEdge()
1094     for (SCC &InnerC : *RC) {  in insertIncomingRefEdge()
1112   for (SCC &InnerC : *this)  in insertIncomingRefEdge()
1190   SCC &SourceC = *G->lookupSCC(SourceN);  in removeInternalRefEdge()
1207   for (SCC *C : SCCs) {  in removeInternalRefEdge()
1355   for (SCC *C : SCCs) {  in removeInternalRefEdge()
1396   SCC &SourceC = *G->lookupSCC(SourceN);  in insertTrivialCallEdge()
1397   SCC &TargetC = *G->lookupSCC(TargetN);  in insertTrivialCallEdge()
1517   SCC &C = *CI->second;  in removeDeadFunction()
1525     for (SCC &OtherC : *RC) {  in removeDeadFunction()
1614   SCC *OriginalC = lookupSCC(OriginalN);  in addSplitFunction()
1628   SCC *NewC = nullptr;  in addSplitFunction()
1746     SCC *NewC = createSCC(*NewRC, SmallVector<Node *, 1>({&NewN}));  in addSplitRefRecursiveFunctions()
1996 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
2006   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()