Lines Matching defs:target
136 void EmitSingleParallelMove(Register source, Register target,
138 DCHECK(!moves[target.code()].is_valid());
139 __ movq(target, source);
144 Register target, RegisterMoves& moves) {
145 if (target == chain_start) {
146 // The target of this move is the start of the move chain -- this
151 EmitSingleParallelMove(target, kScratchRegister, moves);
152 EmitSingleParallelMove(source, target, moves);
156 if (moves[target.code()].is_valid()) {
157 is_cycle = RecursivelyEmitParallelMoveChain(chain_start, target,
158 moves[target.code()], moves);
163 EmitSingleParallelMove(kScratchRegister, target, moves);
166 EmitSingleParallelMove(source, target, moves);
172 Register target = moves[source.code()];
173 if (!target.is_valid()) return;
175 DCHECK_NE(source, target);
176 RecursivelyEmitParallelMoveChain(source, source, target, moves);
180 Register target) {
182 __ movq(target, GetStackSlot(compiler::AllocatedOperand::cast(source)));
205 compiler::AllocatedOperand target,
208 if (target.IsRegister()) {
209 RecordGapMove(source, ToRegister(target), register_moves,
218 __ movq(GetStackSlot(target), source_reg);
221 __ movq(GetStackSlot(target), kScratchRegister);
227 BasicBlock* target = node->target();
228 if (!target->has_state()) {
238 // register_moves[source] = target.
246 // stack_to_register_moves[target] = source.
251 for (auto entry : target->state()->register_state()) {
267 if (target->has_phi()) {
268 Phi::List* phis = target->phis();
272 compiler::AllocatedOperand target =
276 ss << "-- * " << source << " → " << target << " (n"
280 RecordGapMove(source, target, register_moves, stack_to_register_moves);