[turbofan] Improve typed lowering of JSBitwiseAnd.

test/unittests/compiler/js-typed-lowering-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/js-operator.h"
 #include "src/compiler/js-typed-lowering.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node-properties-inl.h"
@@ skipping 379 matching lines @@
     Node* const lhs = Parameter(type);
     Reduction r = Reduce(graph()->NewNode(javascript()->StrictEqual(), lhs,
                                           the_hole, context, effect, control));
     ASSERT_TRUE(r.Changed());
     EXPECT_THAT(r.replacement(), IsFalseConstant());
   }
 }
 
 
 // -----------------------------------------------------------------------------
+// JSBitwiseAnd
+
+
+TEST_F(JSTypedLoweringTest, JSBitwiseAndWithBitish) {
+  Node* const context = Parameter(Type::Any(), 2);
+  Node* const effect = graph()->start();
+  Node* const control = graph()->start();
+  Handle<Object> zero = factory()->NewNumber(0);
+  Handle<Object> one = factory()->NewNumber(1);
+  {
+    Node* const lhs = Parameter(Type::Range(one, one, zone()), 0);
+    Node* const rhs = Parameter(Type::Range(zero, one, zone()), 1);
+    Reduction r = Reduce(graph()->NewNode(javascript()->BitwiseAnd(), lhs, rhs,
+                                          context, effect, control));
+    ASSERT_TRUE(r.Changed());
+    EXPECT_EQ(rhs, r.replacement());
+  }
+  {
+    Node* const lhs = Parameter(Type::Range(one, one, zone()), 0);
+    Node* const rhs = Parameter(Type::Boolean(), 1);
+    Reduction r = Reduce(graph()->NewNode(javascript()->BitwiseAnd(), lhs, rhs,
+                                          context, effect, control));
+    ASSERT_TRUE(r.Changed());
+    EXPECT_THAT(r.replacement(), IsBooleanToNumber(rhs));
+  }
+  {
+    Node* const lhs = Parameter(Type::Range(zero, one, zone()), 0);
+    Node* const rhs = Parameter(Type::Range(one, one, zone()), 1);
+    Reduction r = Reduce(graph()->NewNode(javascript()->BitwiseAnd(), lhs, rhs,
+                                          context, effect, control));
+    ASSERT_TRUE(r.Changed());
+    EXPECT_EQ(lhs, r.replacement());
+  }
+  {
+    Node* const lhs = Parameter(Type::Boolean(), 0);
+    Node* const rhs = Parameter(Type::Range(one, one, zone()), 1);
+    Reduction r = Reduce(graph()->NewNode(javascript()->BitwiseAnd(), lhs, rhs,
+                                          context, effect, control));
+    ASSERT_TRUE(r.Changed());
+    EXPECT_THAT(r.replacement(), IsBooleanToNumber(lhs));
+  }
+}
+
+
+// -----------------------------------------------------------------------------
 // JSShiftLeft
 
 
 TEST_F(JSTypedLoweringTest, JSShiftLeftWithSigned32AndConstant) {
   Node* const lhs = Parameter(Type::Signed32());
   Node* const context = UndefinedConstant();
   Node* const effect = graph()->start();
   Node* const control = graph()->start();
   TRACED_FORRANGE(double, rhs, 0, 31) {
     Reduction r =
@@ skipping 389 matching lines @@
           IsStoreElement(
               access, IsIntPtrConstant(bit_cast<intptr_t>(&backing_store[0])),
               key, value, effect, control));
     }
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8