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 /*
25 * @test PauseNotifications
26 * @summary Check that MX notifications are reported for all cycles
27 *
28 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=passive -XX:+ShenandoahDegeneratedGC PauseNotifications
29 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=passive -XX:-ShenandoahDegeneratedGC PauseNotifications
30 *
31 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=aggressive PauseNotifications
32 *
33 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=adaptive PauseNotifications
34 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=static PauseNotifications
35 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=compact PauseNotifications
36 * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions -XX:+UseShenandoahGC -XX:ShenandoahGCHeuristics=traversal PauseNotifications
37 */
38
39 import java.util.*;
40 import java.util.concurrent.atomic.*;
41 import javax.management.*;
42 import java.lang.management.*;
43 import javax.management.openmbean.*;
44 import com.sun.management.GarbageCollectionNotificationInfo;
45
46 public class PauseNotifications {
47
48 static final long HEAP_MB = 128; // adjust for test configuration above
49 static final long TARGET_MB = Long.getLong("target", 8_000); // 8 Gb allocation
50
51 static volatile Object sink;
52
53 public static void main(String[] args) throws Exception {
54 final AtomicLong pausesDuration = new AtomicLong();
55 final AtomicLong cyclesDuration = new AtomicLong();
56
57 NotificationListener listener = new NotificationListener() {
58 @Override
59 public void handleNotification(Notification n, Object o) {
60 if (n.getType().equals(GarbageCollectionNotificationInfo.GARBAGE_COLLECTION_NOTIFICATION)) {
61 GarbageCollectionNotificationInfo info = GarbageCollectionNotificationInfo.from((CompositeData)n.getUserData());
62
63 System.out.println(info.getGcInfo().toString());
64 System.out.println(info.getGcName());
65 System.out.println();
66
67 long d = info.getGcInfo().getDuration();
68
69 String name = info.getGcName();
70 if (name.contains("Shenandoah")) {
71 if (name.equals("Shenandoah Pauses")) {
72 pausesDuration.addAndGet(d);
73 } else if (name.equals("Shenandoah Cycles")) {
74 cyclesDuration.addAndGet(d);
75 } else {
76 throw new IllegalStateException("Unknown name: " + name);
77 }
78 }
79 }
80 }
81 };
82
83 for (GarbageCollectorMXBean bean : ManagementFactory.getGarbageCollectorMXBeans()) {
84 ((NotificationEmitter) bean).addNotificationListener(listener, null, null);
85 }
86
87 final int size = 100_000;
88 long count = TARGET_MB * 1024 * 1024 / (16 + 4*size);
89
90 for (int c = 0; c < count; c++) {
91 sink = new int[size];
92 }
93
94 Thread.sleep(1000);
95
96 long pausesActual = pausesDuration.get();
97 long cyclesActual = cyclesDuration.get();
98
99 long minExpected = 1;
100 long maxExpected = Long.MAX_VALUE;
101
102 {
103 String msg = "Pauses expected = [" + minExpected + "; " + maxExpected + "], actual = " + pausesActual;
104 if (minExpected < pausesActual && pausesActual < maxExpected) {
105 System.out.println(msg);
106 } else {
107 throw new IllegalStateException(msg);
108 }
109 }
110
111 {
112 String msg = "Cycles expected = [" + minExpected + "; " + maxExpected + "], actual = " + cyclesActual;
113 if (minExpected < cyclesActual && cyclesActual < maxExpected) {
114 System.out.println(msg);
115 } else {
116 throw new IllegalStateException(msg);
117 }
118 }
119
120 {
121 String msg = "Cycle duration (" + cyclesActual + "), pause duration (" + pausesActual + ")";
122 if (pausesActual < cyclesActual) {
123 System.out.println(msg);
124 } else {
125 throw new IllegalStateException(msg);
126 }
127 }
128 }
129 }