Lines Matching refs:move

57     for (MoveOperands* move : *moves) {  in GapsCanMoveOver()
58 if (operands.count(move->source()) > 0 || in GapsCanMoveOver()
59 operands.count(move->destination()) > 0) { in GapsCanMoveOver()
73 for (MoveOperands* move : *moves) { in FindFirstNonEmptySlot()
74 if (!move->IsRedundant()) return i; in FindFirstNonEmptySlot()
75 move->Eliminate(); in FindFirstNonEmptySlot()
129 for (MoveOperands* move : *right) { in CompressMoves()
130 if (move->IsRedundant()) continue; in CompressMoves()
131 MoveOperands* to_eliminate = left->PrepareInsertAfter(move); in CompressMoves()
141 for (MoveOperands* move : *right) { in CompressMoves()
142 if (move->IsRedundant()) continue; in CompressMoves()
143 left->push_back(move); in CompressMoves()
235 for (const MoveOperands* move : *instr->parallel_moves()[0]) { in OptimizeMerge()
236 if (move->IsRedundant()) continue; in OptimizeMerge()
237 InstructionOperand src = move->source(); in OptimizeMerge()
238 InstructionOperand dst = move->destination(); in OptimizeMerge()
274 for (MoveOperands* move : *LastInstruction(pred)->parallel_moves()[0]) { in OptimizeMerge()
275 if (move->IsRedundant()) continue; in OptimizeMerge()
276 MoveKey key = {move->source(), move->destination()}; in OptimizeMerge()
281 moves->AddMove(move->source(), move->destination()); in OptimizeMerge()
283 move->Eliminate(); in OptimizeMerge()
320 for (MoveOperands* move : *instr->parallel_moves()[0]) { in FinalizeMoves()
321 if (move->IsRedundant()) continue; in FinalizeMoves()
322 if (move->source().IsConstant() || IsSlot(move->source())) { in FinalizeMoves()
323 loads.push_back(move); in FinalizeMoves()