1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422
|
/*
* Copyright (c) 2003, 2024, Oracle and/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.
*/
package nsk.monitoring.stress.thread;
import java.lang.management.*;
import java.io.*;
import nsk.share.*;
import nsk.monitoring.share.*;
public class strace001 {
public final static String LIB_NAME = "StackTraceController";
private final static String THREAD_NAME
= "nsk.monitoring.stress.thread.RunningThread";
private final static int ITERATIONS = 50;
public static volatile boolean finish;
public static volatile boolean testFailed = false;
public static Object common = new Object();
public static Integer activeThreads;
public static String activeThreadsSync = "abc";
private static Log log;
private static int depth;
private static int threadCount;
private static String[] expectedTrace;
private static String[] expectedSystemTrace;
private static ThreadMonitor monitor;
private static ThreadController controller;
public static void main(String[] argv) {
System.exit(run(argv, System.out) + Consts.JCK_STATUS_BASE);
}
public static int run(String[] argv, PrintStream out) {
ArgumentHandler argHandler = new ArgumentHandler(argv);
log = new Log(out, argHandler);
monitor = Monitor.getThreadMonitor(log, argHandler);
threadCount = argHandler.getThreadCount();
depth = argHandler.getThreadDepth();
controller = new ThreadController(log, threadCount, depth,
argHandler.getInvocationType());
RunningThread threads[] = new RunningThread[threadCount];
// Fill expectedTrace array according to invocation type that is set in
// test options
if ( !fillTrace() ) {
log.complain("Unknown invocation type: "
+ controller.getInvocationType());
return Consts.TEST_FAILED;
}
for (int i = 0; i < ITERATIONS; i++) {
log.display("\nIteration: " + i);
activeThreads = Integer.valueOf(0);
finish = false;
// Start all threads. Half of them are user threads,
// others - deamon
for (int j = 0; j < threadCount; j++) {
threads[j] = new RunningThread(j, controller, log, depth);
threads[j].setDaemon(i % 2 == 0);
threads[j].start();
}
// Wait for all threads to start
while (activeThreads.intValue() < threadCount)
Thread.currentThread().yield();
log.display("All threads started: " + activeThreads);
// Make a snapshot of stack trace for all threads and check it
for (int j = 0; j < threadCount; j++) {
boolean isAlive = threads[j].isAlive();
ThreadInfo info = monitor.getThreadInfo(threads[j].getId(), Integer.MAX_VALUE);
// A thread may be dead because of OutOfMemoryError or
// StackOverflowError
if (isAlive) {
if (info == null) {
log.complain("ThreadInfo for thread " + j + " is null, "
+ "but Thread.isAlive() returned true.");
testFailed = true;
continue;
}
StackTraceElement[] snapshot = info.getStackTrace();
if ( !checkTrace(snapshot) ) {
log.display("\nSnapshot of thread: " + j);
printStackTrace(snapshot);
testFailed = true;
}
} else {
log.display("Thread " + j + " is dead, skipping it.");
}
}
// Let all threads to complete their job
finish = true;
// Wait for all threads to be dead
for (int j = 0; j < threadCount; j++)
try {
threads[j].join();
} catch (InterruptedException e) {
log.complain("Unexpected exception while joining thread "
+ j);
e.printStackTrace(log.getOutStream());
testFailed = true;
}
log.display("All threads have died.");
} // for i
if (testFailed)
log.complain("TEST FAILED.");
return (testFailed) ? Consts.TEST_FAILED : Consts.TEST_PASSED;
}
// Fill expectedTrace array according to the invocation type that is set in
// test options
private static boolean fillTrace() {
expectedSystemTrace = new String[]{
"java.lang.Thread.sleep",
"java.lang.Thread.sleepNanos",
"java.lang.Thread.sleepNanos0",
"java.lang.Thread.beforeSleep",
"java.lang.Thread.afterSleep",
"java.lang.Thread.yield",
"java.lang.Thread.yield0",
"java.lang.Thread.currentCarrierThread",
"java.lang.Thread.currentThread",
"java.util.concurrent.TimeUnit.toNanos",
"jdk.internal.event.ThreadSleepEvent.<clinit>",
"java.lang.Object.<init>",
"jdk.internal.event.Event.<init>",
"jdk.internal.event.ThreadSleepEvent.<init>",
"jdk.internal.event.ThreadSleepEvent.isEnabled"
};
switch (controller.getInvocationType()) {
case ThreadController.JAVA_TYPE:
expectedTrace = new String[]{
THREAD_NAME + ".waitForSign",
THREAD_NAME + ".recursionJava",
THREAD_NAME + ".run"
};
break;
case ThreadController.NATIVE_TYPE:
expectedTrace = new String[]{
THREAD_NAME + ".waitForSign",
THREAD_NAME + ".recursionNative",
THREAD_NAME + ".run"
};
break;
case ThreadController.MIXED_TYPE:
expectedTrace = new String[]{
THREAD_NAME + ".waitForSign",
THREAD_NAME + ".recursionNative",
THREAD_NAME + ".recursionJava",
THREAD_NAME + ".run"
};
break;
default:
return false;
}
return true;
}
// The method prints stack trace in style JVM does
private static void printStackTrace(StackTraceElement[] elements) {
for (int i = 0; i < elements.length; i++) {
String s = "\t " + i + ": " + elements[i].getClassName() + "."
+ elements[i].getMethodName();
if (elements[i].isNativeMethod())
s = s + "(Native Method)";
else
s = s + "(" + elements[i].getFileName() + ":"
+ elements[i].getLineNumber() + ")";
log.display(s);
}
}
// The method performs checks of the stack trace
private static boolean checkTrace(StackTraceElement[] elements) {
int length = elements.length;
// The length of the trace must not be greater than
// expectedLength. Number of recursionJava() or
// recursionNative() methods must not be greater than depth,
// also one run() and one waitForSign(), plus whatever can be
// reached from Thread.yield or Thread.sleep.
int expectedLength = depth + 7;
boolean result = true;
// Check the length of the trace
if (length > expectedLength) {
log.complain("Length of the stack trace is " + length + ", but "
+ "expected to be not greater than " + expectedLength);
result = false;
}
// Check each element of the snapshot
for (int i = 0; i < elements.length; i++) {
if (i == elements.length - 1) {
// The latest method of the snapshot must be RunningThread.run()
if ( !checkLastElement(elements[i]) )
result = false;
} else {
// getClassName() and getMethodName() must return correct values
// for each element
if ( !checkElement(i, elements[i]) )
result = false;
}
}
return result;
}
// The method checks that StackTraceElement.getClassName() and
// StackTraceElement.getMethodName() return expected values
private static boolean checkElement(int n, StackTraceElement element) {
String name = element.getClassName() + "." + element.getMethodName();
// The latest element is not checked, since it must be "run()"
for (int i = 0; i < expectedTrace.length - 1; i++) {
if (expectedTrace[i].equals(name))
return true;
}
// Implementation of sleep/wait/yield
for (int i = 0; i < expectedSystemTrace.length; i++) {
if (expectedSystemTrace[i].equals(name))
return true;
}
log.complain("Unexpected " + n + " element of the stack trace:\n\t"
+ name);
return false;
}
// The method checks that StackTraceElement.getClassName() returns
// "RunningThread" and StackTraceElement.getMethodName() returns "run"
// for the latest element of the snapshot
private static boolean checkLastElement(StackTraceElement element) {
String name = element.getClassName() + "." + element.getMethodName();
String last = expectedTrace[expectedTrace.length - 1];
if (!last.equals(name)) {
log.complain("Unexpected last element of the stack trace:\n\t"
+ name + "\nexpected:\n\t" + last);
return false;
}
return true;
}
}
// This thread starts a recursion until it reaches specified depth. Then the
// thread waits until it gets a notification from main thread. Pure java
// and native methods are used in the thread. So, the thread is definitly in
// "running" state when main thread performs its checks.
class RunningThread extends Thread {
private int num;
private static ThreadController controller;
private Log log;
private int depth;
private boolean mixed = false;
native int recursionNative(int maxDepth, int currentDepth, boolean returnToJava);
static {
try {
System.loadLibrary(strace001.LIB_NAME);
} catch (UnsatisfiedLinkError e) {
System.err.println("Cannot load library " + strace001.LIB_NAME);
System.err.println("java.library.path: "
+ System.getProperty("java.library.path"));
throw e;
}
}
RunningThread(int num, ThreadController controller, Log log, int depth) {
this.num = num;
this.controller = controller;
this.log = log;
this.depth = depth;
}
public void run() {
int result = 0;
int invocationType = controller.getInvocationType();
// This instance of the thread is alive
synchronized (strace001.common) {
synchronized (strace001.activeThreadsSync) {
strace001.activeThreads
= Integer.valueOf(strace001.activeThreads.intValue() + 1);
}
}
// Choose a method (native or java) to continue recursion
try {
switch (invocationType) {
case ThreadController.JAVA_TYPE:
recursionJava(depth, 0);
break;
case ThreadController.NATIVE_TYPE:
result = recursionNative(depth, 0, false);
if (result == 1) {
log.display("Fatal error (OutOfMemoryError or "
+ "StackOverflow) is thrown in native method of "
+ " thread " + num);
return;
} else if (result == 2) {
log.complain("Unexpected exception is thrown in native "
+ "method of thread " + num);
strace001.testFailed = true;
return;
}
break;
case ThreadController.MIXED_TYPE:
mixed = true;
result = recursionNative(depth, 0, true);
if (result == 1) {
log.display("Fatal error (OutOfMemoryError or "
+ "StackOverflow) is thrown in native method of "
+ " thread " + num);
return;
} else if (result == 2) {
log.complain("Unexpected exception is thrown in native "
+ "method of thread " + num);
strace001.testFailed = true;
return;
}
break;
default:
log.complain("Unknown invocation type: "
+ controller.getInvocationType());
strace001.testFailed = true;
}
} catch (OutOfMemoryError e) {
// Recursion is too deep, so exit peacefully
log.display("OutOfMemoryError is thrown in thread " + num);
} catch (StackOverflowError e) {
// Recursion is too deep, so exit peacefully
log.display("StackOverflowError is thrown in thread " + num);
}
} // run()
private void recursionJava(int maxDepth, int currentDepth) {
// A short delay. Otherwise the method will reach the specified depth
// almost instantly
try {
sleep(1);
} catch (InterruptedException e) {
log.complain("Unexpected exception");
e.printStackTrace(log.getOutStream());
strace001.testFailed = true;
}
currentDepth++;
if (maxDepth > currentDepth) {
Thread.yield();
if (mixed) {
int result = recursionNative(maxDepth, currentDepth, true);
if (result == 1) {
log.display("Fatal error (OutOfMemoryError or "
+ "StackOverflow) is thrown in native method of "
+ " thread " + num);
return;
} else if (result == 2) {
log.complain("Unexpected exception is thrown in native "
+ "method of thread " + num);
strace001.testFailed = true;
return;
}
} else
recursionJava(maxDepth, currentDepth);
}
waitForSign();
} // recursionJava()
private void waitForSign() {
// When the depth is reached, wait for a notification from main thread
while (!strace001.finish) {
try {
sleep(1);
} catch (InterruptedException e) {
log.complain("Unexpected exception");
e.printStackTrace(log.getOutStream());
strace001.testFailed = true;
break;
}
}
} // waitForSign()
} // class RunningThread
|