247   assert(!Nodes.empty() && "Can't have an empty SCC!");  in verify()
249   for (Node *N : Nodes) {  in verify()
272     for (Node *NodeToVisit : Nodes) {  in verify()
382   SmallVector<Node *> Nodes;  in verify()  local
385       Nodes.push_back(&N);  in verify()
387   for (Node *N : Nodes) {  in verify()
398     for (Node *NodeToVisit : Nodes) {  in verify()
711     TargetSCC.Nodes.append(C->Nodes.begin(), C->Nodes.end());  in switchInternalEdgeToCall()
712     for (Node *N : C->Nodes)  in switchInternalEdgeToCall()
793   Worklist.swap(OldSCC.Nodes);  in switchInternalEdgeToRef()
808   OldSCC.Nodes.push_back(&TargetN);  in switchInternalEdgeToRef()
858             OldSCC.Nodes.push_back(N);  in switchInternalEdgeToRef()
859             OldSCC.Nodes.append(PendingSCCStack.begin(), PendingSCCStack.end());  in switchInternalEdgeToRef()
862               OldSCC.Nodes.push_back(DFSStack.pop_back_val().first);  in switchInternalEdgeToRef()
1226     Worklist.append(C->Nodes.begin(), C->Nodes.end());  in removeInternalRefEdge()
1639       NewC->Nodes.push_back(&NewN);  in addSplitFunction()
1893 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()  argument
1897   for (Node *N : Nodes) {  in buildSCCs()
1898     assert(N->LowLink >= (*Nodes.begin())->LowLink &&  in buildSCCs()
1911       Nodes, [](Node &N) { return N->call_begin(); },  in buildSCCs()
1914       [this, &RC](node_stack_range Nodes) {  in buildSCCs()  argument
1915         RC.SCCs.push_back(createSCC(RC, Nodes));  in buildSCCs()
1948       [this](node_stack_range Nodes) {  in buildRefSCCs()  argument
1950         buildSCCs(*NewRC, Nodes);  in buildRefSCCs()