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 8073866
  27  * @summary Fix for 8064703 may also cause stores between the allocation and arraycopy to be rexecuted after a deoptimization
  28  * @run main/othervm -XX:-BackgroundCompilation -XX:-UseOnStackReplacement TestArrayCopyBadReexec
  29  *
  30  */
  31 
  32 public class TestArrayCopyBadReexec {
  33     
  34     static int val;
  35 
  36     static int[] m1(int[] src, int l) {
  37         if (src == null) {
  38             return null;
  39         }
  40         int[] dest = new int[10];
  41         val++;
  42         try {
  43             System.arraycopy(src, 0, dest, 0, l);
  44         } catch (IndexOutOfBoundsException npe) {
  45         }
  46         return dest;
  47     }
  48 
  49     static public void main(String[] args) {
  50         int[] src = new int[10];
  51         int[] res = null;
  52         boolean success = true;
  53 
  54         for (int i = 0; i < 20000; i++) {
  55             m1(src, 10);
  56         }
  57 
  58         int val_before = val;
  59 
  60         m1(src, -1);
  61 
  62         if (val - val_before != 1) {
  63             System.out.println("Bad increment: " + (val - val_before));
  64             throw new RuntimeException("Test failed");
  65         }
  66     }
  67 }