e3e8ea5d65
To be consistent with the all the other tiers and avoid confusion, we rename --opt to ---turbofan, and --always-opt to --always-turbofan. Change-Id: Ie23dc8282b3fb4cf2fbf73b6c3d5264de5d09718 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3610431 Reviewed-by: Leszek Swirski <leszeks@chromium.org> Commit-Queue: Camillo Bruni <cbruni@chromium.org> Reviewed-by: Jakob Linke <jgruber@chromium.org> Cr-Commit-Position: refs/heads/main@{#80336}
199 lines
5.1 KiB
JavaScript
199 lines
5.1 KiB
JavaScript
// Copyright 2018 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 --turbofan
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeNumberAdd with
|
|
// Number feedback.
|
|
(function() {
|
|
function bar(i) {
|
|
return ++i;
|
|
}
|
|
bar(0.1);
|
|
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = a[bar(i)];
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(3, foo([1, 2], 0));
|
|
assertEquals(3, foo([1, 2], 0));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(3, foo([1, 2], 0));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeNumberAdd with
|
|
// NumberOrOddball feedback.
|
|
(function() {
|
|
function bar(i) {
|
|
return ++i;
|
|
}
|
|
assertEquals(NaN, bar(undefined));
|
|
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = a[bar(i)];
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(3, foo([1, 2], 0));
|
|
assertEquals(3, foo([1, 2], 0));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(3, foo([1, 2], 0));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeNumberSubtract with
|
|
// Number feedback.
|
|
(function() {
|
|
function bar(i) {
|
|
return --i;
|
|
}
|
|
assertEquals(-0.9, bar(0.1));
|
|
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = a[bar(i)];
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(3, foo([1, 2], 1));
|
|
assertEquals(3, foo([1, 2], 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(3, foo([1, 2], 1));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeNumberSubtract with
|
|
// NumberOrOddball feedback.
|
|
(function() {
|
|
function bar(i) {
|
|
return --i;
|
|
}
|
|
assertEquals(NaN, bar(undefined));
|
|
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = a[bar(i)];
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(3, foo([1, 2], 1));
|
|
assertEquals(3, foo([1, 2], 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(3, foo([1, 2], 1));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeToNumber.
|
|
(function() {
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = i++;
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 0));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeSafeIntegerAdd.
|
|
(function() {
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = a[++i];
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(3, foo([1, 2], 0));
|
|
assertEquals(3, foo([1, 2], 0));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(3, foo([1, 2], 0));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberOperation()
|
|
// TurboFan optimization for the case of SpeculativeSafeIntegerSubtract.
|
|
(function() {
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
const y = a[--i];
|
|
return x + y;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(3, foo([1, 2], 1));
|
|
assertEquals(3, foo([1, 2], 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(3, foo([1, 2], 1));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberComparison()
|
|
// TurboFan optimization for the case of SpeculativeNumberEqual.
|
|
(function() {
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
if (i === 0) return x;
|
|
return i;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 1));
|
|
assertOptimized(foo);
|
|
assertEquals(9, foo([9, 2], -0));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberComparison()
|
|
// TurboFan optimization for the case of SpeculativeNumberLessThan.
|
|
(function() {
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
if (i < 1) return x;
|
|
return i;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 1));
|
|
assertOptimized(foo);
|
|
assertEquals(9, foo([9, 2], -0));
|
|
})();
|
|
|
|
// Test the RedundancyElimination::ReduceSpeculativeNumberComparison()
|
|
// TurboFan optimization for the case of SpeculativeNumberLessThanOrEqual.
|
|
(function() {
|
|
function foo(a, i) {
|
|
const x = a[i];
|
|
if (i <= 0) return x;
|
|
return i;
|
|
}
|
|
|
|
%PrepareFunctionForOptimization(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 1));
|
|
%OptimizeFunctionOnNextCall(foo);
|
|
assertEquals(1, foo([1, 2], 0));
|
|
assertEquals(1, foo([1, 2], 1));
|
|
assertOptimized(foo);
|
|
assertEquals(9, foo([9, 2], -0));
|
|
})();
|