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