v8/test/mjsunit/compiler/integral32-add-sub.js
bmeurer 99edc1b8e7 [turbofan] Unify Int32Add/Sub representation selection rules.
Unify the representation selection rules for NumberAdd/Subtract and
SpeculativeNumberAdd/Subtract wrt. Int32Add/Sub selection. We can
safely use Int32Add/Sub as long as the inputs are in the safe additive
integer range and the output is either truncated to Word32 or provably
in Signed32 or Unsigned32 range.

R=jarin@chromium.org

Review-Url: https://codereview.chromium.org/2253293005
Cr-Commit-Position: refs/heads/master@{#38746}
2016-08-19 09:50:22 +00:00

132 lines
3.5 KiB
JavaScript

// Copyright 2016 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.
// Flags: --allow-natives-syntax
(function() {
function foo(x) {
x = x >>> 0;
var y = 0 - 2147483648;
return x + y;
}
assertEquals(-2147483648, foo(0));
assertEquals(0, foo(2147483648));
assertEquals(2147483647, foo(4294967295));
%BaselineFunctionOnNextCall(foo);
assertEquals(-2147483648, foo(0));
assertEquals(0, foo(2147483648));
assertEquals(2147483647, foo(4294967295));
%OptimizeFunctionOnNextCall(foo);
assertEquals(-2147483648, foo(0));
assertEquals(0, foo(2147483648));
assertEquals(2147483647, foo(4294967295));
assertOptimized(foo);
})();
(function() {
function foo(x) {
x = x >>> 0;
var y = 2147483648;
return x - y;
}
assertEquals(-2147483648, foo(0));
assertEquals(0, foo(2147483648));
assertEquals(2147483647, foo(4294967295));
%BaselineFunctionOnNextCall(foo);
assertEquals(-2147483648, foo(0));
assertEquals(0, foo(2147483648));
assertEquals(2147483647, foo(4294967295));
%OptimizeFunctionOnNextCall(foo);
assertEquals(-2147483648, foo(0));
assertEquals(0, foo(2147483648));
assertEquals(2147483647, foo(4294967295));
assertOptimized(foo);
})();
(function() {
function foo(x) {
x = x | 0;
var y = 2147483648;
return x + y;
}
assertEquals(2147483648, foo(0));
assertEquals(0, foo(-2147483648));
assertEquals(4294967295, foo(2147483647));
%BaselineFunctionOnNextCall(foo);
assertEquals(2147483648, foo(0));
assertEquals(0, foo(-2147483648));
assertEquals(4294967295, foo(2147483647));
%OptimizeFunctionOnNextCall(foo);
assertEquals(2147483648, foo(0));
assertEquals(0, foo(-2147483648));
assertEquals(4294967295, foo(2147483647));
assertOptimized(foo);
})();
(function() {
function foo(x) {
x = x | 0;
var y = 0 - 2147483648;
return x - y;
}
assertEquals(2147483648, foo(0));
assertEquals(0, foo(-2147483648));
assertEquals(4294967295, foo(2147483647));
%BaselineFunctionOnNextCall(foo);
assertEquals(2147483648, foo(0));
assertEquals(0, foo(-2147483648));
assertEquals(4294967295, foo(2147483647));
%OptimizeFunctionOnNextCall(foo);
assertEquals(2147483648, foo(0));
assertEquals(0, foo(-2147483648));
assertEquals(4294967295, foo(2147483647));
assertOptimized(foo);
})();
(function() {
function foo(x) {
x = x | 0;
var y = -0;
return x + y;
}
assertEquals(2147483647, foo(2147483647));
assertEquals(-2147483648, foo(-2147483648));
assertEquals(0, foo(0));
%BaselineFunctionOnNextCall(foo);
assertEquals(2147483647, foo(2147483647));
assertEquals(-2147483648, foo(-2147483648));
assertEquals(0, foo(0));
%OptimizeFunctionOnNextCall(foo);
assertEquals(2147483647, foo(2147483647));
assertEquals(-2147483648, foo(-2147483648));
assertEquals(0, foo(0));
assertOptimized(foo);
})();
(function() {
function foo(x) {
var y = (x < 0) ? 4294967295 : 4294967296;
var z = (x > 0) ? 2147483647 : 2147483648;
return y - z;
}
assertEquals(2147483647, foo(-1));
assertEquals(2147483648, foo(0));
assertEquals(2147483649, foo(1));
%BaselineFunctionOnNextCall(foo);
assertEquals(2147483647, foo(-1));
assertEquals(2147483648, foo(0));
assertEquals(2147483649, foo(1));
%OptimizeFunctionOnNextCall(foo);
assertEquals(2147483647, foo(-1));
assertEquals(2147483648, foo(0));
assertEquals(2147483649, foo(1));
assertOptimized(foo);
})();