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