Lines Matching defs:moves
115 ParallelMove* moves = instr->parallel_moves()[i];
116 if (moves == nullptr) continue;
117 for (MoveOperands* move : *moves) {
121 moves->clear(); // Clear this redundant move.
152 // This would pull down common moves. If the moves occur in deferred
167 ParallelMove* moves = instruction->parallel_moves()[0];
168 if (moves == nullptr) return;
190 // Elide moves made redundant by the instruction.
191 for (MoveOperands* move : *moves) {
201 for (MoveOperands* move : *moves) {
245 // We start with all the moves that don't have conflicting source or
300 // Modify the right moves in place and collect moves that will be killed by
306 // Eliminate dead moves.
312 // Add all possibly modified moves from right side.
335 // We either have no moves, or, after swapping or compressing, we have
336 // all the moves in the first gap position, and none in the second/end gap
360 // Migrate to the gap of prev_instr eligible moves from instr.
376 // things that would prevent moving gap moves across them.
381 // move down to this block (one of the successors) any of the gap moves,
398 // Accumulate set of shared moves.
434 // Not all the moves in all the gaps are the same. Maybe some are. If
435 // there are such moves, we could move them, but the destination of the
436 // moves staying behind can't appear as a source of a common move,
471 ParallelMove* moves = instr->GetOrCreateParallelMove(
483 moves->AddMove(move->source(), move->destination());
515 // slot and keep remaining moves in the first slot.