221   assert(!Nodes.empty() && "Can't have an empty SCC!");  in verify()
223   for (Node *N : Nodes) {  in verify()
644     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
645     for (Node *N : C->Nodes)  in switchInternalEdgeToCall()
730   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
745   OldSCC.Nodes.push_back(&TargetN);  in switchInternalEdgeToRef()
795             OldSCC.Nodes.push_back(N);  in switchInternalEdgeToRef()
796             OldSCC.Nodes.append(PendingSCCStack.begin(), PendingSCCStack.end());  in switchInternalEdgeToRef()
799               OldSCC.Nodes.push_back(DFSStack.pop_back_val().first);  in switchInternalEdgeToRef()
1171     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdge()
1653 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()  argument
1657   for (Node *N : Nodes) {  in buildSCCs()
1658     assert(N->LowLink >= (*Nodes.begin())->LowLink &&  in buildSCCs()
1671       Nodes, [](Node &N) { return N->call_begin(); },  in buildSCCs()
1674       [this, &RC](node_stack_range Nodes) {  in buildSCCs()  argument
1675         RC.SCCs.push_back(createSCC(RC, Nodes));  in buildSCCs()
1711       [this](node_stack_range Nodes) {  in buildRefSCCs()  argument
1713         buildSCCs(*NewRC, Nodes);  in buildRefSCCs()