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