Change the algorithm and generated code for parallel moves on IA32.

src/arm/lithium-codegen-arm.cc

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 154 matching lines @@
 }
 
 
 bool LGapResolver::CanReach(LGapNode* a, LGapNode* b) {
   ASSERT(a != b);
   return CanReach(a, b, next_visited_id_++);
 }
 
 
 void LGapResolver::RegisterMove(LMoveOperands move) {
-  if (move.from()->IsConstantOperand()) {
+  if (move.source()->IsConstantOperand()) {
     // Constant moves should be last in the machine code. Therefore add them
     // first to the result set.
-    AddResultMove(move.from(), move.to());
+    AddResultMove(move.source(), move.destination());
   } else {
-    LGapNode* from = LookupNode(move.from());
-    LGapNode* to = LookupNode(move.to());
+    LGapNode* from = LookupNode(move.source());
+    LGapNode* to = LookupNode(move.destination());
     if (to->IsAssigned() && to->assigned_from() == from) {
       move.Eliminate();
       return;
     }
     ASSERT(!to->IsAssigned());
     if (CanReach(from, to)) {
       // This introduces a cycle. Save.
       identified_cycles_.Add(from);
     }
     to->set_assigned_from(from);
@@ skipping 617 matching lines @@
   DoubleRegister dbl_scratch = d0;
   LUnallocated marker_operand(LUnallocated::NONE);
 
   Register core_scratch = scratch0();
   bool destroys_core_scratch = false;
 
   const ZoneList<LMoveOperands>* moves =
       resolver_.Resolve(move->move_operands(), &marker_operand);
   for (int i = moves->length() - 1; i >= 0; --i) {
     LMoveOperands move = moves->at(i);
-    LOperand* from = move.from();
-    LOperand* to = move.to();
+    LOperand* from = move.source();
+    LOperand* to = move.destination();
     ASSERT(!from->IsDoubleRegister() ||
            !ToDoubleRegister(from).is(dbl_scratch));
     ASSERT(!to->IsDoubleRegister() || !ToDoubleRegister(to).is(dbl_scratch));
     ASSERT(!from->IsRegister() || !ToRegister(from).is(core_scratch));
     ASSERT(!to->IsRegister() || !ToRegister(to).is(core_scratch));
     if (from == &marker_operand) {
       if (to->IsRegister()) {
         __ mov(ToRegister(to), core_scratch);
         ASSERT(destroys_core_scratch);
       } else if (to->IsStackSlot()) {
@@ skipping 2348 matching lines @@
 
 
 void LCodeGen::DoOsrEntry(LOsrEntry* instr) {
   Abort("DoOsrEntry unimplemented.");
 }
 
 
 #undef __
 
 } }  // namespace v8::internal