Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/g1/g1CollectedHeap.hpp @ 1973:631f79e71e90
6974966: G1: unnecessary direct-to-old allocations
Summary: This change revamps the slow allocation path of G1. Improvements include the following: a) Allocations directly to old regions are now totally banned. G1 now only allows allocations out of young regions (with the only exception being humongous regions). b) The thread that allocates a new region (which is now guaranteed to be young) does not dirty all its cards. Each thread that successfully allocates out of a young region is now responsible for dirtying the cards that corresponding to the "block" that just got allocated. c) allocate_new_tlab() and mem_allocate() are now implemented differently and TLAB allocations are only done by allocate_new_tlab(). d) If a thread schedules an evacuation pause in order to satisfy an allocation request, it will perform the allocation at the end of the safepoint so that the thread that initiated the GC also gets "first pick" of any space made available by the GC. e) If a thread is unable to allocate a humongous object it will schedule an evacuation pause in case it reclaims enough regions so that the humongous allocation can be satisfied aftewards. f) The G1 policy is more careful to set the young list target length to be the survivor number +1. g) Lots of code tidy up, removal, refactoring to make future changes easier.
Reviewed-by: johnc, ysr
| author | tonyp |
|---|---|
| date | Tue, 24 Aug 2010 17:24:33 -0400 |
| parents | f95d63e2154a |
| children | 016a3628c885 |
| rev | line source |
|---|---|
| 342 | 1 /* |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. |
| 342 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
21 * questions. |
| 342 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP |
| 26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP | |
| 27 | |
| 28 #include "gc_implementation/g1/concurrentMark.hpp" | |
| 29 #include "gc_implementation/g1/g1RemSet.hpp" | |
| 30 #include "gc_implementation/g1/heapRegion.hpp" | |
| 31 #include "gc_implementation/parNew/parGCAllocBuffer.hpp" | |
| 32 #include "memory/barrierSet.hpp" | |
| 33 #include "memory/memRegion.hpp" | |
| 34 #include "memory/sharedHeap.hpp" | |
| 35 | |
| 342 | 36 // A "G1CollectedHeap" is an implementation of a java heap for HotSpot. |
| 37 // It uses the "Garbage First" heap organization and algorithm, which | |
| 38 // may combine concurrent marking with parallel, incremental compaction of | |
| 39 // heap subsets that will yield large amounts of garbage. | |
| 40 | |
| 41 class HeapRegion; | |
| 42 class HeapRegionSeq; | |
| 43 class PermanentGenerationSpec; | |
| 44 class GenerationSpec; | |
| 45 class OopsInHeapRegionClosure; | |
| 46 class G1ScanHeapEvacClosure; | |
| 47 class ObjectClosure; | |
| 48 class SpaceClosure; | |
| 49 class CompactibleSpaceClosure; | |
| 50 class Space; | |
| 51 class G1CollectorPolicy; | |
| 52 class GenRemSet; | |
| 53 class G1RemSet; | |
| 54 class HeapRegionRemSetIterator; | |
| 55 class ConcurrentMark; | |
| 56 class ConcurrentMarkThread; | |
| 57 class ConcurrentG1Refine; | |
| 58 class ConcurrentZFThread; | |
| 59 | |
| 1709 | 60 typedef OverflowTaskQueue<StarTask> RefToScanQueue; |
|
1311
2a1472c30599
4396719: Mark Sweep stack overflow on deeply nested Object arrays
jcoomes
parents:
1261
diff
changeset
|
61 typedef GenericTaskQueueSet<RefToScanQueue> RefToScanQueueSet; |
| 342 | 62 |
|
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
796
diff
changeset
|
63 typedef int RegionIdx_t; // needs to hold [ 0..max_regions() ) |
|
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
796
diff
changeset
|
64 typedef int CardIdx_t; // needs to hold [ 0..CardsPerRegion ) |
|
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
796
diff
changeset
|
65 |
| 342 | 66 enum G1GCThreadGroups { |
| 67 G1CRGroup = 0, | |
| 68 G1ZFGroup = 1, | |
| 69 G1CMGroup = 2, | |
| 70 G1CLGroup = 3 | |
| 71 }; | |
| 72 | |
| 73 enum GCAllocPurpose { | |
| 74 GCAllocForTenured, | |
| 75 GCAllocForSurvived, | |
| 76 GCAllocPurposeCount | |
| 77 }; | |
| 78 | |
| 79 class YoungList : public CHeapObj { | |
| 80 private: | |
| 81 G1CollectedHeap* _g1h; | |
| 82 | |
| 83 HeapRegion* _head; | |
| 84 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
85 HeapRegion* _survivor_head; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
86 HeapRegion* _survivor_tail; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
87 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
88 HeapRegion* _curr; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
89 |
| 342 | 90 size_t _length; |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
91 size_t _survivor_length; |
| 342 | 92 |
| 93 size_t _last_sampled_rs_lengths; | |
| 94 size_t _sampled_rs_lengths; | |
| 95 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
96 void empty_list(HeapRegion* list); |
| 342 | 97 |
| 98 public: | |
| 99 YoungList(G1CollectedHeap* g1h); | |
| 100 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
101 void push_region(HeapRegion* hr); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
102 void add_survivor_region(HeapRegion* hr); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
103 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
104 void empty_list(); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
105 bool is_empty() { return _length == 0; } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
106 size_t length() { return _length; } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
107 size_t survivor_length() { return _survivor_length; } |
| 342 | 108 |
| 109 void rs_length_sampling_init(); | |
| 110 bool rs_length_sampling_more(); | |
| 111 void rs_length_sampling_next(); | |
| 112 | |
| 113 void reset_sampled_info() { | |
| 114 _last_sampled_rs_lengths = 0; | |
| 115 } | |
| 116 size_t sampled_rs_lengths() { return _last_sampled_rs_lengths; } | |
| 117 | |
| 118 // for development purposes | |
| 119 void reset_auxilary_lists(); | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
120 void clear() { _head = NULL; _length = 0; } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
121 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
122 void clear_survivors() { |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
123 _survivor_head = NULL; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
124 _survivor_tail = NULL; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
125 _survivor_length = 0; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
126 } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
127 |
| 342 | 128 HeapRegion* first_region() { return _head; } |
| 129 HeapRegion* first_survivor_region() { return _survivor_head; } | |
| 545 | 130 HeapRegion* last_survivor_region() { return _survivor_tail; } |
| 342 | 131 |
| 132 // debugging | |
| 133 bool check_list_well_formed(); | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
134 bool check_list_empty(bool check_sample = true); |
| 342 | 135 void print(); |
| 136 }; | |
| 137 | |
| 138 class RefineCardTableEntryClosure; | |
| 139 class G1CollectedHeap : public SharedHeap { | |
| 140 friend class VM_G1CollectForAllocation; | |
| 141 friend class VM_GenCollectForPermanentAllocation; | |
| 142 friend class VM_G1CollectFull; | |
| 143 friend class VM_G1IncCollectionPause; | |
| 144 friend class VMStructs; | |
| 145 | |
| 146 // Closures used in implementation. | |
| 147 friend class G1ParCopyHelper; | |
| 148 friend class G1IsAliveClosure; | |
| 149 friend class G1EvacuateFollowersClosure; | |
| 150 friend class G1ParScanThreadState; | |
| 151 friend class G1ParScanClosureSuper; | |
| 152 friend class G1ParEvacuateFollowersClosure; | |
| 153 friend class G1ParTask; | |
| 154 friend class G1FreeGarbageRegionClosure; | |
| 155 friend class RefineCardTableEntryClosure; | |
| 156 friend class G1PrepareCompactClosure; | |
| 157 friend class RegionSorter; | |
| 158 friend class CountRCClosure; | |
| 159 friend class EvacPopObjClosure; | |
|
796
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
160 friend class G1ParCleanupCTTask; |
| 342 | 161 |
| 162 // Other related classes. | |
| 163 friend class G1MarkSweep; | |
| 164 | |
| 165 private: | |
| 166 // The one and only G1CollectedHeap, so static functions can find it. | |
| 167 static G1CollectedHeap* _g1h; | |
| 168 | |
|
942
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
941
diff
changeset
|
169 static size_t _humongous_object_threshold_in_words; |
|
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
941
diff
changeset
|
170 |
| 342 | 171 // Storage for the G1 heap (excludes the permanent generation). |
| 172 VirtualSpace _g1_storage; | |
| 173 MemRegion _g1_reserved; | |
| 174 | |
| 175 // The part of _g1_storage that is currently committed. | |
| 176 MemRegion _g1_committed; | |
| 177 | |
| 178 // The maximum part of _g1_storage that has ever been committed. | |
| 179 MemRegion _g1_max_committed; | |
| 180 | |
| 181 // The number of regions that are completely free. | |
| 182 size_t _free_regions; | |
| 183 | |
| 184 // The number of regions we could create by expansion. | |
| 185 size_t _expansion_regions; | |
| 186 | |
| 187 // Return the number of free regions in the heap (by direct counting.) | |
| 188 size_t count_free_regions(); | |
| 189 // Return the number of free regions on the free and unclean lists. | |
| 190 size_t count_free_regions_list(); | |
| 191 | |
| 192 // The block offset table for the G1 heap. | |
| 193 G1BlockOffsetSharedArray* _bot_shared; | |
| 194 | |
| 195 // Move all of the regions off the free lists, then rebuild those free | |
| 196 // lists, before and after full GC. | |
| 197 void tear_down_region_lists(); | |
| 198 void rebuild_region_lists(); | |
| 199 // This sets all non-empty regions to need zero-fill (which they will if | |
| 200 // they are empty after full collection.) | |
| 201 void set_used_regions_to_need_zero_fill(); | |
| 202 | |
| 203 // The sequence of all heap regions in the heap. | |
| 204 HeapRegionSeq* _hrs; | |
| 205 | |
| 206 // The region from which normal-sized objects are currently being | |
| 207 // allocated. May be NULL. | |
| 208 HeapRegion* _cur_alloc_region; | |
| 209 | |
| 210 // Postcondition: cur_alloc_region == NULL. | |
| 211 void abandon_cur_alloc_region(); | |
| 636 | 212 void abandon_gc_alloc_regions(); |
| 342 | 213 |
| 214 // The to-space memory regions into which objects are being copied during | |
| 215 // a GC. | |
| 216 HeapRegion* _gc_alloc_regions[GCAllocPurposeCount]; | |
| 545 | 217 size_t _gc_alloc_region_counts[GCAllocPurposeCount]; |
| 636 | 218 // These are the regions, one per GCAllocPurpose, that are half-full |
| 219 // at the end of a collection and that we want to reuse during the | |
| 220 // next collection. | |
| 221 HeapRegion* _retained_gc_alloc_regions[GCAllocPurposeCount]; | |
| 222 // This specifies whether we will keep the last half-full region at | |
| 223 // the end of a collection so that it can be reused during the next | |
| 224 // collection (this is specified per GCAllocPurpose) | |
| 225 bool _retain_gc_alloc_region[GCAllocPurposeCount]; | |
| 342 | 226 |
| 227 // A list of the regions that have been set to be alloc regions in the | |
| 228 // current collection. | |
| 229 HeapRegion* _gc_alloc_region_list; | |
| 230 | |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
231 // Determines PLAB size for a particular allocation purpose. |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
232 static size_t desired_plab_sz(GCAllocPurpose purpose); |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
233 |
| 342 | 234 // When called by par thread, require par_alloc_during_gc_lock() to be held. |
| 235 void push_gc_alloc_region(HeapRegion* hr); | |
| 236 | |
| 237 // This should only be called single-threaded. Undeclares all GC alloc | |
| 238 // regions. | |
| 239 void forget_alloc_region_list(); | |
| 240 | |
| 241 // Should be used to set an alloc region, because there's other | |
| 242 // associated bookkeeping. | |
| 243 void set_gc_alloc_region(int purpose, HeapRegion* r); | |
| 244 | |
| 245 // Check well-formedness of alloc region list. | |
| 246 bool check_gc_alloc_regions(); | |
| 247 | |
| 248 // Outside of GC pauses, the number of bytes used in all regions other | |
| 249 // than the current allocation region. | |
| 250 size_t _summary_bytes_used; | |
| 251 | |
| 526 | 252 // This is used for a quick test on whether a reference points into |
| 253 // the collection set or not. Basically, we have an array, with one | |
| 254 // byte per region, and that byte denotes whether the corresponding | |
| 255 // region is in the collection set or not. The entry corresponding | |
| 256 // the bottom of the heap, i.e., region 0, is pointed to by | |
| 257 // _in_cset_fast_test_base. The _in_cset_fast_test field has been | |
| 258 // biased so that it actually points to address 0 of the address | |
| 259 // space, to make the test as fast as possible (we can simply shift | |
| 260 // the address to address into it, instead of having to subtract the | |
| 261 // bottom of the heap from the address before shifting it; basically | |
| 262 // it works in the same way the card table works). | |
| 263 bool* _in_cset_fast_test; | |
| 264 | |
| 265 // The allocated array used for the fast test on whether a reference | |
| 266 // points into the collection set or not. This field is also used to | |
| 267 // free the array. | |
| 268 bool* _in_cset_fast_test_base; | |
| 269 | |
| 270 // The length of the _in_cset_fast_test_base array. | |
| 271 size_t _in_cset_fast_test_length; | |
| 272 | |
|
353
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
273 volatile unsigned _gc_time_stamp; |
| 342 | 274 |
| 275 size_t* _surviving_young_words; | |
| 276 | |
| 277 void setup_surviving_young_words(); | |
| 278 void update_surviving_young_words(size_t* surv_young_words); | |
| 279 void cleanup_surviving_young_words(); | |
| 280 | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
281 // It decides whether an explicit GC should start a concurrent cycle |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
282 // instead of doing a STW GC. Currently, a concurrent cycle is |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
283 // explicitly started if: |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
284 // (a) cause == _gc_locker and +GCLockerInvokesConcurrent, or |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
285 // (b) cause == _java_lang_system_gc and +ExplicitGCInvokesConcurrent. |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
286 bool should_do_concurrent_full_gc(GCCause::Cause cause); |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
287 |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
288 // Keeps track of how many "full collections" (i.e., Full GCs or |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
289 // concurrent cycles) we have completed. The number of them we have |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
290 // started is maintained in _total_full_collections in CollectedHeap. |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
291 volatile unsigned int _full_collections_completed; |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
292 |
| 1973 | 293 // These are macros so that, if the assert fires, we get the correct |
| 294 // line number, file, etc. | |
| 295 | |
| 296 #define heap_locking_asserts_err_msg(__extra_message) \ | |
| 297 err_msg("%s : Heap_lock %slocked, %sat a safepoint", \ | |
| 298 (__extra_message), \ | |
| 299 (!Heap_lock->owned_by_self()) ? "NOT " : "", \ | |
| 300 (!SafepointSynchronize::is_at_safepoint()) ? "NOT " : "") | |
| 301 | |
| 302 #define assert_heap_locked() \ | |
| 303 do { \ | |
| 304 assert(Heap_lock->owned_by_self(), \ | |
| 305 heap_locking_asserts_err_msg("should be holding the Heap_lock")); \ | |
| 306 } while (0) | |
| 307 | |
| 308 #define assert_heap_locked_or_at_safepoint() \ | |
| 309 do { \ | |
| 310 assert(Heap_lock->owned_by_self() || \ | |
| 311 SafepointSynchronize::is_at_safepoint(), \ | |
| 312 heap_locking_asserts_err_msg("should be holding the Heap_lock or " \ | |
| 313 "should be at a safepoint")); \ | |
| 314 } while (0) | |
| 315 | |
| 316 #define assert_heap_locked_and_not_at_safepoint() \ | |
| 317 do { \ | |
| 318 assert(Heap_lock->owned_by_self() && \ | |
| 319 !SafepointSynchronize::is_at_safepoint(), \ | |
| 320 heap_locking_asserts_err_msg("should be holding the Heap_lock and " \ | |
| 321 "should not be at a safepoint")); \ | |
| 322 } while (0) | |
| 323 | |
| 324 #define assert_heap_not_locked() \ | |
| 325 do { \ | |
| 326 assert(!Heap_lock->owned_by_self(), \ | |
| 327 heap_locking_asserts_err_msg("should not be holding the Heap_lock")); \ | |
| 328 } while (0) | |
| 329 | |
| 330 #define assert_heap_not_locked_and_not_at_safepoint() \ | |
| 331 do { \ | |
| 332 assert(!Heap_lock->owned_by_self() && \ | |
| 333 !SafepointSynchronize::is_at_safepoint(), \ | |
| 334 heap_locking_asserts_err_msg("should not be holding the Heap_lock and " \ | |
| 335 "should not be at a safepoint")); \ | |
| 336 } while (0) | |
| 337 | |
| 338 #define assert_at_safepoint() \ | |
| 339 do { \ | |
| 340 assert(SafepointSynchronize::is_at_safepoint(), \ | |
| 341 heap_locking_asserts_err_msg("should be at a safepoint")); \ | |
| 342 } while (0) | |
| 343 | |
| 344 #define assert_not_at_safepoint() \ | |
| 345 do { \ | |
| 346 assert(!SafepointSynchronize::is_at_safepoint(), \ | |
| 347 heap_locking_asserts_err_msg("should not be at a safepoint")); \ | |
| 348 } while (0) | |
| 349 | |
| 342 | 350 protected: |
| 351 | |
| 352 // Returns "true" iff none of the gc alloc regions have any allocations | |
| 353 // since the last call to "save_marks". | |
| 354 bool all_alloc_regions_no_allocs_since_save_marks(); | |
| 545 | 355 // Perform finalization stuff on all allocation regions. |
| 356 void retire_all_alloc_regions(); | |
| 342 | 357 |
| 358 // The number of regions allocated to hold humongous objects. | |
| 359 int _num_humongous_regions; | |
| 360 YoungList* _young_list; | |
| 361 | |
| 362 // The current policy object for the collector. | |
| 363 G1CollectorPolicy* _g1_policy; | |
| 364 | |
| 365 // Parallel allocation lock to protect the current allocation region. | |
| 366 Mutex _par_alloc_during_gc_lock; | |
| 367 Mutex* par_alloc_during_gc_lock() { return &_par_alloc_during_gc_lock; } | |
| 368 | |
| 369 // If possible/desirable, allocate a new HeapRegion for normal object | |
| 370 // allocation sufficient for an allocation of the given "word_size". | |
| 371 // If "do_expand" is true, will attempt to expand the heap if necessary | |
| 372 // to to satisfy the request. If "zero_filled" is true, requires a | |
| 373 // zero-filled region. | |
| 374 // (Returning NULL will trigger a GC.) | |
| 375 virtual HeapRegion* newAllocRegion_work(size_t word_size, | |
| 376 bool do_expand, | |
| 377 bool zero_filled); | |
| 378 | |
| 379 virtual HeapRegion* newAllocRegion(size_t word_size, | |
| 380 bool zero_filled = true) { | |
| 381 return newAllocRegion_work(word_size, false, zero_filled); | |
| 382 } | |
| 383 virtual HeapRegion* newAllocRegionWithExpansion(int purpose, | |
| 384 size_t word_size, | |
| 385 bool zero_filled = true); | |
| 386 | |
| 387 // Attempt to allocate an object of the given (very large) "word_size". | |
| 388 // Returns "NULL" on failure. | |
| 1973 | 389 virtual HeapWord* humongous_obj_allocate(size_t word_size); |
| 390 | |
| 391 // The following two methods, allocate_new_tlab() and | |
| 392 // mem_allocate(), are the two main entry points from the runtime | |
| 393 // into the G1's allocation routines. They have the following | |
| 394 // assumptions: | |
| 395 // | |
| 396 // * They should both be called outside safepoints. | |
| 397 // | |
| 398 // * They should both be called without holding the Heap_lock. | |
| 399 // | |
| 400 // * All allocation requests for new TLABs should go to | |
| 401 // allocate_new_tlab(). | |
| 402 // | |
| 403 // * All non-TLAB allocation requests should go to mem_allocate() | |
| 404 // and mem_allocate() should never be called with is_tlab == true. | |
| 405 // | |
| 406 // * If the GC locker is active we currently stall until we can | |
| 407 // allocate a new young region. This will be changed in the | |
| 408 // near future (see CR 6994056). | |
| 409 // | |
| 410 // * If either call cannot satisfy the allocation request using the | |
| 411 // current allocating region, they will try to get a new one. If | |
| 412 // this fails, they will attempt to do an evacuation pause and | |
| 413 // retry the allocation. | |
| 414 // | |
| 415 // * If all allocation attempts fail, even after trying to schedule | |
| 416 // an evacuation pause, allocate_new_tlab() will return NULL, | |
| 417 // whereas mem_allocate() will attempt a heap expansion and/or | |
| 418 // schedule a Full GC. | |
| 419 // | |
| 420 // * We do not allow humongous-sized TLABs. So, allocate_new_tlab | |
| 421 // should never be called with word_size being humongous. All | |
| 422 // humongous allocation requests should go to mem_allocate() which | |
| 423 // will satisfy them with a special path. | |
| 424 | |
| 425 virtual HeapWord* allocate_new_tlab(size_t word_size); | |
| 426 | |
| 427 virtual HeapWord* mem_allocate(size_t word_size, | |
| 428 bool is_noref, | |
| 429 bool is_tlab, /* expected to be false */ | |
| 430 bool* gc_overhead_limit_was_exceeded); | |
| 342 | 431 |
| 1973 | 432 // The following methods, allocate_from_cur_allocation_region(), |
| 433 // attempt_allocation(), replace_cur_alloc_region_and_allocate(), | |
| 434 // attempt_allocation_slow(), and attempt_allocation_humongous() | |
| 435 // have very awkward pre- and post-conditions with respect to | |
| 436 // locking: | |
| 437 // | |
| 438 // If they are called outside a safepoint they assume the caller | |
| 439 // holds the Heap_lock when it calls them. However, on exit they | |
| 440 // will release the Heap_lock if they return a non-NULL result, but | |
| 441 // keep holding the Heap_lock if they return a NULL result. The | |
| 442 // reason for this is that we need to dirty the cards that span | |
| 443 // allocated blocks on young regions to avoid having to take the | |
| 444 // slow path of the write barrier (for performance reasons we don't | |
| 445 // update RSets for references whose source is a young region, so we | |
| 446 // don't need to look at dirty cards on young regions). But, doing | |
| 447 // this card dirtying while holding the Heap_lock can be a | |
| 448 // scalability bottleneck, especially given that some allocation | |
| 449 // requests might be of non-trivial size (and the larger the region | |
| 450 // size is, the fewer allocations requests will be considered | |
| 451 // humongous, as the humongous size limit is a fraction of the | |
| 452 // region size). So, when one of these calls succeeds in allocating | |
| 453 // a block it does the card dirtying after it releases the Heap_lock | |
| 454 // which is why it will return without holding it. | |
| 455 // | |
| 456 // The above assymetry is the reason why locking / unlocking is done | |
| 457 // explicitly (i.e., with Heap_lock->lock() and | |
| 458 // Heap_lock->unlocked()) instead of using MutexLocker and | |
| 459 // MutexUnlocker objects. The latter would ensure that the lock is | |
| 460 // unlocked / re-locked at every possible exit out of the basic | |
| 461 // block. However, we only want that action to happen in selected | |
| 462 // places. | |
| 463 // | |
| 464 // Further, if the above methods are called during a safepoint, then | |
| 465 // naturally there's no assumption about the Heap_lock being held or | |
| 466 // there's no attempt to unlock it. The parameter at_safepoint | |
| 467 // indicates whether the call is made during a safepoint or not (as | |
| 468 // an optimization, to avoid reading the global flag with | |
| 469 // SafepointSynchronize::is_at_safepoint()). | |
| 470 // | |
| 471 // The methods share these parameters: | |
| 472 // | |
| 473 // * word_size : the size of the allocation request in words | |
| 474 // * at_safepoint : whether the call is done at a safepoint; this | |
| 475 // also determines whether a GC is permitted | |
| 476 // (at_safepoint == false) or not (at_safepoint == true) | |
| 477 // * do_dirtying : whether the method should dirty the allocated | |
| 478 // block before returning | |
| 479 // | |
| 480 // They all return either the address of the block, if they | |
| 481 // successfully manage to allocate it, or NULL. | |
| 342 | 482 |
| 1973 | 483 // It tries to satisfy an allocation request out of the current |
| 484 // allocating region, which is passed as a parameter. It assumes | |
| 485 // that the caller has checked that the current allocating region is | |
| 486 // not NULL. Given that the caller has to check the current | |
| 487 // allocating region for at least NULL, it might as well pass it as | |
| 488 // the first parameter so that the method doesn't have to read it | |
| 489 // from the _cur_alloc_region field again. | |
| 490 inline HeapWord* allocate_from_cur_alloc_region(HeapRegion* cur_alloc_region, | |
| 491 size_t word_size); | |
| 492 | |
| 493 // It attempts to allocate out of the current alloc region. If that | |
| 494 // fails, it retires the current alloc region (if there is one), | |
| 495 // tries to get a new one and retries the allocation. | |
| 496 inline HeapWord* attempt_allocation(size_t word_size); | |
| 497 | |
| 498 // It assumes that the current alloc region has been retired and | |
| 499 // tries to allocate a new one. If it's successful, it performs | |
| 500 // the allocation out of the new current alloc region and updates | |
| 501 // _cur_alloc_region. | |
| 502 HeapWord* replace_cur_alloc_region_and_allocate(size_t word_size, | |
| 503 bool at_safepoint, | |
| 504 bool do_dirtying); | |
| 505 | |
| 506 // The slow path when we are unable to allocate a new current alloc | |
| 507 // region to satisfy an allocation request (i.e., when | |
| 508 // attempt_allocation() fails). It will try to do an evacuation | |
| 509 // pause, which might stall due to the GC locker, and retry the | |
| 510 // allocation attempt when appropriate. | |
| 511 HeapWord* attempt_allocation_slow(size_t word_size); | |
| 512 | |
| 513 // The method that tries to satisfy a humongous allocation | |
| 514 // request. If it cannot satisfy it it will try to do an evacuation | |
| 515 // pause to perhaps reclaim enough space to be able to satisfy the | |
| 516 // allocation request afterwards. | |
| 517 HeapWord* attempt_allocation_humongous(size_t word_size, | |
| 518 bool at_safepoint); | |
| 519 | |
| 520 // It does the common work when we are retiring the current alloc region. | |
| 521 inline void retire_cur_alloc_region_common(HeapRegion* cur_alloc_region); | |
| 522 | |
| 523 // It retires the current alloc region, which is passed as a | |
| 524 // parameter (since, typically, the caller is already holding on to | |
| 525 // it). It sets _cur_alloc_region to NULL. | |
| 526 void retire_cur_alloc_region(HeapRegion* cur_alloc_region); | |
| 527 | |
| 528 // It attempts to do an allocation immediately before or after an | |
| 529 // evacuation pause and can only be called by the VM thread. It has | |
| 530 // slightly different assumptions that the ones before (i.e., | |
| 531 // assumes that the current alloc region has been retired). | |
| 532 HeapWord* attempt_allocation_at_safepoint(size_t word_size, | |
| 533 bool expect_null_cur_alloc_region); | |
| 534 | |
| 535 // It dirties the cards that cover the block so that so that the post | |
| 536 // write barrier never queues anything when updating objects on this | |
| 537 // block. It is assumed (and in fact we assert) that the block | |
| 538 // belongs to a young region. | |
| 539 inline void dirty_young_block(HeapWord* start, size_t word_size); | |
| 342 | 540 |
| 541 // Allocate blocks during garbage collection. Will ensure an | |
| 542 // allocation region, either by picking one or expanding the | |
| 543 // heap, and then allocate a block of the given size. The block | |
| 544 // may not be a humongous - it must fit into a single heap region. | |
| 545 HeapWord* par_allocate_during_gc(GCAllocPurpose purpose, size_t word_size); | |
| 546 | |
| 547 HeapWord* allocate_during_gc_slow(GCAllocPurpose purpose, | |
| 548 HeapRegion* alloc_region, | |
| 549 bool par, | |
| 550 size_t word_size); | |
| 551 | |
| 552 // Ensure that no further allocations can happen in "r", bearing in mind | |
| 553 // that parallel threads might be attempting allocations. | |
| 554 void par_allocate_remaining_space(HeapRegion* r); | |
| 555 | |
| 545 | 556 // Retires an allocation region when it is full or at the end of a |
| 557 // GC pause. | |
| 558 void retire_alloc_region(HeapRegion* alloc_region, bool par); | |
| 559 | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
560 // - if explicit_gc is true, the GC is for a System.gc() or a heap |
| 1973 | 561 // inspection request and should collect the entire heap |
| 562 // - if clear_all_soft_refs is true, all soft references should be | |
| 563 // cleared during the GC | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
564 // - if explicit_gc is false, word_size describes the allocation that |
| 1973 | 565 // the GC should attempt (at least) to satisfy |
| 566 // - it returns false if it is unable to do the collection due to the | |
| 567 // GC locker being active, true otherwise | |
| 568 bool do_collection(bool explicit_gc, | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
569 bool clear_all_soft_refs, |
| 342 | 570 size_t word_size); |
| 571 | |
| 572 // Callback from VM_G1CollectFull operation. | |
| 573 // Perform a full collection. | |
| 574 void do_full_collection(bool clear_all_soft_refs); | |
| 575 | |
| 576 // Resize the heap if necessary after a full collection. If this is | |
| 577 // after a collect-for allocation, "word_size" is the allocation size, | |
| 578 // and will be considered part of the used portion of the heap. | |
| 579 void resize_if_necessary_after_full_collection(size_t word_size); | |
| 580 | |
| 581 // Callback from VM_G1CollectForAllocation operation. | |
| 582 // This function does everything necessary/possible to satisfy a | |
| 583 // failed allocation request (including collection, expansion, etc.) | |
| 1973 | 584 HeapWord* satisfy_failed_allocation(size_t word_size, bool* succeeded); |
| 342 | 585 |
| 586 // Attempting to expand the heap sufficiently | |
| 587 // to support an allocation of the given "word_size". If | |
| 588 // successful, perform the allocation and return the address of the | |
| 589 // allocated block, or else "NULL". | |
| 1973 | 590 HeapWord* expand_and_allocate(size_t word_size); |
| 342 | 591 |
| 592 public: | |
| 593 // Expand the garbage-first heap by at least the given size (in bytes!). | |
| 594 // (Rounds up to a HeapRegion boundary.) | |
| 595 virtual void expand(size_t expand_bytes); | |
| 596 | |
| 597 // Do anything common to GC's. | |
| 598 virtual void gc_prologue(bool full); | |
| 599 virtual void gc_epilogue(bool full); | |
| 600 | |
| 526 | 601 // We register a region with the fast "in collection set" test. We |
| 602 // simply set to true the array slot corresponding to this region. | |
| 603 void register_region_with_in_cset_fast_test(HeapRegion* r) { | |
| 604 assert(_in_cset_fast_test_base != NULL, "sanity"); | |
| 605 assert(r->in_collection_set(), "invariant"); | |
| 606 int index = r->hrs_index(); | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
607 assert(0 <= index && (size_t) index < _in_cset_fast_test_length, "invariant"); |
| 526 | 608 assert(!_in_cset_fast_test_base[index], "invariant"); |
| 609 _in_cset_fast_test_base[index] = true; | |
| 610 } | |
| 611 | |
| 612 // This is a fast test on whether a reference points into the | |
| 613 // collection set or not. It does not assume that the reference | |
| 614 // points into the heap; if it doesn't, it will return false. | |
| 615 bool in_cset_fast_test(oop obj) { | |
| 616 assert(_in_cset_fast_test != NULL, "sanity"); | |
| 617 if (_g1_committed.contains((HeapWord*) obj)) { | |
| 618 // no need to subtract the bottom of the heap from obj, | |
| 619 // _in_cset_fast_test is biased | |
| 620 size_t index = ((size_t) obj) >> HeapRegion::LogOfHRGrainBytes; | |
| 621 bool ret = _in_cset_fast_test[index]; | |
| 622 // let's make sure the result is consistent with what the slower | |
| 623 // test returns | |
| 624 assert( ret || !obj_in_cs(obj), "sanity"); | |
| 625 assert(!ret || obj_in_cs(obj), "sanity"); | |
| 626 return ret; | |
| 627 } else { | |
| 628 return false; | |
| 629 } | |
| 630 } | |
| 631 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
632 void clear_cset_fast_test() { |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
633 assert(_in_cset_fast_test_base != NULL, "sanity"); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
634 memset(_in_cset_fast_test_base, false, |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
635 _in_cset_fast_test_length * sizeof(bool)); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
636 } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
637 |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
638 // This is called at the end of either a concurrent cycle or a Full |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
639 // GC to update the number of full collections completed. Those two |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
640 // can happen in a nested fashion, i.e., we start a concurrent |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
641 // cycle, a Full GC happens half-way through it which ends first, |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
642 // and then the cycle notices that a Full GC happened and ends |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
643 // too. The outer parameter is a boolean to help us do a bit tighter |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
644 // consistency checking in the method. If outer is false, the caller |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
645 // is the inner caller in the nesting (i.e., the Full GC). If outer |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
646 // is true, the caller is the outer caller in this nesting (i.e., |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
647 // the concurrent cycle). Further nesting is not currently |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
648 // supported. The end of the this call also notifies the |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
649 // FullGCCount_lock in case a Java thread is waiting for a full GC |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
650 // to happen (e.g., it called System.gc() with |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
651 // +ExplicitGCInvokesConcurrent). |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
652 void increment_full_collections_completed(bool outer); |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
653 |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
654 unsigned int full_collections_completed() { |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
655 return _full_collections_completed; |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
656 } |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
657 |
| 342 | 658 protected: |
| 659 | |
| 660 // Shrink the garbage-first heap by at most the given size (in bytes!). | |
| 661 // (Rounds down to a HeapRegion boundary.) | |
| 662 virtual void shrink(size_t expand_bytes); | |
| 663 void shrink_helper(size_t expand_bytes); | |
| 664 | |
| 1709 | 665 #if TASKQUEUE_STATS |
| 666 static void print_taskqueue_stats_hdr(outputStream* const st = gclog_or_tty); | |
| 667 void print_taskqueue_stats(outputStream* const st = gclog_or_tty) const; | |
| 668 void reset_taskqueue_stats(); | |
| 669 #endif // TASKQUEUE_STATS | |
| 670 | |
| 1973 | 671 // Schedule the VM operation that will do an evacuation pause to |
| 672 // satisfy an allocation request of word_size. *succeeded will | |
| 673 // return whether the VM operation was successful (it did do an | |
| 674 // evacuation pause) or not (another thread beat us to it or the GC | |
| 675 // locker was active). Given that we should not be holding the | |
| 676 // Heap_lock when we enter this method, we will pass the | |
| 677 // gc_count_before (i.e., total_collections()) as a parameter since | |
| 678 // it has to be read while holding the Heap_lock. Currently, both | |
| 679 // methods that call do_collection_pause() release the Heap_lock | |
| 680 // before the call, so it's easy to read gc_count_before just before. | |
| 681 HeapWord* do_collection_pause(size_t word_size, | |
| 682 unsigned int gc_count_before, | |
| 683 bool* succeeded); | |
| 342 | 684 |
| 685 // The guts of the incremental collection pause, executed by the vm | |
| 1973 | 686 // thread. It returns false if it is unable to do the collection due |
| 687 // to the GC locker being active, true otherwise | |
| 688 bool do_collection_pause_at_safepoint(double target_pause_time_ms); | |
| 342 | 689 |
| 690 // Actually do the work of evacuating the collection set. | |
| 1973 | 691 void evacuate_collection_set(); |
| 342 | 692 |
| 693 // The g1 remembered set of the heap. | |
| 694 G1RemSet* _g1_rem_set; | |
| 695 // And it's mod ref barrier set, used to track updates for the above. | |
| 696 ModRefBarrierSet* _mr_bs; | |
| 697 | |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
698 // A set of cards that cover the objects for which the Rsets should be updated |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
699 // concurrently after the collection. |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
700 DirtyCardQueueSet _dirty_card_queue_set; |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
701 |
| 342 | 702 // The Heap Region Rem Set Iterator. |
| 703 HeapRegionRemSetIterator** _rem_set_iterator; | |
| 704 | |
| 705 // The closure used to refine a single card. | |
| 706 RefineCardTableEntryClosure* _refine_cte_cl; | |
| 707 | |
| 708 // A function to check the consistency of dirty card logs. | |
| 709 void check_ct_logs_at_safepoint(); | |
| 710 | |
| 1705 | 711 // A DirtyCardQueueSet that is used to hold cards that contain |
| 712 // references into the current collection set. This is used to | |
| 713 // update the remembered sets of the regions in the collection | |
| 714 // set in the event of an evacuation failure. | |
| 715 DirtyCardQueueSet _into_cset_dirty_card_queue_set; | |
| 716 | |
| 342 | 717 // After a collection pause, make the regions in the CS into free |
| 718 // regions. | |
| 719 void free_collection_set(HeapRegion* cs_head); | |
| 720 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
721 // Abandon the current collection set without recording policy |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
722 // statistics or updating free lists. |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
723 void abandon_collection_set(HeapRegion* cs_head); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
724 |
| 342 | 725 // Applies "scan_non_heap_roots" to roots outside the heap, |
| 726 // "scan_rs" to roots inside the heap (having done "set_region" to | |
| 727 // indicate the region in which the root resides), and does "scan_perm" | |
| 728 // (setting the generation to the perm generation.) If "scan_rs" is | |
| 729 // NULL, then this step is skipped. The "worker_i" | |
| 730 // param is for use with parallel roots processing, and should be | |
| 731 // the "i" of the calling parallel worker thread's work(i) function. | |
| 732 // In the sequential case this param will be ignored. | |
| 733 void g1_process_strong_roots(bool collecting_perm_gen, | |
| 734 SharedHeap::ScanningOption so, | |
| 735 OopClosure* scan_non_heap_roots, | |
| 736 OopsInHeapRegionClosure* scan_rs, | |
| 737 OopsInGenClosure* scan_perm, | |
| 738 int worker_i); | |
| 739 | |
| 740 // Apply "blk" to all the weak roots of the system. These include | |
| 741 // JNI weak roots, the code cache, system dictionary, symbol table, | |
| 742 // string table, and referents of reachable weak refs. | |
| 743 void g1_process_weak_roots(OopClosure* root_closure, | |
| 744 OopClosure* non_root_closure); | |
| 745 | |
| 746 // Invoke "save_marks" on all heap regions. | |
| 747 void save_marks(); | |
| 748 | |
| 749 // Free a heap region. | |
| 750 void free_region(HeapRegion* hr); | |
| 751 // A component of "free_region", exposed for 'batching'. | |
| 752 // All the params after "hr" are out params: the used bytes of the freed | |
| 753 // region(s), the number of H regions cleared, the number of regions | |
| 754 // freed, and pointers to the head and tail of a list of freed contig | |
| 755 // regions, linked throught the "next_on_unclean_list" field. | |
| 756 void free_region_work(HeapRegion* hr, | |
| 757 size_t& pre_used, | |
| 758 size_t& cleared_h, | |
| 759 size_t& freed_regions, | |
| 760 UncleanRegionList* list, | |
| 761 bool par = false); | |
| 762 | |
| 763 | |
| 764 // The concurrent marker (and the thread it runs in.) | |
| 765 ConcurrentMark* _cm; | |
| 766 ConcurrentMarkThread* _cmThread; | |
| 767 bool _mark_in_progress; | |
| 768 | |
| 769 // The concurrent refiner. | |
| 770 ConcurrentG1Refine* _cg1r; | |
| 771 | |
| 772 // The concurrent zero-fill thread. | |
| 773 ConcurrentZFThread* _czft; | |
| 774 | |
| 775 // The parallel task queues | |
| 776 RefToScanQueueSet *_task_queues; | |
| 777 | |
| 778 // True iff a evacuation has failed in the current collection. | |
| 779 bool _evacuation_failed; | |
| 780 | |
| 781 // Set the attribute indicating whether evacuation has failed in the | |
| 782 // current collection. | |
| 783 void set_evacuation_failed(bool b) { _evacuation_failed = b; } | |
| 784 | |
| 785 // Failed evacuations cause some logical from-space objects to have | |
| 786 // forwarding pointers to themselves. Reset them. | |
| 787 void remove_self_forwarding_pointers(); | |
| 788 | |
| 789 // When one is non-null, so is the other. Together, they each pair is | |
| 790 // an object with a preserved mark, and its mark value. | |
| 791 GrowableArray<oop>* _objs_with_preserved_marks; | |
| 792 GrowableArray<markOop>* _preserved_marks_of_objs; | |
| 793 | |
| 794 // Preserve the mark of "obj", if necessary, in preparation for its mark | |
| 795 // word being overwritten with a self-forwarding-pointer. | |
| 796 void preserve_mark_if_necessary(oop obj, markOop m); | |
| 797 | |
| 798 // The stack of evac-failure objects left to be scanned. | |
| 799 GrowableArray<oop>* _evac_failure_scan_stack; | |
| 800 // The closure to apply to evac-failure objects. | |
| 801 | |
| 802 OopsInHeapRegionClosure* _evac_failure_closure; | |
| 803 // Set the field above. | |
| 804 void | |
| 805 set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_closure) { | |
| 806 _evac_failure_closure = evac_failure_closure; | |
| 807 } | |
| 808 | |
| 809 // Push "obj" on the scan stack. | |
| 810 void push_on_evac_failure_scan_stack(oop obj); | |
| 811 // Process scan stack entries until the stack is empty. | |
| 812 void drain_evac_failure_scan_stack(); | |
| 813 // True iff an invocation of "drain_scan_stack" is in progress; to | |
| 814 // prevent unnecessary recursion. | |
| 815 bool _drain_in_progress; | |
| 816 | |
| 817 // Do any necessary initialization for evacuation-failure handling. | |
| 818 // "cl" is the closure that will be used to process evac-failure | |
| 819 // objects. | |
| 820 void init_for_evac_failure(OopsInHeapRegionClosure* cl); | |
| 821 // Do any necessary cleanup for evacuation-failure handling data | |
| 822 // structures. | |
| 823 void finalize_for_evac_failure(); | |
| 824 | |
| 825 // An attempt to evacuate "obj" has failed; take necessary steps. | |
| 826 void handle_evacuation_failure(oop obj); | |
| 827 oop handle_evacuation_failure_par(OopsInHeapRegionClosure* cl, oop obj); | |
| 828 void handle_evacuation_failure_common(oop obj, markOop m); | |
| 829 | |
| 830 | |
| 831 // Ensure that the relevant gc_alloc regions are set. | |
| 832 void get_gc_alloc_regions(); | |
| 636 | 833 // We're done with GC alloc regions. We are going to tear down the |
| 834 // gc alloc list and remove the gc alloc tag from all the regions on | |
| 835 // that list. However, we will also retain the last (i.e., the one | |
| 836 // that is half-full) GC alloc region, per GCAllocPurpose, for | |
| 837 // possible reuse during the next collection, provided | |
| 838 // _retain_gc_alloc_region[] indicates that it should be the | |
| 839 // case. Said regions are kept in the _retained_gc_alloc_regions[] | |
| 840 // array. If the parameter totally is set, we will not retain any | |
| 841 // regions, irrespective of what _retain_gc_alloc_region[] | |
| 842 // indicates. | |
| 843 void release_gc_alloc_regions(bool totally); | |
| 844 #ifndef PRODUCT | |
| 845 // Useful for debugging. | |
| 846 void print_gc_alloc_regions(); | |
| 847 #endif // !PRODUCT | |
| 342 | 848 |
| 849 // ("Weak") Reference processing support | |
| 850 ReferenceProcessor* _ref_processor; | |
| 851 | |
| 852 enum G1H_process_strong_roots_tasks { | |
| 853 G1H_PS_mark_stack_oops_do, | |
| 854 G1H_PS_refProcessor_oops_do, | |
| 855 // Leave this one last. | |
| 856 G1H_PS_NumElements | |
| 857 }; | |
| 858 | |
| 859 SubTasksDone* _process_strong_tasks; | |
| 860 | |
| 861 // List of regions which require zero filling. | |
| 862 UncleanRegionList _unclean_region_list; | |
| 863 bool _unclean_regions_coming; | |
| 864 | |
| 865 public: | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1718
diff
changeset
|
866 |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1718
diff
changeset
|
867 SubTasksDone* process_strong_tasks() { return _process_strong_tasks; } |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1718
diff
changeset
|
868 |
| 342 | 869 void set_refine_cte_cl_concurrency(bool concurrent); |
| 870 | |
| 1709 | 871 RefToScanQueue *task_queue(int i) const; |
| 342 | 872 |
|
616
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
873 // A set of cards where updates happened during the GC |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
874 DirtyCardQueueSet& dirty_card_queue_set() { return _dirty_card_queue_set; } |
|
4f360ec815ba
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
545
diff
changeset
|
875 |
| 1705 | 876 // A DirtyCardQueueSet that is used to hold cards that contain |
| 877 // references into the current collection set. This is used to | |
| 878 // update the remembered sets of the regions in the collection | |
| 879 // set in the event of an evacuation failure. | |
| 880 DirtyCardQueueSet& into_cset_dirty_card_queue_set() | |
| 881 { return _into_cset_dirty_card_queue_set; } | |
| 882 | |
| 342 | 883 // Create a G1CollectedHeap with the specified policy. |
| 884 // Must call the initialize method afterwards. | |
| 885 // May not return if something goes wrong. | |
| 886 G1CollectedHeap(G1CollectorPolicy* policy); | |
| 887 | |
| 888 // Initialize the G1CollectedHeap to have the initial and | |
| 889 // maximum sizes, permanent generation, and remembered and barrier sets | |
| 890 // specified by the policy object. | |
| 891 jint initialize(); | |
| 892 | |
| 893 void ref_processing_init(); | |
| 894 | |
| 895 void set_par_threads(int t) { | |
| 896 SharedHeap::set_par_threads(t); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1718
diff
changeset
|
897 _process_strong_tasks->set_n_threads(t); |
| 342 | 898 } |
| 899 | |
| 900 virtual CollectedHeap::Name kind() const { | |
| 901 return CollectedHeap::G1CollectedHeap; | |
| 902 } | |
| 903 | |
| 904 // The current policy object for the collector. | |
| 905 G1CollectorPolicy* g1_policy() const { return _g1_policy; } | |
| 906 | |
| 907 // Adaptive size policy. No such thing for g1. | |
| 908 virtual AdaptiveSizePolicy* size_policy() { return NULL; } | |
| 909 | |
| 910 // The rem set and barrier set. | |
| 911 G1RemSet* g1_rem_set() const { return _g1_rem_set; } | |
| 912 ModRefBarrierSet* mr_bs() const { return _mr_bs; } | |
| 913 | |
| 914 // The rem set iterator. | |
| 915 HeapRegionRemSetIterator* rem_set_iterator(int i) { | |
| 916 return _rem_set_iterator[i]; | |
| 917 } | |
| 918 | |
| 919 HeapRegionRemSetIterator* rem_set_iterator() { | |
| 920 return _rem_set_iterator[0]; | |
| 921 } | |
| 922 | |
| 923 unsigned get_gc_time_stamp() { | |
| 924 return _gc_time_stamp; | |
| 925 } | |
| 926 | |
| 927 void reset_gc_time_stamp() { | |
| 928 _gc_time_stamp = 0; | |
|
353
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
929 OrderAccess::fence(); |
|
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
930 } |
|
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
931 |
|
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
932 void increment_gc_time_stamp() { |
|
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
933 ++_gc_time_stamp; |
|
9bb2c10ac07b
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov
parents:
342
diff
changeset
|
934 OrderAccess::fence(); |
| 342 | 935 } |
| 936 | |
| 1705 | 937 void iterate_dirty_card_closure(CardTableEntryClosure* cl, |
| 938 DirtyCardQueue* into_cset_dcq, | |
| 939 bool concurrent, int worker_i); | |
| 342 | 940 |
| 941 // The shared block offset table array. | |
| 942 G1BlockOffsetSharedArray* bot_shared() const { return _bot_shared; } | |
| 943 | |
| 944 // Reference Processing accessor | |
| 945 ReferenceProcessor* ref_processor() { return _ref_processor; } | |
| 946 | |
| 947 // Reserved (g1 only; super method includes perm), capacity and the used | |
| 948 // portion in bytes. | |
|
1092
ed52bcc32739
6880903: G1: G1 reports incorrect Runtime.maxMemory()
tonyp
parents:
1027
diff
changeset
|
949 size_t g1_reserved_obj_bytes() const { return _g1_reserved.byte_size(); } |
| 342 | 950 virtual size_t capacity() const; |
| 951 virtual size_t used() const; | |
|
846
42d84bbbecf4
6859911: G1: assert(Heap_lock->owner() = NULL, "Should be owned on this thread's behalf")
tonyp
parents:
845
diff
changeset
|
952 // This should be called when we're not holding the heap lock. The |
|
42d84bbbecf4
6859911: G1: assert(Heap_lock->owner() = NULL, "Should be owned on this thread's behalf")
tonyp
parents:
845
diff
changeset
|
953 // result might be a bit inaccurate. |
|
42d84bbbecf4
6859911: G1: assert(Heap_lock->owner() = NULL, "Should be owned on this thread's behalf")
tonyp
parents:
845
diff
changeset
|
954 size_t used_unlocked() const; |
| 342 | 955 size_t recalculate_used() const; |
| 956 #ifndef PRODUCT | |
| 957 size_t recalculate_used_regions() const; | |
| 958 #endif // PRODUCT | |
| 959 | |
| 960 // These virtual functions do the actual allocation. | |
| 961 // Some heaps may offer a contiguous region for shared non-blocking | |
| 962 // allocation, via inlined code (by exporting the address of the top and | |
| 963 // end fields defining the extent of the contiguous allocation region.) | |
| 964 // But G1CollectedHeap doesn't yet support this. | |
| 965 | |
| 966 // Return an estimate of the maximum allocation that could be performed | |
| 967 // without triggering any collection or expansion activity. In a | |
| 968 // generational collector, for example, this is probably the largest | |
| 969 // allocation that could be supported (without expansion) in the youngest | |
| 970 // generation. It is "unsafe" because no locks are taken; the result | |
| 971 // should be treated as an approximation, not a guarantee, for use in | |
| 972 // heuristic resizing decisions. | |
| 973 virtual size_t unsafe_max_alloc(); | |
| 974 | |
| 975 virtual bool is_maximal_no_gc() const { | |
| 976 return _g1_storage.uncommitted_size() == 0; | |
| 977 } | |
| 978 | |
| 979 // The total number of regions in the heap. | |
| 980 size_t n_regions(); | |
| 981 | |
| 982 // The number of regions that are completely free. | |
| 983 size_t max_regions(); | |
| 984 | |
| 985 // The number of regions that are completely free. | |
| 986 size_t free_regions(); | |
| 987 | |
| 988 // The number of regions that are not completely free. | |
| 989 size_t used_regions() { return n_regions() - free_regions(); } | |
| 990 | |
| 991 // True iff the ZF thread should run. | |
| 992 bool should_zf(); | |
| 993 | |
| 994 // The number of regions available for "regular" expansion. | |
| 995 size_t expansion_regions() { return _expansion_regions; } | |
| 996 | |
| 997 #ifndef PRODUCT | |
| 998 bool regions_accounted_for(); | |
| 999 bool print_region_accounting_info(); | |
| 1000 void print_region_counts(); | |
| 1001 #endif | |
| 1002 | |
| 1003 HeapRegion* alloc_region_from_unclean_list(bool zero_filled); | |
| 1004 HeapRegion* alloc_region_from_unclean_list_locked(bool zero_filled); | |
| 1005 | |
| 1006 void put_region_on_unclean_list(HeapRegion* r); | |
| 1007 void put_region_on_unclean_list_locked(HeapRegion* r); | |
| 1008 | |
| 1009 void prepend_region_list_on_unclean_list(UncleanRegionList* list); | |
| 1010 void prepend_region_list_on_unclean_list_locked(UncleanRegionList* list); | |
| 1011 | |
| 1012 void set_unclean_regions_coming(bool b); | |
| 1013 void set_unclean_regions_coming_locked(bool b); | |
| 1014 // Wait for cleanup to be complete. | |
| 1015 void wait_for_cleanup_complete(); | |
| 1016 // Like above, but assumes that the calling thread owns the Heap_lock. | |
| 1017 void wait_for_cleanup_complete_locked(); | |
| 1018 | |
| 1019 // Return the head of the unclean list. | |
| 1020 HeapRegion* peek_unclean_region_list_locked(); | |
| 1021 // Remove and return the head of the unclean list. | |
| 1022 HeapRegion* pop_unclean_region_list_locked(); | |
| 1023 | |
| 1024 // List of regions which are zero filled and ready for allocation. | |
| 1025 HeapRegion* _free_region_list; | |
| 1026 // Number of elements on the free list. | |
| 1027 size_t _free_region_list_size; | |
| 1028 | |
| 1029 // If the head of the unclean list is ZeroFilled, move it to the free | |
| 1030 // list. | |
| 1031 bool move_cleaned_region_to_free_list_locked(); | |
| 1032 bool move_cleaned_region_to_free_list(); | |
| 1033 | |
| 1034 void put_free_region_on_list_locked(HeapRegion* r); | |
| 1035 void put_free_region_on_list(HeapRegion* r); | |
| 1036 | |
| 1037 // Remove and return the head element of the free list. | |
| 1038 HeapRegion* pop_free_region_list_locked(); | |
| 1039 | |
| 1040 // If "zero_filled" is true, we first try the free list, then we try the | |
| 1041 // unclean list, zero-filling the result. If "zero_filled" is false, we | |
| 1042 // first try the unclean list, then the zero-filled list. | |
| 1043 HeapRegion* alloc_free_region_from_lists(bool zero_filled); | |
| 1044 | |
| 1045 // Verify the integrity of the region lists. | |
| 1046 void remove_allocated_regions_from_lists(); | |
| 1047 bool verify_region_lists(); | |
| 1048 bool verify_region_lists_locked(); | |
| 1049 size_t unclean_region_list_length(); | |
| 1050 size_t free_region_list_length(); | |
| 1051 | |
| 1052 // Perform a collection of the heap; intended for use in implementing | |
| 1053 // "System.gc". This probably implies as full a collection as the | |
| 1054 // "CollectedHeap" supports. | |
| 1055 virtual void collect(GCCause::Cause cause); | |
| 1056 | |
| 1057 // The same as above but assume that the caller holds the Heap_lock. | |
| 1058 void collect_locked(GCCause::Cause cause); | |
| 1059 | |
| 1060 // This interface assumes that it's being called by the | |
| 1061 // vm thread. It collects the heap assuming that the | |
| 1062 // heap lock is already held and that we are executing in | |
| 1063 // the context of the vm thread. | |
| 1064 virtual void collect_as_vm_thread(GCCause::Cause cause); | |
| 1065 | |
| 1066 // True iff a evacuation has failed in the most-recent collection. | |
| 1067 bool evacuation_failed() { return _evacuation_failed; } | |
| 1068 | |
| 1069 // Free a region if it is totally full of garbage. Returns the number of | |
| 1070 // bytes freed (0 ==> didn't free it). | |
| 1071 size_t free_region_if_totally_empty(HeapRegion *hr); | |
| 1072 void free_region_if_totally_empty_work(HeapRegion *hr, | |
| 1073 size_t& pre_used, | |
| 1074 size_t& cleared_h_regions, | |
| 1075 size_t& freed_regions, | |
| 1076 UncleanRegionList* list, | |
| 1077 bool par = false); | |
| 1078 | |
| 1079 // If we've done free region work that yields the given changes, update | |
| 1080 // the relevant global variables. | |
| 1081 void finish_free_region_work(size_t pre_used, | |
| 1082 size_t cleared_h_regions, | |
| 1083 size_t freed_regions, | |
| 1084 UncleanRegionList* list); | |
| 1085 | |
| 1086 | |
| 1087 // Returns "TRUE" iff "p" points into the allocated area of the heap. | |
| 1088 virtual bool is_in(const void* p) const; | |
| 1089 | |
| 1090 // Return "TRUE" iff the given object address is within the collection | |
| 1091 // set. | |
| 1092 inline bool obj_in_cs(oop obj); | |
| 1093 | |
| 1094 // Return "TRUE" iff the given object address is in the reserved | |
| 1095 // region of g1 (excluding the permanent generation). | |
| 1096 bool is_in_g1_reserved(const void* p) const { | |
| 1097 return _g1_reserved.contains(p); | |
| 1098 } | |
| 1099 | |
| 1100 // Returns a MemRegion that corresponds to the space that has been | |
| 1101 // committed in the heap | |
| 1102 MemRegion g1_committed() { | |
| 1103 return _g1_committed; | |
| 1104 } | |
| 1105 | |
| 941 | 1106 NOT_PRODUCT(bool is_in_closed_subset(const void* p) const;) |
| 342 | 1107 |
| 1108 // Dirty card table entries covering a list of young regions. | |
| 1109 void dirtyCardsForYoungRegions(CardTableModRefBS* ct_bs, HeapRegion* list); | |
| 1110 | |
| 1111 // This resets the card table to all zeros. It is used after | |
| 1112 // a collection pause which used the card table to claim cards. | |
| 1113 void cleanUpCardTable(); | |
| 1114 | |
| 1115 // Iteration functions. | |
| 1116 | |
| 1117 // Iterate over all the ref-containing fields of all objects, calling | |
| 1118 // "cl.do_oop" on each. | |
| 678 | 1119 virtual void oop_iterate(OopClosure* cl) { |
| 1120 oop_iterate(cl, true); | |
| 1121 } | |
| 1122 void oop_iterate(OopClosure* cl, bool do_perm); | |
| 342 | 1123 |
| 1124 // Same as above, restricted to a memory region. | |
| 678 | 1125 virtual void oop_iterate(MemRegion mr, OopClosure* cl) { |
| 1126 oop_iterate(mr, cl, true); | |
| 1127 } | |
| 1128 void oop_iterate(MemRegion mr, OopClosure* cl, bool do_perm); | |
| 342 | 1129 |
| 1130 // Iterate over all objects, calling "cl.do_object" on each. | |
| 678 | 1131 virtual void object_iterate(ObjectClosure* cl) { |
| 1132 object_iterate(cl, true); | |
| 1133 } | |
| 1134 virtual void safe_object_iterate(ObjectClosure* cl) { | |
| 1135 object_iterate(cl, true); | |
| 1136 } | |
| 1137 void object_iterate(ObjectClosure* cl, bool do_perm); | |
| 342 | 1138 |
| 1139 // Iterate over all objects allocated since the last collection, calling | |
| 1140 // "cl.do_object" on each. The heap must have been initialized properly | |
| 1141 // to support this function, or else this call will fail. | |
| 1142 virtual void object_iterate_since_last_GC(ObjectClosure* cl); | |
| 1143 | |
| 1144 // Iterate over all spaces in use in the heap, in ascending address order. | |
| 1145 virtual void space_iterate(SpaceClosure* cl); | |
| 1146 | |
| 1147 // Iterate over heap regions, in address order, terminating the | |
| 1148 // iteration early if the "doHeapRegion" method returns "true". | |
| 1149 void heap_region_iterate(HeapRegionClosure* blk); | |
| 1150 | |
| 1151 // Iterate over heap regions starting with r (or the first region if "r" | |
| 1152 // is NULL), in address order, terminating early if the "doHeapRegion" | |
| 1153 // method returns "true". | |
| 1154 void heap_region_iterate_from(HeapRegion* r, HeapRegionClosure* blk); | |
| 1155 | |
| 1156 // As above but starting from the region at index idx. | |
| 1157 void heap_region_iterate_from(int idx, HeapRegionClosure* blk); | |
| 1158 | |
| 1159 HeapRegion* region_at(size_t idx); | |
| 1160 | |
| 1161 // Divide the heap region sequence into "chunks" of some size (the number | |
| 1162 // of regions divided by the number of parallel threads times some | |
| 1163 // overpartition factor, currently 4). Assumes that this will be called | |
| 1164 // in parallel by ParallelGCThreads worker threads with discinct worker | |
| 1165 // ids in the range [0..max(ParallelGCThreads-1, 1)], that all parallel | |
| 1166 // calls will use the same "claim_value", and that that claim value is | |
| 1167 // different from the claim_value of any heap region before the start of | |
| 1168 // the iteration. Applies "blk->doHeapRegion" to each of the regions, by | |
| 1169 // attempting to claim the first region in each chunk, and, if | |
| 1170 // successful, applying the closure to each region in the chunk (and | |
| 1171 // setting the claim value of the second and subsequent regions of the | |
| 1172 // chunk.) For now requires that "doHeapRegion" always returns "false", | |
| 1173 // i.e., that a closure never attempt to abort a traversal. | |
| 1174 void heap_region_par_iterate_chunked(HeapRegionClosure* blk, | |
| 1175 int worker, | |
| 1176 jint claim_value); | |
| 1177 | |
| 390 | 1178 // It resets all the region claim values to the default. |
| 1179 void reset_heap_region_claim_values(); | |
| 1180 | |
| 355 | 1181 #ifdef ASSERT |
| 1182 bool check_heap_region_claim_values(jint claim_value); | |
| 1183 #endif // ASSERT | |
| 1184 | |
| 342 | 1185 // Iterate over the regions (if any) in the current collection set. |
| 1186 void collection_set_iterate(HeapRegionClosure* blk); | |
| 1187 | |
| 1188 // As above but starting from region r | |
| 1189 void collection_set_iterate_from(HeapRegion* r, HeapRegionClosure *blk); | |
| 1190 | |
| 1191 // Returns the first (lowest address) compactible space in the heap. | |
| 1192 virtual CompactibleSpace* first_compactible_space(); | |
| 1193 | |
| 1194 // A CollectedHeap will contain some number of spaces. This finds the | |
| 1195 // space containing a given address, or else returns NULL. | |
| 1196 virtual Space* space_containing(const void* addr) const; | |
| 1197 | |
| 1198 // A G1CollectedHeap will contain some number of heap regions. This | |
| 1199 // finds the region containing a given address, or else returns NULL. | |
| 1200 HeapRegion* heap_region_containing(const void* addr) const; | |
| 1201 | |
| 1202 // Like the above, but requires "addr" to be in the heap (to avoid a | |
| 1203 // null-check), and unlike the above, may return an continuing humongous | |
| 1204 // region. | |
| 1205 HeapRegion* heap_region_containing_raw(const void* addr) const; | |
| 1206 | |
| 1207 // A CollectedHeap is divided into a dense sequence of "blocks"; that is, | |
| 1208 // each address in the (reserved) heap is a member of exactly | |
| 1209 // one block. The defining characteristic of a block is that it is | |
| 1210 // possible to find its size, and thus to progress forward to the next | |
| 1211 // block. (Blocks may be of different sizes.) Thus, blocks may | |
| 1212 // represent Java objects, or they might be free blocks in a | |
| 1213 // free-list-based heap (or subheap), as long as the two kinds are | |
| 1214 // distinguishable and the size of each is determinable. | |
| 1215 | |
| 1216 // Returns the address of the start of the "block" that contains the | |
| 1217 // address "addr". We say "blocks" instead of "object" since some heaps | |
| 1218 // may not pack objects densely; a chunk may either be an object or a | |
| 1219 // non-object. | |
| 1220 virtual HeapWord* block_start(const void* addr) const; | |
| 1221 | |
| 1222 // Requires "addr" to be the start of a chunk, and returns its size. | |
| 1223 // "addr + size" is required to be the start of a new chunk, or the end | |
| 1224 // of the active area of the heap. | |
| 1225 virtual size_t block_size(const HeapWord* addr) const; | |
| 1226 | |
| 1227 // Requires "addr" to be the start of a block, and returns "TRUE" iff | |
| 1228 // the block is an object. | |
| 1229 virtual bool block_is_obj(const HeapWord* addr) const; | |
| 1230 | |
| 1231 // Does this heap support heap inspection? (+PrintClassHistogram) | |
| 1232 virtual bool supports_heap_inspection() const { return true; } | |
| 1233 | |
| 1234 // Section on thread-local allocation buffers (TLABs) | |
| 1235 // See CollectedHeap for semantics. | |
| 1236 | |
| 1237 virtual bool supports_tlab_allocation() const; | |
| 1238 virtual size_t tlab_capacity(Thread* thr) const; | |
| 1239 virtual size_t unsafe_max_tlab_alloc(Thread* thr) const; | |
| 1240 | |
| 1241 // Can a compiler initialize a new object without store barriers? | |
| 1242 // This permission only extends from the creation of a new object | |
|
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1243 // via a TLAB up to the first subsequent safepoint. If such permission |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1244 // is granted for this heap type, the compiler promises to call |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1245 // defer_store_barrier() below on any slow path allocation of |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1246 // a new object for which such initializing store barriers will |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1247 // have been elided. G1, like CMS, allows this, but should be |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1248 // ready to provide a compensating write barrier as necessary |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1249 // if that storage came out of a non-young region. The efficiency |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1250 // of this implementation depends crucially on being able to |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1251 // answer very efficiently in constant time whether a piece of |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1252 // storage in the heap comes from a young region or not. |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1253 // See ReduceInitialCardMarks. |
| 342 | 1254 virtual bool can_elide_tlab_store_barriers() const { |
|
1194
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1255 // 6920090: Temporarily disabled, because of lingering |
|
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1256 // instabilities related to RICM with G1. In the |
|
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1257 // interim, the option ReduceInitialCardMarksForG1 |
|
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1258 // below is left solely as a debugging device at least |
|
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1259 // until 6920109 fixes the instabilities. |
|
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1260 return ReduceInitialCardMarksForG1; |
|
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1261 } |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1262 |
| 1166 | 1263 virtual bool card_mark_must_follow_store() const { |
| 1264 return true; | |
| 1265 } | |
| 1266 | |
|
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1267 bool is_in_young(oop obj) { |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1268 HeapRegion* hr = heap_region_containing(obj); |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1269 return hr != NULL && hr->is_young(); |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1270 } |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1271 |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1272 // We don't need barriers for initializing stores to objects |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1273 // in the young gen: for the SATB pre-barrier, there is no |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1274 // pre-value that needs to be remembered; for the remembered-set |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1275 // update logging post-barrier, we don't maintain remembered set |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1276 // information for young gen objects. Note that non-generational |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1277 // G1 does not have any "young" objects, should not elide |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1278 // the rs logging barrier and so should always answer false below. |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1279 // However, non-generational G1 (-XX:-G1Gen) appears to have |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1280 // bit-rotted so was not tested below. |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1281 virtual bool can_elide_initializing_store_barrier(oop new_obj) { |
|
1194
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1282 // Re 6920090, 6920109 above. |
|
34fb2662f6c2
6920090: G1: Disable ReduceInitialCardMarks at least until 6920109 is fixed
ysr
parents:
1166
diff
changeset
|
1283 assert(ReduceInitialCardMarksForG1, "Else cannot be here"); |
|
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1284 assert(G1Gen || !is_in_young(new_obj), |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1285 "Non-generational G1 should never return true below"); |
|
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
942
diff
changeset
|
1286 return is_in_young(new_obj); |
| 342 | 1287 } |
| 1288 | |
| 1289 // Can a compiler elide a store barrier when it writes | |
| 1290 // a permanent oop into the heap? Applies when the compiler | |
| 1291 // is storing x to the heap, where x->is_perm() is true. | |
| 1292 virtual bool can_elide_permanent_oop_store_barriers() const { | |
| 1293 // At least until perm gen collection is also G1-ified, at | |
| 1294 // which point this should return false. | |
| 1295 return true; | |
| 1296 } | |
| 1297 | |
| 1298 virtual bool allocs_are_zero_filled(); | |
| 1299 | |
| 1300 // The boundary between a "large" and "small" array of primitives, in | |
| 1301 // words. | |
| 1302 virtual size_t large_typearray_limit(); | |
| 1303 | |
| 1304 // Returns "true" iff the given word_size is "very large". | |
| 1305 static bool isHumongous(size_t word_size) { | |
|
1313
664ae0c5e0e5
6755988: G1: assert(new_obj != 0 || ... "should be forwarded")
johnc
parents:
1311
diff
changeset
|
1306 // Note this has to be strictly greater-than as the TLABs |
|
664ae0c5e0e5
6755988: G1: assert(new_obj != 0 || ... "should be forwarded")
johnc
parents:
1311
diff
changeset
|
1307 // are capped at the humongous thresold and we want to |
|
664ae0c5e0e5
6755988: G1: assert(new_obj != 0 || ... "should be forwarded")
johnc
parents:
1311
diff
changeset
|
1308 // ensure that we don't try to allocate a TLAB as |
|
664ae0c5e0e5
6755988: G1: assert(new_obj != 0 || ... "should be forwarded")
johnc
parents:
1311
diff
changeset
|
1309 // humongous and that we don't allocate a humongous |
|
664ae0c5e0e5
6755988: G1: assert(new_obj != 0 || ... "should be forwarded")
johnc
parents:
1311
diff
changeset
|
1310 // object in a TLAB. |
|
664ae0c5e0e5
6755988: G1: assert(new_obj != 0 || ... "should be forwarded")
johnc
parents:
1311
diff
changeset
|
1311 return word_size > _humongous_object_threshold_in_words; |
| 342 | 1312 } |
| 1313 | |
| 1314 // Update mod union table with the set of dirty cards. | |
| 1315 void updateModUnion(); | |
| 1316 | |
| 1317 // Set the mod union bits corresponding to the given memRegion. Note | |
| 1318 // that this is always a safe operation, since it doesn't clear any | |
| 1319 // bits. | |
| 1320 void markModUnionRange(MemRegion mr); | |
| 1321 | |
| 1322 // Records the fact that a marking phase is no longer in progress. | |
| 1323 void set_marking_complete() { | |
| 1324 _mark_in_progress = false; | |
| 1325 } | |
| 1326 void set_marking_started() { | |
| 1327 _mark_in_progress = true; | |
| 1328 } | |
| 1329 bool mark_in_progress() { | |
| 1330 return _mark_in_progress; | |
| 1331 } | |
| 1332 | |
| 1333 // Print the maximum heap capacity. | |
| 1334 virtual size_t max_capacity() const; | |
| 1335 | |
| 1336 virtual jlong millis_since_last_gc(); | |
| 1337 | |
| 1338 // Perform any cleanup actions necessary before allowing a verification. | |
| 1339 virtual void prepare_for_verify(); | |
| 1340 | |
| 1341 // Perform verification. | |
| 811 | 1342 |
| 1343 // use_prev_marking == true -> use "prev" marking information, | |
| 1344 // use_prev_marking == false -> use "next" marking information | |
| 1345 // NOTE: Only the "prev" marking information is guaranteed to be | |
| 1346 // consistent most of the time, so most calls to this should use | |
| 1347 // use_prev_marking == true. Currently, there is only one case where | |
| 1348 // this is called with use_prev_marking == false, which is to verify | |
| 1349 // the "next" marking information at the end of remark. | |
| 1350 void verify(bool allow_dirty, bool silent, bool use_prev_marking); | |
| 1351 | |
| 1352 // Override; it uses the "prev" marking information | |
| 342 | 1353 virtual void verify(bool allow_dirty, bool silent); |
|
838
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
811
diff
changeset
|
1354 // Default behavior by calling print(tty); |
| 342 | 1355 virtual void print() const; |
|
838
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
811
diff
changeset
|
1356 // This calls print_on(st, PrintHeapAtGCExtended). |
| 342 | 1357 virtual void print_on(outputStream* st) const; |
|
838
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
811
diff
changeset
|
1358 // If extended is true, it will print out information for all |
|
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
811
diff
changeset
|
1359 // regions in the heap by calling print_on_extended(st). |
|
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
811
diff
changeset
|
1360 virtual void print_on(outputStream* st, bool extended) const; |
|
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
811
diff
changeset
|
1361 virtual void print_on_extended(outputStream* st) const; |
| 342 | 1362 |
| 1363 virtual void print_gc_threads_on(outputStream* st) const; | |
| 1364 virtual void gc_threads_do(ThreadClosure* tc) const; | |
| 1365 | |
| 1366 // Override | |
| 1367 void print_tracing_info() const; | |
| 1368 | |
| 1369 // If "addr" is a pointer into the (reserved?) heap, returns a positive | |
| 1370 // number indicating the "arena" within the heap in which "addr" falls. | |
| 1371 // Or else returns 0. | |
| 1372 virtual int addr_to_arena_id(void* addr) const; | |
| 1373 | |
| 1374 // Convenience function to be used in situations where the heap type can be | |
| 1375 // asserted to be this type. | |
| 1376 static G1CollectedHeap* heap(); | |
| 1377 | |
| 1378 void empty_young_list(); | |
| 1379 | |
| 1380 void set_region_short_lived_locked(HeapRegion* hr); | |
| 1381 // add appropriate methods for any other surv rate groups | |
| 1382 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
1383 YoungList* young_list() { return _young_list; } |
| 342 | 1384 |
| 1385 // debugging | |
| 1386 bool check_young_list_well_formed() { | |
| 1387 return _young_list->check_list_well_formed(); | |
| 1388 } | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
1389 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1391
diff
changeset
|
1390 bool check_young_list_empty(bool check_heap, |
| 342 | 1391 bool check_sample = true); |
| 1392 | |
| 1393 // *** Stuff related to concurrent marking. It's not clear to me that so | |
| 1394 // many of these need to be public. | |
| 1395 | |
| 1396 // The functions below are helper functions that a subclass of | |
| 1397 // "CollectedHeap" can use in the implementation of its virtual | |
| 1398 // functions. | |
| 1399 // This performs a concurrent marking of the live objects in a | |
| 1400 // bitmap off to the side. | |
| 1401 void doConcurrentMark(); | |
| 1402 | |
| 1403 // This is called from the marksweep collector which then does | |
| 1404 // a concurrent mark and verifies that the results agree with | |
| 1405 // the stop the world marking. | |
| 1406 void checkConcurrentMark(); | |
| 1407 void do_sync_mark(); | |
| 1408 | |
| 1409 bool isMarkedPrev(oop obj) const; | |
| 1410 bool isMarkedNext(oop obj) const; | |
| 1411 | |
| 811 | 1412 // use_prev_marking == true -> use "prev" marking information, |
| 1413 // use_prev_marking == false -> use "next" marking information | |
| 1414 bool is_obj_dead_cond(const oop obj, | |
| 1415 const HeapRegion* hr, | |
| 1416 const bool use_prev_marking) const { | |
| 1417 if (use_prev_marking) { | |
| 1418 return is_obj_dead(obj, hr); | |
| 1419 } else { | |
| 1420 return is_obj_ill(obj, hr); | |
| 1421 } | |
| 1422 } | |
| 1423 | |
| 342 | 1424 // Determine if an object is dead, given the object and also |
| 1425 // the region to which the object belongs. An object is dead | |
| 1426 // iff a) it was not allocated since the last mark and b) it | |
| 1427 // is not marked. | |
| 1428 | |
| 1429 bool is_obj_dead(const oop obj, const HeapRegion* hr) const { | |
| 1430 return | |
| 1431 !hr->obj_allocated_since_prev_marking(obj) && | |
| 1432 !isMarkedPrev(obj); | |
| 1433 } | |
| 1434 | |
| 1435 // This is used when copying an object to survivor space. | |
| 1436 // If the object is marked live, then we mark the copy live. | |
| 1437 // If the object is allocated since the start of this mark | |
| 1438 // cycle, then we mark the copy live. | |
| 1439 // If the object has been around since the previous mark | |
| 1440 // phase, and hasn't been marked yet during this phase, | |
| 1441 // then we don't mark it, we just wait for the | |
| 1442 // current marking cycle to get to it. | |
| 1443 | |
| 1444 // This function returns true when an object has been | |
| 1445 // around since the previous marking and hasn't yet | |
| 1446 // been marked during this marking. | |
| 1447 | |
| 1448 bool is_obj_ill(const oop obj, const HeapRegion* hr) const { | |
| 1449 return | |
| 1450 !hr->obj_allocated_since_next_marking(obj) && | |
| 1451 !isMarkedNext(obj); | |
| 1452 } | |
| 1453 | |
| 1454 // Determine if an object is dead, given only the object itself. | |
| 1455 // This will find the region to which the object belongs and | |
| 1456 // then call the region version of the same function. | |
| 1457 | |
| 1458 // Added if it is in permanent gen it isn't dead. | |
| 1459 // Added if it is NULL it isn't dead. | |
| 1460 | |
| 811 | 1461 // use_prev_marking == true -> use "prev" marking information, |
| 1462 // use_prev_marking == false -> use "next" marking information | |
| 1463 bool is_obj_dead_cond(const oop obj, | |
| 1464 const bool use_prev_marking) { | |
| 1465 if (use_prev_marking) { | |
| 1466 return is_obj_dead(obj); | |
| 1467 } else { | |
| 1468 return is_obj_ill(obj); | |
| 1469 } | |
| 1470 } | |
| 1471 | |
| 1472 bool is_obj_dead(const oop obj) { | |
| 1473 const HeapRegion* hr = heap_region_containing(obj); | |
| 342 | 1474 if (hr == NULL) { |
| 1475 if (Universe::heap()->is_in_permanent(obj)) | |
| 1476 return false; | |
| 1477 else if (obj == NULL) return false; | |
| 1478 else return true; | |
| 1479 } | |
| 1480 else return is_obj_dead(obj, hr); | |
| 1481 } | |
| 1482 | |
| 811 | 1483 bool is_obj_ill(const oop obj) { |
| 1484 const HeapRegion* hr = heap_region_containing(obj); | |
| 342 | 1485 if (hr == NULL) { |
| 1486 if (Universe::heap()->is_in_permanent(obj)) | |
| 1487 return false; | |
| 1488 else if (obj == NULL) return false; | |
| 1489 else return true; | |
| 1490 } | |
| 1491 else return is_obj_ill(obj, hr); | |
| 1492 } | |
| 1493 | |
| 1494 // The following is just to alert the verification code | |
| 1495 // that a full collection has occurred and that the | |
| 1496 // remembered sets are no longer up to date. | |
| 1497 bool _full_collection; | |
| 1498 void set_full_collection() { _full_collection = true;} | |
| 1499 void clear_full_collection() {_full_collection = false;} | |
| 1500 bool full_collection() {return _full_collection;} | |
| 1501 | |
| 1502 ConcurrentMark* concurrent_mark() const { return _cm; } | |
| 1503 ConcurrentG1Refine* concurrent_g1_refine() const { return _cg1r; } | |
| 1504 | |
|
796
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1505 // The dirty cards region list is used to record a subset of regions |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1506 // whose cards need clearing. The list if populated during the |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1507 // remembered set scanning and drained during the card table |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1508 // cleanup. Although the methods are reentrant, population/draining |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1509 // phases must not overlap. For synchronization purposes the last |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1510 // element on the list points to itself. |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1511 HeapRegion* _dirty_cards_region_list; |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1512 void push_dirty_cards_region(HeapRegion* hr); |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1513 HeapRegion* pop_dirty_cards_region(); |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
678
diff
changeset
|
1514 |
| 342 | 1515 public: |
| 1516 void stop_conc_gc_threads(); | |
| 1517 | |
| 1518 // <NEW PREDICTION> | |
| 1519 | |
| 1520 double predict_region_elapsed_time_ms(HeapRegion* hr, bool young); | |
| 1521 void check_if_region_is_too_expensive(double predicted_time_ms); | |
| 1522 size_t pending_card_num(); | |
| 1523 size_t max_pending_card_num(); | |
| 1524 size_t cards_scanned(); | |
| 1525 | |
| 1526 // </NEW PREDICTION> | |
| 1527 | |
| 1528 protected: | |
| 1529 size_t _max_heap_capacity; | |
| 1530 | |
| 1531 public: | |
| 1532 // Temporary: call to mark things unimplemented for the G1 heap (e.g., | |
| 1533 // MemoryService). In productization, we can make this assert false | |
| 1534 // to catch such places (as well as searching for calls to this...) | |
| 1535 static void g1_unimplemented(); | |
| 1536 | |
| 1537 }; | |
| 1538 | |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1539 #define use_local_bitmaps 1 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1540 #define verify_local_bitmaps 0 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1541 #define oop_buffer_length 256 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1542 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1543 #ifndef PRODUCT |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1544 class GCLabBitMap; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1545 class GCLabBitMapClosure: public BitMapClosure { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1546 private: |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1547 ConcurrentMark* _cm; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1548 GCLabBitMap* _bitmap; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1549 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1550 public: |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1551 GCLabBitMapClosure(ConcurrentMark* cm, |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1552 GCLabBitMap* bitmap) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1553 _cm = cm; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1554 _bitmap = bitmap; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1555 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1556 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1557 virtual bool do_bit(size_t offset); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1558 }; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1559 #endif // !PRODUCT |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1560 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1561 class GCLabBitMap: public BitMap { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1562 private: |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1563 ConcurrentMark* _cm; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1564 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1565 int _shifter; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1566 size_t _bitmap_word_covers_words; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1567 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1568 // beginning of the heap |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1569 HeapWord* _heap_start; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1570 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1571 // this is the actual start of the GCLab |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1572 HeapWord* _real_start_word; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1573 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1574 // this is the actual end of the GCLab |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1575 HeapWord* _real_end_word; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1576 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1577 // this is the first word, possibly located before the actual start |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1578 // of the GCLab, that corresponds to the first bit of the bitmap |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1579 HeapWord* _start_word; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1580 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1581 // size of a GCLab in words |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1582 size_t _gclab_word_size; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1583 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1584 static int shifter() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1585 return MinObjAlignment - 1; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1586 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1587 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1588 // how many heap words does a single bitmap word corresponds to? |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1589 static size_t bitmap_word_covers_words() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1590 return BitsPerWord << shifter(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1591 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1592 |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1593 size_t gclab_word_size() const { |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1594 return _gclab_word_size; |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1595 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1596 |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1597 // Calculates actual GCLab size in words |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1598 size_t gclab_real_word_size() const { |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1599 return bitmap_size_in_bits(pointer_delta(_real_end_word, _start_word)) |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1600 / BitsPerWord; |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1601 } |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1602 |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1603 static size_t bitmap_size_in_bits(size_t gclab_word_size) { |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1604 size_t bits_in_bitmap = gclab_word_size >> shifter(); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1605 // We are going to ensure that the beginning of a word in this |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1606 // bitmap also corresponds to the beginning of a word in the |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1607 // global marking bitmap. To handle the case where a GCLab |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1608 // starts from the middle of the bitmap, we need to add enough |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1609 // space (i.e. up to a bitmap word) to ensure that we have |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1610 // enough bits in the bitmap. |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1611 return bits_in_bitmap + BitsPerWord - 1; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1612 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1613 public: |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1614 GCLabBitMap(HeapWord* heap_start, size_t gclab_word_size) |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1615 : BitMap(bitmap_size_in_bits(gclab_word_size)), |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1616 _cm(G1CollectedHeap::heap()->concurrent_mark()), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1617 _shifter(shifter()), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1618 _bitmap_word_covers_words(bitmap_word_covers_words()), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1619 _heap_start(heap_start), |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1620 _gclab_word_size(gclab_word_size), |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1621 _real_start_word(NULL), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1622 _real_end_word(NULL), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1623 _start_word(NULL) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1624 { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1625 guarantee( size_in_words() >= bitmap_size_in_words(), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1626 "just making sure"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1627 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1628 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1629 inline unsigned heapWordToOffset(HeapWord* addr) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1630 unsigned offset = (unsigned) pointer_delta(addr, _start_word) >> _shifter; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1631 assert(offset < size(), "offset should be within bounds"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1632 return offset; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1633 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1634 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1635 inline HeapWord* offsetToHeapWord(size_t offset) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1636 HeapWord* addr = _start_word + (offset << _shifter); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1637 assert(_real_start_word <= addr && addr < _real_end_word, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1638 return addr; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1639 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1640 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1641 bool fields_well_formed() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1642 bool ret1 = (_real_start_word == NULL) && |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1643 (_real_end_word == NULL) && |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1644 (_start_word == NULL); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1645 if (ret1) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1646 return true; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1647 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1648 bool ret2 = _real_start_word >= _start_word && |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1649 _start_word < _real_end_word && |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1650 (_real_start_word + _gclab_word_size) == _real_end_word && |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1651 (_start_word + _gclab_word_size + _bitmap_word_covers_words) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1652 > _real_end_word; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1653 return ret2; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1654 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1655 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1656 inline bool mark(HeapWord* addr) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1657 guarantee(use_local_bitmaps, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1658 assert(fields_well_formed(), "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1659 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1660 if (addr >= _real_start_word && addr < _real_end_word) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1661 assert(!isMarked(addr), "should not have already been marked"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1662 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1663 // first mark it on the bitmap |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1664 at_put(heapWordToOffset(addr), true); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1665 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1666 return true; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1667 } else { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1668 return false; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1669 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1670 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1671 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1672 inline bool isMarked(HeapWord* addr) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1673 guarantee(use_local_bitmaps, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1674 assert(fields_well_formed(), "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1675 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1676 return at(heapWordToOffset(addr)); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1677 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1678 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1679 void set_buffer(HeapWord* start) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1680 guarantee(use_local_bitmaps, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1681 clear(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1682 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1683 assert(start != NULL, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1684 _real_start_word = start; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1685 _real_end_word = start + _gclab_word_size; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1686 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1687 size_t diff = |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1688 pointer_delta(start, _heap_start) % _bitmap_word_covers_words; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1689 _start_word = start - diff; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1690 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1691 assert(fields_well_formed(), "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1692 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1693 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1694 #ifndef PRODUCT |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1695 void verify() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1696 // verify that the marks have been propagated |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1697 GCLabBitMapClosure cl(_cm, this); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1698 iterate(&cl); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1699 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1700 #endif // PRODUCT |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1701 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1702 void retire() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1703 guarantee(use_local_bitmaps, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1704 assert(fields_well_formed(), "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1705 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1706 if (_start_word != NULL) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1707 CMBitMap* mark_bitmap = _cm->nextMarkBitMap(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1708 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1709 // this means that the bitmap was set up for the GCLab |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1710 assert(_real_start_word != NULL && _real_end_word != NULL, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1711 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1712 mark_bitmap->mostly_disjoint_range_union(this, |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1713 0, // always start from the start of the bitmap |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1714 _start_word, |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1715 gclab_real_word_size()); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1716 _cm->grayRegionIfNecessary(MemRegion(_real_start_word, _real_end_word)); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1717 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1718 #ifndef PRODUCT |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1719 if (use_local_bitmaps && verify_local_bitmaps) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1720 verify(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1721 #endif // PRODUCT |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1722 } else { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1723 assert(_real_start_word == NULL && _real_end_word == NULL, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1724 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1725 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1726 |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1727 size_t bitmap_size_in_words() const { |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1728 return (bitmap_size_in_bits(gclab_word_size()) + BitsPerWord - 1) / BitsPerWord; |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1729 } |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1730 |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1731 }; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1732 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1733 class G1ParGCAllocBuffer: public ParGCAllocBuffer { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1734 private: |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1735 bool _retired; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1736 bool _during_marking; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1737 GCLabBitMap _bitmap; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1738 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1739 public: |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1740 G1ParGCAllocBuffer(size_t gclab_word_size) : |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1741 ParGCAllocBuffer(gclab_word_size), |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1742 _during_marking(G1CollectedHeap::heap()->mark_in_progress()), |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1743 _bitmap(G1CollectedHeap::heap()->reserved_region().start(), gclab_word_size), |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1744 _retired(false) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1745 { } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1746 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1747 inline bool mark(HeapWord* addr) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1748 guarantee(use_local_bitmaps, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1749 assert(_during_marking, "invariant"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1750 return _bitmap.mark(addr); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1751 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1752 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1753 inline void set_buf(HeapWord* buf) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1754 if (use_local_bitmaps && _during_marking) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1755 _bitmap.set_buffer(buf); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1756 ParGCAllocBuffer::set_buf(buf); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1757 _retired = false; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1758 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1759 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1760 inline void retire(bool end_of_gc, bool retain) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1761 if (_retired) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1762 return; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1763 if (use_local_bitmaps && _during_marking) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1764 _bitmap.retire(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1765 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1766 ParGCAllocBuffer::retire(end_of_gc, retain); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1767 _retired = true; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1768 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1769 }; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1770 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1771 class G1ParScanThreadState : public StackObj { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1772 protected: |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1773 G1CollectedHeap* _g1h; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1774 RefToScanQueue* _refs; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1775 DirtyCardQueue _dcq; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1776 CardTableModRefBS* _ct_bs; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1777 G1RemSet* _g1_rem; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1778 |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1779 G1ParGCAllocBuffer _surviving_alloc_buffer; |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1780 G1ParGCAllocBuffer _tenured_alloc_buffer; |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1781 G1ParGCAllocBuffer* _alloc_buffers[GCAllocPurposeCount]; |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1782 ageTable _age_table; |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1783 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1784 size_t _alloc_buffer_waste; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1785 size_t _undo_waste; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1786 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1787 OopsInHeapRegionClosure* _evac_failure_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1788 G1ParScanHeapEvacClosure* _evac_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1789 G1ParScanPartialArrayClosure* _partial_scan_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1790 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1791 int _hash_seed; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1792 int _queue_num; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1793 |
| 1611 | 1794 size_t _term_attempts; |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1795 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1796 double _start; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1797 double _start_strong_roots; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1798 double _strong_roots_time; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1799 double _start_term; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1800 double _term_time; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1801 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1802 // Map from young-age-index (0 == not young, 1 is youngest) to |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1803 // surviving words. base is what we get back from the malloc call |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1804 size_t* _surviving_young_words_base; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1805 // this points into the array, as we use the first few entries for padding |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1806 size_t* _surviving_young_words; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1807 |
| 1709 | 1808 #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t)) |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1809 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1810 void add_to_alloc_buffer_waste(size_t waste) { _alloc_buffer_waste += waste; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1811 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1812 void add_to_undo_waste(size_t waste) { _undo_waste += waste; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1813 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1814 DirtyCardQueue& dirty_card_queue() { return _dcq; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1815 CardTableModRefBS* ctbs() { return _ct_bs; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1816 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1817 template <class T> void immediate_rs_update(HeapRegion* from, T* p, int tid) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1818 if (!from->is_survivor()) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1819 _g1_rem->par_write_ref(from, p, tid); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1820 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1821 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1822 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1823 template <class T> void deferred_rs_update(HeapRegion* from, T* p, int tid) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1824 // If the new value of the field points to the same region or |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1825 // is the to-space, we don't need to include it in the Rset updates. |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1826 if (!from->is_in_reserved(oopDesc::load_decode_heap_oop(p)) && !from->is_survivor()) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1827 size_t card_index = ctbs()->index_for(p); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1828 // If the card hasn't been added to the buffer, do it. |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1829 if (ctbs()->mark_card_deferred(card_index)) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1830 dirty_card_queue().enqueue((jbyte*)ctbs()->byte_for_index(card_index)); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1831 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1832 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1833 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1834 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1835 public: |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1836 G1ParScanThreadState(G1CollectedHeap* g1h, int queue_num); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1837 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1838 ~G1ParScanThreadState() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1839 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1840 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1841 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1842 RefToScanQueue* refs() { return _refs; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1843 ageTable* age_table() { return &_age_table; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1844 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1845 G1ParGCAllocBuffer* alloc_buffer(GCAllocPurpose purpose) { |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1846 return _alloc_buffers[purpose]; |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1847 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1848 |
| 1709 | 1849 size_t alloc_buffer_waste() const { return _alloc_buffer_waste; } |
| 1850 size_t undo_waste() const { return _undo_waste; } | |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1851 |
|
1862
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1852 #ifdef ASSERT |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1853 bool verify_ref(narrowOop* ref) const; |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1854 bool verify_ref(oop* ref) const; |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1855 bool verify_task(StarTask ref) const; |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1856 #endif // ASSERT |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1857 |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1858 template <class T> void push_on_queue(T* ref) { |
|
1862
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1859 assert(verify_ref(ref), "sanity"); |
| 1709 | 1860 refs()->push(ref); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1861 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1862 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1863 template <class T> void update_rs(HeapRegion* from, T* p, int tid) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1864 if (G1DeferredRSUpdate) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1865 deferred_rs_update(from, p, tid); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1866 } else { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1867 immediate_rs_update(from, p, tid); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1868 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1869 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1870 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1871 HeapWord* allocate_slow(GCAllocPurpose purpose, size_t word_sz) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1872 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1873 HeapWord* obj = NULL; |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1874 size_t gclab_word_size = _g1h->desired_plab_sz(purpose); |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1875 if (word_sz * 100 < gclab_word_size * ParallelGCBufferWastePct) { |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1876 G1ParGCAllocBuffer* alloc_buf = alloc_buffer(purpose); |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1877 assert(gclab_word_size == alloc_buf->word_sz(), |
|
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1878 "dynamic resizing is not supported"); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1879 add_to_alloc_buffer_waste(alloc_buf->words_remaining()); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1880 alloc_buf->retire(false, false); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1881 |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1882 HeapWord* buf = _g1h->par_allocate_during_gc(purpose, gclab_word_size); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1883 if (buf == NULL) return NULL; // Let caller handle allocation failure. |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1884 // Otherwise. |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1885 alloc_buf->set_buf(buf); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1886 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1887 obj = alloc_buf->allocate(word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1888 assert(obj != NULL, "buffer was definitely big enough..."); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1889 } else { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1890 obj = _g1h->par_allocate_during_gc(purpose, word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1891 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1892 return obj; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1893 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1894 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1895 HeapWord* allocate(GCAllocPurpose purpose, size_t word_sz) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1896 HeapWord* obj = alloc_buffer(purpose)->allocate(word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1897 if (obj != NULL) return obj; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1898 return allocate_slow(purpose, word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1899 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1900 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1901 void undo_allocation(GCAllocPurpose purpose, HeapWord* obj, size_t word_sz) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1902 if (alloc_buffer(purpose)->contains(obj)) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1903 assert(alloc_buffer(purpose)->contains(obj + word_sz - 1), |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1904 "should contain whole object"); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1905 alloc_buffer(purpose)->undo_allocation(obj, word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1906 } else { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1907 CollectedHeap::fill_with_object(obj, word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1908 add_to_undo_waste(word_sz); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1909 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1910 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1911 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1912 void set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_cl) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1913 _evac_failure_cl = evac_failure_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1914 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1915 OopsInHeapRegionClosure* evac_failure_closure() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1916 return _evac_failure_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1917 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1918 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1919 void set_evac_closure(G1ParScanHeapEvacClosure* evac_cl) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1920 _evac_cl = evac_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1921 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1922 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1923 void set_partial_scan_closure(G1ParScanPartialArrayClosure* partial_scan_cl) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1924 _partial_scan_cl = partial_scan_cl; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1925 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1926 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1927 int* hash_seed() { return &_hash_seed; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1928 int queue_num() { return _queue_num; } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1929 |
| 1709 | 1930 size_t term_attempts() const { return _term_attempts; } |
| 1611 | 1931 void note_term_attempt() { _term_attempts++; } |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1932 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1933 void start_strong_roots() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1934 _start_strong_roots = os::elapsedTime(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1935 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1936 void end_strong_roots() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1937 _strong_roots_time += (os::elapsedTime() - _start_strong_roots); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1938 } |
| 1709 | 1939 double strong_roots_time() const { return _strong_roots_time; } |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1940 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1941 void start_term_time() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1942 note_term_attempt(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1943 _start_term = os::elapsedTime(); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1944 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1945 void end_term_time() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1946 _term_time += (os::elapsedTime() - _start_term); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1947 } |
| 1709 | 1948 double term_time() const { return _term_time; } |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1949 |
| 1709 | 1950 double elapsed_time() const { |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1951 return os::elapsedTime() - _start; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1952 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1953 |
| 1709 | 1954 static void |
| 1955 print_termination_stats_hdr(outputStream* const st = gclog_or_tty); | |
| 1956 void | |
| 1957 print_termination_stats(int i, outputStream* const st = gclog_or_tty) const; | |
| 1958 | |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1959 size_t* surviving_young_words() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1960 // We add on to hide entry 0 which accumulates surviving words for |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1961 // age -1 regions (i.e. non-young ones) |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1962 return _surviving_young_words; |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1963 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1964 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1965 void retire_alloc_buffers() { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1966 for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1967 size_t waste = _alloc_buffers[ap]->words_remaining(); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1968 add_to_alloc_buffer_waste(waste); |
|
1391
79e419e5ea3b
6942253: G1: replace G1ParallelGCAllocBufferSize with YoungPLABSize and OldPLABSize
apetrusenko
parents:
1313
diff
changeset
|
1969 _alloc_buffers[ap]->retire(true, false); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1970 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1971 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1972 |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1973 template <class T> void deal_with_reference(T* ref_to_scan) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1974 if (has_partial_array_mask(ref_to_scan)) { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1975 _partial_scan_cl->do_oop_nv(ref_to_scan); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1976 } else { |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1977 // Note: we can use "raw" versions of "region_containing" because |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1978 // "obj_to_scan" is definitely in the heap, and is not in a |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1979 // humongous region. |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1980 HeapRegion* r = _g1h->heap_region_containing_raw(ref_to_scan); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1981 _evac_cl->set_region(r); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1982 _evac_cl->do_oop_nv(ref_to_scan); |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1983 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1984 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1985 |
|
1862
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1986 void deal_with_reference(StarTask ref) { |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1987 assert(verify_task(ref), "sanity"); |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1988 if (ref.is_narrow()) { |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1989 deal_with_reference((narrowOop*)ref); |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1990 } else { |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1991 deal_with_reference((oop*)ref); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1992 } |
|
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1993 } |
|
1862
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1994 |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1995 public: |
|
b14ec34b1e07
6989448: G1: refactor and simplify G1ParScanThreadState
jcoomes
parents:
1836
diff
changeset
|
1996 void trim_queue(); |
|
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
838
diff
changeset
|
1997 }; |
| 1972 | 1998 |
| 1999 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP |