Lines Matching defs:move
28 LMoveOperands move = moves_[i];
32 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
33 root_index_ = i; // Any cycle is found when by reaching this move again.
55 // moves to perform, ignoring any move that is redundant (the source is
57 // unallocated, or the move was already eliminated).
60 LMoveOperands move = moves->at(i);
61 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
68 // Each call to this function performs a move and deletes it from the move
69 // graph. We first recursively perform any move blocking this one. We
70 // mark a move as "pending" on entry to PerformMove in order to detect
71 // cycles in the move graph.
74 // be encountering the starting move again. So by spilling the source of
75 // the starting move, we break the cycle. All moves are then unblocked,
76 // and the starting move is completed by writing the spilled value to
85 // Clear this move's destination to indicate a pending move. The actual
92 // Perform a depth-first traversal of the move graph to resolve
93 // dependencies. Any unperformed, unpending move with a source the same
100 // If there is a blocking, pending move it must be moves_[root_index_]
106 // We are about to resolve this move and don't need it marked as
110 // The move may be blocked on a pending move, which must be the starting move.
111 // In this case, we have a cycle, and we save the source of this move to
120 // This move is no longer blocked.
127 // No operand should be the destination for more than one move.
142 // in that move, we save the value to that source.
159 // This move will be done by restoring the saved value to the destination.
224 __ Move(dst, cgen_->ToHandle(constant_source));
236 __ Move(kSavedValueRegister, cgen_->ToHandle(constant_source));
