1 /*
   2  * Copyright (c) 2015 SAP SE. 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 8141624
  27  * @summary Limit calculation of pre loop during super word optimization is wrong
  28  * @run main/othervm compiler.loopopts.superword.TestBestAlign
  29  * @author gunter.haug@sap.com
  30  */
  31 
  32 package compiler.loopopts.superword;
  33 
  34 public class TestBestAlign {
  35 
  36     static final int initVal = -1;
  37     static int intArray [];
  38     static boolean boolArray[];
  39     static int limit;
  40     static public void clear() {
  41         for (int i = 0; i < limit; i++) {
  42             boolArray[1] = true;
  43             intArray[i] = initVal;
  44             boolArray[2] = true;
  45         }
  46     }
  47 
  48     public static void main(String argv[]) throws Exception {
  49         limit = 64;
  50         boolArray = new boolean[8];
  51         intArray = new int[limit + 4];
  52         for (int i = 0; i < 10000000; ++i) {
  53             if(i % 1000000 == 0)
  54                 System.out.println(i);
  55             clear();
  56         }
  57     }
  58 }