Tue, 07 Apr 2015 10:53:51 +0200
8058354: SPECjvm2008-Derby -2.7% performance regression on Solaris-X64 starting with 9-b29
Summary: Allow use of large pages for auxiliary data structures in G1. Clean up existing interfaces.
Reviewed-by: jmasa, pliden, stefank
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 */
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP
28 #include "gc_implementation/g1/g1AllocationContext.hpp"
29 #include "gc_implementation/g1/g1Allocator.hpp"
30 #include "gc_implementation/g1/concurrentMark.hpp"
31 #include "gc_implementation/g1/evacuationInfo.hpp"
32 #include "gc_implementation/g1/g1AllocRegion.hpp"
33 #include "gc_implementation/g1/g1BiasedArray.hpp"
34 #include "gc_implementation/g1/g1HRPrinter.hpp"
35 #include "gc_implementation/g1/g1InCSetState.hpp"
36 #include "gc_implementation/g1/g1MonitoringSupport.hpp"
37 #include "gc_implementation/g1/g1SATBCardTableModRefBS.hpp"
38 #include "gc_implementation/g1/g1YCTypes.hpp"
39 #include "gc_implementation/g1/heapRegionManager.hpp"
40 #include "gc_implementation/g1/heapRegionSet.hpp"
41 #include "gc_implementation/shared/hSpaceCounters.hpp"
42 #include "gc_implementation/shared/parGCAllocBuffer.hpp"
43 #include "memory/barrierSet.hpp"
44 #include "memory/memRegion.hpp"
45 #include "memory/sharedHeap.hpp"
46 #include "utilities/stack.hpp"
48 // A "G1CollectedHeap" is an implementation of a java heap for HotSpot.
49 // It uses the "Garbage First" heap organization and algorithm, which
50 // may combine concurrent marking with parallel, incremental compaction of
51 // heap subsets that will yield large amounts of garbage.
53 // Forward declarations
54 class HeapRegion;
55 class HRRSCleanupTask;
56 class GenerationSpec;
57 class OopsInHeapRegionClosure;
58 class G1KlassScanClosure;
59 class G1ScanHeapEvacClosure;
60 class ObjectClosure;
61 class SpaceClosure;
62 class CompactibleSpaceClosure;
63 class Space;
64 class G1CollectorPolicy;
65 class GenRemSet;
66 class G1RemSet;
67 class HeapRegionRemSetIterator;
68 class ConcurrentMark;
69 class ConcurrentMarkThread;
70 class ConcurrentG1Refine;
71 class ConcurrentGCTimer;
72 class GenerationCounters;
73 class STWGCTimer;
74 class G1NewTracer;
75 class G1OldTracer;
76 class EvacuationFailedInfo;
77 class nmethod;
78 class Ticks;
80 typedef OverflowTaskQueue<StarTask, mtGC> RefToScanQueue;
81 typedef GenericTaskQueueSet<RefToScanQueue, mtGC> RefToScanQueueSet;
83 typedef int RegionIdx_t; // needs to hold [ 0..max_regions() )
84 typedef int CardIdx_t; // needs to hold [ 0..CardsPerRegion )
86 class YoungList : public CHeapObj<mtGC> {
87 private:
88 G1CollectedHeap* _g1h;
90 HeapRegion* _head;
92 HeapRegion* _survivor_head;
93 HeapRegion* _survivor_tail;
95 HeapRegion* _curr;
97 uint _length;
98 uint _survivor_length;
100 size_t _last_sampled_rs_lengths;
101 size_t _sampled_rs_lengths;
103 void empty_list(HeapRegion* list);
105 public:
106 YoungList(G1CollectedHeap* g1h);
108 void push_region(HeapRegion* hr);
109 void add_survivor_region(HeapRegion* hr);
111 void empty_list();
112 bool is_empty() { return _length == 0; }
113 uint length() { return _length; }
114 uint survivor_length() { return _survivor_length; }
116 // Currently we do not keep track of the used byte sum for the
117 // young list and the survivors and it'd be quite a lot of work to
118 // do so. When we'll eventually replace the young list with
119 // instances of HeapRegionLinkedList we'll get that for free. So,
120 // we'll report the more accurate information then.
121 size_t eden_used_bytes() {
122 assert(length() >= survivor_length(), "invariant");
123 return (size_t) (length() - survivor_length()) * HeapRegion::GrainBytes;
124 }
125 size_t survivor_used_bytes() {
126 return (size_t) survivor_length() * HeapRegion::GrainBytes;
127 }
129 void rs_length_sampling_init();
130 bool rs_length_sampling_more();
131 void rs_length_sampling_next();
133 void reset_sampled_info() {
134 _last_sampled_rs_lengths = 0;
135 }
136 size_t sampled_rs_lengths() { return _last_sampled_rs_lengths; }
138 // for development purposes
139 void reset_auxilary_lists();
140 void clear() { _head = NULL; _length = 0; }
142 void clear_survivors() {
143 _survivor_head = NULL;
144 _survivor_tail = NULL;
145 _survivor_length = 0;
146 }
148 HeapRegion* first_region() { return _head; }
149 HeapRegion* first_survivor_region() { return _survivor_head; }
150 HeapRegion* last_survivor_region() { return _survivor_tail; }
152 // debugging
153 bool check_list_well_formed();
154 bool check_list_empty(bool check_sample = true);
155 void print();
156 };
158 // The G1 STW is alive closure.
159 // An instance is embedded into the G1CH and used as the
160 // (optional) _is_alive_non_header closure in the STW
161 // reference processor. It is also extensively used during
162 // reference processing during STW evacuation pauses.
163 class G1STWIsAliveClosure: public BoolObjectClosure {
164 G1CollectedHeap* _g1;
165 public:
166 G1STWIsAliveClosure(G1CollectedHeap* g1) : _g1(g1) {}
167 bool do_object_b(oop p);
168 };
170 class RefineCardTableEntryClosure;
172 class G1RegionMappingChangedListener : public G1MappingChangedListener {
173 private:
174 void reset_from_card_cache(uint start_idx, size_t num_regions);
175 public:
176 virtual void on_commit(uint start_idx, size_t num_regions, bool zero_filled);
177 };
179 class G1CollectedHeap : public SharedHeap {
180 friend class VM_CollectForMetadataAllocation;
181 friend class VM_G1CollectForAllocation;
182 friend class VM_G1CollectFull;
183 friend class VM_G1IncCollectionPause;
184 friend class VMStructs;
185 friend class MutatorAllocRegion;
186 friend class SurvivorGCAllocRegion;
187 friend class OldGCAllocRegion;
188 friend class G1Allocator;
189 friend class G1DefaultAllocator;
190 friend class G1ResManAllocator;
192 // Closures used in implementation.
193 template <G1Barrier barrier, G1Mark do_mark_object>
194 friend class G1ParCopyClosure;
195 friend class G1IsAliveClosure;
196 friend class G1EvacuateFollowersClosure;
197 friend class G1ParScanThreadState;
198 friend class G1ParScanClosureSuper;
199 friend class G1ParEvacuateFollowersClosure;
200 friend class G1ParTask;
201 friend class G1ParGCAllocator;
202 friend class G1DefaultParGCAllocator;
203 friend class G1FreeGarbageRegionClosure;
204 friend class RefineCardTableEntryClosure;
205 friend class G1PrepareCompactClosure;
206 friend class RegionSorter;
207 friend class RegionResetter;
208 friend class CountRCClosure;
209 friend class EvacPopObjClosure;
210 friend class G1ParCleanupCTTask;
212 friend class G1FreeHumongousRegionClosure;
213 // Other related classes.
214 friend class G1MarkSweep;
216 // Testing classes.
217 friend class G1CheckCSetFastTableClosure;
219 private:
220 // The one and only G1CollectedHeap, so static functions can find it.
221 static G1CollectedHeap* _g1h;
223 static size_t _humongous_object_threshold_in_words;
225 // The secondary free list which contains regions that have been
226 // freed up during the cleanup process. This will be appended to
227 // the master free list when appropriate.
228 FreeRegionList _secondary_free_list;
230 // It keeps track of the old regions.
231 HeapRegionSet _old_set;
233 // It keeps track of the humongous regions.
234 HeapRegionSet _humongous_set;
236 void clear_humongous_is_live_table();
237 void eagerly_reclaim_humongous_regions();
239 // The number of regions we could create by expansion.
240 uint _expansion_regions;
242 // The block offset table for the G1 heap.
243 G1BlockOffsetSharedArray* _bot_shared;
245 // Tears down the region sets / lists so that they are empty and the
246 // regions on the heap do not belong to a region set / list. The
247 // only exception is the humongous set which we leave unaltered. If
248 // free_list_only is true, it will only tear down the master free
249 // list. It is called before a Full GC (free_list_only == false) or
250 // before heap shrinking (free_list_only == true).
251 void tear_down_region_sets(bool free_list_only);
253 // Rebuilds the region sets / lists so that they are repopulated to
254 // reflect the contents of the heap. The only exception is the
255 // humongous set which was not torn down in the first place. If
256 // free_list_only is true, it will only rebuild the master free
257 // list. It is called after a Full GC (free_list_only == false) or
258 // after heap shrinking (free_list_only == true).
259 void rebuild_region_sets(bool free_list_only);
261 // Callback for region mapping changed events.
262 G1RegionMappingChangedListener _listener;
264 // The sequence of all heap regions in the heap.
265 HeapRegionManager _hrm;
267 // Class that handles the different kinds of allocations.
268 G1Allocator* _allocator;
270 // Statistics for each allocation context
271 AllocationContextStats _allocation_context_stats;
273 // PLAB sizing policy for survivors.
274 PLABStats _survivor_plab_stats;
276 // PLAB sizing policy for tenured objects.
277 PLABStats _old_plab_stats;
279 // It specifies whether we should attempt to expand the heap after a
280 // region allocation failure. If heap expansion fails we set this to
281 // false so that we don't re-attempt the heap expansion (it's likely
282 // that subsequent expansion attempts will also fail if one fails).
283 // Currently, it is only consulted during GC and it's reset at the
284 // start of each GC.
285 bool _expand_heap_after_alloc_failure;
287 // It resets the mutator alloc region before new allocations can take place.
288 void init_mutator_alloc_region();
290 // It releases the mutator alloc region.
291 void release_mutator_alloc_region();
293 // It initializes the GC alloc regions at the start of a GC.
294 void init_gc_alloc_regions(EvacuationInfo& evacuation_info);
296 // It releases the GC alloc regions at the end of a GC.
297 void release_gc_alloc_regions(uint no_of_gc_workers, EvacuationInfo& evacuation_info);
299 // It does any cleanup that needs to be done on the GC alloc regions
300 // before a Full GC.
301 void abandon_gc_alloc_regions();
303 // Helper for monitoring and management support.
304 G1MonitoringSupport* _g1mm;
306 // Records whether the region at the given index is kept live by roots or
307 // references from the young generation.
308 class HumongousIsLiveBiasedMappedArray : public G1BiasedMappedArray<bool> {
309 protected:
310 bool default_value() const { return false; }
311 public:
312 void clear() { G1BiasedMappedArray<bool>::clear(); }
313 void set_live(uint region) {
314 set_by_index(region, true);
315 }
316 bool is_live(uint region) {
317 return get_by_index(region);
318 }
319 };
321 HumongousIsLiveBiasedMappedArray _humongous_is_live;
322 // Stores whether during humongous object registration we found candidate regions.
323 // If not, we can skip a few steps.
324 bool _has_humongous_reclaim_candidates;
326 volatile unsigned _gc_time_stamp;
328 size_t* _surviving_young_words;
330 G1HRPrinter _hr_printer;
332 void setup_surviving_young_words();
333 void update_surviving_young_words(size_t* surv_young_words);
334 void cleanup_surviving_young_words();
336 // It decides whether an explicit GC should start a concurrent cycle
337 // instead of doing a STW GC. Currently, a concurrent cycle is
338 // explicitly started if:
339 // (a) cause == _gc_locker and +GCLockerInvokesConcurrent, or
340 // (b) cause == _java_lang_system_gc and +ExplicitGCInvokesConcurrent.
341 // (c) cause == _g1_humongous_allocation
342 bool should_do_concurrent_full_gc(GCCause::Cause cause);
344 // Keeps track of how many "old marking cycles" (i.e., Full GCs or
345 // concurrent cycles) we have started.
346 volatile uint _old_marking_cycles_started;
348 // Keeps track of how many "old marking cycles" (i.e., Full GCs or
349 // concurrent cycles) we have completed.
350 volatile uint _old_marking_cycles_completed;
352 bool _concurrent_cycle_started;
353 bool _heap_summary_sent;
355 // This is a non-product method that is helpful for testing. It is
356 // called at the end of a GC and artificially expands the heap by
357 // allocating a number of dead regions. This way we can induce very
358 // frequent marking cycles and stress the cleanup / concurrent
359 // cleanup code more (as all the regions that will be allocated by
360 // this method will be found dead by the marking cycle).
361 void allocate_dummy_regions() PRODUCT_RETURN;
363 // Clear RSets after a compaction. It also resets the GC time stamps.
364 void clear_rsets_post_compaction();
366 // If the HR printer is active, dump the state of the regions in the
367 // heap after a compaction.
368 void print_hrm_post_compaction();
370 // Create a memory mapper for auxiliary data structures of the given size and
371 // translation factor.
372 static G1RegionToSpaceMapper* create_aux_memory_mapper(const char* description,
373 size_t size,
374 size_t translation_factor);
376 double verify(bool guard, const char* msg);
377 void verify_before_gc();
378 void verify_after_gc();
380 void log_gc_header();
381 void log_gc_footer(double pause_time_sec);
383 // These are macros so that, if the assert fires, we get the correct
384 // line number, file, etc.
386 #define heap_locking_asserts_err_msg(_extra_message_) \
387 err_msg("%s : Heap_lock locked: %s, at safepoint: %s, is VM thread: %s", \
388 (_extra_message_), \
389 BOOL_TO_STR(Heap_lock->owned_by_self()), \
390 BOOL_TO_STR(SafepointSynchronize::is_at_safepoint()), \
391 BOOL_TO_STR(Thread::current()->is_VM_thread()))
393 #define assert_heap_locked() \
394 do { \
395 assert(Heap_lock->owned_by_self(), \
396 heap_locking_asserts_err_msg("should be holding the Heap_lock")); \
397 } while (0)
399 #define assert_heap_locked_or_at_safepoint(_should_be_vm_thread_) \
400 do { \
401 assert(Heap_lock->owned_by_self() || \
402 (SafepointSynchronize::is_at_safepoint() && \
403 ((_should_be_vm_thread_) == Thread::current()->is_VM_thread())), \
404 heap_locking_asserts_err_msg("should be holding the Heap_lock or " \
405 "should be at a safepoint")); \
406 } while (0)
408 #define assert_heap_locked_and_not_at_safepoint() \
409 do { \
410 assert(Heap_lock->owned_by_self() && \
411 !SafepointSynchronize::is_at_safepoint(), \
412 heap_locking_asserts_err_msg("should be holding the Heap_lock and " \
413 "should not be at a safepoint")); \
414 } while (0)
416 #define assert_heap_not_locked() \
417 do { \
418 assert(!Heap_lock->owned_by_self(), \
419 heap_locking_asserts_err_msg("should not be holding the Heap_lock")); \
420 } while (0)
422 #define assert_heap_not_locked_and_not_at_safepoint() \
423 do { \
424 assert(!Heap_lock->owned_by_self() && \
425 !SafepointSynchronize::is_at_safepoint(), \
426 heap_locking_asserts_err_msg("should not be holding the Heap_lock and " \
427 "should not be at a safepoint")); \
428 } while (0)
430 #define assert_at_safepoint(_should_be_vm_thread_) \
431 do { \
432 assert(SafepointSynchronize::is_at_safepoint() && \
433 ((_should_be_vm_thread_) == Thread::current()->is_VM_thread()), \
434 heap_locking_asserts_err_msg("should be at a safepoint")); \
435 } while (0)
437 #define assert_not_at_safepoint() \
438 do { \
439 assert(!SafepointSynchronize::is_at_safepoint(), \
440 heap_locking_asserts_err_msg("should not be at a safepoint")); \
441 } while (0)
443 protected:
445 // The young region list.
446 YoungList* _young_list;
448 // The current policy object for the collector.
449 G1CollectorPolicy* _g1_policy;
451 // This is the second level of trying to allocate a new region. If
452 // new_region() didn't find a region on the free_list, this call will
453 // check whether there's anything available on the
454 // secondary_free_list and/or wait for more regions to appear on
455 // that list, if _free_regions_coming is set.
456 HeapRegion* new_region_try_secondary_free_list(bool is_old);
458 // Try to allocate a single non-humongous HeapRegion sufficient for
459 // an allocation of the given word_size. If do_expand is true,
460 // attempt to expand the heap if necessary to satisfy the allocation
461 // request. If the region is to be used as an old region or for a
462 // humongous object, set is_old to true. If not, to false.
463 HeapRegion* new_region(size_t word_size, bool is_old, bool do_expand);
465 // Initialize a contiguous set of free regions of length num_regions
466 // and starting at index first so that they appear as a single
467 // humongous region.
468 HeapWord* humongous_obj_allocate_initialize_regions(uint first,
469 uint num_regions,
470 size_t word_size,
471 AllocationContext_t context);
473 // Attempt to allocate a humongous object of the given size. Return
474 // NULL if unsuccessful.
475 HeapWord* humongous_obj_allocate(size_t word_size, AllocationContext_t context);
477 // The following two methods, allocate_new_tlab() and
478 // mem_allocate(), are the two main entry points from the runtime
479 // into the G1's allocation routines. They have the following
480 // assumptions:
481 //
482 // * They should both be called outside safepoints.
483 //
484 // * They should both be called without holding the Heap_lock.
485 //
486 // * All allocation requests for new TLABs should go to
487 // allocate_new_tlab().
488 //
489 // * All non-TLAB allocation requests should go to mem_allocate().
490 //
491 // * If either call cannot satisfy the allocation request using the
492 // current allocating region, they will try to get a new one. If
493 // this fails, they will attempt to do an evacuation pause and
494 // retry the allocation.
495 //
496 // * If all allocation attempts fail, even after trying to schedule
497 // an evacuation pause, allocate_new_tlab() will return NULL,
498 // whereas mem_allocate() will attempt a heap expansion and/or
499 // schedule a Full GC.
500 //
501 // * We do not allow humongous-sized TLABs. So, allocate_new_tlab
502 // should never be called with word_size being humongous. All
503 // humongous allocation requests should go to mem_allocate() which
504 // will satisfy them with a special path.
506 virtual HeapWord* allocate_new_tlab(size_t word_size);
508 virtual HeapWord* mem_allocate(size_t word_size,
509 bool* gc_overhead_limit_was_exceeded);
511 // The following three methods take a gc_count_before_ret
512 // parameter which is used to return the GC count if the method
513 // returns NULL. Given that we are required to read the GC count
514 // while holding the Heap_lock, and these paths will take the
515 // Heap_lock at some point, it's easier to get them to read the GC
516 // count while holding the Heap_lock before they return NULL instead
517 // of the caller (namely: mem_allocate()) having to also take the
518 // Heap_lock just to read the GC count.
520 // First-level mutator allocation attempt: try to allocate out of
521 // the mutator alloc region without taking the Heap_lock. This
522 // should only be used for non-humongous allocations.
523 inline HeapWord* attempt_allocation(size_t word_size,
524 uint* gc_count_before_ret,
525 uint* gclocker_retry_count_ret);
527 // Second-level mutator allocation attempt: take the Heap_lock and
528 // retry the allocation attempt, potentially scheduling a GC
529 // pause. This should only be used for non-humongous allocations.
530 HeapWord* attempt_allocation_slow(size_t word_size,
531 AllocationContext_t context,
532 uint* gc_count_before_ret,
533 uint* gclocker_retry_count_ret);
535 // Takes the Heap_lock and attempts a humongous allocation. It can
536 // potentially schedule a GC pause.
537 HeapWord* attempt_allocation_humongous(size_t word_size,
538 uint* gc_count_before_ret,
539 uint* gclocker_retry_count_ret);
541 // Allocation attempt that should be called during safepoints (e.g.,
542 // at the end of a successful GC). expect_null_mutator_alloc_region
543 // specifies whether the mutator alloc region is expected to be NULL
544 // or not.
545 HeapWord* attempt_allocation_at_safepoint(size_t word_size,
546 AllocationContext_t context,
547 bool expect_null_mutator_alloc_region);
549 // It dirties the cards that cover the block so that so that the post
550 // write barrier never queues anything when updating objects on this
551 // block. It is assumed (and in fact we assert) that the block
552 // belongs to a young region.
553 inline void dirty_young_block(HeapWord* start, size_t word_size);
555 // Allocate blocks during garbage collection. Will ensure an
556 // allocation region, either by picking one or expanding the
557 // heap, and then allocate a block of the given size. The block
558 // may not be a humongous - it must fit into a single heap region.
559 inline HeapWord* par_allocate_during_gc(InCSetState dest,
560 size_t word_size,
561 AllocationContext_t context);
562 // Ensure that no further allocations can happen in "r", bearing in mind
563 // that parallel threads might be attempting allocations.
564 void par_allocate_remaining_space(HeapRegion* r);
566 // Allocation attempt during GC for a survivor object / PLAB.
567 inline HeapWord* survivor_attempt_allocation(size_t word_size,
568 AllocationContext_t context);
570 // Allocation attempt during GC for an old object / PLAB.
571 inline HeapWord* old_attempt_allocation(size_t word_size,
572 AllocationContext_t context);
574 // These methods are the "callbacks" from the G1AllocRegion class.
576 // For mutator alloc regions.
577 HeapRegion* new_mutator_alloc_region(size_t word_size, bool force);
578 void retire_mutator_alloc_region(HeapRegion* alloc_region,
579 size_t allocated_bytes);
581 // For GC alloc regions.
582 HeapRegion* new_gc_alloc_region(size_t word_size, uint count,
583 InCSetState dest);
584 void retire_gc_alloc_region(HeapRegion* alloc_region,
585 size_t allocated_bytes, InCSetState dest);
587 // - if explicit_gc is true, the GC is for a System.gc() or a heap
588 // inspection request and should collect the entire heap
589 // - if clear_all_soft_refs is true, all soft references should be
590 // cleared during the GC
591 // - if explicit_gc is false, word_size describes the allocation that
592 // the GC should attempt (at least) to satisfy
593 // - it returns false if it is unable to do the collection due to the
594 // GC locker being active, true otherwise
595 bool do_collection(bool explicit_gc,
596 bool clear_all_soft_refs,
597 size_t word_size);
599 // Callback from VM_G1CollectFull operation.
600 // Perform a full collection.
601 virtual void do_full_collection(bool clear_all_soft_refs);
603 // Resize the heap if necessary after a full collection. If this is
604 // after a collect-for allocation, "word_size" is the allocation size,
605 // and will be considered part of the used portion of the heap.
606 void resize_if_necessary_after_full_collection(size_t word_size);
608 // Callback from VM_G1CollectForAllocation operation.
609 // This function does everything necessary/possible to satisfy a
610 // failed allocation request (including collection, expansion, etc.)
611 HeapWord* satisfy_failed_allocation(size_t word_size,
612 AllocationContext_t context,
613 bool* succeeded);
615 // Attempting to expand the heap sufficiently
616 // to support an allocation of the given "word_size". If
617 // successful, perform the allocation and return the address of the
618 // allocated block, or else "NULL".
619 HeapWord* expand_and_allocate(size_t word_size, AllocationContext_t context);
621 // Process any reference objects discovered during
622 // an incremental evacuation pause.
623 void process_discovered_references(uint no_of_gc_workers);
625 // Enqueue any remaining discovered references
626 // after processing.
627 void enqueue_discovered_references(uint no_of_gc_workers);
629 public:
631 G1Allocator* allocator() {
632 return _allocator;
633 }
635 G1MonitoringSupport* g1mm() {
636 assert(_g1mm != NULL, "should have been initialized");
637 return _g1mm;
638 }
640 // Expand the garbage-first heap by at least the given size (in bytes!).
641 // Returns true if the heap was expanded by the requested amount;
642 // false otherwise.
643 // (Rounds up to a HeapRegion boundary.)
644 bool expand(size_t expand_bytes);
646 // Returns the PLAB statistics for a given destination.
647 inline PLABStats* alloc_buffer_stats(InCSetState dest);
649 // Determines PLAB size for a given destination.
650 inline size_t desired_plab_sz(InCSetState dest);
652 inline AllocationContextStats& allocation_context_stats();
654 // Do anything common to GC's.
655 virtual void gc_prologue(bool full);
656 virtual void gc_epilogue(bool full);
658 inline void set_humongous_is_live(oop obj);
660 bool humongous_is_live(uint region) {
661 return _humongous_is_live.is_live(region);
662 }
664 // Returns whether the given region (which must be a humongous (start) region)
665 // is to be considered conservatively live regardless of any other conditions.
666 bool humongous_region_is_always_live(uint index);
667 // Register the given region to be part of the collection set.
668 inline void register_humongous_region_with_in_cset_fast_test(uint index);
669 // Register regions with humongous objects (actually on the start region) in
670 // the in_cset_fast_test table.
671 void register_humongous_regions_with_in_cset_fast_test();
672 // We register a region with the fast "in collection set" test. We
673 // simply set to true the array slot corresponding to this region.
674 void register_young_region_with_in_cset_fast_test(HeapRegion* r) {
675 _in_cset_fast_test.set_in_young(r->hrm_index());
676 }
677 void register_old_region_with_in_cset_fast_test(HeapRegion* r) {
678 _in_cset_fast_test.set_in_old(r->hrm_index());
679 }
681 // This is a fast test on whether a reference points into the
682 // collection set or not. Assume that the reference
683 // points into the heap.
684 inline bool in_cset_fast_test(oop obj);
686 void clear_cset_fast_test() {
687 _in_cset_fast_test.clear();
688 }
690 // This is called at the start of either a concurrent cycle or a Full
691 // GC to update the number of old marking cycles started.
692 void increment_old_marking_cycles_started();
694 // This is called at the end of either a concurrent cycle or a Full
695 // GC to update the number of old marking cycles completed. Those two
696 // can happen in a nested fashion, i.e., we start a concurrent
697 // cycle, a Full GC happens half-way through it which ends first,
698 // and then the cycle notices that a Full GC happened and ends
699 // too. The concurrent parameter is a boolean to help us do a bit
700 // tighter consistency checking in the method. If concurrent is
701 // false, the caller is the inner caller in the nesting (i.e., the
702 // Full GC). If concurrent is true, the caller is the outer caller
703 // in this nesting (i.e., the concurrent cycle). Further nesting is
704 // not currently supported. The end of this call also notifies
705 // the FullGCCount_lock in case a Java thread is waiting for a full
706 // GC to happen (e.g., it called System.gc() with
707 // +ExplicitGCInvokesConcurrent).
708 void increment_old_marking_cycles_completed(bool concurrent);
710 uint old_marking_cycles_completed() {
711 return _old_marking_cycles_completed;
712 }
714 void register_concurrent_cycle_start(const Ticks& start_time);
715 void register_concurrent_cycle_end();
716 void trace_heap_after_concurrent_cycle();
718 G1YCType yc_type();
720 G1HRPrinter* hr_printer() { return &_hr_printer; }
722 // Frees a non-humongous region by initializing its contents and
723 // adding it to the free list that's passed as a parameter (this is
724 // usually a local list which will be appended to the master free
725 // list later). The used bytes of freed regions are accumulated in
726 // pre_used. If par is true, the region's RSet will not be freed
727 // up. The assumption is that this will be done later.
728 // The locked parameter indicates if the caller has already taken
729 // care of proper synchronization. This may allow some optimizations.
730 void free_region(HeapRegion* hr,
731 FreeRegionList* free_list,
732 bool par,
733 bool locked = false);
735 // Frees a humongous region by collapsing it into individual regions
736 // and calling free_region() for each of them. The freed regions
737 // will be added to the free list that's passed as a parameter (this
738 // is usually a local list which will be appended to the master free
739 // list later). The used bytes of freed regions are accumulated in
740 // pre_used. If par is true, the region's RSet will not be freed
741 // up. The assumption is that this will be done later.
742 void free_humongous_region(HeapRegion* hr,
743 FreeRegionList* free_list,
744 bool par);
745 protected:
747 // Shrink the garbage-first heap by at most the given size (in bytes!).
748 // (Rounds down to a HeapRegion boundary.)
749 virtual void shrink(size_t expand_bytes);
750 void shrink_helper(size_t expand_bytes);
752 #if TASKQUEUE_STATS
753 static void print_taskqueue_stats_hdr(outputStream* const st = gclog_or_tty);
754 void print_taskqueue_stats(outputStream* const st = gclog_or_tty) const;
755 void reset_taskqueue_stats();
756 #endif // TASKQUEUE_STATS
758 // Schedule the VM operation that will do an evacuation pause to
759 // satisfy an allocation request of word_size. *succeeded will
760 // return whether the VM operation was successful (it did do an
761 // evacuation pause) or not (another thread beat us to it or the GC
762 // locker was active). Given that we should not be holding the
763 // Heap_lock when we enter this method, we will pass the
764 // gc_count_before (i.e., total_collections()) as a parameter since
765 // it has to be read while holding the Heap_lock. Currently, both
766 // methods that call do_collection_pause() release the Heap_lock
767 // before the call, so it's easy to read gc_count_before just before.
768 HeapWord* do_collection_pause(size_t word_size,
769 uint gc_count_before,
770 bool* succeeded,
771 GCCause::Cause gc_cause);
773 // The guts of the incremental collection pause, executed by the vm
774 // thread. It returns false if it is unable to do the collection due
775 // to the GC locker being active, true otherwise
776 bool do_collection_pause_at_safepoint(double target_pause_time_ms);
778 // Actually do the work of evacuating the collection set.
779 void evacuate_collection_set(EvacuationInfo& evacuation_info);
781 // The g1 remembered set of the heap.
782 G1RemSet* _g1_rem_set;
784 // A set of cards that cover the objects for which the Rsets should be updated
785 // concurrently after the collection.
786 DirtyCardQueueSet _dirty_card_queue_set;
788 // The closure used to refine a single card.
789 RefineCardTableEntryClosure* _refine_cte_cl;
791 // A function to check the consistency of dirty card logs.
792 void check_ct_logs_at_safepoint();
794 // A DirtyCardQueueSet that is used to hold cards that contain
795 // references into the current collection set. This is used to
796 // update the remembered sets of the regions in the collection
797 // set in the event of an evacuation failure.
798 DirtyCardQueueSet _into_cset_dirty_card_queue_set;
800 // After a collection pause, make the regions in the CS into free
801 // regions.
802 void free_collection_set(HeapRegion* cs_head, EvacuationInfo& evacuation_info);
804 // Abandon the current collection set without recording policy
805 // statistics or updating free lists.
806 void abandon_collection_set(HeapRegion* cs_head);
808 // The concurrent marker (and the thread it runs in.)
809 ConcurrentMark* _cm;
810 ConcurrentMarkThread* _cmThread;
811 bool _mark_in_progress;
813 // The concurrent refiner.
814 ConcurrentG1Refine* _cg1r;
816 // The parallel task queues
817 RefToScanQueueSet *_task_queues;
819 // True iff a evacuation has failed in the current collection.
820 bool _evacuation_failed;
822 EvacuationFailedInfo* _evacuation_failed_info_array;
824 // Failed evacuations cause some logical from-space objects to have
825 // forwarding pointers to themselves. Reset them.
826 void remove_self_forwarding_pointers();
828 // Together, these store an object with a preserved mark, and its mark value.
829 Stack<oop, mtGC> _objs_with_preserved_marks;
830 Stack<markOop, mtGC> _preserved_marks_of_objs;
832 // Preserve the mark of "obj", if necessary, in preparation for its mark
833 // word being overwritten with a self-forwarding-pointer.
834 void preserve_mark_if_necessary(oop obj, markOop m);
836 // The stack of evac-failure objects left to be scanned.
837 GrowableArray<oop>* _evac_failure_scan_stack;
838 // The closure to apply to evac-failure objects.
840 OopsInHeapRegionClosure* _evac_failure_closure;
841 // Set the field above.
842 void
843 set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_closure) {
844 _evac_failure_closure = evac_failure_closure;
845 }
847 // Push "obj" on the scan stack.
848 void push_on_evac_failure_scan_stack(oop obj);
849 // Process scan stack entries until the stack is empty.
850 void drain_evac_failure_scan_stack();
851 // True iff an invocation of "drain_scan_stack" is in progress; to
852 // prevent unnecessary recursion.
853 bool _drain_in_progress;
855 // Do any necessary initialization for evacuation-failure handling.
856 // "cl" is the closure that will be used to process evac-failure
857 // objects.
858 void init_for_evac_failure(OopsInHeapRegionClosure* cl);
859 // Do any necessary cleanup for evacuation-failure handling data
860 // structures.
861 void finalize_for_evac_failure();
863 // An attempt to evacuate "obj" has failed; take necessary steps.
864 oop handle_evacuation_failure_par(G1ParScanThreadState* _par_scan_state, oop obj);
865 void handle_evacuation_failure_common(oop obj, markOop m);
867 #ifndef PRODUCT
868 // Support for forcing evacuation failures. Analogous to
869 // PromotionFailureALot for the other collectors.
871 // Records whether G1EvacuationFailureALot should be in effect
872 // for the current GC
873 bool _evacuation_failure_alot_for_current_gc;
875 // Used to record the GC number for interval checking when
876 // determining whether G1EvaucationFailureALot is in effect
877 // for the current GC.
878 size_t _evacuation_failure_alot_gc_number;
880 // Count of the number of evacuations between failures.
881 volatile size_t _evacuation_failure_alot_count;
883 // Set whether G1EvacuationFailureALot should be in effect
884 // for the current GC (based upon the type of GC and which
885 // command line flags are set);
886 inline bool evacuation_failure_alot_for_gc_type(bool gcs_are_young,
887 bool during_initial_mark,
888 bool during_marking);
890 inline void set_evacuation_failure_alot_for_current_gc();
892 // Return true if it's time to cause an evacuation failure.
893 inline bool evacuation_should_fail();
895 // Reset the G1EvacuationFailureALot counters. Should be called at
896 // the end of an evacuation pause in which an evacuation failure occurred.
897 inline void reset_evacuation_should_fail();
898 #endif // !PRODUCT
900 // ("Weak") Reference processing support.
901 //
902 // G1 has 2 instances of the reference processor class. One
903 // (_ref_processor_cm) handles reference object discovery
904 // and subsequent processing during concurrent marking cycles.
905 //
906 // The other (_ref_processor_stw) handles reference object
907 // discovery and processing during full GCs and incremental
908 // evacuation pauses.
909 //
910 // During an incremental pause, reference discovery will be
911 // temporarily disabled for _ref_processor_cm and will be
912 // enabled for _ref_processor_stw. At the end of the evacuation
913 // pause references discovered by _ref_processor_stw will be
914 // processed and discovery will be disabled. The previous
915 // setting for reference object discovery for _ref_processor_cm
916 // will be re-instated.
917 //
918 // At the start of marking:
919 // * Discovery by the CM ref processor is verified to be inactive
920 // and it's discovered lists are empty.
921 // * Discovery by the CM ref processor is then enabled.
922 //
923 // At the end of marking:
924 // * Any references on the CM ref processor's discovered
925 // lists are processed (possibly MT).
926 //
927 // At the start of full GC we:
928 // * Disable discovery by the CM ref processor and
929 // empty CM ref processor's discovered lists
930 // (without processing any entries).
931 // * Verify that the STW ref processor is inactive and it's
932 // discovered lists are empty.
933 // * Temporarily set STW ref processor discovery as single threaded.
934 // * Temporarily clear the STW ref processor's _is_alive_non_header
935 // field.
936 // * Finally enable discovery by the STW ref processor.
937 //
938 // The STW ref processor is used to record any discovered
939 // references during the full GC.
940 //
941 // At the end of a full GC we:
942 // * Enqueue any reference objects discovered by the STW ref processor
943 // that have non-live referents. This has the side-effect of
944 // making the STW ref processor inactive by disabling discovery.
945 // * Verify that the CM ref processor is still inactive
946 // and no references have been placed on it's discovered
947 // lists (also checked as a precondition during initial marking).
949 // The (stw) reference processor...
950 ReferenceProcessor* _ref_processor_stw;
952 STWGCTimer* _gc_timer_stw;
953 ConcurrentGCTimer* _gc_timer_cm;
955 G1OldTracer* _gc_tracer_cm;
956 G1NewTracer* _gc_tracer_stw;
958 // During reference object discovery, the _is_alive_non_header
959 // closure (if non-null) is applied to the referent object to
960 // determine whether the referent is live. If so then the
961 // reference object does not need to be 'discovered' and can
962 // be treated as a regular oop. This has the benefit of reducing
963 // the number of 'discovered' reference objects that need to
964 // be processed.
965 //
966 // Instance of the is_alive closure for embedding into the
967 // STW reference processor as the _is_alive_non_header field.
968 // Supplying a value for the _is_alive_non_header field is
969 // optional but doing so prevents unnecessary additions to
970 // the discovered lists during reference discovery.
971 G1STWIsAliveClosure _is_alive_closure_stw;
973 // The (concurrent marking) reference processor...
974 ReferenceProcessor* _ref_processor_cm;
976 // Instance of the concurrent mark is_alive closure for embedding
977 // into the Concurrent Marking reference processor as the
978 // _is_alive_non_header field. Supplying a value for the
979 // _is_alive_non_header field is optional but doing so prevents
980 // unnecessary additions to the discovered lists during reference
981 // discovery.
982 G1CMIsAliveClosure _is_alive_closure_cm;
984 // Cache used by G1CollectedHeap::start_cset_region_for_worker().
985 HeapRegion** _worker_cset_start_region;
987 // Time stamp to validate the regions recorded in the cache
988 // used by G1CollectedHeap::start_cset_region_for_worker().
989 // The heap region entry for a given worker is valid iff
990 // the associated time stamp value matches the current value
991 // of G1CollectedHeap::_gc_time_stamp.
992 uint* _worker_cset_start_region_time_stamp;
994 volatile bool _free_regions_coming;
996 public:
998 void set_refine_cte_cl_concurrency(bool concurrent);
1000 RefToScanQueue *task_queue(int i) const;
1002 // A set of cards where updates happened during the GC
1003 DirtyCardQueueSet& dirty_card_queue_set() { return _dirty_card_queue_set; }
1005 // A DirtyCardQueueSet that is used to hold cards that contain
1006 // references into the current collection set. This is used to
1007 // update the remembered sets of the regions in the collection
1008 // set in the event of an evacuation failure.
1009 DirtyCardQueueSet& into_cset_dirty_card_queue_set()
1010 { return _into_cset_dirty_card_queue_set; }
1012 // Create a G1CollectedHeap with the specified policy.
1013 // Must call the initialize method afterwards.
1014 // May not return if something goes wrong.
1015 G1CollectedHeap(G1CollectorPolicy* policy);
1017 // Initialize the G1CollectedHeap to have the initial and
1018 // maximum sizes and remembered and barrier sets
1019 // specified by the policy object.
1020 jint initialize();
1022 virtual void stop();
1024 // Return the (conservative) maximum heap alignment for any G1 heap
1025 static size_t conservative_max_heap_alignment();
1027 // Initialize weak reference processing.
1028 virtual void ref_processing_init();
1030 // Explicitly import set_par_threads into this scope
1031 using SharedHeap::set_par_threads;
1032 // Set _n_par_threads according to a policy TBD.
1033 void set_par_threads();
1035 virtual CollectedHeap::Name kind() const {
1036 return CollectedHeap::G1CollectedHeap;
1037 }
1039 // The current policy object for the collector.
1040 G1CollectorPolicy* g1_policy() const { return _g1_policy; }
1042 virtual CollectorPolicy* collector_policy() const { return (CollectorPolicy*) g1_policy(); }
1044 // Adaptive size policy. No such thing for g1.
1045 virtual AdaptiveSizePolicy* size_policy() { return NULL; }
1047 // The rem set and barrier set.
1048 G1RemSet* g1_rem_set() const { return _g1_rem_set; }
1050 unsigned get_gc_time_stamp() {
1051 return _gc_time_stamp;
1052 }
1054 inline void reset_gc_time_stamp();
1056 void check_gc_time_stamps() PRODUCT_RETURN;
1058 inline void increment_gc_time_stamp();
1060 // Reset the given region's GC timestamp. If it's starts humongous,
1061 // also reset the GC timestamp of its corresponding
1062 // continues humongous regions too.
1063 void reset_gc_time_stamps(HeapRegion* hr);
1065 void iterate_dirty_card_closure(CardTableEntryClosure* cl,
1066 DirtyCardQueue* into_cset_dcq,
1067 bool concurrent, uint worker_i);
1069 // The shared block offset table array.
1070 G1BlockOffsetSharedArray* bot_shared() const { return _bot_shared; }
1072 // Reference Processing accessors
1074 // The STW reference processor....
1075 ReferenceProcessor* ref_processor_stw() const { return _ref_processor_stw; }
1077 // The Concurrent Marking reference processor...
1078 ReferenceProcessor* ref_processor_cm() const { return _ref_processor_cm; }
1080 ConcurrentGCTimer* gc_timer_cm() const { return _gc_timer_cm; }
1081 G1OldTracer* gc_tracer_cm() const { return _gc_tracer_cm; }
1083 virtual size_t capacity() const;
1084 virtual size_t used() const;
1085 // This should be called when we're not holding the heap lock. The
1086 // result might be a bit inaccurate.
1087 size_t used_unlocked() const;
1088 size_t recalculate_used() const;
1090 // These virtual functions do the actual allocation.
1091 // Some heaps may offer a contiguous region for shared non-blocking
1092 // allocation, via inlined code (by exporting the address of the top and
1093 // end fields defining the extent of the contiguous allocation region.)
1094 // But G1CollectedHeap doesn't yet support this.
1096 virtual bool is_maximal_no_gc() const {
1097 return _hrm.available() == 0;
1098 }
1100 // The current number of regions in the heap.
1101 uint num_regions() const { return _hrm.length(); }
1103 // The max number of regions in the heap.
1104 uint max_regions() const { return _hrm.max_length(); }
1106 // The number of regions that are completely free.
1107 uint num_free_regions() const { return _hrm.num_free_regions(); }
1109 // The number of regions that are not completely free.
1110 uint num_used_regions() const { return num_regions() - num_free_regions(); }
1112 void verify_not_dirty_region(HeapRegion* hr) PRODUCT_RETURN;
1113 void verify_dirty_region(HeapRegion* hr) PRODUCT_RETURN;
1114 void verify_dirty_young_list(HeapRegion* head) PRODUCT_RETURN;
1115 void verify_dirty_young_regions() PRODUCT_RETURN;
1117 #ifndef PRODUCT
1118 // Make sure that the given bitmap has no marked objects in the
1119 // range [from,limit). If it does, print an error message and return
1120 // false. Otherwise, just return true. bitmap_name should be "prev"
1121 // or "next".
1122 bool verify_no_bits_over_tams(const char* bitmap_name, CMBitMapRO* bitmap,
1123 HeapWord* from, HeapWord* limit);
1125 // Verify that the prev / next bitmap range [tams,end) for the given
1126 // region has no marks. Return true if all is well, false if errors
1127 // are detected.
1128 bool verify_bitmaps(const char* caller, HeapRegion* hr);
1129 #endif // PRODUCT
1131 // If G1VerifyBitmaps is set, verify that the marking bitmaps for
1132 // the given region do not have any spurious marks. If errors are
1133 // detected, print appropriate error messages and crash.
1134 void check_bitmaps(const char* caller, HeapRegion* hr) PRODUCT_RETURN;
1136 // If G1VerifyBitmaps is set, verify that the marking bitmaps do not
1137 // have any spurious marks. If errors are detected, print
1138 // appropriate error messages and crash.
1139 void check_bitmaps(const char* caller) PRODUCT_RETURN;
1141 // Do sanity check on the contents of the in-cset fast test table.
1142 bool check_cset_fast_test() PRODUCT_RETURN_( return true; );
1144 // verify_region_sets() performs verification over the region
1145 // lists. It will be compiled in the product code to be used when
1146 // necessary (i.e., during heap verification).
1147 void verify_region_sets();
1149 // verify_region_sets_optional() is planted in the code for
1150 // list verification in non-product builds (and it can be enabled in
1151 // product builds by defining HEAP_REGION_SET_FORCE_VERIFY to be 1).
1152 #if HEAP_REGION_SET_FORCE_VERIFY
1153 void verify_region_sets_optional() {
1154 verify_region_sets();
1155 }
1156 #else // HEAP_REGION_SET_FORCE_VERIFY
1157 void verify_region_sets_optional() { }
1158 #endif // HEAP_REGION_SET_FORCE_VERIFY
1160 #ifdef ASSERT
1161 bool is_on_master_free_list(HeapRegion* hr) {
1162 return _hrm.is_free(hr);
1163 }
1164 #endif // ASSERT
1166 // Wrapper for the region list operations that can be called from
1167 // methods outside this class.
1169 void secondary_free_list_add(FreeRegionList* list) {
1170 _secondary_free_list.add_ordered(list);
1171 }
1173 void append_secondary_free_list() {
1174 _hrm.insert_list_into_free_list(&_secondary_free_list);
1175 }
1177 void append_secondary_free_list_if_not_empty_with_lock() {
1178 // If the secondary free list looks empty there's no reason to
1179 // take the lock and then try to append it.
1180 if (!_secondary_free_list.is_empty()) {
1181 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag);
1182 append_secondary_free_list();
1183 }
1184 }
1186 inline void old_set_remove(HeapRegion* hr);
1188 size_t non_young_capacity_bytes() {
1189 return _old_set.total_capacity_bytes() + _humongous_set.total_capacity_bytes();
1190 }
1192 void set_free_regions_coming();
1193 void reset_free_regions_coming();
1194 bool free_regions_coming() { return _free_regions_coming; }
1195 void wait_while_free_regions_coming();
1197 // Determine whether the given region is one that we are using as an
1198 // old GC alloc region.
1199 bool is_old_gc_alloc_region(HeapRegion* hr) {
1200 return _allocator->is_retained_old_region(hr);
1201 }
1203 // Perform a collection of the heap; intended for use in implementing
1204 // "System.gc". This probably implies as full a collection as the
1205 // "CollectedHeap" supports.
1206 virtual void collect(GCCause::Cause cause);
1208 // The same as above but assume that the caller holds the Heap_lock.
1209 void collect_locked(GCCause::Cause cause);
1211 virtual bool copy_allocation_context_stats(const jint* contexts,
1212 jlong* totals,
1213 jbyte* accuracy,
1214 jint len);
1216 // True iff an evacuation has failed in the most-recent collection.
1217 bool evacuation_failed() { return _evacuation_failed; }
1219 void remove_from_old_sets(const HeapRegionSetCount& old_regions_removed, const HeapRegionSetCount& humongous_regions_removed);
1220 void prepend_to_freelist(FreeRegionList* list);
1221 void decrement_summary_bytes(size_t bytes);
1223 // Returns "TRUE" iff "p" points into the committed areas of the heap.
1224 virtual bool is_in(const void* p) const;
1225 #ifdef ASSERT
1226 // Returns whether p is in one of the available areas of the heap. Slow but
1227 // extensive version.
1228 bool is_in_exact(const void* p) const;
1229 #endif
1231 // Return "TRUE" iff the given object address is within the collection
1232 // set. Slow implementation.
1233 inline bool obj_in_cs(oop obj);
1235 inline bool is_in_cset(oop obj);
1237 inline bool is_in_cset_or_humongous(const oop obj);
1239 private:
1240 // This array is used for a quick test on whether a reference points into
1241 // the collection set or not. Each of the array's elements denotes whether the
1242 // corresponding region is in the collection set or not.
1243 G1InCSetStateFastTestBiasedMappedArray _in_cset_fast_test;
1245 public:
1247 inline InCSetState in_cset_state(const oop obj);
1249 // Return "TRUE" iff the given object address is in the reserved
1250 // region of g1.
1251 bool is_in_g1_reserved(const void* p) const {
1252 return _hrm.reserved().contains(p);
1253 }
1255 // Returns a MemRegion that corresponds to the space that has been
1256 // reserved for the heap
1257 MemRegion g1_reserved() const {
1258 return _hrm.reserved();
1259 }
1261 virtual bool is_in_closed_subset(const void* p) const;
1263 G1SATBCardTableLoggingModRefBS* g1_barrier_set() {
1264 return (G1SATBCardTableLoggingModRefBS*) barrier_set();
1265 }
1267 // This resets the card table to all zeros. It is used after
1268 // a collection pause which used the card table to claim cards.
1269 void cleanUpCardTable();
1271 // Iteration functions.
1273 // Iterate over all the ref-containing fields of all objects, calling
1274 // "cl.do_oop" on each.
1275 virtual void oop_iterate(ExtendedOopClosure* cl);
1277 // Iterate over all objects, calling "cl.do_object" on each.
1278 virtual void object_iterate(ObjectClosure* cl);
1280 virtual void safe_object_iterate(ObjectClosure* cl) {
1281 object_iterate(cl);
1282 }
1284 // Iterate over all spaces in use in the heap, in ascending address order.
1285 virtual void space_iterate(SpaceClosure* cl);
1287 // Iterate over heap regions, in address order, terminating the
1288 // iteration early if the "doHeapRegion" method returns "true".
1289 void heap_region_iterate(HeapRegionClosure* blk) const;
1291 // Return the region with the given index. It assumes the index is valid.
1292 inline HeapRegion* region_at(uint index) const;
1294 // Calculate the region index of the given address. Given address must be
1295 // within the heap.
1296 inline uint addr_to_region(HeapWord* addr) const;
1298 inline HeapWord* bottom_addr_for_region(uint index) const;
1300 // Divide the heap region sequence into "chunks" of some size (the number
1301 // of regions divided by the number of parallel threads times some
1302 // overpartition factor, currently 4). Assumes that this will be called
1303 // in parallel by ParallelGCThreads worker threads with discinct worker
1304 // ids in the range [0..max(ParallelGCThreads-1, 1)], that all parallel
1305 // calls will use the same "claim_value", and that that claim value is
1306 // different from the claim_value of any heap region before the start of
1307 // the iteration. Applies "blk->doHeapRegion" to each of the regions, by
1308 // attempting to claim the first region in each chunk, and, if
1309 // successful, applying the closure to each region in the chunk (and
1310 // setting the claim value of the second and subsequent regions of the
1311 // chunk.) For now requires that "doHeapRegion" always returns "false",
1312 // i.e., that a closure never attempt to abort a traversal.
1313 void heap_region_par_iterate_chunked(HeapRegionClosure* cl,
1314 uint worker_id,
1315 uint num_workers,
1316 jint claim_value) const;
1318 // It resets all the region claim values to the default.
1319 void reset_heap_region_claim_values();
1321 // Resets the claim values of regions in the current
1322 // collection set to the default.
1323 void reset_cset_heap_region_claim_values();
1325 #ifdef ASSERT
1326 bool check_heap_region_claim_values(jint claim_value);
1328 // Same as the routine above but only checks regions in the
1329 // current collection set.
1330 bool check_cset_heap_region_claim_values(jint claim_value);
1331 #endif // ASSERT
1333 // Clear the cached cset start regions and (more importantly)
1334 // the time stamps. Called when we reset the GC time stamp.
1335 void clear_cset_start_regions();
1337 // Given the id of a worker, obtain or calculate a suitable
1338 // starting region for iterating over the current collection set.
1339 HeapRegion* start_cset_region_for_worker(uint worker_i);
1341 // Iterate over the regions (if any) in the current collection set.
1342 void collection_set_iterate(HeapRegionClosure* blk);
1344 // As above but starting from region r
1345 void collection_set_iterate_from(HeapRegion* r, HeapRegionClosure *blk);
1347 HeapRegion* next_compaction_region(const HeapRegion* from) const;
1349 // A CollectedHeap will contain some number of spaces. This finds the
1350 // space containing a given address, or else returns NULL.
1351 virtual Space* space_containing(const void* addr) const;
1353 // Returns the HeapRegion that contains addr. addr must not be NULL.
1354 template <class T>
1355 inline HeapRegion* heap_region_containing_raw(const T addr) const;
1357 // Returns the HeapRegion that contains addr. addr must not be NULL.
1358 // If addr is within a humongous continues region, it returns its humongous start region.
1359 template <class T>
1360 inline HeapRegion* heap_region_containing(const T addr) const;
1362 // A CollectedHeap is divided into a dense sequence of "blocks"; that is,
1363 // each address in the (reserved) heap is a member of exactly
1364 // one block. The defining characteristic of a block is that it is
1365 // possible to find its size, and thus to progress forward to the next
1366 // block. (Blocks may be of different sizes.) Thus, blocks may
1367 // represent Java objects, or they might be free blocks in a
1368 // free-list-based heap (or subheap), as long as the two kinds are
1369 // distinguishable and the size of each is determinable.
1371 // Returns the address of the start of the "block" that contains the
1372 // address "addr". We say "blocks" instead of "object" since some heaps
1373 // may not pack objects densely; a chunk may either be an object or a
1374 // non-object.
1375 virtual HeapWord* block_start(const void* addr) const;
1377 // Requires "addr" to be the start of a chunk, and returns its size.
1378 // "addr + size" is required to be the start of a new chunk, or the end
1379 // of the active area of the heap.
1380 virtual size_t block_size(const HeapWord* addr) const;
1382 // Requires "addr" to be the start of a block, and returns "TRUE" iff
1383 // the block is an object.
1384 virtual bool block_is_obj(const HeapWord* addr) const;
1386 // Does this heap support heap inspection? (+PrintClassHistogram)
1387 virtual bool supports_heap_inspection() const { return true; }
1389 // Section on thread-local allocation buffers (TLABs)
1390 // See CollectedHeap for semantics.
1392 bool supports_tlab_allocation() const;
1393 size_t tlab_capacity(Thread* ignored) const;
1394 size_t tlab_used(Thread* ignored) const;
1395 size_t max_tlab_size() const;
1396 size_t unsafe_max_tlab_alloc(Thread* ignored) const;
1398 // Can a compiler initialize a new object without store barriers?
1399 // This permission only extends from the creation of a new object
1400 // via a TLAB up to the first subsequent safepoint. If such permission
1401 // is granted for this heap type, the compiler promises to call
1402 // defer_store_barrier() below on any slow path allocation of
1403 // a new object for which such initializing store barriers will
1404 // have been elided. G1, like CMS, allows this, but should be
1405 // ready to provide a compensating write barrier as necessary
1406 // if that storage came out of a non-young region. The efficiency
1407 // of this implementation depends crucially on being able to
1408 // answer very efficiently in constant time whether a piece of
1409 // storage in the heap comes from a young region or not.
1410 // See ReduceInitialCardMarks.
1411 virtual bool can_elide_tlab_store_barriers() const {
1412 return true;
1413 }
1415 virtual bool card_mark_must_follow_store() const {
1416 return true;
1417 }
1419 inline bool is_in_young(const oop obj);
1421 #ifdef ASSERT
1422 virtual bool is_in_partial_collection(const void* p);
1423 #endif
1425 virtual bool is_scavengable(const void* addr);
1427 // We don't need barriers for initializing stores to objects
1428 // in the young gen: for the SATB pre-barrier, there is no
1429 // pre-value that needs to be remembered; for the remembered-set
1430 // update logging post-barrier, we don't maintain remembered set
1431 // information for young gen objects.
1432 virtual inline bool can_elide_initializing_store_barrier(oop new_obj);
1434 // Returns "true" iff the given word_size is "very large".
1435 static bool isHumongous(size_t word_size) {
1436 // Note this has to be strictly greater-than as the TLABs
1437 // are capped at the humongous thresold and we want to
1438 // ensure that we don't try to allocate a TLAB as
1439 // humongous and that we don't allocate a humongous
1440 // object in a TLAB.
1441 return word_size > _humongous_object_threshold_in_words;
1442 }
1444 // Update mod union table with the set of dirty cards.
1445 void updateModUnion();
1447 // Set the mod union bits corresponding to the given memRegion. Note
1448 // that this is always a safe operation, since it doesn't clear any
1449 // bits.
1450 void markModUnionRange(MemRegion mr);
1452 // Records the fact that a marking phase is no longer in progress.
1453 void set_marking_complete() {
1454 _mark_in_progress = false;
1455 }
1456 void set_marking_started() {
1457 _mark_in_progress = true;
1458 }
1459 bool mark_in_progress() {
1460 return _mark_in_progress;
1461 }
1463 // Print the maximum heap capacity.
1464 virtual size_t max_capacity() const;
1466 virtual jlong millis_since_last_gc();
1469 // Convenience function to be used in situations where the heap type can be
1470 // asserted to be this type.
1471 static G1CollectedHeap* heap();
1473 void set_region_short_lived_locked(HeapRegion* hr);
1474 // add appropriate methods for any other surv rate groups
1476 YoungList* young_list() const { return _young_list; }
1478 // debugging
1479 bool check_young_list_well_formed() {
1480 return _young_list->check_list_well_formed();
1481 }
1483 bool check_young_list_empty(bool check_heap,
1484 bool check_sample = true);
1486 // *** Stuff related to concurrent marking. It's not clear to me that so
1487 // many of these need to be public.
1489 // The functions below are helper functions that a subclass of
1490 // "CollectedHeap" can use in the implementation of its virtual
1491 // functions.
1492 // This performs a concurrent marking of the live objects in a
1493 // bitmap off to the side.
1494 void doConcurrentMark();
1496 bool isMarkedPrev(oop obj) const;
1497 bool isMarkedNext(oop obj) const;
1499 // Determine if an object is dead, given the object and also
1500 // the region to which the object belongs. An object is dead
1501 // iff a) it was not allocated since the last mark and b) it
1502 // is not marked.
1503 bool is_obj_dead(const oop obj, const HeapRegion* hr) const {
1504 return
1505 !hr->obj_allocated_since_prev_marking(obj) &&
1506 !isMarkedPrev(obj);
1507 }
1509 // This function returns true when an object has been
1510 // around since the previous marking and hasn't yet
1511 // been marked during this marking.
1512 bool is_obj_ill(const oop obj, const HeapRegion* hr) const {
1513 return
1514 !hr->obj_allocated_since_next_marking(obj) &&
1515 !isMarkedNext(obj);
1516 }
1518 // Determine if an object is dead, given only the object itself.
1519 // This will find the region to which the object belongs and
1520 // then call the region version of the same function.
1522 // Added if it is NULL it isn't dead.
1524 inline bool is_obj_dead(const oop obj) const;
1526 inline bool is_obj_ill(const oop obj) const;
1528 bool allocated_since_marking(oop obj, HeapRegion* hr, VerifyOption vo);
1529 HeapWord* top_at_mark_start(HeapRegion* hr, VerifyOption vo);
1530 bool is_marked(oop obj, VerifyOption vo);
1531 const char* top_at_mark_start_str(VerifyOption vo);
1533 ConcurrentMark* concurrent_mark() const { return _cm; }
1535 // Refinement
1537 ConcurrentG1Refine* concurrent_g1_refine() const { return _cg1r; }
1539 // The dirty cards region list is used to record a subset of regions
1540 // whose cards need clearing. The list if populated during the
1541 // remembered set scanning and drained during the card table
1542 // cleanup. Although the methods are reentrant, population/draining
1543 // phases must not overlap. For synchronization purposes the last
1544 // element on the list points to itself.
1545 HeapRegion* _dirty_cards_region_list;
1546 void push_dirty_cards_region(HeapRegion* hr);
1547 HeapRegion* pop_dirty_cards_region();
1549 // Optimized nmethod scanning support routines
1551 // Register the given nmethod with the G1 heap
1552 virtual void register_nmethod(nmethod* nm);
1554 // Unregister the given nmethod from the G1 heap
1555 virtual void unregister_nmethod(nmethod* nm);
1557 // Free up superfluous code root memory.
1558 void purge_code_root_memory();
1560 // Rebuild the stong code root lists for each region
1561 // after a full GC
1562 void rebuild_strong_code_roots();
1564 // Delete entries for dead interned string and clean up unreferenced symbols
1565 // in symbol table, possibly in parallel.
1566 void unlink_string_and_symbol_table(BoolObjectClosure* is_alive, bool unlink_strings = true, bool unlink_symbols = true);
1568 // Parallel phase of unloading/cleaning after G1 concurrent mark.
1569 void parallel_cleaning(BoolObjectClosure* is_alive, bool process_strings, bool process_symbols, bool class_unloading_occurred);
1571 // Redirty logged cards in the refinement queue.
1572 void redirty_logged_cards();
1573 // Verification
1575 // The following is just to alert the verification code
1576 // that a full collection has occurred and that the
1577 // remembered sets are no longer up to date.
1578 bool _full_collection;
1579 void set_full_collection() { _full_collection = true;}
1580 void clear_full_collection() {_full_collection = false;}
1581 bool full_collection() {return _full_collection;}
1583 // Perform any cleanup actions necessary before allowing a verification.
1584 virtual void prepare_for_verify();
1586 // Perform verification.
1588 // vo == UsePrevMarking -> use "prev" marking information,
1589 // vo == UseNextMarking -> use "next" marking information
1590 // vo == UseMarkWord -> use the mark word in the object header
1591 //
1592 // NOTE: Only the "prev" marking information is guaranteed to be
1593 // consistent most of the time, so most calls to this should use
1594 // vo == UsePrevMarking.
1595 // Currently, there is only one case where this is called with
1596 // vo == UseNextMarking, which is to verify the "next" marking
1597 // information at the end of remark.
1598 // Currently there is only one place where this is called with
1599 // vo == UseMarkWord, which is to verify the marking during a
1600 // full GC.
1601 void verify(bool silent, VerifyOption vo);
1603 // Override; it uses the "prev" marking information
1604 virtual void verify(bool silent);
1606 // The methods below are here for convenience and dispatch the
1607 // appropriate method depending on value of the given VerifyOption
1608 // parameter. The values for that parameter, and their meanings,
1609 // are the same as those above.
1611 bool is_obj_dead_cond(const oop obj,
1612 const HeapRegion* hr,
1613 const VerifyOption vo) const;
1615 bool is_obj_dead_cond(const oop obj,
1616 const VerifyOption vo) const;
1618 // Printing
1620 virtual void print_on(outputStream* st) const;
1621 virtual void print_extended_on(outputStream* st) const;
1622 virtual void print_on_error(outputStream* st) const;
1624 virtual void print_gc_threads_on(outputStream* st) const;
1625 virtual void gc_threads_do(ThreadClosure* tc) const;
1627 // Override
1628 void print_tracing_info() const;
1630 // The following two methods are helpful for debugging RSet issues.
1631 void print_cset_rsets() PRODUCT_RETURN;
1632 void print_all_rsets() PRODUCT_RETURN;
1634 public:
1635 size_t pending_card_num();
1636 size_t cards_scanned();
1638 protected:
1639 size_t _max_heap_capacity;
1640 };
1642 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP