[turbofan] Remove ineffective optimization from ControlReducer.

test/unittests/compiler/control-reducer-unittest.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/control-reducer.h"
 #include "src/compiler/diamond.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/js-operator.h"
 #include "src/compiler/machine-operator.h"
@@ skipping 127 matching lines @@
   ReduceGraph();
 
   // Branch should not be folded.
   EXPECT_THAT(phi1,
               IsPhi(kMachInt32, IsInt32Constant(111), IsInt32Constant(222),
                     IsMerge(IsIfTrue(branch1), IsIfFalse(branch1))));
   EXPECT_THAT(graph()->end(), IsEnd(IsReturn(phi1, graph()->start(), merge1)));
 }
 
 
-TEST_F(ControlReducerTest, RangeAsInputToBranch_true1) {
-  Node* p0 = Parameter(Type::Range(1, 2, zone()), 0);
-  Node* branch1 = graph()->NewNode(common()->Branch(), p0, graph()->start());
-  Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
-  Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
-  Node* merge1 = graph()->NewNode(common()->Merge(1), if_true1, if_false1);
-  Node* result = graph()->NewNode(common()->Phi(kMachInt32, 2),
-                                  jsgraph()->Int32Constant(11),
-                                  jsgraph()->Int32Constant(44), merge1);
-
-  Node* ret =
-      graph()->NewNode(common()->Return(), result, graph()->start(), merge1);
-  graph()->end()->ReplaceInput(0, ret);
-
-  ReduceGraph();
-
-  // Diamond should be folded away.
-  EXPECT_THAT(
-      graph()->end(),
-      IsEnd(IsReturn(IsInt32Constant(11), graph()->start(), graph()->start())));
-}
-
-
-TEST_F(ControlReducerTest, RangeAsInputToBranch_true2) {
-  Node* p0 = Parameter(Type::Range(-2, -1, zone()), 0);
-  Node* branch1 = graph()->NewNode(common()->Branch(), p0, graph()->start());
-  Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
-  Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
-  Node* merge1 = graph()->NewNode(common()->Merge(1), if_true1, if_false1);
-  Node* result = graph()->NewNode(common()->Phi(kMachInt32, 2),
-                                  jsgraph()->Int32Constant(11),
-                                  jsgraph()->Int32Constant(44), merge1);
-
-  Node* ret =
-      graph()->NewNode(common()->Return(), result, graph()->start(), merge1);
-  graph()->end()->ReplaceInput(0, ret);
-
-  ReduceGraph();
-
-  // Diamond should be folded away.
-  EXPECT_THAT(
-      graph()->end(),
-      IsEnd(IsReturn(IsInt32Constant(11), graph()->start(), graph()->start())));
-}
-
-
 TEST_F(ControlReducerTest, SelectPhi) {
   Node* p0 = Parameter(0);
   const MachineType kType = kMachInt32;
   Diamond d(graph(), common(), p0);
   Node* phi =
       d.Phi(kType, jsgraph()->Int32Constant(1), jsgraph()->Int32Constant(2));
 
   Node* ret =
       graph()->NewNode(common()->Return(), phi, graph()->start(), d.merge);
   graph()->end()->ReplaceInput(0, ret);
@@ skipping 51 matching lines @@
       IsReturn(IsInt32Add(
                    IsSelect(kType, p0, IsInt32Constant(1), IsInt32Constant(2)),
                    IsSelect(kType, p0, IsInt32Constant(2), IsInt32Constant(3))),
                graph()->start(), graph()->start()));
   EXPECT_THAT(graph()->end(), IsEnd(ret));
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8