1 /*
2 * Copyright (c) 2013, 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 8010927
27 * @summary Kitchensink crashed with SIGSEGV, Problematic frame: v ~StubRoutines::checkcast_arraycopy
28 * @library /testlibrary/whitebox /testlibrary
29 * @build Test8010927
30 * @run main ClassFileInstaller sun.hotspot.WhiteBox
31 * @run main/othervm -XX:+UnlockDiagnosticVMOptions -XX:+IgnoreUnrecognizedVMOptions -XX:+WhiteBoxAPI -Xbootclasspath/a:. -Xmx64m -XX:NewSize=20971520 -XX:MaxNewSize=32m -XX:-UseTLAB -XX:-UseParNewGC -XX:-UseAdaptiveSizePolicy Test8010927
32 */
33
34 import sun.hotspot.WhiteBox;
35 import java.lang.reflect.Field;
36 import sun.misc.Unsafe;
37
38 /**
39 * The test creates uncommitted space between oldgen and young gen
40 * by specifying MaxNewSize bigger than NewSize.
41 * NewSize = 20971520 = (512*4K) * 10 for 4k pages
42 * Then it tries to execute arraycopy() with elements type check
43 * to the array at the end of survive space near unused space.
44 */
45
46 public class Test8010927 {
47
48 private static final Unsafe U;
49
50 static {
51 try {
52 Field unsafe = Unsafe.class.getDeclaredField("theUnsafe");
53 unsafe.setAccessible(true);
54 U = (Unsafe) unsafe.get(null);
55 } catch (Exception e) {
56 throw new Error(e);
57 }
58 }
59
60 public static Object[] o;
61
62 public static final boolean debug = Boolean.getBoolean("debug");
63
64 // 2 different obect arrays but same element types
65 static Test8010927[] masterA;
66 static Object[] masterB;
67 static final Test8010927 elem = new Test8010927();
68 static final WhiteBox wb = WhiteBox.getWhiteBox();
69
70 static final int obj_header_size = U.ARRAY_OBJECT_BASE_OFFSET;
71 static final int heap_oop_size = wb.getHeapOopSize();
72 static final int card_size = 512;
73 static final int one_card = (card_size - obj_header_size)/heap_oop_size;
74
75 static final int surv_size = 2112 * 1024;
76
77 // The size is big to not fit into survive space.
78 static final Object[] cache = new Object[(surv_size / card_size)];
79
80 public static void main(String[] args) {
81 masterA = new Test8010927[one_card];
82 masterB = new Object[one_card];
83 for (int i = 0; i < one_card; ++i) {
84 masterA[i] = elem;
85 masterB[i] = elem;
86 }
87
88 // Move cache[] to the old gen.
89 long low_limit = wb.getObjectAddress(cache);
90 System.gc();
91 // Move 'cache' to oldgen.
92 long upper_limit = wb.getObjectAddress(cache);
93 if ((low_limit - upper_limit) > 0) { // substaction works with unsigned values
94 // OldGen is placed before youngger for ParallelOldGC.
95 upper_limit = low_limit + 21000000l; // +20971520
96 }
97 // Each A[one_card] size is 512 bytes,
98 // it will take about 40000 allocations to trigger GC.
99 // cache[] has 8192 elements so GC should happen
100 // each 5th iteration.
101 for(long l = 0; l < 20; l++) {
102 fill_heap();
103 if (debug) {
104 System.out.println("test oop_disjoint_arraycopy");
105 }
106 testA_arraycopy();
107 if (debug) {
108 System.out.println("test checkcast_arraycopy");
109 }
110 testB_arraycopy();
111 // Execute arraycopy to the topmost array in young gen
112 if (debug) {
113 int top_index = get_top_address(low_limit, upper_limit);
114 if (top_index >= 0) {
115 long addr = wb.getObjectAddress(cache[top_index]);
116 System.out.println("top_addr: 0x" + Long.toHexString(addr) + ", 0x" + Long.toHexString(addr + 512));
117 }
118 }
119 }
120 }
121 static void fill_heap() {
122 for (int i = 0; i < cache.length; ++i) {
123 o = new Test8010927[one_card];
124 System.arraycopy(masterA, 0, o, 0, masterA.length);
125 cache[i] = o;
126 }
127 for (long j = 0; j < 256; ++j) {
128 o = new Long[10000]; // to trigger GC
129 }
130 }
131 static void testA_arraycopy() {
132 for (int i = 0; i < cache.length; ++i) {
133 System.arraycopy(masterA, 0, cache[i], 0, masterA.length);
134 }
135 }
136 static void testB_arraycopy() {
137 for (int i = 0; i < cache.length; ++i) {
138 System.arraycopy(masterB, 0, cache[i], 0, masterB.length);
139 }
140 }
141 static int get_top_address(long min, long max) {
142 int index = -1;
143 long addr = min;
144 for (int i = 0; i < cache.length; ++i) {
145 long test = wb.getObjectAddress(cache[i]);
146 if (((test - addr) > 0) && ((max - test) > 0)) { // substaction works with unsigned values
147 addr = test;
148 index = i;
149 }
150 }
151 return index;
152 }
153 }