[turbofan] Adds speculative operator for bitwise and, or and xor.

src/compiler/js-typed-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/code-factory.h"
 #include "src/compilation-dependencies.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/js-typed-lowering.h"
 #include "src/compiler/linkage.h"
@@ skipping 563 matching lines @@
   if (r.BothInputsAre(Type::PlainPrimitive())) {
     // JSModulus(x:plain-primitive,
     //           y:plain-primitive) => NumberModulus(ToNumber(x), ToNumber(y))
     r.ConvertInputsToNumber();
     return r.ChangeToPureOperator(simplified()->NumberModulus(),
                                   Type::Number());
   }
   return NoChange();
 }
 
-Reduction JSTypedLowering::ReduceInt32Binop(Node* node, const Operator* intOp) {
+Reduction JSTypedLowering::ReduceInt32Binop(Node* node,
+                                            const Operator* int_op) {
   if (flags() & kDisableIntegerBinaryOpReduction) return NoChange();
-
   JSBinopReduction r(this, node);
+  BinaryOperationHints::Hint feedback = r.GetNumberBinaryOperationFeedback();
+  if (feedback != BinaryOperationHints::kAny) {
+    Operator const* speculative_op;
+    if (int_op->opcode() == IrOpcode::kNumberBitwiseAnd) {
+      speculative_op = simplified()->SpeculativeNumberBitwiseAnd(feedback);
+    } else if (int_op->opcode() == IrOpcode::kNumberBitwiseOr) {
+      speculative_op = simplified()->SpeculativeNumberBitwiseOr(feedback);
+    } else {
+      DCHECK_EQ(IrOpcode::kNumberBitwiseXor, int_op->opcode());
+      speculative_op = simplified()->SpeculativeNumberBitwiseXor(feedback);
+    }
+    return r.ChangeToSpeculativeOperator(speculative_op, Type::Signed32());
+  }
   r.ConvertInputsToNumber();
   r.ConvertInputsToUI32(kSigned, kSigned);
-  return r.ChangeToPureOperator(intOp, Type::Integral32());
+  return r.ChangeToPureOperator(int_op, Type::Signed32());
 }
 
 Reduction JSTypedLowering::ReduceUI32Shift(Node* node,
                                            Signedness left_signedness,
                                            const Operator* shift_op) {
   JSBinopReduction r(this, node);
   BinaryOperationHints::Hint feedback = r.GetNumberBinaryOperationFeedback();
   if (feedback != BinaryOperationHints::kAny) {
     Operator const* speculative_op;
     if (shift_op->opcode() == IrOpcode::kNumberShiftLeft) {
       speculative_op = simplified()->SpeculativeNumberShiftLeft(feedback);
     } else if (shift_op->opcode() == IrOpcode::kNumberShiftRightLogical) {
       speculative_op =
           simplified()->SpeculativeNumberShiftRightLogical(feedback);
     } else {
-      DCHECK(shift_op->opcode() == IrOpcode::kNumberShiftRight);
+      DCHECK_EQ(IrOpcode::kNumberShiftRight, shift_op->opcode());
       speculative_op = simplified()->SpeculativeNumberShiftRight(feedback);
     }
     return r.ChangeToSpeculativeOperator(
         speculative_op, shift_op->opcode() == IrOpcode::kNumberShiftRightLogical
                             ? Type::Unsigned32()
                             : Type::Signed32());
   }
 
   // If deoptimization is enabled we rely on type feedback.
   if (r.BothInputsAre(Type::PlainPrimitive()) ||
@@ skipping 1536 matching lines @@
 }
 
 
 CompilationDependencies* JSTypedLowering::dependencies() const {
   return dependencies_;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8