Lines Matching refs:nodes
90 // Control nodes that were not control-reachable from end may float.
125 // Control nodes force coupled uses to be placed.
158 // Make sure that control edges from coupled nodes are not counted.
161 // Tracking use counts for fixed nodes is useless.
164 // Use count for coupled nodes is summed up on their control.
181 // Make sure that control edges from coupled nodes are not counted.
184 // Tracking use counts for fixed nodes is useless.
187 // Use count for coupled nodes is summed up on their control.
230 // basic blocks for control nodes.
295 // Mark the connected control nodes as they are queued.
562 NodeVector control_; // List of encountered control nodes.
576 // is being spanned by the graph's start and end nodes.
1138 // Phase 3: Prepare use counts for nodes.
1148 // Fixed nodes are always roots for schedule late.
1151 // Make sure root nodes are scheduled in their respective blocks.
1211 // Phase 4: Schedule nodes early.
1219 // Run the schedule early algorithm on a set of fixed root nodes.
1232 // position to all uses. This in turn might push more nodes onto the queue.
1236 // Fixed nodes already know their schedule early position.
1264 // Coupled nodes influence schedule early position of their control.
1315 // Phase 5: Schedule nodes late.
1326 // Run the schedule late algorithm on a set of fixed root nodes.
1337 // Don't schedule coupled nodes on their own.
1354 // Visits one node from the queue of schedulable nodes and determines its
1355 // schedule late position. Also hoists nodes out of loops to find a more
1360 // Don't schedule nodes that are already scheduled.
1378 // Hoist nodes out of loops if possible. Nodes can be hoisted iteratively
1419 // For now, we limit splitting to pure nodes.
1647 // Schedule: Places nodes in dominator block of all their uses.
1664 // Add collected nodes for basic blocks to their blocks in the right order.
1666 for (NodeVector& nodes : scheduled_nodes_) {
1669 for (Node* node : base::Reversed(nodes)) {
1698 // Iterate on phase 4: Schedule nodes early.
1718 // Move previously planned nodes.
1731 TRACE("Move planned nodes from id:%d to id:%d\n", from->id().ToInt(),
1733 NodeVector* nodes = &(scheduled_nodes_[from->id().ToSize()]);
1734 for (Node* const node : *nodes) {
1738 nodes->clear();
