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