220 lines
4.2 KiB
JavaScript
220 lines
4.2 KiB
JavaScript
/*
|
|
* Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*/
|
|
|
|
/**
|
|
* JDK-8059835: Optimistic splitting doesn't work with let and const
|
|
*
|
|
* @test
|
|
* @run
|
|
* @option --language=es6
|
|
* @option -Dnashorn.compiler.splitter.threshold=100
|
|
* @fork
|
|
*/
|
|
|
|
function f() {
|
|
let sum = 0;
|
|
const c = 13;
|
|
if (true) {
|
|
let x = 0;
|
|
const y = 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
sum += x;
|
|
sum += y;
|
|
}
|
|
outer: while (true) {
|
|
let x = 0;
|
|
const y = 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
sum += x;
|
|
sum += y;
|
|
sum += c;
|
|
let i = 0;
|
|
const k = 1;
|
|
while (true) {
|
|
x += k;
|
|
if (++i === 10) {
|
|
break outer;
|
|
}
|
|
}
|
|
x += k;
|
|
}
|
|
return sum;
|
|
}
|
|
|
|
function g() {
|
|
let sum = 0;
|
|
const c = 13;
|
|
if (true) {
|
|
let x = 0;
|
|
const y = 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
sum += x;
|
|
sum += y;
|
|
}
|
|
outer: while (true) {
|
|
let x = 0;
|
|
const y = 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
x += 1;
|
|
sum += x;
|
|
sum += y;
|
|
sum += c;
|
|
let i = 0;
|
|
const k = 1;
|
|
while (true) {
|
|
x += k;
|
|
if (++i === 10) return 'abc';
|
|
}
|
|
x += k;
|
|
}
|
|
return sum;
|
|
}
|
|
|
|
Assert.assertTrue(f() === 80);
|
|
Assert.assertTrue(g() === 'abc');
|