1/*
2 * Copyright (c) 2015, Oracle and/or its affiliates. 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 8131969
27 * @summary assert in register allocation code when vector Phi for a loop is
28 * processed because code assumes all inputs already processed
29 *
30 * @run main/othervm -Xbatch compiler.regalloc.TestVectorRegAlloc
31 */
32
33package compiler.regalloc;
34
35public class TestVectorRegAlloc {
36
37    static int test_helper_i;
38    static boolean test_helper() {
39        test_helper_i++;
40        return (test_helper_i & 7) != 0;
41    }
42
43    static void test(double[] src, double[] dst, boolean flag) {
44        double j = 0.0;
45        while(test_helper()) {
46            for (int i = 0; i < src.length; i++) {
47                dst[i] = src[i] + j;
48            }
49            // Loop will be unswitched and ReplicateD of zero will be
50            // split through the Phi of outer loop
51            for (int i = 0; i < src.length; i++) {
52                double k;
53                if (flag) {
54                    k = j;
55                } else {
56                    k = 0;
57                }
58                dst[i] = src[i] + k;
59            }
60            j++;
61        }
62    }
63
64    static public void main(String[] args) {
65        double[] src = new double[10];
66        double[] dst = new double[10];
67        for (int i = 0; i < 20000; i++) {
68            test(src, dst, (i % 2) == 0);
69        }
70    }
71}
72