[turbofan] Correctify representation changes to bit.

test/unittests/compiler/simplified-operator-reducer-unittest.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/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/simplified-operator-reducer.h"
 #include "src/conversions.h"
@@ skipping 280 matching lines @@
   Node* param0 = Parameter(0);
   Reduction reduction = Reduce(graph()->NewNode(
       simplified()->ChangeBoolToBit(),
       graph()->NewNode(simplified()->ChangeBitToBool(), param0)));
   ASSERT_TRUE(reduction.Changed());
   EXPECT_EQ(param0, reduction.replacement());
 }
 
 
 // -----------------------------------------------------------------------------
+// ChangeWord32ToBit
+
+
+TEST_F(SimplifiedOperatorReducerTest, ChangeWord32ToBitWithBitType) {
+  Handle<Object> zero = factory()->NewNumber(0);
+  Handle<Object> one = factory()->NewNumber(1);
+  Type* const kBitTypes[] = {
+      Type::Constant(zero, zone()), Type::Constant(one, zone()),
+      Type::Range(zero, zero, zone()), Type::Range(one, one, zone()),
+      Type::Range(zero, one, zone())};
+  TRACED_FOREACH(Type*, type, kBitTypes) {
+    Node* param0 = Parameter(type, 0);
+    Reduction reduction =
+        Reduce(graph()->NewNode(simplified()->ChangeWord32ToBit(), param0));
+    ASSERT_TRUE(reduction.Changed());
+    EXPECT_EQ(param0, reduction.replacement());
+  }
+}
+
+
+// -----------------------------------------------------------------------------
 // ChangeFloat64ToTagged
 
 
 TEST_F(SimplifiedOperatorReducerTest, ChangeFloat64ToTaggedWithConstant) {
   TRACED_FOREACH(double, n, kFloat64Values) {
     Reduction reduction = Reduce(graph()->NewNode(
         simplified()->ChangeFloat64ToTagged(), Float64Constant(n)));
     ASSERT_TRUE(reduction.Changed());
     EXPECT_THAT(reduction.replacement(), IsNumberConstant(BitEq(n)));
   }
@@ skipping 200 matching lines @@
         Reduce(graph()->NewNode(simplified()->ChangeUint32ToTagged(),
                                 Int32Constant(bit_cast<int32_t>(n))));
     ASSERT_TRUE(reduction.Changed());
     EXPECT_THAT(reduction.replacement(), IsNumberConstant(BitEq(FastUI2D(n))));
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8