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