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