[interpreter] Collect type feedback from bitwise binary ops handlers.

src/compiler/bytecode-graph-builder.cc

 // Copyright 2015 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/bytecode-graph-builder.h"
 
 #include "src/compiler/bytecode-branch-analysis.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/operator-properties.h"
 #include "src/interpreter/bytecodes.h"
@@ skipping 1168 matching lines @@
   DCHECK_EQ(FeedbackVectorSlotKind::GENERAL, feedback_vector()->GetKind(slot));
   Object* feedback = feedback_vector()->Get(slot);
   BinaryOperationHint hint = BinaryOperationHint::kAny;
   if (feedback->IsSmi()) {
     hint = BinaryOperationHintFromFeedback((Smi::cast(feedback))->value());
   }
   return hint;
 }
 
 void BytecodeGraphBuilder::VisitAdd() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->Add(hint));
+  BuildBinaryOp(javascript()->Add(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitSub() {
   BuildBinaryOp(javascript()->Subtract(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitMul() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->Multiply(hint));
+  BuildBinaryOp(javascript()->Multiply(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitDiv() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->Divide(hint));
+  BuildBinaryOp(javascript()->Divide(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitMod() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->Modulus(hint));
+  BuildBinaryOp(javascript()->Modulus(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitBitwiseOr() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->BitwiseOr(hint));
+  BuildBinaryOp(javascript()->BitwiseOr(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitBitwiseXor() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->BitwiseXor(hint));
+  BuildBinaryOp(javascript()->BitwiseXor(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitBitwiseAnd() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->BitwiseAnd(hint));
+  BuildBinaryOp(javascript()->BitwiseAnd(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitShiftLeft() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->ShiftLeft(hint));
+  BuildBinaryOp(javascript()->ShiftLeft(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitShiftRight() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->ShiftRight(hint));
+  BuildBinaryOp(javascript()->ShiftRight(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::VisitShiftRightLogical() {
-  BinaryOperationHint hint = BinaryOperationHint::kAny;
-  BuildBinaryOp(javascript()->ShiftRightLogical(hint));
+  BuildBinaryOp(javascript()->ShiftRightLogical(GetBinaryOperationHint()));
 }
 
 void BytecodeGraphBuilder::BuildBinaryOpWithImmediate(const Operator* js_op) {
   FrameStateBeforeAndAfter states(this);
   Node* left =
       environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(1));
   Node* right = jsgraph()->Constant(bytecode_iterator().GetImmediateOperand(0));
   Node* node = NewNode(js_op, left, right);
   environment()->BindAccumulator(node, &states);
 }
@@ skipping 646 matching lines @@
     // Phi does not exist yet, introduce one.
     value = NewPhi(inputs, value, control);
     value->ReplaceInput(inputs - 1, other);
   }
   return value;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8