239 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
245 void LazyCallGraph::SCC::verify() {  in verify()
281 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
294 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
301   SmallPtrSet<const SCC *, 16> Visited = {this};  in isAncestorOf()
302   SmallVector<const SCC *, 16> Worklist = {this};  in isAncestorOf()
306     const SCC &C = *Worklist.pop_back_val();  in isAncestorOf()
309         SCC *CalleeC = G.lookupSCC(E.getNode());  in isAncestorOf()
342   SmallPtrSet<SCC *, 4> SCCSet;  in verify()
343   for (SCC *C : SCCs) {  in verify()
357     SCC *C = SCCIndexPair.first;  in verify()
366     SCC &SourceSCC = *SCCs[i];  in verify()
371         SCC &TargetSCC = *G->lookupSCC(E.getNode());  in verify()
383   for (SCC *C : SCCs) {  in verify()
412   for (SCC &C : *this)  in isParentOf()
434     for (SCC &C : DescendantRC)  in isAncestorOf()
587     function_ref<void(ArrayRef<SCC *> MergeSCCs)> MergeCB) {  in switchInternalEdgeToCall()
589   SmallVector<SCC *, 1> DeletedSCCs;  in switchInternalEdgeToCall()
596   SCC &SourceSCC = *G->lookupSCC(SourceN);  in switchInternalEdgeToCall()
597   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToCall()
620   auto ComputeSourceConnectedSet = [&](SmallPtrSetImpl<SCC *> &ConnectedSet) {  in switchInternalEdgeToCall()
627     auto IsConnected = [&](SCC &C) {  in switchInternalEdgeToCall()
636     for (SCC *C :  in switchInternalEdgeToCall()
646   auto ComputeTargetConnectedSet = [&](SmallPtrSetImpl<SCC *> &ConnectedSet) {  in switchInternalEdgeToCall()
653     SmallVector<SCC *, 4> Worklist;  in switchInternalEdgeToCall()
656       SCC &C = *Worklist.pop_back_val();  in switchInternalEdgeToCall()
661           SCC &EdgeC = *G->lookupSCC(E.getNode());  in switchInternalEdgeToCall()
707   for (SCC *C : MergeRange) {  in switchInternalEdgeToCall()
722   for (SCC *C : make_range(EraseEnd, SCCs.end()))  in switchInternalEdgeToCall()
766   SCC &TargetSCC = *G->lookupSCC(TargetN);  in switchInternalEdgeToRef()
786   SCC &OldSCC = TargetSCC;  in switchInternalEdgeToRef()
789   SmallVector<SCC *, 4> NewSCCs;  in switchInternalEdgeToRef()
1042       for (SCC &C : RC)  in insertIncomingRefEdge()
1067       for (SCC &C : RC)  in insertIncomingRefEdge()
1099   SmallVector<SCC *, 16> MergedSCCs;  in insertIncomingRefEdge()
1109     for (SCC &InnerC : *RC) {  in insertIncomingRefEdge()
1127   for (SCC &InnerC : *this)  in insertIncomingRefEdge()
1205   SCC &SourceC = *G->lookupSCC(SourceN);  in removeInternalRefEdge()
1222   for (SCC *C : SCCs) {  in removeInternalRefEdge()
1372   for (SCC *C : SCCs) {  in removeInternalRefEdge()
1413   SCC &SourceC = *G->lookupSCC(SourceN);  in insertTrivialCallEdge()
1414   SCC &TargetC = *G->lookupSCC(TargetN);  in insertTrivialCallEdge()
1538   SCC &C = *CI->second;  in removeDeadFunction()
1617   SCC *OriginalC = lookupSCC(OriginalN);  in addSplitFunction()
1631   SCC *NewC = nullptr;  in addSplitFunction()
1749     SCC *NewC = createSCC(*NewRC, SmallVector<Node *, 1>({&NewN}));  in addSplitRefRecursiveFunctions()
1978 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
1988   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()