22     : cgen_(owner), moves_(32, owner->zone()), root_index_(0), in_cycle_(false),  in LGapResolver()
30   DCHECK(moves_.is_empty());  in Resolve()
34   for (int i = 0; i < moves_.length(); ++i) {  in Resolve()
35     LMoveOperands move = moves_[i];  in Resolve()
49   for (int i = 0; i < moves_.length(); ++i) {  in Resolve()
50     if (!moves_[i].IsEliminated()) {  in Resolve()
51       DCHECK(moves_[i].source()->IsConstantOperand());  in Resolve()
62   moves_.Rewind(0);  in Resolve()
74     if (!move.IsRedundant()) moves_.Add(move, cgen_->zone());  in BuildInitialMoveList()
95   DCHECK(!moves_[index].IsPending());  in PerformMove()
96   DCHECK(!moves_[index].IsRedundant());  in PerformMove()
101   DCHECK(moves_[index].source() != NULL);  // Or else it will look eliminated.  in PerformMove()
102   LOperand* destination = moves_[index].destination();  in PerformMove()
103   moves_[index].set_destination(NULL);  in PerformMove()
109   for (int i = 0; i < moves_.length(); ++i) {  in PerformMove()
110     LMoveOperands other_move = moves_[i];  in PerformMove()
121   moves_[index].set_destination(destination);  in PerformMove()
126   LMoveOperands other_move = moves_[root_index_];  in PerformMove()
141   for (int i = 0; i < moves_.length(); ++i) {  in Verify()
142     LOperand* destination = moves_[i].destination();  in Verify()
143     for (int j = i + 1; j < moves_.length(); ++j) {  in Verify()
144       SLOW_DCHECK(!destination->Equals(moves_[j].destination()));  in Verify()
155   DCHECK(moves_[index].destination()->Equals(moves_[root_index_].source()));  in BreakCycle()
158   LOperand* source = moves_[index].source();  in BreakCycle()
159   saved_destination_ = moves_[index].destination();  in BreakCycle()
174   moves_[index].Eliminate();  in BreakCycle()
200   LOperand* source = moves_[index].source();  in EmitMove()
201   LOperand* destination = moves_[index].destination();  in EmitMove()
294   moves_[index].Eliminate();  in EmitMove()