| Index: test/mjsunit/int32-ops.js
|
| ===================================================================
|
| --- test/mjsunit/int32-ops.js (revision 0)
|
| +++ test/mjsunit/int32-ops.js (revision 0)
|
| @@ -0,0 +1,227 @@
|
| +// Copyright 2010 the V8 project authors. All rights reserved.
|
| +// Redistribution and use in source and binary forms, with or without
|
| +// modification, are permitted provided that the following conditions are
|
| +// met:
|
| +//
|
| +// * Redistributions of source code must retain the above copyright
|
| +// notice, this list of conditions and the following disclaimer.
|
| +// * 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.
|
| +// * Neither the name of Google Inc. nor the names of its
|
| +// contributors may be used to endorse or promote products derived
|
| +// from this software without specific prior written permission.
|
| +//
|
| +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
|
| +// OWNER OR 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.
|
| +
|
| +// Repeat most the tests in smi-ops.js that use SMI_MIN and SMI_MAX, but
|
| +// with SMI_MIN and SMI_MAX from the 64-bit platform, which represents all
|
| +// signed 32-bit integer values as smis.
|
| +
|
| +const SMI_MAX = (1 << 30) - 1 + (1 << 30); // Create without overflowing.
|
| +const SMI_MIN = -SMI_MAX - 1; // Create without overflowing.
|
| +const ONE = 1;
|
| +const ONE_HUNDRED = 100;
|
| +
|
| +const OBJ_42 = new (function() {
|
| + this.valueOf = function() { return 42; };
|
| +})();
|
| +
|
| +assertEquals(42, OBJ_42.valueOf());
|
| +
|
| +
|
| +function Add1(x) {
|
| + return x + 1;
|
| +}
|
| +
|
| +function Add100(x) {
|
| + return x + 100;
|
| +}
|
| +
|
| +function Add1Reversed(x) {
|
| + return 1 + x;
|
| +}
|
| +
|
| +function Add100Reversed(x) {
|
| + return 100 + x;
|
| +}
|
| +
|
| +
|
| +assertEquals(1, Add1(0)); // fast case
|
| +assertEquals(1, Add1Reversed(0)); // fast case
|
| +assertEquals(SMI_MAX + ONE, Add1(SMI_MAX), "smimax + 1");
|
| +assertEquals(SMI_MAX + ONE, Add1Reversed(SMI_MAX), "1 + smimax");
|
| +assertEquals(42 + ONE, Add1(OBJ_42)); // non-smi
|
| +assertEquals(42 + ONE, Add1Reversed(OBJ_42)); // non-smi
|
| +
|
| +assertEquals(100, Add100(0)); // fast case
|
| +assertEquals(100, Add100Reversed(0)); // fast case
|
| +assertEquals(SMI_MAX + ONE_HUNDRED, Add100(SMI_MAX), "smimax + 100");
|
| +assertEquals(SMI_MAX + ONE_HUNDRED, Add100Reversed(SMI_MAX), " 100 + smimax");
|
| +assertEquals(42 + ONE_HUNDRED, Add100(OBJ_42)); // non-smi
|
| +assertEquals(42 + ONE_HUNDRED, Add100Reversed(OBJ_42)); // non-smi
|
| +
|
| +
|
| +
|
| +function Sub1(x) {
|
| + return x - 1;
|
| +}
|
| +
|
| +function Sub100(x) {
|
| + return x - 100;
|
| +}
|
| +
|
| +function Sub1Reversed(x) {
|
| + return 1 - x;
|
| +}
|
| +
|
| +function Sub100Reversed(x) {
|
| + return 100 - x;
|
| +}
|
| +
|
| +
|
| +assertEquals(0, Sub1(1)); // fast case
|
| +assertEquals(-1, Sub1Reversed(2)); // fast case
|
| +assertEquals(SMI_MIN - ONE, Sub1(SMI_MIN)); // overflow
|
| +assertEquals(ONE - SMI_MIN, Sub1Reversed(SMI_MIN)); // overflow
|
| +assertEquals(42 - ONE, Sub1(OBJ_42)); // non-smi
|
| +assertEquals(ONE - 42, Sub1Reversed(OBJ_42)); // non-smi
|
| +
|
| +assertEquals(0, Sub100(100)); // fast case
|
| +assertEquals(1, Sub100Reversed(99)); // fast case
|
| +assertEquals(SMI_MIN - ONE_HUNDRED, Sub100(SMI_MIN)); // overflow
|
| +assertEquals(ONE_HUNDRED - SMI_MIN, Sub100Reversed(SMI_MIN)); // overflow
|
| +assertEquals(42 - ONE_HUNDRED, Sub100(OBJ_42)); // non-smi
|
| +assertEquals(ONE_HUNDRED - 42, Sub100Reversed(OBJ_42)); // non-smi
|
| +
|
| +
|
| +function Shr1(x) {
|
| + return x >>> 1;
|
| +}
|
| +
|
| +function Shr100(x) {
|
| + return x >>> 100;
|
| +}
|
| +
|
| +function Shr1Reversed(x) {
|
| + return 1 >>> x;
|
| +}
|
| +
|
| +function Shr100Reversed(x) {
|
| + return 100 >>> x;
|
| +}
|
| +
|
| +function Sar1(x) {
|
| + return x >> 1;
|
| +}
|
| +
|
| +function Sar100(x) {
|
| + return x >> 100;
|
| +}
|
| +
|
| +function Sar1Reversed(x) {
|
| + return 1 >> x;
|
| +}
|
| +
|
| +function Sar100Reversed(x) {
|
| + return 100 >> x;
|
| +}
|
| +
|
| +
|
| +assertEquals(0, Shr1(1));
|
| +assertEquals(0, Sar1(1));
|
| +assertEquals(0, Shr1Reversed(2));
|
| +assertEquals(0, Sar1Reversed(2));
|
| +assertEquals(1073741824, Shr1(SMI_MIN));
|
| +assertEquals(-1073741824, Sar1(SMI_MIN));
|
| +assertEquals(1, Shr1Reversed(SMI_MIN));
|
| +assertEquals(1, Sar1Reversed(SMI_MIN));
|
| +assertEquals(21, Shr1(OBJ_42));
|
| +assertEquals(21, Sar1(OBJ_42));
|
| +assertEquals(0, Shr1Reversed(OBJ_42));
|
| +assertEquals(0, Sar1Reversed(OBJ_42));
|
| +
|
| +assertEquals(6, Shr100(100), "100 >>> 100");
|
| +assertEquals(6, Sar100(100), "100 >> 100");
|
| +assertEquals(12, Shr100Reversed(99));
|
| +assertEquals(12, Sar100Reversed(99));
|
| +assertEquals(134217728, Shr100(SMI_MIN));
|
| +assertEquals(-134217728, Sar100(SMI_MIN));
|
| +assertEquals(100, Shr100Reversed(SMI_MIN));
|
| +assertEquals(100, Sar100Reversed(SMI_MIN));
|
| +assertEquals(2, Shr100(OBJ_42));
|
| +assertEquals(2, Sar100(OBJ_42));
|
| +assertEquals(0, Shr100Reversed(OBJ_42));
|
| +assertEquals(0, Sar100Reversed(OBJ_42));
|
| +
|
| +
|
| +function Xor1(x) {
|
| + return x ^ 1;
|
| +}
|
| +
|
| +function Xor100(x) {
|
| + return x ^ 100;
|
| +}
|
| +
|
| +function Xor1Reversed(x) {
|
| + return 1 ^ x;
|
| +}
|
| +
|
| +function Xor100Reversed(x) {
|
| + return 100 ^ x;
|
| +}
|
| +
|
| +
|
| +assertEquals(0, Xor1(1));
|
| +assertEquals(3, Xor1Reversed(2));
|
| +assertEquals(SMI_MIN + 1, Xor1(SMI_MIN));
|
| +assertEquals(SMI_MIN + 1, Xor1Reversed(SMI_MIN));
|
| +assertEquals(43, Xor1(OBJ_42));
|
| +assertEquals(43, Xor1Reversed(OBJ_42));
|
| +
|
| +assertEquals(0, Xor100(100));
|
| +assertEquals(7, Xor100Reversed(99));
|
| +assertEquals(-2147483548, Xor100(SMI_MIN));
|
| +assertEquals(-2147483548, Xor100Reversed(SMI_MIN));
|
| +assertEquals(78, Xor100(OBJ_42));
|
| +assertEquals(78, Xor100Reversed(OBJ_42));
|
| +
|
| +var x = 0x23; var y = 0x35;
|
| +assertEquals(0x16, x ^ y);
|
| +
|
| +
|
| +// Bitwise not.
|
| +var v = 0;
|
| +assertEquals(-1, ~v);
|
| +v = SMI_MIN;
|
| +assertEquals(0x7fffffff, ~v, "~smimin");
|
| +v = SMI_MAX;
|
| +assertEquals(-0x80000000, ~v, "~smimax");
|
| +
|
| +// Overflowing ++ and --.
|
| +v = SMI_MAX;
|
| +v++;
|
| +assertEquals(0x80000000, v, "smimax++");
|
| +v = SMI_MIN;
|
| +v--;
|
| +assertEquals(-0x80000001, v, "smimin--");
|
| +
|
| +// Check that comparisons of numbers separated by MIN_SMI work.
|
| +assertFalse(SMI_MIN > 0);
|
| +assertFalse(SMI_MIN + 1 > 1);
|
| +assertFalse(SMI_MIN + 1 > 2);
|
| +assertFalse(SMI_MIN + 2 > 1);
|
| +assertFalse(0 < SMI_MIN);
|
| +assertTrue(-1 < SMI_MAX);
|
| +assertFalse(SMI_MAX < -1);
|
|
|
| Property changes on: test/mjsunit/int32-ops.js
|
| ___________________________________________________________________
|
| Added: svn:eol-style
|
| + LF
|
|
|
|
|