jdk

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 8201367
27
 * @summary RPO walk of counted loop block doesn't properly order loads
28
 * @requires vm.flavor == "server"
29
 *
30
 * @run main/othervm -XX:-BackgroundCompilation -XX:-UseCountedLoopSafepoints TestUnexpectedLoadOrdering
31
 *
32
 */
33

34
public class TestUnexpectedLoadOrdering {
35

36
    public static void main(String[] args) {
37
        double[] array1 = new double[1000];
38
        double[] array2 = new double[1000];
39
        for (int i = 0; i < 20_000; i++) {
40
            test(array1, array2);
41
        }
42
    }
43

44
    private static double test(double[] array1, double[] array2) {
45
        double res = 0;
46
        for (int i = 0; i < array1.length; i++) {
47
            array2[i] = i;
48
            res += array1[i];
49
        }
50
        return res;
51
    }
52
}
53