31a3cfbc10
BUG=v8:8801 Change-Id: I9d9d9824c6c9ad0176bbfd3723da1b578b17c256 Reviewed-on: https://chromium-review.googlesource.com/c/1495555 Commit-Queue: Ross McIlroy <rmcilroy@chromium.org> Reviewed-by: Mythri Alle <mythria@chromium.org> Cr-Commit-Position: refs/heads/master@{#60001}
111 lines
2.5 KiB
JavaScript
111 lines
2.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 AddSubtractSmis() {
|
|
function f0(a, b, c) {
|
|
return a + b - c;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f0);
|
|
assertEquals(4, f0(3, 2, 1));
|
|
assertEquals(4, f0(3, 2, 1));
|
|
%OptimizeFunctionOnNextCall(f0);
|
|
assertEquals(4, f0(3, 2, 1));
|
|
})();
|
|
|
|
(function AddSubtractDoubles() {
|
|
function f1(a, b, c) {
|
|
return a + b - c;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f1);
|
|
assertEquals(4.5, f1(3.5, 2.5, 1.5));
|
|
assertEquals(4.5, f1(3.5, 2.5, 1.5));
|
|
%OptimizeFunctionOnNextCall(f1);
|
|
assertEquals(4.5, f1(3.5, 2.5, 1.5));
|
|
assertEquals(4, f1(3, 2, 1));
|
|
assertTrue(isNaN(f1(3, 2, undefined)));
|
|
assertTrue(isNaN(f1(3, undefined, 1)));
|
|
})();
|
|
|
|
(function CheckUint32ToInt32Conv() {
|
|
function f2(a) {
|
|
return (a >>> 0) + 1;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f2);
|
|
assertEquals(1, f2(0));
|
|
assertEquals(1, f2(0));
|
|
%OptimizeFunctionOnNextCall(f2);
|
|
assertEquals(1, f2(0));
|
|
assertEquals(4294967295, f2(-2));
|
|
})();
|
|
|
|
(function CheckFloat64ToInt32Conv() {
|
|
function f3(a, b) {
|
|
var x = 0;
|
|
if (a) {
|
|
x = 0.5;
|
|
}
|
|
return x + b;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f3);
|
|
assertEquals(1, f3(0, 1));
|
|
assertEquals(1, f3(0, 1));
|
|
%OptimizeFunctionOnNextCall(f3);
|
|
assertEquals(1, f3(0, 1));
|
|
assertEquals(1.5, f3(1, 1));
|
|
})();
|
|
|
|
(function ShiftLeftSmis() {
|
|
function f4(a, b) {
|
|
return a << b;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f4);
|
|
assertEquals(24, f4(3, 3));
|
|
assertEquals(40, f4(5, 3));
|
|
%OptimizeFunctionOnNextCall(f4);
|
|
assertEquals(64, f4(4, 4));
|
|
})();
|
|
|
|
(function ShiftLeftNumbers() {
|
|
function f5(a, b) {
|
|
return a << b;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f5);
|
|
assertEquals(24, f5(3.3, 3.4));
|
|
assertEquals(40, f5(5.1, 3.9));
|
|
%OptimizeFunctionOnNextCall(f5);
|
|
assertEquals(64, f5(4.9, 4.1));
|
|
})();
|
|
|
|
(function ShiftRightNumbers() {
|
|
function f6(a, b) {
|
|
return a >> b;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f6);
|
|
assertEquals(1, f6(8.3, 3.4));
|
|
assertEquals(-2, f6(-16.1, 3.9));
|
|
%OptimizeFunctionOnNextCall(f6);
|
|
assertEquals(0, f6(16.2, 5.1));
|
|
})();
|
|
|
|
(function ShiftRightLogicalNumbers() {
|
|
function f7(a, b) {
|
|
return a >>> b;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(f7);
|
|
assertEquals(1, f7(8.3, 3.4));
|
|
assertEquals(536870910, f7(-16.1, 3.9));
|
|
%OptimizeFunctionOnNextCall(f7);
|
|
assertEquals(0, f7(16.2, 5.1));
|
|
})();
|