Lines Matching full:moves
14 // moves. We don't need access to roots while resolving the move list and using
17 // with any of the moves we are resolving.
33 // Build up a worklist of moves.
38 // Skip constants to perform them last. They don't block other moves
39 // and skipping such moves with register destinations keeps those
50 // Perform the moves with constant sources.
69 // Perform a linear sweep of the moves to add them to the initial list of
70 // moves to perform, ignoring any move that is redundant (the source is
73 const ZoneList<LMoveOperands>* moves = parallel_move->move_operands();
74 for (int i = 0; i < moves->length(); ++i) {
75 LMoveOperands move = moves->at(i);
88 // We can only find a cycle, when doing a depth-first traversal of moves,
90 // the starting move, we break the cycle. All moves are then unblocked,
92 // its destination. All other moves from the spilled source have been
94 // An additional complication is that moves to MemOperands with large
101 // destination is saved in a stack allocated local. Multiple moves can
110 // such moves.
116 // and all other moves with the same source as moves_[root_index_] are
156 // broken and we can perform the other moves.
252 DCHECK(!in_cycle_); // Constant moves happen after all cycles are gone.
