Lines Matching defs:move
12 // moves. We don't need access to roots while resolving the move list and using
35 LMoveOperands move = moves_[i];
39 if (!move.IsEliminated() && !move.source()->IsConstantOperand()) {
40 root_index_ = i; // Any cycle is found when by reaching this move again.
68 // moves to perform, ignoring any move that is redundant (the source is
70 // unallocated, or the move was already eliminated).
73 LMoveOperands move = moves->at(i);
74 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
81 // Each call to this function performs a move and deletes it from the move
82 // graph. We first recursively perform any move blocking this one. We
83 // mark a move as "pending" on entry to PerformMove in order to detect
84 // cycles in the move graph.
87 // be encountering the starting move again. So by spilling the source of
88 // the starting move, we break the cycle. All moves are then unblocked,
89 // and the starting move is completed by writing the spilled value to
98 // Clear this move's destination to indicate a pending move. The actual
105 // Perform a depth-first traversal of the move graph to resolve
106 // dependencies. Any unperformed, unpending move with a source the same
113 // If there is a blocking, pending move it must be moves_[root_index_]
119 // We are about to resolve this move and don't need it marked as
123 // The move may be blocked on a pending move, which must be the starting move.
124 // In this case, we have a cycle, and we save the source of this move to
133 // This move is no longer blocked.
140 // No operand should be the destination for more than one move.
152 // We save in a register the source of that move and we remember its
153 // destination. Then we mark this move as resolved so the cycle is
173 // This move will be done by restoring the saved value to the destination.
242 __ Move(dst, cgen_->ToHandle(constant_source));
258 __ Move(kSavedValueRegister, cgen_->ToHandle(constant_source));
