1 /* 2 * Copyright (c) 2001, 2017, 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/systemDictionary.hpp" 27 #include "gc/shared/allocTracer.hpp" 28 #include "gc/shared/barrierSet.inline.hpp" 29 #include "gc/shared/collectedHeap.hpp" 30 #include "gc/shared/collectedHeap.inline.hpp" 31 #include "gc/shared/gcHeapSummary.hpp" 32 #include "gc/shared/gcTrace.hpp" 33 #include "gc/shared/gcTraceTime.inline.hpp" 34 #include "gc/shared/gcWhen.hpp" 35 #include "gc/shared/vmGCOperations.hpp" 36 #include "logging/log.hpp" 37 #include "memory/metaspace.hpp" 38 #include "memory/resourceArea.hpp" 39 #include "oops/instanceMirrorKlass.hpp" 40 #include "oops/oop.inline.hpp" 41 #include "runtime/init.hpp" 42 #include "runtime/thread.inline.hpp" 43 #include "services/heapDumper.hpp" 44 45 46 #ifdef ASSERT 47 int CollectedHeap::_fire_out_of_memory_count = 0; 48 #endif 49 50 size_t CollectedHeap::_filler_array_max_size = 0; 51 52 template <> 53 void EventLogBase<GCMessage>::print(outputStream* st, GCMessage& m) { 54 st->print_cr("GC heap %s", m.is_before ? "before" : "after"); 55 st->print_raw(m); 56 } 57 58 void GCHeapLog::log_heap(CollectedHeap* heap, bool before) { 59 if (!should_log()) { 60 return; 61 } 62 63 double timestamp = fetch_timestamp(); 64 MutexLockerEx ml(&_mutex, Mutex::_no_safepoint_check_flag); 65 int index = compute_log_index(); 66 _records[index].thread = NULL; // Its the GC thread so it's not that interesting. 67 _records[index].timestamp = timestamp; 68 _records[index].data.is_before = before; 69 stringStream st(_records[index].data.buffer(), _records[index].data.size()); 70 71 st.print_cr("{Heap %s GC invocations=%u (full %u):", 72 before ? "before" : "after", 73 heap->total_collections(), 74 heap->total_full_collections()); 75 76 heap->print_on(&st); 77 st.print_cr("}"); 78 } 79 80 VirtualSpaceSummary CollectedHeap::create_heap_space_summary() { 81 size_t capacity_in_words = capacity() / HeapWordSize; 82 83 return VirtualSpaceSummary( 84 reserved_region().start(), reserved_region().start() + capacity_in_words, reserved_region().end()); 85 } 86 87 GCHeapSummary CollectedHeap::create_heap_summary() { 88 VirtualSpaceSummary heap_space = create_heap_space_summary(); 89 return GCHeapSummary(heap_space, used()); 90 } 91 92 MetaspaceSummary CollectedHeap::create_metaspace_summary() { 93 const MetaspaceSizes meta_space( 94 MetaspaceAux::committed_bytes(), 95 MetaspaceAux::used_bytes(), 96 MetaspaceAux::reserved_bytes()); 97 const MetaspaceSizes data_space( 98 MetaspaceAux::committed_bytes(Metaspace::NonClassType), 99 MetaspaceAux::used_bytes(Metaspace::NonClassType), 100 MetaspaceAux::reserved_bytes(Metaspace::NonClassType)); 101 const MetaspaceSizes class_space( 102 MetaspaceAux::committed_bytes(Metaspace::ClassType), 103 MetaspaceAux::used_bytes(Metaspace::ClassType), 104 MetaspaceAux::reserved_bytes(Metaspace::ClassType)); 105 106 const MetaspaceChunkFreeListSummary& ms_chunk_free_list_summary = 107 MetaspaceAux::chunk_free_list_summary(Metaspace::NonClassType); 108 const MetaspaceChunkFreeListSummary& class_chunk_free_list_summary = 109 MetaspaceAux::chunk_free_list_summary(Metaspace::ClassType); 110 111 return MetaspaceSummary(MetaspaceGC::capacity_until_GC(), meta_space, data_space, class_space, 112 ms_chunk_free_list_summary, class_chunk_free_list_summary); 113 } 114 115 void CollectedHeap::print_heap_before_gc() { 116 Universe::print_heap_before_gc(); 117 if (_gc_heap_log != NULL) { 118 _gc_heap_log->log_heap_before(this); 119 } 120 } 121 122 void CollectedHeap::print_heap_after_gc() { 123 Universe::print_heap_after_gc(); 124 if (_gc_heap_log != NULL) { 125 _gc_heap_log->log_heap_after(this); 126 } 127 } 128 129 void CollectedHeap::print_on_error(outputStream* st) const { 130 st->print_cr("Heap:"); 131 print_extended_on(st); 132 st->cr(); 133 134 _barrier_set->print_on(st); 135 } 136 137 void CollectedHeap::register_nmethod(nmethod* nm) { 138 assert_locked_or_safepoint(CodeCache_lock); 139 } 140 141 void CollectedHeap::unregister_nmethod(nmethod* nm) { 142 assert_locked_or_safepoint(CodeCache_lock); 143 } 144 145 void CollectedHeap::trace_heap(GCWhen::Type when, const GCTracer* gc_tracer) { 146 const GCHeapSummary& heap_summary = create_heap_summary(); 147 gc_tracer->report_gc_heap_summary(when, heap_summary); 148 149 const MetaspaceSummary& metaspace_summary = create_metaspace_summary(); 150 gc_tracer->report_metaspace_summary(when, metaspace_summary); 151 } 152 153 void CollectedHeap::trace_heap_before_gc(const GCTracer* gc_tracer) { 154 trace_heap(GCWhen::BeforeGC, gc_tracer); 155 } 156 157 void CollectedHeap::trace_heap_after_gc(const GCTracer* gc_tracer) { 158 trace_heap(GCWhen::AfterGC, gc_tracer); 159 } 160 161 // WhiteBox API support for concurrent collectors. These are the 162 // default implementations, for collectors which don't support this 163 // feature. 164 bool CollectedHeap::supports_concurrent_phase_control() const { 165 return false; 166 } 167 168 const char* const* CollectedHeap::concurrent_phases() const { 169 static const char* const result[] = { NULL }; 170 return result; 171 } 172 173 bool CollectedHeap::request_concurrent_phase(const char* phase) { 174 return false; 175 } 176 177 // Memory state functions. 178 179 180 CollectedHeap::CollectedHeap() : 181 _barrier_set(NULL), 182 _is_gc_active(false), 183 _total_collections(0), 184 _total_full_collections(0), 185 _gc_cause(GCCause::_no_gc), 186 _gc_lastcause(GCCause::_no_gc), 187 _defer_initial_card_mark(false) // strengthened by subclass in pre_initialize() below. 188 { 189 const size_t max_len = size_t(arrayOopDesc::max_array_length(T_INT)); 190 const size_t elements_per_word = HeapWordSize / sizeof(jint); 191 _filler_array_max_size = align_object_size(filler_array_hdr_size() + 192 max_len / elements_per_word); 193 194 NOT_PRODUCT(_promotion_failure_alot_count = 0;) 195 NOT_PRODUCT(_promotion_failure_alot_gc_number = 0;) 196 197 if (UsePerfData) { 198 EXCEPTION_MARK; 199 200 // create the gc cause jvmstat counters 201 _perf_gc_cause = PerfDataManager::create_string_variable(SUN_GC, "cause", 202 80, GCCause::to_string(_gc_cause), CHECK); 203 204 _perf_gc_lastcause = 205 PerfDataManager::create_string_variable(SUN_GC, "lastCause", 206 80, GCCause::to_string(_gc_lastcause), CHECK); 207 } 208 209 // Create the ring log 210 if (LogEvents) { 211 _gc_heap_log = new GCHeapLog(); 212 } else { 213 _gc_heap_log = NULL; 214 } 215 } 216 217 // This interface assumes that it's being called by the 218 // vm thread. It collects the heap assuming that the 219 // heap lock is already held and that we are executing in 220 // the context of the vm thread. 221 void CollectedHeap::collect_as_vm_thread(GCCause::Cause cause) { 222 assert(Thread::current()->is_VM_thread(), "Precondition#1"); 223 assert(Heap_lock->is_locked(), "Precondition#2"); 224 GCCauseSetter gcs(this, cause); 225 switch (cause) { 226 case GCCause::_heap_inspection: 227 case GCCause::_heap_dump: 228 case GCCause::_metadata_GC_threshold : { 229 HandleMark hm; 230 do_full_collection(false); // don't clear all soft refs 231 break; 232 } 233 case GCCause::_metadata_GC_clear_soft_refs: { 234 HandleMark hm; 235 do_full_collection(true); // do clear all soft refs 236 break; 237 } 238 default: 239 ShouldNotReachHere(); // Unexpected use of this function 240 } 241 } 242 243 void CollectedHeap::set_barrier_set(BarrierSet* barrier_set) { 244 _barrier_set = barrier_set; 245 oopDesc::set_bs(_barrier_set); 246 } 247 248 void CollectedHeap::pre_initialize() { 249 // Used for ReduceInitialCardMarks (when COMPILER2 is used); 250 // otherwise remains unused. 251 #if defined(COMPILER2) || INCLUDE_JVMCI 252 _defer_initial_card_mark = is_server_compilation_mode_vm() && ReduceInitialCardMarks && can_elide_tlab_store_barriers() 253 && (DeferInitialCardMark || card_mark_must_follow_store()); 254 #else 255 assert(_defer_initial_card_mark == false, "Who would set it?"); 256 #endif 257 } 258 259 #ifndef PRODUCT 260 void CollectedHeap::check_for_bad_heap_word_value(HeapWord* addr, size_t size) { 261 if (CheckMemoryInitialization && ZapUnusedHeapArea) { 262 for (size_t slot = 0; slot < size; slot += 1) { 263 assert((*(intptr_t*) (addr + slot)) != ((intptr_t) badHeapWordVal), 264 "Found badHeapWordValue in post-allocation check"); 265 } 266 } 267 } 268 269 void CollectedHeap::check_for_non_bad_heap_word_value(HeapWord* addr, size_t size) { 270 if (CheckMemoryInitialization && ZapUnusedHeapArea) { 271 for (size_t slot = 0; slot < size; slot += 1) { 272 assert((*(intptr_t*) (addr + slot)) == ((intptr_t) badHeapWordVal), 273 "Found non badHeapWordValue in pre-allocation check"); 274 } 275 } 276 } 277 #endif // PRODUCT 278 279 #ifdef ASSERT 280 void CollectedHeap::check_for_valid_allocation_state() { 281 Thread *thread = Thread::current(); 282 // How to choose between a pending exception and a potential 283 // OutOfMemoryError? Don't allow pending exceptions. 284 // This is a VM policy failure, so how do we exhaustively test it? 285 assert(!thread->has_pending_exception(), 286 "shouldn't be allocating with pending exception"); 287 if (StrictSafepointChecks) { 288 assert(thread->allow_allocation(), 289 "Allocation done by thread for which allocation is blocked " 290 "by No_Allocation_Verifier!"); 291 // Allocation of an oop can always invoke a safepoint, 292 // hence, the true argument 293 thread->check_for_valid_safepoint_state(true); 294 } 295 } 296 #endif 297 298 HeapWord* CollectedHeap::allocate_from_tlab_slow(Klass* klass, Thread* thread, size_t size) { 299 300 // Retain tlab and allocate object in shared space if 301 // the amount free in the tlab is too large to discard. 302 if (thread->tlab().free() > thread->tlab().refill_waste_limit()) { 303 thread->tlab().record_slow_allocation(size); 304 return NULL; 305 } 306 307 // Discard tlab and allocate a new one. 308 // To minimize fragmentation, the last TLAB may be smaller than the rest. 309 size_t new_tlab_size = thread->tlab().compute_size(size); 310 311 thread->tlab().clear_before_allocation(); 312 313 if (new_tlab_size == 0) { 314 return NULL; 315 } 316 317 // Allocate a new TLAB... 318 HeapWord* obj = Universe::heap()->allocate_new_tlab(new_tlab_size); 319 if (obj == NULL) { 320 return NULL; 321 } 322 323 AllocTracer::send_allocation_in_new_tlab_event(klass, new_tlab_size * HeapWordSize, size * HeapWordSize); 324 325 if (ZeroTLAB) { 326 // ..and clear it. 327 Copy::zero_to_words(obj, new_tlab_size); 328 } else { 329 // ...and zap just allocated object. 330 #ifdef ASSERT 331 // Skip mangling the space corresponding to the object header to 332 // ensure that the returned space is not considered parsable by 333 // any concurrent GC thread. 334 size_t hdr_size = oopDesc::header_size(); 335 Copy::fill_to_words(obj + hdr_size, new_tlab_size - hdr_size, badHeapWordVal); 336 #endif // ASSERT 337 } 338 thread->tlab().fill(obj, obj + size, new_tlab_size); 339 return obj; 340 } 341 342 void CollectedHeap::flush_deferred_store_barrier(JavaThread* thread) { 343 MemRegion deferred = thread->deferred_card_mark(); 344 if (!deferred.is_empty()) { 345 assert(_defer_initial_card_mark, "Otherwise should be empty"); 346 { 347 // Verify that the storage points to a parsable object in heap 348 DEBUG_ONLY(oop old_obj = oop(deferred.start());) 349 assert(is_in(old_obj), "Not in allocated heap"); 350 assert(!can_elide_initializing_store_barrier(old_obj), 351 "Else should have been filtered in new_store_pre_barrier()"); 352 assert(old_obj->is_oop(true), "Not an oop"); 353 assert(deferred.word_size() == (size_t)(old_obj->size()), 354 "Mismatch: multiple objects?"); 355 } 356 BarrierSet* bs = barrier_set(); 357 assert(bs->has_write_region_opt(), "No write_region() on BarrierSet"); 358 bs->write_region(deferred); 359 // "Clear" the deferred_card_mark field 360 thread->set_deferred_card_mark(MemRegion()); 361 } 362 assert(thread->deferred_card_mark().is_empty(), "invariant"); 363 } 364 365 size_t CollectedHeap::max_tlab_size() const { 366 // TLABs can't be bigger than we can fill with a int[Integer.MAX_VALUE]. 367 // This restriction could be removed by enabling filling with multiple arrays. 368 // If we compute that the reasonable way as 369 // header_size + ((sizeof(jint) * max_jint) / HeapWordSize) 370 // we'll overflow on the multiply, so we do the divide first. 371 // We actually lose a little by dividing first, 372 // but that just makes the TLAB somewhat smaller than the biggest array, 373 // which is fine, since we'll be able to fill that. 374 size_t max_int_size = typeArrayOopDesc::header_size(T_INT) + 375 sizeof(jint) * 376 ((juint) max_jint / (size_t) HeapWordSize); 377 return align_size_down(max_int_size, MinObjAlignment); 378 } 379 380 // Helper for ReduceInitialCardMarks. For performance, 381 // compiled code may elide card-marks for initializing stores 382 // to a newly allocated object along the fast-path. We 383 // compensate for such elided card-marks as follows: 384 // (a) Generational, non-concurrent collectors, such as 385 // GenCollectedHeap(ParNew,DefNew,Tenured) and 386 // ParallelScavengeHeap(ParallelGC, ParallelOldGC) 387 // need the card-mark if and only if the region is 388 // in the old gen, and do not care if the card-mark 389 // succeeds or precedes the initializing stores themselves, 390 // so long as the card-mark is completed before the next 391 // scavenge. For all these cases, we can do a card mark 392 // at the point at which we do a slow path allocation 393 // in the old gen, i.e. in this call. 394 // (b) GenCollectedHeap(ConcurrentMarkSweepGeneration) requires 395 // in addition that the card-mark for an old gen allocated 396 // object strictly follow any associated initializing stores. 397 // In these cases, the memRegion remembered below is 398 // used to card-mark the entire region either just before the next 399 // slow-path allocation by this thread or just before the next scavenge or 400 // CMS-associated safepoint, whichever of these events happens first. 401 // (The implicit assumption is that the object has been fully 402 // initialized by this point, a fact that we assert when doing the 403 // card-mark.) 404 // (c) G1CollectedHeap(G1) uses two kinds of write barriers. When a 405 // G1 concurrent marking is in progress an SATB (pre-write-)barrier 406 // is used to remember the pre-value of any store. Initializing 407 // stores will not need this barrier, so we need not worry about 408 // compensating for the missing pre-barrier here. Turning now 409 // to the post-barrier, we note that G1 needs a RS update barrier 410 // which simply enqueues a (sequence of) dirty cards which may 411 // optionally be refined by the concurrent update threads. Note 412 // that this barrier need only be applied to a non-young write, 413 // but, like in CMS, because of the presence of concurrent refinement 414 // (much like CMS' precleaning), must strictly follow the oop-store. 415 // Thus, using the same protocol for maintaining the intended 416 // invariants turns out, serendepitously, to be the same for both 417 // G1 and CMS. 418 // 419 // For any future collector, this code should be reexamined with 420 // that specific collector in mind, and the documentation above suitably 421 // extended and updated. 422 oop CollectedHeap::new_store_pre_barrier(JavaThread* thread, oop new_obj) { 423 // If a previous card-mark was deferred, flush it now. 424 flush_deferred_store_barrier(thread); 425 if (can_elide_initializing_store_barrier(new_obj) || 426 new_obj->is_typeArray()) { 427 // Arrays of non-references don't need a pre-barrier. 428 // The deferred_card_mark region should be empty 429 // following the flush above. 430 assert(thread->deferred_card_mark().is_empty(), "Error"); 431 } else { 432 MemRegion mr((HeapWord*)new_obj, new_obj->size()); 433 assert(!mr.is_empty(), "Error"); 434 if (_defer_initial_card_mark) { 435 // Defer the card mark 436 thread->set_deferred_card_mark(mr); 437 } else { 438 // Do the card mark 439 BarrierSet* bs = barrier_set(); 440 assert(bs->has_write_region_opt(), "No write_region() on BarrierSet"); 441 bs->write_region(mr); 442 } 443 } 444 return new_obj; 445 } 446 447 size_t CollectedHeap::filler_array_hdr_size() { 448 return size_t(align_object_offset(arrayOopDesc::header_size(T_INT))); // align to Long 449 } 450 451 size_t CollectedHeap::filler_array_min_size() { 452 return align_object_size(filler_array_hdr_size()); // align to MinObjAlignment 453 } 454 455 #ifdef ASSERT 456 void CollectedHeap::fill_args_check(HeapWord* start, size_t words) 457 { 458 assert(words >= min_fill_size(), "too small to fill"); 459 assert(words % MinObjAlignment == 0, "unaligned size"); 460 assert(Universe::heap()->is_in_reserved(start), "not in heap"); 461 assert(Universe::heap()->is_in_reserved(start + words - 1), "not in heap"); 462 } 463 464 void CollectedHeap::zap_filler_array(HeapWord* start, size_t words, bool zap) 465 { 466 if (ZapFillerObjects && zap) { 467 Copy::fill_to_words(start + filler_array_hdr_size(), 468 words - filler_array_hdr_size(), 0XDEAFBABE); 469 } 470 } 471 #endif // ASSERT 472 473 void 474 CollectedHeap::fill_with_array(HeapWord* start, size_t words, bool zap) 475 { 476 assert(words >= filler_array_min_size(), "too small for an array"); 477 assert(words <= filler_array_max_size(), "too big for a single object"); 478 479 const size_t payload_size = words - filler_array_hdr_size(); 480 const size_t len = payload_size * HeapWordSize / sizeof(jint); 481 assert((int)len >= 0, "size too large " SIZE_FORMAT " becomes %d", words, (int)len); 482 483 // Set the length first for concurrent GC. 484 ((arrayOop)start)->set_length((int)len); 485 post_allocation_setup_common(Universe::intArrayKlassObj(), start); 486 DEBUG_ONLY(zap_filler_array(start, words, zap);) 487 } 488 489 void 490 CollectedHeap::fill_with_object_impl(HeapWord* start, size_t words, bool zap) 491 { 492 assert(words <= filler_array_max_size(), "too big for a single object"); 493 494 if (words >= filler_array_min_size()) { 495 fill_with_array(start, words, zap); 496 } else if (words > 0) { 497 assert(words == min_fill_size(), "unaligned size"); 498 post_allocation_setup_common(SystemDictionary::Object_klass(), start); 499 } 500 } 501 502 void CollectedHeap::fill_with_object(HeapWord* start, size_t words, bool zap) 503 { 504 DEBUG_ONLY(fill_args_check(start, words);) 505 HandleMark hm; // Free handles before leaving. 506 fill_with_object_impl(start, words, zap); 507 } 508 509 void CollectedHeap::fill_with_objects(HeapWord* start, size_t words, bool zap) 510 { 511 DEBUG_ONLY(fill_args_check(start, words);) 512 HandleMark hm; // Free handles before leaving. 513 514 // Multiple objects may be required depending on the filler array maximum size. Fill 515 // the range up to that with objects that are filler_array_max_size sized. The 516 // remainder is filled with a single object. 517 const size_t min = min_fill_size(); 518 const size_t max = filler_array_max_size(); 519 while (words > max) { 520 const size_t cur = (words - max) >= min ? max : max - min; 521 fill_with_array(start, cur, zap); 522 start += cur; 523 words -= cur; 524 } 525 526 fill_with_object_impl(start, words, zap); 527 } 528 529 HeapWord* CollectedHeap::allocate_new_tlab(size_t size) { 530 guarantee(false, "thread-local allocation buffers not supported"); 531 return NULL; 532 } 533 534 void CollectedHeap::ensure_parsability(bool retire_tlabs) { 535 // The second disjunct in the assertion below makes a concession 536 // for the start-up verification done while the VM is being 537 // created. Callers be careful that you know that mutators 538 // aren't going to interfere -- for instance, this is permissible 539 // if we are still single-threaded and have either not yet 540 // started allocating (nothing much to verify) or we have 541 // started allocating but are now a full-fledged JavaThread 542 // (and have thus made our TLAB's) available for filling. 543 assert(SafepointSynchronize::is_at_safepoint() || 544 !is_init_completed(), 545 "Should only be called at a safepoint or at start-up" 546 " otherwise concurrent mutator activity may make heap " 547 " unparsable again"); 548 const bool use_tlab = UseTLAB; 549 const bool deferred = _defer_initial_card_mark; 550 // The main thread starts allocating via a TLAB even before it 551 // has added itself to the threads list at vm boot-up. 552 assert(!use_tlab || Threads::first() != NULL, 553 "Attempt to fill tlabs before main thread has been added" 554 " to threads list is doomed to failure!"); 555 for (JavaThread *thread = Threads::first(); thread; thread = thread->next()) { 556 if (use_tlab) thread->tlab().make_parsable(retire_tlabs); 557 #if defined(COMPILER2) || INCLUDE_JVMCI 558 // The deferred store barriers must all have been flushed to the 559 // card-table (or other remembered set structure) before GC starts 560 // processing the card-table (or other remembered set). 561 if (deferred) flush_deferred_store_barrier(thread); 562 #else 563 assert(!deferred, "Should be false"); 564 assert(thread->deferred_card_mark().is_empty(), "Should be empty"); 565 #endif 566 } 567 } 568 569 void CollectedHeap::accumulate_statistics_all_tlabs() { 570 if (UseTLAB) { 571 assert(SafepointSynchronize::is_at_safepoint() || 572 !is_init_completed(), 573 "should only accumulate statistics on tlabs at safepoint"); 574 575 ThreadLocalAllocBuffer::accumulate_statistics_before_gc(); 576 } 577 } 578 579 void CollectedHeap::resize_all_tlabs() { 580 if (UseTLAB) { 581 assert(SafepointSynchronize::is_at_safepoint() || 582 !is_init_completed(), 583 "should only resize tlabs at safepoint"); 584 585 ThreadLocalAllocBuffer::resize_all_tlabs(); 586 } 587 } 588 589 void CollectedHeap::full_gc_dump(GCTimer* timer, bool before) { 590 assert(timer != NULL, "timer is null"); 591 if ((HeapDumpBeforeFullGC && before) || (HeapDumpAfterFullGC && !before)) { 592 GCTraceTime(Info, gc) tm(before ? "Heap Dump (before full gc)" : "Heap Dump (after full gc)", timer); 593 HeapDumper::dump_heap(); 594 } 595 596 Log(gc, classhisto) log; 597 if (log.is_trace()) { 598 GCTraceTime(Trace, gc, classhisto) tm(before ? "Class Histogram (before full gc)" : "Class Histogram (after full gc)", timer); 599 ResourceMark rm; 600 VM_GC_HeapInspection inspector(log.trace_stream(), false /* ! full gc */); 601 inspector.doit(); 602 } 603 } 604 605 void CollectedHeap::pre_full_gc_dump(GCTimer* timer) { 606 full_gc_dump(timer, true); 607 } 608 609 void CollectedHeap::post_full_gc_dump(GCTimer* timer) { 610 full_gc_dump(timer, false); 611 } 612 613 void CollectedHeap::initialize_reserved_region(HeapWord *start, HeapWord *end) { 614 // It is important to do this in a way such that concurrent readers can't 615 // temporarily think something is in the heap. (Seen this happen in asserts.) 616 _reserved.set_word_size(0); 617 _reserved.set_start(start); 618 _reserved.set_end(end); 619 }