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