mirror of https://github.com/lukechilds/node.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
86 lines
2.7 KiB
86 lines
2.7 KiB
// Copyright 2013 the V8 project authors. All rights reserved.
|
|
// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions
|
|
// are met:
|
|
// 1. Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// 2. Redistributions in binary form must reproduce the above copyright
|
|
// notice, this list of conditions and the following disclaimer in the
|
|
// documentation and/or other materials provided with the distribution.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
|
|
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
description(
|
|
"This test checks corner cases of the number cell reuse code. In particular, it checks for known cases where code generation for number cell reuse caused assertions to fail."
|
|
);
|
|
|
|
function leftConstantRightSimple(a)
|
|
{
|
|
return 0.1 * (a * a);
|
|
}
|
|
|
|
shouldBe("leftConstantRightSimple(2)", "0.4");
|
|
|
|
function leftConstantRightComplex(a)
|
|
{
|
|
return 0.1 * (a * a + a);
|
|
}
|
|
|
|
shouldBe("leftConstantRightComplex(1)", "0.2");
|
|
|
|
function leftSimpleRightConstant(a)
|
|
{
|
|
return (a * a) * 0.1;
|
|
}
|
|
|
|
shouldBe("leftSimpleRightConstant(2)", "0.4");
|
|
|
|
function leftComplexRightConstant(a)
|
|
{
|
|
return (a * a + a) * 0.1;
|
|
}
|
|
|
|
shouldBe("leftComplexRightConstant(1)", "0.2");
|
|
|
|
function leftThisRightSimple(a)
|
|
{
|
|
return this * (a * a);
|
|
}
|
|
|
|
shouldBeNaN("leftThisRightSimple(2)");
|
|
shouldBe("leftThisRightSimple.call(2, 2)", "8");
|
|
|
|
function leftThisRightComplex(a)
|
|
{
|
|
return this * (a * a + a);
|
|
}
|
|
|
|
shouldBeNaN("leftThisRightComplex(2)");
|
|
shouldBe("leftThisRightComplex.call(2, 2)", "12");
|
|
|
|
function leftSimpleRightThis(a)
|
|
{
|
|
return (a * a) * this;
|
|
}
|
|
|
|
shouldBeNaN("leftSimpleRightThis(2)");
|
|
shouldBe("leftSimpleRightThis.call(2, 2)", "8");
|
|
|
|
function leftComplexRightThis(a)
|
|
{
|
|
return (a * a + a) * this;
|
|
}
|
|
|
|
shouldBeNaN("leftComplexRightThis(2)");
|
|
shouldBe("leftComplexRightThis.call(2, 2)", "12");
|
|
|