1 /*
   2  * Copyright (c) 2014, 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 8048170
  27  * @summary Following range check smearing, range check cannot be replaced by dominating identical test.
  28  * @run main/othervm -XX:-BackgroundCompilation -XX:-UseOnStackReplacement TestRangeCheckSmearingLoopOpts
  29  *
  30  */
  31 public class TestRangeCheckSmearingLoopOpts {
  32 
  33     static int dummy;
  34 
  35     static int m1(int[] array, int i) {
  36         for (;;) {
  37             for (;;) {
  38                 if (array[i] < 0) {
  39                     break;
  40                 }
  41                 i++;
  42             }
  43 
  44             if ((i % 2)== 0) {
  45                 if ((array[i] % 2) == 0) {
  46                     dummy = i;
  47                 }
  48             }
  49 
  50             if (array[i-1] == 9) {
  51                 int res = array[i-3];
  52                 res += array[i];
  53                 res += array[i-2];
  54                 return res;
  55             }
  56             i++;
  57         }
  58     }
  59 
  60     static public void main(String[] args) {
  61         int[] array = { 0, 1, 2, -3, 4, 5, -2, 7, 8, 9, -1 };
  62         for (int i = 0; i < 20000; i++) {
  63             m1(array, 0);
  64         }
  65         array[0] = -1;
  66         try {
  67             m1(array, 0);
  68         } catch(ArrayIndexOutOfBoundsException aioobe) {}
  69     }
  70 }