[turbofan] Remove another ineffective optimization from the ControlReducer.

src/compiler/control-reducer.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/compiler/common-operator.h"
 #include "src/compiler/control-reducer.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/graph-reducer.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-marker.h"
@@ skipping 75 matching lines @@
     return result == node ? NoChange() : Replace(result);
   }
 
   // Try to statically fold a condition.
   Decision DecideCondition(Node* cond, bool recurse = true) {
     switch (cond->opcode()) {
       case IrOpcode::kInt32Constant:
         return Int32Matcher(cond).Is(0) ? kFalse : kTrue;
       case IrOpcode::kInt64Constant:
         return Int64Matcher(cond).Is(0) ? kFalse : kTrue;
-      case IrOpcode::kNumberConstant:
-        return NumberMatcher(cond).Is(0) ? kFalse : kTrue;
       case IrOpcode::kHeapConstant: {
         Handle<Object> object =
             HeapObjectMatcher<Object>(cond).Value().handle();
         return object->BooleanValue() ? kTrue : kFalse;
       }
       case IrOpcode::kPhi: {
         if (!recurse) return kUnknown;  // Only go one level deep checking phis.
         Decision result = kUnknown;
         // Check if all inputs to a phi result in the same decision.
         for (int i = cond->op()->ValueInputCount() - 1; i >= 0; i--) {
@@ skipping 267 matching lines @@
     case IrOpcode::kIfFalse:
       return impl.ReduceIfProjection(node, kFalse);
     default:
       return node;
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8