216   for (RefSCC &RC : postorder_ref_sccs()) {  in verify()
331 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}  in RefSCC()  function in LazyCallGraph::RefSCC
334 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {  in dump()
340 void LazyCallGraph::RefSCC::verify() {  in verify()
408 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const {  in isParentOf()
422 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const {  in isAncestorOf()
429   SmallVector<const RefSCC *, 4> Worklist;  in isAncestorOf()
430   SmallPtrSet<const RefSCC *, 4> Visited;  in isAncestorOf()
434     const RefSCC &DescendantRC = *Worklist.pop_back_val();  in isAncestorOf()
584 bool LazyCallGraph::RefSCC::switchInternalEdgeToCall(  in switchInternalEdgeToCall()
731 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,  in switchTrivialInternalEdgeToRef()
749 iterator_range<LazyCallGraph::RefSCC::iterator>
750 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
930 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()
951 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()
972 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()
984 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
1003 SmallVector<LazyCallGraph::RefSCC *, 1>
1004 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1006   RefSCC &SourceC = *G->lookupRefSCC(SourceN);  in insertIncomingRefEdge()
1013   SmallVector<RefSCC *, 1> DeletedRefSCCs;  in insertIncomingRefEdge()
1032   auto ComputeSourceConnectedSet = [&](SmallPtrSetImpl<RefSCC *> &Set) {  in insertIncomingRefEdge()
1034     auto IsConnected = [&](RefSCC &RC) {  in insertIncomingRefEdge()
1044     for (RefSCC *C : make_range(G->PostOrderRefSCCs.begin() + SourceIdx + 1,  in insertIncomingRefEdge()
1054   auto ComputeTargetConnectedSet = [&](SmallPtrSetImpl<RefSCC *> &Set) {  in insertIncomingRefEdge()
1056     SmallVector<RefSCC *, 4> Worklist;  in insertIncomingRefEdge()
1059       RefSCC &RC = *Worklist.pop_back_val();  in insertIncomingRefEdge()
1063             RefSCC &EdgeRC = *G->lookupRefSCC(E.getNode());  in insertIncomingRefEdge()
1078   iterator_range<SmallVectorImpl<RefSCC *>::iterator> MergeRange =  in insertIncomingRefEdge()
1085   SmallPtrSet<RefSCC *, 16> MergeSet(MergeRange.begin(), MergeRange.end());  in insertIncomingRefEdge()
1094   for (RefSCC *RC : MergeRange) {  in insertIncomingRefEdge()
1126   for (RefSCC *RC : MergeRange)  in insertIncomingRefEdge()
1131   for (RefSCC *RC : make_range(EraseEnd, G->PostOrderRefSCCs.end()))  in insertIncomingRefEdge()
1145 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1162 SmallVector<LazyCallGraph::RefSCC *, 1>
1163 LazyCallGraph::RefSCC::removeInternalRefEdges(  in removeInternalRefEdges()
1166   SmallVector<RefSCC *, 1> Result;  in removeInternalRefEdges()
1370     RefSCC &RC = *Result[SCCNumber];  in removeInternalRefEdges()
1385   for (RefSCC *RC : Result)  in removeInternalRefEdges()
1393 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,  in insertTrivialCallEdge()
1422 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1427   RefSCC &SourceRC = *G->lookupRefSCC(SourceN);  in insertTrivialRefEdge()
1428   RefSCC &TargetRC = *G->lookupRefSCC(TargetN);  in insertTrivialRefEdge()
1446 void LazyCallGraph::RefSCC::replaceNodeFunction(Node &N, Function &NewF) {  in replaceNodeFunction()
1526   DenseMap<RefSCC *, SmallVector<Node *, 1>> RCs;  in removeDeadFunctions()
1535     RefSCC *RC = lookupRefSCC(*N);  in removeDeadFunctions()
1555       RefSCC *DeadRC = lookupRefSCC(*DeadN);  in removeDeadFunctions()
1626   RefSCC *OriginalRC = lookupRefSCC(OriginalN);  in addSplitFunction()
1659         RefSCC *NewRC = OriginalRC;  in addSplitFunction()
1684     RefSCC *NewRC = createRefSCC(*this);  in addSplitFunction()
1705   RefSCC *OriginalRC = lookupRefSCC(OriginalN);  in addSplitRefRecursiveFunctions()
1733   RefSCC *NewRC;  in addSplitRefRecursiveFunctions()
1899 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()
1955         RefSCC *NewRC = createRefSCC(*this);  in buildRefSCCs()
2014 static void printRefSCC(raw_ostream &OS, LazyCallGraph::RefSCC &C) {  in printRefSCC()
2034   for (LazyCallGraph::RefSCC &C : G.postorder_ref_sccs())  in run()