/* * Copyright (c) 2025, 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. */ /* * @test * @bug 8362394 * @summary Test that repeated stacked string concatenations do not * consume too many compilation resources. * @requires vm.compiler2.enabled * @library /test/lib / * @run main/othervm -XX:-OptoScheduling compiler.stringopts.TestStackedConcatsMany * @run main/othervm -XX:-TieredCompilation -Xcomp -XX:-OptoScheduling * -XX:CompileOnly=compiler.stringopts.TestStackedConcatsMany::f * compiler.stringopts.TestStackedConcatsMany */ // The test uses -XX:-OptoScheduling to avoid the assert "too many D-U pinch points" on aarch64 (JDK-8328078). package compiler.stringopts; import jdk.test.lib.Asserts; public class TestStackedConcatsMany { public static void main (String... args) { new StringBuilder(); // Trigger loading of the StringBuilder class. String s = f(); String z = "xy"; for (int i = 0; i < 24; i++) { z = z + z; } Asserts.assertEQ(s, z); } static String f() { String s = "xy"; s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); s = new StringBuilder().append(s).append(s).toString(); return s; } }