Lines Matching defs:move
26 LMoveOperands move = moves_[i];
30 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
31 root_index_ = i; // Any cycle is found when by reaching this move again.
53 // moves to perform, ignoring any move that is redundant (the source is
55 // unallocated, or the move was already eliminated).
58 LMoveOperands move = moves->at(i);
59 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
66 // Each call to this function performs a move and deletes it from the move
67 // graph. We first recursively perform any move blocking this one. We
68 // mark a move as "pending" on entry to PerformMove in order to detect
69 // cycles in the move graph.
72 // be encountering the starting move again. So by spilling the source of
73 // the starting move, we break the cycle. All moves are then unblocked,
74 // and the starting move is completed by writing the spilled value to
83 // Clear this move's destination to indicate a pending move. The actual
90 // Perform a depth-first traversal of the move graph to resolve
91 // dependencies. Any unperformed, unpending move with a source the same
98 // If there is a blocking, pending move it must be moves_[root_index_]
104 // We are about to resolve this move and don't need it marked as
108 // The move may be blocked on a pending move, which must be the starting move.
109 // In this case, we have a cycle, and we save the source of this move to
118 // This move is no longer blocked.
125 // No operand should be the destination for more than one move.
140 // in that move, we save the value to that source.
157 // This move will be done by restoring the saved value to the destination.
240 __ Move(result, v);
