1 /*
   2  * Copyright (c) 2019, 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 8229483
  27  * @summary Sinking load out of loop may trigger: assert(found_sfpt) failed: no node in loop that's not input to safepoint
  28  *
  29  * @run main/othervm -XX:-TieredCompilation -XX:-BackgroundCompilation -XX:-UseOnStackReplacement -XX:LoopMaxUnroll=0 AntiDependentLoadInOuterStripMinedLoop
  30  *
  31  */
  32 
  33 public class AntiDependentLoadInOuterStripMinedLoop {
  34     private static int field;
  35     private static int field2;
  36     private static volatile int barrier;
  37 
  38     public static void main(String[] args) {
  39         int[] array = new int[1];
  40         for (int i = 0; i < 20_000; i++) {
  41             test(array);
  42         }
  43     }
  44 
  45     private static int test(int[] array) {
  46         int res = 1;
  47 
  48         for (int i = 0; i < 10; i++) {
  49             barrier = 1;
  50             // field load doesn't float higher than here
  51 
  52             for (int j = 0; j < 2000; j++) {
  53                 array[0] = j; // seen as anti dependence by C2 during loop opts, sunk out of loop
  54                 res *= j;
  55             }
  56         }
  57 
  58         return field + res + field * 2;
  59     }
  60 }