Lines Matching refs:moves_
22 : cgen_(owner), moves_(32, owner->zone()), root_index_(0), in_cycle_(false),
30 DCHECK(moves_.is_empty());
34 for (int i = 0; i < moves_.length(); ++i) {
35 LMoveOperands move = moves_[i];
49 for (int i = 0; i < moves_.length(); ++i) {
50 if (!moves_[i].IsEliminated()) {
51 DCHECK(moves_[i].source()->IsConstantOperand());
62 moves_.Rewind(0);
74 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
95 DCHECK(!moves_[index].IsPending());
96 DCHECK(!moves_[index].IsRedundant());
101 DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated.
102 LOperand* destination = moves_[index].destination();
103 moves_[index].set_destination(NULL);
109 for (int i = 0; i < moves_.length(); ++i) {
110 LMoveOperands other_move = moves_[i];
113 // If there is a blocking, pending move it must be moves_[root_index_]
114 // and all other moves with the same source as moves_[root_index_] are
121 moves_[index].set_destination(destination);
126 LMoveOperands other_move = moves_[root_index_];
141 for (int i = 0; i < moves_.length(); ++i) {
142 LOperand* destination = moves_[i].destination();
143 for (int j = i + 1; j < moves_.length(); ++j) {
144 SLOW_DCHECK(!destination->Equals(moves_[j].destination()));
155 DCHECK(moves_[index].destination()->Equals(moves_[root_index_].source()));
158 LOperand* source = moves_[index].source();
159 saved_destination_ = moves_[index].destination();
174 moves_[index].Eliminate();
200 LOperand* source = moves_[index].source();
201 LOperand* destination = moves_[index].destination();
294 moves_[index].Eliminate();
