Lines Matching refs:moves_
38 moves_(32),
45 ASSERT(moves_.is_empty());
49 for (int i = 0; i < moves_.length(); ++i) {
50 LMoveOperands move = moves_[i];
64 for (int i = 0; i < moves_.length(); ++i) {
65 if (!moves_[i].IsEliminated()) {
66 ASSERT(moves_[i].source()->IsConstantOperand());
71 moves_.Rewind(0);
83 if (!move.IsRedundant()) moves_.Add(move);
104 ASSERT(!moves_[index].IsPending());
105 ASSERT(!moves_[index].IsRedundant());
110 ASSERT(moves_[index].source() != NULL); // Or else it will look eliminated.
111 LOperand* destination = moves_[index].destination();
112 moves_[index].set_destination(NULL);
118 for (int i = 0; i < moves_.length(); ++i) {
119 LMoveOperands other_move = moves_[i];
122 // If there is a blocking, pending move it must be moves_[root_index_]
123 // and all other moves with the same source as moves_[root_index_] are
130 moves_[index].set_destination(destination);
135 LMoveOperands other_move = moves_[root_index_];
150 for (int i = 0; i < moves_.length(); ++i) {
151 LOperand* destination = moves_[i].destination();
152 for (int j = i + 1; j < moves_.length(); ++j) {
153 SLOW_ASSERT(!destination->Equals(moves_[j].destination()));
163 // moves_[root_index]. After performing all moves in the tree rooted
165 ASSERT(moves_[index].destination()->Equals(moves_[root_index_].source()));
168 LOperand* source = moves_[index].source();
169 saved_destination_ = moves_[index].destination();
182 moves_[index].Eliminate();
211 LOperand* source = moves_[index].source();
212 LOperand* destination = moves_[index].destination();
310 moves_[index].Eliminate();
