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}
55 lines
1.7 KiB
JavaScript
55 lines
1.7 KiB
JavaScript
// Copyright 2020 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: --stack-size=100 --no-turbofan
|
|
|
|
function f(
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x,
|
|
x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x
|
|
) { }
|
|
|
|
function runNearStackLimit(f) {
|
|
let recursing_towards_stack_limit = true;
|
|
let f_succeeded = false;
|
|
|
|
function t() {
|
|
try {
|
|
t();
|
|
if (f_succeeded) return;
|
|
// Keep calling f until it stops throwing stack overflow exceptions.
|
|
f();
|
|
// f didn't throw, so we are done.
|
|
f_succeeded = true;
|
|
} catch(e) {
|
|
if (recursing_towards_stack_limit) {
|
|
recursing_towards_stack_limit = false;
|
|
// We reached the near stack limit state, call f first time.
|
|
f();
|
|
// f didn't throw, so we are done.
|
|
f_succeeded = true;
|
|
}
|
|
}
|
|
};
|
|
|
|
try {
|
|
t();
|
|
} catch(e) {}
|
|
}
|
|
|
|
runNearStackLimit(f);
|