1 /* 2 * Copyright (c) 2016, Red Hat, Inc. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 /** 25 * @test 26 * @bug 8161147 27 * @summary Safepoint on backedge breaks UseCountedLoopSafepoints 28 * @run main/othervm -XX:-BackgroundCompilation -XX:-UseOnStackReplacement -XX:+UseCountedLoopSafepoints TestCountedLoopSafepointBackedge 29 * 30 */ 31 32 public class TestCountedLoopSafepointBackedge { 33 static void test(int[] arr, int inc) { 34 int i = 0; 35 for (;;) { 36 for (int j = 0; j < 10; j++); 37 arr[i] = i; 38 i++; 39 if (i >= 100) { 40 break; 41 } 42 for (int j = 0; j < 10; j++); 43 } 44 } 45 46 static public void main(String[] args) { 47 int[] arr = new int[100]; 48 for (int i = 0; i < 20000; i++) { 49 test(arr, 1); 50 } 51 } 52 }