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