[turbofan] Add proper conversion operators for int32<->int64.

src/compiler/change-lowering.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/change-lowering.h"
 
 #include "src/compiler/js-graph.h"
 
 namespace v8 {
 namespace internal {
@@ skipping 70 matching lines @@
 
 
 Reduction ChangeLowering::ChangeFloat64ToTagged(Node* val, Node* control) {
   return Replace(AllocateHeapNumberWithValue(val, control));
 }
 
 
 Reduction ChangeLowering::ChangeInt32ToTagged(Node* val, Node* control) {
   if (machine()->is64()) {
     return Replace(
-        graph()->NewNode(machine()->WordShl(), val, SmiShiftBitsConstant()));
+        graph()->NewNode(machine()->Word64Shl(),
+                         graph()->NewNode(machine()->ChangeInt32ToInt64(), val),
+                         SmiShiftBitsConstant()));
   }
 
   Node* add = graph()->NewNode(machine()->Int32AddWithOverflow(), val, val);
   Node* ovf = graph()->NewNode(common()->Projection(1), add);
 
   Node* branch = graph()->NewNode(common()->Branch(), ovf, control);
 
   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
   Node* heap_number = AllocateHeapNumberWithValue(
       graph()->NewNode(machine()->ChangeInt32ToFloat64(), val), if_true);
@@ skipping 20 matching lines @@
   Node* load = graph()->NewNode(
       machine()->Load(kMachFloat64), val, HeapNumberValueIndexConstant(),
       graph()->NewNode(common()->ControlEffect(), if_true));
   Node* change = graph()->NewNode(machine()->ChangeFloat64ToInt32(), load);
 
   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
   Node* integer =
       graph()->NewNode(machine()->WordSar(), val, SmiShiftBitsConstant());
   Node* number =
       machine()->is64()
-          ? graph()->NewNode(machine()->ConvertInt64ToInt32(), integer)
+          ? graph()->NewNode(machine()->TruncateInt64ToInt32(), integer)
           : integer;
 
   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
   Node* phi = graph()->NewNode(common()->Phi(2), change, number, merge);
 
   return Replace(phi);
 }
 
 
 Reduction ChangeLowering::ChangeTaggedToFloat64(Node* val, Node* control) {
   STATIC_ASSERT(kSmiTag == 0);
   STATIC_ASSERT(kSmiTagMask == 1);
 
   Node* tag = graph()->NewNode(machine()->WordAnd(), val,
                                jsgraph()->Int32Constant(kSmiTagMask));
   Node* branch = graph()->NewNode(common()->Branch(), tag, control);
 
   Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
   Node* load = graph()->NewNode(
       machine()->Load(kMachFloat64), val, HeapNumberValueIndexConstant(),
       graph()->NewNode(common()->ControlEffect(), if_true));
 
   Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
   Node* integer =
       graph()->NewNode(machine()->WordSar(), val, SmiShiftBitsConstant());
   Node* number = graph()->NewNode(
       machine()->ChangeInt32ToFloat64(),
       machine()->is64()
-          ? graph()->NewNode(machine()->ConvertInt64ToInt32(), integer)
+          ? graph()->NewNode(machine()->TruncateInt64ToInt32(), integer)
           : integer);
 
   Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
   Node* phi = graph()->NewNode(common()->Phi(2), load, number, merge);
 
   return Replace(phi);
 }
 
 
 Isolate* ChangeLowering::isolate() const { return jsgraph()->isolate(); }
@@ skipping 23 matching lines @@
       jsgraph()->Int32Constant(function->nargs), context, effect, control);
   Node* store = graph()->NewNode(
       machine()->Store(kMachFloat64, kNoWriteBarrier), heap_number,
       HeapNumberValueIndexConstant(), value, heap_number, control);
   return graph()->NewNode(common()->Finish(1), heap_number, store);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8