Lines Matching refs:moves_
14 moves_(32, owner->zone()),
21 DCHECK(moves_.is_empty());
25 for (int i = 0; i < moves_.length(); ++i) {
26 LMoveOperands move = moves_[i];
40 for (int i = 0; i < moves_.length(); ++i) {
41 if (!moves_[i].IsEliminated()) {
42 DCHECK(moves_[i].source()->IsConstantOperand());
47 moves_.Rewind(0);
59 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
80 DCHECK(!moves_[index].IsPending());
81 DCHECK(!moves_[index].IsRedundant());
86 DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated.
87 LOperand* destination = moves_[index].destination();
88 moves_[index].set_destination(NULL);
94 for (int i = 0; i < moves_.length(); ++i) {
95 LMoveOperands other_move = moves_[i];
98 // If there is a blocking, pending move it must be moves_[root_index_]
99 // and all other moves with the same source as moves_[root_index_] are
106 moves_[index].set_destination(destination);
111 LMoveOperands other_move = moves_[root_index_];
126 for (int i = 0; i < moves_.length(); ++i) {
127 LOperand* destination = moves_[i].destination();
128 for (int j = i + 1; j < moves_.length(); ++j) {
129 SLOW_DCHECK(!destination->Equals(moves_[j].destination()));
139 // moves_[root_index]. After performing all moves in the tree rooted
141 DCHECK(moves_[index].destination()->Equals(moves_[root_index_].source()));
144 LOperand* source = moves_[index].source();
145 saved_destination_ = moves_[index].destination();
158 moves_[index].Eliminate();
187 LOperand* source = moves_[index].source();
188 LOperand* destination = moves_[index].destination();
292 moves_[index].Eliminate();
