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