Lines Matching defs:Nodes

28   std::vector<const Node *> Nodes;
43   Interval.Nodes.push_back(Header);
79       return llvm::is_contained(Interval.Nodes, P);
82       Interval.Nodes.push_back(B);
98     if (!llvm::is_contained(Interval.Nodes, B))
116   // graph (specifically, `Result.Nodes`) to identifiers of nodes in the output
118   // nodes (`Result.Nodes`) map to `ID`.
119   for (const auto *N : Result.Nodes) {
126     Interval.Nodes = std::move(Result.Nodes);
128     std::vector<const CFGBlock *> Nodes;
131     for (auto &N : Result.Nodes)
132       Count += N->Nodes.size();
133     Nodes.reserve(Count);
134     for (auto &N : Result.Nodes)
135       Nodes.insert(Nodes.end(), N->Nodes.begin(), N->Nodes.end());
136     Interval.Nodes = std::move(Nodes);
201   return buildInterval(Partitioned, Header).Nodes;
230   return std::move(Graph[0].Nodes);