src/share/vm/runtime/safepoint.cpp

Wed, 17 Aug 2011 10:32:53 -0700

author
jcoomes
date
Wed, 17 Aug 2011 10:32:53 -0700
changeset 3057
24cee90e9453
parent 2964
2a241e764894
child 3156
f08d439fab8c
permissions
-rw-r--r--

6791672: enable 1G and larger pages on solaris
Reviewed-by: ysr, iveresov, johnc

duke@435 1 /*
trims@2708 2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "classfile/systemDictionary.hpp"
stefank@2314 27 #include "code/codeCache.hpp"
stefank@2314 28 #include "code/icBuffer.hpp"
stefank@2314 29 #include "code/nmethod.hpp"
stefank@2314 30 #include "code/pcDesc.hpp"
stefank@2314 31 #include "code/scopeDesc.hpp"
stefank@2314 32 #include "gc_interface/collectedHeap.hpp"
stefank@2314 33 #include "interpreter/interpreter.hpp"
stefank@2314 34 #include "memory/resourceArea.hpp"
stefank@2314 35 #include "memory/universe.inline.hpp"
stefank@2314 36 #include "oops/oop.inline.hpp"
coleenp@2497 37 #include "oops/symbol.hpp"
stefank@2314 38 #include "runtime/compilationPolicy.hpp"
stefank@2314 39 #include "runtime/deoptimization.hpp"
stefank@2314 40 #include "runtime/frame.inline.hpp"
stefank@2314 41 #include "runtime/interfaceSupport.hpp"
stefank@2314 42 #include "runtime/mutexLocker.hpp"
stefank@2314 43 #include "runtime/osThread.hpp"
stefank@2314 44 #include "runtime/safepoint.hpp"
stefank@2314 45 #include "runtime/signature.hpp"
stefank@2314 46 #include "runtime/stubCodeGenerator.hpp"
stefank@2314 47 #include "runtime/stubRoutines.hpp"
stefank@2314 48 #include "runtime/sweeper.hpp"
stefank@2314 49 #include "runtime/synchronizer.hpp"
stefank@2314 50 #include "services/runtimeService.hpp"
stefank@2314 51 #include "utilities/events.hpp"
stefank@2314 52 #ifdef TARGET_ARCH_x86
stefank@2314 53 # include "nativeInst_x86.hpp"
stefank@2314 54 # include "vmreg_x86.inline.hpp"
stefank@2314 55 #endif
stefank@2314 56 #ifdef TARGET_ARCH_sparc
stefank@2314 57 # include "nativeInst_sparc.hpp"
stefank@2314 58 # include "vmreg_sparc.inline.hpp"
stefank@2314 59 #endif
stefank@2314 60 #ifdef TARGET_ARCH_zero
stefank@2314 61 # include "nativeInst_zero.hpp"
stefank@2314 62 # include "vmreg_zero.inline.hpp"
stefank@2314 63 #endif
bobv@2508 64 #ifdef TARGET_ARCH_arm
bobv@2508 65 # include "nativeInst_arm.hpp"
bobv@2508 66 # include "vmreg_arm.inline.hpp"
bobv@2508 67 #endif
bobv@2508 68 #ifdef TARGET_ARCH_ppc
bobv@2508 69 # include "nativeInst_ppc.hpp"
bobv@2508 70 # include "vmreg_ppc.inline.hpp"
bobv@2508 71 #endif
stefank@2314 72 #ifdef TARGET_OS_FAMILY_linux
stefank@2314 73 # include "thread_linux.inline.hpp"
stefank@2314 74 #endif
stefank@2314 75 #ifdef TARGET_OS_FAMILY_solaris
stefank@2314 76 # include "thread_solaris.inline.hpp"
stefank@2314 77 #endif
stefank@2314 78 #ifdef TARGET_OS_FAMILY_windows
stefank@2314 79 # include "thread_windows.inline.hpp"
stefank@2314 80 #endif
stefank@2314 81 #ifndef SERIALGC
stefank@2314 82 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepThread.hpp"
stefank@2314 83 #include "gc_implementation/shared/concurrentGCThread.hpp"
stefank@2314 84 #endif
stefank@2314 85 #ifdef COMPILER1
stefank@2314 86 #include "c1/c1_globals.hpp"
stefank@2314 87 #endif
duke@435 88
duke@435 89 // --------------------------------------------------------------------------------------------------
duke@435 90 // Implementation of Safepoint begin/end
duke@435 91
duke@435 92 SafepointSynchronize::SynchronizeState volatile SafepointSynchronize::_state = SafepointSynchronize::_not_synchronized;
duke@435 93 volatile int SafepointSynchronize::_waiting_to_block = 0;
duke@435 94 volatile int SafepointSynchronize::_safepoint_counter = 0;
xlu@1726 95 long SafepointSynchronize::_end_of_last_safepoint = 0;
duke@435 96 static volatile int PageArmed = 0 ; // safepoint polling page is RO|RW vs PROT_NONE
duke@435 97 static volatile int TryingToBlock = 0 ; // proximate value -- for advisory use only
duke@435 98 static bool timeout_error_printed = false;
duke@435 99
duke@435 100 // Roll all threads forward to a safepoint and suspend them all
duke@435 101 void SafepointSynchronize::begin() {
duke@435 102
duke@435 103 Thread* myThread = Thread::current();
duke@435 104 assert(myThread->is_VM_thread(), "Only VM thread may execute a safepoint");
duke@435 105
xlu@1726 106 if (PrintSafepointStatistics || PrintSafepointStatisticsTimeout > 0) {
xlu@1726 107 _safepoint_begin_time = os::javaTimeNanos();
xlu@1726 108 _ts_of_current_safepoint = tty->time_stamp().seconds();
xlu@1726 109 }
duke@435 110
duke@435 111 #ifndef SERIALGC
duke@435 112 if (UseConcMarkSweepGC) {
duke@435 113 // In the future we should investigate whether CMS can use the
duke@435 114 // more-general mechanism below. DLD (01/05).
duke@435 115 ConcurrentMarkSweepThread::synchronize(false);
ysr@1280 116 } else if (UseG1GC) {
duke@435 117 ConcurrentGCThread::safepoint_synchronize();
duke@435 118 }
duke@435 119 #endif // SERIALGC
duke@435 120
duke@435 121 // By getting the Threads_lock, we assure that no threads are about to start or
duke@435 122 // exit. It is released again in SafepointSynchronize::end().
duke@435 123 Threads_lock->lock();
duke@435 124
duke@435 125 assert( _state == _not_synchronized, "trying to safepoint synchronize with wrong state");
duke@435 126
duke@435 127 int nof_threads = Threads::number_of_threads();
duke@435 128
duke@435 129 if (TraceSafepoint) {
duke@435 130 tty->print_cr("Safepoint synchronization initiated. (%d)", nof_threads);
duke@435 131 }
duke@435 132
duke@435 133 RuntimeService::record_safepoint_begin();
duke@435 134
duke@435 135 {
duke@435 136 MutexLocker mu(Safepoint_lock);
duke@435 137
duke@435 138 // Set number of threads to wait for, before we initiate the callbacks
duke@435 139 _waiting_to_block = nof_threads;
duke@435 140 TryingToBlock = 0 ;
duke@435 141 int still_running = nof_threads;
duke@435 142
duke@435 143 // Save the starting time, so that it can be compared to see if this has taken
duke@435 144 // too long to complete.
duke@435 145 jlong safepoint_limit_time;
duke@435 146 timeout_error_printed = false;
duke@435 147
xlu@1438 148 // PrintSafepointStatisticsTimeout can be specified separately. When
xlu@1438 149 // specified, PrintSafepointStatistics will be set to true in
xlu@1438 150 // deferred_initialize_stat method. The initialization has to be done
xlu@1438 151 // early enough to avoid any races. See bug 6880029 for details.
xlu@1438 152 if (PrintSafepointStatistics || PrintSafepointStatisticsTimeout > 0) {
xlu@1438 153 deferred_initialize_stat();
xlu@1438 154 }
xlu@1438 155
duke@435 156 // Begin the process of bringing the system to a safepoint.
duke@435 157 // Java threads can be in several different states and are
duke@435 158 // stopped by different mechanisms:
duke@435 159 //
duke@435 160 // 1. Running interpreted
duke@435 161 // The interpeter dispatch table is changed to force it to
duke@435 162 // check for a safepoint condition between bytecodes.
duke@435 163 // 2. Running in native code
duke@435 164 // When returning from the native code, a Java thread must check
duke@435 165 // the safepoint _state to see if we must block. If the
duke@435 166 // VM thread sees a Java thread in native, it does
duke@435 167 // not wait for this thread to block. The order of the memory
duke@435 168 // writes and reads of both the safepoint state and the Java
duke@435 169 // threads state is critical. In order to guarantee that the
duke@435 170 // memory writes are serialized with respect to each other,
duke@435 171 // the VM thread issues a memory barrier instruction
duke@435 172 // (on MP systems). In order to avoid the overhead of issuing
duke@435 173 // a memory barrier for each Java thread making native calls, each Java
duke@435 174 // thread performs a write to a single memory page after changing
duke@435 175 // the thread state. The VM thread performs a sequence of
duke@435 176 // mprotect OS calls which forces all previous writes from all
duke@435 177 // Java threads to be serialized. This is done in the
duke@435 178 // os::serialize_thread_states() call. This has proven to be
duke@435 179 // much more efficient than executing a membar instruction
duke@435 180 // on every call to native code.
duke@435 181 // 3. Running compiled Code
duke@435 182 // Compiled code reads a global (Safepoint Polling) page that
duke@435 183 // is set to fault if we are trying to get to a safepoint.
duke@435 184 // 4. Blocked
duke@435 185 // A thread which is blocked will not be allowed to return from the
duke@435 186 // block condition until the safepoint operation is complete.
duke@435 187 // 5. In VM or Transitioning between states
duke@435 188 // If a Java thread is currently running in the VM or transitioning
duke@435 189 // between states, the safepointing code will wait for the thread to
duke@435 190 // block itself when it attempts transitions to a new state.
duke@435 191 //
duke@435 192 _state = _synchronizing;
duke@435 193 OrderAccess::fence();
duke@435 194
duke@435 195 // Flush all thread states to memory
duke@435 196 if (!UseMembar) {
duke@435 197 os::serialize_thread_states();
duke@435 198 }
duke@435 199
duke@435 200 // Make interpreter safepoint aware
duke@435 201 Interpreter::notice_safepoints();
duke@435 202
duke@435 203 if (UseCompilerSafepoints && DeferPollingPageLoopCount < 0) {
duke@435 204 // Make polling safepoint aware
duke@435 205 guarantee (PageArmed == 0, "invariant") ;
duke@435 206 PageArmed = 1 ;
duke@435 207 os::make_polling_page_unreadable();
duke@435 208 }
duke@435 209
duke@435 210 // Consider using active_processor_count() ... but that call is expensive.
duke@435 211 int ncpus = os::processor_count() ;
duke@435 212
duke@435 213 #ifdef ASSERT
duke@435 214 for (JavaThread *cur = Threads::first(); cur != NULL; cur = cur->next()) {
duke@435 215 assert(cur->safepoint_state()->is_running(), "Illegal initial state");
duke@435 216 }
duke@435 217 #endif // ASSERT
duke@435 218
duke@435 219 if (SafepointTimeout)
duke@435 220 safepoint_limit_time = os::javaTimeNanos() + (jlong)SafepointTimeoutDelay * MICROUNITS;
duke@435 221
duke@435 222 // Iterate through all threads until it have been determined how to stop them all at a safepoint
duke@435 223 unsigned int iterations = 0;
duke@435 224 int steps = 0 ;
duke@435 225 while(still_running > 0) {
duke@435 226 for (JavaThread *cur = Threads::first(); cur != NULL; cur = cur->next()) {
duke@435 227 assert(!cur->is_ConcurrentGC_thread(), "A concurrent GC thread is unexpectly being suspended");
duke@435 228 ThreadSafepointState *cur_state = cur->safepoint_state();
duke@435 229 if (cur_state->is_running()) {
duke@435 230 cur_state->examine_state_of_thread();
duke@435 231 if (!cur_state->is_running()) {
duke@435 232 still_running--;
duke@435 233 // consider adjusting steps downward:
duke@435 234 // steps = 0
duke@435 235 // steps -= NNN
duke@435 236 // steps >>= 1
duke@435 237 // steps = MIN(steps, 2000-100)
duke@435 238 // if (iterations != 0) steps -= NNN
duke@435 239 }
duke@435 240 if (TraceSafepoint && Verbose) cur_state->print();
duke@435 241 }
duke@435 242 }
duke@435 243
xlu@1438 244 if (PrintSafepointStatistics && iterations == 0) {
duke@435 245 begin_statistics(nof_threads, still_running);
duke@435 246 }
duke@435 247
duke@435 248 if (still_running > 0) {
duke@435 249 // Check for if it takes to long
duke@435 250 if (SafepointTimeout && safepoint_limit_time < os::javaTimeNanos()) {
duke@435 251 print_safepoint_timeout(_spinning_timeout);
duke@435 252 }
duke@435 253
duke@435 254 // Spin to avoid context switching.
duke@435 255 // There's a tension between allowing the mutators to run (and rendezvous)
duke@435 256 // vs spinning. As the VM thread spins, wasting cycles, it consumes CPU that
duke@435 257 // a mutator might otherwise use profitably to reach a safepoint. Excessive
duke@435 258 // spinning by the VM thread on a saturated system can increase rendezvous latency.
duke@435 259 // Blocking or yielding incur their own penalties in the form of context switching
duke@435 260 // and the resultant loss of $ residency.
duke@435 261 //
duke@435 262 // Further complicating matters is that yield() does not work as naively expected
duke@435 263 // on many platforms -- yield() does not guarantee that any other ready threads
duke@435 264 // will run. As such we revert yield_all() after some number of iterations.
duke@435 265 // Yield_all() is implemented as a short unconditional sleep on some platforms.
duke@435 266 // Typical operating systems round a "short" sleep period up to 10 msecs, so sleeping
duke@435 267 // can actually increase the time it takes the VM thread to detect that a system-wide
duke@435 268 // stop-the-world safepoint has been reached. In a pathological scenario such as that
duke@435 269 // described in CR6415670 the VMthread may sleep just before the mutator(s) become safe.
duke@435 270 // In that case the mutators will be stalled waiting for the safepoint to complete and the
duke@435 271 // the VMthread will be sleeping, waiting for the mutators to rendezvous. The VMthread
duke@435 272 // will eventually wake up and detect that all mutators are safe, at which point
duke@435 273 // we'll again make progress.
duke@435 274 //
duke@435 275 // Beware too that that the VMThread typically runs at elevated priority.
duke@435 276 // Its default priority is higher than the default mutator priority.
duke@435 277 // Obviously, this complicates spinning.
duke@435 278 //
duke@435 279 // Note too that on Windows XP SwitchThreadTo() has quite different behavior than Sleep(0).
duke@435 280 // Sleep(0) will _not yield to lower priority threads, while SwitchThreadTo() will.
duke@435 281 //
duke@435 282 // See the comments in synchronizer.cpp for additional remarks on spinning.
duke@435 283 //
duke@435 284 // In the future we might:
duke@435 285 // 1. Modify the safepoint scheme to avoid potentally unbounded spinning.
duke@435 286 // This is tricky as the path used by a thread exiting the JVM (say on
duke@435 287 // on JNI call-out) simply stores into its state field. The burden
duke@435 288 // is placed on the VM thread, which must poll (spin).
duke@435 289 // 2. Find something useful to do while spinning. If the safepoint is GC-related
duke@435 290 // we might aggressively scan the stacks of threads that are already safe.
duke@435 291 // 3. Use Solaris schedctl to examine the state of the still-running mutators.
duke@435 292 // If all the mutators are ONPROC there's no reason to sleep or yield.
duke@435 293 // 4. YieldTo() any still-running mutators that are ready but OFFPROC.
duke@435 294 // 5. Check system saturation. If the system is not fully saturated then
duke@435 295 // simply spin and avoid sleep/yield.
duke@435 296 // 6. As still-running mutators rendezvous they could unpark the sleeping
duke@435 297 // VMthread. This works well for still-running mutators that become
duke@435 298 // safe. The VMthread must still poll for mutators that call-out.
duke@435 299 // 7. Drive the policy on time-since-begin instead of iterations.
duke@435 300 // 8. Consider making the spin duration a function of the # of CPUs:
duke@435 301 // Spin = (((ncpus-1) * M) + K) + F(still_running)
duke@435 302 // Alternately, instead of counting iterations of the outer loop
duke@435 303 // we could count the # of threads visited in the inner loop, above.
duke@435 304 // 9. On windows consider using the return value from SwitchThreadTo()
duke@435 305 // to drive subsequent spin/SwitchThreadTo()/Sleep(N) decisions.
duke@435 306
duke@435 307 if (UseCompilerSafepoints && int(iterations) == DeferPollingPageLoopCount) {
duke@435 308 guarantee (PageArmed == 0, "invariant") ;
duke@435 309 PageArmed = 1 ;
duke@435 310 os::make_polling_page_unreadable();
duke@435 311 }
duke@435 312
duke@435 313 // Instead of (ncpus > 1) consider either (still_running < (ncpus + EPSILON)) or
duke@435 314 // ((still_running + _waiting_to_block - TryingToBlock)) < ncpus)
duke@435 315 ++steps ;
duke@435 316 if (ncpus > 1 && steps < SafepointSpinBeforeYield) {
duke@435 317 SpinPause() ; // MP-Polite spin
duke@435 318 } else
duke@435 319 if (steps < DeferThrSuspendLoopCount) {
duke@435 320 os::NakedYield() ;
duke@435 321 } else {
duke@435 322 os::yield_all(steps) ;
duke@435 323 // Alternately, the VM thread could transiently depress its scheduling priority or
duke@435 324 // transiently increase the priority of the tardy mutator(s).
duke@435 325 }
duke@435 326
duke@435 327 iterations ++ ;
duke@435 328 }
duke@435 329 assert(iterations < (uint)max_jint, "We have been iterating in the safepoint loop too long");
duke@435 330 }
duke@435 331 assert(still_running == 0, "sanity check");
duke@435 332
duke@435 333 if (PrintSafepointStatistics) {
duke@435 334 update_statistics_on_spin_end();
duke@435 335 }
duke@435 336
duke@435 337 // wait until all threads are stopped
duke@435 338 while (_waiting_to_block > 0) {
duke@435 339 if (TraceSafepoint) tty->print_cr("Waiting for %d thread(s) to block", _waiting_to_block);
duke@435 340 if (!SafepointTimeout || timeout_error_printed) {
duke@435 341 Safepoint_lock->wait(true); // true, means with no safepoint checks
duke@435 342 } else {
duke@435 343 // Compute remaining time
duke@435 344 jlong remaining_time = safepoint_limit_time - os::javaTimeNanos();
duke@435 345
duke@435 346 // If there is no remaining time, then there is an error
duke@435 347 if (remaining_time < 0 || Safepoint_lock->wait(true, remaining_time / MICROUNITS)) {
duke@435 348 print_safepoint_timeout(_blocking_timeout);
duke@435 349 }
duke@435 350 }
duke@435 351 }
duke@435 352 assert(_waiting_to_block == 0, "sanity check");
duke@435 353
duke@435 354 #ifndef PRODUCT
duke@435 355 if (SafepointTimeout) {
duke@435 356 jlong current_time = os::javaTimeNanos();
duke@435 357 if (safepoint_limit_time < current_time) {
duke@435 358 tty->print_cr("# SafepointSynchronize: Finished after "
duke@435 359 INT64_FORMAT_W(6) " ms",
duke@435 360 ((current_time - safepoint_limit_time) / MICROUNITS +
duke@435 361 SafepointTimeoutDelay));
duke@435 362 }
duke@435 363 }
duke@435 364 #endif
duke@435 365
duke@435 366 assert((_safepoint_counter & 0x1) == 0, "must be even");
duke@435 367 assert(Threads_lock->owned_by_self(), "must hold Threads_lock");
duke@435 368 _safepoint_counter ++;
duke@435 369
duke@435 370 // Record state
duke@435 371 _state = _synchronized;
duke@435 372
duke@435 373 OrderAccess::fence();
duke@435 374
duke@435 375 if (TraceSafepoint) {
duke@435 376 VM_Operation *op = VMThread::vm_operation();
duke@435 377 tty->print_cr("Entering safepoint region: %s", (op != NULL) ? op->name() : "no vm operation");
duke@435 378 }
duke@435 379
duke@435 380 RuntimeService::record_safepoint_synchronized();
duke@435 381 if (PrintSafepointStatistics) {
duke@435 382 update_statistics_on_sync_end(os::javaTimeNanos());
duke@435 383 }
duke@435 384
duke@435 385 // Call stuff that needs to be run when a safepoint is just about to be completed
duke@435 386 do_cleanup_tasks();
xlu@1726 387
xlu@1726 388 if (PrintSafepointStatistics) {
xlu@1726 389 // Record how much time spend on the above cleanup tasks
xlu@1726 390 update_statistics_on_cleanup_end(os::javaTimeNanos());
xlu@1726 391 }
duke@435 392 }
duke@435 393 }
duke@435 394
duke@435 395 // Wake up all threads, so they are ready to resume execution after the safepoint
duke@435 396 // operation has been carried out
duke@435 397 void SafepointSynchronize::end() {
duke@435 398
duke@435 399 assert(Threads_lock->owned_by_self(), "must hold Threads_lock");
duke@435 400 assert((_safepoint_counter & 0x1) == 1, "must be odd");
duke@435 401 _safepoint_counter ++;
duke@435 402 // memory fence isn't required here since an odd _safepoint_counter
duke@435 403 // value can do no harm and a fence is issued below anyway.
duke@435 404
duke@435 405 DEBUG_ONLY(Thread* myThread = Thread::current();)
duke@435 406 assert(myThread->is_VM_thread(), "Only VM thread can execute a safepoint");
duke@435 407
duke@435 408 if (PrintSafepointStatistics) {
duke@435 409 end_statistics(os::javaTimeNanos());
duke@435 410 }
duke@435 411
duke@435 412 #ifdef ASSERT
duke@435 413 // A pending_exception cannot be installed during a safepoint. The threads
duke@435 414 // may install an async exception after they come back from a safepoint into
duke@435 415 // pending_exception after they unblock. But that should happen later.
duke@435 416 for(JavaThread *cur = Threads::first(); cur; cur = cur->next()) {
duke@435 417 assert (!(cur->has_pending_exception() &&
duke@435 418 cur->safepoint_state()->is_at_poll_safepoint()),
duke@435 419 "safepoint installed a pending exception");
duke@435 420 }
duke@435 421 #endif // ASSERT
duke@435 422
duke@435 423 if (PageArmed) {
duke@435 424 // Make polling safepoint aware
duke@435 425 os::make_polling_page_readable();
duke@435 426 PageArmed = 0 ;
duke@435 427 }
duke@435 428
duke@435 429 // Remove safepoint check from interpreter
duke@435 430 Interpreter::ignore_safepoints();
duke@435 431
duke@435 432 {
duke@435 433 MutexLocker mu(Safepoint_lock);
duke@435 434
duke@435 435 assert(_state == _synchronized, "must be synchronized before ending safepoint synchronization");
duke@435 436
duke@435 437 // Set to not synchronized, so the threads will not go into the signal_thread_blocked method
duke@435 438 // when they get restarted.
duke@435 439 _state = _not_synchronized;
duke@435 440 OrderAccess::fence();
duke@435 441
duke@435 442 if (TraceSafepoint) {
duke@435 443 tty->print_cr("Leaving safepoint region");
duke@435 444 }
duke@435 445
duke@435 446 // Start suspended threads
duke@435 447 for(JavaThread *current = Threads::first(); current; current = current->next()) {
twisti@1040 448 // A problem occurring on Solaris is when attempting to restart threads
duke@435 449 // the first #cpus - 1 go well, but then the VMThread is preempted when we get
duke@435 450 // to the next one (since it has been running the longest). We then have
duke@435 451 // to wait for a cpu to become available before we can continue restarting
duke@435 452 // threads.
duke@435 453 // FIXME: This causes the performance of the VM to degrade when active and with
duke@435 454 // large numbers of threads. Apparently this is due to the synchronous nature
duke@435 455 // of suspending threads.
duke@435 456 //
duke@435 457 // TODO-FIXME: the comments above are vestigial and no longer apply.
duke@435 458 // Furthermore, using solaris' schedctl in this particular context confers no benefit
duke@435 459 if (VMThreadHintNoPreempt) {
duke@435 460 os::hint_no_preempt();
duke@435 461 }
duke@435 462 ThreadSafepointState* cur_state = current->safepoint_state();
duke@435 463 assert(cur_state->type() != ThreadSafepointState::_running, "Thread not suspended at safepoint");
duke@435 464 cur_state->restart();
duke@435 465 assert(cur_state->is_running(), "safepoint state has not been reset");
duke@435 466 }
duke@435 467
duke@435 468 RuntimeService::record_safepoint_end();
duke@435 469
duke@435 470 // Release threads lock, so threads can be created/destroyed again. It will also starts all threads
duke@435 471 // blocked in signal_thread_blocked
duke@435 472 Threads_lock->unlock();
duke@435 473
duke@435 474 }
duke@435 475 #ifndef SERIALGC
duke@435 476 // If there are any concurrent GC threads resume them.
duke@435 477 if (UseConcMarkSweepGC) {
duke@435 478 ConcurrentMarkSweepThread::desynchronize(false);
ysr@1280 479 } else if (UseG1GC) {
duke@435 480 ConcurrentGCThread::safepoint_desynchronize();
duke@435 481 }
duke@435 482 #endif // SERIALGC
xlu@1726 483 // record this time so VMThread can keep track how much time has elasped
xlu@1726 484 // since last safepoint.
xlu@1726 485 _end_of_last_safepoint = os::javaTimeMillis();
duke@435 486 }
duke@435 487
duke@435 488 bool SafepointSynchronize::is_cleanup_needed() {
duke@435 489 // Need a safepoint if some inline cache buffers is non-empty
duke@435 490 if (!InlineCacheBuffer::is_empty()) return true;
duke@435 491 return false;
duke@435 492 }
duke@435 493
duke@435 494
duke@435 495
duke@435 496 // Various cleaning tasks that should be done periodically at safepoints
duke@435 497 void SafepointSynchronize::do_cleanup_tasks() {
xlu@1726 498 {
xlu@1756 499 TraceTime t1("deflating idle monitors", TraceSafepointCleanupTime);
xlu@1726 500 ObjectSynchronizer::deflate_idle_monitors();
duke@435 501 }
duke@435 502
xlu@1726 503 {
xlu@1756 504 TraceTime t2("updating inline caches", TraceSafepointCleanupTime);
xlu@1726 505 InlineCacheBuffer::update_inline_caches();
xlu@1726 506 }
iveresov@2138 507 {
iveresov@2138 508 TraceTime t3("compilation policy safepoint handler", TraceSafepointCleanupTime);
iveresov@2138 509 CompilationPolicy::policy()->do_safepoint_work();
duke@435 510 }
xlu@1726 511
xlu@1756 512 TraceTime t4("sweeping nmethods", TraceSafepointCleanupTime);
never@1893 513 NMethodSweeper::scan_stacks();
minqi@2964 514
minqi@2964 515 // rotate log files?
minqi@2964 516 if (UseGCLogFileRotation) {
minqi@2964 517 gclog_or_tty->rotate_log();
minqi@2964 518 }
duke@435 519 }
duke@435 520
duke@435 521
duke@435 522 bool SafepointSynchronize::safepoint_safe(JavaThread *thread, JavaThreadState state) {
duke@435 523 switch(state) {
duke@435 524 case _thread_in_native:
duke@435 525 // native threads are safe if they have no java stack or have walkable stack
duke@435 526 return !thread->has_last_Java_frame() || thread->frame_anchor()->walkable();
duke@435 527
duke@435 528 // blocked threads should have already have walkable stack
duke@435 529 case _thread_blocked:
duke@435 530 assert(!thread->has_last_Java_frame() || thread->frame_anchor()->walkable(), "blocked and not walkable");
duke@435 531 return true;
duke@435 532
duke@435 533 default:
duke@435 534 return false;
duke@435 535 }
duke@435 536 }
duke@435 537
duke@435 538
duke@435 539 // -------------------------------------------------------------------------------------------------------
duke@435 540 // Implementation of Safepoint callback point
duke@435 541
duke@435 542 void SafepointSynchronize::block(JavaThread *thread) {
duke@435 543 assert(thread != NULL, "thread must be set");
duke@435 544 assert(thread->is_Java_thread(), "not a Java thread");
duke@435 545
duke@435 546 // Threads shouldn't block if they are in the middle of printing, but...
duke@435 547 ttyLocker::break_tty_lock_for_safepoint(os::current_thread_id());
duke@435 548
duke@435 549 // Only bail from the block() call if the thread is gone from the
duke@435 550 // thread list; starting to exit should still block.
duke@435 551 if (thread->is_terminated()) {
duke@435 552 // block current thread if we come here from native code when VM is gone
duke@435 553 thread->block_if_vm_exited();
duke@435 554
duke@435 555 // otherwise do nothing
duke@435 556 return;
duke@435 557 }
duke@435 558
duke@435 559 JavaThreadState state = thread->thread_state();
duke@435 560 thread->frame_anchor()->make_walkable(thread);
duke@435 561
duke@435 562 // Check that we have a valid thread_state at this point
duke@435 563 switch(state) {
duke@435 564 case _thread_in_vm_trans:
duke@435 565 case _thread_in_Java: // From compiled code
duke@435 566
duke@435 567 // We are highly likely to block on the Safepoint_lock. In order to avoid blocking in this case,
duke@435 568 // we pretend we are still in the VM.
duke@435 569 thread->set_thread_state(_thread_in_vm);
duke@435 570
duke@435 571 if (is_synchronizing()) {
duke@435 572 Atomic::inc (&TryingToBlock) ;
duke@435 573 }
duke@435 574
duke@435 575 // We will always be holding the Safepoint_lock when we are examine the state
duke@435 576 // of a thread. Hence, the instructions between the Safepoint_lock->lock() and
duke@435 577 // Safepoint_lock->unlock() are happening atomic with regards to the safepoint code
duke@435 578 Safepoint_lock->lock_without_safepoint_check();
duke@435 579 if (is_synchronizing()) {
duke@435 580 // Decrement the number of threads to wait for and signal vm thread
duke@435 581 assert(_waiting_to_block > 0, "sanity check");
duke@435 582 _waiting_to_block--;
duke@435 583 thread->safepoint_state()->set_has_called_back(true);
duke@435 584
duke@435 585 // Consider (_waiting_to_block < 2) to pipeline the wakeup of the VM thread
duke@435 586 if (_waiting_to_block == 0) {
duke@435 587 Safepoint_lock->notify_all();
duke@435 588 }
duke@435 589 }
duke@435 590
duke@435 591 // We transition the thread to state _thread_blocked here, but
duke@435 592 // we can't do our usual check for external suspension and then
duke@435 593 // self-suspend after the lock_without_safepoint_check() call
duke@435 594 // below because we are often called during transitions while
duke@435 595 // we hold different locks. That would leave us suspended while
duke@435 596 // holding a resource which results in deadlocks.
duke@435 597 thread->set_thread_state(_thread_blocked);
duke@435 598 Safepoint_lock->unlock();
duke@435 599
duke@435 600 // We now try to acquire the threads lock. Since this lock is hold by the VM thread during
duke@435 601 // the entire safepoint, the threads will all line up here during the safepoint.
duke@435 602 Threads_lock->lock_without_safepoint_check();
duke@435 603 // restore original state. This is important if the thread comes from compiled code, so it
duke@435 604 // will continue to execute with the _thread_in_Java state.
duke@435 605 thread->set_thread_state(state);
duke@435 606 Threads_lock->unlock();
duke@435 607 break;
duke@435 608
duke@435 609 case _thread_in_native_trans:
duke@435 610 case _thread_blocked_trans:
duke@435 611 case _thread_new_trans:
duke@435 612 if (thread->safepoint_state()->type() == ThreadSafepointState::_call_back) {
duke@435 613 thread->print_thread_state();
duke@435 614 fatal("Deadlock in safepoint code. "
duke@435 615 "Should have called back to the VM before blocking.");
duke@435 616 }
duke@435 617
duke@435 618 // We transition the thread to state _thread_blocked here, but
duke@435 619 // we can't do our usual check for external suspension and then
duke@435 620 // self-suspend after the lock_without_safepoint_check() call
duke@435 621 // below because we are often called during transitions while
duke@435 622 // we hold different locks. That would leave us suspended while
duke@435 623 // holding a resource which results in deadlocks.
duke@435 624 thread->set_thread_state(_thread_blocked);
duke@435 625
duke@435 626 // It is not safe to suspend a thread if we discover it is in _thread_in_native_trans. Hence,
duke@435 627 // the safepoint code might still be waiting for it to block. We need to change the state here,
duke@435 628 // so it can see that it is at a safepoint.
duke@435 629
duke@435 630 // Block until the safepoint operation is completed.
duke@435 631 Threads_lock->lock_without_safepoint_check();
duke@435 632
duke@435 633 // Restore state
duke@435 634 thread->set_thread_state(state);
duke@435 635
duke@435 636 Threads_lock->unlock();
duke@435 637 break;
duke@435 638
duke@435 639 default:
jcoomes@1845 640 fatal(err_msg("Illegal threadstate encountered: %d", state));
duke@435 641 }
duke@435 642
duke@435 643 // Check for pending. async. exceptions or suspends - except if the
duke@435 644 // thread was blocked inside the VM. has_special_runtime_exit_condition()
duke@435 645 // is called last since it grabs a lock and we only want to do that when
duke@435 646 // we must.
duke@435 647 //
duke@435 648 // Note: we never deliver an async exception at a polling point as the
duke@435 649 // compiler may not have an exception handler for it. The polling
duke@435 650 // code will notice the async and deoptimize and the exception will
duke@435 651 // be delivered. (Polling at a return point is ok though). Sure is
duke@435 652 // a lot of bother for a deprecated feature...
duke@435 653 //
duke@435 654 // We don't deliver an async exception if the thread state is
duke@435 655 // _thread_in_native_trans so JNI functions won't be called with
duke@435 656 // a surprising pending exception. If the thread state is going back to java,
duke@435 657 // async exception is checked in check_special_condition_for_native_trans().
duke@435 658
duke@435 659 if (state != _thread_blocked_trans &&
duke@435 660 state != _thread_in_vm_trans &&
duke@435 661 thread->has_special_runtime_exit_condition()) {
duke@435 662 thread->handle_special_runtime_exit_condition(
duke@435 663 !thread->is_at_poll_safepoint() && (state != _thread_in_native_trans));
duke@435 664 }
duke@435 665 }
duke@435 666
duke@435 667 // ------------------------------------------------------------------------------------------------------
duke@435 668 // Exception handlers
duke@435 669
duke@435 670 #ifndef PRODUCT
duke@435 671 #ifdef _LP64
duke@435 672 #define PTR_PAD ""
duke@435 673 #else
duke@435 674 #define PTR_PAD " "
duke@435 675 #endif
duke@435 676
duke@435 677 static void print_ptrs(intptr_t oldptr, intptr_t newptr, bool wasoop) {
duke@435 678 bool is_oop = newptr ? ((oop)newptr)->is_oop() : false;
duke@435 679 tty->print_cr(PTR_FORMAT PTR_PAD " %s %c " PTR_FORMAT PTR_PAD " %s %s",
duke@435 680 oldptr, wasoop?"oop":" ", oldptr == newptr ? ' ' : '!',
duke@435 681 newptr, is_oop?"oop":" ", (wasoop && !is_oop) ? "STALE" : ((wasoop==false&&is_oop==false&&oldptr !=newptr)?"STOMP":" "));
duke@435 682 }
duke@435 683
duke@435 684 static void print_longs(jlong oldptr, jlong newptr, bool wasoop) {
duke@435 685 bool is_oop = newptr ? ((oop)(intptr_t)newptr)->is_oop() : false;
duke@435 686 tty->print_cr(PTR64_FORMAT " %s %c " PTR64_FORMAT " %s %s",
duke@435 687 oldptr, wasoop?"oop":" ", oldptr == newptr ? ' ' : '!',
duke@435 688 newptr, is_oop?"oop":" ", (wasoop && !is_oop) ? "STALE" : ((wasoop==false&&is_oop==false&&oldptr !=newptr)?"STOMP":" "));
duke@435 689 }
duke@435 690
duke@435 691 #ifdef SPARC
duke@435 692 static void print_me(intptr_t *new_sp, intptr_t *old_sp, bool *was_oops) {
duke@435 693 #ifdef _LP64
duke@435 694 tty->print_cr("--------+------address-----+------before-----------+-------after----------+");
duke@435 695 const int incr = 1; // Increment to skip a long, in units of intptr_t
duke@435 696 #else
duke@435 697 tty->print_cr("--------+--address-+------before-----------+-------after----------+");
duke@435 698 const int incr = 2; // Increment to skip a long, in units of intptr_t
duke@435 699 #endif
duke@435 700 tty->print_cr("---SP---|");
duke@435 701 for( int i=0; i<16; i++ ) {
duke@435 702 tty->print("blob %c%d |"PTR_FORMAT" ","LO"[i>>3],i&7,new_sp); print_ptrs(*old_sp++,*new_sp++,*was_oops++); }
duke@435 703 tty->print_cr("--------|");
duke@435 704 for( int i1=0; i1<frame::memory_parameter_word_sp_offset-16; i1++ ) {
duke@435 705 tty->print("argv pad|"PTR_FORMAT" ",new_sp); print_ptrs(*old_sp++,*new_sp++,*was_oops++); }
duke@435 706 tty->print(" pad|"PTR_FORMAT" ",new_sp); print_ptrs(*old_sp++,*new_sp++,*was_oops++);
duke@435 707 tty->print_cr("--------|");
duke@435 708 tty->print(" G1 |"PTR_FORMAT" ",new_sp); print_longs(*(jlong*)old_sp,*(jlong*)new_sp,was_oops[incr-1]); old_sp += incr; new_sp += incr; was_oops += incr;
duke@435 709 tty->print(" G3 |"PTR_FORMAT" ",new_sp); print_longs(*(jlong*)old_sp,*(jlong*)new_sp,was_oops[incr-1]); old_sp += incr; new_sp += incr; was_oops += incr;
duke@435 710 tty->print(" G4 |"PTR_FORMAT" ",new_sp); print_longs(*(jlong*)old_sp,*(jlong*)new_sp,was_oops[incr-1]); old_sp += incr; new_sp += incr; was_oops += incr;
duke@435 711 tty->print(" G5 |"PTR_FORMAT" ",new_sp); print_longs(*(jlong*)old_sp,*(jlong*)new_sp,was_oops[incr-1]); old_sp += incr; new_sp += incr; was_oops += incr;
duke@435 712 tty->print_cr(" FSR |"PTR_FORMAT" "PTR64_FORMAT" "PTR64_FORMAT,new_sp,*(jlong*)old_sp,*(jlong*)new_sp);
duke@435 713 old_sp += incr; new_sp += incr; was_oops += incr;
duke@435 714 // Skip the floats
duke@435 715 tty->print_cr("--Float-|"PTR_FORMAT,new_sp);
duke@435 716 tty->print_cr("---FP---|");
duke@435 717 old_sp += incr*32; new_sp += incr*32; was_oops += incr*32;
duke@435 718 for( int i2=0; i2<16; i2++ ) {
duke@435 719 tty->print("call %c%d |"PTR_FORMAT" ","LI"[i2>>3],i2&7,new_sp); print_ptrs(*old_sp++,*new_sp++,*was_oops++); }
duke@435 720 tty->print_cr("");
duke@435 721 }
duke@435 722 #endif // SPARC
duke@435 723 #endif // PRODUCT
duke@435 724
duke@435 725
duke@435 726 void SafepointSynchronize::handle_polling_page_exception(JavaThread *thread) {
duke@435 727 assert(thread->is_Java_thread(), "polling reference encountered by VM thread");
duke@435 728 assert(thread->thread_state() == _thread_in_Java, "should come from Java code");
duke@435 729 assert(SafepointSynchronize::is_synchronizing(), "polling encountered outside safepoint synchronization");
duke@435 730
duke@435 731 // Uncomment this to get some serious before/after printing of the
duke@435 732 // Sparc safepoint-blob frame structure.
duke@435 733 /*
duke@435 734 intptr_t* sp = thread->last_Java_sp();
duke@435 735 intptr_t stack_copy[150];
duke@435 736 for( int i=0; i<150; i++ ) stack_copy[i] = sp[i];
duke@435 737 bool was_oops[150];
duke@435 738 for( int i=0; i<150; i++ )
duke@435 739 was_oops[i] = stack_copy[i] ? ((oop)stack_copy[i])->is_oop() : false;
duke@435 740 */
duke@435 741
duke@435 742 if (ShowSafepointMsgs) {
duke@435 743 tty->print("handle_polling_page_exception: ");
duke@435 744 }
duke@435 745
duke@435 746 if (PrintSafepointStatistics) {
duke@435 747 inc_page_trap_count();
duke@435 748 }
duke@435 749
duke@435 750 ThreadSafepointState* state = thread->safepoint_state();
duke@435 751
duke@435 752 state->handle_polling_page_exception();
duke@435 753 // print_me(sp,stack_copy,was_oops);
duke@435 754 }
duke@435 755
duke@435 756
duke@435 757 void SafepointSynchronize::print_safepoint_timeout(SafepointTimeoutReason reason) {
duke@435 758 if (!timeout_error_printed) {
duke@435 759 timeout_error_printed = true;
duke@435 760 // Print out the thread infor which didn't reach the safepoint for debugging
duke@435 761 // purposes (useful when there are lots of threads in the debugger).
duke@435 762 tty->print_cr("");
duke@435 763 tty->print_cr("# SafepointSynchronize::begin: Timeout detected:");
duke@435 764 if (reason == _spinning_timeout) {
duke@435 765 tty->print_cr("# SafepointSynchronize::begin: Timed out while spinning to reach a safepoint.");
duke@435 766 } else if (reason == _blocking_timeout) {
duke@435 767 tty->print_cr("# SafepointSynchronize::begin: Timed out while waiting for threads to stop.");
duke@435 768 }
duke@435 769
duke@435 770 tty->print_cr("# SafepointSynchronize::begin: Threads which did not reach the safepoint:");
duke@435 771 ThreadSafepointState *cur_state;
duke@435 772 ResourceMark rm;
duke@435 773 for(JavaThread *cur_thread = Threads::first(); cur_thread;
duke@435 774 cur_thread = cur_thread->next()) {
duke@435 775 cur_state = cur_thread->safepoint_state();
duke@435 776
duke@435 777 if (cur_thread->thread_state() != _thread_blocked &&
duke@435 778 ((reason == _spinning_timeout && cur_state->is_running()) ||
duke@435 779 (reason == _blocking_timeout && !cur_state->has_called_back()))) {
duke@435 780 tty->print("# ");
duke@435 781 cur_thread->print();
duke@435 782 tty->print_cr("");
duke@435 783 }
duke@435 784 }
duke@435 785 tty->print_cr("# SafepointSynchronize::begin: (End of list)");
duke@435 786 }
duke@435 787
duke@435 788 // To debug the long safepoint, specify both DieOnSafepointTimeout &
duke@435 789 // ShowMessageBoxOnError.
duke@435 790 if (DieOnSafepointTimeout) {
duke@435 791 char msg[1024];
duke@435 792 VM_Operation *op = VMThread::vm_operation();
xlu@948 793 sprintf(msg, "Safepoint sync time longer than " INTX_FORMAT "ms detected when executing %s.",
duke@435 794 SafepointTimeoutDelay,
duke@435 795 op != NULL ? op->name() : "no vm operation");
duke@435 796 fatal(msg);
duke@435 797 }
duke@435 798 }
duke@435 799
duke@435 800
duke@435 801 // -------------------------------------------------------------------------------------------------------
duke@435 802 // Implementation of ThreadSafepointState
duke@435 803
duke@435 804 ThreadSafepointState::ThreadSafepointState(JavaThread *thread) {
duke@435 805 _thread = thread;
duke@435 806 _type = _running;
duke@435 807 _has_called_back = false;
duke@435 808 _at_poll_safepoint = false;
duke@435 809 }
duke@435 810
duke@435 811 void ThreadSafepointState::create(JavaThread *thread) {
duke@435 812 ThreadSafepointState *state = new ThreadSafepointState(thread);
duke@435 813 thread->set_safepoint_state(state);
duke@435 814 }
duke@435 815
duke@435 816 void ThreadSafepointState::destroy(JavaThread *thread) {
duke@435 817 if (thread->safepoint_state()) {
duke@435 818 delete(thread->safepoint_state());
duke@435 819 thread->set_safepoint_state(NULL);
duke@435 820 }
duke@435 821 }
duke@435 822
duke@435 823 void ThreadSafepointState::examine_state_of_thread() {
duke@435 824 assert(is_running(), "better be running or just have hit safepoint poll");
duke@435 825
duke@435 826 JavaThreadState state = _thread->thread_state();
duke@435 827
never@2082 828 // Save the state at the start of safepoint processing.
never@2082 829 _orig_thread_state = state;
never@2082 830
duke@435 831 // Check for a thread that is suspended. Note that thread resume tries
duke@435 832 // to grab the Threads_lock which we own here, so a thread cannot be
duke@435 833 // resumed during safepoint synchronization.
duke@435 834
dcubed@1414 835 // We check to see if this thread is suspended without locking to
dcubed@1414 836 // avoid deadlocking with a third thread that is waiting for this
dcubed@1414 837 // thread to be suspended. The third thread can notice the safepoint
dcubed@1414 838 // that we're trying to start at the beginning of its SR_lock->wait()
dcubed@1414 839 // call. If that happens, then the third thread will block on the
dcubed@1414 840 // safepoint while still holding the underlying SR_lock. We won't be
dcubed@1414 841 // able to get the SR_lock and we'll deadlock.
dcubed@1414 842 //
dcubed@1414 843 // We don't need to grab the SR_lock here for two reasons:
dcubed@1414 844 // 1) The suspend flags are both volatile and are set with an
dcubed@1414 845 // Atomic::cmpxchg() call so we should see the suspended
dcubed@1414 846 // state right away.
dcubed@1414 847 // 2) We're being called from the safepoint polling loop; if
dcubed@1414 848 // we don't see the suspended state on this iteration, then
dcubed@1414 849 // we'll come around again.
dcubed@1414 850 //
dcubed@1414 851 bool is_suspended = _thread->is_ext_suspended();
duke@435 852 if (is_suspended) {
duke@435 853 roll_forward(_at_safepoint);
duke@435 854 return;
duke@435 855 }
duke@435 856
duke@435 857 // Some JavaThread states have an initial safepoint state of
duke@435 858 // running, but are actually at a safepoint. We will happily
duke@435 859 // agree and update the safepoint state here.
duke@435 860 if (SafepointSynchronize::safepoint_safe(_thread, state)) {
duke@435 861 roll_forward(_at_safepoint);
duke@435 862 return;
duke@435 863 }
duke@435 864
duke@435 865 if (state == _thread_in_vm) {
duke@435 866 roll_forward(_call_back);
duke@435 867 return;
duke@435 868 }
duke@435 869
duke@435 870 // All other thread states will continue to run until they
duke@435 871 // transition and self-block in state _blocked
duke@435 872 // Safepoint polling in compiled code causes the Java threads to do the same.
duke@435 873 // Note: new threads may require a malloc so they must be allowed to finish
duke@435 874
duke@435 875 assert(is_running(), "examine_state_of_thread on non-running thread");
duke@435 876 return;
duke@435 877 }
duke@435 878
duke@435 879 // Returns true is thread could not be rolled forward at present position.
duke@435 880 void ThreadSafepointState::roll_forward(suspend_type type) {
duke@435 881 _type = type;
duke@435 882
duke@435 883 switch(_type) {
duke@435 884 case _at_safepoint:
duke@435 885 SafepointSynchronize::signal_thread_at_safepoint();
duke@435 886 break;
duke@435 887
duke@435 888 case _call_back:
duke@435 889 set_has_called_back(false);
duke@435 890 break;
duke@435 891
duke@435 892 case _running:
duke@435 893 default:
duke@435 894 ShouldNotReachHere();
duke@435 895 }
duke@435 896 }
duke@435 897
duke@435 898 void ThreadSafepointState::restart() {
duke@435 899 switch(type()) {
duke@435 900 case _at_safepoint:
duke@435 901 case _call_back:
duke@435 902 break;
duke@435 903
duke@435 904 case _running:
duke@435 905 default:
duke@435 906 tty->print_cr("restart thread "INTPTR_FORMAT" with state %d",
duke@435 907 _thread, _type);
duke@435 908 _thread->print();
duke@435 909 ShouldNotReachHere();
duke@435 910 }
duke@435 911 _type = _running;
duke@435 912 set_has_called_back(false);
duke@435 913 }
duke@435 914
duke@435 915
duke@435 916 void ThreadSafepointState::print_on(outputStream *st) const {
duke@435 917 const char *s;
duke@435 918
duke@435 919 switch(_type) {
duke@435 920 case _running : s = "_running"; break;
duke@435 921 case _at_safepoint : s = "_at_safepoint"; break;
duke@435 922 case _call_back : s = "_call_back"; break;
duke@435 923 default:
duke@435 924 ShouldNotReachHere();
duke@435 925 }
duke@435 926
duke@435 927 st->print_cr("Thread: " INTPTR_FORMAT
duke@435 928 " [0x%2x] State: %s _has_called_back %d _at_poll_safepoint %d",
duke@435 929 _thread, _thread->osthread()->thread_id(), s, _has_called_back,
duke@435 930 _at_poll_safepoint);
duke@435 931
duke@435 932 _thread->print_thread_state_on(st);
duke@435 933 }
duke@435 934
duke@435 935
duke@435 936 // ---------------------------------------------------------------------------------------------------------------------
duke@435 937
duke@435 938 // Block the thread at the safepoint poll or poll return.
duke@435 939 void ThreadSafepointState::handle_polling_page_exception() {
duke@435 940
duke@435 941 // Check state. block() will set thread state to thread_in_vm which will
duke@435 942 // cause the safepoint state _type to become _call_back.
duke@435 943 assert(type() == ThreadSafepointState::_running,
duke@435 944 "polling page exception on thread not running state");
duke@435 945
duke@435 946 // Step 1: Find the nmethod from the return address
duke@435 947 if (ShowSafepointMsgs && Verbose) {
duke@435 948 tty->print_cr("Polling page exception at " INTPTR_FORMAT, thread()->saved_exception_pc());
duke@435 949 }
duke@435 950 address real_return_addr = thread()->saved_exception_pc();
duke@435 951
duke@435 952 CodeBlob *cb = CodeCache::find_blob(real_return_addr);
duke@435 953 assert(cb != NULL && cb->is_nmethod(), "return address should be in nmethod");
duke@435 954 nmethod* nm = (nmethod*)cb;
duke@435 955
duke@435 956 // Find frame of caller
duke@435 957 frame stub_fr = thread()->last_frame();
duke@435 958 CodeBlob* stub_cb = stub_fr.cb();
duke@435 959 assert(stub_cb->is_safepoint_stub(), "must be a safepoint stub");
duke@435 960 RegisterMap map(thread(), true);
duke@435 961 frame caller_fr = stub_fr.sender(&map);
duke@435 962
duke@435 963 // Should only be poll_return or poll
duke@435 964 assert( nm->is_at_poll_or_poll_return(real_return_addr), "should not be at call" );
duke@435 965
duke@435 966 // This is a poll immediately before a return. The exception handling code
duke@435 967 // has already had the effect of causing the return to occur, so the execution
duke@435 968 // will continue immediately after the call. In addition, the oopmap at the
duke@435 969 // return point does not mark the return value as an oop (if it is), so
duke@435 970 // it needs a handle here to be updated.
duke@435 971 if( nm->is_at_poll_return(real_return_addr) ) {
duke@435 972 // See if return type is an oop.
duke@435 973 bool return_oop = nm->method()->is_returning_oop();
duke@435 974 Handle return_value;
duke@435 975 if (return_oop) {
duke@435 976 // The oop result has been saved on the stack together with all
duke@435 977 // the other registers. In order to preserve it over GCs we need
duke@435 978 // to keep it in a handle.
duke@435 979 oop result = caller_fr.saved_oop_result(&map);
duke@435 980 assert(result == NULL || result->is_oop(), "must be oop");
duke@435 981 return_value = Handle(thread(), result);
duke@435 982 assert(Universe::heap()->is_in_or_null(result), "must be heap pointer");
duke@435 983 }
duke@435 984
duke@435 985 // Block the thread
duke@435 986 SafepointSynchronize::block(thread());
duke@435 987
duke@435 988 // restore oop result, if any
duke@435 989 if (return_oop) {
duke@435 990 caller_fr.set_saved_oop_result(&map, return_value());
duke@435 991 }
duke@435 992 }
duke@435 993
duke@435 994 // This is a safepoint poll. Verify the return address and block.
duke@435 995 else {
duke@435 996 set_at_poll_safepoint(true);
duke@435 997
duke@435 998 // verify the blob built the "return address" correctly
duke@435 999 assert(real_return_addr == caller_fr.pc(), "must match");
duke@435 1000
duke@435 1001 // Block the thread
duke@435 1002 SafepointSynchronize::block(thread());
duke@435 1003 set_at_poll_safepoint(false);
duke@435 1004
duke@435 1005 // If we have a pending async exception deoptimize the frame
duke@435 1006 // as otherwise we may never deliver it.
duke@435 1007 if (thread()->has_async_condition()) {
duke@435 1008 ThreadInVMfromJavaNoAsyncException __tiv(thread());
never@2260 1009 Deoptimization::deoptimize_frame(thread(), caller_fr.id());
duke@435 1010 }
duke@435 1011
duke@435 1012 // If an exception has been installed we must check for a pending deoptimization
duke@435 1013 // Deoptimize frame if exception has been thrown.
duke@435 1014
duke@435 1015 if (thread()->has_pending_exception() ) {
duke@435 1016 RegisterMap map(thread(), true);
duke@435 1017 frame caller_fr = stub_fr.sender(&map);
duke@435 1018 if (caller_fr.is_deoptimized_frame()) {
duke@435 1019 // The exception patch will destroy registers that are still
duke@435 1020 // live and will be needed during deoptimization. Defer the
duke@435 1021 // Async exception should have defered the exception until the
duke@435 1022 // next safepoint which will be detected when we get into
duke@435 1023 // the interpreter so if we have an exception now things
duke@435 1024 // are messed up.
duke@435 1025
duke@435 1026 fatal("Exception installed and deoptimization is pending");
duke@435 1027 }
duke@435 1028 }
duke@435 1029 }
duke@435 1030 }
duke@435 1031
duke@435 1032
duke@435 1033 //
duke@435 1034 // Statistics & Instrumentations
duke@435 1035 //
duke@435 1036 SafepointSynchronize::SafepointStats* SafepointSynchronize::_safepoint_stats = NULL;
xlu@1726 1037 jlong SafepointSynchronize::_safepoint_begin_time = 0;
duke@435 1038 int SafepointSynchronize::_cur_stat_index = 0;
duke@435 1039 julong SafepointSynchronize::_safepoint_reasons[VM_Operation::VMOp_Terminating];
duke@435 1040 julong SafepointSynchronize::_coalesced_vmop_count = 0;
duke@435 1041 jlong SafepointSynchronize::_max_sync_time = 0;
xlu@1726 1042 jlong SafepointSynchronize::_max_vmop_time = 0;
xlu@1726 1043 float SafepointSynchronize::_ts_of_current_safepoint = 0.0f;
duke@435 1044
xlu@1726 1045 static jlong cleanup_end_time = 0;
duke@435 1046 static bool need_to_track_page_armed_status = false;
duke@435 1047 static bool init_done = false;
duke@435 1048
xlu@1726 1049 // Helper method to print the header.
xlu@1726 1050 static void print_header() {
xlu@1726 1051 tty->print(" vmop "
xlu@1726 1052 "[threads: total initially_running wait_to_block] ");
xlu@1726 1053 tty->print("[time: spin block sync cleanup vmop] ");
xlu@1726 1054
xlu@1726 1055 // no page armed status printed out if it is always armed.
xlu@1726 1056 if (need_to_track_page_armed_status) {
xlu@1726 1057 tty->print("page_armed ");
xlu@1726 1058 }
xlu@1726 1059
xlu@1726 1060 tty->print_cr("page_trap_count");
xlu@1726 1061 }
xlu@1726 1062
duke@435 1063 void SafepointSynchronize::deferred_initialize_stat() {
duke@435 1064 if (init_done) return;
duke@435 1065
duke@435 1066 if (PrintSafepointStatisticsCount <= 0) {
duke@435 1067 fatal("Wrong PrintSafepointStatisticsCount");
duke@435 1068 }
duke@435 1069
duke@435 1070 // If PrintSafepointStatisticsTimeout is specified, the statistics data will
duke@435 1071 // be printed right away, in which case, _safepoint_stats will regress to
duke@435 1072 // a single element array. Otherwise, it is a circular ring buffer with default
duke@435 1073 // size of PrintSafepointStatisticsCount.
duke@435 1074 int stats_array_size;
duke@435 1075 if (PrintSafepointStatisticsTimeout > 0) {
duke@435 1076 stats_array_size = 1;
duke@435 1077 PrintSafepointStatistics = true;
duke@435 1078 } else {
duke@435 1079 stats_array_size = PrintSafepointStatisticsCount;
duke@435 1080 }
duke@435 1081 _safepoint_stats = (SafepointStats*)os::malloc(stats_array_size
duke@435 1082 * sizeof(SafepointStats));
duke@435 1083 guarantee(_safepoint_stats != NULL,
duke@435 1084 "not enough memory for safepoint instrumentation data");
duke@435 1085
duke@435 1086 if (UseCompilerSafepoints && DeferPollingPageLoopCount >= 0) {
duke@435 1087 need_to_track_page_armed_status = true;
duke@435 1088 }
duke@435 1089 init_done = true;
duke@435 1090 }
duke@435 1091
duke@435 1092 void SafepointSynchronize::begin_statistics(int nof_threads, int nof_running) {
xlu@1438 1093 assert(init_done, "safepoint statistics array hasn't been initialized");
duke@435 1094 SafepointStats *spstat = &_safepoint_stats[_cur_stat_index];
duke@435 1095
xlu@1726 1096 spstat->_time_stamp = _ts_of_current_safepoint;
xlu@1726 1097
duke@435 1098 VM_Operation *op = VMThread::vm_operation();
duke@435 1099 spstat->_vmop_type = (op != NULL ? op->type() : -1);
duke@435 1100 if (op != NULL) {
duke@435 1101 _safepoint_reasons[spstat->_vmop_type]++;
duke@435 1102 }
duke@435 1103
duke@435 1104 spstat->_nof_total_threads = nof_threads;
duke@435 1105 spstat->_nof_initial_running_threads = nof_running;
duke@435 1106 spstat->_nof_threads_hit_page_trap = 0;
duke@435 1107
duke@435 1108 // Records the start time of spinning. The real time spent on spinning
duke@435 1109 // will be adjusted when spin is done. Same trick is applied for time
duke@435 1110 // spent on waiting for threads to block.
duke@435 1111 if (nof_running != 0) {
duke@435 1112 spstat->_time_to_spin = os::javaTimeNanos();
duke@435 1113 } else {
duke@435 1114 spstat->_time_to_spin = 0;
duke@435 1115 }
duke@435 1116 }
duke@435 1117
duke@435 1118 void SafepointSynchronize::update_statistics_on_spin_end() {
duke@435 1119 SafepointStats *spstat = &_safepoint_stats[_cur_stat_index];
duke@435 1120
duke@435 1121 jlong cur_time = os::javaTimeNanos();
duke@435 1122
duke@435 1123 spstat->_nof_threads_wait_to_block = _waiting_to_block;
duke@435 1124 if (spstat->_nof_initial_running_threads != 0) {
duke@435 1125 spstat->_time_to_spin = cur_time - spstat->_time_to_spin;
duke@435 1126 }
duke@435 1127
duke@435 1128 if (need_to_track_page_armed_status) {
duke@435 1129 spstat->_page_armed = (PageArmed == 1);
duke@435 1130 }
duke@435 1131
duke@435 1132 // Records the start time of waiting for to block. Updated when block is done.
duke@435 1133 if (_waiting_to_block != 0) {
duke@435 1134 spstat->_time_to_wait_to_block = cur_time;
duke@435 1135 } else {
duke@435 1136 spstat->_time_to_wait_to_block = 0;
duke@435 1137 }
duke@435 1138 }
duke@435 1139
duke@435 1140 void SafepointSynchronize::update_statistics_on_sync_end(jlong end_time) {
duke@435 1141 SafepointStats *spstat = &_safepoint_stats[_cur_stat_index];
duke@435 1142
duke@435 1143 if (spstat->_nof_threads_wait_to_block != 0) {
duke@435 1144 spstat->_time_to_wait_to_block = end_time -
duke@435 1145 spstat->_time_to_wait_to_block;
duke@435 1146 }
duke@435 1147
duke@435 1148 // Records the end time of sync which will be used to calculate the total
duke@435 1149 // vm operation time. Again, the real time spending in syncing will be deducted
duke@435 1150 // from the start of the sync time later when end_statistics is called.
xlu@1726 1151 spstat->_time_to_sync = end_time - _safepoint_begin_time;
duke@435 1152 if (spstat->_time_to_sync > _max_sync_time) {
duke@435 1153 _max_sync_time = spstat->_time_to_sync;
duke@435 1154 }
xlu@1726 1155
xlu@1726 1156 spstat->_time_to_do_cleanups = end_time;
xlu@1726 1157 }
xlu@1726 1158
xlu@1726 1159 void SafepointSynchronize::update_statistics_on_cleanup_end(jlong end_time) {
xlu@1726 1160 SafepointStats *spstat = &_safepoint_stats[_cur_stat_index];
xlu@1726 1161
xlu@1726 1162 // Record how long spent in cleanup tasks.
xlu@1726 1163 spstat->_time_to_do_cleanups = end_time - spstat->_time_to_do_cleanups;
xlu@1726 1164
xlu@1726 1165 cleanup_end_time = end_time;
duke@435 1166 }
duke@435 1167
duke@435 1168 void SafepointSynchronize::end_statistics(jlong vmop_end_time) {
duke@435 1169 SafepointStats *spstat = &_safepoint_stats[_cur_stat_index];
duke@435 1170
duke@435 1171 // Update the vm operation time.
xlu@1726 1172 spstat->_time_to_exec_vmop = vmop_end_time - cleanup_end_time;
xlu@1726 1173 if (spstat->_time_to_exec_vmop > _max_vmop_time) {
xlu@1726 1174 _max_vmop_time = spstat->_time_to_exec_vmop;
xlu@1726 1175 }
duke@435 1176 // Only the sync time longer than the specified
duke@435 1177 // PrintSafepointStatisticsTimeout will be printed out right away.
duke@435 1178 // By default, it is -1 meaning all samples will be put into the list.
duke@435 1179 if ( PrintSafepointStatisticsTimeout > 0) {
duke@435 1180 if (spstat->_time_to_sync > PrintSafepointStatisticsTimeout * MICROUNITS) {
duke@435 1181 print_statistics();
duke@435 1182 }
duke@435 1183 } else {
duke@435 1184 // The safepoint statistics will be printed out when the _safepoin_stats
duke@435 1185 // array fills up.
xlu@1726 1186 if (_cur_stat_index == PrintSafepointStatisticsCount - 1) {
duke@435 1187 print_statistics();
duke@435 1188 _cur_stat_index = 0;
xlu@1726 1189 } else {
xlu@1726 1190 _cur_stat_index++;
duke@435 1191 }
duke@435 1192 }
duke@435 1193 }
duke@435 1194
duke@435 1195 void SafepointSynchronize::print_statistics() {
duke@435 1196 SafepointStats* sstats = _safepoint_stats;
duke@435 1197
xlu@1726 1198 for (int index = 0; index <= _cur_stat_index; index++) {
xlu@1726 1199 if (index % 30 == 0) {
xlu@1726 1200 print_header();
xlu@1726 1201 }
duke@435 1202 sstats = &_safepoint_stats[index];
xlu@1726 1203 tty->print("%.3f: ", sstats->_time_stamp);
xlu@1726 1204 tty->print("%-26s ["
duke@435 1205 INT32_FORMAT_W(8)INT32_FORMAT_W(11)INT32_FORMAT_W(15)
xlu@1726 1206 " ] ",
duke@435 1207 sstats->_vmop_type == -1 ? "no vm operation" :
duke@435 1208 VM_Operation::name(sstats->_vmop_type),
duke@435 1209 sstats->_nof_total_threads,
duke@435 1210 sstats->_nof_initial_running_threads,
duke@435 1211 sstats->_nof_threads_wait_to_block);
duke@435 1212 // "/ MICROUNITS " is to convert the unit from nanos to millis.
xlu@1726 1213 tty->print(" ["
xlu@1726 1214 INT64_FORMAT_W(6)INT64_FORMAT_W(6)
xlu@1726 1215 INT64_FORMAT_W(6)INT64_FORMAT_W(6)
xlu@1726 1216 INT64_FORMAT_W(6)" ] ",
duke@435 1217 sstats->_time_to_spin / MICROUNITS,
duke@435 1218 sstats->_time_to_wait_to_block / MICROUNITS,
duke@435 1219 sstats->_time_to_sync / MICROUNITS,
xlu@1726 1220 sstats->_time_to_do_cleanups / MICROUNITS,
xlu@1726 1221 sstats->_time_to_exec_vmop / MICROUNITS);
duke@435 1222
duke@435 1223 if (need_to_track_page_armed_status) {
duke@435 1224 tty->print(INT32_FORMAT" ", sstats->_page_armed);
duke@435 1225 }
duke@435 1226 tty->print_cr(INT32_FORMAT" ", sstats->_nof_threads_hit_page_trap);
duke@435 1227 }
duke@435 1228 }
duke@435 1229
duke@435 1230 // This method will be called when VM exits. It will first call
duke@435 1231 // print_statistics to print out the rest of the sampling. Then
duke@435 1232 // it tries to summarize the sampling.
duke@435 1233 void SafepointSynchronize::print_stat_on_exit() {
duke@435 1234 if (_safepoint_stats == NULL) return;
duke@435 1235
duke@435 1236 SafepointStats *spstat = &_safepoint_stats[_cur_stat_index];
duke@435 1237
duke@435 1238 // During VM exit, end_statistics may not get called and in that
duke@435 1239 // case, if the sync time is less than PrintSafepointStatisticsTimeout,
duke@435 1240 // don't print it out.
duke@435 1241 // Approximate the vm op time.
duke@435 1242 _safepoint_stats[_cur_stat_index]._time_to_exec_vmop =
xlu@1726 1243 os::javaTimeNanos() - cleanup_end_time;
duke@435 1244
duke@435 1245 if ( PrintSafepointStatisticsTimeout < 0 ||
duke@435 1246 spstat->_time_to_sync > PrintSafepointStatisticsTimeout * MICROUNITS) {
duke@435 1247 print_statistics();
duke@435 1248 }
duke@435 1249 tty->print_cr("");
duke@435 1250
duke@435 1251 // Print out polling page sampling status.
duke@435 1252 if (!need_to_track_page_armed_status) {
duke@435 1253 if (UseCompilerSafepoints) {
duke@435 1254 tty->print_cr("Polling page always armed");
duke@435 1255 }
duke@435 1256 } else {
duke@435 1257 tty->print_cr("Defer polling page loop count = %d\n",
duke@435 1258 DeferPollingPageLoopCount);
duke@435 1259 }
duke@435 1260
duke@435 1261 for (int index = 0; index < VM_Operation::VMOp_Terminating; index++) {
duke@435 1262 if (_safepoint_reasons[index] != 0) {
duke@435 1263 tty->print_cr("%-26s"UINT64_FORMAT_W(10), VM_Operation::name(index),
duke@435 1264 _safepoint_reasons[index]);
duke@435 1265 }
duke@435 1266 }
duke@435 1267
duke@435 1268 tty->print_cr(UINT64_FORMAT_W(5)" VM operations coalesced during safepoint",
duke@435 1269 _coalesced_vmop_count);
duke@435 1270 tty->print_cr("Maximum sync time "INT64_FORMAT_W(5)" ms",
duke@435 1271 _max_sync_time / MICROUNITS);
xlu@1726 1272 tty->print_cr("Maximum vm operation time (except for Exit VM operation) "
xlu@1726 1273 INT64_FORMAT_W(5)" ms",
xlu@1726 1274 _max_vmop_time / MICROUNITS);
duke@435 1275 }
duke@435 1276
duke@435 1277 // ------------------------------------------------------------------------------------------------
duke@435 1278 // Non-product code
duke@435 1279
duke@435 1280 #ifndef PRODUCT
duke@435 1281
duke@435 1282 void SafepointSynchronize::print_state() {
duke@435 1283 if (_state == _not_synchronized) {
duke@435 1284 tty->print_cr("not synchronized");
duke@435 1285 } else if (_state == _synchronizing || _state == _synchronized) {
duke@435 1286 tty->print_cr("State: %s", (_state == _synchronizing) ? "synchronizing" :
duke@435 1287 "synchronized");
duke@435 1288
duke@435 1289 for(JavaThread *cur = Threads::first(); cur; cur = cur->next()) {
duke@435 1290 cur->safepoint_state()->print();
duke@435 1291 }
duke@435 1292 }
duke@435 1293 }
duke@435 1294
duke@435 1295 void SafepointSynchronize::safepoint_msg(const char* format, ...) {
duke@435 1296 if (ShowSafepointMsgs) {
duke@435 1297 va_list ap;
duke@435 1298 va_start(ap, format);
duke@435 1299 tty->vprint_cr(format, ap);
duke@435 1300 va_end(ap);
duke@435 1301 }
duke@435 1302 }
duke@435 1303
duke@435 1304 #endif // !PRODUCT

mercurial