| Index: test/cctest/compiler/test-js-typed-lowering.cc
|
| diff --git a/test/cctest/compiler/test-js-typed-lowering.cc b/test/cctest/compiler/test-js-typed-lowering.cc
|
| index 5dc32fb52785b68dd18aebbae86b769ed5cdcf75..92edf9beaf2b7b1c3280870df9656d8f97d3d680 100644
|
| --- a/test/cctest/compiler/test-js-typed-lowering.cc
|
| +++ b/test/cctest/compiler/test-js-typed-lowering.cc
|
| @@ -174,7 +174,7 @@ static Type* kNumberTypes[] = {
|
| Type::OtherUnsigned32(), Type::OtherSigned32(), Type::SignedSmall(),
|
| Type::Signed32(), Type::Unsigned32(), Type::Integral32(),
|
| Type::MinusZero(), Type::NaN(), Type::OtherNumber(),
|
| - Type::Number()};
|
| + Type::OrderedNumber(), Type::Number()};
|
|
|
|
|
| static Type* kJSTypes[] = {Type::Undefined(), Type::Null(), Type::Boolean(),
|
| @@ -1425,30 +1425,3 @@ TEST(BuiltinMathMax) {
|
| }
|
| }
|
| }
|
| -
|
| -
|
| -TEST(BuiltinMathImul) {
|
| - JSTypedLoweringTester R;
|
| -
|
| - for (size_t i = 0; i < arraysize(kNumberTypes); i++) {
|
| - for (size_t j = 0; j < arraysize(kNumberTypes); j++) {
|
| - Type* t0 = kNumberTypes[i];
|
| - Node* p0 = R.Parameter(t0, 0);
|
| - Type* t1 = kNumberTypes[j];
|
| - Node* p1 = R.Parameter(t1, 1);
|
| - Node* fun = R.HeapConstant(handle(R.isolate->context()->math_imul_fun()));
|
| - Node* call = R.graph.NewNode(R.javascript.Call(4, NO_CALL_FUNCTION_FLAGS),
|
| - fun, R.UndefinedConstant(), p0, p1);
|
| - Node* r = R.reduce(call);
|
| -
|
| - if (t0->Is(Type::Integral32()) && t1->Is(Type::Integral32())) {
|
| - R.CheckPureBinop(R.machine.Int32Mul(), r);
|
| - CHECK_EQ(p0, r->InputAt(0));
|
| - CHECK_EQ(p1, r->InputAt(1));
|
| - } else {
|
| - CHECK_EQ(IrOpcode::kJSCallFunction, r->opcode());
|
| - CHECK_EQ(call, r);
|
| - }
|
| - }
|
| - }
|
| -}
|
|
|