Index: src/compiler/simplified-operator-reducer.cc |
diff --git a/src/compiler/simplified-operator-reducer.cc b/src/compiler/simplified-operator-reducer.cc |
index 21a18eacce27eac0b98492bb387fe20c6f8070ce..a1a6a02bc89381481d961f9e7c22047b6a86e5bb 100644 |
--- a/src/compiler/simplified-operator-reducer.cc |
+++ b/src/compiler/simplified-operator-reducer.cc |
@@ -102,8 +102,8 @@ Reduction SimplifiedOperatorReducer::Reduce(Node* node) { |
case IrOpcode::kLoadElement: { |
ElementAccess access = ElementAccessOf(node->op()); |
if (access.bounds_check == kTypedArrayBoundsCheck) { |
- NumericValueMatcher mkey(node->InputAt(1)); |
- NumericValueMatcher mlength(node->InputAt(2)); |
+ NumberMatcher mkey(node->InputAt(1)); |
+ NumberMatcher mlength(node->InputAt(2)); |
if (mkey.HasValue() && mlength.HasValue()) { |
// Skip the typed array bounds check if key and length are constant. |
if (mkey.Value() >= 0 && mkey.Value() < mlength.Value()) { |
@@ -118,8 +118,8 @@ Reduction SimplifiedOperatorReducer::Reduce(Node* node) { |
case IrOpcode::kStoreElement: { |
ElementAccess access = ElementAccessOf(node->op()); |
if (access.bounds_check == kTypedArrayBoundsCheck) { |
- NumericValueMatcher mkey(node->InputAt(1)); |
- NumericValueMatcher mlength(node->InputAt(2)); |
+ NumberMatcher mkey(node->InputAt(1)); |
+ NumberMatcher mlength(node->InputAt(2)); |
if (mkey.HasValue() && mlength.HasValue()) { |
// Skip the typed array bounds check if key and length are constant. |
if (mkey.Value() >= 0 && mkey.Value() < mlength.Value()) { |