1 /* 2 * Copyright (c) 2000, 2012, 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 "classfile/vmSymbols.hpp" 29 #include "code/icBuffer.hpp" 30 #include "gc_implementation/shared/collectorCounters.hpp" 31 #include "gc_implementation/shared/vmGCOperations.hpp" 32 #include "gc_interface/collectedHeap.inline.hpp" 33 #include "memory/filemap.hpp" 34 #include "memory/gcLocker.inline.hpp" 35 #include "memory/genCollectedHeap.hpp" 36 #include "memory/genOopClosures.inline.hpp" 37 #include "memory/generation.inline.hpp" 38 #include "memory/generationSpec.hpp" 39 #include "memory/resourceArea.hpp" 40 #include "memory/sharedHeap.hpp" 41 #include "memory/space.hpp" 42 #include "oops/oop.inline.hpp" 43 #include "oops/oop.inline2.hpp" 44 #include "runtime/aprofiler.hpp" 45 #include "runtime/biasedLocking.hpp" 46 #include "runtime/fprofiler.hpp" 47 #include "runtime/handles.hpp" 48 #include "runtime/handles.inline.hpp" 49 #include "runtime/java.hpp" 50 #include "runtime/vmThread.hpp" 51 #include "services/memoryService.hpp" 52 #include "utilities/vmError.hpp" 53 #include "utilities/workgroup.hpp" 54 #include "utilities/macros.hpp" 55 #if INCLUDE_ALL_GCS 56 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepThread.hpp" 57 #include "gc_implementation/concurrentMarkSweep/vmCMSOperations.hpp" 58 #endif // INCLUDE_ALL_GCS 59 60 GenCollectedHeap* GenCollectedHeap::_gch; 61 NOT_PRODUCT(size_t GenCollectedHeap::_skip_header_HeapWords = 0;) 62 63 // The set of potentially parallel tasks in strong root scanning. 64 enum GCH_process_strong_roots_tasks { 65 // We probably want to parallelize both of these internally, but for now... 66 GCH_PS_younger_gens, 67 // Leave this one last. 68 GCH_PS_NumElements 69 }; 70 71 GenCollectedHeap::GenCollectedHeap(GenCollectorPolicy *policy) : 72 SharedHeap(policy), 73 _gen_policy(policy), 74 _gen_process_strong_tasks(new SubTasksDone(GCH_PS_NumElements)), 75 _full_collections_completed(0) 76 { 77 if (_gen_process_strong_tasks == NULL || 78 !_gen_process_strong_tasks->valid()) { 79 vm_exit_during_initialization("Failed necessary allocation."); 80 } 81 assert(policy != NULL, "Sanity check"); 82 } 83 84 jint GenCollectedHeap::initialize() { 85 CollectedHeap::pre_initialize(); 86 87 int i; 88 _n_gens = gen_policy()->number_of_generations(); 89 90 // While there are no constraints in the GC code that HeapWordSize 91 // be any particular value, there are multiple other areas in the 92 // system which believe this to be true (e.g. oop->object_size in some 93 // cases incorrectly returns the size in wordSize units rather than 94 // HeapWordSize). 95 guarantee(HeapWordSize == wordSize, "HeapWordSize must equal wordSize"); 96 97 // The heap must be at least as aligned as generations. 98 size_t alignment = Generation::GenGrain; 99 100 _gen_specs = gen_policy()->generations(); 101 102 // Make sure the sizes are all aligned. 103 for (i = 0; i < _n_gens; i++) { 104 _gen_specs[i]->align(alignment); 105 } 106 107 // Allocate space for the heap. 108 109 char* heap_address; 110 size_t total_reserved = 0; 111 int n_covered_regions = 0; 112 ReservedSpace heap_rs(0); 113 114 heap_address = allocate(alignment, &total_reserved, 115 &n_covered_regions, &heap_rs); 116 117 if (!heap_rs.is_reserved()) { 118 vm_shutdown_during_initialization( 119 "Could not reserve enough space for object heap"); 120 return JNI_ENOMEM; 121 } 122 123 _reserved = MemRegion((HeapWord*)heap_rs.base(), 124 (HeapWord*)(heap_rs.base() + heap_rs.size())); 125 126 // It is important to do this in a way such that concurrent readers can't 127 // temporarily think somethings in the heap. (Seen this happen in asserts.) 128 _reserved.set_word_size(0); 129 _reserved.set_start((HeapWord*)heap_rs.base()); 130 size_t actual_heap_size = heap_rs.size(); 131 _reserved.set_end((HeapWord*)(heap_rs.base() + actual_heap_size)); 132 133 _rem_set = collector_policy()->create_rem_set(_reserved, n_covered_regions); 134 set_barrier_set(rem_set()->bs()); 135 136 _gch = this; 137 138 for (i = 0; i < _n_gens; i++) { 139 ReservedSpace this_rs = heap_rs.first_part(_gen_specs[i]->max_size(), false, false); 140 _gens[i] = _gen_specs[i]->init(this_rs, i, rem_set()); 141 heap_rs = heap_rs.last_part(_gen_specs[i]->max_size()); 142 } 143 clear_incremental_collection_failed(); 144 145 #if INCLUDE_ALL_GCS 146 // If we are running CMS, create the collector responsible 147 // for collecting the CMS generations. 148 if (collector_policy()->is_concurrent_mark_sweep_policy()) { 149 bool success = create_cms_collector(); 150 if (!success) return JNI_ENOMEM; 151 } 152 #endif // INCLUDE_ALL_GCS 153 154 return JNI_OK; 155 } 156 157 158 char* GenCollectedHeap::allocate(size_t alignment, 159 size_t* _total_reserved, 160 int* _n_covered_regions, 161 ReservedSpace* heap_rs){ 162 const char overflow_msg[] = "The size of the object heap + VM data exceeds " 163 "the maximum representable size"; 164 165 // Now figure out the total size. 166 size_t total_reserved = 0; 167 int n_covered_regions = 0; 168 const size_t pageSize = UseLargePages ? 169 os::large_page_size() : os::vm_page_size(); 170 171 for (int i = 0; i < _n_gens; i++) { 172 total_reserved += _gen_specs[i]->max_size(); 173 if (total_reserved < _gen_specs[i]->max_size()) { 174 vm_exit_during_initialization(overflow_msg); 175 } 176 n_covered_regions += _gen_specs[i]->n_covered_regions(); 177 } 178 assert(total_reserved % pageSize == 0, 179 err_msg("Gen size; total_reserved=" SIZE_FORMAT ", pageSize=" 180 SIZE_FORMAT, total_reserved, pageSize)); 181 182 // Needed until the cardtable is fixed to have the right number 183 // of covered regions. 184 n_covered_regions += 2; 185 186 if (UseLargePages) { 187 assert(total_reserved != 0, "total_reserved cannot be 0"); 188 total_reserved = round_to(total_reserved, os::large_page_size()); 189 if (total_reserved < os::large_page_size()) { 190 vm_exit_during_initialization(overflow_msg); 191 } 192 } 193 194 *_total_reserved = total_reserved; 195 *_n_covered_regions = n_covered_regions; 196 *heap_rs = Universe::reserve_heap(total_reserved, alignment); 197 return heap_rs->base(); 198 } 199 200 201 void GenCollectedHeap::post_initialize() { 202 SharedHeap::post_initialize(); 203 TwoGenerationCollectorPolicy *policy = 204 (TwoGenerationCollectorPolicy *)collector_policy(); 205 guarantee(policy->is_two_generation_policy(), "Illegal policy type"); 206 DefNewGeneration* def_new_gen = (DefNewGeneration*) get_gen(0); 207 assert(def_new_gen->kind() == Generation::DefNew || 208 def_new_gen->kind() == Generation::ParNew || 209 def_new_gen->kind() == Generation::ASParNew, 210 "Wrong generation kind"); 211 212 Generation* old_gen = get_gen(1); 213 assert(old_gen->kind() == Generation::ConcurrentMarkSweep || 214 old_gen->kind() == Generation::ASConcurrentMarkSweep || 215 old_gen->kind() == Generation::MarkSweepCompact, 216 "Wrong generation kind"); 217 218 policy->initialize_size_policy(def_new_gen->eden()->capacity(), 219 old_gen->capacity(), 220 def_new_gen->from()->capacity()); 221 policy->initialize_gc_policy_counters(); 222 } 223 224 void GenCollectedHeap::ref_processing_init() { 225 SharedHeap::ref_processing_init(); 226 for (int i = 0; i < _n_gens; i++) { 227 _gens[i]->ref_processor_init(); 228 } 229 } 230 231 size_t GenCollectedHeap::capacity() const { 232 size_t res = 0; 233 for (int i = 0; i < _n_gens; i++) { 234 res += _gens[i]->capacity(); 235 } 236 return res; 237 } 238 239 size_t GenCollectedHeap::used() const { 240 size_t res = 0; 241 for (int i = 0; i < _n_gens; i++) { 242 res += _gens[i]->used(); 243 } 244 return res; 245 } 246 247 // Save the "used_region" for generations level and lower. 248 void GenCollectedHeap::save_used_regions(int level) { 249 assert(level < _n_gens, "Illegal level parameter"); 250 for (int i = level; i >= 0; i--) { 251 _gens[i]->save_used_region(); 252 } 253 } 254 255 size_t GenCollectedHeap::max_capacity() const { 256 size_t res = 0; 257 for (int i = 0; i < _n_gens; i++) { 258 res += _gens[i]->max_capacity(); 259 } 260 return res; 261 } 262 263 // Update the _full_collections_completed counter 264 // at the end of a stop-world full GC. 265 unsigned int GenCollectedHeap::update_full_collections_completed() { 266 MonitorLockerEx ml(FullGCCount_lock, Mutex::_no_safepoint_check_flag); 267 assert(_full_collections_completed <= _total_full_collections, 268 "Can't complete more collections than were started"); 269 _full_collections_completed = _total_full_collections; 270 ml.notify_all(); 271 return _full_collections_completed; 272 } 273 274 // Update the _full_collections_completed counter, as appropriate, 275 // at the end of a concurrent GC cycle. Note the conditional update 276 // below to allow this method to be called by a concurrent collector 277 // without synchronizing in any manner with the VM thread (which 278 // may already have initiated a STW full collection "concurrently"). 279 unsigned int GenCollectedHeap::update_full_collections_completed(unsigned int count) { 280 MonitorLockerEx ml(FullGCCount_lock, Mutex::_no_safepoint_check_flag); 281 assert((_full_collections_completed <= _total_full_collections) && 282 (count <= _total_full_collections), 283 "Can't complete more collections than were started"); 284 if (count > _full_collections_completed) { 285 _full_collections_completed = count; 286 ml.notify_all(); 287 } 288 return _full_collections_completed; 289 } 290 291 292 #ifndef PRODUCT 293 // Override of memory state checking method in CollectedHeap: 294 // Some collectors (CMS for example) can't have badHeapWordVal written 295 // in the first two words of an object. (For instance , in the case of 296 // CMS these words hold state used to synchronize between certain 297 // (concurrent) GC steps and direct allocating mutators.) 298 // The skip_header_HeapWords() method below, allows us to skip 299 // over the requisite number of HeapWord's. Note that (for 300 // generational collectors) this means that those many words are 301 // skipped in each object, irrespective of the generation in which 302 // that object lives. The resultant loss of precision seems to be 303 // harmless and the pain of avoiding that imprecision appears somewhat 304 // higher than we are prepared to pay for such rudimentary debugging 305 // support. 306 void GenCollectedHeap::check_for_non_bad_heap_word_value(HeapWord* addr, 307 size_t size) { 308 if (CheckMemoryInitialization && ZapUnusedHeapArea) { 309 // We are asked to check a size in HeapWords, 310 // but the memory is mangled in juint words. 311 juint* start = (juint*) (addr + skip_header_HeapWords()); 312 juint* end = (juint*) (addr + size); 313 for (juint* slot = start; slot < end; slot += 1) { 314 assert(*slot == badHeapWordVal, 315 "Found non badHeapWordValue in pre-allocation check"); 316 } 317 } 318 } 319 #endif 320 321 HeapWord* GenCollectedHeap::attempt_allocation(size_t size, 322 bool is_tlab, 323 bool first_only) { 324 HeapWord* res; 325 for (int i = 0; i < _n_gens; i++) { 326 if (_gens[i]->should_allocate(size, is_tlab)) { 327 res = _gens[i]->allocate(size, is_tlab); 328 if (res != NULL) return res; 329 else if (first_only) break; 330 } 331 } 332 // Otherwise... 333 return NULL; 334 } 335 336 HeapWord* GenCollectedHeap::mem_allocate(size_t size, 337 bool* gc_overhead_limit_was_exceeded) { 338 return collector_policy()->mem_allocate_work(size, 339 false /* is_tlab */, 340 gc_overhead_limit_was_exceeded); 341 } 342 343 bool GenCollectedHeap::must_clear_all_soft_refs() { 344 return _gc_cause == GCCause::_last_ditch_collection; 345 } 346 347 bool GenCollectedHeap::should_do_concurrent_full_gc(GCCause::Cause cause) { 348 return UseConcMarkSweepGC && 349 ((cause == GCCause::_gc_locker && GCLockerInvokesConcurrent) || 350 (cause == GCCause::_java_lang_system_gc && ExplicitGCInvokesConcurrent)); 351 } 352 353 void GenCollectedHeap::do_collection(bool full, 354 bool clear_all_soft_refs, 355 size_t size, 356 bool is_tlab, 357 int max_level) { 358 bool prepared_for_verification = false; 359 ResourceMark rm; 360 DEBUG_ONLY(Thread* my_thread = Thread::current();) 361 362 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); 363 assert(my_thread->is_VM_thread() || 364 my_thread->is_ConcurrentGC_thread(), 365 "incorrect thread type capability"); 366 assert(Heap_lock->is_locked(), 367 "the requesting thread should have the Heap_lock"); 368 guarantee(!is_gc_active(), "collection is not reentrant"); 369 assert(max_level < n_gens(), "sanity check"); 370 371 if (GC_locker::check_active_before_gc()) { 372 return; // GC is disabled (e.g. JNI GetXXXCritical operation) 373 } 374 375 const bool do_clear_all_soft_refs = clear_all_soft_refs || 376 collector_policy()->should_clear_all_soft_refs(); 377 378 ClearedAllSoftRefs casr(do_clear_all_soft_refs, collector_policy()); 379 380 const size_t metadata_prev_used = MetaspaceAux::used_in_bytes(); 381 382 print_heap_before_gc(); 383 384 { 385 FlagSetting fl(_is_gc_active, true); 386 387 bool complete = full && (max_level == (n_gens()-1)); 388 const char* gc_cause_prefix = complete ? "Full GC" : "GC"; 389 gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); 390 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); 391 TraceTime t(GCCauseString(gc_cause_prefix, gc_cause()), PrintGCDetails, false, gclog_or_tty); 392 393 gc_prologue(complete); 394 increment_total_collections(complete); 395 396 size_t gch_prev_used = used(); 397 398 int starting_level = 0; 399 if (full) { 400 // Search for the oldest generation which will collect all younger 401 // generations, and start collection loop there. 402 for (int i = max_level; i >= 0; i--) { 403 if (_gens[i]->full_collects_younger_generations()) { 404 starting_level = i; 405 break; 406 } 407 } 408 } 409 410 bool must_restore_marks_for_biased_locking = false; 411 412 int max_level_collected = starting_level; 413 for (int i = starting_level; i <= max_level; i++) { 414 if (_gens[i]->should_collect(full, size, is_tlab)) { 415 if (i == n_gens() - 1) { // a major collection is to happen 416 if (!complete) { 417 // The full_collections increment was missed above. 418 increment_total_full_collections(); 419 } 420 pre_full_gc_dump(); // do any pre full gc dumps 421 } 422 // Timer for individual generations. Last argument is false: no CR 423 TraceTime t1(_gens[i]->short_name(), PrintGCDetails, false, gclog_or_tty); 424 TraceCollectorStats tcs(_gens[i]->counters()); 425 TraceMemoryManagerStats tmms(_gens[i]->kind(),gc_cause()); 426 427 size_t prev_used = _gens[i]->used(); 428 _gens[i]->stat_record()->invocations++; 429 _gens[i]->stat_record()->accumulated_time.start(); 430 431 // Must be done anew before each collection because 432 // a previous collection will do mangling and will 433 // change top of some spaces. 434 record_gen_tops_before_GC(); 435 436 if (PrintGC && Verbose) { 437 gclog_or_tty->print("level=%d invoke=%d size=" SIZE_FORMAT, 438 i, 439 _gens[i]->stat_record()->invocations, 440 size*HeapWordSize); 441 } 442 443 if (VerifyBeforeGC && i >= VerifyGCLevel && 444 total_collections() >= VerifyGCStartAt) { 445 HandleMark hm; // Discard invalid handles created during verification 446 if (!prepared_for_verification) { 447 prepare_for_verify(); 448 prepared_for_verification = true; 449 } 450 gclog_or_tty->print(" VerifyBeforeGC:"); 451 Universe::verify(); 452 } 453 COMPILER2_PRESENT(DerivedPointerTable::clear()); 454 455 if (!must_restore_marks_for_biased_locking && 456 _gens[i]->performs_in_place_marking()) { 457 // We perform this mark word preservation work lazily 458 // because it's only at this point that we know whether we 459 // absolutely have to do it; we want to avoid doing it for 460 // scavenge-only collections where it's unnecessary 461 must_restore_marks_for_biased_locking = true; 462 BiasedLocking::preserve_marks(); 463 } 464 465 // Do collection work 466 { 467 // Note on ref discovery: For what appear to be historical reasons, 468 // GCH enables and disabled (by enqueing) refs discovery. 469 // In the future this should be moved into the generation's 470 // collect method so that ref discovery and enqueueing concerns 471 // are local to a generation. The collect method could return 472 // an appropriate indication in the case that notification on 473 // the ref lock was needed. This will make the treatment of 474 // weak refs more uniform (and indeed remove such concerns 475 // from GCH). XXX 476 477 HandleMark hm; // Discard invalid handles created during gc 478 save_marks(); // save marks for all gens 479 // We want to discover references, but not process them yet. 480 // This mode is disabled in process_discovered_references if the 481 // generation does some collection work, or in 482 // enqueue_discovered_references if the generation returns 483 // without doing any work. 484 ReferenceProcessor* rp = _gens[i]->ref_processor(); 485 // If the discovery of ("weak") refs in this generation is 486 // atomic wrt other collectors in this configuration, we 487 // are guaranteed to have empty discovered ref lists. 488 if (rp->discovery_is_atomic()) { 489 rp->enable_discovery(true /*verify_disabled*/, true /*verify_no_refs*/); 490 rp->setup_policy(do_clear_all_soft_refs); 491 } else { 492 // collect() below will enable discovery as appropriate 493 } 494 _gens[i]->collect(full, do_clear_all_soft_refs, size, is_tlab); 495 if (!rp->enqueuing_is_done()) { 496 rp->enqueue_discovered_references(); 497 } else { 498 rp->set_enqueuing_is_done(false); 499 } 500 rp->verify_no_references_recorded(); 501 } 502 max_level_collected = i; 503 504 // Determine if allocation request was met. 505 if (size > 0) { 506 if (!is_tlab || _gens[i]->supports_tlab_allocation()) { 507 if (size*HeapWordSize <= _gens[i]->unsafe_max_alloc_nogc()) { 508 size = 0; 509 } 510 } 511 } 512 513 COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); 514 515 _gens[i]->stat_record()->accumulated_time.stop(); 516 517 update_gc_stats(i, full); 518 519 if (VerifyAfterGC && i >= VerifyGCLevel && 520 total_collections() >= VerifyGCStartAt) { 521 HandleMark hm; // Discard invalid handles created during verification 522 gclog_or_tty->print(" VerifyAfterGC:"); 523 Universe::verify(); 524 } 525 526 if (PrintGCDetails) { 527 gclog_or_tty->print(":"); 528 _gens[i]->print_heap_change(prev_used); 529 } 530 } 531 } 532 533 // Update "complete" boolean wrt what actually transpired -- 534 // for instance, a promotion failure could have led to 535 // a whole heap collection. 536 complete = complete || (max_level_collected == n_gens() - 1); 537 538 if (complete) { // We did a "major" collection 539 post_full_gc_dump(); // do any post full gc dumps 540 } 541 542 if (PrintGCDetails) { 543 print_heap_change(gch_prev_used); 544 545 // Print metaspace info for full GC with PrintGCDetails flag. 546 if (complete) { 547 MetaspaceAux::print_metaspace_change(metadata_prev_used); 548 } 549 } 550 551 for (int j = max_level_collected; j >= 0; j -= 1) { 552 // Adjust generation sizes. 553 _gens[j]->compute_new_size(); 554 } 555 556 if (complete) { 557 // Resize the metaspace capacity after full collections 558 MetaspaceGC::compute_new_size(); 559 update_full_collections_completed(); 560 } 561 562 // Track memory usage and detect low memory after GC finishes 563 MemoryService::track_memory_usage(); 564 565 gc_epilogue(complete); 566 567 // Delete metaspaces for unloaded class loaders and clean up loader_data graph 568 if (complete) { 569 ClassLoaderDataGraph::purge(); 570 } 571 572 if (must_restore_marks_for_biased_locking) { 573 BiasedLocking::restore_marks(); 574 } 575 } 576 577 AdaptiveSizePolicy* sp = gen_policy()->size_policy(); 578 AdaptiveSizePolicyOutput(sp, total_collections()); 579 580 print_heap_after_gc(); 581 582 #ifdef TRACESPINNING 583 ParallelTaskTerminator::print_termination_counts(); 584 #endif 585 } 586 587 HeapWord* GenCollectedHeap::satisfy_failed_allocation(size_t size, bool is_tlab) { 588 return collector_policy()->satisfy_failed_allocation(size, is_tlab); 589 } 590 591 void GenCollectedHeap::set_par_threads(uint t) { 592 SharedHeap::set_par_threads(t); 593 _gen_process_strong_tasks->set_n_threads(t); 594 } 595 596 void GenCollectedHeap:: 597 gen_process_strong_roots(int level, 598 bool younger_gens_as_roots, 599 bool activate_scope, 600 bool is_scavenging, 601 SharedHeap::ScanningOption so, 602 OopsInGenClosure* not_older_gens, 603 bool do_code_roots, 604 OopsInGenClosure* older_gens, 605 KlassClosure* klass_closure) { 606 // General strong roots. 607 608 if (!do_code_roots) { 609 SharedHeap::process_strong_roots(activate_scope, is_scavenging, so, 610 not_older_gens, NULL, klass_closure); 611 } else { 612 bool do_code_marking = (activate_scope || nmethod::oops_do_marking_is_active()); 613 CodeBlobToOopClosure code_roots(not_older_gens, /*do_marking=*/ do_code_marking); 614 SharedHeap::process_strong_roots(activate_scope, is_scavenging, so, 615 not_older_gens, &code_roots, klass_closure); 616 } 617 618 if (younger_gens_as_roots) { 619 if (!_gen_process_strong_tasks->is_task_claimed(GCH_PS_younger_gens)) { 620 for (int i = 0; i < level; i++) { 621 not_older_gens->set_generation(_gens[i]); 622 _gens[i]->oop_iterate(not_older_gens); 623 } 624 not_older_gens->reset_generation(); 625 } 626 } 627 // When collection is parallel, all threads get to cooperate to do 628 // older-gen scanning. 629 for (int i = level+1; i < _n_gens; i++) { 630 older_gens->set_generation(_gens[i]); 631 rem_set()->younger_refs_iterate(_gens[i], older_gens); 632 older_gens->reset_generation(); 633 } 634 635 _gen_process_strong_tasks->all_tasks_completed(); 636 } 637 638 void GenCollectedHeap::gen_process_weak_roots(OopClosure* root_closure, 639 CodeBlobClosure* code_roots, 640 OopClosure* non_root_closure) { 641 SharedHeap::process_weak_roots(root_closure, code_roots, non_root_closure); 642 // "Local" "weak" refs 643 for (int i = 0; i < _n_gens; i++) { 644 _gens[i]->ref_processor()->weak_oops_do(root_closure); 645 } 646 } 647 648 #define GCH_SINCE_SAVE_MARKS_ITERATE_DEFN(OopClosureType, nv_suffix) \ 649 void GenCollectedHeap:: \ 650 oop_since_save_marks_iterate(int level, \ 651 OopClosureType* cur, \ 652 OopClosureType* older) { \ 653 _gens[level]->oop_since_save_marks_iterate##nv_suffix(cur); \ 654 for (int i = level+1; i < n_gens(); i++) { \ 655 _gens[i]->oop_since_save_marks_iterate##nv_suffix(older); \ 656 } \ 657 } 658 659 ALL_SINCE_SAVE_MARKS_CLOSURES(GCH_SINCE_SAVE_MARKS_ITERATE_DEFN) 660 661 #undef GCH_SINCE_SAVE_MARKS_ITERATE_DEFN 662 663 bool GenCollectedHeap::no_allocs_since_save_marks(int level) { 664 for (int i = level; i < _n_gens; i++) { 665 if (!_gens[i]->no_allocs_since_save_marks()) return false; 666 } 667 return true; 668 } 669 670 bool GenCollectedHeap::supports_inline_contig_alloc() const { 671 return _gens[0]->supports_inline_contig_alloc(); 672 } 673 674 HeapWord** GenCollectedHeap::top_addr() const { 675 return _gens[0]->top_addr(); 676 } 677 678 HeapWord** GenCollectedHeap::end_addr() const { 679 return _gens[0]->end_addr(); 680 } 681 682 size_t GenCollectedHeap::unsafe_max_alloc() { 683 return _gens[0]->unsafe_max_alloc_nogc(); 684 } 685 686 // public collection interfaces 687 688 void GenCollectedHeap::collect(GCCause::Cause cause) { 689 if (should_do_concurrent_full_gc(cause)) { 690 #if INCLUDE_ALL_GCS 691 // mostly concurrent full collection 692 collect_mostly_concurrent(cause); 693 #else // INCLUDE_ALL_GCS 694 ShouldNotReachHere(); 695 #endif // INCLUDE_ALL_GCS 696 } else { 697 #ifdef ASSERT 698 if (cause == GCCause::_scavenge_alot) { 699 // minor collection only 700 collect(cause, 0); 701 } else { 702 // Stop-the-world full collection 703 collect(cause, n_gens() - 1); 704 } 705 #else 706 // Stop-the-world full collection 707 collect(cause, n_gens() - 1); 708 #endif 709 } 710 } 711 712 void GenCollectedHeap::collect(GCCause::Cause cause, int max_level) { 713 // The caller doesn't have the Heap_lock 714 assert(!Heap_lock->owned_by_self(), "this thread should not own the Heap_lock"); 715 MutexLocker ml(Heap_lock); 716 collect_locked(cause, max_level); 717 } 718 719 void GenCollectedHeap::collect_locked(GCCause::Cause cause) { 720 // The caller has the Heap_lock 721 assert(Heap_lock->owned_by_self(), "this thread should own the Heap_lock"); 722 collect_locked(cause, n_gens() - 1); 723 } 724 725 // this is the private collection interface 726 // The Heap_lock is expected to be held on entry. 727 728 void GenCollectedHeap::collect_locked(GCCause::Cause cause, int max_level) { 729 // Read the GC count while holding the Heap_lock 730 unsigned int gc_count_before = total_collections(); 731 unsigned int full_gc_count_before = total_full_collections(); 732 { 733 MutexUnlocker mu(Heap_lock); // give up heap lock, execute gets it back 734 VM_GenCollectFull op(gc_count_before, full_gc_count_before, 735 cause, max_level); 736 VMThread::execute(&op); 737 } 738 } 739 740 #if INCLUDE_ALL_GCS 741 bool GenCollectedHeap::create_cms_collector() { 742 743 assert(((_gens[1]->kind() == Generation::ConcurrentMarkSweep) || 744 (_gens[1]->kind() == Generation::ASConcurrentMarkSweep)), 745 "Unexpected generation kinds"); 746 // Skip two header words in the block content verification 747 NOT_PRODUCT(_skip_header_HeapWords = CMSCollector::skip_header_HeapWords();) 748 CMSCollector* collector = new CMSCollector( 749 (ConcurrentMarkSweepGeneration*)_gens[1], 750 _rem_set->as_CardTableRS(), 751 (ConcurrentMarkSweepPolicy*) collector_policy()); 752 753 if (collector == NULL || !collector->completed_initialization()) { 754 if (collector) { 755 delete collector; // Be nice in embedded situation 756 } 757 vm_shutdown_during_initialization("Could not create CMS collector"); 758 return false; 759 } 760 return true; // success 761 } 762 763 void GenCollectedHeap::collect_mostly_concurrent(GCCause::Cause cause) { 764 assert(!Heap_lock->owned_by_self(), "Should not own Heap_lock"); 765 766 MutexLocker ml(Heap_lock); 767 // Read the GC counts while holding the Heap_lock 768 unsigned int full_gc_count_before = total_full_collections(); 769 unsigned int gc_count_before = total_collections(); 770 { 771 MutexUnlocker mu(Heap_lock); 772 VM_GenCollectFullConcurrent op(gc_count_before, full_gc_count_before, cause); 773 VMThread::execute(&op); 774 } 775 } 776 #endif // INCLUDE_ALL_GCS 777 778 void GenCollectedHeap::do_full_collection(bool clear_all_soft_refs) { 779 do_full_collection(clear_all_soft_refs, _n_gens - 1); 780 } 781 782 void GenCollectedHeap::do_full_collection(bool clear_all_soft_refs, 783 int max_level) { 784 int local_max_level; 785 if (!incremental_collection_will_fail(false /* don't consult_young */) && 786 gc_cause() == GCCause::_gc_locker) { 787 local_max_level = 0; 788 } else { 789 local_max_level = max_level; 790 } 791 792 do_collection(true /* full */, 793 clear_all_soft_refs /* clear_all_soft_refs */, 794 0 /* size */, 795 false /* is_tlab */, 796 local_max_level /* max_level */); 797 // Hack XXX FIX ME !!! 798 // A scavenge may not have been attempted, or may have 799 // been attempted and failed, because the old gen was too full 800 if (local_max_level == 0 && gc_cause() == GCCause::_gc_locker && 801 incremental_collection_will_fail(false /* don't consult_young */)) { 802 if (PrintGCDetails) { 803 gclog_or_tty->print_cr("GC locker: Trying a full collection " 804 "because scavenge failed"); 805 } 806 // This time allow the old gen to be collected as well 807 do_collection(true /* full */, 808 clear_all_soft_refs /* clear_all_soft_refs */, 809 0 /* size */, 810 false /* is_tlab */, 811 n_gens() - 1 /* max_level */); 812 } 813 } 814 815 bool GenCollectedHeap::is_in_young(oop p) { 816 bool result = ((HeapWord*)p) < _gens[_n_gens - 1]->reserved().start(); 817 assert(result == _gens[0]->is_in_reserved(p), 818 err_msg("incorrect test - result=%d, p=" PTR_FORMAT, result, (void*)p)); 819 return result; 820 } 821 822 // Returns "TRUE" iff "p" points into the committed areas of the heap. 823 bool GenCollectedHeap::is_in(const void* p) const { 824 #ifndef ASSERT 825 guarantee(VerifyBeforeGC || 826 VerifyDuringGC || 827 VerifyBeforeExit || 828 PrintAssembly || 829 tty->count() != 0 || // already printing 830 VerifyAfterGC || 831 VMError::fatal_error_in_progress(), "too expensive"); 832 833 #endif 834 // This might be sped up with a cache of the last generation that 835 // answered yes. 836 for (int i = 0; i < _n_gens; i++) { 837 if (_gens[i]->is_in(p)) return true; 838 } 839 // Otherwise... 840 return false; 841 } 842 843 #ifdef ASSERT 844 // Don't implement this by using is_in_young(). This method is used 845 // in some cases to check that is_in_young() is correct. 846 bool GenCollectedHeap::is_in_partial_collection(const void* p) { 847 assert(is_in_reserved(p) || p == NULL, 848 "Does not work if address is non-null and outside of the heap"); 849 return p < _gens[_n_gens - 2]->reserved().end() && p != NULL; 850 } 851 #endif 852 853 void GenCollectedHeap::oop_iterate(ExtendedOopClosure* cl) { 854 for (int i = 0; i < _n_gens; i++) { 855 _gens[i]->oop_iterate(cl); 856 } 857 } 858 859 void GenCollectedHeap::oop_iterate(MemRegion mr, ExtendedOopClosure* cl) { 860 for (int i = 0; i < _n_gens; i++) { 861 _gens[i]->oop_iterate(mr, cl); 862 } 863 } 864 865 void GenCollectedHeap::object_iterate(ObjectClosure* cl) { 866 for (int i = 0; i < _n_gens; i++) { 867 _gens[i]->object_iterate(cl); 868 } 869 } 870 871 void GenCollectedHeap::safe_object_iterate(ObjectClosure* cl) { 872 for (int i = 0; i < _n_gens; i++) { 873 _gens[i]->safe_object_iterate(cl); 874 } 875 } 876 877 void GenCollectedHeap::object_iterate_since_last_GC(ObjectClosure* cl) { 878 for (int i = 0; i < _n_gens; i++) { 879 _gens[i]->object_iterate_since_last_GC(cl); 880 } 881 } 882 883 Space* GenCollectedHeap::space_containing(const void* addr) const { 884 for (int i = 0; i < _n_gens; i++) { 885 Space* res = _gens[i]->space_containing(addr); 886 if (res != NULL) return res; 887 } 888 // Otherwise... 889 assert(false, "Could not find containing space"); 890 return NULL; 891 } 892 893 894 HeapWord* GenCollectedHeap::block_start(const void* addr) const { 895 assert(is_in_reserved(addr), "block_start of address outside of heap"); 896 for (int i = 0; i < _n_gens; i++) { 897 if (_gens[i]->is_in_reserved(addr)) { 898 assert(_gens[i]->is_in(addr), 899 "addr should be in allocated part of generation"); 900 return _gens[i]->block_start(addr); 901 } 902 } 903 assert(false, "Some generation should contain the address"); 904 return NULL; 905 } 906 907 size_t GenCollectedHeap::block_size(const HeapWord* addr) const { 908 assert(is_in_reserved(addr), "block_size of address outside of heap"); 909 for (int i = 0; i < _n_gens; i++) { 910 if (_gens[i]->is_in_reserved(addr)) { 911 assert(_gens[i]->is_in(addr), 912 "addr should be in allocated part of generation"); 913 return _gens[i]->block_size(addr); 914 } 915 } 916 assert(false, "Some generation should contain the address"); 917 return 0; 918 } 919 920 bool GenCollectedHeap::block_is_obj(const HeapWord* addr) const { 921 assert(is_in_reserved(addr), "block_is_obj of address outside of heap"); 922 assert(block_start(addr) == addr, "addr must be a block start"); 923 for (int i = 0; i < _n_gens; i++) { 924 if (_gens[i]->is_in_reserved(addr)) { 925 return _gens[i]->block_is_obj(addr); 926 } 927 } 928 assert(false, "Some generation should contain the address"); 929 return false; 930 } 931 932 bool GenCollectedHeap::supports_tlab_allocation() const { 933 for (int i = 0; i < _n_gens; i += 1) { 934 if (_gens[i]->supports_tlab_allocation()) { 935 return true; 936 } 937 } 938 return false; 939 } 940 941 size_t GenCollectedHeap::tlab_capacity(Thread* thr) const { 942 size_t result = 0; 943 for (int i = 0; i < _n_gens; i += 1) { 944 if (_gens[i]->supports_tlab_allocation()) { 945 result += _gens[i]->tlab_capacity(); 946 } 947 } 948 return result; 949 } 950 951 size_t GenCollectedHeap::unsafe_max_tlab_alloc(Thread* thr) const { 952 size_t result = 0; 953 for (int i = 0; i < _n_gens; i += 1) { 954 if (_gens[i]->supports_tlab_allocation()) { 955 result += _gens[i]->unsafe_max_tlab_alloc(); 956 } 957 } 958 return result; 959 } 960 961 HeapWord* GenCollectedHeap::allocate_new_tlab(size_t size) { 962 bool gc_overhead_limit_was_exceeded; 963 return collector_policy()->mem_allocate_work(size /* size */, 964 true /* is_tlab */, 965 &gc_overhead_limit_was_exceeded); 966 } 967 968 // Requires "*prev_ptr" to be non-NULL. Deletes and a block of minimal size 969 // from the list headed by "*prev_ptr". 970 static ScratchBlock *removeSmallestScratch(ScratchBlock **prev_ptr) { 971 bool first = true; 972 size_t min_size = 0; // "first" makes this conceptually infinite. 973 ScratchBlock **smallest_ptr, *smallest; 974 ScratchBlock *cur = *prev_ptr; 975 while (cur) { 976 assert(*prev_ptr == cur, "just checking"); 977 if (first || cur->num_words < min_size) { 978 smallest_ptr = prev_ptr; 979 smallest = cur; 980 min_size = smallest->num_words; 981 first = false; 982 } 983 prev_ptr = &cur->next; 984 cur = cur->next; 985 } 986 smallest = *smallest_ptr; 987 *smallest_ptr = smallest->next; 988 return smallest; 989 } 990 991 // Sort the scratch block list headed by res into decreasing size order, 992 // and set "res" to the result. 993 static void sort_scratch_list(ScratchBlock*& list) { 994 ScratchBlock* sorted = NULL; 995 ScratchBlock* unsorted = list; 996 while (unsorted) { 997 ScratchBlock *smallest = removeSmallestScratch(&unsorted); 998 smallest->next = sorted; 999 sorted = smallest; 1000 } 1001 list = sorted; 1002 } 1003 1004 ScratchBlock* GenCollectedHeap::gather_scratch(Generation* requestor, 1005 size_t max_alloc_words) { 1006 ScratchBlock* res = NULL; 1007 for (int i = 0; i < _n_gens; i++) { 1008 _gens[i]->contribute_scratch(res, requestor, max_alloc_words); 1009 } 1010 sort_scratch_list(res); 1011 return res; 1012 } 1013 1014 void GenCollectedHeap::release_scratch() { 1015 for (int i = 0; i < _n_gens; i++) { 1016 _gens[i]->reset_scratch(); 1017 } 1018 } 1019 1020 class GenPrepareForVerifyClosure: public GenCollectedHeap::GenClosure { 1021 void do_generation(Generation* gen) { 1022 gen->prepare_for_verify(); 1023 } 1024 }; 1025 1026 void GenCollectedHeap::prepare_for_verify() { 1027 ensure_parsability(false); // no need to retire TLABs 1028 GenPrepareForVerifyClosure blk; 1029 generation_iterate(&blk, false); 1030 } 1031 1032 1033 void GenCollectedHeap::generation_iterate(GenClosure* cl, 1034 bool old_to_young) { 1035 if (old_to_young) { 1036 for (int i = _n_gens-1; i >= 0; i--) { 1037 cl->do_generation(_gens[i]); 1038 } 1039 } else { 1040 for (int i = 0; i < _n_gens; i++) { 1041 cl->do_generation(_gens[i]); 1042 } 1043 } 1044 } 1045 1046 void GenCollectedHeap::space_iterate(SpaceClosure* cl) { 1047 for (int i = 0; i < _n_gens; i++) { 1048 _gens[i]->space_iterate(cl, true); 1049 } 1050 } 1051 1052 bool GenCollectedHeap::is_maximal_no_gc() const { 1053 for (int i = 0; i < _n_gens; i++) { 1054 if (!_gens[i]->is_maximal_no_gc()) { 1055 return false; 1056 } 1057 } 1058 return true; 1059 } 1060 1061 void GenCollectedHeap::save_marks() { 1062 for (int i = 0; i < _n_gens; i++) { 1063 _gens[i]->save_marks(); 1064 } 1065 } 1066 1067 void GenCollectedHeap::compute_new_generation_sizes(int collectedGen) { 1068 for (int i = 0; i <= collectedGen; i++) { 1069 _gens[i]->compute_new_size(); 1070 } 1071 } 1072 1073 GenCollectedHeap* GenCollectedHeap::heap() { 1074 assert(_gch != NULL, "Uninitialized access to GenCollectedHeap::heap()"); 1075 assert(_gch->kind() == CollectedHeap::GenCollectedHeap, "not a generational heap"); 1076 return _gch; 1077 } 1078 1079 1080 void GenCollectedHeap::prepare_for_compaction() { 1081 Generation* scanning_gen = _gens[_n_gens-1]; 1082 // Start by compacting into same gen. 1083 CompactPoint cp(scanning_gen, NULL, NULL); 1084 while (scanning_gen != NULL) { 1085 scanning_gen->prepare_for_compaction(&cp); 1086 scanning_gen = prev_gen(scanning_gen); 1087 } 1088 } 1089 1090 GCStats* GenCollectedHeap::gc_stats(int level) const { 1091 return _gens[level]->gc_stats(); 1092 } 1093 1094 void GenCollectedHeap::verify(bool silent, VerifyOption option /* ignored */) { 1095 for (int i = _n_gens-1; i >= 0; i--) { 1096 Generation* g = _gens[i]; 1097 if (!silent) { 1098 gclog_or_tty->print(g->name()); 1099 gclog_or_tty->print(" "); 1100 } 1101 g->verify(); 1102 } 1103 if (!silent) { 1104 gclog_or_tty->print("remset "); 1105 } 1106 rem_set()->verify(); 1107 } 1108 1109 void GenCollectedHeap::print_on(outputStream* st) const { 1110 for (int i = 0; i < _n_gens; i++) { 1111 _gens[i]->print_on(st); 1112 } 1113 MetaspaceAux::print_on(st); 1114 } 1115 1116 void GenCollectedHeap::gc_threads_do(ThreadClosure* tc) const { 1117 if (workers() != NULL) { 1118 workers()->threads_do(tc); 1119 } 1120 #if INCLUDE_ALL_GCS 1121 if (UseConcMarkSweepGC) { 1122 ConcurrentMarkSweepThread::threads_do(tc); 1123 } 1124 #endif // INCLUDE_ALL_GCS 1125 } 1126 1127 void GenCollectedHeap::print_gc_threads_on(outputStream* st) const { 1128 #if INCLUDE_ALL_GCS 1129 if (UseParNewGC) { 1130 workers()->print_worker_threads_on(st); 1131 } 1132 if (UseConcMarkSweepGC) { 1133 ConcurrentMarkSweepThread::print_all_on(st); 1134 } 1135 #endif // INCLUDE_ALL_GCS 1136 } 1137 1138 void GenCollectedHeap::print_tracing_info() const { 1139 if (TraceGen0Time) { 1140 get_gen(0)->print_summary_info(); 1141 } 1142 if (TraceGen1Time) { 1143 get_gen(1)->print_summary_info(); 1144 } 1145 } 1146 1147 void GenCollectedHeap::print_heap_change(size_t prev_used) const { 1148 if (PrintGCDetails && Verbose) { 1149 gclog_or_tty->print(" " SIZE_FORMAT 1150 "->" SIZE_FORMAT 1151 "(" SIZE_FORMAT ")", 1152 prev_used, used(), capacity()); 1153 } else { 1154 gclog_or_tty->print(" " SIZE_FORMAT "K" 1155 "->" SIZE_FORMAT "K" 1156 "(" SIZE_FORMAT "K)", 1157 prev_used / K, used() / K, capacity() / K); 1158 } 1159 } 1160 1161 class GenGCPrologueClosure: public GenCollectedHeap::GenClosure { 1162 private: 1163 bool _full; 1164 public: 1165 void do_generation(Generation* gen) { 1166 gen->gc_prologue(_full); 1167 } 1168 GenGCPrologueClosure(bool full) : _full(full) {}; 1169 }; 1170 1171 void GenCollectedHeap::gc_prologue(bool full) { 1172 assert(InlineCacheBuffer::is_empty(), "should have cleaned up ICBuffer"); 1173 1174 always_do_update_barrier = false; 1175 // Fill TLAB's and such 1176 CollectedHeap::accumulate_statistics_all_tlabs(); 1177 ensure_parsability(true); // retire TLABs 1178 1179 // Call allocation profiler 1180 AllocationProfiler::iterate_since_last_gc(); 1181 // Walk generations 1182 GenGCPrologueClosure blk(full); 1183 generation_iterate(&blk, false); // not old-to-young. 1184 }; 1185 1186 class GenGCEpilogueClosure: public GenCollectedHeap::GenClosure { 1187 private: 1188 bool _full; 1189 public: 1190 void do_generation(Generation* gen) { 1191 gen->gc_epilogue(_full); 1192 } 1193 GenGCEpilogueClosure(bool full) : _full(full) {}; 1194 }; 1195 1196 void GenCollectedHeap::gc_epilogue(bool full) { 1197 #ifdef COMPILER2 1198 assert(DerivedPointerTable::is_empty(), "derived pointer present"); 1199 size_t actual_gap = pointer_delta((HeapWord*) (max_uintx-3), *(end_addr())); 1200 guarantee(actual_gap > (size_t)FastAllocateSizeLimit, "inline allocation wraps"); 1201 #endif /* COMPILER2 */ 1202 1203 resize_all_tlabs(); 1204 1205 GenGCEpilogueClosure blk(full); 1206 generation_iterate(&blk, false); // not old-to-young. 1207 1208 if (!CleanChunkPoolAsync) { 1209 Chunk::clean_chunk_pool(); 1210 } 1211 1212 MetaspaceCounters::update_performance_counters(); 1213 1214 always_do_update_barrier = UseConcMarkSweepGC; 1215 }; 1216 1217 #ifndef PRODUCT 1218 class GenGCSaveTopsBeforeGCClosure: public GenCollectedHeap::GenClosure { 1219 private: 1220 public: 1221 void do_generation(Generation* gen) { 1222 gen->record_spaces_top(); 1223 } 1224 }; 1225 1226 void GenCollectedHeap::record_gen_tops_before_GC() { 1227 if (ZapUnusedHeapArea) { 1228 GenGCSaveTopsBeforeGCClosure blk; 1229 generation_iterate(&blk, false); // not old-to-young. 1230 } 1231 } 1232 #endif // not PRODUCT 1233 1234 class GenEnsureParsabilityClosure: public GenCollectedHeap::GenClosure { 1235 public: 1236 void do_generation(Generation* gen) { 1237 gen->ensure_parsability(); 1238 } 1239 }; 1240 1241 void GenCollectedHeap::ensure_parsability(bool retire_tlabs) { 1242 CollectedHeap::ensure_parsability(retire_tlabs); 1243 GenEnsureParsabilityClosure ep_cl; 1244 generation_iterate(&ep_cl, false); 1245 } 1246 1247 oop GenCollectedHeap::handle_failed_promotion(Generation* gen, 1248 oop obj, 1249 size_t obj_size) { 1250 assert(obj_size == (size_t)obj->size(), "bad obj_size passed in"); 1251 HeapWord* result = NULL; 1252 1253 // First give each higher generation a chance to allocate the promoted object. 1254 Generation* allocator = next_gen(gen); 1255 if (allocator != NULL) { 1256 do { 1257 result = allocator->allocate(obj_size, false); 1258 } while (result == NULL && (allocator = next_gen(allocator)) != NULL); 1259 } 1260 1261 if (result == NULL) { 1262 // Then give gen and higher generations a chance to expand and allocate the 1263 // object. 1264 do { 1265 result = gen->expand_and_allocate(obj_size, false); 1266 } while (result == NULL && (gen = next_gen(gen)) != NULL); 1267 } 1268 1269 if (result != NULL) { 1270 Copy::aligned_disjoint_words((HeapWord*)obj, result, obj_size); 1271 } 1272 return oop(result); 1273 } 1274 1275 class GenTimeOfLastGCClosure: public GenCollectedHeap::GenClosure { 1276 jlong _time; // in ms 1277 jlong _now; // in ms 1278 1279 public: 1280 GenTimeOfLastGCClosure(jlong now) : _time(now), _now(now) { } 1281 1282 jlong time() { return _time; } 1283 1284 void do_generation(Generation* gen) { 1285 _time = MIN2(_time, gen->time_of_last_gc(_now)); 1286 } 1287 }; 1288 1289 jlong GenCollectedHeap::millis_since_last_gc() { 1290 // We need a monotonically non-deccreasing time in ms but 1291 // os::javaTimeMillis() does not guarantee monotonicity. 1292 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; 1293 GenTimeOfLastGCClosure tolgc_cl(now); 1294 // iterate over generations getting the oldest 1295 // time that a generation was collected 1296 generation_iterate(&tolgc_cl, false); 1297 1298 // javaTimeNanos() is guaranteed to be monotonically non-decreasing 1299 // provided the underlying platform provides such a time source 1300 // (and it is bug free). So we still have to guard against getting 1301 // back a time later than 'now'. 1302 jlong retVal = now - tolgc_cl.time(); 1303 if (retVal < 0) { 1304 NOT_PRODUCT(warning("time warp: "INT64_FORMAT, retVal);) 1305 return 0; 1306 } 1307 return retVal; 1308 }