Lines Matching defs:move
42 LMoveOperands move = moves_[i];
47 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
48 root_index_ = i; // Any cycle is found when we reach this move again.
56 LMoveOperands move = moves_[i];
58 if (!move.IsEliminated()) {
59 DCHECK(move.source()->IsConstantOperand());
72 // moves to perform, ignoring any move that is redundant (the source is
74 // unallocated, or the move was already eliminated).
77 LMoveOperands move = moves->at(i);
78 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
85 // Each call to this function performs a move and deletes it from the move
86 // graph. We first recursively perform any move blocking this one. We
87 // mark a move as "pending" on entry to PerformMove in order to detect
88 // cycles in the move graph.
94 // Clear this move's destination to indicate a pending move. The actual
101 // Perform a depth-first traversal of the move graph to resolve
102 // dependencies. Any unperformed, unpending move with a source the same
109 // If there is a blocking, pending move it must be moves_[root_index_]
115 // We are about to resolve this move and don't need it marked as
119 // The move may be blocked on a pending move, which must be the starting move.
120 // In this case, we have a cycle, and we save the source of this move to
129 // This move is no longer blocked.
136 // No operand should be the destination for more than one move.
151 // We save in a register the source of that move and we remember its
152 // destination. Then we mark this move as resolved so the cycle is
172 // Mark this move as resolved.
173 // This move will be actually performed by moving the saved value to this
174 // move's destination in LGapResolver::RestoreValue().
291 // The move has been emitted, we can eliminate it.