1 /*
   2  * Copyright (c) 2018, Red Hat, Inc. All rights reserved.
   3  *
   4  * This code is free software; you can redistribute it and/or modify it
   5  * under the terms of the GNU General Public License version 2 only, as
   6  * published by the Free Software Foundation.
   7  *
   8  * This code is distributed in the hope that it will be useful, but WITHOUT
   9  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  11  * version 2 for more details (a copy is included in the LICENSE file that
  12  * accompanied this code).
  13  *
  14  * You should have received a copy of the GNU General Public License version
  15  * 2 along with this work; if not, write to the Free Software Foundation,
  16  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  17  *
  18  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  19  * or visit www.oracle.com if you need additional information or have any
  20  * questions.
  21  *
  22  */
  23 
  24 import java.util.concurrent.*;
  25 
  26 /*
  27  * @test TestArrayCopyStress
  28  * @key gc
  29  *
  30  * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:TieredStopAtLevel=0 -Xmx16m TestArrayCopyStress
  31  */
  32 public class TestArrayCopyStress {
  33 
  34     private static final int ARRAY_SIZE = 1000;
  35     private static final int ITERATIONS = 10000;
  36 
  37     static class Foo {
  38         int num;
  39 
  40         Foo(int num) {
  41             this.num = num;
  42         }
  43     }
  44 
  45     static class Bar {}
  46 
  47     public static void main(String[] args) throws Exception {
  48         for (int i = 0; i < ITERATIONS; i++) {
  49             testConjoint();
  50         }
  51     }
  52 
  53     private static void testConjoint() {
  54         Foo[] array = new Foo[ARRAY_SIZE];
  55         for (int i = 0; i < ARRAY_SIZE; i++) {
  56             array[i] = new Foo(i);
  57         }
  58 
  59         int src_idx = ThreadLocalRandom.current().nextInt(0, ARRAY_SIZE);
  60         int dst_idx = ThreadLocalRandom.current().nextInt(0, ARRAY_SIZE);
  61         int len = ThreadLocalRandom.current().nextInt(0, Math.min(ARRAY_SIZE - src_idx, ARRAY_SIZE - dst_idx));
  62         System.arraycopy(array, src_idx, array, dst_idx, len);
  63 
  64         for (int i = 0; i < ARRAY_SIZE; i++) {
  65             if (i >= dst_idx && i < dst_idx + len) {
  66                 assertEquals(array[i].num, i - (dst_idx - src_idx));
  67             } else {
  68                 assertEquals(array[i].num, i);
  69             }
  70         }
  71     }
  72 
  73     private static void assertEquals(int a, int b) {
  74         if (a != b) throw new RuntimeException("assert failed");
  75     }
  76 
  77 }