Home | History | Annotate | Download | only in ia32

Lines Matching refs:moves_

40       moves_(32),
51 for (int i = 0; i < moves_.length(); ++i) {
52 LMoveOperands move = moves_[i];
62 for (int i = 0; i < moves_.length(); ++i) {
63 if (!moves_[i].IsEliminated()) {
64 ASSERT(moves_[i].source()->IsConstantOperand());
96 ASSERT(!moves_[index].IsPending());
97 ASSERT(!moves_[index].IsRedundant());
101 ASSERT(moves_[index].source() != NULL); // Or else it will look eliminated.
102 LOperand* destination = moves_[index].destination();
103 moves_[index].set_destination(NULL);
109 for (int i = 0; i < moves_.length(); ++i) {
110 LMoveOperands other_move = moves_[i];
127 moves_[index].set_destination(destination);
131 if (moves_[index].source()->Equals(destination)) {
139 for (int i = 0; i < moves_.length(); ++i) {
140 LMoveOperands other_move = moves_[i];
160 moves_.Add(move);
165 LOperand* source = moves_[index].source();
171 LOperand* destination = moves_[index].destination();
177 moves_[index].Eliminate();
183 for (int i = 0; i < moves_.length(); ++i) {
184 if (!moves_[i].IsEliminated() && moves_[i].source()->Equals(operand)) {
204 if (!moves_.is_empty()) return false;
218 for (int i = 0; i < moves_.length(); ++i) {
219 LOperand* destination = moves_[i].destination();
220 for (int j = i + 1; j < moves_.length(); ++j) {
221 SLOW_ASSERT(!destination->Equals(moves_[j].destination()));
235 moves_.Rewind(0);
277 LOperand* source = moves_[index].source();
278 LOperand* destination = moves_[index].destination();
359 LOperand* source = moves_[index].source();
360 LOperand* destination = moves_[index].destination();
462 for (int i = 0; i < moves_.length(); ++i) {
463 LMoveOperands other_move = moves_[i];
465 moves_[i].set_source(destination);
467 moves_[i].set_source(source);