Lines Matching defs:move
50 LMoveOperands move = moves_[i];
54 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
55 root_index_ = i; // Any cycle is found when by reaching this move again.
77 // moves to perform, ignoring any move that is redundant (the source is
79 // unallocated, or the move was already eliminated).
82 LMoveOperands move = moves->at(i);
83 if (!move.IsRedundant()) moves_.Add(move);
90 // Each call to this function performs a move and deletes it from the move
91 // graph. We first recursively perform any move blocking this one. We
92 // mark a move as "pending" on entry to PerformMove in order to detect
93 // cycles in the move graph.
96 // be encountering the starting move again. So by spilling the source of
97 // the starting move, we break the cycle. All moves are then unblocked,
98 // and the starting move is completed by writing the spilled value to
107 // Clear this move's destination to indicate a pending move. The actual
114 // Perform a depth-first traversal of the move graph to resolve
115 // dependencies. Any unperformed, unpending move with a source the same
122 // If there is a blocking, pending move it must be moves_[root_index_]
128 // We are about to resolve this move and don't need it marked as
132 // The move may be blocked on a pending move, which must be the starting move.
133 // In this case, we have a cycle, and we save the source of this move to
142 // This move is no longer blocked.
149 // No operand should be the destination for more than one move.
164 // in that move, we save the value to that source.
181 // This move will be done by restoring the saved value to the destination.
