Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/g1/concurrentMark.cpp @ 3886:eeae91c9baba
7080389: G1: refactor marking code in evacuation pause copy closures
Summary: Refactor code marking code in the evacuation pause copy closures so that an evacuated object is only marked by the thread that successfully copies it.
Reviewed-by: stefank, brutisso, tonyp
author | johnc |
---|---|
date | Mon, 29 Aug 2011 10:13:06 -0700 |
parents | ff53346271fe |
children | 20213c8a3c40 |
rev | line source |
---|---|
342 | 1 /* |
2149 | 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:
1547
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1547
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:
1547
diff
changeset
|
21 * questions. |
342 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "classfile/symbolTable.hpp" | |
3771 | 27 #include "gc_implementation/g1/concurrentMark.inline.hpp" |
1972 | 28 #include "gc_implementation/g1/concurrentMarkThread.inline.hpp" |
29 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" | |
30 #include "gc_implementation/g1/g1CollectorPolicy.hpp" | |
3771 | 31 #include "gc_implementation/g1/g1OopClosures.inline.hpp" |
1972 | 32 #include "gc_implementation/g1/g1RemSet.hpp" |
33 #include "gc_implementation/g1/heapRegionRemSet.hpp" | |
34 #include "gc_implementation/g1/heapRegionSeq.inline.hpp" | |
2125
7246a374a9f2
6458402: 3 jvmti tests fail with CMS and +ExplicitGCInvokesConcurrent
kamg
parents:
2037
diff
changeset
|
35 #include "gc_implementation/shared/vmGCOperations.hpp" |
1972 | 36 #include "memory/genOopClosures.inline.hpp" |
37 #include "memory/referencePolicy.hpp" | |
38 #include "memory/resourceArea.hpp" | |
39 #include "oops/oop.inline.hpp" | |
40 #include "runtime/handles.inline.hpp" | |
41 #include "runtime/java.hpp" | |
342 | 42 |
43 // | |
44 // CMS Bit Map Wrapper | |
45 | |
46 CMBitMapRO::CMBitMapRO(ReservedSpace rs, int shifter): | |
47 _bm((uintptr_t*)NULL,0), | |
48 _shifter(shifter) { | |
49 _bmStartWord = (HeapWord*)(rs.base()); | |
50 _bmWordSize = rs.size()/HeapWordSize; // rs.size() is in bytes | |
51 ReservedSpace brs(ReservedSpace::allocation_align_size_up( | |
52 (_bmWordSize >> (_shifter + LogBitsPerByte)) + 1)); | |
53 | |
54 guarantee(brs.is_reserved(), "couldn't allocate CMS bit map"); | |
55 // For now we'll just commit all of the bit map up fromt. | |
56 // Later on we'll try to be more parsimonious with swap. | |
57 guarantee(_virtual_space.initialize(brs, brs.size()), | |
58 "couldn't reseve backing store for CMS bit map"); | |
59 assert(_virtual_space.committed_size() == brs.size(), | |
60 "didn't reserve backing store for all of CMS bit map?"); | |
61 _bm.set_map((uintptr_t*)_virtual_space.low()); | |
62 assert(_virtual_space.committed_size() << (_shifter + LogBitsPerByte) >= | |
63 _bmWordSize, "inconsistency in bit map sizing"); | |
64 _bm.set_size(_bmWordSize >> _shifter); | |
65 } | |
66 | |
67 HeapWord* CMBitMapRO::getNextMarkedWordAddress(HeapWord* addr, | |
68 HeapWord* limit) const { | |
69 // First we must round addr *up* to a possible object boundary. | |
70 addr = (HeapWord*)align_size_up((intptr_t)addr, | |
71 HeapWordSize << _shifter); | |
72 size_t addrOffset = heapWordToOffset(addr); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
73 if (limit == NULL) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
74 limit = _bmStartWord + _bmWordSize; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
75 } |
342 | 76 size_t limitOffset = heapWordToOffset(limit); |
77 size_t nextOffset = _bm.get_next_one_offset(addrOffset, limitOffset); | |
78 HeapWord* nextAddr = offsetToHeapWord(nextOffset); | |
79 assert(nextAddr >= addr, "get_next_one postcondition"); | |
80 assert(nextAddr == limit || isMarked(nextAddr), | |
81 "get_next_one postcondition"); | |
82 return nextAddr; | |
83 } | |
84 | |
85 HeapWord* CMBitMapRO::getNextUnmarkedWordAddress(HeapWord* addr, | |
86 HeapWord* limit) const { | |
87 size_t addrOffset = heapWordToOffset(addr); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
88 if (limit == NULL) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
89 limit = _bmStartWord + _bmWordSize; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
90 } |
342 | 91 size_t limitOffset = heapWordToOffset(limit); |
92 size_t nextOffset = _bm.get_next_zero_offset(addrOffset, limitOffset); | |
93 HeapWord* nextAddr = offsetToHeapWord(nextOffset); | |
94 assert(nextAddr >= addr, "get_next_one postcondition"); | |
95 assert(nextAddr == limit || !isMarked(nextAddr), | |
96 "get_next_one postcondition"); | |
97 return nextAddr; | |
98 } | |
99 | |
100 int CMBitMapRO::heapWordDiffToOffsetDiff(size_t diff) const { | |
101 assert((diff & ((1 << _shifter) - 1)) == 0, "argument check"); | |
102 return (int) (diff >> _shifter); | |
103 } | |
104 | |
105 bool CMBitMapRO::iterate(BitMapClosure* cl, MemRegion mr) { | |
106 HeapWord* left = MAX2(_bmStartWord, mr.start()); | |
107 HeapWord* right = MIN2(_bmStartWord + _bmWordSize, mr.end()); | |
108 if (right > left) { | |
109 // Right-open interval [leftOffset, rightOffset). | |
110 return _bm.iterate(cl, heapWordToOffset(left), heapWordToOffset(right)); | |
111 } else { | |
112 return true; | |
113 } | |
114 } | |
115 | |
116 void CMBitMapRO::mostly_disjoint_range_union(BitMap* from_bitmap, | |
117 size_t from_start_index, | |
118 HeapWord* to_start_word, | |
119 size_t word_num) { | |
120 _bm.mostly_disjoint_range_union(from_bitmap, | |
121 from_start_index, | |
122 heapWordToOffset(to_start_word), | |
123 word_num); | |
124 } | |
125 | |
126 #ifndef PRODUCT | |
127 bool CMBitMapRO::covers(ReservedSpace rs) const { | |
128 // assert(_bm.map() == _virtual_space.low(), "map inconsistency"); | |
645
c3a720eefe82
6816308: Changes to allow builds with latest Windows SDK 6.1 on 64bit Windows 2003
kvn
parents:
619
diff
changeset
|
129 assert(((size_t)_bm.size() * (size_t)(1 << _shifter)) == _bmWordSize, |
342 | 130 "size inconsistency"); |
131 return _bmStartWord == (HeapWord*)(rs.base()) && | |
132 _bmWordSize == rs.size()>>LogHeapWordSize; | |
133 } | |
134 #endif | |
135 | |
136 void CMBitMap::clearAll() { | |
137 _bm.clear(); | |
138 return; | |
139 } | |
140 | |
141 void CMBitMap::markRange(MemRegion mr) { | |
142 mr.intersection(MemRegion(_bmStartWord, _bmWordSize)); | |
143 assert(!mr.is_empty(), "unexpected empty region"); | |
144 assert((offsetToHeapWord(heapWordToOffset(mr.end())) == | |
145 ((HeapWord *) mr.end())), | |
146 "markRange memory region end is not card aligned"); | |
147 // convert address range into offset range | |
148 _bm.at_put_range(heapWordToOffset(mr.start()), | |
149 heapWordToOffset(mr.end()), true); | |
150 } | |
151 | |
152 void CMBitMap::clearRange(MemRegion mr) { | |
153 mr.intersection(MemRegion(_bmStartWord, _bmWordSize)); | |
154 assert(!mr.is_empty(), "unexpected empty region"); | |
155 // convert address range into offset range | |
156 _bm.at_put_range(heapWordToOffset(mr.start()), | |
157 heapWordToOffset(mr.end()), false); | |
158 } | |
159 | |
160 MemRegion CMBitMap::getAndClearMarkedRegion(HeapWord* addr, | |
161 HeapWord* end_addr) { | |
162 HeapWord* start = getNextMarkedWordAddress(addr); | |
163 start = MIN2(start, end_addr); | |
164 HeapWord* end = getNextUnmarkedWordAddress(start); | |
165 end = MIN2(end, end_addr); | |
166 assert(start <= end, "Consistency check"); | |
167 MemRegion mr(start, end); | |
168 if (!mr.is_empty()) { | |
169 clearRange(mr); | |
170 } | |
171 return mr; | |
172 } | |
173 | |
174 CMMarkStack::CMMarkStack(ConcurrentMark* cm) : | |
175 _base(NULL), _cm(cm) | |
176 #ifdef ASSERT | |
177 , _drain_in_progress(false) | |
178 , _drain_in_progress_yields(false) | |
179 #endif | |
180 {} | |
181 | |
182 void CMMarkStack::allocate(size_t size) { | |
183 _base = NEW_C_HEAP_ARRAY(oop, size); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
184 if (_base == NULL) { |
342 | 185 vm_exit_during_initialization("Failed to allocate " |
186 "CM region mark stack"); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
187 } |
342 | 188 _index = 0; |
189 _capacity = (jint) size; | |
190 _oops_do_bound = -1; | |
191 NOT_PRODUCT(_max_depth = 0); | |
192 } | |
193 | |
194 CMMarkStack::~CMMarkStack() { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
195 if (_base != NULL) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
196 FREE_C_HEAP_ARRAY(oop, _base); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
197 } |
342 | 198 } |
199 | |
200 void CMMarkStack::par_push(oop ptr) { | |
201 while (true) { | |
202 if (isFull()) { | |
203 _overflow = true; | |
204 return; | |
205 } | |
206 // Otherwise... | |
207 jint index = _index; | |
208 jint next_index = index+1; | |
209 jint res = Atomic::cmpxchg(next_index, &_index, index); | |
210 if (res == index) { | |
211 _base[index] = ptr; | |
212 // Note that we don't maintain this atomically. We could, but it | |
213 // doesn't seem necessary. | |
214 NOT_PRODUCT(_max_depth = MAX2(_max_depth, next_index)); | |
215 return; | |
216 } | |
217 // Otherwise, we need to try again. | |
218 } | |
219 } | |
220 | |
221 void CMMarkStack::par_adjoin_arr(oop* ptr_arr, int n) { | |
222 while (true) { | |
223 if (isFull()) { | |
224 _overflow = true; | |
225 return; | |
226 } | |
227 // Otherwise... | |
228 jint index = _index; | |
229 jint next_index = index + n; | |
230 if (next_index > _capacity) { | |
231 _overflow = true; | |
232 return; | |
233 } | |
234 jint res = Atomic::cmpxchg(next_index, &_index, index); | |
235 if (res == index) { | |
236 for (int i = 0; i < n; i++) { | |
237 int ind = index + i; | |
238 assert(ind < _capacity, "By overflow test above."); | |
239 _base[ind] = ptr_arr[i]; | |
240 } | |
241 NOT_PRODUCT(_max_depth = MAX2(_max_depth, next_index)); | |
242 return; | |
243 } | |
244 // Otherwise, we need to try again. | |
245 } | |
246 } | |
247 | |
248 | |
249 void CMMarkStack::par_push_arr(oop* ptr_arr, int n) { | |
250 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
251 jint start = _index; | |
252 jint next_index = start + n; | |
253 if (next_index > _capacity) { | |
254 _overflow = true; | |
255 return; | |
256 } | |
257 // Otherwise. | |
258 _index = next_index; | |
259 for (int i = 0; i < n; i++) { | |
260 int ind = start + i; | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
261 assert(ind < _capacity, "By overflow test above."); |
342 | 262 _base[ind] = ptr_arr[i]; |
263 } | |
264 } | |
265 | |
266 | |
267 bool CMMarkStack::par_pop_arr(oop* ptr_arr, int max, int* n) { | |
268 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
269 jint index = _index; | |
270 if (index == 0) { | |
271 *n = 0; | |
272 return false; | |
273 } else { | |
274 int k = MIN2(max, index); | |
275 jint new_ind = index - k; | |
276 for (int j = 0; j < k; j++) { | |
277 ptr_arr[j] = _base[new_ind + j]; | |
278 } | |
279 _index = new_ind; | |
280 *n = k; | |
281 return true; | |
282 } | |
283 } | |
284 | |
285 | |
286 CMRegionStack::CMRegionStack() : _base(NULL) {} | |
287 | |
288 void CMRegionStack::allocate(size_t size) { | |
289 _base = NEW_C_HEAP_ARRAY(MemRegion, size); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
290 if (_base == NULL) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
291 vm_exit_during_initialization("Failed to allocate CM region mark stack"); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
292 } |
342 | 293 _index = 0; |
294 _capacity = (jint) size; | |
295 } | |
296 | |
297 CMRegionStack::~CMRegionStack() { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
298 if (_base != NULL) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
299 FREE_C_HEAP_ARRAY(oop, _base); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
300 } |
342 | 301 } |
302 | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
303 void CMRegionStack::push_lock_free(MemRegion mr) { |
342 | 304 assert(mr.word_size() > 0, "Precondition"); |
305 while (true) { | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
306 jint index = _index; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
307 |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
308 if (index >= _capacity) { |
342 | 309 _overflow = true; |
310 return; | |
311 } | |
312 // Otherwise... | |
313 jint next_index = index+1; | |
314 jint res = Atomic::cmpxchg(next_index, &_index, index); | |
315 if (res == index) { | |
316 _base[index] = mr; | |
317 return; | |
318 } | |
319 // Otherwise, we need to try again. | |
320 } | |
321 } | |
322 | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
323 // Lock-free pop of the region stack. Called during the concurrent |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
324 // marking / remark phases. Should only be called in tandem with |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
325 // other lock-free pops. |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
326 MemRegion CMRegionStack::pop_lock_free() { |
342 | 327 while (true) { |
328 jint index = _index; | |
329 | |
330 if (index == 0) { | |
331 return MemRegion(); | |
332 } | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
333 // Otherwise... |
342 | 334 jint next_index = index-1; |
335 jint res = Atomic::cmpxchg(next_index, &_index, index); | |
336 if (res == index) { | |
337 MemRegion mr = _base[next_index]; | |
338 if (mr.start() != NULL) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
339 assert(mr.end() != NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
340 assert(mr.word_size() > 0, "invariant"); |
342 | 341 return mr; |
342 } else { | |
343 // that entry was invalidated... let's skip it | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
344 assert(mr.end() == NULL, "invariant"); |
342 | 345 } |
346 } | |
347 // Otherwise, we need to try again. | |
348 } | |
349 } | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
350 |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
351 #if 0 |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
352 // The routines that manipulate the region stack with a lock are |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
353 // not currently used. They should be retained, however, as a |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
354 // diagnostic aid. |
1358
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
355 |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
356 void CMRegionStack::push_with_lock(MemRegion mr) { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
357 assert(mr.word_size() > 0, "Precondition"); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
358 MutexLockerEx x(CMRegionStack_lock, Mutex::_no_safepoint_check_flag); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
359 |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
360 if (isFull()) { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
361 _overflow = true; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
362 return; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
363 } |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
364 |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
365 _base[_index] = mr; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
366 _index += 1; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
367 } |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
368 |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
369 MemRegion CMRegionStack::pop_with_lock() { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
370 MutexLockerEx x(CMRegionStack_lock, Mutex::_no_safepoint_check_flag); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
371 |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
372 while (true) { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
373 if (_index == 0) { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
374 return MemRegion(); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
375 } |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
376 _index -= 1; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
377 |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
378 MemRegion mr = _base[_index]; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
379 if (mr.start() != NULL) { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
380 assert(mr.end() != NULL, "invariant"); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
381 assert(mr.word_size() > 0, "invariant"); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
382 return mr; |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
383 } else { |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
384 // that entry was invalidated... let's skip it |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
385 assert(mr.end() == NULL, "invariant"); |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
386 } |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
387 } |
72f725c5a7be
6940310: G1: MT-unsafe calls to CM::region_stack_push() / CM::region_stack_pop()
tonyp
parents:
1317
diff
changeset
|
388 } |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
389 #endif |
342 | 390 |
391 bool CMRegionStack::invalidate_entries_into_cset() { | |
392 bool result = false; | |
393 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
394 for (int i = 0; i < _oops_do_bound; ++i) { | |
395 MemRegion mr = _base[i]; | |
396 if (mr.start() != NULL) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
397 assert(mr.end() != NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
398 assert(mr.word_size() > 0, "invariant"); |
342 | 399 HeapRegion* hr = g1h->heap_region_containing(mr.start()); |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
400 assert(hr != NULL, "invariant"); |
342 | 401 if (hr->in_collection_set()) { |
402 // The region points into the collection set | |
403 _base[i] = MemRegion(); | |
404 result = true; | |
405 } | |
406 } else { | |
407 // that entry was invalidated... let's skip it | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
408 assert(mr.end() == NULL, "invariant"); |
342 | 409 } |
410 } | |
411 return result; | |
412 } | |
413 | |
414 template<class OopClosureClass> | |
415 bool CMMarkStack::drain(OopClosureClass* cl, CMBitMap* bm, bool yield_after) { | |
416 assert(!_drain_in_progress || !_drain_in_progress_yields || yield_after | |
417 || SafepointSynchronize::is_at_safepoint(), | |
418 "Drain recursion must be yield-safe."); | |
419 bool res = true; | |
420 debug_only(_drain_in_progress = true); | |
421 debug_only(_drain_in_progress_yields = yield_after); | |
422 while (!isEmpty()) { | |
423 oop newOop = pop(); | |
424 assert(G1CollectedHeap::heap()->is_in_reserved(newOop), "Bad pop"); | |
425 assert(newOop->is_oop(), "Expected an oop"); | |
426 assert(bm == NULL || bm->isMarked((HeapWord*)newOop), | |
427 "only grey objects on this stack"); | |
428 // iterate over the oops in this oop, marking and pushing | |
429 // the ones in CMS generation. | |
430 newOop->oop_iterate(cl); | |
431 if (yield_after && _cm->do_yield_check()) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
432 res = false; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
433 break; |
342 | 434 } |
435 } | |
436 debug_only(_drain_in_progress = false); | |
437 return res; | |
438 } | |
439 | |
440 void CMMarkStack::oops_do(OopClosure* f) { | |
441 if (_index == 0) return; | |
442 assert(_oops_do_bound != -1 && _oops_do_bound <= _index, | |
443 "Bound must be set."); | |
444 for (int i = 0; i < _oops_do_bound; i++) { | |
445 f->do_oop(&_base[i]); | |
446 } | |
447 _oops_do_bound = -1; | |
448 } | |
449 | |
450 bool ConcurrentMark::not_yet_marked(oop obj) const { | |
451 return (_g1h->is_obj_ill(obj) | |
452 || (_g1h->is_in_permanent(obj) | |
453 && !nextMarkBitMap()->isMarked((HeapWord*)obj))); | |
454 } | |
455 | |
456 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away | |
457 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list | |
458 #endif // _MSC_VER | |
459 | |
460 ConcurrentMark::ConcurrentMark(ReservedSpace rs, | |
461 int max_regions) : | |
462 _markBitMap1(rs, MinObjAlignment - 1), | |
463 _markBitMap2(rs, MinObjAlignment - 1), | |
464 | |
465 _parallel_marking_threads(0), | |
466 _sleep_factor(0.0), | |
467 _marking_task_overhead(1.0), | |
468 _cleanup_sleep_factor(0.0), | |
469 _cleanup_task_overhead(1.0), | |
2152 | 470 _cleanup_list("Cleanup List"), |
342 | 471 _region_bm(max_regions, false /* in_resource_area*/), |
472 _card_bm((rs.size() + CardTableModRefBS::card_size - 1) >> | |
473 CardTableModRefBS::card_shift, | |
474 false /* in_resource_area*/), | |
475 _prevMarkBitMap(&_markBitMap1), | |
476 _nextMarkBitMap(&_markBitMap2), | |
477 _at_least_one_mark_complete(false), | |
478 | |
479 _markStack(this), | |
480 _regionStack(), | |
481 // _finger set in set_non_marking_state | |
482 | |
483 _max_task_num(MAX2(ParallelGCThreads, (size_t)1)), | |
484 // _active_tasks set in set_non_marking_state | |
485 // _tasks set inside the constructor | |
486 _task_queues(new CMTaskQueueSet((int) _max_task_num)), | |
487 _terminator(ParallelTaskTerminator((int) _max_task_num, _task_queues)), | |
488 | |
489 _has_overflown(false), | |
490 _concurrent(false), | |
619
7ea5ca260b28
6814467: G1: small fixes related to concurrent marking verboseness
tonyp
parents:
470
diff
changeset
|
491 _has_aborted(false), |
7ea5ca260b28
6814467: G1: small fixes related to concurrent marking verboseness
tonyp
parents:
470
diff
changeset
|
492 _restart_for_overflow(false), |
7ea5ca260b28
6814467: G1: small fixes related to concurrent marking verboseness
tonyp
parents:
470
diff
changeset
|
493 _concurrent_marking_in_progress(false), |
7ea5ca260b28
6814467: G1: small fixes related to concurrent marking verboseness
tonyp
parents:
470
diff
changeset
|
494 _should_gray_objects(false), |
342 | 495 |
496 // _verbose_level set below | |
497 | |
498 _init_times(), | |
499 _remark_times(), _remark_mark_times(), _remark_weak_ref_times(), | |
500 _cleanup_times(), | |
501 _total_counting_time(0.0), | |
502 _total_rs_scrub_time(0.0), | |
503 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
504 _parallel_workers(NULL) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
505 CMVerboseLevel verbose_level = (CMVerboseLevel) G1MarkingVerboseLevel; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
506 if (verbose_level < no_verbose) { |
342 | 507 verbose_level = no_verbose; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
508 } |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
509 if (verbose_level > high_verbose) { |
342 | 510 verbose_level = high_verbose; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
511 } |
342 | 512 _verbose_level = verbose_level; |
513 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
514 if (verbose_low()) { |
342 | 515 gclog_or_tty->print_cr("[global] init, heap start = "PTR_FORMAT", " |
516 "heap end = "PTR_FORMAT, _heap_start, _heap_end); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
517 } |
342 | 518 |
1284 | 519 _markStack.allocate(MarkStackSize); |
751 | 520 _regionStack.allocate(G1MarkRegionStackSize); |
342 | 521 |
522 // Create & start a ConcurrentMark thread. | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
523 _cmThread = new ConcurrentMarkThread(this); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
524 assert(cmThread() != NULL, "CM Thread should have been created"); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
525 assert(cmThread()->cm() != NULL, "CM Thread should refer to this cm"); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
526 |
342 | 527 _g1h = G1CollectedHeap::heap(); |
528 assert(CGC_lock != NULL, "Where's the CGC_lock?"); | |
529 assert(_markBitMap1.covers(rs), "_markBitMap1 inconsistency"); | |
530 assert(_markBitMap2.covers(rs), "_markBitMap2 inconsistency"); | |
531 | |
532 SATBMarkQueueSet& satb_qs = JavaThread::satb_mark_queue_set(); | |
1282 | 533 satb_qs.set_buffer_size(G1SATBBufferSize); |
342 | 534 |
535 _tasks = NEW_C_HEAP_ARRAY(CMTask*, _max_task_num); | |
536 _accum_task_vtime = NEW_C_HEAP_ARRAY(double, _max_task_num); | |
537 | |
538 // so that the assertion in MarkingTaskQueue::task_queue doesn't fail | |
539 _active_tasks = _max_task_num; | |
540 for (int i = 0; i < (int) _max_task_num; ++i) { | |
541 CMTaskQueue* task_queue = new CMTaskQueue(); | |
542 task_queue->initialize(); | |
543 _task_queues->register_queue(i, task_queue); | |
544 | |
545 _tasks[i] = new CMTask(i, this, task_queue, _task_queues); | |
546 _accum_task_vtime[i] = 0.0; | |
547 } | |
548 | |
1284 | 549 if (ConcGCThreads > ParallelGCThreads) { |
550 vm_exit_during_initialization("Can't have more ConcGCThreads " | |
342 | 551 "than ParallelGCThreads."); |
552 } | |
553 if (ParallelGCThreads == 0) { | |
554 // if we are not running with any parallel GC threads we will not | |
555 // spawn any marking threads either | |
556 _parallel_marking_threads = 0; | |
557 _sleep_factor = 0.0; | |
558 _marking_task_overhead = 1.0; | |
559 } else { | |
1284 | 560 if (ConcGCThreads > 0) { |
561 // notice that ConcGCThreads overwrites G1MarkingOverheadPercent | |
342 | 562 // if both are set |
563 | |
1284 | 564 _parallel_marking_threads = ConcGCThreads; |
342 | 565 _sleep_factor = 0.0; |
566 _marking_task_overhead = 1.0; | |
751 | 567 } else if (G1MarkingOverheadPercent > 0) { |
342 | 568 // we will calculate the number of parallel marking threads |
569 // based on a target overhead with respect to the soft real-time | |
570 // goal | |
571 | |
751 | 572 double marking_overhead = (double) G1MarkingOverheadPercent / 100.0; |
342 | 573 double overall_cm_overhead = |
751 | 574 (double) MaxGCPauseMillis * marking_overhead / |
575 (double) GCPauseIntervalMillis; | |
342 | 576 double cpu_ratio = 1.0 / (double) os::processor_count(); |
577 double marking_thread_num = ceil(overall_cm_overhead / cpu_ratio); | |
578 double marking_task_overhead = | |
579 overall_cm_overhead / marking_thread_num * | |
580 (double) os::processor_count(); | |
581 double sleep_factor = | |
582 (1.0 - marking_task_overhead) / marking_task_overhead; | |
583 | |
584 _parallel_marking_threads = (size_t) marking_thread_num; | |
585 _sleep_factor = sleep_factor; | |
586 _marking_task_overhead = marking_task_overhead; | |
587 } else { | |
588 _parallel_marking_threads = MAX2((ParallelGCThreads + 2) / 4, (size_t)1); | |
589 _sleep_factor = 0.0; | |
590 _marking_task_overhead = 1.0; | |
591 } | |
592 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
593 if (parallel_marking_threads() > 1) { |
342 | 594 _cleanup_task_overhead = 1.0; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
595 } else { |
342 | 596 _cleanup_task_overhead = marking_task_overhead(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
597 } |
342 | 598 _cleanup_sleep_factor = |
599 (1.0 - cleanup_task_overhead()) / cleanup_task_overhead(); | |
600 | |
601 #if 0 | |
602 gclog_or_tty->print_cr("Marking Threads %d", parallel_marking_threads()); | |
603 gclog_or_tty->print_cr("CM Marking Task Overhead %1.4lf", marking_task_overhead()); | |
604 gclog_or_tty->print_cr("CM Sleep Factor %1.4lf", sleep_factor()); | |
605 gclog_or_tty->print_cr("CL Marking Task Overhead %1.4lf", cleanup_task_overhead()); | |
606 gclog_or_tty->print_cr("CL Sleep Factor %1.4lf", cleanup_sleep_factor()); | |
607 #endif | |
608 | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
609 guarantee(parallel_marking_threads() > 0, "peace of mind"); |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
610 _parallel_workers = new FlexibleWorkGang("G1 Parallel Marking Threads", |
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
611 (int) _parallel_marking_threads, false, true); |
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
612 if (_parallel_workers == NULL) { |
342 | 613 vm_exit_during_initialization("Failed necessary allocation."); |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
614 } else { |
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
615 _parallel_workers->initialize_workers(); |
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
616 } |
342 | 617 } |
618 | |
619 // so that the call below can read a sensible value | |
620 _heap_start = (HeapWord*) rs.base(); | |
621 set_non_marking_state(); | |
622 } | |
623 | |
624 void ConcurrentMark::update_g1_committed(bool force) { | |
625 // If concurrent marking is not in progress, then we do not need to | |
626 // update _heap_end. This has a subtle and important | |
627 // side-effect. Imagine that two evacuation pauses happen between | |
628 // marking completion and remark. The first one can grow the | |
629 // heap (hence now the finger is below the heap end). Then, the | |
630 // second one could unnecessarily push regions on the region | |
631 // stack. This causes the invariant that the region stack is empty | |
632 // at the beginning of remark to be false. By ensuring that we do | |
633 // not observe heap expansions after marking is complete, then we do | |
634 // not have this problem. | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
635 if (!concurrent_marking_in_progress() && !force) return; |
342 | 636 |
637 MemRegion committed = _g1h->g1_committed(); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
638 assert(committed.start() == _heap_start, "start shouldn't change"); |
342 | 639 HeapWord* new_end = committed.end(); |
640 if (new_end > _heap_end) { | |
641 // The heap has been expanded. | |
642 | |
643 _heap_end = new_end; | |
644 } | |
645 // Notice that the heap can also shrink. However, this only happens | |
646 // during a Full GC (at least currently) and the entire marking | |
647 // phase will bail out and the task will not be restarted. So, let's | |
648 // do nothing. | |
649 } | |
650 | |
651 void ConcurrentMark::reset() { | |
652 // Starting values for these two. This should be called in a STW | |
653 // phase. CM will be notified of any future g1_committed expansions | |
654 // will be at the end of evacuation pauses, when tasks are | |
655 // inactive. | |
656 MemRegion committed = _g1h->g1_committed(); | |
657 _heap_start = committed.start(); | |
658 _heap_end = committed.end(); | |
659 | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
660 // Separated the asserts so that we know which one fires. |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
661 assert(_heap_start != NULL, "heap bounds should look ok"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
662 assert(_heap_end != NULL, "heap bounds should look ok"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
663 assert(_heap_start < _heap_end, "heap bounds should look ok"); |
342 | 664 |
665 // reset all the marking data structures and any necessary flags | |
666 clear_marking_state(); | |
667 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
668 if (verbose_low()) { |
342 | 669 gclog_or_tty->print_cr("[global] resetting"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
670 } |
342 | 671 |
672 // We do reset all of them, since different phases will use | |
673 // different number of active threads. So, it's easiest to have all | |
674 // of them ready. | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
675 for (int i = 0; i < (int) _max_task_num; ++i) { |
342 | 676 _tasks[i]->reset(_nextMarkBitMap); |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
677 } |
342 | 678 |
679 // we need this to make sure that the flag is on during the evac | |
680 // pause with initial mark piggy-backed | |
681 set_concurrent_marking_in_progress(); | |
682 } | |
683 | |
684 void ConcurrentMark::set_phase(size_t active_tasks, bool concurrent) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
685 assert(active_tasks <= _max_task_num, "we should not have more"); |
342 | 686 |
687 _active_tasks = active_tasks; | |
688 // Need to update the three data structures below according to the | |
689 // number of active threads for this phase. | |
690 _terminator = ParallelTaskTerminator((int) active_tasks, _task_queues); | |
691 _first_overflow_barrier_sync.set_n_workers((int) active_tasks); | |
692 _second_overflow_barrier_sync.set_n_workers((int) active_tasks); | |
693 | |
694 _concurrent = concurrent; | |
695 // We propagate this to all tasks, not just the active ones. | |
696 for (int i = 0; i < (int) _max_task_num; ++i) | |
697 _tasks[i]->set_concurrent(concurrent); | |
698 | |
699 if (concurrent) { | |
700 set_concurrent_marking_in_progress(); | |
701 } else { | |
702 // We currently assume that the concurrent flag has been set to | |
703 // false before we start remark. At this point we should also be | |
704 // in a STW phase. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
705 assert(!concurrent_marking_in_progress(), "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
706 assert(_finger == _heap_end, "only way to get here"); |
342 | 707 update_g1_committed(true); |
708 } | |
709 } | |
710 | |
711 void ConcurrentMark::set_non_marking_state() { | |
712 // We set the global marking state to some default values when we're | |
713 // not doing marking. | |
714 clear_marking_state(); | |
715 _active_tasks = 0; | |
716 clear_concurrent_marking_in_progress(); | |
717 } | |
718 | |
719 ConcurrentMark::~ConcurrentMark() { | |
720 for (int i = 0; i < (int) _max_task_num; ++i) { | |
721 delete _task_queues->queue(i); | |
722 delete _tasks[i]; | |
723 } | |
724 delete _task_queues; | |
725 FREE_C_HEAP_ARRAY(CMTask*, _max_task_num); | |
726 } | |
727 | |
728 // This closure is used to mark refs into the g1 generation | |
729 // from external roots in the CMS bit map. | |
730 // Called at the first checkpoint. | |
731 // | |
732 | |
733 void ConcurrentMark::clearNextBitmap() { | |
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
734 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
735 G1CollectorPolicy* g1p = g1h->g1_policy(); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
736 |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
737 // Make sure that the concurrent mark thread looks to still be in |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
738 // the current cycle. |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
739 guarantee(cmThread()->during_cycle(), "invariant"); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
740 |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
741 // We are finishing up the current cycle by clearing the next |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
742 // marking bitmap and getting it ready for the next cycle. During |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
743 // this time no other cycle can start. So, let's make sure that this |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
744 // is the case. |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
745 guarantee(!g1h->mark_in_progress(), "invariant"); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
746 |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
747 // clear the mark bitmap (no grey objects to start with). |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
748 // We need to do this in chunks and offer to yield in between |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
749 // each chunk. |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
750 HeapWord* start = _nextMarkBitMap->startWord(); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
751 HeapWord* end = _nextMarkBitMap->endWord(); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
752 HeapWord* cur = start; |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
753 size_t chunkSize = M; |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
754 while (cur < end) { |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
755 HeapWord* next = cur + chunkSize; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
756 if (next > end) { |
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
757 next = end; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
758 } |
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
759 MemRegion mr(cur,next); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
760 _nextMarkBitMap->clearRange(mr); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
761 cur = next; |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
762 do_yield_check(); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
763 |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
764 // Repeat the asserts from above. We'll do them as asserts here to |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
765 // minimize their overhead on the product. However, we'll have |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
766 // them as guarantees at the beginning / end of the bitmap |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
767 // clearing to get some checking in the product. |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
768 assert(cmThread()->during_cycle(), "invariant"); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
769 assert(!g1h->mark_in_progress(), "invariant"); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
770 } |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
771 |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
772 // Repeat the asserts from above. |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
773 guarantee(cmThread()->during_cycle(), "invariant"); |
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1358
diff
changeset
|
774 guarantee(!g1h->mark_in_progress(), "invariant"); |
342 | 775 } |
776 | |
777 class NoteStartOfMarkHRClosure: public HeapRegionClosure { | |
778 public: | |
779 bool doHeapRegion(HeapRegion* r) { | |
780 if (!r->continuesHumongous()) { | |
781 r->note_start_of_marking(true); | |
782 } | |
783 return false; | |
784 } | |
785 }; | |
786 | |
787 void ConcurrentMark::checkpointRootsInitialPre() { | |
788 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
789 G1CollectorPolicy* g1p = g1h->g1_policy(); | |
790 | |
791 _has_aborted = false; | |
792 | |
1547
fb1a39993f69
6951319: enable solaris builds using Sun Studio 12 update 1
jcoomes
parents:
1388
diff
changeset
|
793 #ifndef PRODUCT |
1044 | 794 if (G1PrintReachableAtInitialMark) { |
1388 | 795 print_reachable("at-cycle-start", |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
796 VerifyOption_G1UsePrevMarking, true /* all */); |
1044 | 797 } |
1547
fb1a39993f69
6951319: enable solaris builds using Sun Studio 12 update 1
jcoomes
parents:
1388
diff
changeset
|
798 #endif |
342 | 799 |
800 // Initialise marking structures. This has to be done in a STW phase. | |
801 reset(); | |
802 } | |
803 | |
804 | |
805 void ConcurrentMark::checkpointRootsInitialPost() { | |
806 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
807 | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
808 // If we force an overflow during remark, the remark operation will |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
809 // actually abort and we'll restart concurrent marking. If we always |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
810 // force an oveflow during remark we'll never actually complete the |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
811 // marking phase. So, we initilize this here, at the start of the |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
812 // cycle, so that at the remaining overflow number will decrease at |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
813 // every remark and we'll eventually not need to cause one. |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
814 force_overflow_stw()->init(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
815 |
342 | 816 // For each region note start of marking. |
817 NoteStartOfMarkHRClosure startcl; | |
818 g1h->heap_region_iterate(&startcl); | |
819 | |
820 // Start weak-reference discovery. | |
821 ReferenceProcessor* rp = g1h->ref_processor(); | |
822 rp->verify_no_references_recorded(); | |
823 rp->enable_discovery(); // enable ("weak") refs discovery | |
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
824 rp->setup_policy(false); // snapshot the soft ref policy to be used in this cycle |
342 | 825 |
826 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); | |
1317
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
827 // This is the start of the marking cycle, we're expected all |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
828 // threads to have SATB queues with active set to false. |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
829 satb_mq_set.set_active_all_threads(true, /* new active value */ |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
830 false /* expected_active */); |
342 | 831 |
832 // update_g1_committed() will be called at the end of an evac pause | |
833 // when marking is on. So, it's also called at the end of the | |
834 // initial-mark pause to update the heap end, if the heap expands | |
835 // during it. No need to call it here. | |
836 } | |
837 | |
838 /* | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
839 * Notice that in the next two methods, we actually leave the STS |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
840 * during the barrier sync and join it immediately afterwards. If we |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
841 * do not do this, the following deadlock can occur: one thread could |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
842 * be in the barrier sync code, waiting for the other thread to also |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
843 * sync up, whereas another one could be trying to yield, while also |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
844 * waiting for the other threads to sync up too. |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
845 * |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
846 * Note, however, that this code is also used during remark and in |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
847 * this case we should not attempt to leave / enter the STS, otherwise |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
848 * we'll either hit an asseert (debug / fastdebug) or deadlock |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
849 * (product). So we should only leave / enter the STS if we are |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
850 * operating concurrently. |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
851 * |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
852 * Because the thread that does the sync barrier has left the STS, it |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
853 * is possible to be suspended for a Full GC or an evacuation pause |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
854 * could occur. This is actually safe, since the entering the sync |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
855 * barrier is one of the last things do_marking_step() does, and it |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
856 * doesn't manipulate any data structures afterwards. |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
857 */ |
342 | 858 |
859 void ConcurrentMark::enter_first_sync_barrier(int task_num) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
860 if (verbose_low()) { |
342 | 861 gclog_or_tty->print_cr("[%d] entering first barrier", task_num); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
862 } |
342 | 863 |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
864 if (concurrent()) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
865 ConcurrentGCThread::stsLeave(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
866 } |
342 | 867 _first_overflow_barrier_sync.enter(); |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
868 if (concurrent()) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
869 ConcurrentGCThread::stsJoin(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
870 } |
342 | 871 // at this point everyone should have synced up and not be doing any |
872 // more work | |
873 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
874 if (verbose_low()) { |
342 | 875 gclog_or_tty->print_cr("[%d] leaving first barrier", task_num); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
876 } |
342 | 877 |
878 // let task 0 do this | |
879 if (task_num == 0) { | |
880 // task 0 is responsible for clearing the global data structures | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
881 // We should be here because of an overflow. During STW we should |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
882 // not clear the overflow flag since we rely on it being true when |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
883 // we exit this method to abort the pause and restart concurent |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
884 // marking. |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
885 clear_marking_state(concurrent() /* clear_overflow */); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
886 force_overflow()->update(); |
342 | 887 |
888 if (PrintGC) { | |
889 gclog_or_tty->date_stamp(PrintGCDateStamps); | |
890 gclog_or_tty->stamp(PrintGCTimeStamps); | |
891 gclog_or_tty->print_cr("[GC concurrent-mark-reset-for-overflow]"); | |
892 } | |
893 } | |
894 | |
895 // after this, each task should reset its own data structures then | |
896 // then go into the second barrier | |
897 } | |
898 | |
899 void ConcurrentMark::enter_second_sync_barrier(int task_num) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
900 if (verbose_low()) { |
342 | 901 gclog_or_tty->print_cr("[%d] entering second barrier", task_num); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
902 } |
342 | 903 |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
904 if (concurrent()) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
905 ConcurrentGCThread::stsLeave(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
906 } |
342 | 907 _second_overflow_barrier_sync.enter(); |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
908 if (concurrent()) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
909 ConcurrentGCThread::stsJoin(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
910 } |
342 | 911 // at this point everything should be re-initialised and ready to go |
912 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
913 if (verbose_low()) { |
342 | 914 gclog_or_tty->print_cr("[%d] leaving second barrier", task_num); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
915 } |
342 | 916 } |
917 | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
918 #ifndef PRODUCT |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
919 void ForceOverflowSettings::init() { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
920 _num_remaining = G1ConcMarkForceOverflow; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
921 _force = false; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
922 update(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
923 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
924 |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
925 void ForceOverflowSettings::update() { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
926 if (_num_remaining > 0) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
927 _num_remaining -= 1; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
928 _force = true; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
929 } else { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
930 _force = false; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
931 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
932 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
933 |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
934 bool ForceOverflowSettings::should_force() { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
935 if (_force) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
936 _force = false; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
937 return true; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
938 } else { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
939 return false; |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
940 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
941 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
942 #endif // !PRODUCT |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
943 |
342 | 944 void ConcurrentMark::grayRoot(oop p) { |
945 HeapWord* addr = (HeapWord*) p; | |
946 // We can't really check against _heap_start and _heap_end, since it | |
947 // is possible during an evacuation pause with piggy-backed | |
948 // initial-mark that the committed space is expanded during the | |
949 // pause without CM observing this change. So the assertions below | |
950 // is a bit conservative; but better than nothing. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
951 assert(_g1h->g1_committed().contains(addr), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
952 "address should be within the heap bounds"); |
342 | 953 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
954 if (!_nextMarkBitMap->isMarked(addr)) { |
342 | 955 _nextMarkBitMap->parMark(addr); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
956 } |
342 | 957 } |
958 | |
959 void ConcurrentMark::grayRegionIfNecessary(MemRegion mr) { | |
960 // The objects on the region have already been marked "in bulk" by | |
961 // the caller. We only need to decide whether to push the region on | |
962 // the region stack or not. | |
963 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
964 if (!concurrent_marking_in_progress() || !_should_gray_objects) { |
342 | 965 // We're done with marking and waiting for remark. We do not need to |
966 // push anything else on the region stack. | |
967 return; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
968 } |
342 | 969 |
970 HeapWord* finger = _finger; | |
971 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
972 if (verbose_low()) { |
342 | 973 gclog_or_tty->print_cr("[global] attempting to push " |
974 "region ["PTR_FORMAT", "PTR_FORMAT"), finger is at " | |
975 PTR_FORMAT, mr.start(), mr.end(), finger); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
976 } |
342 | 977 |
978 if (mr.start() < finger) { | |
979 // The finger is always heap region aligned and it is not possible | |
980 // for mr to span heap regions. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
981 assert(mr.end() <= finger, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
982 |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
983 // Separated the asserts so that we know which one fires. |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
984 assert(mr.start() <= mr.end(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
985 "region boundaries should fall within the committed space"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
986 assert(_heap_start <= mr.start(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
987 "region boundaries should fall within the committed space"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
988 assert(mr.end() <= _heap_end, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
989 "region boundaries should fall within the committed space"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
990 if (verbose_low()) { |
342 | 991 gclog_or_tty->print_cr("[global] region ["PTR_FORMAT", "PTR_FORMAT") " |
992 "below the finger, pushing it", | |
993 mr.start(), mr.end()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
994 } |
342 | 995 |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
996 if (!region_stack_push_lock_free(mr)) { |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
997 if (verbose_low()) { |
342 | 998 gclog_or_tty->print_cr("[global] region stack has overflown."); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
999 } |
342 | 1000 } |
1001 } | |
1002 } | |
1003 | |
1004 void ConcurrentMark::markAndGrayObjectIfNecessary(oop p) { | |
1005 // The object is not marked by the caller. We need to at least mark | |
1006 // it and maybe push in on the stack. | |
1007 | |
1008 HeapWord* addr = (HeapWord*)p; | |
1009 if (!_nextMarkBitMap->isMarked(addr)) { | |
1010 // We definitely need to mark it, irrespective whether we bail out | |
1011 // because we're done with marking. | |
1012 if (_nextMarkBitMap->parMark(addr)) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1013 if (!concurrent_marking_in_progress() || !_should_gray_objects) { |
342 | 1014 // If we're done with concurrent marking and we're waiting for |
1015 // remark, then we're not pushing anything on the stack. | |
1016 return; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1017 } |
342 | 1018 |
1019 // No OrderAccess:store_load() is needed. It is implicit in the | |
1020 // CAS done in parMark(addr) above | |
1021 HeapWord* finger = _finger; | |
1022 | |
1023 if (addr < finger) { | |
1024 if (!mark_stack_push(oop(addr))) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1025 if (verbose_low()) { |
342 | 1026 gclog_or_tty->print_cr("[global] global stack overflow " |
1027 "during parMark"); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1028 } |
342 | 1029 } |
1030 } | |
1031 } | |
1032 } | |
1033 } | |
1034 | |
1035 class CMConcurrentMarkingTask: public AbstractGangTask { | |
1036 private: | |
1037 ConcurrentMark* _cm; | |
1038 ConcurrentMarkThread* _cmt; | |
1039 | |
1040 public: | |
1041 void work(int worker_i) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
1042 assert(Thread::current()->is_ConcurrentGC_thread(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
1043 "this should only be done by a conc GC thread"); |
1974
fd1d227ef1b9
6983204: G1: Nightly test nsk/regression/b4958615 failing with +ExplicitGCInvokesConcurrent
johnc
parents:
1972
diff
changeset
|
1044 ResourceMark rm; |
342 | 1045 |
1046 double start_vtime = os::elapsedVTime(); | |
1047 | |
1048 ConcurrentGCThread::stsJoin(); | |
1049 | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
1050 assert((size_t) worker_i < _cm->active_tasks(), "invariant"); |
342 | 1051 CMTask* the_task = _cm->task(worker_i); |
1052 the_task->record_start_time(); | |
1053 if (!_cm->has_aborted()) { | |
1054 do { | |
1055 double start_vtime_sec = os::elapsedVTime(); | |
1056 double start_time_sec = os::elapsedTime(); | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1057 double mark_step_duration_ms = G1ConcMarkStepDurationMillis; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1058 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1059 the_task->do_marking_step(mark_step_duration_ms, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1060 true /* do_stealing */, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1061 true /* do_termination */); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1062 |
342 | 1063 double end_time_sec = os::elapsedTime(); |
1064 double end_vtime_sec = os::elapsedVTime(); | |
1065 double elapsed_vtime_sec = end_vtime_sec - start_vtime_sec; | |
1066 double elapsed_time_sec = end_time_sec - start_time_sec; | |
1067 _cm->clear_has_overflown(); | |
1068 | |
1069 bool ret = _cm->do_yield_check(worker_i); | |
1070 | |
1071 jlong sleep_time_ms; | |
1072 if (!_cm->has_aborted() && the_task->has_aborted()) { | |
1073 sleep_time_ms = | |
1074 (jlong) (elapsed_vtime_sec * _cm->sleep_factor() * 1000.0); | |
1075 ConcurrentGCThread::stsLeave(); | |
1076 os::sleep(Thread::current(), sleep_time_ms, false); | |
1077 ConcurrentGCThread::stsJoin(); | |
1078 } | |
1079 double end_time2_sec = os::elapsedTime(); | |
1080 double elapsed_time2_sec = end_time2_sec - start_time_sec; | |
1081 | |
1082 #if 0 | |
1083 gclog_or_tty->print_cr("CM: elapsed %1.4lf ms, sleep %1.4lf ms, " | |
1084 "overhead %1.4lf", | |
1085 elapsed_vtime_sec * 1000.0, (double) sleep_time_ms, | |
1086 the_task->conc_overhead(os::elapsedTime()) * 8.0); | |
1087 gclog_or_tty->print_cr("elapsed time %1.4lf ms, time 2: %1.4lf ms", | |
1088 elapsed_time_sec * 1000.0, elapsed_time2_sec * 1000.0); | |
1089 #endif | |
1090 } while (!_cm->has_aborted() && the_task->has_aborted()); | |
1091 } | |
1092 the_task->record_end_time(); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
1093 guarantee(!the_task->has_aborted() || _cm->has_aborted(), "invariant"); |
342 | 1094 |
1095 ConcurrentGCThread::stsLeave(); | |
1096 | |
1097 double end_vtime = os::elapsedVTime(); | |
1098 _cm->update_accum_task_vtime(worker_i, end_vtime - start_vtime); | |
1099 } | |
1100 | |
1101 CMConcurrentMarkingTask(ConcurrentMark* cm, | |
1102 ConcurrentMarkThread* cmt) : | |
1103 AbstractGangTask("Concurrent Mark"), _cm(cm), _cmt(cmt) { } | |
1104 | |
1105 ~CMConcurrentMarkingTask() { } | |
1106 }; | |
1107 | |
1108 void ConcurrentMark::markFromRoots() { | |
1109 // we might be tempted to assert that: | |
1110 // assert(asynch == !SafepointSynchronize::is_at_safepoint(), | |
1111 // "inconsistent argument?"); | |
1112 // However that wouldn't be right, because it's possible that | |
1113 // a safepoint is indeed in progress as a younger generation | |
1114 // stop-the-world GC happens even as we mark in this generation. | |
1115 | |
1116 _restart_for_overflow = false; | |
1117 | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1118 size_t active_workers = MAX2((size_t) 1, parallel_marking_threads()); |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
1119 force_overflow_conc()->init(); |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1120 set_phase(active_workers, true /* concurrent */); |
342 | 1121 |
1122 CMConcurrentMarkingTask markingTask(this, cmThread()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1123 if (parallel_marking_threads() > 0) { |
342 | 1124 _parallel_workers->run_task(&markingTask); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1125 } else { |
342 | 1126 markingTask.work(0); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1127 } |
342 | 1128 print_stats(); |
1129 } | |
1130 | |
1131 void ConcurrentMark::checkpointRootsFinal(bool clear_all_soft_refs) { | |
1132 // world is stopped at this checkpoint | |
1133 assert(SafepointSynchronize::is_at_safepoint(), | |
1134 "world should be stopped"); | |
1135 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
1136 | |
1137 // If a full collection has happened, we shouldn't do this. | |
1138 if (has_aborted()) { | |
1139 g1h->set_marking_complete(); // So bitmap clearing isn't confused | |
1140 return; | |
1141 } | |
1142 | |
2125
7246a374a9f2
6458402: 3 jvmti tests fail with CMS and +ExplicitGCInvokesConcurrent
kamg
parents:
2037
diff
changeset
|
1143 SvcGCMarker sgcm(SvcGCMarker::OTHER); |
7246a374a9f2
6458402: 3 jvmti tests fail with CMS and +ExplicitGCInvokesConcurrent
kamg
parents:
2037
diff
changeset
|
1144 |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1145 if (VerifyDuringGC) { |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1146 HandleMark hm; // handle scope |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1147 gclog_or_tty->print(" VerifyDuringGC:(before)"); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1148 Universe::heap()->prepare_for_verify(); |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1149 Universe::verify(/* allow dirty */ true, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1150 /* silent */ false, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1151 /* option */ VerifyOption_G1UsePrevMarking); |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1152 } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1153 |
342 | 1154 G1CollectorPolicy* g1p = g1h->g1_policy(); |
1155 g1p->record_concurrent_mark_remark_start(); | |
1156 | |
1157 double start = os::elapsedTime(); | |
1158 | |
1159 checkpointRootsFinalWork(); | |
1160 | |
1161 double mark_work_end = os::elapsedTime(); | |
1162 | |
1163 weakRefsWork(clear_all_soft_refs); | |
1164 | |
1165 if (has_overflown()) { | |
1166 // Oops. We overflowed. Restart concurrent marking. | |
1167 _restart_for_overflow = true; | |
1168 // Clear the flag. We do not need it any more. | |
1169 clear_has_overflown(); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1170 if (G1TraceMarkStackOverflow) { |
342 | 1171 gclog_or_tty->print_cr("\nRemark led to restart for overflow."); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1172 } |
342 | 1173 } else { |
2149 | 1174 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); |
342 | 1175 // We're done with marking. |
1317
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
1176 // This is the end of the marking cycle, we're expected all |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
1177 // threads to have SATB queues with active set to true. |
2149 | 1178 satb_mq_set.set_active_all_threads(false, /* new active value */ |
1179 true /* expected_active */); | |
811 | 1180 |
1181 if (VerifyDuringGC) { | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1182 HandleMark hm; // handle scope |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1183 gclog_or_tty->print(" VerifyDuringGC:(after)"); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1184 Universe::heap()->prepare_for_verify(); |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1185 Universe::verify(/* allow dirty */ true, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1186 /* silent */ false, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1187 /* option */ VerifyOption_G1UseNextMarking); |
811 | 1188 } |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1189 assert(!restart_for_overflow(), "sanity"); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1190 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1191 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1192 // Reset the marking state if marking completed |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1193 if (!restart_for_overflow()) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1194 set_non_marking_state(); |
342 | 1195 } |
1196 | |
1197 #if VERIFY_OBJS_PROCESSED | |
1198 _scan_obj_cl.objs_processed = 0; | |
1199 ThreadLocalObjQueue::objs_enqueued = 0; | |
1200 #endif | |
1201 | |
1202 // Statistics | |
1203 double now = os::elapsedTime(); | |
1204 _remark_mark_times.add((mark_work_end - start) * 1000.0); | |
1205 _remark_weak_ref_times.add((now - mark_work_end) * 1000.0); | |
1206 _remark_times.add((now - start) * 1000.0); | |
1207 | |
1208 g1p->record_concurrent_mark_remark_end(); | |
1209 } | |
1210 | |
1211 #define CARD_BM_TEST_MODE 0 | |
1212 | |
1213 class CalcLiveObjectsClosure: public HeapRegionClosure { | |
1214 | |
1215 CMBitMapRO* _bm; | |
1216 ConcurrentMark* _cm; | |
1217 bool _changed; | |
1218 bool _yield; | |
1219 size_t _words_done; | |
1220 size_t _tot_live; | |
1221 size_t _tot_used; | |
1222 size_t _regions_done; | |
1223 double _start_vtime_sec; | |
1224 | |
1225 BitMap* _region_bm; | |
1226 BitMap* _card_bm; | |
1227 intptr_t _bottom_card_num; | |
1228 bool _final; | |
1229 | |
1230 void mark_card_num_range(intptr_t start_card_num, intptr_t last_card_num) { | |
1231 for (intptr_t i = start_card_num; i <= last_card_num; i++) { | |
1232 #if CARD_BM_TEST_MODE | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
1233 guarantee(_card_bm->at(i - _bottom_card_num), "Should already be set."); |
342 | 1234 #else |
1235 _card_bm->par_at_put(i - _bottom_card_num, 1); | |
1236 #endif | |
1237 } | |
1238 } | |
1239 | |
1240 public: | |
1241 CalcLiveObjectsClosure(bool final, | |
1242 CMBitMapRO *bm, ConcurrentMark *cm, | |
936 | 1243 BitMap* region_bm, BitMap* card_bm) : |
342 | 1244 _bm(bm), _cm(cm), _changed(false), _yield(true), |
1245 _words_done(0), _tot_live(0), _tot_used(0), | |
936 | 1246 _region_bm(region_bm), _card_bm(card_bm),_final(final), |
342 | 1247 _regions_done(0), _start_vtime_sec(0.0) |
1248 { | |
1249 _bottom_card_num = | |
1250 intptr_t(uintptr_t(G1CollectedHeap::heap()->reserved_region().start()) >> | |
1251 CardTableModRefBS::card_shift); | |
1252 } | |
1253 | |
829 | 1254 // It takes a region that's not empty (i.e., it has at least one |
1255 // live object in it and sets its corresponding bit on the region | |
1256 // bitmap to 1. If the region is "starts humongous" it will also set | |
1257 // to 1 the bits on the region bitmap that correspond to its | |
1258 // associated "continues humongous" regions. | |
1259 void set_bit_for_region(HeapRegion* hr) { | |
1260 assert(!hr->continuesHumongous(), "should have filtered those out"); | |
1261 | |
1262 size_t index = hr->hrs_index(); | |
1263 if (!hr->startsHumongous()) { | |
1264 // Normal (non-humongous) case: just set the bit. | |
1265 _region_bm->par_at_put((BitMap::idx_t) index, true); | |
1266 } else { | |
1267 // Starts humongous case: calculate how many regions are part of | |
1268 // this humongous region and then set the bit range. It might | |
1269 // have been a bit more efficient to look at the object that | |
1270 // spans these humongous regions to calculate their number from | |
1271 // the object's size. However, it's a good idea to calculate | |
1272 // this based on the metadata itself, and not the region | |
1273 // contents, so that this code is not aware of what goes into | |
1274 // the humongous regions (in case this changes in the future). | |
1275 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
1276 size_t end_index = index + 1; | |
831 | 1277 while (end_index < g1h->n_regions()) { |
1278 HeapRegion* chr = g1h->region_at(end_index); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1279 if (!chr->continuesHumongous()) break; |
829 | 1280 end_index += 1; |
1281 } | |
1282 _region_bm->par_at_put_range((BitMap::idx_t) index, | |
1283 (BitMap::idx_t) end_index, true); | |
1284 } | |
1285 } | |
1286 | |
342 | 1287 bool doHeapRegion(HeapRegion* hr) { |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1288 if (!_final && _regions_done == 0) { |
342 | 1289 _start_vtime_sec = os::elapsedVTime(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1290 } |
342 | 1291 |
639 | 1292 if (hr->continuesHumongous()) { |
829 | 1293 // We will ignore these here and process them when their |
1294 // associated "starts humongous" region is processed (see | |
1295 // set_bit_for_heap_region()). Note that we cannot rely on their | |
1296 // associated "starts humongous" region to have their bit set to | |
1297 // 1 since, due to the region chunking in the parallel region | |
1298 // iteration, a "continues humongous" region might be visited | |
1299 // before its associated "starts humongous". | |
639 | 1300 return false; |
1301 } | |
342 | 1302 |
1303 HeapWord* nextTop = hr->next_top_at_mark_start(); | |
1304 HeapWord* start = hr->top_at_conc_mark_count(); | |
1305 assert(hr->bottom() <= start && start <= hr->end() && | |
1306 hr->bottom() <= nextTop && nextTop <= hr->end() && | |
1307 start <= nextTop, | |
1308 "Preconditions."); | |
1309 // Otherwise, record the number of word's we'll examine. | |
1310 size_t words_done = (nextTop - start); | |
1311 // Find the first marked object at or after "start". | |
1312 start = _bm->getNextMarkedWordAddress(start, nextTop); | |
1313 size_t marked_bytes = 0; | |
1314 | |
1315 // Below, the term "card num" means the result of shifting an address | |
1316 // by the card shift -- address 0 corresponds to card number 0. One | |
1317 // must subtract the card num of the bottom of the heap to obtain a | |
1318 // card table index. | |
1319 // The first card num of the sequence of live cards currently being | |
1320 // constructed. -1 ==> no sequence. | |
1321 intptr_t start_card_num = -1; | |
1322 // The last card num of the sequence of live cards currently being | |
1323 // constructed. -1 ==> no sequence. | |
1324 intptr_t last_card_num = -1; | |
1325 | |
1326 while (start < nextTop) { | |
1327 if (_yield && _cm->do_yield_check()) { | |
1328 // We yielded. It might be for a full collection, in which case | |
1329 // all bets are off; terminate the traversal. | |
1330 if (_cm->has_aborted()) { | |
1331 _changed = false; | |
1332 return true; | |
1333 } else { | |
1334 // Otherwise, it might be a collection pause, and the region | |
1335 // we're looking at might be in the collection set. We'll | |
1336 // abandon this region. | |
1337 return false; | |
1338 } | |
1339 } | |
1340 oop obj = oop(start); | |
1341 int obj_sz = obj->size(); | |
1342 // The card num of the start of the current object. | |
1343 intptr_t obj_card_num = | |
1344 intptr_t(uintptr_t(start) >> CardTableModRefBS::card_shift); | |
1345 | |
1346 HeapWord* obj_last = start + obj_sz - 1; | |
1347 intptr_t obj_last_card_num = | |
1348 intptr_t(uintptr_t(obj_last) >> CardTableModRefBS::card_shift); | |
1349 | |
1350 if (obj_card_num != last_card_num) { | |
1351 if (start_card_num == -1) { | |
1352 assert(last_card_num == -1, "Both or neither."); | |
1353 start_card_num = obj_card_num; | |
1354 } else { | |
1355 assert(last_card_num != -1, "Both or neither."); | |
1356 assert(obj_card_num >= last_card_num, "Inv"); | |
1357 if ((obj_card_num - last_card_num) > 1) { | |
1358 // Mark the last run, and start a new one. | |
1359 mark_card_num_range(start_card_num, last_card_num); | |
1360 start_card_num = obj_card_num; | |
1361 } | |
1362 } | |
1363 #if CARD_BM_TEST_MODE | |
1364 /* | |
1365 gclog_or_tty->print_cr("Setting bits from %d/%d.", | |
1366 obj_card_num - _bottom_card_num, | |
1367 obj_last_card_num - _bottom_card_num); | |
1368 */ | |
1369 for (intptr_t j = obj_card_num; j <= obj_last_card_num; j++) { | |
1370 _card_bm->par_at_put(j - _bottom_card_num, 1); | |
1371 } | |
1372 #endif | |
1373 } | |
1374 // In any case, we set the last card num. | |
1375 last_card_num = obj_last_card_num; | |
1376 | |
1030
dfdaf65c3423
6858886: G1: guarantee(_next_marked_bytes <= used(),"invariant") at heapRegion.hpp:359
apetrusenko
parents:
1023
diff
changeset
|
1377 marked_bytes += (size_t)obj_sz * HeapWordSize; |
342 | 1378 // Find the next marked object after this one. |
1379 start = _bm->getNextMarkedWordAddress(start + 1, nextTop); | |
1380 _changed = true; | |
1381 } | |
1382 // Handle the last range, if any. | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1383 if (start_card_num != -1) { |
342 | 1384 mark_card_num_range(start_card_num, last_card_num); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1385 } |
342 | 1386 if (_final) { |
1387 // Mark the allocated-since-marking portion... | |
1388 HeapWord* tp = hr->top(); | |
1389 if (nextTop < tp) { | |
1390 start_card_num = | |
1391 intptr_t(uintptr_t(nextTop) >> CardTableModRefBS::card_shift); | |
1392 last_card_num = | |
1393 intptr_t(uintptr_t(tp) >> CardTableModRefBS::card_shift); | |
1394 mark_card_num_range(start_card_num, last_card_num); | |
1395 // This definitely means the region has live objects. | |
829 | 1396 set_bit_for_region(hr); |
342 | 1397 } |
1398 } | |
1399 | |
1400 hr->add_to_marked_bytes(marked_bytes); | |
1401 // Update the live region bitmap. | |
1402 if (marked_bytes > 0) { | |
829 | 1403 set_bit_for_region(hr); |
342 | 1404 } |
1405 hr->set_top_at_conc_mark_count(nextTop); | |
1406 _tot_live += hr->next_live_bytes(); | |
1407 _tot_used += hr->used(); | |
1408 _words_done = words_done; | |
1409 | |
1410 if (!_final) { | |
1411 ++_regions_done; | |
1412 if (_regions_done % 10 == 0) { | |
1413 double end_vtime_sec = os::elapsedVTime(); | |
1414 double elapsed_vtime_sec = end_vtime_sec - _start_vtime_sec; | |
1415 if (elapsed_vtime_sec > (10.0 / 1000.0)) { | |
1416 jlong sleep_time_ms = | |
1417 (jlong) (elapsed_vtime_sec * _cm->cleanup_sleep_factor() * 1000.0); | |
1418 os::sleep(Thread::current(), sleep_time_ms, false); | |
1419 _start_vtime_sec = end_vtime_sec; | |
1420 } | |
1421 } | |
1422 } | |
1423 | |
1424 return false; | |
1425 } | |
1426 | |
1427 bool changed() { return _changed; } | |
1428 void reset() { _changed = false; _words_done = 0; } | |
1429 void no_yield() { _yield = false; } | |
1430 size_t words_done() { return _words_done; } | |
1431 size_t tot_live() { return _tot_live; } | |
1432 size_t tot_used() { return _tot_used; } | |
1433 }; | |
1434 | |
1435 | |
1436 void ConcurrentMark::calcDesiredRegions() { | |
1437 _region_bm.clear(); | |
1438 _card_bm.clear(); | |
1439 CalcLiveObjectsClosure calccl(false /*final*/, | |
1440 nextMarkBitMap(), this, | |
936 | 1441 &_region_bm, &_card_bm); |
342 | 1442 G1CollectedHeap *g1h = G1CollectedHeap::heap(); |
1443 g1h->heap_region_iterate(&calccl); | |
1444 | |
1445 do { | |
1446 calccl.reset(); | |
1447 g1h->heap_region_iterate(&calccl); | |
1448 } while (calccl.changed()); | |
1449 } | |
1450 | |
1451 class G1ParFinalCountTask: public AbstractGangTask { | |
1452 protected: | |
1453 G1CollectedHeap* _g1h; | |
1454 CMBitMap* _bm; | |
1455 size_t _n_workers; | |
1456 size_t *_live_bytes; | |
1457 size_t *_used_bytes; | |
1458 BitMap* _region_bm; | |
1459 BitMap* _card_bm; | |
1460 public: | |
1461 G1ParFinalCountTask(G1CollectedHeap* g1h, CMBitMap* bm, | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1462 BitMap* region_bm, BitMap* card_bm) |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1463 : AbstractGangTask("G1 final counting"), _g1h(g1h), |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1464 _bm(bm), _region_bm(region_bm), _card_bm(card_bm) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1465 if (ParallelGCThreads > 0) { |
342 | 1466 _n_workers = _g1h->workers()->total_workers(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1467 } else { |
342 | 1468 _n_workers = 1; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1469 } |
342 | 1470 _live_bytes = NEW_C_HEAP_ARRAY(size_t, _n_workers); |
1471 _used_bytes = NEW_C_HEAP_ARRAY(size_t, _n_workers); | |
1472 } | |
1473 | |
1474 ~G1ParFinalCountTask() { | |
1475 FREE_C_HEAP_ARRAY(size_t, _live_bytes); | |
1476 FREE_C_HEAP_ARRAY(size_t, _used_bytes); | |
1477 } | |
1478 | |
1479 void work(int i) { | |
1480 CalcLiveObjectsClosure calccl(true /*final*/, | |
1481 _bm, _g1h->concurrent_mark(), | |
936 | 1482 _region_bm, _card_bm); |
342 | 1483 calccl.no_yield(); |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
1484 if (G1CollectedHeap::use_parallel_gc_threads()) { |
355 | 1485 _g1h->heap_region_par_iterate_chunked(&calccl, i, |
1486 HeapRegion::FinalCountClaimValue); | |
342 | 1487 } else { |
1488 _g1h->heap_region_iterate(&calccl); | |
1489 } | |
1490 assert(calccl.complete(), "Shouldn't have yielded!"); | |
1491 | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
1492 assert((size_t) i < _n_workers, "invariant"); |
342 | 1493 _live_bytes[i] = calccl.tot_live(); |
1494 _used_bytes[i] = calccl.tot_used(); | |
1495 } | |
1496 size_t live_bytes() { | |
1497 size_t live_bytes = 0; | |
1498 for (size_t i = 0; i < _n_workers; ++i) | |
1499 live_bytes += _live_bytes[i]; | |
1500 return live_bytes; | |
1501 } | |
1502 size_t used_bytes() { | |
1503 size_t used_bytes = 0; | |
1504 for (size_t i = 0; i < _n_workers; ++i) | |
1505 used_bytes += _used_bytes[i]; | |
1506 return used_bytes; | |
1507 } | |
1508 }; | |
1509 | |
1510 class G1ParNoteEndTask; | |
1511 | |
1512 class G1NoteEndOfConcMarkClosure : public HeapRegionClosure { | |
1513 G1CollectedHeap* _g1; | |
1514 int _worker_num; | |
1515 size_t _max_live_bytes; | |
1516 size_t _regions_claimed; | |
1517 size_t _freed_bytes; | |
2173 | 1518 FreeRegionList* _local_cleanup_list; |
1519 HumongousRegionSet* _humongous_proxy_set; | |
1520 HRRSCleanupTask* _hrrs_cleanup_task; | |
342 | 1521 double _claimed_region_time; |
1522 double _max_region_time; | |
1523 | |
1524 public: | |
1525 G1NoteEndOfConcMarkClosure(G1CollectedHeap* g1, | |
2173 | 1526 int worker_num, |
1527 FreeRegionList* local_cleanup_list, | |
1528 HumongousRegionSet* humongous_proxy_set, | |
1529 HRRSCleanupTask* hrrs_cleanup_task); | |
342 | 1530 size_t freed_bytes() { return _freed_bytes; } |
1531 | |
1532 bool doHeapRegion(HeapRegion *r); | |
1533 | |
1534 size_t max_live_bytes() { return _max_live_bytes; } | |
1535 size_t regions_claimed() { return _regions_claimed; } | |
1536 double claimed_region_time_sec() { return _claimed_region_time; } | |
1537 double max_region_time_sec() { return _max_region_time; } | |
1538 }; | |
1539 | |
1540 class G1ParNoteEndTask: public AbstractGangTask { | |
1541 friend class G1NoteEndOfConcMarkClosure; | |
2152 | 1542 |
342 | 1543 protected: |
1544 G1CollectedHeap* _g1h; | |
1545 size_t _max_live_bytes; | |
1546 size_t _freed_bytes; | |
2152 | 1547 FreeRegionList* _cleanup_list; |
1548 | |
342 | 1549 public: |
1550 G1ParNoteEndTask(G1CollectedHeap* g1h, | |
2152 | 1551 FreeRegionList* cleanup_list) : |
342 | 1552 AbstractGangTask("G1 note end"), _g1h(g1h), |
2152 | 1553 _max_live_bytes(0), _freed_bytes(0), _cleanup_list(cleanup_list) { } |
342 | 1554 |
1555 void work(int i) { | |
1556 double start = os::elapsedTime(); | |
2173 | 1557 FreeRegionList local_cleanup_list("Local Cleanup List"); |
1558 HumongousRegionSet humongous_proxy_set("Local Cleanup Humongous Proxy Set"); | |
1559 HRRSCleanupTask hrrs_cleanup_task; | |
1560 G1NoteEndOfConcMarkClosure g1_note_end(_g1h, i, &local_cleanup_list, | |
1561 &humongous_proxy_set, | |
1562 &hrrs_cleanup_task); | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
1563 if (G1CollectedHeap::use_parallel_gc_threads()) { |
355 | 1564 _g1h->heap_region_par_iterate_chunked(&g1_note_end, i, |
1565 HeapRegion::NoteEndClaimValue); | |
342 | 1566 } else { |
1567 _g1h->heap_region_iterate(&g1_note_end); | |
1568 } | |
1569 assert(g1_note_end.complete(), "Shouldn't have yielded!"); | |
1570 | |
2152 | 1571 // Now update the lists |
1572 _g1h->update_sets_after_freeing_regions(g1_note_end.freed_bytes(), | |
1573 NULL /* free_list */, | |
2173 | 1574 &humongous_proxy_set, |
2152 | 1575 true /* par */); |
342 | 1576 { |
1577 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
1578 _max_live_bytes += g1_note_end.max_live_bytes(); | |
1579 _freed_bytes += g1_note_end.freed_bytes(); | |
2152 | 1580 |
3778
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1581 // If we iterate over the global cleanup list at the end of |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1582 // cleanup to do this printing we will not guarantee to only |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1583 // generate output for the newly-reclaimed regions (the list |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1584 // might not be empty at the beginning of cleanup; we might |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1585 // still be working on its previous contents). So we do the |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1586 // printing here, before we append the new regions to the global |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1587 // cleanup list. |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1588 |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1589 G1HRPrinter* hr_printer = _g1h->hr_printer(); |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1590 if (hr_printer->is_active()) { |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1591 HeapRegionLinkedListIterator iter(&local_cleanup_list); |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1592 while (iter.more_available()) { |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1593 HeapRegion* hr = iter.get_next(); |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1594 hr_printer->cleanup(hr); |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1595 } |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1596 } |
5f6f2615433a
7049999: G1: Make the G1PrintHeapRegions output consistent and complete
tonyp
parents:
3776
diff
changeset
|
1597 |
2173 | 1598 _cleanup_list->add_as_tail(&local_cleanup_list); |
1599 assert(local_cleanup_list.is_empty(), "post-condition"); | |
1600 | |
1601 HeapRegionRemSet::finish_cleanup_task(&hrrs_cleanup_task); | |
342 | 1602 } |
1603 double end = os::elapsedTime(); | |
1604 if (G1PrintParCleanupStats) { | |
1605 gclog_or_tty->print(" Worker thread %d [%8.3f..%8.3f = %8.3f ms] " | |
1606 "claimed %d regions (tot = %8.3f ms, max = %8.3f ms).\n", | |
1607 i, start, end, (end-start)*1000.0, | |
1608 g1_note_end.regions_claimed(), | |
1609 g1_note_end.claimed_region_time_sec()*1000.0, | |
1610 g1_note_end.max_region_time_sec()*1000.0); | |
1611 } | |
1612 } | |
1613 size_t max_live_bytes() { return _max_live_bytes; } | |
1614 size_t freed_bytes() { return _freed_bytes; } | |
1615 }; | |
1616 | |
1617 class G1ParScrubRemSetTask: public AbstractGangTask { | |
1618 protected: | |
1619 G1RemSet* _g1rs; | |
1620 BitMap* _region_bm; | |
1621 BitMap* _card_bm; | |
1622 public: | |
1623 G1ParScrubRemSetTask(G1CollectedHeap* g1h, | |
1624 BitMap* region_bm, BitMap* card_bm) : | |
1625 AbstractGangTask("G1 ScrubRS"), _g1rs(g1h->g1_rem_set()), | |
1626 _region_bm(region_bm), _card_bm(card_bm) | |
1627 {} | |
1628 | |
1629 void work(int i) { | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
1630 if (G1CollectedHeap::use_parallel_gc_threads()) { |
355 | 1631 _g1rs->scrub_par(_region_bm, _card_bm, i, |
1632 HeapRegion::ScrubRemSetClaimValue); | |
342 | 1633 } else { |
1634 _g1rs->scrub(_region_bm, _card_bm); | |
1635 } | |
1636 } | |
1637 | |
1638 }; | |
1639 | |
1640 G1NoteEndOfConcMarkClosure:: | |
1641 G1NoteEndOfConcMarkClosure(G1CollectedHeap* g1, | |
2173 | 1642 int worker_num, |
1643 FreeRegionList* local_cleanup_list, | |
1644 HumongousRegionSet* humongous_proxy_set, | |
1645 HRRSCleanupTask* hrrs_cleanup_task) | |
342 | 1646 : _g1(g1), _worker_num(worker_num), |
1647 _max_live_bytes(0), _regions_claimed(0), | |
2152 | 1648 _freed_bytes(0), |
342 | 1649 _claimed_region_time(0.0), _max_region_time(0.0), |
2173 | 1650 _local_cleanup_list(local_cleanup_list), |
1651 _humongous_proxy_set(humongous_proxy_set), | |
1652 _hrrs_cleanup_task(hrrs_cleanup_task) { } | |
2152 | 1653 |
1654 bool G1NoteEndOfConcMarkClosure::doHeapRegion(HeapRegion *hr) { | |
342 | 1655 // We use a claim value of zero here because all regions |
1656 // were claimed with value 1 in the FinalCount task. | |
2152 | 1657 hr->reset_gc_time_stamp(); |
1658 if (!hr->continuesHumongous()) { | |
342 | 1659 double start = os::elapsedTime(); |
1660 _regions_claimed++; | |
2152 | 1661 hr->note_end_of_marking(); |
1662 _max_live_bytes += hr->max_live_bytes(); | |
2173 | 1663 _g1->free_region_if_empty(hr, |
1664 &_freed_bytes, | |
1665 _local_cleanup_list, | |
1666 _humongous_proxy_set, | |
1667 _hrrs_cleanup_task, | |
1668 true /* par */); | |
342 | 1669 double region_time = (os::elapsedTime() - start); |
1670 _claimed_region_time += region_time; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1671 if (region_time > _max_region_time) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1672 _max_region_time = region_time; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1673 } |
342 | 1674 } |
1675 return false; | |
1676 } | |
1677 | |
1678 void ConcurrentMark::cleanup() { | |
1679 // world is stopped at this checkpoint | |
1680 assert(SafepointSynchronize::is_at_safepoint(), | |
1681 "world should be stopped"); | |
1682 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
1683 | |
1684 // If a full collection has happened, we shouldn't do this. | |
1685 if (has_aborted()) { | |
1686 g1h->set_marking_complete(); // So bitmap clearing isn't confused | |
1687 return; | |
1688 } | |
1689 | |
2152 | 1690 g1h->verify_region_sets_optional(); |
1691 | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1692 if (VerifyDuringGC) { |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1693 HandleMark hm; // handle scope |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1694 gclog_or_tty->print(" VerifyDuringGC:(before)"); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1695 Universe::heap()->prepare_for_verify(); |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1696 Universe::verify(/* allow dirty */ true, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1697 /* silent */ false, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1698 /* option */ VerifyOption_G1UsePrevMarking); |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1699 } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1700 |
342 | 1701 G1CollectorPolicy* g1p = G1CollectedHeap::heap()->g1_policy(); |
1702 g1p->record_concurrent_mark_cleanup_start(); | |
1703 | |
1704 double start = os::elapsedTime(); | |
1705 | |
2173 | 1706 HeapRegionRemSet::reset_for_cleanup_tasks(); |
1707 | |
342 | 1708 // Do counting once more with the world stopped for good measure. |
1709 G1ParFinalCountTask g1_par_count_task(g1h, nextMarkBitMap(), | |
1710 &_region_bm, &_card_bm); | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
1711 if (G1CollectedHeap::use_parallel_gc_threads()) { |
355 | 1712 assert(g1h->check_heap_region_claim_values( |
1713 HeapRegion::InitialClaimValue), | |
1714 "sanity check"); | |
1715 | |
342 | 1716 int n_workers = g1h->workers()->total_workers(); |
1717 g1h->set_par_threads(n_workers); | |
1718 g1h->workers()->run_task(&g1_par_count_task); | |
1719 g1h->set_par_threads(0); | |
355 | 1720 |
1721 assert(g1h->check_heap_region_claim_values( | |
1722 HeapRegion::FinalCountClaimValue), | |
1723 "sanity check"); | |
342 | 1724 } else { |
1725 g1_par_count_task.work(0); | |
1726 } | |
1727 | |
1728 size_t known_garbage_bytes = | |
1729 g1_par_count_task.used_bytes() - g1_par_count_task.live_bytes(); | |
1730 #if 0 | |
1731 gclog_or_tty->print_cr("used %1.2lf, live %1.2lf, garbage %1.2lf", | |
1732 (double) g1_par_count_task.used_bytes() / (double) (1024 * 1024), | |
1733 (double) g1_par_count_task.live_bytes() / (double) (1024 * 1024), | |
1734 (double) known_garbage_bytes / (double) (1024 * 1024)); | |
1735 #endif // 0 | |
1736 g1p->set_known_garbage_bytes(known_garbage_bytes); | |
1737 | |
1738 size_t start_used_bytes = g1h->used(); | |
1739 _at_least_one_mark_complete = true; | |
1740 g1h->set_marking_complete(); | |
1741 | |
1742 double count_end = os::elapsedTime(); | |
1743 double this_final_counting_time = (count_end - start); | |
1744 if (G1PrintParCleanupStats) { | |
1745 gclog_or_tty->print_cr("Cleanup:"); | |
1746 gclog_or_tty->print_cr(" Finalize counting: %8.3f ms", | |
1747 this_final_counting_time*1000.0); | |
1748 } | |
1749 _total_counting_time += this_final_counting_time; | |
1750 | |
2435
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
1751 if (G1PrintRegionLivenessInfo) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
1752 G1PrintRegionLivenessInfoClosure cl(gclog_or_tty, "Post-Marking"); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
1753 _g1h->heap_region_iterate(&cl); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
1754 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
1755 |
342 | 1756 // Install newly created mark bitMap as "prev". |
1757 swapMarkBitMaps(); | |
1758 | |
1759 g1h->reset_gc_time_stamp(); | |
1760 | |
1761 // Note end of marking in all heap regions. | |
1762 double note_end_start = os::elapsedTime(); | |
2152 | 1763 G1ParNoteEndTask g1_par_note_end_task(g1h, &_cleanup_list); |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
1764 if (G1CollectedHeap::use_parallel_gc_threads()) { |
342 | 1765 int n_workers = g1h->workers()->total_workers(); |
1766 g1h->set_par_threads(n_workers); | |
1767 g1h->workers()->run_task(&g1_par_note_end_task); | |
1768 g1h->set_par_threads(0); | |
355 | 1769 |
1770 assert(g1h->check_heap_region_claim_values(HeapRegion::NoteEndClaimValue), | |
1771 "sanity check"); | |
342 | 1772 } else { |
1773 g1_par_note_end_task.work(0); | |
1774 } | |
2152 | 1775 |
1776 if (!cleanup_list_is_empty()) { | |
1777 // The cleanup list is not empty, so we'll have to process it | |
1778 // concurrently. Notify anyone else that might be wanting free | |
1779 // regions that there will be more free regions coming soon. | |
1780 g1h->set_free_regions_coming(); | |
1781 } | |
342 | 1782 double note_end_end = os::elapsedTime(); |
1783 if (G1PrintParCleanupStats) { | |
1784 gclog_or_tty->print_cr(" note end of marking: %8.3f ms.", | |
1785 (note_end_end - note_end_start)*1000.0); | |
1786 } | |
1787 | |
355 | 1788 |
342 | 1789 // call below, since it affects the metric by which we sort the heap |
1790 // regions. | |
1791 if (G1ScrubRemSets) { | |
1792 double rs_scrub_start = os::elapsedTime(); | |
1793 G1ParScrubRemSetTask g1_par_scrub_rs_task(g1h, &_region_bm, &_card_bm); | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
1794 if (G1CollectedHeap::use_parallel_gc_threads()) { |
342 | 1795 int n_workers = g1h->workers()->total_workers(); |
1796 g1h->set_par_threads(n_workers); | |
1797 g1h->workers()->run_task(&g1_par_scrub_rs_task); | |
1798 g1h->set_par_threads(0); | |
355 | 1799 |
1800 assert(g1h->check_heap_region_claim_values( | |
1801 HeapRegion::ScrubRemSetClaimValue), | |
1802 "sanity check"); | |
342 | 1803 } else { |
1804 g1_par_scrub_rs_task.work(0); | |
1805 } | |
1806 | |
1807 double rs_scrub_end = os::elapsedTime(); | |
1808 double this_rs_scrub_time = (rs_scrub_end - rs_scrub_start); | |
1809 _total_rs_scrub_time += this_rs_scrub_time; | |
1810 } | |
1811 | |
1812 // this will also free any regions totally full of garbage objects, | |
1813 // and sort the regions. | |
1814 g1h->g1_policy()->record_concurrent_mark_cleanup_end( | |
1815 g1_par_note_end_task.freed_bytes(), | |
1816 g1_par_note_end_task.max_live_bytes()); | |
1817 | |
1818 // Statistics. | |
1819 double end = os::elapsedTime(); | |
1820 _cleanup_times.add((end - start) * 1000.0); | |
1821 | |
1822 // G1CollectedHeap::heap()->print(); | |
1823 // gclog_or_tty->print_cr("HEAP GC TIME STAMP : %d", | |
1824 // G1CollectedHeap::heap()->get_gc_time_stamp()); | |
1825 | |
1826 if (PrintGC || PrintGCDetails) { | |
1827 g1h->print_size_transition(gclog_or_tty, | |
1828 start_used_bytes, | |
1829 g1h->used(), | |
1830 g1h->capacity()); | |
1831 } | |
1832 | |
1833 size_t cleaned_up_bytes = start_used_bytes - g1h->used(); | |
1834 g1p->decrease_known_garbage_bytes(cleaned_up_bytes); | |
1835 | |
1836 // We need to make this be a "collection" so any collection pause that | |
1837 // races with it goes around and waits for completeCleanup to finish. | |
1838 g1h->increment_total_collections(); | |
1839 | |
751 | 1840 if (VerifyDuringGC) { |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1841 HandleMark hm; // handle scope |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1842 gclog_or_tty->print(" VerifyDuringGC:(after)"); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1843 Universe::heap()->prepare_for_verify(); |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1844 Universe::verify(/* allow dirty */ true, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1845 /* silent */ false, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
1846 /* option */ VerifyOption_G1UsePrevMarking); |
342 | 1847 } |
2152 | 1848 |
1849 g1h->verify_region_sets_optional(); | |
342 | 1850 } |
1851 | |
1852 void ConcurrentMark::completeCleanup() { | |
1853 if (has_aborted()) return; | |
1854 | |
2152 | 1855 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
1856 | |
1857 _cleanup_list.verify_optional(); | |
2361 | 1858 FreeRegionList tmp_free_list("Tmp Free List"); |
2152 | 1859 |
1860 if (G1ConcRegionFreeingVerbose) { | |
1861 gclog_or_tty->print_cr("G1ConcRegionFreeing [complete cleanup] : " | |
1862 "cleanup list has "SIZE_FORMAT" entries", | |
1863 _cleanup_list.length()); | |
1864 } | |
1865 | |
1866 // Noone else should be accessing the _cleanup_list at this point, | |
1867 // so it's not necessary to take any locks | |
1868 while (!_cleanup_list.is_empty()) { | |
1869 HeapRegion* hr = _cleanup_list.remove_head(); | |
1870 assert(hr != NULL, "the list was not empty"); | |
3317
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
3316
diff
changeset
|
1871 hr->par_clear(); |
2361 | 1872 tmp_free_list.add_as_tail(hr); |
2152 | 1873 |
1874 // Instead of adding one region at a time to the secondary_free_list, | |
1875 // we accumulate them in the local list and move them a few at a | |
1876 // time. This also cuts down on the number of notify_all() calls | |
1877 // we do during this process. We'll also append the local list when | |
1878 // _cleanup_list is empty (which means we just removed the last | |
1879 // region from the _cleanup_list). | |
2361 | 1880 if ((tmp_free_list.length() % G1SecondaryFreeListAppendLength == 0) || |
2152 | 1881 _cleanup_list.is_empty()) { |
1882 if (G1ConcRegionFreeingVerbose) { | |
1883 gclog_or_tty->print_cr("G1ConcRegionFreeing [complete cleanup] : " | |
1884 "appending "SIZE_FORMAT" entries to the " | |
1885 "secondary_free_list, clean list still has " | |
1886 SIZE_FORMAT" entries", | |
2361 | 1887 tmp_free_list.length(), |
2152 | 1888 _cleanup_list.length()); |
342 | 1889 } |
2152 | 1890 |
1891 { | |
1892 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag); | |
2361 | 1893 g1h->secondary_free_list_add_as_tail(&tmp_free_list); |
2152 | 1894 SecondaryFreeList_lock->notify_all(); |
1895 } | |
1896 | |
1897 if (G1StressConcRegionFreeing) { | |
1898 for (uintx i = 0; i < G1StressConcRegionFreeingDelayMillis; ++i) { | |
1899 os::sleep(Thread::current(), (jlong) 1, false); | |
1900 } | |
1901 } | |
342 | 1902 } |
1903 } | |
2361 | 1904 assert(tmp_free_list.is_empty(), "post-condition"); |
342 | 1905 } |
1906 | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1907 // Support closures for reference procssing in G1 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1908 |
2037
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
1909 bool G1CMIsAliveClosure::do_object_b(oop obj) { |
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
1910 HeapWord* addr = (HeapWord*)obj; |
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
1911 return addr != NULL && |
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
1912 (!_g1->is_in_g1_reserved(addr) || !_g1->is_obj_ill(obj)); |
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
1913 } |
342 | 1914 |
1915 class G1CMKeepAliveClosure: public OopClosure { | |
1916 G1CollectedHeap* _g1; | |
1917 ConcurrentMark* _cm; | |
1918 CMBitMap* _bitMap; | |
1919 public: | |
1920 G1CMKeepAliveClosure(G1CollectedHeap* g1, ConcurrentMark* cm, | |
1921 CMBitMap* bitMap) : | |
1922 _g1(g1), _cm(cm), | |
1923 _bitMap(bitMap) {} | |
1924 | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1925 virtual void do_oop(narrowOop* p) { do_oop_work(p); } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1926 virtual void do_oop( oop* p) { do_oop_work(p); } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1927 |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
1928 template <class T> void do_oop_work(T* p) { |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1929 oop obj = oopDesc::load_decode_heap_oop(p); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1930 HeapWord* addr = (HeapWord*)obj; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1931 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1932 if (_cm->verbose_high()) { |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1933 gclog_or_tty->print_cr("\t[0] we're looking at location " |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1934 "*"PTR_FORMAT" = "PTR_FORMAT, |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1935 p, (void*) obj); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1936 } |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1937 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1938 if (_g1->is_in_g1_reserved(addr) && _g1->is_obj_ill(obj)) { |
342 | 1939 _bitMap->mark(addr); |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1940 _cm->mark_stack_push(obj); |
342 | 1941 } |
1942 } | |
1943 }; | |
1944 | |
1945 class G1CMDrainMarkingStackClosure: public VoidClosure { | |
1946 CMMarkStack* _markStack; | |
1947 CMBitMap* _bitMap; | |
1948 G1CMKeepAliveClosure* _oopClosure; | |
1949 public: | |
1950 G1CMDrainMarkingStackClosure(CMBitMap* bitMap, CMMarkStack* markStack, | |
1951 G1CMKeepAliveClosure* oopClosure) : | |
1952 _bitMap(bitMap), | |
1953 _markStack(markStack), | |
1954 _oopClosure(oopClosure) | |
1955 {} | |
1956 | |
1957 void do_void() { | |
1958 _markStack->drain((OopClosure*)_oopClosure, _bitMap, false); | |
1959 } | |
1960 }; | |
1961 | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1962 // 'Keep Alive' closure used by parallel reference processing. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1963 // An instance of this closure is used in the parallel reference processing |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1964 // code rather than an instance of G1CMKeepAliveClosure. We could have used |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1965 // the G1CMKeepAliveClosure as it is MT-safe. Also reference objects are |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1966 // placed on to discovered ref lists once so we can mark and push with no |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1967 // need to check whether the object has already been marked. Using the |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1968 // G1CMKeepAliveClosure would mean, however, having all the worker threads |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1969 // operating on the global mark stack. This means that an individual |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1970 // worker would be doing lock-free pushes while it processes its own |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1971 // discovered ref list followed by drain call. If the discovered ref lists |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1972 // are unbalanced then this could cause interference with the other |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1973 // workers. Using a CMTask (and its embedded local data structures) |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1974 // avoids that potential interference. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1975 class G1CMParKeepAliveAndDrainClosure: public OopClosure { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1976 ConcurrentMark* _cm; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1977 CMTask* _task; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1978 CMBitMap* _bitMap; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1979 int _ref_counter_limit; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1980 int _ref_counter; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1981 public: |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1982 G1CMParKeepAliveAndDrainClosure(ConcurrentMark* cm, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1983 CMTask* task, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1984 CMBitMap* bitMap) : |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1985 _cm(cm), _task(task), _bitMap(bitMap), |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1986 _ref_counter_limit(G1RefProcDrainInterval) |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1987 { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1988 assert(_ref_counter_limit > 0, "sanity"); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1989 _ref_counter = _ref_counter_limit; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1990 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1991 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1992 virtual void do_oop(narrowOop* p) { do_oop_work(p); } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1993 virtual void do_oop( oop* p) { do_oop_work(p); } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1994 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1995 template <class T> void do_oop_work(T* p) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1996 if (!_cm->has_overflown()) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1997 oop obj = oopDesc::load_decode_heap_oop(p); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
1998 if (_cm->verbose_high()) { |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
1999 gclog_or_tty->print_cr("\t[%d] we're looking at location " |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2000 "*"PTR_FORMAT" = "PTR_FORMAT, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2001 _task->task_id(), p, (void*) obj); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2002 } |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2003 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2004 _task->deal_with_reference(obj); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2005 _ref_counter--; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2006 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2007 if (_ref_counter == 0) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2008 // We have dealt with _ref_counter_limit references, pushing them and objects |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2009 // reachable from them on to the local stack (and possibly the global stack). |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2010 // Call do_marking_step() to process these entries. We call the routine in a |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2011 // loop, which we'll exit if there's nothing more to do (i.e. we're done |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2012 // with the entries that we've pushed as a result of the deal_with_reference |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2013 // calls above) or we overflow. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2014 // Note: CMTask::do_marking_step() can set the CMTask::has_aborted() flag |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2015 // while there may still be some work to do. (See the comment at the |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2016 // beginning of CMTask::do_marking_step() for those conditions - one of which |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2017 // is reaching the specified time target.) It is only when |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2018 // CMTask::do_marking_step() returns without setting the has_aborted() flag |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2019 // that the marking has completed. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2020 do { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2021 double mark_step_duration_ms = G1ConcMarkStepDurationMillis; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2022 _task->do_marking_step(mark_step_duration_ms, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2023 false /* do_stealing */, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2024 false /* do_termination */); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2025 } while (_task->has_aborted() && !_cm->has_overflown()); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2026 _ref_counter = _ref_counter_limit; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2027 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2028 } else { |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2029 if (_cm->verbose_high()) { |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2030 gclog_or_tty->print_cr("\t[%d] CM Overflow", _task->task_id()); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2031 } |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2032 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2033 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2034 }; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2035 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2036 class G1CMParDrainMarkingStackClosure: public VoidClosure { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2037 ConcurrentMark* _cm; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2038 CMTask* _task; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2039 public: |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2040 G1CMParDrainMarkingStackClosure(ConcurrentMark* cm, CMTask* task) : |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2041 _cm(cm), _task(task) |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2042 {} |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2043 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2044 void do_void() { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2045 do { |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2046 if (_cm->verbose_high()) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2047 gclog_or_tty->print_cr("\t[%d] Drain: Calling do marking_step", |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2048 _task->task_id()); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2049 } |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2050 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2051 // We call CMTask::do_marking_step() to completely drain the local and |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2052 // global marking stacks. The routine is called in a loop, which we'll |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2053 // exit if there's nothing more to do (i.e. we'completely drained the |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2054 // entries that were pushed as a result of applying the |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2055 // G1CMParKeepAliveAndDrainClosure to the entries on the discovered ref |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2056 // lists above) or we overflow the global marking stack. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2057 // Note: CMTask::do_marking_step() can set the CMTask::has_aborted() flag |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2058 // while there may still be some work to do. (See the comment at the |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2059 // beginning of CMTask::do_marking_step() for those conditions - one of which |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2060 // is reaching the specified time target.) It is only when |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2061 // CMTask::do_marking_step() returns without setting the has_aborted() flag |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2062 // that the marking has completed. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2063 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2064 _task->do_marking_step(1000000000.0 /* something very large */, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2065 true /* do_stealing */, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2066 true /* do_termination */); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2067 } while (_task->has_aborted() && !_cm->has_overflown()); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2068 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2069 }; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2070 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2071 // Implementation of AbstractRefProcTaskExecutor for G1 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2072 class G1RefProcTaskExecutor: public AbstractRefProcTaskExecutor { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2073 private: |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2074 G1CollectedHeap* _g1h; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2075 ConcurrentMark* _cm; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2076 CMBitMap* _bitmap; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2077 WorkGang* _workers; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2078 int _active_workers; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2079 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2080 public: |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2081 G1RefProcTaskExecutor(G1CollectedHeap* g1h, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2082 ConcurrentMark* cm, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2083 CMBitMap* bitmap, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2084 WorkGang* workers, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2085 int n_workers) : |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2086 _g1h(g1h), _cm(cm), _bitmap(bitmap), |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2087 _workers(workers), _active_workers(n_workers) |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2088 { } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2089 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2090 // Executes the given task using concurrent marking worker threads. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2091 virtual void execute(ProcessTask& task); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2092 virtual void execute(EnqueueTask& task); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2093 }; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2094 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2095 class G1RefProcTaskProxy: public AbstractGangTask { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2096 typedef AbstractRefProcTaskExecutor::ProcessTask ProcessTask; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2097 ProcessTask& _proc_task; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2098 G1CollectedHeap* _g1h; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2099 ConcurrentMark* _cm; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2100 CMBitMap* _bitmap; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2101 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2102 public: |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2103 G1RefProcTaskProxy(ProcessTask& proc_task, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2104 G1CollectedHeap* g1h, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2105 ConcurrentMark* cm, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2106 CMBitMap* bitmap) : |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2107 AbstractGangTask("Process reference objects in parallel"), |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2108 _proc_task(proc_task), _g1h(g1h), _cm(cm), _bitmap(bitmap) |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2109 {} |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2110 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2111 virtual void work(int i) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2112 CMTask* marking_task = _cm->task(i); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2113 G1CMIsAliveClosure g1_is_alive(_g1h); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2114 G1CMParKeepAliveAndDrainClosure g1_par_keep_alive(_cm, marking_task, _bitmap); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2115 G1CMParDrainMarkingStackClosure g1_par_drain(_cm, marking_task); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2116 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2117 _proc_task.work(i, g1_is_alive, g1_par_keep_alive, g1_par_drain); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2118 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2119 }; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2120 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2121 void G1RefProcTaskExecutor::execute(ProcessTask& proc_task) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2122 assert(_workers != NULL, "Need parallel worker threads."); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2123 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2124 G1RefProcTaskProxy proc_task_proxy(proc_task, _g1h, _cm, _bitmap); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2125 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2126 // We need to reset the phase for each task execution so that |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2127 // the termination protocol of CMTask::do_marking_step works. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2128 _cm->set_phase(_active_workers, false /* concurrent */); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2129 _g1h->set_par_threads(_active_workers); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2130 _workers->run_task(&proc_task_proxy); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2131 _g1h->set_par_threads(0); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2132 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2133 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2134 class G1RefEnqueueTaskProxy: public AbstractGangTask { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2135 typedef AbstractRefProcTaskExecutor::EnqueueTask EnqueueTask; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2136 EnqueueTask& _enq_task; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2137 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2138 public: |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2139 G1RefEnqueueTaskProxy(EnqueueTask& enq_task) : |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2140 AbstractGangTask("Enqueue reference objects in parallel"), |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2141 _enq_task(enq_task) |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2142 { } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2143 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2144 virtual void work(int i) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2145 _enq_task.work(i); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2146 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2147 }; |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2148 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2149 void G1RefProcTaskExecutor::execute(EnqueueTask& enq_task) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2150 assert(_workers != NULL, "Need parallel worker threads."); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2151 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2152 G1RefEnqueueTaskProxy enq_task_proxy(enq_task); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2153 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2154 _g1h->set_par_threads(_active_workers); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2155 _workers->run_task(&enq_task_proxy); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2156 _g1h->set_par_threads(0); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2157 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2158 |
342 | 2159 void ConcurrentMark::weakRefsWork(bool clear_all_soft_refs) { |
2160 ResourceMark rm; | |
2161 HandleMark hm; | |
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
355
diff
changeset
|
2162 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
355
diff
changeset
|
2163 ReferenceProcessor* rp = g1h->ref_processor(); |
342 | 2164 |
1974
fd1d227ef1b9
6983204: G1: Nightly test nsk/regression/b4958615 failing with +ExplicitGCInvokesConcurrent
johnc
parents:
1972
diff
changeset
|
2165 // See the comment in G1CollectedHeap::ref_processing_init() |
fd1d227ef1b9
6983204: G1: Nightly test nsk/regression/b4958615 failing with +ExplicitGCInvokesConcurrent
johnc
parents:
1972
diff
changeset
|
2166 // about how reference processing currently works in G1. |
fd1d227ef1b9
6983204: G1: Nightly test nsk/regression/b4958615 failing with +ExplicitGCInvokesConcurrent
johnc
parents:
1972
diff
changeset
|
2167 |
342 | 2168 // Process weak references. |
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
2169 rp->setup_policy(clear_all_soft_refs); |
342 | 2170 assert(_markStack.isEmpty(), "mark stack should be empty"); |
2171 | |
2037
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
2172 G1CMIsAliveClosure g1_is_alive(g1h); |
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
2173 G1CMKeepAliveClosure g1_keep_alive(g1h, this, nextMarkBitMap()); |
342 | 2174 G1CMDrainMarkingStackClosure |
2037
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
2175 g1_drain_mark_stack(nextMarkBitMap(), &_markStack, &g1_keep_alive); |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2176 // We use the work gang from the G1CollectedHeap and we utilize all |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2177 // the worker threads. |
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2361
diff
changeset
|
2178 int active_workers = g1h->workers() ? g1h->workers()->total_workers() : 1; |
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2361
diff
changeset
|
2179 active_workers = MAX2(MIN2(active_workers, (int)_max_task_num), 1); |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2180 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2181 G1RefProcTaskExecutor par_task_executor(g1h, this, nextMarkBitMap(), |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2182 g1h->workers(), active_workers); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2183 |
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2361
diff
changeset
|
2184 |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2185 if (rp->processing_is_mt()) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2186 // Set the degree of MT here. If the discovery is done MT, there |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2187 // may have been a different number of threads doing the discovery |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2188 // and a different number of discovered lists may have Ref objects. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2189 // That is OK as long as the Reference lists are balanced (see |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2190 // balance_all_queues() and balance_queues()). |
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2361
diff
changeset
|
2191 rp->set_active_mt_degree(active_workers); |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2192 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2193 rp->process_discovered_references(&g1_is_alive, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2194 &g1_keep_alive, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2195 &g1_drain_mark_stack, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2196 &par_task_executor); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2197 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2198 // The work routines of the parallel keep_alive and drain_marking_stack |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2199 // will set the has_overflown flag if we overflow the global marking |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2200 // stack. |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2201 } else { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2202 rp->process_discovered_references(&g1_is_alive, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2203 &g1_keep_alive, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2204 &g1_drain_mark_stack, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2205 NULL); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2206 |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2207 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2208 |
342 | 2209 assert(_markStack.overflow() || _markStack.isEmpty(), |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2210 "mark stack should be empty (unless it overflowed)"); |
342 | 2211 if (_markStack.overflow()) { |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2212 // Should have been done already when we tried to push an |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2213 // entry on to the global mark stack. But let's do it again. |
342 | 2214 set_has_overflown(); |
2215 } | |
2216 | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2217 if (rp->processing_is_mt()) { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2218 assert(rp->num_q() == active_workers, "why not"); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2219 rp->enqueue_discovered_references(&par_task_executor); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2220 } else { |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2221 rp->enqueue_discovered_references(); |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2222 } |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2223 |
342 | 2224 rp->verify_no_references_recorded(); |
2225 assert(!rp->discovery_enabled(), "should have been disabled"); | |
2226 | |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2175
diff
changeset
|
2227 // Now clean up stale oops in StringTable |
2037
b03260081e9b
7006113: G1: Initialize ReferenceProcessor::_is_alive_non_header field
johnc
parents:
1974
diff
changeset
|
2228 StringTable::unlink(&g1_is_alive); |
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2175
diff
changeset
|
2229 // Clean up unreferenced symbols in symbol table. |
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2175
diff
changeset
|
2230 SymbolTable::unlink(); |
342 | 2231 } |
2232 | |
2233 void ConcurrentMark::swapMarkBitMaps() { | |
2234 CMBitMapRO* temp = _prevMarkBitMap; | |
2235 _prevMarkBitMap = (CMBitMapRO*)_nextMarkBitMap; | |
2236 _nextMarkBitMap = (CMBitMap*) temp; | |
2237 } | |
2238 | |
2239 class CMRemarkTask: public AbstractGangTask { | |
2240 private: | |
2241 ConcurrentMark *_cm; | |
2242 | |
2243 public: | |
2244 void work(int worker_i) { | |
2245 // Since all available tasks are actually started, we should | |
2246 // only proceed if we're supposed to be actived. | |
2247 if ((size_t)worker_i < _cm->active_tasks()) { | |
2248 CMTask* task = _cm->task(worker_i); | |
2249 task->record_start_time(); | |
2250 do { | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2251 task->do_marking_step(1000000000.0 /* something very large */, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2252 true /* do_stealing */, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2253 true /* do_termination */); |
342 | 2254 } while (task->has_aborted() && !_cm->has_overflown()); |
2255 // If we overflow, then we do not want to restart. We instead | |
2256 // want to abort remark and do concurrent marking again. | |
2257 task->record_end_time(); | |
2258 } | |
2259 } | |
2260 | |
2261 CMRemarkTask(ConcurrentMark* cm) : | |
2262 AbstractGangTask("Par Remark"), _cm(cm) { } | |
2263 }; | |
2264 | |
2265 void ConcurrentMark::checkpointRootsFinalWork() { | |
2266 ResourceMark rm; | |
2267 HandleMark hm; | |
2268 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
2269 | |
2270 g1h->ensure_parsability(false); | |
2271 | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
2272 if (G1CollectedHeap::use_parallel_gc_threads()) { |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
912
diff
changeset
|
2273 G1CollectedHeap::StrongRootsScope srs(g1h); |
342 | 2274 // this is remark, so we'll use up all available threads |
2275 int active_workers = ParallelGCThreads; | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2276 set_phase(active_workers, false /* concurrent */); |
342 | 2277 |
2278 CMRemarkTask remarkTask(this); | |
2279 // We will start all available threads, even if we decide that the | |
2280 // active_workers will be fewer. The extra ones will just bail out | |
2281 // immediately. | |
2282 int n_workers = g1h->workers()->total_workers(); | |
2283 g1h->set_par_threads(n_workers); | |
2284 g1h->workers()->run_task(&remarkTask); | |
2285 g1h->set_par_threads(0); | |
2286 } else { | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
912
diff
changeset
|
2287 G1CollectedHeap::StrongRootsScope srs(g1h); |
342 | 2288 // this is remark, so we'll use up all available threads |
2289 int active_workers = 1; | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
2290 set_phase(active_workers, false /* concurrent */); |
342 | 2291 |
2292 CMRemarkTask remarkTask(this); | |
2293 // We will start all available threads, even if we decide that the | |
2294 // active_workers will be fewer. The extra ones will just bail out | |
2295 // immediately. | |
2296 remarkTask.work(0); | |
2297 } | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2298 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2299 guarantee(satb_mq_set.completed_buffers_num() == 0, "invariant"); |
342 | 2300 |
2301 print_stats(); | |
2302 | |
2303 #if VERIFY_OBJS_PROCESSED | |
2304 if (_scan_obj_cl.objs_processed != ThreadLocalObjQueue::objs_enqueued) { | |
2305 gclog_or_tty->print_cr("Processed = %d, enqueued = %d.", | |
2306 _scan_obj_cl.objs_processed, | |
2307 ThreadLocalObjQueue::objs_enqueued); | |
2308 guarantee(_scan_obj_cl.objs_processed == | |
2309 ThreadLocalObjQueue::objs_enqueued, | |
2310 "Different number of objs processed and enqueued."); | |
2311 } | |
2312 #endif | |
2313 } | |
2314 | |
1044 | 2315 #ifndef PRODUCT |
2316 | |
1388 | 2317 class PrintReachableOopClosure: public OopClosure { |
342 | 2318 private: |
2319 G1CollectedHeap* _g1h; | |
2320 outputStream* _out; | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2321 VerifyOption _vo; |
1388 | 2322 bool _all; |
342 | 2323 |
2324 public: | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2325 PrintReachableOopClosure(outputStream* out, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2326 VerifyOption vo, |
1388 | 2327 bool all) : |
1044 | 2328 _g1h(G1CollectedHeap::heap()), |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2329 _out(out), _vo(vo), _all(all) { } |
342 | 2330 |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2331 void do_oop(narrowOop* p) { do_oop_work(p); } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2332 void do_oop( oop* p) { do_oop_work(p); } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2333 |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2334 template <class T> void do_oop_work(T* p) { |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2335 oop obj = oopDesc::load_decode_heap_oop(p); |
342 | 2336 const char* str = NULL; |
2337 const char* str2 = ""; | |
2338 | |
1388 | 2339 if (obj == NULL) { |
2340 str = ""; | |
2341 } else if (!_g1h->is_in_g1_reserved(obj)) { | |
2342 str = " O"; | |
2343 } else { | |
342 | 2344 HeapRegion* hr = _g1h->heap_region_containing(obj); |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2345 guarantee(hr != NULL, "invariant"); |
1044 | 2346 bool over_tams = false; |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2347 bool marked = false; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2348 |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2349 switch (_vo) { |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2350 case VerifyOption_G1UsePrevMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2351 over_tams = hr->obj_allocated_since_prev_marking(obj); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2352 marked = _g1h->isMarkedPrev(obj); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2353 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2354 case VerifyOption_G1UseNextMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2355 over_tams = hr->obj_allocated_since_next_marking(obj); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2356 marked = _g1h->isMarkedNext(obj); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2357 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2358 case VerifyOption_G1UseMarkWord: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2359 marked = obj->is_gc_marked(); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2360 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2361 default: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2362 ShouldNotReachHere(); |
1044 | 2363 } |
2364 | |
2365 if (over_tams) { | |
1388 | 2366 str = " >"; |
2367 if (marked) { | |
342 | 2368 str2 = " AND MARKED"; |
1044 | 2369 } |
1388 | 2370 } else if (marked) { |
2371 str = " M"; | |
1044 | 2372 } else { |
1388 | 2373 str = " NOT"; |
1044 | 2374 } |
342 | 2375 } |
2376 | |
1388 | 2377 _out->print_cr(" "PTR_FORMAT": "PTR_FORMAT"%s%s", |
342 | 2378 p, (void*) obj, str, str2); |
2379 } | |
2380 }; | |
2381 | |
1388 | 2382 class PrintReachableObjectClosure : public ObjectClosure { |
342 | 2383 private: |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2384 G1CollectedHeap* _g1h; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2385 outputStream* _out; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2386 VerifyOption _vo; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2387 bool _all; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2388 HeapRegion* _hr; |
342 | 2389 |
2390 public: | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2391 PrintReachableObjectClosure(outputStream* out, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2392 VerifyOption vo, |
1388 | 2393 bool all, |
2394 HeapRegion* hr) : | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2395 _g1h(G1CollectedHeap::heap()), |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2396 _out(out), _vo(vo), _all(all), _hr(hr) { } |
1388 | 2397 |
2398 void do_object(oop o) { | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2399 bool over_tams = false; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2400 bool marked = false; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2401 |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2402 switch (_vo) { |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2403 case VerifyOption_G1UsePrevMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2404 over_tams = _hr->obj_allocated_since_prev_marking(o); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2405 marked = _g1h->isMarkedPrev(o); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2406 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2407 case VerifyOption_G1UseNextMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2408 over_tams = _hr->obj_allocated_since_next_marking(o); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2409 marked = _g1h->isMarkedNext(o); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2410 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2411 case VerifyOption_G1UseMarkWord: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2412 marked = o->is_gc_marked(); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2413 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2414 default: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2415 ShouldNotReachHere(); |
1388 | 2416 } |
2417 bool print_it = _all || over_tams || marked; | |
2418 | |
2419 if (print_it) { | |
2420 _out->print_cr(" "PTR_FORMAT"%s", | |
2421 o, (over_tams) ? " >" : (marked) ? " M" : ""); | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2422 PrintReachableOopClosure oopCl(_out, _vo, _all); |
1388 | 2423 o->oop_iterate(&oopCl); |
2424 } | |
342 | 2425 } |
2426 }; | |
2427 | |
1388 | 2428 class PrintReachableRegionClosure : public HeapRegionClosure { |
342 | 2429 private: |
2430 outputStream* _out; | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2431 VerifyOption _vo; |
1388 | 2432 bool _all; |
342 | 2433 |
2434 public: | |
2435 bool doHeapRegion(HeapRegion* hr) { | |
2436 HeapWord* b = hr->bottom(); | |
2437 HeapWord* e = hr->end(); | |
2438 HeapWord* t = hr->top(); | |
1044 | 2439 HeapWord* p = NULL; |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2440 |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2441 switch (_vo) { |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2442 case VerifyOption_G1UsePrevMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2443 p = hr->prev_top_at_mark_start(); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2444 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2445 case VerifyOption_G1UseNextMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2446 p = hr->next_top_at_mark_start(); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2447 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2448 case VerifyOption_G1UseMarkWord: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2449 // When we are verifying marking using the mark word |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2450 // TAMS has no relevance. |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2451 assert(p == NULL, "post-condition"); |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2452 break; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2453 default: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2454 ShouldNotReachHere(); |
1044 | 2455 } |
342 | 2456 _out->print_cr("** ["PTR_FORMAT", "PTR_FORMAT"] top: "PTR_FORMAT" " |
1044 | 2457 "TAMS: "PTR_FORMAT, b, e, t, p); |
1388 | 2458 _out->cr(); |
2459 | |
2460 HeapWord* from = b; | |
2461 HeapWord* to = t; | |
2462 | |
2463 if (to > from) { | |
2464 _out->print_cr("Objects in ["PTR_FORMAT", "PTR_FORMAT"]", from, to); | |
2465 _out->cr(); | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2466 PrintReachableObjectClosure ocl(_out, _vo, _all, hr); |
1388 | 2467 hr->object_iterate_mem_careful(MemRegion(from, to), &ocl); |
2468 _out->cr(); | |
2469 } | |
342 | 2470 |
2471 return false; | |
2472 } | |
2473 | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2474 PrintReachableRegionClosure(outputStream* out, |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2475 VerifyOption vo, |
1388 | 2476 bool all) : |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2477 _out(out), _vo(vo), _all(all) { } |
342 | 2478 }; |
2479 | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2480 static const char* verify_option_to_tams(VerifyOption vo) { |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2481 switch (vo) { |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2482 case VerifyOption_G1UsePrevMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2483 return "PTAMS"; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2484 case VerifyOption_G1UseNextMarking: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2485 return "NTAMS"; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2486 default: |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2487 return "NONE"; |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2488 } |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2489 } |
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2490 |
1388 | 2491 void ConcurrentMark::print_reachable(const char* str, |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2492 VerifyOption vo, |
1388 | 2493 bool all) { |
2494 gclog_or_tty->cr(); | |
2495 gclog_or_tty->print_cr("== Doing heap dump... "); | |
1044 | 2496 |
2497 if (G1PrintReachableBaseFile == NULL) { | |
2498 gclog_or_tty->print_cr(" #### error: no base file defined"); | |
2499 return; | |
2500 } | |
2501 | |
2502 if (strlen(G1PrintReachableBaseFile) + 1 + strlen(str) > | |
2503 (JVM_MAXPATHLEN - 1)) { | |
2504 gclog_or_tty->print_cr(" #### error: file name too long"); | |
2505 return; | |
2506 } | |
2507 | |
2508 char file_name[JVM_MAXPATHLEN]; | |
2509 sprintf(file_name, "%s.%s", G1PrintReachableBaseFile, str); | |
2510 gclog_or_tty->print_cr(" dumping to file %s", file_name); | |
2511 | |
2512 fileStream fout(file_name); | |
2513 if (!fout.is_open()) { | |
2514 gclog_or_tty->print_cr(" #### error: could not open file"); | |
2515 return; | |
2516 } | |
2517 | |
2518 outputStream* out = &fout; | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2519 out->print_cr("-- USING %s", verify_option_to_tams(vo)); |
1044 | 2520 out->cr(); |
2521 | |
1388 | 2522 out->print_cr("--- ITERATING OVER REGIONS"); |
1044 | 2523 out->cr(); |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3771
diff
changeset
|
2524 PrintReachableRegionClosure rcl(out, vo, all); |
1388 | 2525 _g1h->heap_region_iterate(&rcl); |
1044 | 2526 out->cr(); |
2527 | |
2528 gclog_or_tty->print_cr(" done"); | |
1388 | 2529 gclog_or_tty->flush(); |
342 | 2530 } |
2531 | |
1044 | 2532 #endif // PRODUCT |
2533 | |
342 | 2534 // This note is for drainAllSATBBuffers and the code in between. |
2535 // In the future we could reuse a task to do this work during an | |
2536 // evacuation pause (since now tasks are not active and can be claimed | |
2537 // during an evacuation pause). This was a late change to the code and | |
2538 // is currently not being taken advantage of. | |
2539 | |
2540 class CMGlobalObjectClosure : public ObjectClosure { | |
2541 private: | |
2542 ConcurrentMark* _cm; | |
2543 | |
2544 public: | |
2545 void do_object(oop obj) { | |
2546 _cm->deal_with_reference(obj); | |
2547 } | |
2548 | |
2549 CMGlobalObjectClosure(ConcurrentMark* cm) : _cm(cm) { } | |
2550 }; | |
2551 | |
2552 void ConcurrentMark::deal_with_reference(oop obj) { | |
3771 | 2553 if (verbose_high()) { |
342 | 2554 gclog_or_tty->print_cr("[global] we're dealing with reference "PTR_FORMAT, |
2555 (void*) obj); | |
3771 | 2556 } |
342 | 2557 |
2558 HeapWord* objAddr = (HeapWord*) obj; | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2559 assert(obj->is_oop_or_null(true /* ignore mark word */), "Error"); |
342 | 2560 if (_g1h->is_in_g1_reserved(objAddr)) { |
3771 | 2561 assert(obj != NULL, "null check is implicit"); |
2562 if (!_nextMarkBitMap->isMarked(objAddr)) { | |
2563 // Only get the containing region if the object is not marked on the | |
2564 // bitmap (otherwise, it's a waste of time since we won't do | |
2565 // anything with it). | |
2566 HeapRegion* hr = _g1h->heap_region_containing_raw(obj); | |
2567 if (!hr->obj_allocated_since_next_marking(obj)) { | |
2568 if (verbose_high()) { | |
2569 gclog_or_tty->print_cr("[global] "PTR_FORMAT" is not considered " | |
2570 "marked", (void*) obj); | |
2571 } | |
2572 | |
2573 // we need to mark it first | |
2574 if (_nextMarkBitMap->parMark(objAddr)) { | |
2575 // No OrderAccess:store_load() is needed. It is implicit in the | |
2576 // CAS done in parMark(objAddr) above | |
2577 HeapWord* finger = _finger; | |
2578 if (objAddr < finger) { | |
2579 if (verbose_high()) { | |
2580 gclog_or_tty->print_cr("[global] below the global finger " | |
2581 "("PTR_FORMAT"), pushing it", finger); | |
2582 } | |
2583 if (!mark_stack_push(obj)) { | |
2584 if (verbose_low()) { | |
2585 gclog_or_tty->print_cr("[global] global stack overflow during " | |
2586 "deal_with_reference"); | |
2587 } | |
2588 } | |
342 | 2589 } |
2590 } | |
2591 } | |
2592 } | |
2593 } | |
2594 } | |
2595 | |
2596 void ConcurrentMark::drainAllSATBBuffers() { | |
2597 CMGlobalObjectClosure oc(this); | |
2598 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); | |
2599 satb_mq_set.set_closure(&oc); | |
2600 | |
2601 while (satb_mq_set.apply_closure_to_completed_buffer()) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2602 if (verbose_medium()) { |
342 | 2603 gclog_or_tty->print_cr("[global] processed an SATB buffer"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2604 } |
342 | 2605 } |
2606 | |
2607 // no need to check whether we should do this, as this is only | |
2608 // called during an evacuation pause | |
2609 satb_mq_set.iterate_closure_all_threads(); | |
2610 | |
2611 satb_mq_set.set_closure(NULL); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2612 assert(satb_mq_set.completed_buffers_num() == 0, "invariant"); |
342 | 2613 } |
2614 | |
2615 void ConcurrentMark::markPrev(oop p) { | |
2616 // Note we are overriding the read-only view of the prev map here, via | |
2617 // the cast. | |
2618 ((CMBitMap*)_prevMarkBitMap)->mark((HeapWord*)p); | |
2619 } | |
2620 | |
2621 void ConcurrentMark::clear(oop p) { | |
2622 assert(p != NULL && p->is_oop(), "expected an oop"); | |
2623 HeapWord* addr = (HeapWord*)p; | |
2624 assert(addr >= _nextMarkBitMap->startWord() || | |
2625 addr < _nextMarkBitMap->endWord(), "in a region"); | |
2626 | |
2627 _nextMarkBitMap->clear(addr); | |
2628 } | |
2629 | |
2630 void ConcurrentMark::clearRangeBothMaps(MemRegion mr) { | |
2631 // Note we are overriding the read-only view of the prev map here, via | |
2632 // the cast. | |
2633 ((CMBitMap*)_prevMarkBitMap)->clearRange(mr); | |
2634 _nextMarkBitMap->clearRange(mr); | |
2635 } | |
2636 | |
2637 HeapRegion* | |
2638 ConcurrentMark::claim_region(int task_num) { | |
2639 // "checkpoint" the finger | |
2640 HeapWord* finger = _finger; | |
2641 | |
2642 // _heap_end will not change underneath our feet; it only changes at | |
2643 // yield points. | |
2644 while (finger < _heap_end) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2645 assert(_g1h->is_in_g1_reserved(finger), "invariant"); |
342 | 2646 |
3771 | 2647 // Note on how this code handles humongous regions. In the |
2648 // normal case the finger will reach the start of a "starts | |
2649 // humongous" (SH) region. Its end will either be the end of the | |
2650 // last "continues humongous" (CH) region in the sequence, or the | |
2651 // standard end of the SH region (if the SH is the only region in | |
2652 // the sequence). That way claim_region() will skip over the CH | |
2653 // regions. However, there is a subtle race between a CM thread | |
2654 // executing this method and a mutator thread doing a humongous | |
2655 // object allocation. The two are not mutually exclusive as the CM | |
2656 // thread does not need to hold the Heap_lock when it gets | |
2657 // here. So there is a chance that claim_region() will come across | |
2658 // a free region that's in the progress of becoming a SH or a CH | |
2659 // region. In the former case, it will either | |
2660 // a) Miss the update to the region's end, in which case it will | |
2661 // visit every subsequent CH region, will find their bitmaps | |
2662 // empty, and do nothing, or | |
2663 // b) Will observe the update of the region's end (in which case | |
2664 // it will skip the subsequent CH regions). | |
2665 // If it comes across a region that suddenly becomes CH, the | |
2666 // scenario will be similar to b). So, the race between | |
2667 // claim_region() and a humongous object allocation might force us | |
2668 // to do a bit of unnecessary work (due to some unnecessary bitmap | |
2669 // iterations) but it should not introduce and correctness issues. | |
2670 HeapRegion* curr_region = _g1h->heap_region_containing_raw(finger); | |
342 | 2671 HeapWord* bottom = curr_region->bottom(); |
2672 HeapWord* end = curr_region->end(); | |
2673 HeapWord* limit = curr_region->next_top_at_mark_start(); | |
2674 | |
3771 | 2675 if (verbose_low()) { |
342 | 2676 gclog_or_tty->print_cr("[%d] curr_region = "PTR_FORMAT" " |
2677 "["PTR_FORMAT", "PTR_FORMAT"), " | |
2678 "limit = "PTR_FORMAT, | |
2679 task_num, curr_region, bottom, end, limit); | |
3771 | 2680 } |
2681 | |
2682 // Is the gap between reading the finger and doing the CAS too long? | |
2683 HeapWord* res = (HeapWord*) Atomic::cmpxchg_ptr(end, &_finger, finger); | |
342 | 2684 if (res == finger) { |
2685 // we succeeded | |
2686 | |
2687 // notice that _finger == end cannot be guaranteed here since, | |
2688 // someone else might have moved the finger even further | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2689 assert(_finger >= end, "the finger should have moved forward"); |
342 | 2690 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2691 if (verbose_low()) { |
342 | 2692 gclog_or_tty->print_cr("[%d] we were successful with region = " |
2693 PTR_FORMAT, task_num, curr_region); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2694 } |
342 | 2695 |
2696 if (limit > bottom) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2697 if (verbose_low()) { |
342 | 2698 gclog_or_tty->print_cr("[%d] region "PTR_FORMAT" is not empty, " |
2699 "returning it ", task_num, curr_region); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2700 } |
342 | 2701 return curr_region; |
2702 } else { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2703 assert(limit == bottom, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2704 "the region limit should be at bottom"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2705 if (verbose_low()) { |
342 | 2706 gclog_or_tty->print_cr("[%d] region "PTR_FORMAT" is empty, " |
2707 "returning NULL", task_num, curr_region); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2708 } |
342 | 2709 // we return NULL and the caller should try calling |
2710 // claim_region() again. | |
2711 return NULL; | |
2712 } | |
2713 } else { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2714 assert(_finger > finger, "the finger should have moved forward"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2715 if (verbose_low()) { |
342 | 2716 gclog_or_tty->print_cr("[%d] somebody else moved the finger, " |
2717 "global finger = "PTR_FORMAT", " | |
2718 "our finger = "PTR_FORMAT, | |
2719 task_num, _finger, finger); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2720 } |
342 | 2721 |
2722 // read it again | |
2723 finger = _finger; | |
2724 } | |
2725 } | |
2726 | |
2727 return NULL; | |
2728 } | |
2729 | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2730 bool ConcurrentMark::invalidate_aborted_regions_in_cset() { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2731 bool result = false; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2732 for (int i = 0; i < (int)_max_task_num; ++i) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2733 CMTask* the_task = _tasks[i]; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2734 MemRegion mr = the_task->aborted_region(); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2735 if (mr.start() != NULL) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2736 assert(mr.end() != NULL, "invariant"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2737 assert(mr.word_size() > 0, "invariant"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2738 HeapRegion* hr = _g1h->heap_region_containing(mr.start()); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2739 assert(hr != NULL, "invariant"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2740 if (hr->in_collection_set()) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2741 // The region points into the collection set |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2742 the_task->set_aborted_region(MemRegion()); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2743 result = true; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2744 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2745 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2746 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2747 return result; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2748 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2749 |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2750 bool ConcurrentMark::has_aborted_regions() { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2751 for (int i = 0; i < (int)_max_task_num; ++i) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2752 CMTask* the_task = _tasks[i]; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2753 MemRegion mr = the_task->aborted_region(); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2754 if (mr.start() != NULL) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2755 assert(mr.end() != NULL, "invariant"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2756 assert(mr.word_size() > 0, "invariant"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2757 return true; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2758 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2759 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2760 return false; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2761 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2762 |
342 | 2763 void ConcurrentMark::oops_do(OopClosure* cl) { |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2764 if (_markStack.size() > 0 && verbose_low()) { |
342 | 2765 gclog_or_tty->print_cr("[global] scanning the global marking stack, " |
2766 "size = %d", _markStack.size()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2767 } |
342 | 2768 // we first iterate over the contents of the mark stack... |
2769 _markStack.oops_do(cl); | |
2770 | |
2771 for (int i = 0; i < (int)_max_task_num; ++i) { | |
2772 OopTaskQueue* queue = _task_queues->queue((int)i); | |
2773 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2774 if (queue->size() > 0 && verbose_low()) { |
342 | 2775 gclog_or_tty->print_cr("[global] scanning task queue of task %d, " |
2776 "size = %d", i, queue->size()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2777 } |
342 | 2778 |
2779 // ...then over the contents of the all the task queues. | |
2780 queue->oops_do(cl); | |
2781 } | |
2782 | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2783 // Invalidate any entries, that are in the region stack, that |
342 | 2784 // point into the collection set |
2785 if (_regionStack.invalidate_entries_into_cset()) { | |
2786 // otherwise, any gray objects copied during the evacuation pause | |
2787 // might not be visited. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
2788 assert(_should_gray_objects, "invariant"); |
342 | 2789 } |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2790 |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2791 // Invalidate any aborted regions, recorded in the individual CM |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2792 // tasks, that point into the collection set. |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2793 if (invalidate_aborted_regions_in_cset()) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2794 // otherwise, any gray objects copied during the evacuation pause |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2795 // might not be visited. |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2796 assert(_should_gray_objects, "invariant"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2797 } |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
2798 |
342 | 2799 } |
2800 | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
2801 void ConcurrentMark::clear_marking_state(bool clear_overflow) { |
342 | 2802 _markStack.setEmpty(); |
2803 _markStack.clear_overflow(); | |
2804 _regionStack.setEmpty(); | |
2805 _regionStack.clear_overflow(); | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
2806 if (clear_overflow) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
2807 clear_has_overflown(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
2808 } else { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
2809 assert(has_overflown(), "pre-condition"); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
2810 } |
342 | 2811 _finger = _heap_start; |
2812 | |
2813 for (int i = 0; i < (int)_max_task_num; ++i) { | |
2814 OopTaskQueue* queue = _task_queues->queue(i); | |
2815 queue->set_empty(); | |
1885
a5c514e74487
6988458: G1: assert(mr.end() <= _cm->finger()) failed: otherwise the region shouldn't be on the stack
johnc
parents:
1835
diff
changeset
|
2816 // Clear any partial regions from the CMTasks |
a5c514e74487
6988458: G1: assert(mr.end() <= _cm->finger()) failed: otherwise the region shouldn't be on the stack
johnc
parents:
1835
diff
changeset
|
2817 _tasks[i]->clear_aborted_region(); |
342 | 2818 } |
2819 } | |
2820 | |
2821 void ConcurrentMark::print_stats() { | |
2822 if (verbose_stats()) { | |
2823 gclog_or_tty->print_cr("---------------------------------------------------------------------"); | |
2824 for (size_t i = 0; i < _active_tasks; ++i) { | |
2825 _tasks[i]->print_stats(); | |
2826 gclog_or_tty->print_cr("---------------------------------------------------------------------"); | |
2827 } | |
2828 } | |
2829 } | |
2830 | |
2831 class CSMarkOopClosure: public OopClosure { | |
2832 friend class CSMarkBitMapClosure; | |
2833 | |
2834 G1CollectedHeap* _g1h; | |
2835 CMBitMap* _bm; | |
2836 ConcurrentMark* _cm; | |
2837 oop* _ms; | |
2838 jint* _array_ind_stack; | |
2839 int _ms_size; | |
2840 int _ms_ind; | |
2841 int _array_increment; | |
2842 | |
2843 bool push(oop obj, int arr_ind = 0) { | |
2844 if (_ms_ind == _ms_size) { | |
2845 gclog_or_tty->print_cr("Mark stack is full."); | |
2846 return false; | |
2847 } | |
2848 _ms[_ms_ind] = obj; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2849 if (obj->is_objArray()) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2850 _array_ind_stack[_ms_ind] = arr_ind; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2851 } |
342 | 2852 _ms_ind++; |
2853 return true; | |
2854 } | |
2855 | |
2856 oop pop() { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2857 if (_ms_ind == 0) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2858 return NULL; |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
2859 } else { |
342 | 2860 _ms_ind--; |
2861 return _ms[_ms_ind]; | |
2862 } | |
2863 } | |
2864 | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2865 template <class T> bool drain() { |
342 | 2866 while (_ms_ind > 0) { |
2867 oop obj = pop(); | |
2868 assert(obj != NULL, "Since index was non-zero."); | |
2869 if (obj->is_objArray()) { | |
2870 jint arr_ind = _array_ind_stack[_ms_ind]; | |
2871 objArrayOop aobj = objArrayOop(obj); | |
2872 jint len = aobj->length(); | |
2873 jint next_arr_ind = arr_ind + _array_increment; | |
2874 if (next_arr_ind < len) { | |
2875 push(obj, next_arr_ind); | |
2876 } | |
2877 // Now process this portion of this one. | |
2878 int lim = MIN2(next_arr_ind, len); | |
2879 for (int j = arr_ind; j < lim; j++) { | |
912
308762b2bf14
6872000: G1: compilation fails on linux/older gcc
apetrusenko
parents:
866
diff
changeset
|
2880 do_oop(aobj->objArrayOopDesc::obj_at_addr<T>(j)); |
342 | 2881 } |
2882 | |
2883 } else { | |
2884 obj->oop_iterate(this); | |
2885 } | |
2886 if (abort()) return false; | |
2887 } | |
2888 return true; | |
2889 } | |
2890 | |
2891 public: | |
2892 CSMarkOopClosure(ConcurrentMark* cm, int ms_size) : | |
2893 _g1h(G1CollectedHeap::heap()), | |
2894 _cm(cm), | |
2895 _bm(cm->nextMarkBitMap()), | |
2896 _ms_size(ms_size), _ms_ind(0), | |
2897 _ms(NEW_C_HEAP_ARRAY(oop, ms_size)), | |
2898 _array_ind_stack(NEW_C_HEAP_ARRAY(jint, ms_size)), | |
2899 _array_increment(MAX2(ms_size/8, 16)) | |
2900 {} | |
2901 | |
2902 ~CSMarkOopClosure() { | |
2903 FREE_C_HEAP_ARRAY(oop, _ms); | |
2904 FREE_C_HEAP_ARRAY(jint, _array_ind_stack); | |
2905 } | |
2906 | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2907 virtual void do_oop(narrowOop* p) { do_oop_work(p); } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2908 virtual void do_oop( oop* p) { do_oop_work(p); } |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2909 |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2910 template <class T> void do_oop_work(T* p) { |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2911 T heap_oop = oopDesc::load_heap_oop(p); |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2912 if (oopDesc::is_null(heap_oop)) return; |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2913 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); |
342 | 2914 if (obj->is_forwarded()) { |
2915 // If the object has already been forwarded, we have to make sure | |
2916 // that it's marked. So follow the forwarding pointer. Note that | |
2917 // this does the right thing for self-forwarding pointers in the | |
2918 // evacuation failure case. | |
2919 obj = obj->forwardee(); | |
2920 } | |
2921 HeapRegion* hr = _g1h->heap_region_containing(obj); | |
2922 if (hr != NULL) { | |
2923 if (hr->in_collection_set()) { | |
2924 if (_g1h->is_obj_ill(obj)) { | |
2925 _bm->mark((HeapWord*)obj); | |
2926 if (!push(obj)) { | |
2927 gclog_or_tty->print_cr("Setting abort in CSMarkOopClosure because push failed."); | |
2928 set_abort(); | |
2929 } | |
2930 } | |
2931 } else { | |
2932 // Outside the collection set; we need to gray it | |
2933 _cm->deal_with_reference(obj); | |
2934 } | |
2935 } | |
2936 } | |
2937 }; | |
2938 | |
2939 class CSMarkBitMapClosure: public BitMapClosure { | |
2940 G1CollectedHeap* _g1h; | |
2941 CMBitMap* _bitMap; | |
2942 ConcurrentMark* _cm; | |
2943 CSMarkOopClosure _oop_cl; | |
2944 public: | |
2945 CSMarkBitMapClosure(ConcurrentMark* cm, int ms_size) : | |
2946 _g1h(G1CollectedHeap::heap()), | |
2947 _bitMap(cm->nextMarkBitMap()), | |
2948 _oop_cl(cm, ms_size) | |
2949 {} | |
2950 | |
2951 ~CSMarkBitMapClosure() {} | |
2952 | |
2953 bool do_bit(size_t offset) { | |
2954 // convert offset into a HeapWord* | |
2955 HeapWord* addr = _bitMap->offsetToHeapWord(offset); | |
2956 assert(_bitMap->endWord() && addr < _bitMap->endWord(), | |
2957 "address out of range"); | |
2958 assert(_bitMap->isMarked(addr), "tautology"); | |
2959 oop obj = oop(addr); | |
2960 if (!obj->is_forwarded()) { | |
2961 if (!_oop_cl.push(obj)) return false; | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2962 if (UseCompressedOops) { |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2963 if (!_oop_cl.drain<narrowOop>()) return false; |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2964 } else { |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2965 if (!_oop_cl.drain<oop>()) return false; |
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
831
diff
changeset
|
2966 } |
342 | 2967 } |
2968 // Otherwise... | |
2969 return true; | |
2970 } | |
2971 }; | |
2972 | |
2973 | |
2974 class CompleteMarkingInCSHRClosure: public HeapRegionClosure { | |
2975 CMBitMap* _bm; | |
2976 CSMarkBitMapClosure _bit_cl; | |
2977 enum SomePrivateConstants { | |
2978 MSSize = 1000 | |
2979 }; | |
2980 bool _completed; | |
2981 public: | |
2982 CompleteMarkingInCSHRClosure(ConcurrentMark* cm) : | |
2983 _bm(cm->nextMarkBitMap()), | |
2984 _bit_cl(cm, MSSize), | |
2985 _completed(true) | |
2986 {} | |
2987 | |
2988 ~CompleteMarkingInCSHRClosure() {} | |
2989 | |
2990 bool doHeapRegion(HeapRegion* r) { | |
2991 if (!r->evacuation_failed()) { | |
2992 MemRegion mr = MemRegion(r->bottom(), r->next_top_at_mark_start()); | |
2993 if (!mr.is_empty()) { | |
2994 if (!_bm->iterate(&_bit_cl, mr)) { | |
2995 _completed = false; | |
2996 return true; | |
2997 } | |
2998 } | |
2999 } | |
3000 return false; | |
3001 } | |
3002 | |
3003 bool completed() { return _completed; } | |
3004 }; | |
3005 | |
3006 class ClearMarksInHRClosure: public HeapRegionClosure { | |
3007 CMBitMap* _bm; | |
3008 public: | |
3009 ClearMarksInHRClosure(CMBitMap* bm): _bm(bm) { } | |
3010 | |
3011 bool doHeapRegion(HeapRegion* r) { | |
3012 if (!r->used_region().is_empty() && !r->evacuation_failed()) { | |
3013 MemRegion usedMR = r->used_region(); | |
3014 _bm->clearRange(r->used_region()); | |
3015 } | |
3016 return false; | |
3017 } | |
3018 }; | |
3019 | |
3020 void ConcurrentMark::complete_marking_in_collection_set() { | |
3021 G1CollectedHeap* g1h = G1CollectedHeap::heap(); | |
3022 | |
3023 if (!g1h->mark_in_progress()) { | |
3024 g1h->g1_policy()->record_mark_closure_time(0.0); | |
3025 return; | |
3026 } | |
3027 | |
3028 int i = 1; | |
3029 double start = os::elapsedTime(); | |
3030 while (true) { | |
3031 i++; | |
3032 CompleteMarkingInCSHRClosure cmplt(this); | |
3033 g1h->collection_set_iterate(&cmplt); | |
3034 if (cmplt.completed()) break; | |
3035 } | |
3036 double end_time = os::elapsedTime(); | |
3037 double elapsed_time_ms = (end_time - start) * 1000.0; | |
3038 g1h->g1_policy()->record_mark_closure_time(elapsed_time_ms); | |
3039 | |
3040 ClearMarksInHRClosure clr(nextMarkBitMap()); | |
3041 g1h->collection_set_iterate(&clr); | |
3042 } | |
3043 | |
3044 // The next two methods deal with the following optimisation. Some | |
3045 // objects are gray by being marked and located above the finger. If | |
3046 // they are copied, during an evacuation pause, below the finger then | |
3047 // the need to be pushed on the stack. The observation is that, if | |
3048 // there are no regions in the collection set located above the | |
3049 // finger, then the above cannot happen, hence we do not need to | |
3050 // explicitly gray any objects when copying them to below the | |
3051 // finger. The global stack will be scanned to ensure that, if it | |
3052 // points to objects being copied, it will update their | |
3053 // location. There is a tricky situation with the gray objects in | |
3054 // region stack that are being coped, however. See the comment in | |
3055 // newCSet(). | |
3056 | |
3057 void ConcurrentMark::newCSet() { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3058 if (!concurrent_marking_in_progress()) { |
342 | 3059 // nothing to do if marking is not in progress |
3060 return; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3061 } |
342 | 3062 |
3063 // find what the lowest finger is among the global and local fingers | |
3064 _min_finger = _finger; | |
3065 for (int i = 0; i < (int)_max_task_num; ++i) { | |
3066 CMTask* task = _tasks[i]; | |
3067 HeapWord* task_finger = task->finger(); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3068 if (task_finger != NULL && task_finger < _min_finger) { |
342 | 3069 _min_finger = task_finger; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3070 } |
342 | 3071 } |
3072 | |
3073 _should_gray_objects = false; | |
3074 | |
3075 // This fixes a very subtle and fustrating bug. It might be the case | |
3076 // that, during en evacuation pause, heap regions that contain | |
3077 // objects that are gray (by being in regions contained in the | |
3078 // region stack) are included in the collection set. Since such gray | |
3079 // objects will be moved, and because it's not easy to redirect | |
3080 // region stack entries to point to a new location (because objects | |
3081 // in one region might be scattered to multiple regions after they | |
3082 // are copied), one option is to ensure that all marked objects | |
3083 // copied during a pause are pushed on the stack. Notice, however, | |
3084 // that this problem can only happen when the region stack is not | |
3085 // empty during an evacuation pause. So, we make the fix a bit less | |
3086 // conservative and ensure that regions are pushed on the stack, | |
3087 // irrespective whether all collection set regions are below the | |
3088 // finger, if the region stack is not empty. This is expected to be | |
3089 // a rare case, so I don't think it's necessary to be smarted about it. | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3090 if (!region_stack_empty() || has_aborted_regions()) { |
342 | 3091 _should_gray_objects = true; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3092 } |
342 | 3093 } |
3094 | |
3095 void ConcurrentMark::registerCSetRegion(HeapRegion* hr) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3096 if (!concurrent_marking_in_progress()) return; |
342 | 3097 |
3098 HeapWord* region_end = hr->end(); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3099 if (region_end > _min_finger) { |
342 | 3100 _should_gray_objects = true; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3101 } |
342 | 3102 } |
3103 | |
3378
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3104 // Resets the region fields of active CMTasks whose values point |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3105 // into the collection set. |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3106 void ConcurrentMark::reset_active_task_region_fields_in_cset() { |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3107 assert(SafepointSynchronize::is_at_safepoint(), "should be in STW"); |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3108 assert(parallel_marking_threads() <= _max_task_num, "sanity"); |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3109 |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3110 for (int i = 0; i < (int)parallel_marking_threads(); i += 1) { |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3111 CMTask* task = _tasks[i]; |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3112 HeapWord* task_finger = task->finger(); |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3113 if (task_finger != NULL) { |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3114 assert(_g1h->is_in_g1_reserved(task_finger), "not in heap"); |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3115 HeapRegion* finger_region = _g1h->heap_region_containing(task_finger); |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3116 if (finger_region->in_collection_set()) { |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3117 // The task's current region is in the collection set. |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3118 // This region will be evacuated in the current GC and |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3119 // the region fields in the task will be stale. |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3120 task->giveup_current_region(); |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3121 } |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3122 } |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3123 } |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3124 } |
69293e516993
7041440: G1: assert(obj->is_oop_or_null(true )) failed: Error #
johnc
parents:
3317
diff
changeset
|
3125 |
342 | 3126 // abandon current marking iteration due to a Full GC |
3127 void ConcurrentMark::abort() { | |
3128 // Clear all marks to force marking thread to do nothing | |
3129 _nextMarkBitMap->clearAll(); | |
3130 // Empty mark stack | |
3131 clear_marking_state(); | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3132 for (int i = 0; i < (int)_max_task_num; ++i) { |
342 | 3133 _tasks[i]->clear_region_fields(); |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3134 } |
342 | 3135 _has_aborted = true; |
3136 | |
3137 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); | |
3138 satb_mq_set.abandon_partial_marking(); | |
1317
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
3139 // This can be called either during or outside marking, we'll read |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
3140 // the expected_active value from the SATB queue set. |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
3141 satb_mq_set.set_active_all_threads( |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
3142 false, /* new active value */ |
d4197f8d516a
6935821: G1: threads created during marking do not active their SATB queues
tonyp
parents:
1314
diff
changeset
|
3143 satb_mq_set.is_active() /* expected_active */); |
342 | 3144 } |
3145 | |
3146 static void print_ms_time_info(const char* prefix, const char* name, | |
3147 NumberSeq& ns) { | |
3148 gclog_or_tty->print_cr("%s%5d %12s: total time = %8.2f s (avg = %8.2f ms).", | |
3149 prefix, ns.num(), name, ns.sum()/1000.0, ns.avg()); | |
3150 if (ns.num() > 0) { | |
3151 gclog_or_tty->print_cr("%s [std. dev = %8.2f ms, max = %8.2f ms]", | |
3152 prefix, ns.sd(), ns.maximum()); | |
3153 } | |
3154 } | |
3155 | |
3156 void ConcurrentMark::print_summary_info() { | |
3157 gclog_or_tty->print_cr(" Concurrent marking:"); | |
3158 print_ms_time_info(" ", "init marks", _init_times); | |
3159 print_ms_time_info(" ", "remarks", _remark_times); | |
3160 { | |
3161 print_ms_time_info(" ", "final marks", _remark_mark_times); | |
3162 print_ms_time_info(" ", "weak refs", _remark_weak_ref_times); | |
3163 | |
3164 } | |
3165 print_ms_time_info(" ", "cleanups", _cleanup_times); | |
3166 gclog_or_tty->print_cr(" Final counting total time = %8.2f s (avg = %8.2f ms).", | |
3167 _total_counting_time, | |
3168 (_cleanup_times.num() > 0 ? _total_counting_time * 1000.0 / | |
3169 (double)_cleanup_times.num() | |
3170 : 0.0)); | |
3171 if (G1ScrubRemSets) { | |
3172 gclog_or_tty->print_cr(" RS scrub total time = %8.2f s (avg = %8.2f ms).", | |
3173 _total_rs_scrub_time, | |
3174 (_cleanup_times.num() > 0 ? _total_rs_scrub_time * 1000.0 / | |
3175 (double)_cleanup_times.num() | |
3176 : 0.0)); | |
3177 } | |
3178 gclog_or_tty->print_cr(" Total stop_world time = %8.2f s.", | |
3179 (_init_times.sum() + _remark_times.sum() + | |
3180 _cleanup_times.sum())/1000.0); | |
3181 gclog_or_tty->print_cr(" Total concurrent time = %8.2f s " | |
3182 "(%8.2f s marking, %8.2f s counting).", | |
3183 cmThread()->vtime_accum(), | |
3184 cmThread()->vtime_mark_accum(), | |
3185 cmThread()->vtime_count_accum()); | |
3186 } | |
3187 | |
1019 | 3188 void ConcurrentMark::print_worker_threads_on(outputStream* st) const { |
3189 _parallel_workers->print_worker_threads_on(st); | |
3190 } | |
3191 | |
342 | 3192 // Closures |
3193 // XXX: there seems to be a lot of code duplication here; | |
3194 // should refactor and consolidate the shared code. | |
3195 | |
3196 // This closure is used to mark refs into the CMS generation in | |
3197 // the CMS bit map. Called at the first checkpoint. | |
3198 | |
3199 // We take a break if someone is trying to stop the world. | |
3200 bool ConcurrentMark::do_yield_check(int worker_i) { | |
3201 if (should_yield()) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3202 if (worker_i == 0) { |
342 | 3203 _g1h->g1_policy()->record_concurrent_pause(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3204 } |
342 | 3205 cmThread()->yield(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3206 if (worker_i == 0) { |
342 | 3207 _g1h->g1_policy()->record_concurrent_pause_end(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3208 } |
342 | 3209 return true; |
3210 } else { | |
3211 return false; | |
3212 } | |
3213 } | |
3214 | |
3215 bool ConcurrentMark::should_yield() { | |
3216 return cmThread()->should_yield(); | |
3217 } | |
3218 | |
3219 bool ConcurrentMark::containing_card_is_marked(void* p) { | |
3220 size_t offset = pointer_delta(p, _g1h->reserved_region().start(), 1); | |
3221 return _card_bm.at(offset >> CardTableModRefBS::card_shift); | |
3222 } | |
3223 | |
3224 bool ConcurrentMark::containing_cards_are_marked(void* start, | |
3225 void* last) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3226 return containing_card_is_marked(start) && |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3227 containing_card_is_marked(last); |
342 | 3228 } |
3229 | |
3230 #ifndef PRODUCT | |
3231 // for debugging purposes | |
3232 void ConcurrentMark::print_finger() { | |
3233 gclog_or_tty->print_cr("heap ["PTR_FORMAT", "PTR_FORMAT"), global finger = "PTR_FORMAT, | |
3234 _heap_start, _heap_end, _finger); | |
3235 for (int i = 0; i < (int) _max_task_num; ++i) { | |
3236 gclog_or_tty->print(" %d: "PTR_FORMAT, i, _tasks[i]->finger()); | |
3237 } | |
3238 gclog_or_tty->print_cr(""); | |
3239 } | |
3240 #endif | |
3241 | |
3771 | 3242 void CMTask::scan_object(oop obj) { |
3243 assert(_nextMarkBitMap->isMarked((HeapWord*) obj), "invariant"); | |
3244 | |
3245 if (_cm->verbose_high()) { | |
3246 gclog_or_tty->print_cr("[%d] we're scanning object "PTR_FORMAT, | |
3247 _task_id, (void*) obj); | |
3248 } | |
3249 | |
3250 size_t obj_size = obj->size(); | |
3251 _words_scanned += obj_size; | |
3252 | |
3253 obj->oop_iterate(_cm_oop_closure); | |
3254 statsOnly( ++_objs_scanned ); | |
3255 check_limits(); | |
3256 } | |
3257 | |
342 | 3258 // Closure for iteration over bitmaps |
3259 class CMBitMapClosure : public BitMapClosure { | |
3260 private: | |
3261 // the bitmap that is being iterated over | |
3262 CMBitMap* _nextMarkBitMap; | |
3263 ConcurrentMark* _cm; | |
3264 CMTask* _task; | |
3265 // true if we're scanning a heap region claimed by the task (so that | |
3266 // we move the finger along), false if we're not, i.e. currently when | |
3267 // scanning a heap region popped from the region stack (so that we | |
3268 // do not move the task finger along; it'd be a mistake if we did so). | |
3269 bool _scanning_heap_region; | |
3270 | |
3271 public: | |
3272 CMBitMapClosure(CMTask *task, | |
3273 ConcurrentMark* cm, | |
3274 CMBitMap* nextMarkBitMap) | |
3275 : _task(task), _cm(cm), _nextMarkBitMap(nextMarkBitMap) { } | |
3276 | |
3277 void set_scanning_heap_region(bool scanning_heap_region) { | |
3278 _scanning_heap_region = scanning_heap_region; | |
3279 } | |
3280 | |
3281 bool do_bit(size_t offset) { | |
3282 HeapWord* addr = _nextMarkBitMap->offsetToHeapWord(offset); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3283 assert(_nextMarkBitMap->isMarked(addr), "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3284 assert( addr < _cm->finger(), "invariant"); |
342 | 3285 |
3286 if (_scanning_heap_region) { | |
3287 statsOnly( _task->increase_objs_found_on_bitmap() ); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3288 assert(addr >= _task->finger(), "invariant"); |
342 | 3289 // We move that task's local finger along. |
3290 _task->move_finger_to(addr); | |
3291 } else { | |
3292 // We move the task's region finger along. | |
3293 _task->move_region_finger_to(addr); | |
3294 } | |
3295 | |
3296 _task->scan_object(oop(addr)); | |
3297 // we only partially drain the local queue and global stack | |
3298 _task->drain_local_queue(true); | |
3299 _task->drain_global_stack(true); | |
3300 | |
3301 // if the has_aborted flag has been raised, we need to bail out of | |
3302 // the iteration | |
3303 return !_task->has_aborted(); | |
3304 } | |
3305 }; | |
3306 | |
3307 // Closure for iterating over objects, currently only used for | |
3308 // processing SATB buffers. | |
3309 class CMObjectClosure : public ObjectClosure { | |
3310 private: | |
3311 CMTask* _task; | |
3312 | |
3313 public: | |
3314 void do_object(oop obj) { | |
3315 _task->deal_with_reference(obj); | |
3316 } | |
3317 | |
3318 CMObjectClosure(CMTask* task) : _task(task) { } | |
3319 }; | |
3320 | |
3771 | 3321 G1CMOopClosure::G1CMOopClosure(G1CollectedHeap* g1h, |
3322 ConcurrentMark* cm, | |
3323 CMTask* task) | |
3324 : _g1h(g1h), _cm(cm), _task(task) { | |
3325 assert(_ref_processor == NULL, "should be initialized to NULL"); | |
3326 | |
3327 if (G1UseConcMarkReferenceProcessing) { | |
3328 _ref_processor = g1h->ref_processor(); | |
3329 assert(_ref_processor != NULL, "should not be NULL"); | |
342 | 3330 } |
3771 | 3331 } |
342 | 3332 |
3333 void CMTask::setup_for_region(HeapRegion* hr) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3334 // Separated the asserts so that we know which one fires. |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3335 assert(hr != NULL, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3336 "claim_region() should have filtered out continues humongous regions"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3337 assert(!hr->continuesHumongous(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3338 "claim_region() should have filtered out continues humongous regions"); |
342 | 3339 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3340 if (_cm->verbose_low()) { |
342 | 3341 gclog_or_tty->print_cr("[%d] setting up for region "PTR_FORMAT, |
3342 _task_id, hr); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3343 } |
342 | 3344 |
3345 _curr_region = hr; | |
3346 _finger = hr->bottom(); | |
3347 update_region_limit(); | |
3348 } | |
3349 | |
3350 void CMTask::update_region_limit() { | |
3351 HeapRegion* hr = _curr_region; | |
3352 HeapWord* bottom = hr->bottom(); | |
3353 HeapWord* limit = hr->next_top_at_mark_start(); | |
3354 | |
3355 if (limit == bottom) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3356 if (_cm->verbose_low()) { |
342 | 3357 gclog_or_tty->print_cr("[%d] found an empty region " |
3358 "["PTR_FORMAT", "PTR_FORMAT")", | |
3359 _task_id, bottom, limit); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3360 } |
342 | 3361 // The region was collected underneath our feet. |
3362 // We set the finger to bottom to ensure that the bitmap | |
3363 // iteration that will follow this will not do anything. | |
3364 // (this is not a condition that holds when we set the region up, | |
3365 // as the region is not supposed to be empty in the first place) | |
3366 _finger = bottom; | |
3367 } else if (limit >= _region_limit) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3368 assert(limit >= _finger, "peace of mind"); |
342 | 3369 } else { |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3370 assert(limit < _region_limit, "only way to get here"); |
342 | 3371 // This can happen under some pretty unusual circumstances. An |
3372 // evacuation pause empties the region underneath our feet (NTAMS | |
3373 // at bottom). We then do some allocation in the region (NTAMS | |
3374 // stays at bottom), followed by the region being used as a GC | |
3375 // alloc region (NTAMS will move to top() and the objects | |
3376 // originally below it will be grayed). All objects now marked in | |
3377 // the region are explicitly grayed, if below the global finger, | |
3378 // and we do not need in fact to scan anything else. So, we simply | |
3379 // set _finger to be limit to ensure that the bitmap iteration | |
3380 // doesn't do anything. | |
3381 _finger = limit; | |
3382 } | |
3383 | |
3384 _region_limit = limit; | |
3385 } | |
3386 | |
3387 void CMTask::giveup_current_region() { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3388 assert(_curr_region != NULL, "invariant"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3389 if (_cm->verbose_low()) { |
342 | 3390 gclog_or_tty->print_cr("[%d] giving up region "PTR_FORMAT, |
3391 _task_id, _curr_region); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3392 } |
342 | 3393 clear_region_fields(); |
3394 } | |
3395 | |
3396 void CMTask::clear_region_fields() { | |
3397 // Values for these three fields that indicate that we're not | |
3398 // holding on to a region. | |
3399 _curr_region = NULL; | |
3400 _finger = NULL; | |
3401 _region_limit = NULL; | |
3402 | |
3403 _region_finger = NULL; | |
3404 } | |
3405 | |
3771 | 3406 void CMTask::set_cm_oop_closure(G1CMOopClosure* cm_oop_closure) { |
3407 if (cm_oop_closure == NULL) { | |
3408 assert(_cm_oop_closure != NULL, "invariant"); | |
3409 } else { | |
3410 assert(_cm_oop_closure == NULL, "invariant"); | |
3411 } | |
3412 _cm_oop_closure = cm_oop_closure; | |
3413 } | |
3414 | |
342 | 3415 void CMTask::reset(CMBitMap* nextMarkBitMap) { |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3416 guarantee(nextMarkBitMap != NULL, "invariant"); |
342 | 3417 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3418 if (_cm->verbose_low()) { |
342 | 3419 gclog_or_tty->print_cr("[%d] resetting", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3420 } |
342 | 3421 |
3422 _nextMarkBitMap = nextMarkBitMap; | |
3423 clear_region_fields(); | |
1885
a5c514e74487
6988458: G1: assert(mr.end() <= _cm->finger()) failed: otherwise the region shouldn't be on the stack
johnc
parents:
1835
diff
changeset
|
3424 assert(_aborted_region.is_empty(), "should have been cleared"); |
342 | 3425 |
3426 _calls = 0; | |
3427 _elapsed_time_ms = 0.0; | |
3428 _termination_time_ms = 0.0; | |
3429 _termination_start_time_ms = 0.0; | |
3430 | |
3431 #if _MARKING_STATS_ | |
3432 _local_pushes = 0; | |
3433 _local_pops = 0; | |
3434 _local_max_size = 0; | |
3435 _objs_scanned = 0; | |
3436 _global_pushes = 0; | |
3437 _global_pops = 0; | |
3438 _global_max_size = 0; | |
3439 _global_transfers_to = 0; | |
3440 _global_transfers_from = 0; | |
3441 _region_stack_pops = 0; | |
3442 _regions_claimed = 0; | |
3443 _objs_found_on_bitmap = 0; | |
3444 _satb_buffers_processed = 0; | |
3445 _steal_attempts = 0; | |
3446 _steals = 0; | |
3447 _aborted = 0; | |
3448 _aborted_overflow = 0; | |
3449 _aborted_cm_aborted = 0; | |
3450 _aborted_yield = 0; | |
3451 _aborted_timed_out = 0; | |
3452 _aborted_satb = 0; | |
3453 _aborted_termination = 0; | |
3454 #endif // _MARKING_STATS_ | |
3455 } | |
3456 | |
3457 bool CMTask::should_exit_termination() { | |
3458 regular_clock_call(); | |
3459 // This is called when we are in the termination protocol. We should | |
3460 // quit if, for some reason, this task wants to abort or the global | |
3461 // stack is not empty (this means that we can get work from it). | |
3462 return !_cm->mark_stack_empty() || has_aborted(); | |
3463 } | |
3464 | |
3465 void CMTask::reached_limit() { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3466 assert(_words_scanned >= _words_scanned_limit || |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3467 _refs_reached >= _refs_reached_limit , |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3468 "shouldn't have been called otherwise"); |
342 | 3469 regular_clock_call(); |
3470 } | |
3471 | |
3472 void CMTask::regular_clock_call() { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3473 if (has_aborted()) return; |
342 | 3474 |
3475 // First, we need to recalculate the words scanned and refs reached | |
3476 // limits for the next clock call. | |
3477 recalculate_limits(); | |
3478 | |
3479 // During the regular clock call we do the following | |
3480 | |
3481 // (1) If an overflow has been flagged, then we abort. | |
3482 if (_cm->has_overflown()) { | |
3483 set_has_aborted(); | |
3484 return; | |
3485 } | |
3486 | |
3487 // If we are not concurrent (i.e. we're doing remark) we don't need | |
3488 // to check anything else. The other steps are only needed during | |
3489 // the concurrent marking phase. | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3490 if (!concurrent()) return; |
342 | 3491 |
3492 // (2) If marking has been aborted for Full GC, then we also abort. | |
3493 if (_cm->has_aborted()) { | |
3494 set_has_aborted(); | |
3495 statsOnly( ++_aborted_cm_aborted ); | |
3496 return; | |
3497 } | |
3498 | |
3499 double curr_time_ms = os::elapsedVTime() * 1000.0; | |
3500 | |
3501 // (3) If marking stats are enabled, then we update the step history. | |
3502 #if _MARKING_STATS_ | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3503 if (_words_scanned >= _words_scanned_limit) { |
342 | 3504 ++_clock_due_to_scanning; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3505 } |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3506 if (_refs_reached >= _refs_reached_limit) { |
342 | 3507 ++_clock_due_to_marking; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3508 } |
342 | 3509 |
3510 double last_interval_ms = curr_time_ms - _interval_start_time_ms; | |
3511 _interval_start_time_ms = curr_time_ms; | |
3512 _all_clock_intervals_ms.add(last_interval_ms); | |
3513 | |
3514 if (_cm->verbose_medium()) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3515 gclog_or_tty->print_cr("[%d] regular clock, interval = %1.2lfms, " |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3516 "scanned = %d%s, refs reached = %d%s", |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3517 _task_id, last_interval_ms, |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3518 _words_scanned, |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3519 (_words_scanned >= _words_scanned_limit) ? " (*)" : "", |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3520 _refs_reached, |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3521 (_refs_reached >= _refs_reached_limit) ? " (*)" : ""); |
342 | 3522 } |
3523 #endif // _MARKING_STATS_ | |
3524 | |
3525 // (4) We check whether we should yield. If we have to, then we abort. | |
3526 if (_cm->should_yield()) { | |
3527 // We should yield. To do this we abort the task. The caller is | |
3528 // responsible for yielding. | |
3529 set_has_aborted(); | |
3530 statsOnly( ++_aborted_yield ); | |
3531 return; | |
3532 } | |
3533 | |
3534 // (5) We check whether we've reached our time quota. If we have, | |
3535 // then we abort. | |
3536 double elapsed_time_ms = curr_time_ms - _start_time_ms; | |
3537 if (elapsed_time_ms > _time_target_ms) { | |
3538 set_has_aborted(); | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
3539 _has_timed_out = true; |
342 | 3540 statsOnly( ++_aborted_timed_out ); |
3541 return; | |
3542 } | |
3543 | |
3544 // (6) Finally, we check whether there are enough completed STAB | |
3545 // buffers available for processing. If there are, we abort. | |
3546 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); | |
3547 if (!_draining_satb_buffers && satb_mq_set.process_completed_buffers()) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3548 if (_cm->verbose_low()) { |
342 | 3549 gclog_or_tty->print_cr("[%d] aborting to deal with pending SATB buffers", |
3550 _task_id); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3551 } |
342 | 3552 // we do need to process SATB buffers, we'll abort and restart |
3553 // the marking task to do so | |
3554 set_has_aborted(); | |
3555 statsOnly( ++_aborted_satb ); | |
3556 return; | |
3557 } | |
3558 } | |
3559 | |
3560 void CMTask::recalculate_limits() { | |
3561 _real_words_scanned_limit = _words_scanned + words_scanned_period; | |
3562 _words_scanned_limit = _real_words_scanned_limit; | |
3563 | |
3564 _real_refs_reached_limit = _refs_reached + refs_reached_period; | |
3565 _refs_reached_limit = _real_refs_reached_limit; | |
3566 } | |
3567 | |
3568 void CMTask::decrease_limits() { | |
3569 // This is called when we believe that we're going to do an infrequent | |
3570 // operation which will increase the per byte scanned cost (i.e. move | |
3571 // entries to/from the global stack). It basically tries to decrease the | |
3572 // scanning limit so that the clock is called earlier. | |
3573 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3574 if (_cm->verbose_medium()) { |
342 | 3575 gclog_or_tty->print_cr("[%d] decreasing limits", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3576 } |
342 | 3577 |
3578 _words_scanned_limit = _real_words_scanned_limit - | |
3579 3 * words_scanned_period / 4; | |
3580 _refs_reached_limit = _real_refs_reached_limit - | |
3581 3 * refs_reached_period / 4; | |
3582 } | |
3583 | |
3584 void CMTask::move_entries_to_global_stack() { | |
3585 // local array where we'll store the entries that will be popped | |
3586 // from the local queue | |
3587 oop buffer[global_stack_transfer_size]; | |
3588 | |
3589 int n = 0; | |
3590 oop obj; | |
3591 while (n < global_stack_transfer_size && _task_queue->pop_local(obj)) { | |
3592 buffer[n] = obj; | |
3593 ++n; | |
3594 } | |
3595 | |
3596 if (n > 0) { | |
3597 // we popped at least one entry from the local queue | |
3598 | |
3599 statsOnly( ++_global_transfers_to; _local_pops += n ); | |
3600 | |
3601 if (!_cm->mark_stack_push(buffer, n)) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3602 if (_cm->verbose_low()) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3603 gclog_or_tty->print_cr("[%d] aborting due to global stack overflow", |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3604 _task_id); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3605 } |
342 | 3606 set_has_aborted(); |
3607 } else { | |
3608 // the transfer was successful | |
3609 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3610 if (_cm->verbose_medium()) { |
342 | 3611 gclog_or_tty->print_cr("[%d] pushed %d entries to the global stack", |
3612 _task_id, n); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3613 } |
342 | 3614 statsOnly( int tmp_size = _cm->mark_stack_size(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3615 if (tmp_size > _global_max_size) { |
342 | 3616 _global_max_size = tmp_size; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3617 } |
342 | 3618 _global_pushes += n ); |
3619 } | |
3620 } | |
3621 | |
3622 // this operation was quite expensive, so decrease the limits | |
3623 decrease_limits(); | |
3624 } | |
3625 | |
3626 void CMTask::get_entries_from_global_stack() { | |
3627 // local array where we'll store the entries that will be popped | |
3628 // from the global stack. | |
3629 oop buffer[global_stack_transfer_size]; | |
3630 int n; | |
3631 _cm->mark_stack_pop(buffer, global_stack_transfer_size, &n); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3632 assert(n <= global_stack_transfer_size, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3633 "we should not pop more than the given limit"); |
342 | 3634 if (n > 0) { |
3635 // yes, we did actually pop at least one entry | |
3636 | |
3637 statsOnly( ++_global_transfers_from; _global_pops += n ); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3638 if (_cm->verbose_medium()) { |
342 | 3639 gclog_or_tty->print_cr("[%d] popped %d entries from the global stack", |
3640 _task_id, n); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3641 } |
342 | 3642 for (int i = 0; i < n; ++i) { |
3643 bool success = _task_queue->push(buffer[i]); | |
3644 // We only call this when the local queue is empty or under a | |
3645 // given target limit. So, we do not expect this push to fail. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3646 assert(success, "invariant"); |
342 | 3647 } |
3648 | |
3649 statsOnly( int tmp_size = _task_queue->size(); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3650 if (tmp_size > _local_max_size) { |
342 | 3651 _local_max_size = tmp_size; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3652 } |
342 | 3653 _local_pushes += n ); |
3654 } | |
3655 | |
3656 // this operation was quite expensive, so decrease the limits | |
3657 decrease_limits(); | |
3658 } | |
3659 | |
3660 void CMTask::drain_local_queue(bool partially) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3661 if (has_aborted()) return; |
342 | 3662 |
3663 // Decide what the target size is, depending whether we're going to | |
3664 // drain it partially (so that other tasks can steal if they run out | |
3665 // of things to do) or totally (at the very end). | |
3666 size_t target_size; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3667 if (partially) { |
342 | 3668 target_size = MIN2((size_t)_task_queue->max_elems()/3, GCDrainStackTargetSize); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3669 } else { |
342 | 3670 target_size = 0; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3671 } |
342 | 3672 |
3673 if (_task_queue->size() > target_size) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3674 if (_cm->verbose_high()) { |
342 | 3675 gclog_or_tty->print_cr("[%d] draining local queue, target size = %d", |
3676 _task_id, target_size); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3677 } |
342 | 3678 |
3679 oop obj; | |
3680 bool ret = _task_queue->pop_local(obj); | |
3681 while (ret) { | |
3682 statsOnly( ++_local_pops ); | |
3683 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3684 if (_cm->verbose_high()) { |
342 | 3685 gclog_or_tty->print_cr("[%d] popped "PTR_FORMAT, _task_id, |
3686 (void*) obj); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3687 } |
342 | 3688 |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3689 assert(_g1h->is_in_g1_reserved((HeapWord*) obj), "invariant" ); |
2361 | 3690 assert(!_g1h->is_on_master_free_list( |
2152 | 3691 _g1h->heap_region_containing((HeapWord*) obj)), "invariant"); |
342 | 3692 |
3693 scan_object(obj); | |
3694 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3695 if (_task_queue->size() <= target_size || has_aborted()) { |
342 | 3696 ret = false; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3697 } else { |
342 | 3698 ret = _task_queue->pop_local(obj); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3699 } |
342 | 3700 } |
3701 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3702 if (_cm->verbose_high()) { |
342 | 3703 gclog_or_tty->print_cr("[%d] drained local queue, size = %d", |
3704 _task_id, _task_queue->size()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3705 } |
342 | 3706 } |
3707 } | |
3708 | |
3709 void CMTask::drain_global_stack(bool partially) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3710 if (has_aborted()) return; |
342 | 3711 |
3712 // We have a policy to drain the local queue before we attempt to | |
3713 // drain the global stack. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3714 assert(partially || _task_queue->size() == 0, "invariant"); |
342 | 3715 |
3716 // Decide what the target size is, depending whether we're going to | |
3717 // drain it partially (so that other tasks can steal if they run out | |
3718 // of things to do) or totally (at the very end). Notice that, | |
3719 // because we move entries from the global stack in chunks or | |
3720 // because another task might be doing the same, we might in fact | |
3721 // drop below the target. But, this is not a problem. | |
3722 size_t target_size; | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3723 if (partially) { |
342 | 3724 target_size = _cm->partial_mark_stack_size_target(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3725 } else { |
342 | 3726 target_size = 0; |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3727 } |
342 | 3728 |
3729 if (_cm->mark_stack_size() > target_size) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3730 if (_cm->verbose_low()) { |
342 | 3731 gclog_or_tty->print_cr("[%d] draining global_stack, target size %d", |
3732 _task_id, target_size); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3733 } |
342 | 3734 |
3735 while (!has_aborted() && _cm->mark_stack_size() > target_size) { | |
3736 get_entries_from_global_stack(); | |
3737 drain_local_queue(partially); | |
3738 } | |
3739 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3740 if (_cm->verbose_low()) { |
342 | 3741 gclog_or_tty->print_cr("[%d] drained global stack, size = %d", |
3742 _task_id, _cm->mark_stack_size()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3743 } |
342 | 3744 } |
3745 } | |
3746 | |
3747 // SATB Queue has several assumptions on whether to call the par or | |
3748 // non-par versions of the methods. this is why some of the code is | |
3749 // replicated. We should really get rid of the single-threaded version | |
3750 // of the code to simplify things. | |
3751 void CMTask::drain_satb_buffers() { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3752 if (has_aborted()) return; |
342 | 3753 |
3754 // We set this so that the regular clock knows that we're in the | |
3755 // middle of draining buffers and doesn't set the abort flag when it | |
3756 // notices that SATB buffers are available for draining. It'd be | |
3757 // very counter productive if it did that. :-) | |
3758 _draining_satb_buffers = true; | |
3759 | |
3760 CMObjectClosure oc(this); | |
3761 SATBMarkQueueSet& satb_mq_set = JavaThread::satb_mark_queue_set(); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3762 if (G1CollectedHeap::use_parallel_gc_threads()) { |
342 | 3763 satb_mq_set.set_par_closure(_task_id, &oc); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3764 } else { |
342 | 3765 satb_mq_set.set_closure(&oc); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3766 } |
342 | 3767 |
3768 // This keeps claiming and applying the closure to completed buffers | |
3769 // until we run out of buffers or we need to abort. | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1719
diff
changeset
|
3770 if (G1CollectedHeap::use_parallel_gc_threads()) { |
342 | 3771 while (!has_aborted() && |
3772 satb_mq_set.par_apply_closure_to_completed_buffer(_task_id)) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3773 if (_cm->verbose_medium()) { |
342 | 3774 gclog_or_tty->print_cr("[%d] processed an SATB buffer", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3775 } |
342 | 3776 statsOnly( ++_satb_buffers_processed ); |
3777 regular_clock_call(); | |
3778 } | |
3779 } else { | |
3780 while (!has_aborted() && | |
3781 satb_mq_set.apply_closure_to_completed_buffer()) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3782 if (_cm->verbose_medium()) { |
342 | 3783 gclog_or_tty->print_cr("[%d] processed an SATB buffer", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3784 } |
342 | 3785 statsOnly( ++_satb_buffers_processed ); |
3786 regular_clock_call(); | |
3787 } | |
3788 } | |
3789 | |
3790 if (!concurrent() && !has_aborted()) { | |
3791 // We should only do this during remark. | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3792 if (G1CollectedHeap::use_parallel_gc_threads()) { |
342 | 3793 satb_mq_set.par_iterate_closure_all_threads(_task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3794 } else { |
342 | 3795 satb_mq_set.iterate_closure_all_threads(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3796 } |
342 | 3797 } |
3798 | |
3799 _draining_satb_buffers = false; | |
3800 | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3801 assert(has_aborted() || |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3802 concurrent() || |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3803 satb_mq_set.completed_buffers_num() == 0, "invariant"); |
342 | 3804 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3805 if (G1CollectedHeap::use_parallel_gc_threads()) { |
342 | 3806 satb_mq_set.set_par_closure(_task_id, NULL); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3807 } else { |
342 | 3808 satb_mq_set.set_closure(NULL); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3809 } |
342 | 3810 |
3811 // again, this was a potentially expensive operation, decrease the | |
3812 // limits to get the regular clock call early | |
3813 decrease_limits(); | |
3814 } | |
3815 | |
3816 void CMTask::drain_region_stack(BitMapClosure* bc) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3817 if (has_aborted()) return; |
342 | 3818 |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3819 assert(_region_finger == NULL, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3820 "it should be NULL when we're not scanning a region"); |
342 | 3821 |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3822 if (!_cm->region_stack_empty() || !_aborted_region.is_empty()) { |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3823 if (_cm->verbose_low()) { |
342 | 3824 gclog_or_tty->print_cr("[%d] draining region stack, size = %d", |
3825 _task_id, _cm->region_stack_size()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3826 } |
342 | 3827 |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3828 MemRegion mr; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3829 |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3830 if (!_aborted_region.is_empty()) { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3831 mr = _aborted_region; |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3832 _aborted_region = MemRegion(); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3833 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3834 if (_cm->verbose_low()) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3835 gclog_or_tty->print_cr("[%d] scanning aborted region " |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3836 "[ " PTR_FORMAT ", " PTR_FORMAT " )", |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3837 _task_id, mr.start(), mr.end()); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3838 } |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3839 } else { |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3840 mr = _cm->region_stack_pop_lock_free(); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3841 // it returns MemRegion() if the pop fails |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3842 statsOnly(if (mr.start() != NULL) ++_region_stack_pops ); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3843 } |
342 | 3844 |
3845 while (mr.start() != NULL) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3846 if (_cm->verbose_medium()) { |
342 | 3847 gclog_or_tty->print_cr("[%d] we are scanning region " |
3848 "["PTR_FORMAT", "PTR_FORMAT")", | |
3849 _task_id, mr.start(), mr.end()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3850 } |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3851 |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3852 assert(mr.end() <= _cm->finger(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3853 "otherwise the region shouldn't be on the stack"); |
342 | 3854 assert(!mr.is_empty(), "Only non-empty regions live on the region stack"); |
3855 if (_nextMarkBitMap->iterate(bc, mr)) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3856 assert(!has_aborted(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3857 "cannot abort the task without aborting the bitmap iteration"); |
342 | 3858 |
3859 // We finished iterating over the region without aborting. | |
3860 regular_clock_call(); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3861 if (has_aborted()) { |
342 | 3862 mr = MemRegion(); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3863 } else { |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3864 mr = _cm->region_stack_pop_lock_free(); |
342 | 3865 // it returns MemRegion() if the pop fails |
3866 statsOnly(if (mr.start() != NULL) ++_region_stack_pops ); | |
3867 } | |
3868 } else { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3869 assert(has_aborted(), "currently the only way to do so"); |
342 | 3870 |
3871 // The only way to abort the bitmap iteration is to return | |
3872 // false from the do_bit() method. However, inside the | |
3873 // do_bit() method we move the _region_finger to point to the | |
3874 // object currently being looked at. So, if we bail out, we | |
3875 // have definitely set _region_finger to something non-null. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
3876 assert(_region_finger != NULL, "invariant"); |
342 | 3877 |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3878 // Make sure that any previously aborted region has been |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3879 // cleared. |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3880 assert(_aborted_region.is_empty(), "aborted region not cleared"); |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3881 |
342 | 3882 // The iteration was actually aborted. So now _region_finger |
3883 // points to the address of the object we last scanned. If we | |
3884 // leave it there, when we restart this task, we will rescan | |
3885 // the object. It is easy to avoid this. We move the finger by | |
3886 // enough to point to the next possible object header (the | |
3887 // bitmap knows by how much we need to move it as it knows its | |
3888 // granularity). | |
3889 MemRegion newRegion = | |
3890 MemRegion(_nextMarkBitMap->nextWord(_region_finger), mr.end()); | |
3891 | |
3892 if (!newRegion.is_empty()) { | |
3893 if (_cm->verbose_low()) { | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3894 gclog_or_tty->print_cr("[%d] recording unscanned region" |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3895 "[" PTR_FORMAT "," PTR_FORMAT ") in CMTask", |
342 | 3896 _task_id, |
3897 newRegion.start(), newRegion.end()); | |
3898 } | |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3899 // Now record the part of the region we didn't scan to |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3900 // make sure this task scans it later. |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
3901 _aborted_region = newRegion; |
342 | 3902 } |
3903 // break from while | |
3904 mr = MemRegion(); | |
3905 } | |
3906 _region_finger = NULL; | |
3907 } | |
3908 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3909 if (_cm->verbose_low()) { |
342 | 3910 gclog_or_tty->print_cr("[%d] drained region stack, size = %d", |
3911 _task_id, _cm->region_stack_size()); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
3912 } |
342 | 3913 } |
3914 } | |
3915 | |
3916 void CMTask::print_stats() { | |
3917 gclog_or_tty->print_cr("Marking Stats, task = %d, calls = %d", | |
3918 _task_id, _calls); | |
3919 gclog_or_tty->print_cr(" Elapsed time = %1.2lfms, Termination time = %1.2lfms", | |
3920 _elapsed_time_ms, _termination_time_ms); | |
3921 gclog_or_tty->print_cr(" Step Times (cum): num = %d, avg = %1.2lfms, sd = %1.2lfms", | |
3922 _step_times_ms.num(), _step_times_ms.avg(), | |
3923 _step_times_ms.sd()); | |
3924 gclog_or_tty->print_cr(" max = %1.2lfms, total = %1.2lfms", | |
3925 _step_times_ms.maximum(), _step_times_ms.sum()); | |
3926 | |
3927 #if _MARKING_STATS_ | |
3928 gclog_or_tty->print_cr(" Clock Intervals (cum): num = %d, avg = %1.2lfms, sd = %1.2lfms", | |
3929 _all_clock_intervals_ms.num(), _all_clock_intervals_ms.avg(), | |
3930 _all_clock_intervals_ms.sd()); | |
3931 gclog_or_tty->print_cr(" max = %1.2lfms, total = %1.2lfms", | |
3932 _all_clock_intervals_ms.maximum(), | |
3933 _all_clock_intervals_ms.sum()); | |
3934 gclog_or_tty->print_cr(" Clock Causes (cum): scanning = %d, marking = %d", | |
3935 _clock_due_to_scanning, _clock_due_to_marking); | |
3936 gclog_or_tty->print_cr(" Objects: scanned = %d, found on the bitmap = %d", | |
3937 _objs_scanned, _objs_found_on_bitmap); | |
3938 gclog_or_tty->print_cr(" Local Queue: pushes = %d, pops = %d, max size = %d", | |
3939 _local_pushes, _local_pops, _local_max_size); | |
3940 gclog_or_tty->print_cr(" Global Stack: pushes = %d, pops = %d, max size = %d", | |
3941 _global_pushes, _global_pops, _global_max_size); | |
3942 gclog_or_tty->print_cr(" transfers to = %d, transfers from = %d", | |
3943 _global_transfers_to,_global_transfers_from); | |
3944 gclog_or_tty->print_cr(" Regions: claimed = %d, Region Stack: pops = %d", | |
3945 _regions_claimed, _region_stack_pops); | |
3946 gclog_or_tty->print_cr(" SATB buffers: processed = %d", _satb_buffers_processed); | |
3947 gclog_or_tty->print_cr(" Steals: attempts = %d, successes = %d", | |
3948 _steal_attempts, _steals); | |
3949 gclog_or_tty->print_cr(" Aborted: %d, due to", _aborted); | |
3950 gclog_or_tty->print_cr(" overflow: %d, global abort: %d, yield: %d", | |
3951 _aborted_overflow, _aborted_cm_aborted, _aborted_yield); | |
3952 gclog_or_tty->print_cr(" time out: %d, SATB: %d, termination: %d", | |
3953 _aborted_timed_out, _aborted_satb, _aborted_termination); | |
3954 #endif // _MARKING_STATS_ | |
3955 } | |
3956 | |
3957 /***************************************************************************** | |
3958 | |
3959 The do_marking_step(time_target_ms) method is the building block | |
3960 of the parallel marking framework. It can be called in parallel | |
3961 with other invocations of do_marking_step() on different tasks | |
3962 (but only one per task, obviously) and concurrently with the | |
3963 mutator threads, or during remark, hence it eliminates the need | |
3964 for two versions of the code. When called during remark, it will | |
3965 pick up from where the task left off during the concurrent marking | |
3966 phase. Interestingly, tasks are also claimable during evacuation | |
3967 pauses too, since do_marking_step() ensures that it aborts before | |
3968 it needs to yield. | |
3969 | |
3970 The data structures that is uses to do marking work are the | |
3971 following: | |
3972 | |
3973 (1) Marking Bitmap. If there are gray objects that appear only | |
3974 on the bitmap (this happens either when dealing with an overflow | |
3975 or when the initial marking phase has simply marked the roots | |
3976 and didn't push them on the stack), then tasks claim heap | |
3977 regions whose bitmap they then scan to find gray objects. A | |
3978 global finger indicates where the end of the last claimed region | |
3979 is. A local finger indicates how far into the region a task has | |
3980 scanned. The two fingers are used to determine how to gray an | |
3981 object (i.e. whether simply marking it is OK, as it will be | |
3982 visited by a task in the future, or whether it needs to be also | |
3983 pushed on a stack). | |
3984 | |
3985 (2) Local Queue. The local queue of the task which is accessed | |
3986 reasonably efficiently by the task. Other tasks can steal from | |
3987 it when they run out of work. Throughout the marking phase, a | |
3988 task attempts to keep its local queue short but not totally | |
3989 empty, so that entries are available for stealing by other | |
3990 tasks. Only when there is no more work, a task will totally | |
3991 drain its local queue. | |
3992 | |
3993 (3) Global Mark Stack. This handles local queue overflow. During | |
3994 marking only sets of entries are moved between it and the local | |
3995 queues, as access to it requires a mutex and more fine-grain | |
3996 interaction with it which might cause contention. If it | |
3997 overflows, then the marking phase should restart and iterate | |
3998 over the bitmap to identify gray objects. Throughout the marking | |
3999 phase, tasks attempt to keep the global mark stack at a small | |
4000 length but not totally empty, so that entries are available for | |
4001 popping by other tasks. Only when there is no more work, tasks | |
4002 will totally drain the global mark stack. | |
4003 | |
4004 (4) Global Region Stack. Entries on it correspond to areas of | |
4005 the bitmap that need to be scanned since they contain gray | |
4006 objects. Pushes on the region stack only happen during | |
4007 evacuation pauses and typically correspond to areas covered by | |
4008 GC LABS. If it overflows, then the marking phase should restart | |
4009 and iterate over the bitmap to identify gray objects. Tasks will | |
4010 try to totally drain the region stack as soon as possible. | |
4011 | |
4012 (5) SATB Buffer Queue. This is where completed SATB buffers are | |
4013 made available. Buffers are regularly removed from this queue | |
4014 and scanned for roots, so that the queue doesn't get too | |
4015 long. During remark, all completed buffers are processed, as | |
4016 well as the filled in parts of any uncompleted buffers. | |
4017 | |
4018 The do_marking_step() method tries to abort when the time target | |
4019 has been reached. There are a few other cases when the | |
4020 do_marking_step() method also aborts: | |
4021 | |
4022 (1) When the marking phase has been aborted (after a Full GC). | |
4023 | |
4024 (2) When a global overflow (either on the global stack or the | |
4025 region stack) has been triggered. Before the task aborts, it | |
4026 will actually sync up with the other tasks to ensure that all | |
4027 the marking data structures (local queues, stacks, fingers etc.) | |
4028 are re-initialised so that when do_marking_step() completes, | |
4029 the marking phase can immediately restart. | |
4030 | |
4031 (3) When enough completed SATB buffers are available. The | |
4032 do_marking_step() method only tries to drain SATB buffers right | |
4033 at the beginning. So, if enough buffers are available, the | |
4034 marking step aborts and the SATB buffers are processed at | |
4035 the beginning of the next invocation. | |
4036 | |
4037 (4) To yield. when we have to yield then we abort and yield | |
4038 right at the end of do_marking_step(). This saves us from a lot | |
4039 of hassle as, by yielding we might allow a Full GC. If this | |
4040 happens then objects will be compacted underneath our feet, the | |
4041 heap might shrink, etc. We save checking for this by just | |
4042 aborting and doing the yield right at the end. | |
4043 | |
4044 From the above it follows that the do_marking_step() method should | |
4045 be called in a loop (or, otherwise, regularly) until it completes. | |
4046 | |
4047 If a marking step completes without its has_aborted() flag being | |
4048 true, it means it has completed the current marking phase (and | |
4049 also all other marking tasks have done so and have all synced up). | |
4050 | |
4051 A method called regular_clock_call() is invoked "regularly" (in | |
4052 sub ms intervals) throughout marking. It is this clock method that | |
4053 checks all the abort conditions which were mentioned above and | |
4054 decides when the task should abort. A work-based scheme is used to | |
4055 trigger this clock method: when the number of object words the | |
4056 marking phase has scanned or the number of references the marking | |
4057 phase has visited reach a given limit. Additional invocations to | |
4058 the method clock have been planted in a few other strategic places | |
4059 too. The initial reason for the clock method was to avoid calling | |
4060 vtime too regularly, as it is quite expensive. So, once it was in | |
4061 place, it was natural to piggy-back all the other conditions on it | |
4062 too and not constantly check them throughout the code. | |
4063 | |
4064 *****************************************************************************/ | |
4065 | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4066 void CMTask::do_marking_step(double time_target_ms, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4067 bool do_stealing, |
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4068 bool do_termination) { |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4069 assert(time_target_ms >= 1.0, "minimum granularity is 1ms"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4070 assert(concurrent() == _cm->concurrent(), "they should be the same"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4071 |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4072 assert(concurrent() || _cm->region_stack_empty(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4073 "the region stack should have been cleared before remark"); |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
4074 assert(concurrent() || !_cm->has_aborted_regions(), |
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
4075 "aborted regions should have been cleared before remark"); |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4076 assert(_region_finger == NULL, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4077 "this should be non-null only when a region is being scanned"); |
342 | 4078 |
4079 G1CollectorPolicy* g1_policy = _g1h->g1_policy(); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4080 assert(_task_queues != NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4081 assert(_task_queue != NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4082 assert(_task_queues->queue(_task_id) == _task_queue, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4083 |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4084 assert(!_claimed, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4085 "only one thread should claim this task at any one time"); |
342 | 4086 |
4087 // OK, this doesn't safeguard again all possible scenarios, as it is | |
4088 // possible for two threads to set the _claimed flag at the same | |
4089 // time. But it is only for debugging purposes anyway and it will | |
4090 // catch most problems. | |
4091 _claimed = true; | |
4092 | |
4093 _start_time_ms = os::elapsedVTime() * 1000.0; | |
4094 statsOnly( _interval_start_time_ms = _start_time_ms ); | |
4095 | |
4096 double diff_prediction_ms = | |
4097 g1_policy->get_new_prediction(&_marking_step_diffs_ms); | |
4098 _time_target_ms = time_target_ms - diff_prediction_ms; | |
4099 | |
4100 // set up the variables that are used in the work-based scheme to | |
4101 // call the regular clock method | |
4102 _words_scanned = 0; | |
4103 _refs_reached = 0; | |
4104 recalculate_limits(); | |
4105 | |
4106 // clear all flags | |
4107 clear_has_aborted(); | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4108 _has_timed_out = false; |
342 | 4109 _draining_satb_buffers = false; |
4110 | |
4111 ++_calls; | |
4112 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4113 if (_cm->verbose_low()) { |
342 | 4114 gclog_or_tty->print_cr("[%d] >>>>>>>>>> START, call = %d, " |
4115 "target = %1.2lfms >>>>>>>>>>", | |
4116 _task_id, _calls, _time_target_ms); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4117 } |
342 | 4118 |
4119 // Set up the bitmap and oop closures. Anything that uses them is | |
4120 // eventually called from this method, so it is OK to allocate these | |
4121 // statically. | |
4122 CMBitMapClosure bitmap_closure(this, _cm, _nextMarkBitMap); | |
3771 | 4123 G1CMOopClosure cm_oop_closure(_g1h, _cm, this); |
4124 set_cm_oop_closure(&cm_oop_closure); | |
342 | 4125 |
4126 if (_cm->has_overflown()) { | |
4127 // This can happen if the region stack or the mark stack overflows | |
4128 // during a GC pause and this task, after a yield point, | |
4129 // restarts. We have to abort as we need to get into the overflow | |
4130 // protocol which happens right at the end of this task. | |
4131 set_has_aborted(); | |
4132 } | |
4133 | |
4134 // First drain any available SATB buffers. After this, we will not | |
4135 // look at SATB buffers before the next invocation of this method. | |
4136 // If enough completed SATB buffers are queued up, the regular clock | |
4137 // will abort this task so that it restarts. | |
4138 drain_satb_buffers(); | |
4139 // ...then partially drain the local queue and the global stack | |
4140 drain_local_queue(true); | |
4141 drain_global_stack(true); | |
4142 | |
4143 // Then totally drain the region stack. We will not look at | |
4144 // it again before the next invocation of this method. Entries on | |
4145 // the region stack are only added during evacuation pauses, for | |
4146 // which we have to yield. When we do, we abort the task anyway so | |
4147 // it will look at the region stack again when it restarts. | |
4148 bitmap_closure.set_scanning_heap_region(false); | |
4149 drain_region_stack(&bitmap_closure); | |
4150 // ...then partially drain the local queue and the global stack | |
4151 drain_local_queue(true); | |
4152 drain_global_stack(true); | |
4153 | |
4154 do { | |
4155 if (!has_aborted() && _curr_region != NULL) { | |
4156 // This means that we're already holding on to a region. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4157 assert(_finger != NULL, "if region is not NULL, then the finger " |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4158 "should not be NULL either"); |
342 | 4159 |
4160 // We might have restarted this task after an evacuation pause | |
4161 // which might have evacuated the region we're holding on to | |
4162 // underneath our feet. Let's read its limit again to make sure | |
4163 // that we do not iterate over a region of the heap that | |
4164 // contains garbage (update_region_limit() will also move | |
4165 // _finger to the start of the region if it is found empty). | |
4166 update_region_limit(); | |
4167 // We will start from _finger not from the start of the region, | |
4168 // as we might be restarting this task after aborting half-way | |
4169 // through scanning this region. In this case, _finger points to | |
4170 // the address where we last found a marked object. If this is a | |
4171 // fresh region, _finger points to start(). | |
4172 MemRegion mr = MemRegion(_finger, _region_limit); | |
4173 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4174 if (_cm->verbose_low()) { |
342 | 4175 gclog_or_tty->print_cr("[%d] we're scanning part " |
4176 "["PTR_FORMAT", "PTR_FORMAT") " | |
4177 "of region "PTR_FORMAT, | |
4178 _task_id, _finger, _region_limit, _curr_region); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4179 } |
342 | 4180 |
4181 // Let's iterate over the bitmap of the part of the | |
4182 // region that is left. | |
4183 bitmap_closure.set_scanning_heap_region(true); | |
4184 if (mr.is_empty() || | |
4185 _nextMarkBitMap->iterate(&bitmap_closure, mr)) { | |
4186 // We successfully completed iterating over the region. Now, | |
4187 // let's give up the region. | |
4188 giveup_current_region(); | |
4189 regular_clock_call(); | |
4190 } else { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4191 assert(has_aborted(), "currently the only way to do so"); |
342 | 4192 // The only way to abort the bitmap iteration is to return |
4193 // false from the do_bit() method. However, inside the | |
4194 // do_bit() method we move the _finger to point to the | |
4195 // object currently being looked at. So, if we bail out, we | |
4196 // have definitely set _finger to something non-null. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4197 assert(_finger != NULL, "invariant"); |
342 | 4198 |
4199 // Region iteration was actually aborted. So now _finger | |
4200 // points to the address of the object we last scanned. If we | |
4201 // leave it there, when we restart this task, we will rescan | |
4202 // the object. It is easy to avoid this. We move the finger by | |
4203 // enough to point to the next possible object header (the | |
4204 // bitmap knows by how much we need to move it as it knows its | |
4205 // granularity). | |
1314
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4206 assert(_finger < _region_limit, "invariant"); |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4207 HeapWord* new_finger = _nextMarkBitMap->nextWord(_finger); |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4208 // Check if bitmap iteration was aborted while scanning the last object |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4209 if (new_finger >= _region_limit) { |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4210 giveup_current_region(); |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4211 } else { |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4212 move_finger_to(new_finger); |
3f0549ed0c98
6921710: G1: assert(new_finger >= _finger && new_finger < _region_limit,"invariant")
apetrusenko
parents:
1284
diff
changeset
|
4213 } |
342 | 4214 } |
4215 } | |
4216 // At this point we have either completed iterating over the | |
4217 // region we were holding on to, or we have aborted. | |
4218 | |
4219 // We then partially drain the local queue and the global stack. | |
4220 // (Do we really need this?) | |
4221 drain_local_queue(true); | |
4222 drain_global_stack(true); | |
4223 | |
4224 // Read the note on the claim_region() method on why it might | |
4225 // return NULL with potentially more regions available for | |
4226 // claiming and why we have to check out_of_regions() to determine | |
4227 // whether we're done or not. | |
4228 while (!has_aborted() && _curr_region == NULL && !_cm->out_of_regions()) { | |
4229 // We are going to try to claim a new region. We should have | |
4230 // given up on the previous one. | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4231 // Separated the asserts so that we know which one fires. |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4232 assert(_curr_region == NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4233 assert(_finger == NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4234 assert(_region_limit == NULL, "invariant"); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4235 if (_cm->verbose_low()) { |
342 | 4236 gclog_or_tty->print_cr("[%d] trying to claim a new region", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4237 } |
342 | 4238 HeapRegion* claimed_region = _cm->claim_region(_task_id); |
4239 if (claimed_region != NULL) { | |
4240 // Yes, we managed to claim one | |
4241 statsOnly( ++_regions_claimed ); | |
4242 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4243 if (_cm->verbose_low()) { |
342 | 4244 gclog_or_tty->print_cr("[%d] we successfully claimed " |
4245 "region "PTR_FORMAT, | |
4246 _task_id, claimed_region); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4247 } |
342 | 4248 |
4249 setup_for_region(claimed_region); | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4250 assert(_curr_region == claimed_region, "invariant"); |
342 | 4251 } |
4252 // It is important to call the regular clock here. It might take | |
4253 // a while to claim a region if, for example, we hit a large | |
4254 // block of empty regions. So we need to call the regular clock | |
4255 // method once round the loop to make sure it's called | |
4256 // frequently enough. | |
4257 regular_clock_call(); | |
4258 } | |
4259 | |
4260 if (!has_aborted() && _curr_region == NULL) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4261 assert(_cm->out_of_regions(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4262 "at this point we should be out of regions"); |
342 | 4263 } |
4264 } while ( _curr_region != NULL && !has_aborted()); | |
4265 | |
4266 if (!has_aborted()) { | |
4267 // We cannot check whether the global stack is empty, since other | |
343
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4268 // tasks might be pushing objects to it concurrently. We also cannot |
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4269 // check if the region stack is empty because if a thread is aborting |
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4270 // it can push a partially done region back. |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4271 assert(_cm->out_of_regions(), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4272 "at this point we should be out of regions"); |
342 | 4273 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4274 if (_cm->verbose_low()) { |
342 | 4275 gclog_or_tty->print_cr("[%d] all regions claimed", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4276 } |
342 | 4277 |
4278 // Try to reduce the number of available SATB buffers so that | |
4279 // remark has less work to do. | |
4280 drain_satb_buffers(); | |
4281 } | |
4282 | |
4283 // Since we've done everything else, we can now totally drain the | |
4284 // local queue and global stack. | |
4285 drain_local_queue(false); | |
4286 drain_global_stack(false); | |
4287 | |
4288 // Attempt at work stealing from other task's queues. | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4289 if (do_stealing && !has_aborted()) { |
342 | 4290 // We have not aborted. This means that we have finished all that |
4291 // we could. Let's try to do some stealing... | |
4292 | |
4293 // We cannot check whether the global stack is empty, since other | |
343
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4294 // tasks might be pushing objects to it concurrently. We also cannot |
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4295 // check if the region stack is empty because if a thread is aborting |
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4296 // it can push a partially done region back. |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4297 assert(_cm->out_of_regions() && _task_queue->size() == 0, |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4298 "only way to reach here"); |
342 | 4299 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4300 if (_cm->verbose_low()) { |
342 | 4301 gclog_or_tty->print_cr("[%d] starting to steal", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4302 } |
342 | 4303 |
4304 while (!has_aborted()) { | |
4305 oop obj; | |
4306 statsOnly( ++_steal_attempts ); | |
4307 | |
4308 if (_cm->try_stealing(_task_id, &_hash_seed, obj)) { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4309 if (_cm->verbose_medium()) { |
342 | 4310 gclog_or_tty->print_cr("[%d] stolen "PTR_FORMAT" successfully", |
4311 _task_id, (void*) obj); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4312 } |
342 | 4313 |
4314 statsOnly( ++_steals ); | |
4315 | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4316 assert(_nextMarkBitMap->isMarked((HeapWord*) obj), |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4317 "any stolen object should be marked"); |
342 | 4318 scan_object(obj); |
4319 | |
4320 // And since we're towards the end, let's totally drain the | |
4321 // local queue and global stack. | |
4322 drain_local_queue(false); | |
4323 drain_global_stack(false); | |
4324 } else { | |
4325 break; | |
4326 } | |
4327 } | |
4328 } | |
4329 | |
3316
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4330 // If we are about to wrap up and go into termination, check if we |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4331 // should raise the overflow flag. |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4332 if (do_termination && !has_aborted()) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4333 if (_cm->force_overflow()->should_force()) { |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4334 _cm->set_has_overflown(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4335 regular_clock_call(); |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4336 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4337 } |
cd8e33b2a8ad
7034139: G1: assert(Thread::current()->is_ConcurrentGC_thread()) failed: only a conc GC thread can call this.
tonyp
parents:
2436
diff
changeset
|
4338 |
342 | 4339 // We still haven't aborted. Now, let's try to get into the |
4340 // termination protocol. | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4341 if (do_termination && !has_aborted()) { |
342 | 4342 // We cannot check whether the global stack is empty, since other |
343
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4343 // tasks might be concurrently pushing objects on it. We also cannot |
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4344 // check if the region stack is empty because if a thread is aborting |
afc1ce1efe66
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov
parents:
342
diff
changeset
|
4345 // it can push a partially done region back. |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4346 // Separated the asserts so that we know which one fires. |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4347 assert(_cm->out_of_regions(), "only way to reach here"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4348 assert(_task_queue->size() == 0, "only way to reach here"); |
342 | 4349 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4350 if (_cm->verbose_low()) { |
342 | 4351 gclog_or_tty->print_cr("[%d] starting termination protocol", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4352 } |
342 | 4353 |
4354 _termination_start_time_ms = os::elapsedVTime() * 1000.0; | |
4355 // The CMTask class also extends the TerminatorTerminator class, | |
4356 // hence its should_exit_termination() method will also decide | |
4357 // whether to exit the termination protocol or not. | |
4358 bool finished = _cm->terminator()->offer_termination(this); | |
4359 double termination_end_time_ms = os::elapsedVTime() * 1000.0; | |
4360 _termination_time_ms += | |
4361 termination_end_time_ms - _termination_start_time_ms; | |
4362 | |
4363 if (finished) { | |
4364 // We're all done. | |
4365 | |
4366 if (_task_id == 0) { | |
4367 // let's allow task 0 to do this | |
4368 if (concurrent()) { | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4369 assert(_cm->concurrent_marking_in_progress(), "invariant"); |
342 | 4370 // we need to set this to false before the next |
4371 // safepoint. This way we ensure that the marking phase | |
4372 // doesn't observe any more heap expansions. | |
4373 _cm->clear_concurrent_marking_in_progress(); | |
4374 } | |
4375 } | |
4376 | |
4377 // We can now guarantee that the global stack is empty, since | |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4378 // all other tasks have finished. We separated the guarantees so |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4379 // that, if a condition is false, we can immediately find out |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4380 // which one. |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4381 guarantee(_cm->out_of_regions(), "only way to reach here"); |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
4382 guarantee(_aborted_region.is_empty(), "only way to reach here"); |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4383 guarantee(_cm->region_stack_empty(), "only way to reach here"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4384 guarantee(_cm->mark_stack_empty(), "only way to reach here"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4385 guarantee(_task_queue->size() == 0, "only way to reach here"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4386 guarantee(!_cm->has_overflown(), "only way to reach here"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4387 guarantee(!_cm->mark_stack_overflow(), "only way to reach here"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4388 guarantee(!_cm->region_stack_overflow(), "only way to reach here"); |
342 | 4389 |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4390 if (_cm->verbose_low()) { |
342 | 4391 gclog_or_tty->print_cr("[%d] all tasks terminated", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4392 } |
342 | 4393 } else { |
4394 // Apparently there's more work to do. Let's abort this task. It | |
4395 // will restart it and we can hopefully find more things to do. | |
4396 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4397 if (_cm->verbose_low()) { |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4398 gclog_or_tty->print_cr("[%d] apparently there is more work to do", |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4399 _task_id); |
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4400 } |
342 | 4401 |
4402 set_has_aborted(); | |
4403 statsOnly( ++_aborted_termination ); | |
4404 } | |
4405 } | |
4406 | |
4407 // Mainly for debugging purposes to make sure that a pointer to the | |
4408 // closure which was statically allocated in this frame doesn't | |
4409 // escape it by accident. | |
3771 | 4410 set_cm_oop_closure(NULL); |
342 | 4411 double end_time_ms = os::elapsedVTime() * 1000.0; |
4412 double elapsed_time_ms = end_time_ms - _start_time_ms; | |
4413 // Update the step history. | |
4414 _step_times_ms.add(elapsed_time_ms); | |
4415 | |
4416 if (has_aborted()) { | |
4417 // The task was aborted for some reason. | |
4418 | |
4419 statsOnly( ++_aborted ); | |
4420 | |
2174
234761c55641
6608385: G1: need to support parallel reference processing
johnc
parents:
2152
diff
changeset
|
4421 if (_has_timed_out) { |
342 | 4422 double diff_ms = elapsed_time_ms - _time_target_ms; |
4423 // Keep statistics of how well we did with respect to hitting | |
4424 // our target only if we actually timed out (if we aborted for | |
4425 // other reasons, then the results might get skewed). | |
4426 _marking_step_diffs_ms.add(diff_ms); | |
4427 } | |
4428 | |
4429 if (_cm->has_overflown()) { | |
4430 // This is the interesting one. We aborted because a global | |
4431 // overflow was raised. This means we have to restart the | |
4432 // marking phase and start iterating over regions. However, in | |
4433 // order to do this we have to make sure that all tasks stop | |
4434 // what they are doing and re-initialise in a safe manner. We | |
4435 // will achieve this with the use of two barrier sync points. | |
4436 | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4437 if (_cm->verbose_low()) { |
342 | 4438 gclog_or_tty->print_cr("[%d] detected overflow", _task_id); |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4439 } |
342 | 4440 |
4441 _cm->enter_first_sync_barrier(_task_id); | |
4442 // When we exit this sync barrier we know that all tasks have | |
4443 // stopped doing marking work. So, it's now safe to | |
4444 // re-initialise our data structures. At the end of this method, | |
4445 // task 0 will clear the global data structures. | |
4446 | |
4447 statsOnly( ++_aborted_overflow ); | |
4448 | |
4449 // We clear the local state of this task... | |
4450 clear_region_fields(); | |
4451 | |
4452 // ...and enter the second barrier. | |
4453 _cm->enter_second_sync_barrier(_task_id); | |
4454 // At this point everything has bee re-initialised and we're | |
4455 // ready to restart. | |
4456 } | |
4457 | |
4458 if (_cm->verbose_low()) { | |
4459 gclog_or_tty->print_cr("[%d] <<<<<<<<<< ABORTING, target = %1.2lfms, " | |
4460 "elapsed = %1.2lfms <<<<<<<<<<", | |
4461 _task_id, _time_target_ms, elapsed_time_ms); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4462 if (_cm->has_aborted()) { |
342 | 4463 gclog_or_tty->print_cr("[%d] ========== MARKING ABORTED ==========", |
4464 _task_id); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4465 } |
342 | 4466 } |
4467 } else { | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4468 if (_cm->verbose_low()) { |
342 | 4469 gclog_or_tty->print_cr("[%d] <<<<<<<<<< FINISHED, target = %1.2lfms, " |
4470 "elapsed = %1.2lfms <<<<<<<<<<", | |
4471 _task_id, _time_target_ms, elapsed_time_ms); | |
3776
23d434c6290d
7055073: G1: code cleanup in the concurrentMark.* files
tonyp
parents:
3772
diff
changeset
|
4472 } |
342 | 4473 } |
4474 | |
4475 _claimed = false; | |
4476 } | |
4477 | |
4478 CMTask::CMTask(int task_id, | |
4479 ConcurrentMark* cm, | |
4480 CMTaskQueue* task_queue, | |
4481 CMTaskQueueSet* task_queues) | |
4482 : _g1h(G1CollectedHeap::heap()), | |
4483 _task_id(task_id), _cm(cm), | |
4484 _claimed(false), | |
4485 _nextMarkBitMap(NULL), _hash_seed(17), | |
4486 _task_queue(task_queue), | |
4487 _task_queues(task_queues), | |
3771 | 4488 _cm_oop_closure(NULL), |
1835
4805b9f4779e
6941395: G1: Use only lock-free versions of region stack push() and pop()
johnc
parents:
1833
diff
changeset
|
4489 _aborted_region(MemRegion()) { |
1023
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4490 guarantee(task_queue != NULL, "invariant"); |
11d4857fe5e1
6888619: G1: too many guarantees in concurrent marking
tonyp
parents:
1022
diff
changeset
|
4491 guarantee(task_queues != NULL, "invariant"); |
342 | 4492 |
4493 statsOnly( _clock_due_to_scanning = 0; | |
4494 _clock_due_to_marking = 0 ); | |
4495 | |
4496 _marking_step_diffs_ms.add(0.5); | |
4497 } | |
2435
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4498 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4499 // These are formatting macros that are used below to ensure |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4500 // consistent formatting. The *_H_* versions are used to format the |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4501 // header for a particular value and they should be kept consistent |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4502 // with the corresponding macro. Also note that most of the macros add |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4503 // the necessary white space (as a prefix) which makes them a bit |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4504 // easier to compose. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4505 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4506 // All the output lines are prefixed with this string to be able to |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4507 // identify them easily in a large log file. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4508 #define G1PPRL_LINE_PREFIX "###" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4509 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4510 #define G1PPRL_ADDR_BASE_FORMAT " "PTR_FORMAT"-"PTR_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4511 #ifdef _LP64 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4512 #define G1PPRL_ADDR_BASE_H_FORMAT " %37s" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4513 #else // _LP64 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4514 #define G1PPRL_ADDR_BASE_H_FORMAT " %21s" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4515 #endif // _LP64 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4516 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4517 // For per-region info |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4518 #define G1PPRL_TYPE_FORMAT " %-4s" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4519 #define G1PPRL_TYPE_H_FORMAT " %4s" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4520 #define G1PPRL_BYTE_FORMAT " "SIZE_FORMAT_W(9) |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4521 #define G1PPRL_BYTE_H_FORMAT " %9s" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4522 #define G1PPRL_DOUBLE_FORMAT " %14.1f" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4523 #define G1PPRL_DOUBLE_H_FORMAT " %14s" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4524 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4525 // For summary info |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4526 #define G1PPRL_SUM_ADDR_FORMAT(tag) " "tag":"G1PPRL_ADDR_BASE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4527 #define G1PPRL_SUM_BYTE_FORMAT(tag) " "tag": "SIZE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4528 #define G1PPRL_SUM_MB_FORMAT(tag) " "tag": %1.2f MB" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4529 #define G1PPRL_SUM_MB_PERC_FORMAT(tag) G1PPRL_SUM_MB_FORMAT(tag)" / %1.2f %%" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4530 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4531 G1PrintRegionLivenessInfoClosure:: |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4532 G1PrintRegionLivenessInfoClosure(outputStream* out, const char* phase_name) |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4533 : _out(out), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4534 _total_used_bytes(0), _total_capacity_bytes(0), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4535 _total_prev_live_bytes(0), _total_next_live_bytes(0), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4536 _hum_used_bytes(0), _hum_capacity_bytes(0), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4537 _hum_prev_live_bytes(0), _hum_next_live_bytes(0) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4538 G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4539 MemRegion g1_committed = g1h->g1_committed(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4540 MemRegion g1_reserved = g1h->g1_reserved(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4541 double now = os::elapsedTime(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4542 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4543 // Print the header of the output. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4544 _out->cr(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4545 _out->print_cr(G1PPRL_LINE_PREFIX" PHASE %s @ %1.3f", phase_name, now); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4546 _out->print_cr(G1PPRL_LINE_PREFIX" HEAP" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4547 G1PPRL_SUM_ADDR_FORMAT("committed") |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4548 G1PPRL_SUM_ADDR_FORMAT("reserved") |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4549 G1PPRL_SUM_BYTE_FORMAT("region-size"), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4550 g1_committed.start(), g1_committed.end(), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4551 g1_reserved.start(), g1_reserved.end(), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4552 HeapRegion::GrainBytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4553 _out->print_cr(G1PPRL_LINE_PREFIX); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4554 _out->print_cr(G1PPRL_LINE_PREFIX |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4555 G1PPRL_TYPE_H_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4556 G1PPRL_ADDR_BASE_H_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4557 G1PPRL_BYTE_H_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4558 G1PPRL_BYTE_H_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4559 G1PPRL_BYTE_H_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4560 G1PPRL_DOUBLE_H_FORMAT, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4561 "type", "address-range", |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4562 "used", "prev-live", "next-live", "gc-eff"); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4563 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4564 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4565 // It takes as a parameter a reference to one of the _hum_* fields, it |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4566 // deduces the corresponding value for a region in a humongous region |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4567 // series (either the region size, or what's left if the _hum_* field |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4568 // is < the region size), and updates the _hum_* field accordingly. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4569 size_t G1PrintRegionLivenessInfoClosure::get_hum_bytes(size_t* hum_bytes) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4570 size_t bytes = 0; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4571 // The > 0 check is to deal with the prev and next live bytes which |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4572 // could be 0. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4573 if (*hum_bytes > 0) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4574 bytes = MIN2((size_t) HeapRegion::GrainBytes, *hum_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4575 *hum_bytes -= bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4576 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4577 return bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4578 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4579 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4580 // It deduces the values for a region in a humongous region series |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4581 // from the _hum_* fields and updates those accordingly. It assumes |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4582 // that that _hum_* fields have already been set up from the "starts |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4583 // humongous" region and we visit the regions in address order. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4584 void G1PrintRegionLivenessInfoClosure::get_hum_bytes(size_t* used_bytes, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4585 size_t* capacity_bytes, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4586 size_t* prev_live_bytes, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4587 size_t* next_live_bytes) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4588 assert(_hum_used_bytes > 0 && _hum_capacity_bytes > 0, "pre-condition"); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4589 *used_bytes = get_hum_bytes(&_hum_used_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4590 *capacity_bytes = get_hum_bytes(&_hum_capacity_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4591 *prev_live_bytes = get_hum_bytes(&_hum_prev_live_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4592 *next_live_bytes = get_hum_bytes(&_hum_next_live_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4593 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4594 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4595 bool G1PrintRegionLivenessInfoClosure::doHeapRegion(HeapRegion* r) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4596 const char* type = ""; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4597 HeapWord* bottom = r->bottom(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4598 HeapWord* end = r->end(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4599 size_t capacity_bytes = r->capacity(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4600 size_t used_bytes = r->used(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4601 size_t prev_live_bytes = r->live_bytes(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4602 size_t next_live_bytes = r->next_live_bytes(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4603 double gc_eff = r->gc_efficiency(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4604 if (r->used() == 0) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4605 type = "FREE"; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4606 } else if (r->is_survivor()) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4607 type = "SURV"; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4608 } else if (r->is_young()) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4609 type = "EDEN"; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4610 } else if (r->startsHumongous()) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4611 type = "HUMS"; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4612 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4613 assert(_hum_used_bytes == 0 && _hum_capacity_bytes == 0 && |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4614 _hum_prev_live_bytes == 0 && _hum_next_live_bytes == 0, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4615 "they should have been zeroed after the last time we used them"); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4616 // Set up the _hum_* fields. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4617 _hum_capacity_bytes = capacity_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4618 _hum_used_bytes = used_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4619 _hum_prev_live_bytes = prev_live_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4620 _hum_next_live_bytes = next_live_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4621 get_hum_bytes(&used_bytes, &capacity_bytes, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4622 &prev_live_bytes, &next_live_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4623 end = bottom + HeapRegion::GrainWords; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4624 } else if (r->continuesHumongous()) { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4625 type = "HUMC"; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4626 get_hum_bytes(&used_bytes, &capacity_bytes, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4627 &prev_live_bytes, &next_live_bytes); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4628 assert(end == bottom + HeapRegion::GrainWords, "invariant"); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4629 } else { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4630 type = "OLD"; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4631 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4632 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4633 _total_used_bytes += used_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4634 _total_capacity_bytes += capacity_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4635 _total_prev_live_bytes += prev_live_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4636 _total_next_live_bytes += next_live_bytes; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4637 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4638 // Print a line for this particular region. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4639 _out->print_cr(G1PPRL_LINE_PREFIX |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4640 G1PPRL_TYPE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4641 G1PPRL_ADDR_BASE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4642 G1PPRL_BYTE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4643 G1PPRL_BYTE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4644 G1PPRL_BYTE_FORMAT |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4645 G1PPRL_DOUBLE_FORMAT, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4646 type, bottom, end, |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4647 used_bytes, prev_live_bytes, next_live_bytes, gc_eff); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4648 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4649 return false; |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4650 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4651 |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4652 G1PrintRegionLivenessInfoClosure::~G1PrintRegionLivenessInfoClosure() { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4653 // Print the footer of the output. |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4654 _out->print_cr(G1PPRL_LINE_PREFIX); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4655 _out->print_cr(G1PPRL_LINE_PREFIX |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4656 " SUMMARY" |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4657 G1PPRL_SUM_MB_FORMAT("capacity") |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4658 G1PPRL_SUM_MB_PERC_FORMAT("used") |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4659 G1PPRL_SUM_MB_PERC_FORMAT("prev-live") |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4660 G1PPRL_SUM_MB_PERC_FORMAT("next-live"), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4661 bytes_to_mb(_total_capacity_bytes), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4662 bytes_to_mb(_total_used_bytes), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4663 perc(_total_used_bytes, _total_capacity_bytes), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4664 bytes_to_mb(_total_prev_live_bytes), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4665 perc(_total_prev_live_bytes, _total_capacity_bytes), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4666 bytes_to_mb(_total_next_live_bytes), |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4667 perc(_total_next_live_bytes, _total_capacity_bytes)); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4668 _out->cr(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2369
diff
changeset
|
4669 } |