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