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