Fri, 14 Mar 2014 10:15:46 +0100
8034079: G1: Refactor the HeapRegionSet hierarchy
Reviewed-by: tschatzl, pliden
1 /*
2 * Copyright (c) 2001, 2013, 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/concurrentMark.hpp"
29 #include "gc_implementation/g1/evacuationInfo.hpp"
30 #include "gc_implementation/g1/g1AllocRegion.hpp"
31 #include "gc_implementation/g1/g1HRPrinter.hpp"
32 #include "gc_implementation/g1/g1MonitoringSupport.hpp"
33 #include "gc_implementation/g1/g1RemSet.hpp"
34 #include "gc_implementation/g1/g1SATBCardTableModRefBS.hpp"
35 #include "gc_implementation/g1/g1YCTypes.hpp"
36 #include "gc_implementation/g1/heapRegionSeq.hpp"
37 #include "gc_implementation/g1/heapRegionSet.hpp"
38 #include "gc_implementation/shared/hSpaceCounters.hpp"
39 #include "gc_implementation/shared/parGCAllocBuffer.hpp"
40 #include "memory/barrierSet.hpp"
41 #include "memory/memRegion.hpp"
42 #include "memory/sharedHeap.hpp"
43 #include "utilities/stack.hpp"
45 // A "G1CollectedHeap" is an implementation of a java heap for HotSpot.
46 // It uses the "Garbage First" heap organization and algorithm, which
47 // may combine concurrent marking with parallel, incremental compaction of
48 // heap subsets that will yield large amounts of garbage.
50 // Forward declarations
51 class HeapRegion;
52 class HRRSCleanupTask;
53 class GenerationSpec;
54 class OopsInHeapRegionClosure;
55 class G1KlassScanClosure;
56 class G1ScanHeapEvacClosure;
57 class ObjectClosure;
58 class SpaceClosure;
59 class CompactibleSpaceClosure;
60 class Space;
61 class G1CollectorPolicy;
62 class GenRemSet;
63 class G1RemSet;
64 class HeapRegionRemSetIterator;
65 class ConcurrentMark;
66 class ConcurrentMarkThread;
67 class ConcurrentG1Refine;
68 class ConcurrentGCTimer;
69 class GenerationCounters;
70 class STWGCTimer;
71 class G1NewTracer;
72 class G1OldTracer;
73 class EvacuationFailedInfo;
74 class nmethod;
75 class Ticks;
77 typedef OverflowTaskQueue<StarTask, mtGC> RefToScanQueue;
78 typedef GenericTaskQueueSet<RefToScanQueue, mtGC> RefToScanQueueSet;
80 typedef int RegionIdx_t; // needs to hold [ 0..max_regions() )
81 typedef int CardIdx_t; // needs to hold [ 0..CardsPerRegion )
83 enum GCAllocPurpose {
84 GCAllocForTenured,
85 GCAllocForSurvived,
86 GCAllocPurposeCount
87 };
89 class YoungList : public CHeapObj<mtGC> {
90 private:
91 G1CollectedHeap* _g1h;
93 HeapRegion* _head;
95 HeapRegion* _survivor_head;
96 HeapRegion* _survivor_tail;
98 HeapRegion* _curr;
100 uint _length;
101 uint _survivor_length;
103 size_t _last_sampled_rs_lengths;
104 size_t _sampled_rs_lengths;
106 void empty_list(HeapRegion* list);
108 public:
109 YoungList(G1CollectedHeap* g1h);
111 void push_region(HeapRegion* hr);
112 void add_survivor_region(HeapRegion* hr);
114 void empty_list();
115 bool is_empty() { return _length == 0; }
116 uint length() { return _length; }
117 uint survivor_length() { return _survivor_length; }
119 // Currently we do not keep track of the used byte sum for the
120 // young list and the survivors and it'd be quite a lot of work to
121 // do so. When we'll eventually replace the young list with
122 // instances of HeapRegionLinkedList we'll get that for free. So,
123 // we'll report the more accurate information then.
124 size_t eden_used_bytes() {
125 assert(length() >= survivor_length(), "invariant");
126 return (size_t) (length() - survivor_length()) * HeapRegion::GrainBytes;
127 }
128 size_t survivor_used_bytes() {
129 return (size_t) survivor_length() * HeapRegion::GrainBytes;
130 }
132 void rs_length_sampling_init();
133 bool rs_length_sampling_more();
134 void rs_length_sampling_next();
136 void reset_sampled_info() {
137 _last_sampled_rs_lengths = 0;
138 }
139 size_t sampled_rs_lengths() { return _last_sampled_rs_lengths; }
141 // for development purposes
142 void reset_auxilary_lists();
143 void clear() { _head = NULL; _length = 0; }
145 void clear_survivors() {
146 _survivor_head = NULL;
147 _survivor_tail = NULL;
148 _survivor_length = 0;
149 }
151 HeapRegion* first_region() { return _head; }
152 HeapRegion* first_survivor_region() { return _survivor_head; }
153 HeapRegion* last_survivor_region() { return _survivor_tail; }
155 // debugging
156 bool check_list_well_formed();
157 bool check_list_empty(bool check_sample = true);
158 void print();
159 };
161 class MutatorAllocRegion : public G1AllocRegion {
162 protected:
163 virtual HeapRegion* allocate_new_region(size_t word_size, bool force);
164 virtual void retire_region(HeapRegion* alloc_region, size_t allocated_bytes);
165 public:
166 MutatorAllocRegion()
167 : G1AllocRegion("Mutator Alloc Region", false /* bot_updates */) { }
168 };
170 class SurvivorGCAllocRegion : public G1AllocRegion {
171 protected:
172 virtual HeapRegion* allocate_new_region(size_t word_size, bool force);
173 virtual void retire_region(HeapRegion* alloc_region, size_t allocated_bytes);
174 public:
175 SurvivorGCAllocRegion()
176 : G1AllocRegion("Survivor GC Alloc Region", false /* bot_updates */) { }
177 };
179 class OldGCAllocRegion : public G1AllocRegion {
180 protected:
181 virtual HeapRegion* allocate_new_region(size_t word_size, bool force);
182 virtual void retire_region(HeapRegion* alloc_region, size_t allocated_bytes);
183 public:
184 OldGCAllocRegion()
185 : G1AllocRegion("Old GC Alloc Region", true /* bot_updates */) { }
186 };
188 // The G1 STW is alive closure.
189 // An instance is embedded into the G1CH and used as the
190 // (optional) _is_alive_non_header closure in the STW
191 // reference processor. It is also extensively used during
192 // reference processing during STW evacuation pauses.
193 class G1STWIsAliveClosure: public BoolObjectClosure {
194 G1CollectedHeap* _g1;
195 public:
196 G1STWIsAliveClosure(G1CollectedHeap* g1) : _g1(g1) {}
197 bool do_object_b(oop p);
198 };
200 class RefineCardTableEntryClosure;
202 class G1CollectedHeap : public SharedHeap {
203 friend class VM_G1CollectForAllocation;
204 friend class VM_G1CollectFull;
205 friend class VM_G1IncCollectionPause;
206 friend class VMStructs;
207 friend class MutatorAllocRegion;
208 friend class SurvivorGCAllocRegion;
209 friend class OldGCAllocRegion;
211 // Closures used in implementation.
212 template <G1Barrier barrier, bool do_mark_object>
213 friend class G1ParCopyClosure;
214 friend class G1IsAliveClosure;
215 friend class G1EvacuateFollowersClosure;
216 friend class G1ParScanThreadState;
217 friend class G1ParScanClosureSuper;
218 friend class G1ParEvacuateFollowersClosure;
219 friend class G1ParTask;
220 friend class G1FreeGarbageRegionClosure;
221 friend class RefineCardTableEntryClosure;
222 friend class G1PrepareCompactClosure;
223 friend class RegionSorter;
224 friend class RegionResetter;
225 friend class CountRCClosure;
226 friend class EvacPopObjClosure;
227 friend class G1ParCleanupCTTask;
229 // Other related classes.
230 friend class G1MarkSweep;
232 private:
233 // The one and only G1CollectedHeap, so static functions can find it.
234 static G1CollectedHeap* _g1h;
236 static size_t _humongous_object_threshold_in_words;
238 // Storage for the G1 heap.
239 VirtualSpace _g1_storage;
240 MemRegion _g1_reserved;
242 // The part of _g1_storage that is currently committed.
243 MemRegion _g1_committed;
245 // The master free list. It will satisfy all new region allocations.
246 FreeRegionList _free_list;
248 // The secondary free list which contains regions that have been
249 // freed up during the cleanup process. This will be appended to the
250 // master free list when appropriate.
251 FreeRegionList _secondary_free_list;
253 // It keeps track of the old regions.
254 HeapRegionSet _old_set;
256 // It keeps track of the humongous regions.
257 HeapRegionSet _humongous_set;
259 // The number of regions we could create by expansion.
260 uint _expansion_regions;
262 // The block offset table for the G1 heap.
263 G1BlockOffsetSharedArray* _bot_shared;
265 // Tears down the region sets / lists so that they are empty and the
266 // regions on the heap do not belong to a region set / list. The
267 // only exception is the humongous set which we leave unaltered. If
268 // free_list_only is true, it will only tear down the master free
269 // list. It is called before a Full GC (free_list_only == false) or
270 // before heap shrinking (free_list_only == true).
271 void tear_down_region_sets(bool free_list_only);
273 // Rebuilds the region sets / lists so that they are repopulated to
274 // reflect the contents of the heap. The only exception is the
275 // humongous set which was not torn down in the first place. If
276 // free_list_only is true, it will only rebuild the master free
277 // list. It is called after a Full GC (free_list_only == false) or
278 // after heap shrinking (free_list_only == true).
279 void rebuild_region_sets(bool free_list_only);
281 // The sequence of all heap regions in the heap.
282 HeapRegionSeq _hrs;
284 // Alloc region used to satisfy mutator allocation requests.
285 MutatorAllocRegion _mutator_alloc_region;
287 // Alloc region used to satisfy allocation requests by the GC for
288 // survivor objects.
289 SurvivorGCAllocRegion _survivor_gc_alloc_region;
291 // PLAB sizing policy for survivors.
292 PLABStats _survivor_plab_stats;
294 // Alloc region used to satisfy allocation requests by the GC for
295 // old objects.
296 OldGCAllocRegion _old_gc_alloc_region;
298 // PLAB sizing policy for tenured objects.
299 PLABStats _old_plab_stats;
301 PLABStats* stats_for_purpose(GCAllocPurpose purpose) {
302 PLABStats* stats = NULL;
304 switch (purpose) {
305 case GCAllocForSurvived:
306 stats = &_survivor_plab_stats;
307 break;
308 case GCAllocForTenured:
309 stats = &_old_plab_stats;
310 break;
311 default:
312 assert(false, "unrecognized GCAllocPurpose");
313 }
315 return stats;
316 }
318 // The last old region we allocated to during the last GC.
319 // Typically, it is not full so we should re-use it during the next GC.
320 HeapRegion* _retained_old_gc_alloc_region;
322 // It specifies whether we should attempt to expand the heap after a
323 // region allocation failure. If heap expansion fails we set this to
324 // false so that we don't re-attempt the heap expansion (it's likely
325 // that subsequent expansion attempts will also fail if one fails).
326 // Currently, it is only consulted during GC and it's reset at the
327 // start of each GC.
328 bool _expand_heap_after_alloc_failure;
330 // It resets the mutator alloc region before new allocations can take place.
331 void init_mutator_alloc_region();
333 // It releases the mutator alloc region.
334 void release_mutator_alloc_region();
336 // It initializes the GC alloc regions at the start of a GC.
337 void init_gc_alloc_regions(EvacuationInfo& evacuation_info);
339 // It releases the GC alloc regions at the end of a GC.
340 void release_gc_alloc_regions(uint no_of_gc_workers, EvacuationInfo& evacuation_info);
342 // It does any cleanup that needs to be done on the GC alloc regions
343 // before a Full GC.
344 void abandon_gc_alloc_regions();
346 // Helper for monitoring and management support.
347 G1MonitoringSupport* _g1mm;
349 // Determines PLAB size for a particular allocation purpose.
350 size_t desired_plab_sz(GCAllocPurpose purpose);
352 // Outside of GC pauses, the number of bytes used in all regions other
353 // than the current allocation region.
354 size_t _summary_bytes_used;
356 // This is used for a quick test on whether a reference points into
357 // the collection set or not. Basically, we have an array, with one
358 // byte per region, and that byte denotes whether the corresponding
359 // region is in the collection set or not. The entry corresponding
360 // the bottom of the heap, i.e., region 0, is pointed to by
361 // _in_cset_fast_test_base. The _in_cset_fast_test field has been
362 // biased so that it actually points to address 0 of the address
363 // space, to make the test as fast as possible (we can simply shift
364 // the address to address into it, instead of having to subtract the
365 // bottom of the heap from the address before shifting it; basically
366 // it works in the same way the card table works).
367 bool* _in_cset_fast_test;
369 // The allocated array used for the fast test on whether a reference
370 // points into the collection set or not. This field is also used to
371 // free the array.
372 bool* _in_cset_fast_test_base;
374 // The length of the _in_cset_fast_test_base array.
375 uint _in_cset_fast_test_length;
377 volatile unsigned _gc_time_stamp;
379 size_t* _surviving_young_words;
381 G1HRPrinter _hr_printer;
383 void setup_surviving_young_words();
384 void update_surviving_young_words(size_t* surv_young_words);
385 void cleanup_surviving_young_words();
387 // It decides whether an explicit GC should start a concurrent cycle
388 // instead of doing a STW GC. Currently, a concurrent cycle is
389 // explicitly started if:
390 // (a) cause == _gc_locker and +GCLockerInvokesConcurrent, or
391 // (b) cause == _java_lang_system_gc and +ExplicitGCInvokesConcurrent.
392 // (c) cause == _g1_humongous_allocation
393 bool should_do_concurrent_full_gc(GCCause::Cause cause);
395 // Keeps track of how many "old marking cycles" (i.e., Full GCs or
396 // concurrent cycles) we have started.
397 volatile unsigned int _old_marking_cycles_started;
399 // Keeps track of how many "old marking cycles" (i.e., Full GCs or
400 // concurrent cycles) we have completed.
401 volatile unsigned int _old_marking_cycles_completed;
403 bool _concurrent_cycle_started;
405 // This is a non-product method that is helpful for testing. It is
406 // called at the end of a GC and artificially expands the heap by
407 // allocating a number of dead regions. This way we can induce very
408 // frequent marking cycles and stress the cleanup / concurrent
409 // cleanup code more (as all the regions that will be allocated by
410 // this method will be found dead by the marking cycle).
411 void allocate_dummy_regions() PRODUCT_RETURN;
413 // Clear RSets after a compaction. It also resets the GC time stamps.
414 void clear_rsets_post_compaction();
416 // If the HR printer is active, dump the state of the regions in the
417 // heap after a compaction.
418 void print_hrs_post_compaction();
420 double verify(bool guard, const char* msg);
421 void verify_before_gc();
422 void verify_after_gc();
424 void log_gc_header();
425 void log_gc_footer(double pause_time_sec);
427 // These are macros so that, if the assert fires, we get the correct
428 // line number, file, etc.
430 #define heap_locking_asserts_err_msg(_extra_message_) \
431 err_msg("%s : Heap_lock locked: %s, at safepoint: %s, is VM thread: %s", \
432 (_extra_message_), \
433 BOOL_TO_STR(Heap_lock->owned_by_self()), \
434 BOOL_TO_STR(SafepointSynchronize::is_at_safepoint()), \
435 BOOL_TO_STR(Thread::current()->is_VM_thread()))
437 #define assert_heap_locked() \
438 do { \
439 assert(Heap_lock->owned_by_self(), \
440 heap_locking_asserts_err_msg("should be holding the Heap_lock")); \
441 } while (0)
443 #define assert_heap_locked_or_at_safepoint(_should_be_vm_thread_) \
444 do { \
445 assert(Heap_lock->owned_by_self() || \
446 (SafepointSynchronize::is_at_safepoint() && \
447 ((_should_be_vm_thread_) == Thread::current()->is_VM_thread())), \
448 heap_locking_asserts_err_msg("should be holding the Heap_lock or " \
449 "should be at a safepoint")); \
450 } while (0)
452 #define assert_heap_locked_and_not_at_safepoint() \
453 do { \
454 assert(Heap_lock->owned_by_self() && \
455 !SafepointSynchronize::is_at_safepoint(), \
456 heap_locking_asserts_err_msg("should be holding the Heap_lock and " \
457 "should not be at a safepoint")); \
458 } while (0)
460 #define assert_heap_not_locked() \
461 do { \
462 assert(!Heap_lock->owned_by_self(), \
463 heap_locking_asserts_err_msg("should not be holding the Heap_lock")); \
464 } while (0)
466 #define assert_heap_not_locked_and_not_at_safepoint() \
467 do { \
468 assert(!Heap_lock->owned_by_self() && \
469 !SafepointSynchronize::is_at_safepoint(), \
470 heap_locking_asserts_err_msg("should not be holding the Heap_lock and " \
471 "should not be at a safepoint")); \
472 } while (0)
474 #define assert_at_safepoint(_should_be_vm_thread_) \
475 do { \
476 assert(SafepointSynchronize::is_at_safepoint() && \
477 ((_should_be_vm_thread_) == Thread::current()->is_VM_thread()), \
478 heap_locking_asserts_err_msg("should be at a safepoint")); \
479 } while (0)
481 #define assert_not_at_safepoint() \
482 do { \
483 assert(!SafepointSynchronize::is_at_safepoint(), \
484 heap_locking_asserts_err_msg("should not be at a safepoint")); \
485 } while (0)
487 protected:
489 // The young region list.
490 YoungList* _young_list;
492 // The current policy object for the collector.
493 G1CollectorPolicy* _g1_policy;
495 // This is the second level of trying to allocate a new region. If
496 // new_region() didn't find a region on the free_list, this call will
497 // check whether there's anything available on the
498 // secondary_free_list and/or wait for more regions to appear on
499 // that list, if _free_regions_coming is set.
500 HeapRegion* new_region_try_secondary_free_list();
502 // Try to allocate a single non-humongous HeapRegion sufficient for
503 // an allocation of the given word_size. If do_expand is true,
504 // attempt to expand the heap if necessary to satisfy the allocation
505 // request.
506 HeapRegion* new_region(size_t word_size, bool do_expand);
508 // Attempt to satisfy a humongous allocation request of the given
509 // size by finding a contiguous set of free regions of num_regions
510 // length and remove them from the master free list. Return the
511 // index of the first region or G1_NULL_HRS_INDEX if the search
512 // was unsuccessful.
513 uint humongous_obj_allocate_find_first(uint num_regions,
514 size_t word_size);
516 // Initialize a contiguous set of free regions of length num_regions
517 // and starting at index first so that they appear as a single
518 // humongous region.
519 HeapWord* humongous_obj_allocate_initialize_regions(uint first,
520 uint num_regions,
521 size_t word_size);
523 // Attempt to allocate a humongous object of the given size. Return
524 // NULL if unsuccessful.
525 HeapWord* humongous_obj_allocate(size_t word_size);
527 // The following two methods, allocate_new_tlab() and
528 // mem_allocate(), are the two main entry points from the runtime
529 // into the G1's allocation routines. They have the following
530 // assumptions:
531 //
532 // * They should both be called outside safepoints.
533 //
534 // * They should both be called without holding the Heap_lock.
535 //
536 // * All allocation requests for new TLABs should go to
537 // allocate_new_tlab().
538 //
539 // * All non-TLAB allocation requests should go to mem_allocate().
540 //
541 // * If either call cannot satisfy the allocation request using the
542 // current allocating region, they will try to get a new one. If
543 // this fails, they will attempt to do an evacuation pause and
544 // retry the allocation.
545 //
546 // * If all allocation attempts fail, even after trying to schedule
547 // an evacuation pause, allocate_new_tlab() will return NULL,
548 // whereas mem_allocate() will attempt a heap expansion and/or
549 // schedule a Full GC.
550 //
551 // * We do not allow humongous-sized TLABs. So, allocate_new_tlab
552 // should never be called with word_size being humongous. All
553 // humongous allocation requests should go to mem_allocate() which
554 // will satisfy them with a special path.
556 virtual HeapWord* allocate_new_tlab(size_t word_size);
558 virtual HeapWord* mem_allocate(size_t word_size,
559 bool* gc_overhead_limit_was_exceeded);
561 // The following three methods take a gc_count_before_ret
562 // parameter which is used to return the GC count if the method
563 // returns NULL. Given that we are required to read the GC count
564 // while holding the Heap_lock, and these paths will take the
565 // Heap_lock at some point, it's easier to get them to read the GC
566 // count while holding the Heap_lock before they return NULL instead
567 // of the caller (namely: mem_allocate()) having to also take the
568 // Heap_lock just to read the GC count.
570 // First-level mutator allocation attempt: try to allocate out of
571 // the mutator alloc region without taking the Heap_lock. This
572 // should only be used for non-humongous allocations.
573 inline HeapWord* attempt_allocation(size_t word_size,
574 unsigned int* gc_count_before_ret,
575 int* gclocker_retry_count_ret);
577 // Second-level mutator allocation attempt: take the Heap_lock and
578 // retry the allocation attempt, potentially scheduling a GC
579 // pause. This should only be used for non-humongous allocations.
580 HeapWord* attempt_allocation_slow(size_t word_size,
581 unsigned int* gc_count_before_ret,
582 int* gclocker_retry_count_ret);
584 // Takes the Heap_lock and attempts a humongous allocation. It can
585 // potentially schedule a GC pause.
586 HeapWord* attempt_allocation_humongous(size_t word_size,
587 unsigned int* gc_count_before_ret,
588 int* gclocker_retry_count_ret);
590 // Allocation attempt that should be called during safepoints (e.g.,
591 // at the end of a successful GC). expect_null_mutator_alloc_region
592 // specifies whether the mutator alloc region is expected to be NULL
593 // or not.
594 HeapWord* attempt_allocation_at_safepoint(size_t word_size,
595 bool expect_null_mutator_alloc_region);
597 // It dirties the cards that cover the block so that so that the post
598 // write barrier never queues anything when updating objects on this
599 // block. It is assumed (and in fact we assert) that the block
600 // belongs to a young region.
601 inline void dirty_young_block(HeapWord* start, size_t word_size);
603 // Allocate blocks during garbage collection. Will ensure an
604 // allocation region, either by picking one or expanding the
605 // heap, and then allocate a block of the given size. The block
606 // may not be a humongous - it must fit into a single heap region.
607 HeapWord* par_allocate_during_gc(GCAllocPurpose purpose, size_t word_size);
609 HeapWord* allocate_during_gc_slow(GCAllocPurpose purpose,
610 HeapRegion* alloc_region,
611 bool par,
612 size_t word_size);
614 // Ensure that no further allocations can happen in "r", bearing in mind
615 // that parallel threads might be attempting allocations.
616 void par_allocate_remaining_space(HeapRegion* r);
618 // Allocation attempt during GC for a survivor object / PLAB.
619 inline HeapWord* survivor_attempt_allocation(size_t word_size);
621 // Allocation attempt during GC for an old object / PLAB.
622 inline HeapWord* old_attempt_allocation(size_t word_size);
624 // These methods are the "callbacks" from the G1AllocRegion class.
626 // For mutator alloc regions.
627 HeapRegion* new_mutator_alloc_region(size_t word_size, bool force);
628 void retire_mutator_alloc_region(HeapRegion* alloc_region,
629 size_t allocated_bytes);
631 // For GC alloc regions.
632 HeapRegion* new_gc_alloc_region(size_t word_size, uint count,
633 GCAllocPurpose ap);
634 void retire_gc_alloc_region(HeapRegion* alloc_region,
635 size_t allocated_bytes, GCAllocPurpose ap);
637 // - if explicit_gc is true, the GC is for a System.gc() or a heap
638 // inspection request and should collect the entire heap
639 // - if clear_all_soft_refs is true, all soft references should be
640 // cleared during the GC
641 // - if explicit_gc is false, word_size describes the allocation that
642 // the GC should attempt (at least) to satisfy
643 // - it returns false if it is unable to do the collection due to the
644 // GC locker being active, true otherwise
645 bool do_collection(bool explicit_gc,
646 bool clear_all_soft_refs,
647 size_t word_size);
649 // Callback from VM_G1CollectFull operation.
650 // Perform a full collection.
651 virtual void do_full_collection(bool clear_all_soft_refs);
653 // Resize the heap if necessary after a full collection. If this is
654 // after a collect-for allocation, "word_size" is the allocation size,
655 // and will be considered part of the used portion of the heap.
656 void resize_if_necessary_after_full_collection(size_t word_size);
658 // Callback from VM_G1CollectForAllocation operation.
659 // This function does everything necessary/possible to satisfy a
660 // failed allocation request (including collection, expansion, etc.)
661 HeapWord* satisfy_failed_allocation(size_t word_size, bool* succeeded);
663 // Attempting to expand the heap sufficiently
664 // to support an allocation of the given "word_size". If
665 // successful, perform the allocation and return the address of the
666 // allocated block, or else "NULL".
667 HeapWord* expand_and_allocate(size_t word_size);
669 // Process any reference objects discovered during
670 // an incremental evacuation pause.
671 void process_discovered_references(uint no_of_gc_workers);
673 // Enqueue any remaining discovered references
674 // after processing.
675 void enqueue_discovered_references(uint no_of_gc_workers);
677 public:
679 G1MonitoringSupport* g1mm() {
680 assert(_g1mm != NULL, "should have been initialized");
681 return _g1mm;
682 }
684 // Expand the garbage-first heap by at least the given size (in bytes!).
685 // Returns true if the heap was expanded by the requested amount;
686 // false otherwise.
687 // (Rounds up to a HeapRegion boundary.)
688 bool expand(size_t expand_bytes);
690 // Do anything common to GC's.
691 virtual void gc_prologue(bool full);
692 virtual void gc_epilogue(bool full);
694 // We register a region with the fast "in collection set" test. We
695 // simply set to true the array slot corresponding to this region.
696 void register_region_with_in_cset_fast_test(HeapRegion* r) {
697 assert(_in_cset_fast_test_base != NULL, "sanity");
698 assert(r->in_collection_set(), "invariant");
699 uint index = r->hrs_index();
700 assert(index < _in_cset_fast_test_length, "invariant");
701 assert(!_in_cset_fast_test_base[index], "invariant");
702 _in_cset_fast_test_base[index] = true;
703 }
705 // This is a fast test on whether a reference points into the
706 // collection set or not. Assume that the reference
707 // points into the heap.
708 bool in_cset_fast_test(oop obj) {
709 assert(_in_cset_fast_test != NULL, "sanity");
710 assert(_g1_committed.contains((HeapWord*) obj), err_msg("Given reference outside of heap, is "PTR_FORMAT, (HeapWord*)obj));
711 // no need to subtract the bottom of the heap from obj,
712 // _in_cset_fast_test is biased
713 uintx index = cast_from_oop<uintx>(obj) >> HeapRegion::LogOfHRGrainBytes;
714 bool ret = _in_cset_fast_test[index];
715 // let's make sure the result is consistent with what the slower
716 // test returns
717 assert( ret || !obj_in_cs(obj), "sanity");
718 assert(!ret || obj_in_cs(obj), "sanity");
719 return ret;
720 }
722 void clear_cset_fast_test() {
723 assert(_in_cset_fast_test_base != NULL, "sanity");
724 memset(_in_cset_fast_test_base, false,
725 (size_t) _in_cset_fast_test_length * sizeof(bool));
726 }
728 // This is called at the start of either a concurrent cycle or a Full
729 // GC to update the number of old marking cycles started.
730 void increment_old_marking_cycles_started();
732 // This is called at the end of either a concurrent cycle or a Full
733 // GC to update the number of old marking cycles completed. Those two
734 // can happen in a nested fashion, i.e., we start a concurrent
735 // cycle, a Full GC happens half-way through it which ends first,
736 // and then the cycle notices that a Full GC happened and ends
737 // too. The concurrent parameter is a boolean to help us do a bit
738 // tighter consistency checking in the method. If concurrent is
739 // false, the caller is the inner caller in the nesting (i.e., the
740 // Full GC). If concurrent is true, the caller is the outer caller
741 // in this nesting (i.e., the concurrent cycle). Further nesting is
742 // not currently supported. The end of this call also notifies
743 // the FullGCCount_lock in case a Java thread is waiting for a full
744 // GC to happen (e.g., it called System.gc() with
745 // +ExplicitGCInvokesConcurrent).
746 void increment_old_marking_cycles_completed(bool concurrent);
748 unsigned int old_marking_cycles_completed() {
749 return _old_marking_cycles_completed;
750 }
752 void register_concurrent_cycle_start(const Ticks& start_time);
753 void register_concurrent_cycle_end();
754 void trace_heap_after_concurrent_cycle();
756 G1YCType yc_type();
758 G1HRPrinter* hr_printer() { return &_hr_printer; }
760 // Frees a non-humongous region by initializing its contents and
761 // adding it to the free list that's passed as a parameter (this is
762 // usually a local list which will be appended to the master free
763 // list later). The used bytes of freed regions are accumulated in
764 // pre_used. If par is true, the region's RSet will not be freed
765 // up. The assumption is that this will be done later.
766 void free_region(HeapRegion* hr,
767 FreeRegionList* free_list,
768 bool par);
770 // Frees a humongous region by collapsing it into individual regions
771 // and calling free_region() for each of them. The freed regions
772 // will be added to the free list that's passed as a parameter (this
773 // is usually a local list which will be appended to the master free
774 // list later). The used bytes of freed regions are accumulated in
775 // pre_used. If par is true, the region's RSet will not be freed
776 // up. The assumption is that this will be done later.
777 void free_humongous_region(HeapRegion* hr,
778 FreeRegionList* free_list,
779 bool par);
780 protected:
782 // Shrink the garbage-first heap by at most the given size (in bytes!).
783 // (Rounds down to a HeapRegion boundary.)
784 virtual void shrink(size_t expand_bytes);
785 void shrink_helper(size_t expand_bytes);
787 #if TASKQUEUE_STATS
788 static void print_taskqueue_stats_hdr(outputStream* const st = gclog_or_tty);
789 void print_taskqueue_stats(outputStream* const st = gclog_or_tty) const;
790 void reset_taskqueue_stats();
791 #endif // TASKQUEUE_STATS
793 // Schedule the VM operation that will do an evacuation pause to
794 // satisfy an allocation request of word_size. *succeeded will
795 // return whether the VM operation was successful (it did do an
796 // evacuation pause) or not (another thread beat us to it or the GC
797 // locker was active). Given that we should not be holding the
798 // Heap_lock when we enter this method, we will pass the
799 // gc_count_before (i.e., total_collections()) as a parameter since
800 // it has to be read while holding the Heap_lock. Currently, both
801 // methods that call do_collection_pause() release the Heap_lock
802 // before the call, so it's easy to read gc_count_before just before.
803 HeapWord* do_collection_pause(size_t word_size,
804 unsigned int gc_count_before,
805 bool* succeeded,
806 GCCause::Cause gc_cause);
808 // The guts of the incremental collection pause, executed by the vm
809 // thread. It returns false if it is unable to do the collection due
810 // to the GC locker being active, true otherwise
811 bool do_collection_pause_at_safepoint(double target_pause_time_ms);
813 // Actually do the work of evacuating the collection set.
814 void evacuate_collection_set(EvacuationInfo& evacuation_info);
816 // The g1 remembered set of the heap.
817 G1RemSet* _g1_rem_set;
819 // A set of cards that cover the objects for which the Rsets should be updated
820 // concurrently after the collection.
821 DirtyCardQueueSet _dirty_card_queue_set;
823 // The closure used to refine a single card.
824 RefineCardTableEntryClosure* _refine_cte_cl;
826 // A function to check the consistency of dirty card logs.
827 void check_ct_logs_at_safepoint();
829 // A DirtyCardQueueSet that is used to hold cards that contain
830 // references into the current collection set. This is used to
831 // update the remembered sets of the regions in the collection
832 // set in the event of an evacuation failure.
833 DirtyCardQueueSet _into_cset_dirty_card_queue_set;
835 // After a collection pause, make the regions in the CS into free
836 // regions.
837 void free_collection_set(HeapRegion* cs_head, EvacuationInfo& evacuation_info);
839 // Abandon the current collection set without recording policy
840 // statistics or updating free lists.
841 void abandon_collection_set(HeapRegion* cs_head);
843 // Applies "scan_non_heap_roots" to roots outside the heap,
844 // "scan_rs" to roots inside the heap (having done "set_region" to
845 // indicate the region in which the root resides),
846 // and does "scan_metadata" If "scan_rs" is
847 // NULL, then this step is skipped. The "worker_i"
848 // param is for use with parallel roots processing, and should be
849 // the "i" of the calling parallel worker thread's work(i) function.
850 // In the sequential case this param will be ignored.
851 void g1_process_strong_roots(bool is_scavenging,
852 ScanningOption so,
853 OopClosure* scan_non_heap_roots,
854 OopsInHeapRegionClosure* scan_rs,
855 G1KlassScanClosure* scan_klasses,
856 int worker_i);
858 // Apply "blk" to all the weak roots of the system. These include
859 // JNI weak roots, the code cache, system dictionary, symbol table,
860 // string table, and referents of reachable weak refs.
861 void g1_process_weak_roots(OopClosure* root_closure);
863 // Notifies all the necessary spaces that the committed space has
864 // been updated (either expanded or shrunk). It should be called
865 // after _g1_storage is updated.
866 void update_committed_space(HeapWord* old_end, HeapWord* new_end);
868 // The concurrent marker (and the thread it runs in.)
869 ConcurrentMark* _cm;
870 ConcurrentMarkThread* _cmThread;
871 bool _mark_in_progress;
873 // The concurrent refiner.
874 ConcurrentG1Refine* _cg1r;
876 // The parallel task queues
877 RefToScanQueueSet *_task_queues;
879 // True iff a evacuation has failed in the current collection.
880 bool _evacuation_failed;
882 EvacuationFailedInfo* _evacuation_failed_info_array;
884 // Failed evacuations cause some logical from-space objects to have
885 // forwarding pointers to themselves. Reset them.
886 void remove_self_forwarding_pointers();
888 // Together, these store an object with a preserved mark, and its mark value.
889 Stack<oop, mtGC> _objs_with_preserved_marks;
890 Stack<markOop, mtGC> _preserved_marks_of_objs;
892 // Preserve the mark of "obj", if necessary, in preparation for its mark
893 // word being overwritten with a self-forwarding-pointer.
894 void preserve_mark_if_necessary(oop obj, markOop m);
896 // The stack of evac-failure objects left to be scanned.
897 GrowableArray<oop>* _evac_failure_scan_stack;
898 // The closure to apply to evac-failure objects.
900 OopsInHeapRegionClosure* _evac_failure_closure;
901 // Set the field above.
902 void
903 set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_closure) {
904 _evac_failure_closure = evac_failure_closure;
905 }
907 // Push "obj" on the scan stack.
908 void push_on_evac_failure_scan_stack(oop obj);
909 // Process scan stack entries until the stack is empty.
910 void drain_evac_failure_scan_stack();
911 // True iff an invocation of "drain_scan_stack" is in progress; to
912 // prevent unnecessary recursion.
913 bool _drain_in_progress;
915 // Do any necessary initialization for evacuation-failure handling.
916 // "cl" is the closure that will be used to process evac-failure
917 // objects.
918 void init_for_evac_failure(OopsInHeapRegionClosure* cl);
919 // Do any necessary cleanup for evacuation-failure handling data
920 // structures.
921 void finalize_for_evac_failure();
923 // An attempt to evacuate "obj" has failed; take necessary steps.
924 oop handle_evacuation_failure_par(G1ParScanThreadState* _par_scan_state, oop obj);
925 void handle_evacuation_failure_common(oop obj, markOop m);
927 #ifndef PRODUCT
928 // Support for forcing evacuation failures. Analogous to
929 // PromotionFailureALot for the other collectors.
931 // Records whether G1EvacuationFailureALot should be in effect
932 // for the current GC
933 bool _evacuation_failure_alot_for_current_gc;
935 // Used to record the GC number for interval checking when
936 // determining whether G1EvaucationFailureALot is in effect
937 // for the current GC.
938 size_t _evacuation_failure_alot_gc_number;
940 // Count of the number of evacuations between failures.
941 volatile size_t _evacuation_failure_alot_count;
943 // Set whether G1EvacuationFailureALot should be in effect
944 // for the current GC (based upon the type of GC and which
945 // command line flags are set);
946 inline bool evacuation_failure_alot_for_gc_type(bool gcs_are_young,
947 bool during_initial_mark,
948 bool during_marking);
950 inline void set_evacuation_failure_alot_for_current_gc();
952 // Return true if it's time to cause an evacuation failure.
953 inline bool evacuation_should_fail();
955 // Reset the G1EvacuationFailureALot counters. Should be called at
956 // the end of an evacuation pause in which an evacuation failure occurred.
957 inline void reset_evacuation_should_fail();
958 #endif // !PRODUCT
960 // ("Weak") Reference processing support.
961 //
962 // G1 has 2 instances of the reference processor class. One
963 // (_ref_processor_cm) handles reference object discovery
964 // and subsequent processing during concurrent marking cycles.
965 //
966 // The other (_ref_processor_stw) handles reference object
967 // discovery and processing during full GCs and incremental
968 // evacuation pauses.
969 //
970 // During an incremental pause, reference discovery will be
971 // temporarily disabled for _ref_processor_cm and will be
972 // enabled for _ref_processor_stw. At the end of the evacuation
973 // pause references discovered by _ref_processor_stw will be
974 // processed and discovery will be disabled. The previous
975 // setting for reference object discovery for _ref_processor_cm
976 // will be re-instated.
977 //
978 // At the start of marking:
979 // * Discovery by the CM ref processor is verified to be inactive
980 // and it's discovered lists are empty.
981 // * Discovery by the CM ref processor is then enabled.
982 //
983 // At the end of marking:
984 // * Any references on the CM ref processor's discovered
985 // lists are processed (possibly MT).
986 //
987 // At the start of full GC we:
988 // * Disable discovery by the CM ref processor and
989 // empty CM ref processor's discovered lists
990 // (without processing any entries).
991 // * Verify that the STW ref processor is inactive and it's
992 // discovered lists are empty.
993 // * Temporarily set STW ref processor discovery as single threaded.
994 // * Temporarily clear the STW ref processor's _is_alive_non_header
995 // field.
996 // * Finally enable discovery by the STW ref processor.
997 //
998 // The STW ref processor is used to record any discovered
999 // references during the full GC.
1000 //
1001 // At the end of a full GC we:
1002 // * Enqueue any reference objects discovered by the STW ref processor
1003 // that have non-live referents. This has the side-effect of
1004 // making the STW ref processor inactive by disabling discovery.
1005 // * Verify that the CM ref processor is still inactive
1006 // and no references have been placed on it's discovered
1007 // lists (also checked as a precondition during initial marking).
1009 // The (stw) reference processor...
1010 ReferenceProcessor* _ref_processor_stw;
1012 STWGCTimer* _gc_timer_stw;
1013 ConcurrentGCTimer* _gc_timer_cm;
1015 G1OldTracer* _gc_tracer_cm;
1016 G1NewTracer* _gc_tracer_stw;
1018 // During reference object discovery, the _is_alive_non_header
1019 // closure (if non-null) is applied to the referent object to
1020 // determine whether the referent is live. If so then the
1021 // reference object does not need to be 'discovered' and can
1022 // be treated as a regular oop. This has the benefit of reducing
1023 // the number of 'discovered' reference objects that need to
1024 // be processed.
1025 //
1026 // Instance of the is_alive closure for embedding into the
1027 // STW reference processor as the _is_alive_non_header field.
1028 // Supplying a value for the _is_alive_non_header field is
1029 // optional but doing so prevents unnecessary additions to
1030 // the discovered lists during reference discovery.
1031 G1STWIsAliveClosure _is_alive_closure_stw;
1033 // The (concurrent marking) reference processor...
1034 ReferenceProcessor* _ref_processor_cm;
1036 // Instance of the concurrent mark is_alive closure for embedding
1037 // into the Concurrent Marking reference processor as the
1038 // _is_alive_non_header field. Supplying a value for the
1039 // _is_alive_non_header field is optional but doing so prevents
1040 // unnecessary additions to the discovered lists during reference
1041 // discovery.
1042 G1CMIsAliveClosure _is_alive_closure_cm;
1044 // Cache used by G1CollectedHeap::start_cset_region_for_worker().
1045 HeapRegion** _worker_cset_start_region;
1047 // Time stamp to validate the regions recorded in the cache
1048 // used by G1CollectedHeap::start_cset_region_for_worker().
1049 // The heap region entry for a given worker is valid iff
1050 // the associated time stamp value matches the current value
1051 // of G1CollectedHeap::_gc_time_stamp.
1052 unsigned int* _worker_cset_start_region_time_stamp;
1054 enum G1H_process_strong_roots_tasks {
1055 G1H_PS_filter_satb_buffers,
1056 G1H_PS_refProcessor_oops_do,
1057 // Leave this one last.
1058 G1H_PS_NumElements
1059 };
1061 SubTasksDone* _process_strong_tasks;
1063 volatile bool _free_regions_coming;
1065 public:
1067 SubTasksDone* process_strong_tasks() { return _process_strong_tasks; }
1069 void set_refine_cte_cl_concurrency(bool concurrent);
1071 RefToScanQueue *task_queue(int i) const;
1073 // A set of cards where updates happened during the GC
1074 DirtyCardQueueSet& dirty_card_queue_set() { return _dirty_card_queue_set; }
1076 // A DirtyCardQueueSet that is used to hold cards that contain
1077 // references into the current collection set. This is used to
1078 // update the remembered sets of the regions in the collection
1079 // set in the event of an evacuation failure.
1080 DirtyCardQueueSet& into_cset_dirty_card_queue_set()
1081 { return _into_cset_dirty_card_queue_set; }
1083 // Create a G1CollectedHeap with the specified policy.
1084 // Must call the initialize method afterwards.
1085 // May not return if something goes wrong.
1086 G1CollectedHeap(G1CollectorPolicy* policy);
1088 // Initialize the G1CollectedHeap to have the initial and
1089 // maximum sizes and remembered and barrier sets
1090 // specified by the policy object.
1091 jint initialize();
1093 // Return the (conservative) maximum heap alignment for any G1 heap
1094 static size_t conservative_max_heap_alignment();
1096 // Initialize weak reference processing.
1097 virtual void ref_processing_init();
1099 void set_par_threads(uint t) {
1100 SharedHeap::set_par_threads(t);
1101 // Done in SharedHeap but oddly there are
1102 // two _process_strong_tasks's in a G1CollectedHeap
1103 // so do it here too.
1104 _process_strong_tasks->set_n_threads(t);
1105 }
1107 // Set _n_par_threads according to a policy TBD.
1108 void set_par_threads();
1110 void set_n_termination(int t) {
1111 _process_strong_tasks->set_n_threads(t);
1112 }
1114 virtual CollectedHeap::Name kind() const {
1115 return CollectedHeap::G1CollectedHeap;
1116 }
1118 // The current policy object for the collector.
1119 G1CollectorPolicy* g1_policy() const { return _g1_policy; }
1121 virtual CollectorPolicy* collector_policy() const { return (CollectorPolicy*) g1_policy(); }
1123 // Adaptive size policy. No such thing for g1.
1124 virtual AdaptiveSizePolicy* size_policy() { return NULL; }
1126 // The rem set and barrier set.
1127 G1RemSet* g1_rem_set() const { return _g1_rem_set; }
1129 unsigned get_gc_time_stamp() {
1130 return _gc_time_stamp;
1131 }
1133 void reset_gc_time_stamp() {
1134 _gc_time_stamp = 0;
1135 OrderAccess::fence();
1136 // Clear the cached CSet starting regions and time stamps.
1137 // Their validity is dependent on the GC timestamp.
1138 clear_cset_start_regions();
1139 }
1141 void check_gc_time_stamps() PRODUCT_RETURN;
1143 void increment_gc_time_stamp() {
1144 ++_gc_time_stamp;
1145 OrderAccess::fence();
1146 }
1148 // Reset the given region's GC timestamp. If it's starts humongous,
1149 // also reset the GC timestamp of its corresponding
1150 // continues humongous regions too.
1151 void reset_gc_time_stamps(HeapRegion* hr);
1153 void iterate_dirty_card_closure(CardTableEntryClosure* cl,
1154 DirtyCardQueue* into_cset_dcq,
1155 bool concurrent, int worker_i);
1157 // The shared block offset table array.
1158 G1BlockOffsetSharedArray* bot_shared() const { return _bot_shared; }
1160 // Reference Processing accessors
1162 // The STW reference processor....
1163 ReferenceProcessor* ref_processor_stw() const { return _ref_processor_stw; }
1165 // The Concurrent Marking reference processor...
1166 ReferenceProcessor* ref_processor_cm() const { return _ref_processor_cm; }
1168 ConcurrentGCTimer* gc_timer_cm() const { return _gc_timer_cm; }
1169 G1OldTracer* gc_tracer_cm() const { return _gc_tracer_cm; }
1171 virtual size_t capacity() const;
1172 virtual size_t used() const;
1173 // This should be called when we're not holding the heap lock. The
1174 // result might be a bit inaccurate.
1175 size_t used_unlocked() const;
1176 size_t recalculate_used() const;
1178 // These virtual functions do the actual allocation.
1179 // Some heaps may offer a contiguous region for shared non-blocking
1180 // allocation, via inlined code (by exporting the address of the top and
1181 // end fields defining the extent of the contiguous allocation region.)
1182 // But G1CollectedHeap doesn't yet support this.
1184 // Return an estimate of the maximum allocation that could be performed
1185 // without triggering any collection or expansion activity. In a
1186 // generational collector, for example, this is probably the largest
1187 // allocation that could be supported (without expansion) in the youngest
1188 // generation. It is "unsafe" because no locks are taken; the result
1189 // should be treated as an approximation, not a guarantee, for use in
1190 // heuristic resizing decisions.
1191 virtual size_t unsafe_max_alloc();
1193 virtual bool is_maximal_no_gc() const {
1194 return _g1_storage.uncommitted_size() == 0;
1195 }
1197 // The total number of regions in the heap.
1198 uint n_regions() { return _hrs.length(); }
1200 // The max number of regions in the heap.
1201 uint max_regions() { return _hrs.max_length(); }
1203 // The number of regions that are completely free.
1204 uint free_regions() { return _free_list.length(); }
1206 // The number of regions that are not completely free.
1207 uint used_regions() { return n_regions() - free_regions(); }
1209 // The number of regions available for "regular" expansion.
1210 uint expansion_regions() { return _expansion_regions; }
1212 // Factory method for HeapRegion instances. It will return NULL if
1213 // the allocation fails.
1214 HeapRegion* new_heap_region(uint hrs_index, HeapWord* bottom);
1216 void verify_not_dirty_region(HeapRegion* hr) PRODUCT_RETURN;
1217 void verify_dirty_region(HeapRegion* hr) PRODUCT_RETURN;
1218 void verify_dirty_young_list(HeapRegion* head) PRODUCT_RETURN;
1219 void verify_dirty_young_regions() PRODUCT_RETURN;
1221 // verify_region_sets() performs verification over the region
1222 // lists. It will be compiled in the product code to be used when
1223 // necessary (i.e., during heap verification).
1224 void verify_region_sets();
1226 // verify_region_sets_optional() is planted in the code for
1227 // list verification in non-product builds (and it can be enabled in
1228 // product builds by defining HEAP_REGION_SET_FORCE_VERIFY to be 1).
1229 #if HEAP_REGION_SET_FORCE_VERIFY
1230 void verify_region_sets_optional() {
1231 verify_region_sets();
1232 }
1233 #else // HEAP_REGION_SET_FORCE_VERIFY
1234 void verify_region_sets_optional() { }
1235 #endif // HEAP_REGION_SET_FORCE_VERIFY
1237 #ifdef ASSERT
1238 bool is_on_master_free_list(HeapRegion* hr) {
1239 return hr->containing_set() == &_free_list;
1240 }
1241 #endif // ASSERT
1243 // Wrapper for the region list operations that can be called from
1244 // methods outside this class.
1246 void secondary_free_list_add_as_tail(FreeRegionList* list) {
1247 _secondary_free_list.add_as_tail(list);
1248 }
1250 void append_secondary_free_list() {
1251 _free_list.add_as_head(&_secondary_free_list);
1252 }
1254 void append_secondary_free_list_if_not_empty_with_lock() {
1255 // If the secondary free list looks empty there's no reason to
1256 // take the lock and then try to append it.
1257 if (!_secondary_free_list.is_empty()) {
1258 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag);
1259 append_secondary_free_list();
1260 }
1261 }
1263 void old_set_remove(HeapRegion* hr) {
1264 _old_set.remove(hr);
1265 }
1267 size_t non_young_capacity_bytes() {
1268 return _old_set.total_capacity_bytes() + _humongous_set.total_capacity_bytes();
1269 }
1271 void set_free_regions_coming();
1272 void reset_free_regions_coming();
1273 bool free_regions_coming() { return _free_regions_coming; }
1274 void wait_while_free_regions_coming();
1276 // Determine whether the given region is one that we are using as an
1277 // old GC alloc region.
1278 bool is_old_gc_alloc_region(HeapRegion* hr) {
1279 return hr == _retained_old_gc_alloc_region;
1280 }
1282 // Perform a collection of the heap; intended for use in implementing
1283 // "System.gc". This probably implies as full a collection as the
1284 // "CollectedHeap" supports.
1285 virtual void collect(GCCause::Cause cause);
1287 // The same as above but assume that the caller holds the Heap_lock.
1288 void collect_locked(GCCause::Cause cause);
1290 // True iff an evacuation has failed in the most-recent collection.
1291 bool evacuation_failed() { return _evacuation_failed; }
1293 void remove_from_old_sets(const HeapRegionSetCount& old_regions_removed, const HeapRegionSetCount& humongous_regions_removed);
1294 void prepend_to_freelist(FreeRegionList* list);
1295 void decrement_summary_bytes(size_t bytes);
1297 // Returns "TRUE" iff "p" points into the committed areas of the heap.
1298 virtual bool is_in(const void* p) const;
1300 // Return "TRUE" iff the given object address is within the collection
1301 // set.
1302 inline bool obj_in_cs(oop obj);
1304 // Return "TRUE" iff the given object address is in the reserved
1305 // region of g1.
1306 bool is_in_g1_reserved(const void* p) const {
1307 return _g1_reserved.contains(p);
1308 }
1310 // Returns a MemRegion that corresponds to the space that has been
1311 // reserved for the heap
1312 MemRegion g1_reserved() {
1313 return _g1_reserved;
1314 }
1316 // Returns a MemRegion that corresponds to the space that has been
1317 // committed in the heap
1318 MemRegion g1_committed() {
1319 return _g1_committed;
1320 }
1322 virtual bool is_in_closed_subset(const void* p) const;
1324 G1SATBCardTableModRefBS* g1_barrier_set() {
1325 return (G1SATBCardTableModRefBS*) barrier_set();
1326 }
1328 // This resets the card table to all zeros. It is used after
1329 // a collection pause which used the card table to claim cards.
1330 void cleanUpCardTable();
1332 // Iteration functions.
1334 // Iterate over all the ref-containing fields of all objects, calling
1335 // "cl.do_oop" on each.
1336 virtual void oop_iterate(ExtendedOopClosure* cl);
1338 // Same as above, restricted to a memory region.
1339 void oop_iterate(MemRegion mr, ExtendedOopClosure* cl);
1341 // Iterate over all objects, calling "cl.do_object" on each.
1342 virtual void object_iterate(ObjectClosure* cl);
1344 virtual void safe_object_iterate(ObjectClosure* cl) {
1345 object_iterate(cl);
1346 }
1348 // Iterate over all spaces in use in the heap, in ascending address order.
1349 virtual void space_iterate(SpaceClosure* cl);
1351 // Iterate over heap regions, in address order, terminating the
1352 // iteration early if the "doHeapRegion" method returns "true".
1353 void heap_region_iterate(HeapRegionClosure* blk) const;
1355 // Return the region with the given index. It assumes the index is valid.
1356 HeapRegion* region_at(uint index) const { return _hrs.at(index); }
1358 // Divide the heap region sequence into "chunks" of some size (the number
1359 // of regions divided by the number of parallel threads times some
1360 // overpartition factor, currently 4). Assumes that this will be called
1361 // in parallel by ParallelGCThreads worker threads with discinct worker
1362 // ids in the range [0..max(ParallelGCThreads-1, 1)], that all parallel
1363 // calls will use the same "claim_value", and that that claim value is
1364 // different from the claim_value of any heap region before the start of
1365 // the iteration. Applies "blk->doHeapRegion" to each of the regions, by
1366 // attempting to claim the first region in each chunk, and, if
1367 // successful, applying the closure to each region in the chunk (and
1368 // setting the claim value of the second and subsequent regions of the
1369 // chunk.) For now requires that "doHeapRegion" always returns "false",
1370 // i.e., that a closure never attempt to abort a traversal.
1371 void heap_region_par_iterate_chunked(HeapRegionClosure* blk,
1372 uint worker,
1373 uint no_of_par_workers,
1374 jint claim_value);
1376 // It resets all the region claim values to the default.
1377 void reset_heap_region_claim_values();
1379 // Resets the claim values of regions in the current
1380 // collection set to the default.
1381 void reset_cset_heap_region_claim_values();
1383 #ifdef ASSERT
1384 bool check_heap_region_claim_values(jint claim_value);
1386 // Same as the routine above but only checks regions in the
1387 // current collection set.
1388 bool check_cset_heap_region_claim_values(jint claim_value);
1389 #endif // ASSERT
1391 // Clear the cached cset start regions and (more importantly)
1392 // the time stamps. Called when we reset the GC time stamp.
1393 void clear_cset_start_regions();
1395 // Given the id of a worker, obtain or calculate a suitable
1396 // starting region for iterating over the current collection set.
1397 HeapRegion* start_cset_region_for_worker(int worker_i);
1399 // This is a convenience method that is used by the
1400 // HeapRegionIterator classes to calculate the starting region for
1401 // each worker so that they do not all start from the same region.
1402 HeapRegion* start_region_for_worker(uint worker_i, uint no_of_par_workers);
1404 // Iterate over the regions (if any) in the current collection set.
1405 void collection_set_iterate(HeapRegionClosure* blk);
1407 // As above but starting from region r
1408 void collection_set_iterate_from(HeapRegion* r, HeapRegionClosure *blk);
1410 // Returns the first (lowest address) compactible space in the heap.
1411 virtual CompactibleSpace* first_compactible_space();
1413 // A CollectedHeap will contain some number of spaces. This finds the
1414 // space containing a given address, or else returns NULL.
1415 virtual Space* space_containing(const void* addr) const;
1417 // A G1CollectedHeap will contain some number of heap regions. This
1418 // finds the region containing a given address, or else returns NULL.
1419 template <class T>
1420 inline HeapRegion* heap_region_containing(const T addr) const;
1422 // Like the above, but requires "addr" to be in the heap (to avoid a
1423 // null-check), and unlike the above, may return an continuing humongous
1424 // region.
1425 template <class T>
1426 inline HeapRegion* heap_region_containing_raw(const T addr) const;
1428 // A CollectedHeap is divided into a dense sequence of "blocks"; that is,
1429 // each address in the (reserved) heap is a member of exactly
1430 // one block. The defining characteristic of a block is that it is
1431 // possible to find its size, and thus to progress forward to the next
1432 // block. (Blocks may be of different sizes.) Thus, blocks may
1433 // represent Java objects, or they might be free blocks in a
1434 // free-list-based heap (or subheap), as long as the two kinds are
1435 // distinguishable and the size of each is determinable.
1437 // Returns the address of the start of the "block" that contains the
1438 // address "addr". We say "blocks" instead of "object" since some heaps
1439 // may not pack objects densely; a chunk may either be an object or a
1440 // non-object.
1441 virtual HeapWord* block_start(const void* addr) const;
1443 // Requires "addr" to be the start of a chunk, and returns its size.
1444 // "addr + size" is required to be the start of a new chunk, or the end
1445 // of the active area of the heap.
1446 virtual size_t block_size(const HeapWord* addr) const;
1448 // Requires "addr" to be the start of a block, and returns "TRUE" iff
1449 // the block is an object.
1450 virtual bool block_is_obj(const HeapWord* addr) const;
1452 // Does this heap support heap inspection? (+PrintClassHistogram)
1453 virtual bool supports_heap_inspection() const { return true; }
1455 // Section on thread-local allocation buffers (TLABs)
1456 // See CollectedHeap for semantics.
1458 bool supports_tlab_allocation() const;
1459 size_t tlab_capacity(Thread* ignored) const;
1460 size_t tlab_used(Thread* ignored) const;
1461 size_t max_tlab_size() const;
1462 size_t unsafe_max_tlab_alloc(Thread* ignored) const;
1464 // Can a compiler initialize a new object without store barriers?
1465 // This permission only extends from the creation of a new object
1466 // via a TLAB up to the first subsequent safepoint. If such permission
1467 // is granted for this heap type, the compiler promises to call
1468 // defer_store_barrier() below on any slow path allocation of
1469 // a new object for which such initializing store barriers will
1470 // have been elided. G1, like CMS, allows this, but should be
1471 // ready to provide a compensating write barrier as necessary
1472 // if that storage came out of a non-young region. The efficiency
1473 // of this implementation depends crucially on being able to
1474 // answer very efficiently in constant time whether a piece of
1475 // storage in the heap comes from a young region or not.
1476 // See ReduceInitialCardMarks.
1477 virtual bool can_elide_tlab_store_barriers() const {
1478 return true;
1479 }
1481 virtual bool card_mark_must_follow_store() const {
1482 return true;
1483 }
1485 bool is_in_young(const oop obj) {
1486 HeapRegion* hr = heap_region_containing(obj);
1487 return hr != NULL && hr->is_young();
1488 }
1490 #ifdef ASSERT
1491 virtual bool is_in_partial_collection(const void* p);
1492 #endif
1494 virtual bool is_scavengable(const void* addr);
1496 // We don't need barriers for initializing stores to objects
1497 // in the young gen: for the SATB pre-barrier, there is no
1498 // pre-value that needs to be remembered; for the remembered-set
1499 // update logging post-barrier, we don't maintain remembered set
1500 // information for young gen objects.
1501 virtual bool can_elide_initializing_store_barrier(oop new_obj) {
1502 return is_in_young(new_obj);
1503 }
1505 // Returns "true" iff the given word_size is "very large".
1506 static bool isHumongous(size_t word_size) {
1507 // Note this has to be strictly greater-than as the TLABs
1508 // are capped at the humongous thresold and we want to
1509 // ensure that we don't try to allocate a TLAB as
1510 // humongous and that we don't allocate a humongous
1511 // object in a TLAB.
1512 return word_size > _humongous_object_threshold_in_words;
1513 }
1515 // Update mod union table with the set of dirty cards.
1516 void updateModUnion();
1518 // Set the mod union bits corresponding to the given memRegion. Note
1519 // that this is always a safe operation, since it doesn't clear any
1520 // bits.
1521 void markModUnionRange(MemRegion mr);
1523 // Records the fact that a marking phase is no longer in progress.
1524 void set_marking_complete() {
1525 _mark_in_progress = false;
1526 }
1527 void set_marking_started() {
1528 _mark_in_progress = true;
1529 }
1530 bool mark_in_progress() {
1531 return _mark_in_progress;
1532 }
1534 // Print the maximum heap capacity.
1535 virtual size_t max_capacity() const;
1537 virtual jlong millis_since_last_gc();
1540 // Convenience function to be used in situations where the heap type can be
1541 // asserted to be this type.
1542 static G1CollectedHeap* heap();
1544 void set_region_short_lived_locked(HeapRegion* hr);
1545 // add appropriate methods for any other surv rate groups
1547 YoungList* young_list() const { return _young_list; }
1549 // debugging
1550 bool check_young_list_well_formed() {
1551 return _young_list->check_list_well_formed();
1552 }
1554 bool check_young_list_empty(bool check_heap,
1555 bool check_sample = true);
1557 // *** Stuff related to concurrent marking. It's not clear to me that so
1558 // many of these need to be public.
1560 // The functions below are helper functions that a subclass of
1561 // "CollectedHeap" can use in the implementation of its virtual
1562 // functions.
1563 // This performs a concurrent marking of the live objects in a
1564 // bitmap off to the side.
1565 void doConcurrentMark();
1567 bool isMarkedPrev(oop obj) const;
1568 bool isMarkedNext(oop obj) const;
1570 // Determine if an object is dead, given the object and also
1571 // the region to which the object belongs. An object is dead
1572 // iff a) it was not allocated since the last mark and b) it
1573 // is not marked.
1575 bool is_obj_dead(const oop obj, const HeapRegion* hr) const {
1576 return
1577 !hr->obj_allocated_since_prev_marking(obj) &&
1578 !isMarkedPrev(obj);
1579 }
1581 // This function returns true when an object has been
1582 // around since the previous marking and hasn't yet
1583 // been marked during this marking.
1585 bool is_obj_ill(const oop obj, const HeapRegion* hr) const {
1586 return
1587 !hr->obj_allocated_since_next_marking(obj) &&
1588 !isMarkedNext(obj);
1589 }
1591 // Determine if an object is dead, given only the object itself.
1592 // This will find the region to which the object belongs and
1593 // then call the region version of the same function.
1595 // Added if it is NULL it isn't dead.
1597 bool is_obj_dead(const oop obj) const {
1598 const HeapRegion* hr = heap_region_containing(obj);
1599 if (hr == NULL) {
1600 if (obj == NULL) return false;
1601 else return true;
1602 }
1603 else return is_obj_dead(obj, hr);
1604 }
1606 bool is_obj_ill(const oop obj) const {
1607 const HeapRegion* hr = heap_region_containing(obj);
1608 if (hr == NULL) {
1609 if (obj == NULL) return false;
1610 else return true;
1611 }
1612 else return is_obj_ill(obj, hr);
1613 }
1615 bool allocated_since_marking(oop obj, HeapRegion* hr, VerifyOption vo);
1616 HeapWord* top_at_mark_start(HeapRegion* hr, VerifyOption vo);
1617 bool is_marked(oop obj, VerifyOption vo);
1618 const char* top_at_mark_start_str(VerifyOption vo);
1620 ConcurrentMark* concurrent_mark() const { return _cm; }
1622 // Refinement
1624 ConcurrentG1Refine* concurrent_g1_refine() const { return _cg1r; }
1626 // The dirty cards region list is used to record a subset of regions
1627 // whose cards need clearing. The list if populated during the
1628 // remembered set scanning and drained during the card table
1629 // cleanup. Although the methods are reentrant, population/draining
1630 // phases must not overlap. For synchronization purposes the last
1631 // element on the list points to itself.
1632 HeapRegion* _dirty_cards_region_list;
1633 void push_dirty_cards_region(HeapRegion* hr);
1634 HeapRegion* pop_dirty_cards_region();
1636 // Optimized nmethod scanning support routines
1638 // Register the given nmethod with the G1 heap
1639 virtual void register_nmethod(nmethod* nm);
1641 // Unregister the given nmethod from the G1 heap
1642 virtual void unregister_nmethod(nmethod* nm);
1644 // Migrate the nmethods in the code root lists of the regions
1645 // in the collection set to regions in to-space. In the event
1646 // of an evacuation failure, nmethods that reference objects
1647 // that were not successfullly evacuated are not migrated.
1648 void migrate_strong_code_roots();
1650 // During an initial mark pause, mark all the code roots that
1651 // point into regions *not* in the collection set.
1652 void mark_strong_code_roots(uint worker_id);
1654 // Rebuild the stong code root lists for each region
1655 // after a full GC
1656 void rebuild_strong_code_roots();
1658 // Delete entries for dead interned string and clean up unreferenced symbols
1659 // in symbol table, possibly in parallel.
1660 void unlink_string_and_symbol_table(BoolObjectClosure* is_alive, bool unlink_strings = true, bool unlink_symbols = true);
1662 // Verification
1664 // The following is just to alert the verification code
1665 // that a full collection has occurred and that the
1666 // remembered sets are no longer up to date.
1667 bool _full_collection;
1668 void set_full_collection() { _full_collection = true;}
1669 void clear_full_collection() {_full_collection = false;}
1670 bool full_collection() {return _full_collection;}
1672 // Perform any cleanup actions necessary before allowing a verification.
1673 virtual void prepare_for_verify();
1675 // Perform verification.
1677 // vo == UsePrevMarking -> use "prev" marking information,
1678 // vo == UseNextMarking -> use "next" marking information
1679 // vo == UseMarkWord -> use the mark word in the object header
1680 //
1681 // NOTE: Only the "prev" marking information is guaranteed to be
1682 // consistent most of the time, so most calls to this should use
1683 // vo == UsePrevMarking.
1684 // Currently, there is only one case where this is called with
1685 // vo == UseNextMarking, which is to verify the "next" marking
1686 // information at the end of remark.
1687 // Currently there is only one place where this is called with
1688 // vo == UseMarkWord, which is to verify the marking during a
1689 // full GC.
1690 void verify(bool silent, VerifyOption vo);
1692 // Override; it uses the "prev" marking information
1693 virtual void verify(bool silent);
1695 // The methods below are here for convenience and dispatch the
1696 // appropriate method depending on value of the given VerifyOption
1697 // parameter. The values for that parameter, and their meanings,
1698 // are the same as those above.
1700 bool is_obj_dead_cond(const oop obj,
1701 const HeapRegion* hr,
1702 const VerifyOption vo) const {
1703 switch (vo) {
1704 case VerifyOption_G1UsePrevMarking: return is_obj_dead(obj, hr);
1705 case VerifyOption_G1UseNextMarking: return is_obj_ill(obj, hr);
1706 case VerifyOption_G1UseMarkWord: return !obj->is_gc_marked();
1707 default: ShouldNotReachHere();
1708 }
1709 return false; // keep some compilers happy
1710 }
1712 bool is_obj_dead_cond(const oop obj,
1713 const VerifyOption vo) const {
1714 switch (vo) {
1715 case VerifyOption_G1UsePrevMarking: return is_obj_dead(obj);
1716 case VerifyOption_G1UseNextMarking: return is_obj_ill(obj);
1717 case VerifyOption_G1UseMarkWord: return !obj->is_gc_marked();
1718 default: ShouldNotReachHere();
1719 }
1720 return false; // keep some compilers happy
1721 }
1723 // Printing
1725 virtual void print_on(outputStream* st) const;
1726 virtual void print_extended_on(outputStream* st) const;
1727 virtual void print_on_error(outputStream* st) const;
1729 virtual void print_gc_threads_on(outputStream* st) const;
1730 virtual void gc_threads_do(ThreadClosure* tc) const;
1732 // Override
1733 void print_tracing_info() const;
1735 // The following two methods are helpful for debugging RSet issues.
1736 void print_cset_rsets() PRODUCT_RETURN;
1737 void print_all_rsets() PRODUCT_RETURN;
1739 public:
1740 void stop_conc_gc_threads();
1742 size_t pending_card_num();
1743 size_t cards_scanned();
1745 protected:
1746 size_t _max_heap_capacity;
1747 };
1749 class G1ParGCAllocBuffer: public ParGCAllocBuffer {
1750 private:
1751 bool _retired;
1753 public:
1754 G1ParGCAllocBuffer(size_t gclab_word_size);
1756 void set_buf(HeapWord* buf) {
1757 ParGCAllocBuffer::set_buf(buf);
1758 _retired = false;
1759 }
1761 void retire(bool end_of_gc, bool retain) {
1762 if (_retired)
1763 return;
1764 ParGCAllocBuffer::retire(end_of_gc, retain);
1765 _retired = true;
1766 }
1767 };
1769 class G1ParScanThreadState : public StackObj {
1770 protected:
1771 G1CollectedHeap* _g1h;
1772 RefToScanQueue* _refs;
1773 DirtyCardQueue _dcq;
1774 G1SATBCardTableModRefBS* _ct_bs;
1775 G1RemSet* _g1_rem;
1777 G1ParGCAllocBuffer _surviving_alloc_buffer;
1778 G1ParGCAllocBuffer _tenured_alloc_buffer;
1779 G1ParGCAllocBuffer* _alloc_buffers[GCAllocPurposeCount];
1780 ageTable _age_table;
1782 G1ParScanClosure _scanner;
1784 size_t _alloc_buffer_waste;
1785 size_t _undo_waste;
1787 OopsInHeapRegionClosure* _evac_failure_cl;
1788 G1ParScanHeapEvacClosure* _evac_cl;
1789 G1ParScanPartialArrayClosure* _partial_scan_cl;
1791 int _hash_seed;
1792 uint _queue_num;
1794 size_t _term_attempts;
1796 double _start;
1797 double _start_strong_roots;
1798 double _strong_roots_time;
1799 double _start_term;
1800 double _term_time;
1802 // Map from young-age-index (0 == not young, 1 is youngest) to
1803 // surviving words. base is what we get back from the malloc call
1804 size_t* _surviving_young_words_base;
1805 // this points into the array, as we use the first few entries for padding
1806 size_t* _surviving_young_words;
1808 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t))
1810 void add_to_alloc_buffer_waste(size_t waste) { _alloc_buffer_waste += waste; }
1812 void add_to_undo_waste(size_t waste) { _undo_waste += waste; }
1814 DirtyCardQueue& dirty_card_queue() { return _dcq; }
1815 G1SATBCardTableModRefBS* ctbs() { return _ct_bs; }
1817 template <class T> void immediate_rs_update(HeapRegion* from, T* p, int tid) {
1818 if (!from->is_survivor()) {
1819 _g1_rem->par_write_ref(from, p, tid);
1820 }
1821 }
1823 template <class T> void deferred_rs_update(HeapRegion* from, T* p, int tid) {
1824 // If the new value of the field points to the same region or
1825 // is the to-space, we don't need to include it in the Rset updates.
1826 if (!from->is_in_reserved(oopDesc::load_decode_heap_oop(p)) && !from->is_survivor()) {
1827 size_t card_index = ctbs()->index_for(p);
1828 // If the card hasn't been added to the buffer, do it.
1829 if (ctbs()->mark_card_deferred(card_index)) {
1830 dirty_card_queue().enqueue((jbyte*)ctbs()->byte_for_index(card_index));
1831 }
1832 }
1833 }
1835 public:
1836 G1ParScanThreadState(G1CollectedHeap* g1h, uint queue_num, ReferenceProcessor* rp);
1838 ~G1ParScanThreadState() {
1839 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base, mtGC);
1840 }
1842 RefToScanQueue* refs() { return _refs; }
1843 ageTable* age_table() { return &_age_table; }
1845 G1ParGCAllocBuffer* alloc_buffer(GCAllocPurpose purpose) {
1846 return _alloc_buffers[purpose];
1847 }
1849 size_t alloc_buffer_waste() const { return _alloc_buffer_waste; }
1850 size_t undo_waste() const { return _undo_waste; }
1852 #ifdef ASSERT
1853 bool verify_ref(narrowOop* ref) const;
1854 bool verify_ref(oop* ref) const;
1855 bool verify_task(StarTask ref) const;
1856 #endif // ASSERT
1858 template <class T> void push_on_queue(T* ref) {
1859 assert(verify_ref(ref), "sanity");
1860 refs()->push(ref);
1861 }
1863 template <class T> void update_rs(HeapRegion* from, T* p, int tid) {
1864 if (G1DeferredRSUpdate) {
1865 deferred_rs_update(from, p, tid);
1866 } else {
1867 immediate_rs_update(from, p, tid);
1868 }
1869 }
1871 HeapWord* allocate_slow(GCAllocPurpose purpose, size_t word_sz) {
1872 HeapWord* obj = NULL;
1873 size_t gclab_word_size = _g1h->desired_plab_sz(purpose);
1874 if (word_sz * 100 < gclab_word_size * ParallelGCBufferWastePct) {
1875 G1ParGCAllocBuffer* alloc_buf = alloc_buffer(purpose);
1876 add_to_alloc_buffer_waste(alloc_buf->words_remaining());
1877 alloc_buf->retire(false /* end_of_gc */, false /* retain */);
1879 HeapWord* buf = _g1h->par_allocate_during_gc(purpose, gclab_word_size);
1880 if (buf == NULL) return NULL; // Let caller handle allocation failure.
1881 // Otherwise.
1882 alloc_buf->set_word_size(gclab_word_size);
1883 alloc_buf->set_buf(buf);
1885 obj = alloc_buf->allocate(word_sz);
1886 assert(obj != NULL, "buffer was definitely big enough...");
1887 } else {
1888 obj = _g1h->par_allocate_during_gc(purpose, word_sz);
1889 }
1890 return obj;
1891 }
1893 HeapWord* allocate(GCAllocPurpose purpose, size_t word_sz) {
1894 HeapWord* obj = alloc_buffer(purpose)->allocate(word_sz);
1895 if (obj != NULL) return obj;
1896 return allocate_slow(purpose, word_sz);
1897 }
1899 void undo_allocation(GCAllocPurpose purpose, HeapWord* obj, size_t word_sz) {
1900 if (alloc_buffer(purpose)->contains(obj)) {
1901 assert(alloc_buffer(purpose)->contains(obj + word_sz - 1),
1902 "should contain whole object");
1903 alloc_buffer(purpose)->undo_allocation(obj, word_sz);
1904 } else {
1905 CollectedHeap::fill_with_object(obj, word_sz);
1906 add_to_undo_waste(word_sz);
1907 }
1908 }
1910 void set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_cl) {
1911 _evac_failure_cl = evac_failure_cl;
1912 }
1913 OopsInHeapRegionClosure* evac_failure_closure() {
1914 return _evac_failure_cl;
1915 }
1917 void set_evac_closure(G1ParScanHeapEvacClosure* evac_cl) {
1918 _evac_cl = evac_cl;
1919 }
1921 void set_partial_scan_closure(G1ParScanPartialArrayClosure* partial_scan_cl) {
1922 _partial_scan_cl = partial_scan_cl;
1923 }
1925 int* hash_seed() { return &_hash_seed; }
1926 uint queue_num() { return _queue_num; }
1928 size_t term_attempts() const { return _term_attempts; }
1929 void note_term_attempt() { _term_attempts++; }
1931 void start_strong_roots() {
1932 _start_strong_roots = os::elapsedTime();
1933 }
1934 void end_strong_roots() {
1935 _strong_roots_time += (os::elapsedTime() - _start_strong_roots);
1936 }
1937 double strong_roots_time() const { return _strong_roots_time; }
1939 void start_term_time() {
1940 note_term_attempt();
1941 _start_term = os::elapsedTime();
1942 }
1943 void end_term_time() {
1944 _term_time += (os::elapsedTime() - _start_term);
1945 }
1946 double term_time() const { return _term_time; }
1948 double elapsed_time() const {
1949 return os::elapsedTime() - _start;
1950 }
1952 static void
1953 print_termination_stats_hdr(outputStream* const st = gclog_or_tty);
1954 void
1955 print_termination_stats(int i, outputStream* const st = gclog_or_tty) const;
1957 size_t* surviving_young_words() {
1958 // We add on to hide entry 0 which accumulates surviving words for
1959 // age -1 regions (i.e. non-young ones)
1960 return _surviving_young_words;
1961 }
1963 void retire_alloc_buffers() {
1964 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) {
1965 size_t waste = _alloc_buffers[ap]->words_remaining();
1966 add_to_alloc_buffer_waste(waste);
1967 _alloc_buffers[ap]->flush_stats_and_retire(_g1h->stats_for_purpose((GCAllocPurpose)ap),
1968 true /* end_of_gc */,
1969 false /* retain */);
1970 }
1971 }
1973 oop copy_to_survivor_space(oop const obj);
1975 template <class T> void deal_with_reference(T* ref_to_scan) {
1976 if (has_partial_array_mask(ref_to_scan)) {
1977 _partial_scan_cl->do_oop_nv(ref_to_scan);
1978 } else {
1979 // Note: we can use "raw" versions of "region_containing" because
1980 // "obj_to_scan" is definitely in the heap, and is not in a
1981 // humongous region.
1982 HeapRegion* r = _g1h->heap_region_containing_raw(ref_to_scan);
1983 _evac_cl->set_region(r);
1984 _evac_cl->do_oop_nv(ref_to_scan);
1985 }
1986 }
1988 void deal_with_reference(StarTask ref) {
1989 assert(verify_task(ref), "sanity");
1990 if (ref.is_narrow()) {
1991 deal_with_reference((narrowOop*)ref);
1992 } else {
1993 deal_with_reference((oop*)ref);
1994 }
1995 }
1997 public:
1998 void trim_queue();
1999 };
2001 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP