Lines Matching refs:nodes
54 // Reserve 10% more space for nodes if node splitting is enabled to try to
90 // Nothing to do for control nodes that have been already fixed in
110 // Control nodes that were not control-reachable from end may float.
126 // We only update control nodes from {kUnknown} to {kFixed}. Ideally, we
152 // Control nodes force coupled uses to be placed.
187 // Tracking use counts for fixed nodes is useless.
190 // Use count for coupled nodes is summed up on their control.
206 // Tracking use counts for fixed nodes is useless.
209 // Use count for coupled nodes is summed up on their control.
252 // basic blocks for control nodes.
319 // Mark the connected control nodes as they are queued.
635 NodeVector control_; // List of encountered control nodes.
649 // is being spanned by the graph's start and end nodes.
1312 // Phase 3: Prepare use counts for nodes.
1338 // Fixed nodes are always roots for schedule late.
1341 // Make sure root nodes are scheduled in their respective blocks.
1398 // Phase 4: Schedule nodes early.
1406 // Run the schedule early algorithm on a set of fixed root nodes.
1421 // position to all uses. This in turn might push more nodes onto the queue.
1425 // Fixed nodes already know their schedule early position.
1455 // Coupled nodes influence schedule early position of their control.
1511 // Phase 5: Schedule nodes late.
1523 // Run the schedule late algorithm on a set of fixed root nodes.
1534 // Don't schedule coupled nodes on their own.
1552 // Visits one node from the queue of schedulable nodes and determines its
1553 // schedule late position. Also hoists nodes out of loops to find a more
1558 // Don't schedule nodes that are already scheduled.
1577 // Hoist nodes out of loops if possible. Nodes can be hoisted iteratively
1625 // For now, we limit splitting to pure nodes.
1751 // TODO(titzer): ignore uses from dead nodes (not visited in PrepareUses()).
1869 // Schedule: Places nodes in dominator block of all their uses.
1886 // Add collected nodes for basic blocks to their blocks in the right order.
1888 for (NodeVector* nodes : scheduled_nodes_) {
1891 if (nodes) {
1892 for (Node* node : base::Reversed(*nodes)) {
1921 // Iterate on phase 4: Schedule nodes early.
1943 // Move previously planned nodes.
1955 TRACE("Move planned nodes from id:%d to id:%d\n", from->id().ToInt(),