1 /*
2  * Copyright (c) 2018, 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 8205515
27  * @summary CountedLoopEndNode from peeled loop body is not candidate for profile loop predication
28  *
29  * @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation -XX:-UseOnStackReplacement CountedLoopPeelingProfilePredicates
30  *
31  */
32 
33 import java.util.Arrays;
34 
35 public class CountedLoopPeelingProfilePredicates {
main(String[] args)36     public static void main(String[] args) {
37         int stop = 2;
38         boolean[] flags1 = new boolean[stop];
39         flags1[stop-1] = true;
40         boolean[] flags2 = new boolean[stop];
41         flags2[0] = true;
42         boolean[] flags3 = new boolean[100];
43         Arrays.fill(flags3, true);
44         flags3[0] = false;
45 
46         for (int i = 0; i < 20_000; i++) {
47             test_helper(stop, flags1, false);
48             test_helper(stop, flags2, false);
49             test_helper(stop, flags2, false);
50         }
51         for (int i = 0; i < 20_000; i++) {
52             test(stop, flags1, false, flags3, 1);
53             test(stop, flags2, false, flags3, 1);
54             test(stop, flags2, false, flags3, 1);
55         }
56     }
57 
58 
59 
test(int stop, boolean[] flags1, boolean flag2, boolean[] flags3, int inc)60     private static void test(int stop, boolean[] flags1, boolean flag2, boolean[] flags3, int inc) {
61         for (int j = 0; j < 100; j+=inc) {
62             if (flags3[j]) {
63                 test_helper(stop, flags1, flag2);
64             }
65         }
66     }
67 
test_helper(int stop, boolean[] flags1, boolean flag2)68     private static void test_helper(int stop, boolean[] flags1, boolean flag2) {
69         for (int i = 0; i < stop; i++) {
70             if (flags1[i]) {
71                 return;
72             }
73             if (flag2) {
74             }
75         }
76     }
77 }
78