105 void fillIntervalNode(CFGIntervalGraph &Graph,  in fillIntervalNode()  argument
113   CFGIntervalNode &Interval = Graph.emplace_back(Graph.size());  in fillIntervalNode()
116   // graph (specifically, `Result.Nodes`) to identifiers of nodes in the output  in fillIntervalNode()
117   // graph. In this case, the new interval has identifier `ID` so all of its  in fillIntervalNode()
144   CFGIntervalGraph Graph;  in partitionIntoIntervalsImpl()  local
145   // `Index` maps all of the nodes of the input graph to the interval to which  in partitionIntoIntervalsImpl()
146   // they are assigned in the output graph. The values (interval pointers) are  in partitionIntoIntervalsImpl()
150   // Lists header nodes (from the input graph) and their associated  in partitionIntoIntervalsImpl()
158   fillIntervalNode(Graph, Index, Successors, Partitioned, EntryBlock);  in partitionIntoIntervalsImpl()
159   Intervals.emplace_back(EntryBlock, &Graph.back());  in partitionIntoIntervalsImpl()
170     fillIntervalNode(Graph, Index, Successors, Partitioned, B);  in partitionIntoIntervalsImpl()
171     Intervals.emplace_back(B, &Graph.back());  in partitionIntoIntervalsImpl()
176     // Map input-graph predecessors to output-graph nodes and mark those as  in partitionIntoIntervalsImpl()
196   return Graph;  in partitionIntoIntervalsImpl()
208 CFGIntervalGraph partitionIntoIntervals(const CFGIntervalGraph &Graph) {  in partitionIntoIntervals()  argument
209   return partitionIntoIntervalsImpl(Graph.size(), &Graph[0]);  in partitionIntoIntervals()
214   // Backing storage for the allocated nodes in each graph.  in getIntervalWTO()
218   internal::CFGIntervalGraph Graph = internal::partitionIntoIntervals(Cfg);  in getIntervalWTO()  local
219   unsigned Size = Graph.size();  in getIntervalWTO()
221     PrevSize = Graph.size();  in getIntervalWTO()
222     Graph = internal::partitionIntoIntervals(Graph);  in getIntervalWTO()
223     Size = Graph.size();  in getIntervalWTO()
230   return std::move(Graph[0].Nodes);  in getIntervalWTO()