Lines Matching refs:moves_
16 moves_(32, owner->zone()),
22 DCHECK(moves_.is_empty());
26 for (int i = 0; i < moves_.length(); ++i) {
27 LMoveOperands move = moves_[i];
41 for (int i = 0; i < moves_.length(); ++i) {
42 if (!moves_[i].IsEliminated()) {
43 DCHECK(moves_[i].source()->IsConstantOperand());
48 moves_.Rewind(0);
59 if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());
79 DCHECK(!moves_[index].IsPending());
80 DCHECK(!moves_[index].IsRedundant());
85 DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated.
86 LOperand* destination = moves_[index].destination();
87 moves_[index].set_destination(NULL);
93 for (int i = 0; i < moves_.length(); ++i) {
94 LMoveOperands other_move = moves_[i];
97 // If there is a blocking, pending move it must be moves_[root_index_]
98 // and all other moves with the same source as moves_[root_index_] are
105 moves_[index].set_destination(destination);
110 LMoveOperands other_move = moves_[root_index_];
124 for (int i = 0; i < moves_.length(); ++i) {
125 LOperand* destination = moves_[i].destination();
126 for (int j = i + 1; j < moves_.length(); ++j) {
127 SLOW_DCHECK(!destination->Equals(moves_[j].destination()));
137 // moves_[root_index]. After performing all moves in the tree rooted
139 DCHECK(moves_[index].destination()->Equals(moves_[root_index_].source()));
142 LOperand* source = moves_[index].source();
143 saved_destination_ = moves_[index].destination();
156 moves_[index].Eliminate();
181 LOperand* source = moves_[index].source();
182 LOperand* destination = moves_[index].destination();
275 moves_[index].Eliminate();
