1 /* 2 * Copyright (c) 2001, 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 #ifndef SHARE_VM_GC_G1_G1COLLECTEDHEAP_HPP 26 #define SHARE_VM_GC_G1_G1COLLECTEDHEAP_HPP 27 28 #include "gc/g1/concurrentMark.hpp" 29 #include "gc/g1/evacuationInfo.hpp" 30 #include "gc/g1/g1AllocationContext.hpp" 31 #include "gc/g1/g1BiasedArray.hpp" 32 #include "gc/g1/g1CollectorState.hpp" 33 #include "gc/g1/g1HRPrinter.hpp" 34 #include "gc/g1/g1InCSetState.hpp" 35 #include "gc/g1/g1MonitoringSupport.hpp" 36 #include "gc/g1/g1EvacStats.hpp" 37 #include "gc/g1/g1SATBCardTableModRefBS.hpp" 38 #include "gc/g1/g1YCTypes.hpp" 39 #include "gc/g1/hSpaceCounters.hpp" 40 #include "gc/g1/heapRegionManager.hpp" 41 #include "gc/g1/heapRegionSet.hpp" 42 #include "gc/g1/youngList.hpp" 43 #include "gc/shared/barrierSet.hpp" 44 #include "gc/shared/collectedHeap.hpp" 45 #include "gc/shared/plab.hpp" 46 #include "memory/memRegion.hpp" 47 #include "utilities/stack.hpp" 48 49 // A "G1CollectedHeap" is an implementation of a java heap for HotSpot. 50 // It uses the "Garbage First" heap organization and algorithm, which 51 // may combine concurrent marking with parallel, incremental compaction of 52 // heap subsets that will yield large amounts of garbage. 53 54 // Forward declarations 55 class HeapRegion; 56 class HRRSCleanupTask; 57 class GenerationSpec; 58 class OopsInHeapRegionClosure; 59 class G1ParScanThreadState; 60 class G1ParScanThreadStateSet; 61 class G1KlassScanClosure; 62 class G1ParScanThreadState; 63 class ObjectClosure; 64 class SpaceClosure; 65 class CompactibleSpaceClosure; 66 class Space; 67 class G1CollectorPolicy; 68 class G1RemSet; 69 class HeapRegionRemSetIterator; 70 class ConcurrentMark; 71 class ConcurrentMarkThread; 72 class ConcurrentG1Refine; 73 class ConcurrentGCTimer; 74 class GenerationCounters; 75 class STWGCTimer; 76 class G1NewTracer; 77 class G1OldTracer; 78 class EvacuationFailedInfo; 79 class nmethod; 80 class Ticks; 81 class WorkGang; 82 class G1Allocator; 83 class G1ArchiveAllocator; 84 85 typedef OverflowTaskQueue<StarTask, mtGC> RefToScanQueue; 86 typedef GenericTaskQueueSet<RefToScanQueue, mtGC> RefToScanQueueSet; 87 88 typedef int RegionIdx_t; // needs to hold [ 0..max_regions() ) 89 typedef int CardIdx_t; // needs to hold [ 0..CardsPerRegion ) 90 91 // The G1 STW is alive closure. 92 // An instance is embedded into the G1CH and used as the 93 // (optional) _is_alive_non_header closure in the STW 94 // reference processor. It is also extensively used during 95 // reference processing during STW evacuation pauses. 96 class G1STWIsAliveClosure: public BoolObjectClosure { 97 G1CollectedHeap* _g1; 98 public: 99 G1STWIsAliveClosure(G1CollectedHeap* g1) : _g1(g1) {} 100 bool do_object_b(oop p); 101 }; 102 103 class RefineCardTableEntryClosure; 104 105 class G1RegionMappingChangedListener : public G1MappingChangedListener { 106 private: 107 void reset_from_card_cache(uint start_idx, size_t num_regions); 108 public: 109 virtual void on_commit(uint start_idx, size_t num_regions, bool zero_filled); 110 }; 111 112 class G1CollectedHeap : public CollectedHeap { 113 friend class VM_CollectForMetadataAllocation; 114 friend class VM_G1CollectForAllocation; 115 friend class VM_G1CollectFull; 116 friend class VM_G1IncCollectionPause; 117 friend class VMStructs; 118 friend class MutatorAllocRegion; 119 friend class G1GCAllocRegion; 120 121 // Closures used in implementation. 122 friend class G1ParScanThreadState; 123 friend class G1ParScanThreadStateSet; 124 friend class G1ParTask; 125 friend class G1PLABAllocator; 126 friend class G1PrepareCompactClosure; 127 128 // Other related classes. 129 friend class HeapRegionClaimer; 130 131 // Testing classes. 132 friend class G1CheckCSetFastTableClosure; 133 134 private: 135 WorkGang* _workers; 136 137 static size_t _humongous_object_threshold_in_words; 138 139 // The secondary free list which contains regions that have been 140 // freed up during the cleanup process. This will be appended to 141 // the master free list when appropriate. 142 FreeRegionList _secondary_free_list; 143 144 // It keeps track of the old regions. 145 HeapRegionSet _old_set; 146 147 // It keeps track of the humongous regions. 148 HeapRegionSet _humongous_set; 149 150 void eagerly_reclaim_humongous_regions(); 151 152 // The number of regions we could create by expansion. 153 uint _expansion_regions; 154 155 // The block offset table for the G1 heap. 156 G1BlockOffsetSharedArray* _bot_shared; 157 158 // Tears down the region sets / lists so that they are empty and the 159 // regions on the heap do not belong to a region set / list. The 160 // only exception is the humongous set which we leave unaltered. If 161 // free_list_only is true, it will only tear down the master free 162 // list. It is called before a Full GC (free_list_only == false) or 163 // before heap shrinking (free_list_only == true). 164 void tear_down_region_sets(bool free_list_only); 165 166 // Rebuilds the region sets / lists so that they are repopulated to 167 // reflect the contents of the heap. The only exception is the 168 // humongous set which was not torn down in the first place. If 169 // free_list_only is true, it will only rebuild the master free 170 // list. It is called after a Full GC (free_list_only == false) or 171 // after heap shrinking (free_list_only == true). 172 void rebuild_region_sets(bool free_list_only); 173 174 // Callback for region mapping changed events. 175 G1RegionMappingChangedListener _listener; 176 177 // The sequence of all heap regions in the heap. 178 HeapRegionManager _hrm; 179 180 // Manages all allocations with regions except humongous object allocations. 181 G1Allocator* _allocator; 182 183 // Outside of GC pauses, the number of bytes used in all regions other 184 // than the current allocation region(s). 185 size_t _summary_bytes_used; 186 187 void increase_used(size_t bytes); 188 void decrease_used(size_t bytes); 189 190 void set_used(size_t bytes); 191 192 // Class that handles archive allocation ranges. 193 G1ArchiveAllocator* _archive_allocator; 194 195 // Statistics for each allocation context 196 AllocationContextStats _allocation_context_stats; 197 198 // GC allocation statistics policy for survivors. 199 G1EvacStats _survivor_evac_stats; 200 201 // GC allocation statistics policy for tenured objects. 202 G1EvacStats _old_evac_stats; 203 204 // It specifies whether we should attempt to expand the heap after a 205 // region allocation failure. If heap expansion fails we set this to 206 // false so that we don't re-attempt the heap expansion (it's likely 207 // that subsequent expansion attempts will also fail if one fails). 208 // Currently, it is only consulted during GC and it's reset at the 209 // start of each GC. 210 bool _expand_heap_after_alloc_failure; 211 212 // Helper for monitoring and management support. 213 G1MonitoringSupport* _g1mm; 214 215 // Records whether the region at the given index is (still) a 216 // candidate for eager reclaim. Only valid for humongous start 217 // regions; other regions have unspecified values. Humongous start 218 // regions are initialized at start of collection pause, with 219 // candidates removed from the set as they are found reachable from 220 // roots or the young generation. 221 class HumongousReclaimCandidates : public G1BiasedMappedArray<bool> { 222 protected: 223 bool default_value() const { return false; } 224 public: 225 void clear() { G1BiasedMappedArray<bool>::clear(); } 226 void set_candidate(uint region, bool value) { 227 set_by_index(region, value); 228 } 229 bool is_candidate(uint region) { 230 return get_by_index(region); 231 } 232 }; 233 234 HumongousReclaimCandidates _humongous_reclaim_candidates; 235 // Stores whether during humongous object registration we found candidate regions. 236 // If not, we can skip a few steps. 237 bool _has_humongous_reclaim_candidates; 238 239 volatile unsigned _gc_time_stamp; 240 241 G1HRPrinter _hr_printer; 242 243 // It decides whether an explicit GC should start a concurrent cycle 244 // instead of doing a STW GC. Currently, a concurrent cycle is 245 // explicitly started if: 246 // (a) cause == _gc_locker and +GCLockerInvokesConcurrent, or 247 // (b) cause == _g1_humongous_allocation 248 // These are defined in user_requested_concurrent_full_gc() because 249 // these sometimes need to be treated differently: 250 // (c) cause == _java_lang_system_gc and +ExplicitGCInvokesConcurrent. 251 // (d) cause == _dcmd_gc_run and +ExplicitGCInvokesConcurrent. 252 // (e) cause == _update_allocation_context_stats_inc 253 // (f) cause == _wb_conc_mark 254 bool should_do_concurrent_full_gc(GCCause::Cause cause); 255 256 // indicates whether we are in young or mixed GC mode 257 G1CollectorState _collector_state; 258 259 // Keeps track of how many "old marking cycles" (i.e., Full GCs or 260 // concurrent cycles) we have started. 261 volatile uint _old_marking_cycles_started; 262 263 // Keeps track of how many "old marking cycles" (i.e., Full GCs or 264 // concurrent cycles) we have completed. 265 volatile uint _old_marking_cycles_completed; 266 267 bool _heap_summary_sent; 268 269 // This is a non-product method that is helpful for testing. It is 270 // called at the end of a GC and artificially expands the heap by 271 // allocating a number of dead regions. This way we can induce very 272 // frequent marking cycles and stress the cleanup / concurrent 273 // cleanup code more (as all the regions that will be allocated by 274 // this method will be found dead by the marking cycle). 275 void allocate_dummy_regions() PRODUCT_RETURN; 276 277 // Clear RSets after a compaction. It also resets the GC time stamps. 278 void clear_rsets_post_compaction(); 279 280 // If the HR printer is active, dump the state of the regions in the 281 // heap after a compaction. 282 void print_hrm_post_compaction(); 283 284 // Create a memory mapper for auxiliary data structures of the given size and 285 // translation factor. 286 static G1RegionToSpaceMapper* create_aux_memory_mapper(const char* description, 287 size_t size, 288 size_t translation_factor); 289 290 double verify(bool guard, const char* msg); 291 void verify_before_gc(); 292 void verify_after_gc(); 293 294 void log_gc_header(); 295 void log_gc_footer(double pause_time_sec); 296 297 void trace_heap(GCWhen::Type when, const GCTracer* tracer); 298 299 // These are macros so that, if the assert fires, we get the correct 300 // line number, file, etc. 301 302 #define heap_locking_asserts_params(_extra_message_) \ 303 "%s : Heap_lock locked: %s, at safepoint: %s, is VM thread: %s", \ 304 (_extra_message_), \ 305 BOOL_TO_STR(Heap_lock->owned_by_self()), \ 306 BOOL_TO_STR(SafepointSynchronize::is_at_safepoint()), \ 307 BOOL_TO_STR(Thread::current()->is_VM_thread()) 308 309 #define assert_heap_locked() \ 310 do { \ 311 assert(Heap_lock->owned_by_self(), \ 312 heap_locking_asserts_params("should be holding the Heap_lock")); \ 313 } while (0) 314 315 #define assert_heap_locked_or_at_safepoint(_should_be_vm_thread_) \ 316 do { \ 317 assert(Heap_lock->owned_by_self() || \ 318 (SafepointSynchronize::is_at_safepoint() && \ 319 ((_should_be_vm_thread_) == Thread::current()->is_VM_thread())), \ 320 heap_locking_asserts_params("should be holding the Heap_lock or " \ 321 "should be at a safepoint")); \ 322 } while (0) 323 324 #define assert_heap_locked_and_not_at_safepoint() \ 325 do { \ 326 assert(Heap_lock->owned_by_self() && \ 327 !SafepointSynchronize::is_at_safepoint(), \ 328 heap_locking_asserts_params("should be holding the Heap_lock and " \ 329 "should not be at a safepoint")); \ 330 } while (0) 331 332 #define assert_heap_not_locked() \ 333 do { \ 334 assert(!Heap_lock->owned_by_self(), \ 335 heap_locking_asserts_params("should not be holding the Heap_lock")); \ 336 } while (0) 337 338 #define assert_heap_not_locked_and_not_at_safepoint() \ 339 do { \ 340 assert(!Heap_lock->owned_by_self() && \ 341 !SafepointSynchronize::is_at_safepoint(), \ 342 heap_locking_asserts_params("should not be holding the Heap_lock and " \ 343 "should not be at a safepoint")); \ 344 } while (0) 345 346 #define assert_at_safepoint(_should_be_vm_thread_) \ 347 do { \ 348 assert(SafepointSynchronize::is_at_safepoint() && \ 349 ((_should_be_vm_thread_) == Thread::current()->is_VM_thread()), \ 350 heap_locking_asserts_params("should be at a safepoint")); \ 351 } while (0) 352 353 #define assert_not_at_safepoint() \ 354 do { \ 355 assert(!SafepointSynchronize::is_at_safepoint(), \ 356 heap_locking_asserts_params("should not be at a safepoint")); \ 357 } while (0) 358 359 protected: 360 361 // The young region list. 362 YoungList* _young_list; 363 364 // The current policy object for the collector. 365 G1CollectorPolicy* _g1_policy; 366 367 // This is the second level of trying to allocate a new region. If 368 // new_region() didn't find a region on the free_list, this call will 369 // check whether there's anything available on the 370 // secondary_free_list and/or wait for more regions to appear on 371 // that list, if _free_regions_coming is set. 372 HeapRegion* new_region_try_secondary_free_list(bool is_old); 373 374 // Try to allocate a single non-humongous HeapRegion sufficient for 375 // an allocation of the given word_size. If do_expand is true, 376 // attempt to expand the heap if necessary to satisfy the allocation 377 // request. If the region is to be used as an old region or for a 378 // humongous object, set is_old to true. If not, to false. 379 HeapRegion* new_region(size_t word_size, bool is_old, bool do_expand); 380 381 // Initialize a contiguous set of free regions of length num_regions 382 // and starting at index first so that they appear as a single 383 // humongous region. 384 HeapWord* humongous_obj_allocate_initialize_regions(uint first, 385 uint num_regions, 386 size_t word_size, 387 AllocationContext_t context); 388 389 // Attempt to allocate a humongous object of the given size. Return 390 // NULL if unsuccessful. 391 HeapWord* humongous_obj_allocate(size_t word_size, AllocationContext_t context); 392 393 // The following two methods, allocate_new_tlab() and 394 // mem_allocate(), are the two main entry points from the runtime 395 // into the G1's allocation routines. They have the following 396 // assumptions: 397 // 398 // * They should both be called outside safepoints. 399 // 400 // * They should both be called without holding the Heap_lock. 401 // 402 // * All allocation requests for new TLABs should go to 403 // allocate_new_tlab(). 404 // 405 // * All non-TLAB allocation requests should go to mem_allocate(). 406 // 407 // * If either call cannot satisfy the allocation request using the 408 // current allocating region, they will try to get a new one. If 409 // this fails, they will attempt to do an evacuation pause and 410 // retry the allocation. 411 // 412 // * If all allocation attempts fail, even after trying to schedule 413 // an evacuation pause, allocate_new_tlab() will return NULL, 414 // whereas mem_allocate() will attempt a heap expansion and/or 415 // schedule a Full GC. 416 // 417 // * We do not allow humongous-sized TLABs. So, allocate_new_tlab 418 // should never be called with word_size being humongous. All 419 // humongous allocation requests should go to mem_allocate() which 420 // will satisfy them with a special path. 421 422 virtual HeapWord* allocate_new_tlab(size_t word_size); 423 424 virtual HeapWord* mem_allocate(size_t word_size, 425 bool* gc_overhead_limit_was_exceeded); 426 427 // The following three methods take a gc_count_before_ret 428 // parameter which is used to return the GC count if the method 429 // returns NULL. Given that we are required to read the GC count 430 // while holding the Heap_lock, and these paths will take the 431 // Heap_lock at some point, it's easier to get them to read the GC 432 // count while holding the Heap_lock before they return NULL instead 433 // of the caller (namely: mem_allocate()) having to also take the 434 // Heap_lock just to read the GC count. 435 436 // First-level mutator allocation attempt: try to allocate out of 437 // the mutator alloc region without taking the Heap_lock. This 438 // should only be used for non-humongous allocations. 439 inline HeapWord* attempt_allocation(size_t word_size, 440 uint* gc_count_before_ret, 441 uint* gclocker_retry_count_ret); 442 443 // Second-level mutator allocation attempt: take the Heap_lock and 444 // retry the allocation attempt, potentially scheduling a GC 445 // pause. This should only be used for non-humongous allocations. 446 HeapWord* attempt_allocation_slow(size_t word_size, 447 AllocationContext_t context, 448 uint* gc_count_before_ret, 449 uint* gclocker_retry_count_ret); 450 451 // Takes the Heap_lock and attempts a humongous allocation. It can 452 // potentially schedule a GC pause. 453 HeapWord* attempt_allocation_humongous(size_t word_size, 454 uint* gc_count_before_ret, 455 uint* gclocker_retry_count_ret); 456 457 // Allocation attempt that should be called during safepoints (e.g., 458 // at the end of a successful GC). expect_null_mutator_alloc_region 459 // specifies whether the mutator alloc region is expected to be NULL 460 // or not. 461 HeapWord* attempt_allocation_at_safepoint(size_t word_size, 462 AllocationContext_t context, 463 bool expect_null_mutator_alloc_region); 464 465 // These methods are the "callbacks" from the G1AllocRegion class. 466 467 // For mutator alloc regions. 468 HeapRegion* new_mutator_alloc_region(size_t word_size, bool force); 469 void retire_mutator_alloc_region(HeapRegion* alloc_region, 470 size_t allocated_bytes); 471 472 // For GC alloc regions. 473 HeapRegion* new_gc_alloc_region(size_t word_size, uint count, 474 InCSetState dest); 475 void retire_gc_alloc_region(HeapRegion* alloc_region, 476 size_t allocated_bytes, InCSetState dest); 477 478 // - if explicit_gc is true, the GC is for a System.gc() etc, 479 // otherwise it's for a failed allocation. 480 // - if clear_all_soft_refs is true, all soft references should be 481 // cleared during the GC. 482 // - it returns false if it is unable to do the collection due to the 483 // GC locker being active, true otherwise. 484 bool do_full_collection(bool explicit_gc, 485 bool clear_all_soft_refs); 486 487 // Callback from VM_G1CollectFull operation, or collect_as_vm_thread. 488 virtual void do_full_collection(bool clear_all_soft_refs); 489 490 // Resize the heap if necessary after a full collection. 491 void resize_if_necessary_after_full_collection(); 492 493 // Callback from VM_G1CollectForAllocation operation. 494 // This function does everything necessary/possible to satisfy a 495 // failed allocation request (including collection, expansion, etc.) 496 HeapWord* satisfy_failed_allocation(size_t word_size, 497 AllocationContext_t context, 498 bool* succeeded); 499 private: 500 // Helper method for satisfy_failed_allocation() 501 HeapWord* satisfy_failed_allocation_helper(size_t word_size, 502 AllocationContext_t context, 503 bool do_gc, 504 bool clear_all_soft_refs, 505 bool expect_null_mutator_alloc_region, 506 bool* gc_succeeded); 507 508 protected: 509 // Attempting to expand the heap sufficiently 510 // to support an allocation of the given "word_size". If 511 // successful, perform the allocation and return the address of the 512 // allocated block, or else "NULL". 513 HeapWord* expand_and_allocate(size_t word_size, AllocationContext_t context); 514 515 // Process any reference objects discovered during 516 // an incremental evacuation pause. 517 void process_discovered_references(G1ParScanThreadStateSet* per_thread_states); 518 519 // Enqueue any remaining discovered references 520 // after processing. 521 void enqueue_discovered_references(G1ParScanThreadStateSet* per_thread_states); 522 523 public: 524 WorkGang* workers() const { return _workers; } 525 526 G1Allocator* allocator() { 527 return _allocator; 528 } 529 530 G1MonitoringSupport* g1mm() { 531 assert(_g1mm != NULL, "should have been initialized"); 532 return _g1mm; 533 } 534 535 // Expand the garbage-first heap by at least the given size (in bytes!). 536 // Returns true if the heap was expanded by the requested amount; 537 // false otherwise. 538 // (Rounds up to a HeapRegion boundary.) 539 bool expand(size_t expand_bytes, double* expand_time_ms = NULL); 540 541 // Returns the PLAB statistics for a given destination. 542 inline G1EvacStats* alloc_buffer_stats(InCSetState dest); 543 544 // Determines PLAB size for a given destination. 545 inline size_t desired_plab_sz(InCSetState dest); 546 547 inline AllocationContextStats& allocation_context_stats(); 548 549 // Do anything common to GC's. 550 void gc_prologue(bool full); 551 void gc_epilogue(bool full); 552 553 // Modify the reclaim candidate set and test for presence. 554 // These are only valid for starts_humongous regions. 555 inline void set_humongous_reclaim_candidate(uint region, bool value); 556 inline bool is_humongous_reclaim_candidate(uint region); 557 558 // Remove from the reclaim candidate set. Also remove from the 559 // collection set so that later encounters avoid the slow path. 560 inline void set_humongous_is_live(oop obj); 561 562 // Register the given region to be part of the collection set. 563 inline void register_humongous_region_with_cset(uint index); 564 // Register regions with humongous objects (actually on the start region) in 565 // the in_cset_fast_test table. 566 void register_humongous_regions_with_cset(); 567 // We register a region with the fast "in collection set" test. We 568 // simply set to true the array slot corresponding to this region. 569 void register_young_region_with_cset(HeapRegion* r) { 570 _in_cset_fast_test.set_in_young(r->hrm_index()); 571 } 572 void register_old_region_with_cset(HeapRegion* r) { 573 _in_cset_fast_test.set_in_old(r->hrm_index()); 574 } 575 void clear_in_cset(const HeapRegion* hr) { 576 _in_cset_fast_test.clear(hr); 577 } 578 579 void clear_cset_fast_test() { 580 _in_cset_fast_test.clear(); 581 } 582 583 // A complement to should_do_concurrent_full_gc. GCs caused 584 // by a user sometimes needs to be treated differently 585 // from those caused by the VM. 586 bool user_requested_concurrent_full_gc(GCCause::Cause cause); 587 588 // This is called at the start of either a concurrent cycle or a Full 589 // GC to update the number of old marking cycles started. 590 void increment_old_marking_cycles_started(); 591 592 // This is called at the end of either a concurrent cycle or a Full 593 // GC to update the number of old marking cycles completed. Those two 594 // can happen in a nested fashion, i.e., we start a concurrent 595 // cycle, a Full GC happens half-way through it which ends first, 596 // and then the cycle notices that a Full GC happened and ends 597 // too. The concurrent parameter is a boolean to help us do a bit 598 // tighter consistency checking in the method. If concurrent is 599 // false, the caller is the inner caller in the nesting (i.e., the 600 // Full GC). If concurrent is true, the caller is the outer caller 601 // in this nesting (i.e., the concurrent cycle). Further nesting is 602 // not currently supported. The end of this call also notifies 603 // the FullGCCount_lock in case a Java thread is waiting for a full 604 // GC to happen (e.g., it called System.gc() with 605 // +ExplicitGCInvokesConcurrent). 606 void increment_old_marking_cycles_completed(bool concurrent); 607 608 uint old_marking_cycles_completed() { 609 return _old_marking_cycles_completed; 610 } 611 612 void register_concurrent_cycle_start(const Ticks& start_time); 613 void register_concurrent_cycle_end(); 614 void trace_heap_after_concurrent_cycle(); 615 616 G1HRPrinter* hr_printer() { return &_hr_printer; } 617 618 // Allocates a new heap region instance. 619 HeapRegion* new_heap_region(uint hrs_index, MemRegion mr); 620 621 // Allocate the highest free region in the reserved heap. This will commit 622 // regions as necessary. 623 HeapRegion* alloc_highest_free_region(); 624 625 // Frees a non-humongous region by initializing its contents and 626 // adding it to the free list that's passed as a parameter (this is 627 // usually a local list which will be appended to the master free 628 // list later). The used bytes of freed regions are accumulated in 629 // pre_used. If par is true, the region's RSet will not be freed 630 // up. The assumption is that this will be done later. 631 // The locked parameter indicates if the caller has already taken 632 // care of proper synchronization. This may allow some optimizations. 633 void free_region(HeapRegion* hr, 634 FreeRegionList* free_list, 635 bool par, 636 bool locked = false); 637 638 // It dirties the cards that cover the block so that the post 639 // write barrier never queues anything when updating objects on this 640 // block. It is assumed (and in fact we assert) that the block 641 // belongs to a young region. 642 inline void dirty_young_block(HeapWord* start, size_t word_size); 643 644 // Frees a humongous region by collapsing it into individual regions 645 // and calling free_region() for each of them. The freed regions 646 // will be added to the free list that's passed as a parameter (this 647 // is usually a local list which will be appended to the master free 648 // list later). The used bytes of freed regions are accumulated in 649 // pre_used. If par is true, the region's RSet will not be freed 650 // up. The assumption is that this will be done later. 651 void free_humongous_region(HeapRegion* hr, 652 FreeRegionList* free_list, 653 bool par); 654 655 // Facility for allocating in 'archive' regions in high heap memory and 656 // recording the allocated ranges. These should all be called from the 657 // VM thread at safepoints, without the heap lock held. They can be used 658 // to create and archive a set of heap regions which can be mapped at the 659 // same fixed addresses in a subsequent JVM invocation. 660 void begin_archive_alloc_range(); 661 662 // Check if the requested size would be too large for an archive allocation. 663 bool is_archive_alloc_too_large(size_t word_size); 664 665 // Allocate memory of the requested size from the archive region. This will 666 // return NULL if the size is too large or if no memory is available. It 667 // does not trigger a garbage collection. 668 HeapWord* archive_mem_allocate(size_t word_size); 669 670 // Optionally aligns the end address and returns the allocated ranges in 671 // an array of MemRegions in order of ascending addresses. 672 void end_archive_alloc_range(GrowableArray<MemRegion>* ranges, 673 size_t end_alignment_in_bytes = 0); 674 675 // Facility for allocating a fixed range within the heap and marking 676 // the containing regions as 'archive'. For use at JVM init time, when the 677 // caller may mmap archived heap data at the specified range(s). 678 // Verify that the MemRegions specified in the argument array are within the 679 // reserved heap. 680 bool check_archive_addresses(MemRegion* range, size_t count); 681 682 // Commit the appropriate G1 regions containing the specified MemRegions 683 // and mark them as 'archive' regions. The regions in the array must be 684 // non-overlapping and in order of ascending address. 685 bool alloc_archive_regions(MemRegion* range, size_t count); 686 687 // Insert any required filler objects in the G1 regions around the specified 688 // ranges to make the regions parseable. This must be called after 689 // alloc_archive_regions, and after class loading has occurred. 690 void fill_archive_regions(MemRegion* range, size_t count); 691 692 // For each of the specified MemRegions, uncommit the containing G1 regions 693 // which had been allocated by alloc_archive_regions. This should be called 694 // rather than fill_archive_regions at JVM init time if the archive file 695 // mapping failed, with the same non-overlapping and sorted MemRegion array. 696 void dealloc_archive_regions(MemRegion* range, size_t count); 697 698 protected: 699 700 // Shrink the garbage-first heap by at most the given size (in bytes!). 701 // (Rounds down to a HeapRegion boundary.) 702 virtual void shrink(size_t expand_bytes); 703 void shrink_helper(size_t expand_bytes); 704 705 #if TASKQUEUE_STATS 706 static void print_taskqueue_stats_hdr(outputStream* const st = gclog_or_tty); 707 void print_taskqueue_stats(outputStream* const st = gclog_or_tty) const; 708 void reset_taskqueue_stats(); 709 #endif // TASKQUEUE_STATS 710 711 // Schedule the VM operation that will do an evacuation pause to 712 // satisfy an allocation request of word_size. *succeeded will 713 // return whether the VM operation was successful (it did do an 714 // evacuation pause) or not (another thread beat us to it or the GC 715 // locker was active). Given that we should not be holding the 716 // Heap_lock when we enter this method, we will pass the 717 // gc_count_before (i.e., total_collections()) as a parameter since 718 // it has to be read while holding the Heap_lock. Currently, both 719 // methods that call do_collection_pause() release the Heap_lock 720 // before the call, so it's easy to read gc_count_before just before. 721 HeapWord* do_collection_pause(size_t word_size, 722 uint gc_count_before, 723 bool* succeeded, 724 GCCause::Cause gc_cause); 725 726 void wait_for_root_region_scanning(); 727 728 // The guts of the incremental collection pause, executed by the vm 729 // thread. It returns false if it is unable to do the collection due 730 // to the GC locker being active, true otherwise 731 bool do_collection_pause_at_safepoint(double target_pause_time_ms); 732 733 // Actually do the work of evacuating the collection set. 734 virtual void evacuate_collection_set(EvacuationInfo& evacuation_info, G1ParScanThreadStateSet* per_thread_states); 735 736 void pre_evacuate_collection_set(); 737 void post_evacuate_collection_set(EvacuationInfo& evacuation_info, G1ParScanThreadStateSet* pss); 738 739 // Print the header for the per-thread termination statistics. 740 static void print_termination_stats_hdr(outputStream* const st); 741 // Print actual per-thread termination statistics. 742 void print_termination_stats(outputStream* const st, 743 uint worker_id, 744 double elapsed_ms, 745 double strong_roots_ms, 746 double term_ms, 747 size_t term_attempts, 748 size_t alloc_buffer_waste, 749 size_t undo_waste) const; 750 // Update object copying statistics. 751 void record_obj_copy_mem_stats(); 752 753 // The g1 remembered set of the heap. 754 G1RemSet* _g1_rem_set; 755 756 // A set of cards that cover the objects for which the Rsets should be updated 757 // concurrently after the collection. 758 DirtyCardQueueSet _dirty_card_queue_set; 759 760 // The closure used to refine a single card. 761 RefineCardTableEntryClosure* _refine_cte_cl; 762 763 // After a collection pause, make the regions in the CS into free 764 // regions. 765 void free_collection_set(HeapRegion* cs_head, EvacuationInfo& evacuation_info, const size_t* surviving_young_words); 766 767 // Abandon the current collection set without recording policy 768 // statistics or updating free lists. 769 void abandon_collection_set(HeapRegion* cs_head); 770 771 // The concurrent marker (and the thread it runs in.) 772 ConcurrentMark* _cm; 773 ConcurrentMarkThread* _cmThread; 774 775 // The concurrent refiner. 776 ConcurrentG1Refine* _cg1r; 777 778 // The parallel task queues 779 RefToScanQueueSet *_task_queues; 780 781 // True iff a evacuation has failed in the current collection. 782 bool _evacuation_failed; 783 784 EvacuationFailedInfo* _evacuation_failed_info_array; 785 786 // Failed evacuations cause some logical from-space objects to have 787 // forwarding pointers to themselves. Reset them. 788 void remove_self_forwarding_pointers(); 789 790 struct OopAndMarkOop { 791 private: 792 oop _o; 793 markOop _m; 794 public: 795 OopAndMarkOop(oop obj, markOop m) : _o(obj), _m(m) { 796 } 797 798 void set_mark() { 799 _o->set_mark(_m); 800 } 801 }; 802 803 typedef Stack<OopAndMarkOop,mtGC> OopAndMarkOopStack; 804 // Stores marks with the corresponding oop that we need to preserve during evacuation 805 // failure. 806 OopAndMarkOopStack* _preserved_objs; 807 808 // Preserve the mark of "obj", if necessary, in preparation for its mark 809 // word being overwritten with a self-forwarding-pointer. 810 void preserve_mark_during_evac_failure(uint worker_id, oop obj, markOop m); 811 812 #ifndef PRODUCT 813 // Support for forcing evacuation failures. Analogous to 814 // PromotionFailureALot for the other collectors. 815 816 // Records whether G1EvacuationFailureALot should be in effect 817 // for the current GC 818 bool _evacuation_failure_alot_for_current_gc; 819 820 // Used to record the GC number for interval checking when 821 // determining whether G1EvaucationFailureALot is in effect 822 // for the current GC. 823 size_t _evacuation_failure_alot_gc_number; 824 825 // Count of the number of evacuations between failures. 826 volatile size_t _evacuation_failure_alot_count; 827 828 // Set whether G1EvacuationFailureALot should be in effect 829 // for the current GC (based upon the type of GC and which 830 // command line flags are set); 831 inline bool evacuation_failure_alot_for_gc_type(bool gcs_are_young, 832 bool during_initial_mark, 833 bool during_marking); 834 835 inline void set_evacuation_failure_alot_for_current_gc(); 836 837 // Return true if it's time to cause an evacuation failure. 838 inline bool evacuation_should_fail(); 839 840 // Reset the G1EvacuationFailureALot counters. Should be called at 841 // the end of an evacuation pause in which an evacuation failure occurred. 842 inline void reset_evacuation_should_fail(); 843 #endif // !PRODUCT 844 845 // ("Weak") Reference processing support. 846 // 847 // G1 has 2 instances of the reference processor class. One 848 // (_ref_processor_cm) handles reference object discovery 849 // and subsequent processing during concurrent marking cycles. 850 // 851 // The other (_ref_processor_stw) handles reference object 852 // discovery and processing during full GCs and incremental 853 // evacuation pauses. 854 // 855 // During an incremental pause, reference discovery will be 856 // temporarily disabled for _ref_processor_cm and will be 857 // enabled for _ref_processor_stw. At the end of the evacuation 858 // pause references discovered by _ref_processor_stw will be 859 // processed and discovery will be disabled. The previous 860 // setting for reference object discovery for _ref_processor_cm 861 // will be re-instated. 862 // 863 // At the start of marking: 864 // * Discovery by the CM ref processor is verified to be inactive 865 // and it's discovered lists are empty. 866 // * Discovery by the CM ref processor is then enabled. 867 // 868 // At the end of marking: 869 // * Any references on the CM ref processor's discovered 870 // lists are processed (possibly MT). 871 // 872 // At the start of full GC we: 873 // * Disable discovery by the CM ref processor and 874 // empty CM ref processor's discovered lists 875 // (without processing any entries). 876 // * Verify that the STW ref processor is inactive and it's 877 // discovered lists are empty. 878 // * Temporarily set STW ref processor discovery as single threaded. 879 // * Temporarily clear the STW ref processor's _is_alive_non_header 880 // field. 881 // * Finally enable discovery by the STW ref processor. 882 // 883 // The STW ref processor is used to record any discovered 884 // references during the full GC. 885 // 886 // At the end of a full GC we: 887 // * Enqueue any reference objects discovered by the STW ref processor 888 // that have non-live referents. This has the side-effect of 889 // making the STW ref processor inactive by disabling discovery. 890 // * Verify that the CM ref processor is still inactive 891 // and no references have been placed on it's discovered 892 // lists (also checked as a precondition during initial marking). 893 894 // The (stw) reference processor... 895 ReferenceProcessor* _ref_processor_stw; 896 897 STWGCTimer* _gc_timer_stw; 898 ConcurrentGCTimer* _gc_timer_cm; 899 900 G1OldTracer* _gc_tracer_cm; 901 G1NewTracer* _gc_tracer_stw; 902 903 // During reference object discovery, the _is_alive_non_header 904 // closure (if non-null) is applied to the referent object to 905 // determine whether the referent is live. If so then the 906 // reference object does not need to be 'discovered' and can 907 // be treated as a regular oop. This has the benefit of reducing 908 // the number of 'discovered' reference objects that need to 909 // be processed. 910 // 911 // Instance of the is_alive closure for embedding into the 912 // STW reference processor as the _is_alive_non_header field. 913 // Supplying a value for the _is_alive_non_header field is 914 // optional but doing so prevents unnecessary additions to 915 // the discovered lists during reference discovery. 916 G1STWIsAliveClosure _is_alive_closure_stw; 917 918 // The (concurrent marking) reference processor... 919 ReferenceProcessor* _ref_processor_cm; 920 921 // Instance of the concurrent mark is_alive closure for embedding 922 // into the Concurrent Marking reference processor as the 923 // _is_alive_non_header field. Supplying a value for the 924 // _is_alive_non_header field is optional but doing so prevents 925 // unnecessary additions to the discovered lists during reference 926 // discovery. 927 G1CMIsAliveClosure _is_alive_closure_cm; 928 929 // Cache used by G1CollectedHeap::start_cset_region_for_worker(). 930 HeapRegion** _worker_cset_start_region; 931 932 // Time stamp to validate the regions recorded in the cache 933 // used by G1CollectedHeap::start_cset_region_for_worker(). 934 // The heap region entry for a given worker is valid iff 935 // the associated time stamp value matches the current value 936 // of G1CollectedHeap::_gc_time_stamp. 937 uint* _worker_cset_start_region_time_stamp; 938 939 volatile bool _free_regions_coming; 940 941 public: 942 943 void set_refine_cte_cl_concurrency(bool concurrent); 944 945 RefToScanQueue *task_queue(uint i) const; 946 947 uint num_task_queues() const; 948 949 // A set of cards where updates happened during the GC 950 DirtyCardQueueSet& dirty_card_queue_set() { return _dirty_card_queue_set; } 951 952 // Create a G1CollectedHeap with the specified policy. 953 // Must call the initialize method afterwards. 954 // May not return if something goes wrong. 955 G1CollectedHeap(G1CollectorPolicy* policy); 956 957 // Initialize the G1CollectedHeap to have the initial and 958 // maximum sizes and remembered and barrier sets 959 // specified by the policy object. 960 jint initialize(); 961 962 virtual void stop(); 963 964 // Return the (conservative) maximum heap alignment for any G1 heap 965 static size_t conservative_max_heap_alignment(); 966 967 // Does operations required after initialization has been done. 968 void post_initialize(); 969 970 // Initialize weak reference processing. 971 void ref_processing_init(); 972 973 virtual Name kind() const { 974 return CollectedHeap::G1CollectedHeap; 975 } 976 977 const G1CollectorState* collector_state() const { return &_collector_state; } 978 G1CollectorState* collector_state() { return &_collector_state; } 979 980 // The current policy object for the collector. 981 G1CollectorPolicy* g1_policy() const { return _g1_policy; } 982 983 virtual CollectorPolicy* collector_policy() const; 984 985 // Adaptive size policy. No such thing for g1. 986 virtual AdaptiveSizePolicy* size_policy() { return NULL; } 987 988 // The rem set and barrier set. 989 G1RemSet* g1_rem_set() const { return _g1_rem_set; } 990 991 unsigned get_gc_time_stamp() { 992 return _gc_time_stamp; 993 } 994 995 inline void reset_gc_time_stamp(); 996 997 void check_gc_time_stamps() PRODUCT_RETURN; 998 999 inline void increment_gc_time_stamp(); 1000 1001 // Reset the given region's GC timestamp. If it's starts humongous, 1002 // also reset the GC timestamp of its corresponding 1003 // continues humongous regions too. 1004 void reset_gc_time_stamps(HeapRegion* hr); 1005 1006 // Apply the given closure on all cards in the Hot Card Cache, emptying it. 1007 void iterate_hcc_closure(CardTableEntryClosure* cl, uint worker_i); 1008 1009 // Apply the given closure on all cards in the Dirty Card Queue Set, emptying it. 1010 void iterate_dirty_card_closure(CardTableEntryClosure* cl, uint worker_i); 1011 1012 // The shared block offset table array. 1013 G1BlockOffsetSharedArray* bot_shared() const { return _bot_shared; } 1014 1015 // Reference Processing accessors 1016 1017 // The STW reference processor.... 1018 ReferenceProcessor* ref_processor_stw() const { return _ref_processor_stw; } 1019 1020 G1NewTracer* gc_tracer_stw() const { return _gc_tracer_stw; } 1021 1022 // The Concurrent Marking reference processor... 1023 ReferenceProcessor* ref_processor_cm() const { return _ref_processor_cm; } 1024 1025 ConcurrentGCTimer* gc_timer_cm() const { return _gc_timer_cm; } 1026 G1OldTracer* gc_tracer_cm() const { return _gc_tracer_cm; } 1027 1028 virtual size_t capacity() const; 1029 virtual size_t used() const; 1030 // This should be called when we're not holding the heap lock. The 1031 // result might be a bit inaccurate. 1032 size_t used_unlocked() const; 1033 size_t recalculate_used() const; 1034 1035 // These virtual functions do the actual allocation. 1036 // Some heaps may offer a contiguous region for shared non-blocking 1037 // allocation, via inlined code (by exporting the address of the top and 1038 // end fields defining the extent of the contiguous allocation region.) 1039 // But G1CollectedHeap doesn't yet support this. 1040 1041 virtual bool is_maximal_no_gc() const { 1042 return _hrm.available() == 0; 1043 } 1044 1045 // The current number of regions in the heap. 1046 uint num_regions() const { return _hrm.length(); } 1047 1048 // The max number of regions in the heap. 1049 uint max_regions() const { return _hrm.max_length(); } 1050 1051 // The number of regions that are completely free. 1052 uint num_free_regions() const { return _hrm.num_free_regions(); } 1053 1054 MemoryUsage get_auxiliary_data_memory_usage() const { 1055 return _hrm.get_auxiliary_data_memory_usage(); 1056 } 1057 1058 // The number of regions that are not completely free. 1059 uint num_used_regions() const { return num_regions() - num_free_regions(); } 1060 1061 void verify_not_dirty_region(HeapRegion* hr) PRODUCT_RETURN; 1062 void verify_dirty_region(HeapRegion* hr) PRODUCT_RETURN; 1063 void verify_dirty_young_list(HeapRegion* head) PRODUCT_RETURN; 1064 void verify_dirty_young_regions() PRODUCT_RETURN; 1065 1066 #ifndef PRODUCT 1067 // Make sure that the given bitmap has no marked objects in the 1068 // range [from,limit). If it does, print an error message and return 1069 // false. Otherwise, just return true. bitmap_name should be "prev" 1070 // or "next". 1071 bool verify_no_bits_over_tams(const char* bitmap_name, CMBitMapRO* bitmap, 1072 HeapWord* from, HeapWord* limit); 1073 1074 // Verify that the prev / next bitmap range [tams,end) for the given 1075 // region has no marks. Return true if all is well, false if errors 1076 // are detected. 1077 bool verify_bitmaps(const char* caller, HeapRegion* hr); 1078 #endif // PRODUCT 1079 1080 // If G1VerifyBitmaps is set, verify that the marking bitmaps for 1081 // the given region do not have any spurious marks. If errors are 1082 // detected, print appropriate error messages and crash. 1083 void check_bitmaps(const char* caller, HeapRegion* hr) PRODUCT_RETURN; 1084 1085 // If G1VerifyBitmaps is set, verify that the marking bitmaps do not 1086 // have any spurious marks. If errors are detected, print 1087 // appropriate error messages and crash. 1088 void check_bitmaps(const char* caller) PRODUCT_RETURN; 1089 1090 // Do sanity check on the contents of the in-cset fast test table. 1091 bool check_cset_fast_test() PRODUCT_RETURN_( return true; ); 1092 1093 // verify_region_sets() performs verification over the region 1094 // lists. It will be compiled in the product code to be used when 1095 // necessary (i.e., during heap verification). 1096 void verify_region_sets(); 1097 1098 // verify_region_sets_optional() is planted in the code for 1099 // list verification in non-product builds (and it can be enabled in 1100 // product builds by defining HEAP_REGION_SET_FORCE_VERIFY to be 1). 1101 #if HEAP_REGION_SET_FORCE_VERIFY 1102 void verify_region_sets_optional() { 1103 verify_region_sets(); 1104 } 1105 #else // HEAP_REGION_SET_FORCE_VERIFY 1106 void verify_region_sets_optional() { } 1107 #endif // HEAP_REGION_SET_FORCE_VERIFY 1108 1109 #ifdef ASSERT 1110 bool is_on_master_free_list(HeapRegion* hr) { 1111 return _hrm.is_free(hr); 1112 } 1113 #endif // ASSERT 1114 1115 // Wrapper for the region list operations that can be called from 1116 // methods outside this class. 1117 1118 void secondary_free_list_add(FreeRegionList* list) { 1119 _secondary_free_list.add_ordered(list); 1120 } 1121 1122 void append_secondary_free_list() { 1123 _hrm.insert_list_into_free_list(&_secondary_free_list); 1124 } 1125 1126 void append_secondary_free_list_if_not_empty_with_lock() { 1127 // If the secondary free list looks empty there's no reason to 1128 // take the lock and then try to append it. 1129 if (!_secondary_free_list.is_empty()) { 1130 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag); 1131 append_secondary_free_list(); 1132 } 1133 } 1134 1135 inline void old_set_add(HeapRegion* hr); 1136 inline void old_set_remove(HeapRegion* hr); 1137 1138 size_t non_young_capacity_bytes() { 1139 return _old_set.total_capacity_bytes() + _humongous_set.total_capacity_bytes(); 1140 } 1141 1142 void set_free_regions_coming(); 1143 void reset_free_regions_coming(); 1144 bool free_regions_coming() { return _free_regions_coming; } 1145 void wait_while_free_regions_coming(); 1146 1147 // Determine whether the given region is one that we are using as an 1148 // old GC alloc region. 1149 bool is_old_gc_alloc_region(HeapRegion* hr); 1150 1151 // Perform a collection of the heap; intended for use in implementing 1152 // "System.gc". This probably implies as full a collection as the 1153 // "CollectedHeap" supports. 1154 virtual void collect(GCCause::Cause cause); 1155 1156 virtual bool copy_allocation_context_stats(const jint* contexts, 1157 jlong* totals, 1158 jbyte* accuracy, 1159 jint len); 1160 1161 // True iff an evacuation has failed in the most-recent collection. 1162 bool evacuation_failed() { return _evacuation_failed; } 1163 1164 void remove_from_old_sets(const HeapRegionSetCount& old_regions_removed, const HeapRegionSetCount& humongous_regions_removed); 1165 void prepend_to_freelist(FreeRegionList* list); 1166 void decrement_summary_bytes(size_t bytes); 1167 1168 virtual bool is_in(const void* p) const; 1169 #ifdef ASSERT 1170 // Returns whether p is in one of the available areas of the heap. Slow but 1171 // extensive version. 1172 bool is_in_exact(const void* p) const; 1173 #endif 1174 1175 // Return "TRUE" iff the given object address is within the collection 1176 // set. Slow implementation. 1177 bool obj_in_cs(oop obj); 1178 1179 inline bool is_in_cset(const HeapRegion *hr); 1180 inline bool is_in_cset(oop obj); 1181 1182 inline bool is_in_cset_or_humongous(const oop obj); 1183 1184 private: 1185 // This array is used for a quick test on whether a reference points into 1186 // the collection set or not. Each of the array's elements denotes whether the 1187 // corresponding region is in the collection set or not. 1188 G1InCSetStateFastTestBiasedMappedArray _in_cset_fast_test; 1189 1190 public: 1191 1192 inline InCSetState in_cset_state(const oop obj); 1193 1194 // Return "TRUE" iff the given object address is in the reserved 1195 // region of g1. 1196 bool is_in_g1_reserved(const void* p) const { 1197 return _hrm.reserved().contains(p); 1198 } 1199 1200 // Returns a MemRegion that corresponds to the space that has been 1201 // reserved for the heap 1202 MemRegion g1_reserved() const { 1203 return _hrm.reserved(); 1204 } 1205 1206 virtual bool is_in_closed_subset(const void* p) const; 1207 1208 G1SATBCardTableLoggingModRefBS* g1_barrier_set() { 1209 return barrier_set_cast<G1SATBCardTableLoggingModRefBS>(barrier_set()); 1210 } 1211 1212 // This resets the card table to all zeros. It is used after 1213 // a collection pause which used the card table to claim cards. 1214 void cleanUpCardTable(); 1215 1216 // Iteration functions. 1217 1218 // Iterate over all objects, calling "cl.do_object" on each. 1219 virtual void object_iterate(ObjectClosure* cl); 1220 1221 virtual void safe_object_iterate(ObjectClosure* cl) { 1222 object_iterate(cl); 1223 } 1224 1225 // Iterate over heap regions, in address order, terminating the 1226 // iteration early if the "doHeapRegion" method returns "true". 1227 void heap_region_iterate(HeapRegionClosure* blk) const; 1228 1229 // Return the region with the given index. It assumes the index is valid. 1230 inline HeapRegion* region_at(uint index) const; 1231 1232 // Return the next region (by index) that is part of the same 1233 // humongous object that hr is part of. 1234 inline HeapRegion* next_region_in_humongous(HeapRegion* hr) const; 1235 1236 // Calculate the region index of the given address. Given address must be 1237 // within the heap. 1238 inline uint addr_to_region(HeapWord* addr) const; 1239 1240 inline HeapWord* bottom_addr_for_region(uint index) const; 1241 1242 // Iterate over the heap regions in parallel. Assumes that this will be called 1243 // in parallel by ParallelGCThreads worker threads with distinct worker ids 1244 // in the range [0..max(ParallelGCThreads-1, 1)]. Applies "blk->doHeapRegion" 1245 // to each of the regions, by attempting to claim the region using the 1246 // HeapRegionClaimer and, if successful, applying the closure to the claimed 1247 // region. The concurrent argument should be set to true if iteration is 1248 // performed concurrently, during which no assumptions are made for consistent 1249 // attributes of the heap regions (as they might be modified while iterating). 1250 void heap_region_par_iterate(HeapRegionClosure* cl, 1251 uint worker_id, 1252 HeapRegionClaimer* hrclaimer, 1253 bool concurrent = false) const; 1254 1255 // Clear the cached cset start regions and (more importantly) 1256 // the time stamps. Called when we reset the GC time stamp. 1257 void clear_cset_start_regions(); 1258 1259 // Given the id of a worker, obtain or calculate a suitable 1260 // starting region for iterating over the current collection set. 1261 HeapRegion* start_cset_region_for_worker(uint worker_i); 1262 1263 // Iterate over the regions (if any) in the current collection set. 1264 void collection_set_iterate(HeapRegionClosure* blk); 1265 1266 // As above but starting from region r 1267 void collection_set_iterate_from(HeapRegion* r, HeapRegionClosure *blk); 1268 1269 HeapRegion* next_compaction_region(const HeapRegion* from) const; 1270 1271 // Returns the HeapRegion that contains addr. addr must not be NULL. 1272 template <class T> 1273 inline HeapRegion* heap_region_containing(const T addr) const; 1274 1275 // A CollectedHeap is divided into a dense sequence of "blocks"; that is, 1276 // each address in the (reserved) heap is a member of exactly 1277 // one block. The defining characteristic of a block is that it is 1278 // possible to find its size, and thus to progress forward to the next 1279 // block. (Blocks may be of different sizes.) Thus, blocks may 1280 // represent Java objects, or they might be free blocks in a 1281 // free-list-based heap (or subheap), as long as the two kinds are 1282 // distinguishable and the size of each is determinable. 1283 1284 // Returns the address of the start of the "block" that contains the 1285 // address "addr". We say "blocks" instead of "object" since some heaps 1286 // may not pack objects densely; a chunk may either be an object or a 1287 // non-object. 1288 virtual HeapWord* block_start(const void* addr) const; 1289 1290 // Requires "addr" to be the start of a chunk, and returns its size. 1291 // "addr + size" is required to be the start of a new chunk, or the end 1292 // of the active area of the heap. 1293 virtual size_t block_size(const HeapWord* addr) const; 1294 1295 // Requires "addr" to be the start of a block, and returns "TRUE" iff 1296 // the block is an object. 1297 virtual bool block_is_obj(const HeapWord* addr) const; 1298 1299 // Section on thread-local allocation buffers (TLABs) 1300 // See CollectedHeap for semantics. 1301 1302 bool supports_tlab_allocation() const; 1303 size_t tlab_capacity(Thread* ignored) const; 1304 size_t tlab_used(Thread* ignored) const; 1305 size_t max_tlab_size() const; 1306 size_t unsafe_max_tlab_alloc(Thread* ignored) const; 1307 1308 // Can a compiler initialize a new object without store barriers? 1309 // This permission only extends from the creation of a new object 1310 // via a TLAB up to the first subsequent safepoint. If such permission 1311 // is granted for this heap type, the compiler promises to call 1312 // defer_store_barrier() below on any slow path allocation of 1313 // a new object for which such initializing store barriers will 1314 // have been elided. G1, like CMS, allows this, but should be 1315 // ready to provide a compensating write barrier as necessary 1316 // if that storage came out of a non-young region. The efficiency 1317 // of this implementation depends crucially on being able to 1318 // answer very efficiently in constant time whether a piece of 1319 // storage in the heap comes from a young region or not. 1320 // See ReduceInitialCardMarks. 1321 virtual bool can_elide_tlab_store_barriers() const { 1322 return true; 1323 } 1324 1325 virtual bool card_mark_must_follow_store() const { 1326 return true; 1327 } 1328 1329 inline bool is_in_young(const oop obj); 1330 1331 virtual bool is_scavengable(const void* addr); 1332 1333 // We don't need barriers for initializing stores to objects 1334 // in the young gen: for the SATB pre-barrier, there is no 1335 // pre-value that needs to be remembered; for the remembered-set 1336 // update logging post-barrier, we don't maintain remembered set 1337 // information for young gen objects. 1338 virtual inline bool can_elide_initializing_store_barrier(oop new_obj); 1339 1340 // Returns "true" iff the given word_size is "very large". 1341 static bool is_humongous(size_t word_size) { 1342 // Note this has to be strictly greater-than as the TLABs 1343 // are capped at the humongous threshold and we want to 1344 // ensure that we don't try to allocate a TLAB as 1345 // humongous and that we don't allocate a humongous 1346 // object in a TLAB. 1347 return word_size > _humongous_object_threshold_in_words; 1348 } 1349 1350 // Returns the humongous threshold for a specific region size 1351 static size_t humongous_threshold_for(size_t region_size) { 1352 return (region_size / 2); 1353 } 1354 1355 // Print the maximum heap capacity. 1356 virtual size_t max_capacity() const; 1357 1358 virtual jlong millis_since_last_gc(); 1359 1360 1361 // Convenience function to be used in situations where the heap type can be 1362 // asserted to be this type. 1363 static G1CollectedHeap* heap(); 1364 1365 void set_region_short_lived_locked(HeapRegion* hr); 1366 // add appropriate methods for any other surv rate groups 1367 1368 YoungList* young_list() const { return _young_list; } 1369 1370 // debugging 1371 bool check_young_list_well_formed() { 1372 return _young_list->check_list_well_formed(); 1373 } 1374 1375 bool check_young_list_empty(bool check_heap, 1376 bool check_sample = true); 1377 1378 // *** Stuff related to concurrent marking. It's not clear to me that so 1379 // many of these need to be public. 1380 1381 // The functions below are helper functions that a subclass of 1382 // "CollectedHeap" can use in the implementation of its virtual 1383 // functions. 1384 // This performs a concurrent marking of the live objects in a 1385 // bitmap off to the side. 1386 void doConcurrentMark(); 1387 1388 bool isMarkedPrev(oop obj) const; 1389 bool isMarkedNext(oop obj) const; 1390 1391 // Determine if an object is dead, given the object and also 1392 // the region to which the object belongs. An object is dead 1393 // iff a) it was not allocated since the last mark, b) it 1394 // is not marked, and c) it is not in an archive region. 1395 bool is_obj_dead(const oop obj, const HeapRegion* hr) const { 1396 return 1397 !hr->obj_allocated_since_prev_marking(obj) && 1398 !isMarkedPrev(obj) && 1399 !hr->is_archive(); 1400 } 1401 1402 // This function returns true when an object has been 1403 // around since the previous marking and hasn't yet 1404 // been marked during this marking, and is not in an archive region. 1405 bool is_obj_ill(const oop obj, const HeapRegion* hr) const { 1406 return 1407 !hr->obj_allocated_since_next_marking(obj) && 1408 !isMarkedNext(obj) && 1409 !hr->is_archive(); 1410 } 1411 1412 // Determine if an object is dead, given only the object itself. 1413 // This will find the region to which the object belongs and 1414 // then call the region version of the same function. 1415 1416 // Added if it is NULL it isn't dead. 1417 1418 inline bool is_obj_dead(const oop obj) const; 1419 1420 inline bool is_obj_ill(const oop obj) const; 1421 1422 bool allocated_since_marking(oop obj, HeapRegion* hr, VerifyOption vo); 1423 HeapWord* top_at_mark_start(HeapRegion* hr, VerifyOption vo); 1424 bool is_marked(oop obj, VerifyOption vo); 1425 const char* top_at_mark_start_str(VerifyOption vo); 1426 1427 ConcurrentMark* concurrent_mark() const { return _cm; } 1428 1429 // Refinement 1430 1431 ConcurrentG1Refine* concurrent_g1_refine() const { return _cg1r; } 1432 1433 // The dirty cards region list is used to record a subset of regions 1434 // whose cards need clearing. The list if populated during the 1435 // remembered set scanning and drained during the card table 1436 // cleanup. Although the methods are reentrant, population/draining 1437 // phases must not overlap. For synchronization purposes the last 1438 // element on the list points to itself. 1439 HeapRegion* _dirty_cards_region_list; 1440 void push_dirty_cards_region(HeapRegion* hr); 1441 HeapRegion* pop_dirty_cards_region(); 1442 1443 // Optimized nmethod scanning support routines 1444 1445 // Register the given nmethod with the G1 heap. 1446 virtual void register_nmethod(nmethod* nm); 1447 1448 // Unregister the given nmethod from the G1 heap. 1449 virtual void unregister_nmethod(nmethod* nm); 1450 1451 // Free up superfluous code root memory. 1452 void purge_code_root_memory(); 1453 1454 // Rebuild the strong code root lists for each region 1455 // after a full GC. 1456 void rebuild_strong_code_roots(); 1457 1458 // Delete entries for dead interned string and clean up unreferenced symbols 1459 // in symbol table, possibly in parallel. 1460 void unlink_string_and_symbol_table(BoolObjectClosure* is_alive, bool unlink_strings = true, bool unlink_symbols = true); 1461 1462 // Parallel phase of unloading/cleaning after G1 concurrent mark. 1463 void parallel_cleaning(BoolObjectClosure* is_alive, bool process_strings, bool process_symbols, bool class_unloading_occurred); 1464 1465 // Redirty logged cards in the refinement queue. 1466 void redirty_logged_cards(); 1467 // Verification 1468 1469 // Perform any cleanup actions necessary before allowing a verification. 1470 virtual void prepare_for_verify(); 1471 1472 // Perform verification. 1473 1474 // vo == UsePrevMarking -> use "prev" marking information, 1475 // vo == UseNextMarking -> use "next" marking information 1476 // vo == UseMarkWord -> use the mark word in the object header 1477 // 1478 // NOTE: Only the "prev" marking information is guaranteed to be 1479 // consistent most of the time, so most calls to this should use 1480 // vo == UsePrevMarking. 1481 // Currently, there is only one case where this is called with 1482 // vo == UseNextMarking, which is to verify the "next" marking 1483 // information at the end of remark. 1484 // Currently there is only one place where this is called with 1485 // vo == UseMarkWord, which is to verify the marking during a 1486 // full GC. 1487 void verify(bool silent, VerifyOption vo); 1488 1489 // Override; it uses the "prev" marking information 1490 virtual void verify(bool silent); 1491 1492 // The methods below are here for convenience and dispatch the 1493 // appropriate method depending on value of the given VerifyOption 1494 // parameter. The values for that parameter, and their meanings, 1495 // are the same as those above. 1496 1497 bool is_obj_dead_cond(const oop obj, 1498 const HeapRegion* hr, 1499 const VerifyOption vo) const; 1500 1501 bool is_obj_dead_cond(const oop obj, 1502 const VerifyOption vo) const; 1503 1504 G1HeapSummary create_g1_heap_summary(); 1505 G1EvacSummary create_g1_evac_summary(G1EvacStats* stats); 1506 1507 // Printing 1508 1509 virtual void print_on(outputStream* st) const; 1510 virtual void print_extended_on(outputStream* st) const; 1511 virtual void print_on_error(outputStream* st) const; 1512 1513 virtual void print_gc_threads_on(outputStream* st) const; 1514 virtual void gc_threads_do(ThreadClosure* tc) const; 1515 1516 // Override 1517 void print_tracing_info() const; 1518 1519 // The following two methods are helpful for debugging RSet issues. 1520 void print_cset_rsets() PRODUCT_RETURN; 1521 void print_all_rsets() PRODUCT_RETURN; 1522 1523 public: 1524 size_t pending_card_num(); 1525 1526 protected: 1527 size_t _max_heap_capacity; 1528 }; 1529 1530 #endif // SHARE_VM_GC_G1_G1COLLECTEDHEAP_HPP