Lines Matching refs:moves_
16 moves_(32, owner->zone()),
23 DCHECK(moves_.is_empty());
27 for (int i = 0; i < moves_.length(); ++i) {
28 LMoveOperands move = moves_[i];
42 for (int i = 0; i < moves_.length(); ++i) {
43 if (!moves_[i].IsEliminated()) {
44 DCHECK(moves_[i].source()->IsConstantOperand());
49 moves_.Rewind(0);
61 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
82 DCHECK(!moves_[index].IsPending());
83 DCHECK(!moves_[index].IsRedundant());
88 DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated.
89 LOperand* destination = moves_[index].destination();
90 moves_[index].set_destination(NULL);
96 for (int i = 0; i < moves_.length(); ++i) {
97 LMoveOperands other_move = moves_[i];
100 // If there is a blocking, pending move it must be moves_[root_index_]
101 // and all other moves with the same source as moves_[root_index_] are
108 moves_[index].set_destination(destination);
113 LMoveOperands other_move = moves_[root_index_];
128 for (int i = 0; i < moves_.length(); ++i) {
129 LOperand* destination = moves_[i].destination();
130 for (int j = i + 1; j < moves_.length(); ++j) {
131 SLOW_DCHECK(!destination->Equals(moves_[j].destination()));
141 // moves_[root_index]. After performing all moves in the tree rooted
143 DCHECK(moves_[index].destination()->Equals(moves_[root_index_].source()));
146 LOperand* source = moves_[index].source();
147 saved_destination_ = moves_[index].destination();
160 moves_[index].Eliminate();
187 LOperand* source = moves_[index].source();
188 LOperand* destination = moves_[index].destination();
281 moves_[index].Eliminate();
