| Index: src/compiler/simplified-operator-reducer.cc
|
| diff --git a/src/compiler/simplified-operator-reducer.cc b/src/compiler/simplified-operator-reducer.cc
|
| index afc08858d78026cdcb1811130899cebfee111e0c..0868cab3fc7e57d11a75b92a3e515ee927f4864b 100644
|
| --- a/src/compiler/simplified-operator-reducer.cc
|
| +++ b/src/compiler/simplified-operator-reducer.cc
|
| @@ -98,38 +98,6 @@ Reduction SimplifiedOperatorReducer::Reduce(Node* node) {
|
| if (m.HasValue()) return ReplaceNumber(FastUI2D(m.Value()));
|
| break;
|
| }
|
| - case IrOpcode::kLoadElement: {
|
| - ElementAccess access = ElementAccessOf(node->op());
|
| - if (access.bounds_check == kTypedArrayBoundsCheck) {
|
| - 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()) {
|
| - access.bounds_check = kNoBoundsCheck;
|
| - node->set_op(simplified()->LoadElement(access));
|
| - return Changed(node);
|
| - }
|
| - }
|
| - }
|
| - break;
|
| - }
|
| - case IrOpcode::kStoreElement: {
|
| - ElementAccess access = ElementAccessOf(node->op());
|
| - if (access.bounds_check == kTypedArrayBoundsCheck) {
|
| - 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()) {
|
| - access.bounds_check = kNoBoundsCheck;
|
| - node->set_op(simplified()->StoreElement(access));
|
| - return Changed(node);
|
| - }
|
| - }
|
| - }
|
| - break;
|
| - }
|
| default:
|
| break;
|
| }
|
|
|