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