Lines Matching full:nodes
26 // number of nodes, vector should be sufficiently efficient. Elements must not
28 std::vector<const Node *> Nodes; member
43 Interval.Nodes.push_back(Header); in buildInterval()
46 // FIXME: Compare performance against using RPO to consider nodes, rather than in buildInterval()
79 return llvm::is_contained(Interval.Nodes, P); in buildInterval()
82 Interval.Nodes.push_back(B); in buildInterval()
98 if (!llvm::is_contained(Interval.Nodes, B)) in buildInterval()
115 // Index the nodes of the new interval. The index maps nodes from the input in fillIntervalNode()
116 // graph (specifically, `Result.Nodes`) to identifiers of nodes in the output in fillIntervalNode()
118 // nodes (`Result.Nodes`) map to `ID`. in fillIntervalNode()
119 for (const auto *N : Result.Nodes) { in fillIntervalNode()
126 Interval.Nodes = std::move(Result.Nodes); in fillIntervalNode()
128 std::vector<const CFGBlock *> Nodes; in fillIntervalNode() local
131 for (auto &N : Result.Nodes) in fillIntervalNode()
132 Count += N->Nodes.size(); in fillIntervalNode()
133 Nodes.reserve(Count); in fillIntervalNode()
134 for (auto &N : Result.Nodes) in fillIntervalNode()
135 Nodes.insert(Nodes.end(), N->Nodes.begin(), N->Nodes.end()); in fillIntervalNode()
136 Interval.Nodes = std::move(Nodes); in fillIntervalNode()
145 // `Index` maps all of the nodes of the input graph to the interval to which in partitionIntoIntervalsImpl()
150 // Lists header nodes (from the input graph) and their associated in partitionIntoIntervalsImpl()
151 // interval. Since header nodes can vary in type and are only needed within in partitionIntoIntervalsImpl()
176 // Map input-graph predecessors to output-graph nodes and mark those as in partitionIntoIntervalsImpl()
201 return buildInterval(Partitioned, Header).Nodes; in buildInterval()
214 // Backing storage for the allocated nodes in each graph. in getIntervalWTO()
230 return std::move(Graph[0].Nodes); in getIntervalWTO()