250   assert(!Nodes.empty() && "Can't have an empty SCC!");  in verify()
252   for (Node *N : Nodes) {  in verify()
275     for (Node *NodeToVisit : Nodes) {  in verify()
383   SmallVector<Node *> Nodes;  in verify()  local
386       Nodes.push_back(&N);  in verify()
388   for (Node *N : Nodes) {  in verify()
399     for (Node *NodeToVisit : Nodes) {  in verify()
710     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
711     for (Node *N : C->Nodes)  in switchInternalEdgeToCall()
788   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
803   OldSCC.Nodes.push_back(&TargetN);  in switchInternalEdgeToRef()
851             OldSCC.Nodes.push_back(N);  in switchInternalEdgeToRef()
852             OldSCC.Nodes.append(PendingSCCStack.begin(), PendingSCCStack.end());  in switchInternalEdgeToRef()
855               OldSCC.Nodes.push_back(DFSStack.pop_back_val().first);  in switchInternalEdgeToRef()
1215     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdges()
1647       NewC->Nodes.push_back(&NewN);  in addSplitFunction()
1899 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()  argument
1903   for (Node *N : Nodes) {  in buildSCCs()
1904     assert(N->LowLink >= (*Nodes.begin())->LowLink &&  in buildSCCs()
1917       Nodes, [](Node &N) { return N->call_begin(); },  in buildSCCs()
1920       [this, &RC](node_stack_range Nodes) {  in buildSCCs()  argument
1921         RC.SCCs.push_back(createSCC(RC, Nodes));  in buildSCCs()
1954       [this](node_stack_range Nodes) {  in buildRefSCCs()  argument
1956         buildSCCs(*NewRC, Nodes);  in buildRefSCCs()