[wasm] Some cleanup in the Int64Lowering.

test/unittests/compiler/int64-lowering-unittest.cc

 // Copyright 2016 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/int64-lowering.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node.h"
 
@@ skipping 290 matching lines @@
 
 // todo(ahaas): I added a list of missing instructions here to make merging
 // easier when I do them one by one.
 // kExprI64Add:
 // kExprI64Sub:
 // kExprI64Mul:
 // kExprI64DivS:
 // kExprI64DivU:
 // kExprI64RemS:
 // kExprI64RemU:
-// kExprI64And:
 // kExprI64Ior:
 TEST_F(Int64LoweringTest, Int64Ior) {
   LowerGraph(graph()->NewNode(machine()->Word64Or(), Int64Constant(value(0)),
                               Int64Constant(value(1))),
              MachineRepresentation::kWord64);
   EXPECT_THAT(graph()->end()->InputAt(1),
               IsReturn2(IsWord32Or(IsInt32Constant(low_word_value(0)),
                                    IsInt32Constant(low_word_value(1))),
                         IsWord32Or(IsInt32Constant(high_word_value(0)),
                                    IsInt32Constant(high_word_value(1))),
@@ skipping 39 matching lines @@
       graph()->end()->InputAt(1),
       IsReturn(IsWord32Equal(
                    IsWord32Or(IsWord32Xor(IsInt32Constant(low_word_value(0)),
                                           IsInt32Constant(low_word_value(1))),
                               IsWord32Xor(IsInt32Constant(high_word_value(0)),
                                           IsInt32Constant(high_word_value(1)))),
                    IsInt32Constant(0)),
                start(), start()));
 }
 
-// kExprI64Ne:
 // kExprI64LtS:
 TEST_F(Int64LoweringTest, Int64LtS) {
   TestComparison(machine()->Int64LessThan(), IsInt32LessThan, IsUint32LessThan);
 }
 // kExprI64LeS:
 TEST_F(Int64LoweringTest, Int64LeS) {
   TestComparison(machine()->Int64LessThanOrEqual(), IsInt32LessThan,
                  IsUint32LessThanOrEqual);
 }
 // kExprI64LtU:
 TEST_F(Int64LoweringTest, Int64LtU) {
   TestComparison(machine()->Uint64LessThan(), IsUint32LessThan,
                  IsUint32LessThan);
 }
 // kExprI64LeU:
 TEST_F(Int64LoweringTest, Int64LeU) {
   TestComparison(machine()->Uint64LessThanOrEqual(), IsUint32LessThan,
                  IsUint32LessThanOrEqual);
 }
 
 // kExprI32ConvertI64:
+TEST_F(Int64LoweringTest, I32ConvertI64) {
+  LowerGraph(graph()->NewNode(machine()->TruncateInt64ToInt32(),
+                              Int64Constant(value(0))),
+             MachineRepresentation::kWord32);
+  EXPECT_THAT(graph()->end()->InputAt(1),
+              IsReturn(IsInt32Constant(low_word_value(0)), start(), start()));
+}
 // kExprI64SConvertI32:
 // kExprI64UConvertI32:
 
 // kExprF64ReinterpretI64:
 // kExprI64ReinterpretF64:
 
 // kExprI64Clz:
 // kExprI64Ctz:
 // kExprI64Popcnt:
-
-// kExprF32SConvertI64:
-// kExprF32UConvertI64:
-// kExprF64SConvertI64:
-// kExprF64UConvertI64:
-// kExprI64SConvertF32:
-// kExprI64SConvertF64:
-// kExprI64UConvertF32:
-// kExprI64UConvertF64:
-
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8