Lines Matching refs:moves_
16 moves_(32, owner->zone()),
27 for (int i = 0; i < moves_.length(); ++i) {
28 LMoveOperands move = moves_[i];
38 for (int i = 0; i < moves_.length(); ++i) {
39 if (!moves_[i].IsEliminated()) {
40 DCHECK(moves_[i].source()->IsConstantOperand());
72 DCHECK(!moves_[index].IsPending());
73 DCHECK(!moves_[index].IsRedundant());
77 DCHECK(moves_[index].source() != NULL); // Or else it will look eliminated.
78 LOperand* destination = moves_[index].destination();
79 moves_[index].set_destination(NULL);
85 for (int i = 0; i < moves_.length(); ++i) {
86 LMoveOperands other_move = moves_[i];
103 moves_[index].set_destination(destination);
107 if (moves_[index].source()->Equals(destination)) {
115 for (int i = 0; i < moves_.length(); ++i) {
116 LMoveOperands other_move = moves_[i];
136 moves_.Add(move, cgen_->zone());
141 LOperand* source = moves_[index].source();
147 LOperand* destination = moves_[index].destination();
153 moves_[index].Eliminate();
159 for (int i = 0; i < moves_.length(); ++i) {
160 if (!moves_[i].IsEliminated() && moves_[i].source()->Equals(operand)) {
184 if (!moves_.is_empty()) return false;
200 for (int i = 0; i < moves_.length(); ++i) {
201 LOperand* destination = moves_[i].destination();
202 for (int j = i + 1; j < moves_.length(); ++j) {
203 SLOW_DCHECK(!destination->Equals(moves_[j].destination()));
217 moves_.Rewind(0);
262 LOperand* source = moves_[index].source();
263 LOperand* destination = moves_[index].destination();
361 LOperand* source = moves_[index].source();
362 LOperand* destination = moves_[index].destination();
464 for (int i = 0; i < moves_.length(); ++i) {
465 LMoveOperands other_move = moves_[i];
467 moves_[i].set_source(destination);
469 moves_[i].set_source(source);
