Lines Matching defs:Nodes

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