Skip to content

Commit

Permalink
8330849: Add test to verify memory usage with recursive locking
Browse files Browse the repository at this point in the history
  • Loading branch information
rkennke committed Apr 22, 2024
1 parent 7e421ce commit 3031942
Showing 1 changed file with 99 additions and 0 deletions.
99 changes: 99 additions & 0 deletions test/hotspot/jtreg/runtime/locking/TestRecursiveMonitorChurn.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,99 @@
/*
* Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/

import jdk.test.lib.process.OutputAnalyzer;
import jdk.test.lib.process.ProcessTools;

import java.io.IOException;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

/*
* @test
* @summary Tests that recursive locking doesn't cause excessive native memory usage
* @library /test/lib
* @run main TestRecursiveMonitorChurn
*/
public class TestRecursiveMonitorChurn {
static class Monitor {
volatile int i, j;
synchronized void doSomething() {
i++;
doSomethingElse();
}
synchronized void doSomethingElse() {
j++;
}
}

public static void main(String[] args) throws IOException {
if (args.length == 1 && args[0].equals("test")) {
// The actual test, in a forked JVM.
for (int i = 0; i < 100000; i++) {
Monitor m = new Monitor();
m.doSomething();
}
} else {
ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
"-XX:+UnlockDiagnosticVMOptions",
"-Xmx100M", "-XX:TieredStopAtLevel=1", "-XX:AsyncDeflationInterval=0",
"-XX:NativeMemoryTracking=summary", "-XX:+PrintNMTStatistics",
"-XX:LockingMode=2",
"TestRecursiveMonitorChurn",
"test");
OutputAnalyzer output = new OutputAnalyzer(pb.start());
output.reportDiagnosticSummary();

output.shouldHaveExitValue(0);

// We want to see, in the final NMT printout, a committed object monitor size that is reasonably low.
// Like this:
// - Object Monitors (reserved=208, committed=208)
// (malloc=208 #1) (at peak)
//
// Without recursive locking support, this would look more like this:
// - Object Monitors (reserved=20800624, committed=20800624)
// (malloc=20800624 #100003) (at peak)

Pattern pat = Pattern.compile("- *Object Monitors.*reserved=(\\d+), committed=(\\d+).*");
boolean foundLine = false;
for (String line : output.asLines()) {
Matcher m = pat.matcher(line);
if (m.matches()) {
long reserved = Long.parseLong(m.group(1));
long committed = Long.parseLong(m.group(2));
System.out.println(">>>>> " + line + ": " + reserved + " - " + committed);
if (committed > 1000) {
throw new RuntimeException("Allocated too many monitors");
}
foundLine = true;
break;
}
}
if (!foundLine) {
throw new RuntimeException("Did not find expected NMT output");
}

}
}
}

0 comments on commit 3031942

Please sign in to comment.