Fix typed lowering of ToBoolean on NaN input.

test/cctest/compiler/test-js-typed-lowering.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/v8.h"
 #include "test/cctest/cctest.h"
 
 #include "src/compiler/graph-inl.h"
 #include "src/compiler/js-typed-lowering.h"
 #include "src/compiler/node-properties-inl.h"
@@ skipping 455 matching lines @@
   {  // ToBoolean(null)
     Node* r = R.ReduceUnop(op, Type::Null());
     R.CheckFalse(r);
   }
 
   {  // ToBoolean(boolean)
     Node* r = R.ReduceUnop(op, Type::Boolean());
     CHECK_EQ(IrOpcode::kParameter, r->opcode());
   }
 
-  {  // ToBoolean(number)
-    Node* r = R.ReduceUnop(op, Type::Number());
+  {  // ToBoolean(ordered-number)
+    Node* r = R.ReduceUnop(op, Type::OrderedNumber());
     CHECK_EQ(IrOpcode::kBooleanNot, r->opcode());
     Node* i = r->InputAt(0);
     CHECK_EQ(IrOpcode::kNumberEqual, i->opcode());
-    // ToBoolean(number) => BooleanNot(NumberEqual(x, #0))
+    // ToBoolean(x:number) => BooleanNot(NumberEqual(x, #0))
   }
 
   {  // ToBoolean(string)
     Node* r = R.ReduceUnop(op, Type::String());
     // TODO(titzer): test will break with better js-typed-lowering
     CHECK_EQ(IrOpcode::kJSToBoolean, r->opcode());
   }
 
   {  // ToBoolean(object)
     Node* r = R.ReduceUnop(op, Type::DetectableObject());
     R.CheckTrue(r);
   }
 
   {  // ToBoolean(undetectable)
     Node* r = R.ReduceUnop(op, Type::Undetectable());
     R.CheckFalse(r);
   }
 
   {  // ToBoolean(object)
     Node* r = R.ReduceUnop(op, Type::Object());
     CHECK_EQ(IrOpcode::kJSToBoolean, r->opcode());
   }
 }
 
 
 TEST(JSToBoolean_replacement) {
   JSTypedLoweringTester R;
 
   Type* types[] = {Type::Null(),             Type::Undefined(),
-                   Type::Boolean(),          Type::Number(),
+                   Type::Boolean(),          Type::OrderedNumber(),
                    Type::DetectableObject(), Type::Undetectable()};
 
   for (size_t i = 0; i < arraysize(types); i++) {
     Node* n = R.Parameter(types[i]);
     Node* c = R.graph.NewNode(R.javascript.ToBoolean(), n, R.context(),
                               R.start(), R.start());
     Node* effect_use = R.UseForEffect(c);
     Node* add = R.graph.NewNode(R.simplified.ReferenceEqual(Type::Any()), n, c);
 
     R.CheckEffectInput(c, effect_use);
     Node* r = R.reduce(c);
 
     if (types[i]->Is(Type::Boolean())) {
       CHECK_EQ(n, r);
-    } else if (types[i]->Is(Type::Number())) {
+    } else if (types[i]->Is(Type::OrderedNumber())) {
       CHECK_EQ(IrOpcode::kBooleanNot, r->opcode());
     } else {
       CHECK_EQ(IrOpcode::kHeapConstant, r->opcode());
     }
 
     CHECK_EQ(n, add->InputAt(0));
     CHECK_EQ(r, add->InputAt(1));
     R.CheckEffectInput(R.start(), effect_use);
   }
 }
@@ skipping 807 matching lines @@
           CHECK_EQ(p1, r->InputAt(0));
           CHECK_EQ(p0, r->InputAt(1));
         } else {
           CHECK_EQ(p0, r->InputAt(0));
           CHECK_EQ(p1, r->InputAt(1));
         }
       }
     }
   }
 }