author | jcbeyler |
Thu, 19 Jul 2018 18:21:24 -0700 | |
changeset 51210 | e750c1a054fa |
parent 51138 | 914f305ba6fa |
child 51559 | 57f1bf06742e |
permissions | -rw-r--r-- |
50579 | 1 |
/* |
2 |
* Copyright (c) 2018, Google 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 |
package MyPackage; |
|
25 |
||
51074 | 26 |
import java.lang.management.ManagementFactory; |
50579 | 27 |
import java.util.ArrayList; |
28 |
import java.util.List; |
|
29 |
||
51074 | 30 |
import com.sun.management.HotSpotDiagnosticMXBean; |
31 |
import com.sun.management.VMOption; |
|
32 |
||
50579 | 33 |
/** API for handling the underlying heap sampling monitoring system. */ |
34 |
public class HeapMonitor { |
|
35 |
private static int[][] arrays; |
|
36 |
private static int allocationIterations = 1000; |
|
37 |
||
38 |
static { |
|
39 |
try { |
|
40 |
System.loadLibrary("HeapMonitorTest"); |
|
41 |
} catch (UnsatisfiedLinkError ule) { |
|
42 |
System.err.println("Could not load HeapMonitor library"); |
|
43 |
System.err.println("java.library.path: " + System.getProperty("java.library.path")); |
|
44 |
throw ule; |
|
45 |
} |
|
46 |
} |
|
47 |
||
51138
914f305ba6fa
8205725: Update the JVMTI Spec for Heap Sampling
jcbeyler
parents:
51074
diff
changeset
|
48 |
/** Set a specific sampling interval, 0 samples every allocation. */ |
914f305ba6fa
8205725: Update the JVMTI Spec for Heap Sampling
jcbeyler
parents:
51074
diff
changeset
|
49 |
public native static void setSamplingInterval(int interval); |
50579 | 50 |
public native static void enableSamplingEvents(); |
51 |
public native static boolean enableSamplingEventsForTwoThreads(Thread firstThread, Thread secondThread); |
|
52 |
public native static void disableSamplingEvents(); |
|
53 |
||
54 |
/** |
|
55 |
* Allocate memory but first create a stack trace. |
|
56 |
* |
|
57 |
* @return list of frames for the allocation. |
|
58 |
*/ |
|
59 |
public static List<Frame> allocate() { |
|
60 |
int sum = 0; |
|
61 |
List<Frame> frames = new ArrayList<Frame>(); |
|
62 |
allocate(frames); |
|
51074 | 63 |
frames.add(new Frame("allocate", "()Ljava/util/List;", "HeapMonitor.java", 62)); |
50579 | 64 |
return frames; |
65 |
} |
|
66 |
||
67 |
private static void allocate(List<Frame> frames) { |
|
68 |
int sum = 0; |
|
69 |
for (int j = 0; j < allocationIterations; j++) { |
|
70 |
sum += actuallyAllocate(); |
|
71 |
} |
|
51074 | 72 |
frames.add(new Frame("actuallyAllocate", "()I", "HeapMonitor.java", 97)); |
73 |
frames.add(new Frame("allocate", "(Ljava/util/List;)V", "HeapMonitor.java", 70)); |
|
50579 | 74 |
} |
75 |
||
76 |
public static List<Frame> repeatAllocate(int max) { |
|
77 |
List<Frame> frames = null; |
|
78 |
for (int i = 0; i < max; i++) { |
|
79 |
frames = allocate(); |
|
80 |
} |
|
51074 | 81 |
frames.add(new Frame("repeatAllocate", "(I)Ljava/util/List;", "HeapMonitor.java", 79)); |
50579 | 82 |
return frames; |
83 |
} |
|
84 |
||
85 |
private static int actuallyAllocate() { |
|
86 |
int sum = 0; |
|
87 |
||
88 |
// Let us assume that a 1-element array is 24 bytes of memory and we want |
|
89 |
// 2MB allocated. |
|
90 |
int iterations = (1 << 19) / 6; |
|
91 |
||
92 |
if (arrays == null) { |
|
93 |
arrays = new int[iterations][]; |
|
94 |
} |
|
95 |
||
96 |
for (int i = 0; i < iterations; i++) { |
|
97 |
int tmp[] = new int[1]; |
|
98 |
// Force it to be kept and, at the same time, wipe out any previous data. |
|
99 |
arrays[i] = tmp; |
|
100 |
sum += arrays[0][0]; |
|
101 |
} |
|
102 |
return sum; |
|
103 |
} |
|
104 |
||
51210
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
105 |
private static double averageOneElementSize; |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
106 |
private static native double getAverageSize(); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
107 |
|
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
108 |
// Calculate the size of a 1-element array in order to assess average sampling interval |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
109 |
// via the HeapMonitorStatIntervalTest. This is needed because various GCs could add |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
110 |
// extra memory to arrays. |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
111 |
// This is done by allocating a 1-element array and then looking in the heap monitoring |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
112 |
// samples for the average size of objects collected. |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
113 |
public static void calculateAverageOneElementSize() { |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
114 |
enableSamplingEvents(); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
115 |
// Assume a size of 24 for the average size. |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
116 |
averageOneElementSize = 24; |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
117 |
|
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
118 |
// Call allocateSize once, this allocates the internal array for the iterations. |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
119 |
int totalSize = 10 * 1024 * 1024; |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
120 |
allocateSize(totalSize); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
121 |
|
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
122 |
// Reset the storage and now really track the size of the elements. |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
123 |
resetEventStorage(); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
124 |
allocateSize(totalSize); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
125 |
disableSamplingEvents(); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
126 |
|
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
127 |
// Get the actual average size. |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
128 |
averageOneElementSize = getAverageSize(); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
129 |
if (averageOneElementSize == 0) { |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
130 |
throw new RuntimeException("Could not calculate the average size of a 1-element array."); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
131 |
} |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
132 |
} |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
133 |
|
50579 | 134 |
public static int allocateSize(int totalSize) { |
51210
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
135 |
if (averageOneElementSize == 0) { |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
136 |
throw new RuntimeException("Average size of a 1-element array was not calculated."); |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
137 |
} |
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
138 |
|
50579 | 139 |
int sum = 0; |
140 |
||
51210
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
141 |
int iterations = (int) (totalSize / averageOneElementSize); |
50579 | 142 |
|
51210
e750c1a054fa
8207765: HeapMonitorStatIntervalTest.java fails with ZGC
jcbeyler
parents:
51138
diff
changeset
|
143 |
if (arrays == null || arrays.length < iterations) { |
50579 | 144 |
arrays = new int[iterations][]; |
145 |
} |
|
146 |
||
147 |
System.out.println("Allocating for " + iterations); |
|
148 |
for (int i = 0; i < iterations; i++) { |
|
149 |
int tmp[] = new int[1]; |
|
150 |
||
151 |
// Force it to be kept and, at the same time, wipe out any previous data. |
|
152 |
arrays[i] = tmp; |
|
153 |
sum += arrays[0][0]; |
|
154 |
} |
|
155 |
||
156 |
return sum; |
|
157 |
} |
|
158 |
||
159 |
/** Remove the reference to the global array to free data at the next GC. */ |
|
160 |
public static void freeStorage() { |
|
161 |
arrays = null; |
|
162 |
} |
|
163 |
||
164 |
public static int[][][] sampleEverything() { |
|
165 |
enableSamplingEvents(); |
|
51138
914f305ba6fa
8205725: Update the JVMTI Spec for Heap Sampling
jcbeyler
parents:
51074
diff
changeset
|
166 |
setSamplingInterval(0); |
50579 | 167 |
|
168 |
// Loop around an allocation loop and wait until the tlabs have settled. |
|
169 |
final int maxTries = 10; |
|
170 |
int[][][] result = new int[maxTries][][]; |
|
171 |
for (int i = 0; i < maxTries; i++) { |
|
172 |
final int maxInternalTries = 400; |
|
173 |
result[i] = new int[maxInternalTries][]; |
|
174 |
||
175 |
resetEventStorage(); |
|
176 |
for (int j = 0; j < maxInternalTries; j++) { |
|
177 |
final int size = 1000; |
|
178 |
result[i][j] = new int[size]; |
|
179 |
} |
|
180 |
||
181 |
int sampledEvents = sampledEvents(); |
|
182 |
if (sampledEvents == maxInternalTries) { |
|
183 |
return result; |
|
184 |
} |
|
185 |
} |
|
186 |
||
187 |
throw new RuntimeException("Could not set the sampler"); |
|
188 |
} |
|
189 |
||
190 |
public native static int sampledEvents(); |
|
51074 | 191 |
public native static boolean obtainedEvents(Frame[] frames, boolean checkLines); |
192 |
public native static boolean garbageContains(Frame[] frames, boolean checkLines); |
|
50579 | 193 |
public native static boolean eventStorageIsEmpty(); |
194 |
public native static void resetEventStorage(); |
|
195 |
public native static int getEventStorageElementCount(); |
|
196 |
public native static void forceGarbageCollection(); |
|
197 |
public native static boolean enableVMEvents(); |
|
198 |
||
51074 | 199 |
private static boolean getCheckLines() { |
200 |
boolean checkLines = true; |
|
201 |
||
202 |
// Do not check lines for Graal since it is not always "precise" with BCIs at uncommon traps. |
|
203 |
try { |
|
204 |
HotSpotDiagnosticMXBean bean = ManagementFactory.getPlatformMXBean(HotSpotDiagnosticMXBean.class); |
|
205 |
||
206 |
VMOption enableJVMCI = bean.getVMOption("EnableJVMCI"); |
|
207 |
VMOption useJVMCICompiler = bean.getVMOption("UseJVMCICompiler"); |
|
208 |
String compiler = System.getProperty("jvmci.Compiler"); |
|
209 |
||
210 |
checkLines = !(enableJVMCI.getValue().equals("true") |
|
211 |
&& useJVMCICompiler.getValue().equals("true") && compiler.equals("graal")); |
|
212 |
} catch (Exception e) { |
|
213 |
// NOP. |
|
214 |
} |
|
215 |
||
216 |
return checkLines; |
|
217 |
} |
|
218 |
||
219 |
public static boolean obtainedEvents(Frame[] frames) { |
|
220 |
return obtainedEvents(frames, getCheckLines()); |
|
221 |
} |
|
222 |
||
223 |
public static boolean garbageContains(Frame[] frames) { |
|
224 |
return garbageContains(frames, getCheckLines()); |
|
225 |
} |
|
226 |
||
50579 | 227 |
public static boolean statsHaveExpectedNumberSamples(int expected, int acceptedErrorPercentage) { |
228 |
double actual = getEventStorageElementCount(); |
|
229 |
double diffPercentage = Math.abs(actual - expected) / expected; |
|
230 |
return diffPercentage < acceptedErrorPercentage; |
|
231 |
} |
|
232 |
||
233 |
public static void setAllocationIterations(int iterations) { |
|
234 |
allocationIterations = iterations; |
|
235 |
} |
|
236 |
} |