Lines Matching full:moves_
17 moves_(32, owner->zone()),
28 for (int i = 0; i < moves_.length(); ++i) {
29 LMoveOperands move = moves_[i];
39 for (int i = 0; i < moves_.length(); ++i) {
40 if (!moves_[i].IsEliminated()) {
41 DCHECK(moves_[i].source()->IsConstantOperand());
73 DCHECK(!moves_[index].IsPending());
74 DCHECK(!moves_[index].IsRedundant());
78 DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated.
79 LOperand* destination = moves_[index].destination();
80 moves_[index].set_destination(NULL);
86 for (int i = 0; i < moves_.length(); ++i) {
87 LMoveOperands other_move = moves_[i];
104 moves_[index].set_destination(destination);
108 if (moves_[index].source()->Equals(destination)) {
116 for (int i = 0; i < moves_.length(); ++i) {
117 LMoveOperands other_move = moves_[i];
137 moves_.Add(move, cgen_->zone());
142 LOperand* source = moves_[index].source();
148 LOperand* destination = moves_[index].destination();
154 moves_[index].Eliminate();
160 for (int i = 0; i < moves_.length(); ++i) {
161 if (!moves_[i].IsEliminated() && moves_[i].source()->Equals(operand)) {
181 if (!moves_.is_empty()) return false;
195 for (int i = 0; i < moves_.length(); ++i) {
196 LOperand* destination = moves_[i].destination();
197 for (int j = i + 1; j < moves_.length(); ++j) {
198 SLOW_DCHECK(!destination->Equals(moves_[j].destination()));
212 moves_.Rewind(0);
254 LOperand* source = moves_[index].source();
255 LOperand* destination = moves_[index].destination();
353 LOperand* source = moves_[index].source();
354 LOperand* destination = moves_[index].destination();
454 for (int i = 0; i < moves_.length(); ++i) {
455 LMoveOperands other_move = moves_[i];
457 moves_[i].set_source(destination);
459 moves_[i].set_source(source);
